Paper Citation Record · LEDGER

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips

As of 22 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2509.00170.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2509.00170 v1

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T16:53:33.456592Z

measured 33 of 33 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-21T06:32:19.484+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

33 of 33 outbound references displayed

verified exact0
verified fuzzy23
unresolved9
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation fe7ed794-d59e-4650-ad3b-3eb1e60d6829 · outbound

This paper cites an unresolved cited work.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-15T16:53:34.931487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 777c20b9-e5c0-44ae-8ed4-14c0a7afec9a · outbound

This paper cites These operations interact through the identity: X† jσz iσz jXj =−σz iσz j.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips These operations interact through the identity: X† jσz iσz jXj =−σz iσz j

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.883986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 4fd87fc0-6523-4e0e-a4e9-04ac2aa1abf8 · outbound

This paper cites an unresolved cited work.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-15T16:53:34.869200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5c0d0947-19c6-402b-9e8c-55406caf5666 · outbound

This paper cites an unresolved cited work.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Unresolved cited work

Reference 4

Resolution: unresolved; raw_fallback, observed 2026-08-15T16:53:34.854530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation aadf426d-69b8-4d8f-8d02-52d0dec2913e · outbound

This paper cites Then A =   1 −1 −1 1  ⊙ J =pp⊤⊙ J, for p = [1|S| − 1n−|S|].

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Then A =   1 −1 −1 1  ⊙ J =pp⊤⊙ J, for p = [1|S| − 1n−|S|]

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.808238Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation a2960e5b-7605-47b3-b75b-614e0d7b4f5c · outbound

This paper cites an unresolved cited work.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-15T16:53:34.667329Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation c00d7f1b-9a2e-4ade-bc34-946dd68df788 · outbound

This paper cites Next, we characterize graphs with gc(G) = 2 and gc(G) = 3.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Next, we characterize graphs with gc(G) = 2 and gc(G) = 3

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.652477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 59c362f0-1ec8-4975-a8b2-2f2ffed42422 · outbound

This paper cites Since each perfect matching can be constructed using n 2 + 1 spin bicliques (one of which is Kn), the entire cycle can be constructed using n + 1 spin bicliques.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Since each perfect matching can be constructed using n 2 + 1 spin bicliques (one of which is Kn), the entire cycle can be constructed using n + 1 spin bicliques

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.637861Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 7425384a-9554-4a5b-9647-dcada8ac9edf · outbound

This paper cites Let G1 consist of edges e1,e 3,...,e n−2, G2 of e2,e 4,...,e n−1, and G3 of the single edge en.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Let G1 consist of edges e1,e 3,...,e n−2, G2 of e2,e 4,...,e n−1, and G3 of the single edge en

Reference 9

Resolution: malformed identifier; raw_fallback, observed 2026-08-15T16:53:34.622295Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 06de95c7-334f-4da0-a009-0b2654edd888 · outbound

This paper cites Quadratic reformulations of nonlinear binary optimization problems.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Quadratic reformulations of nonlinear binary optimization problems

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.439537Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 82f48438-ad97-42c4-bda0-3dbc696108fa · outbound

This paper cites Graph theory.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Graph theory

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.325095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 551a68d2-1cd8-4f64-b14a-2f9de906cf18 · outbound

This paper cites Obstacles to variational quantum optimization from symmetry protection.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Obstacles to variational quantum optimization from symmetry protection

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.311245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3b11cc5a-1c9d-4249-ae90-2ba42ba8f074 · outbound

This paper cites Spectra of graphs.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Spectra of graphs

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.296946Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 1d7c3dfe-1d8a-45ea-a34b-d0933cbd6008 · outbound

This paper cites Solving clique partitioning problems: a comparison of models and commercial solvers.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Solving clique partitioning problems: a comparison of models and commercial solvers

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.264586Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation f23da278-64c9-4963-af0f-c0ce4046ed88 · outbound

This paper cites The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-15T16:53:33.058344Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 39a988fd-993e-47b4-8bd7-1239c87ef01b · outbound

This paper cites A Quantum Approximate Optimization Algorithm.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips A Quantum Approximate Optimization Algorithm

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-15T16:53:33.066486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2757c9d5-289d-4d21-bfa5-00a91f46d373 · outbound

This paper cites Quantum bridge analytics I: a tutorial on formulating and using qubo models.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Quantum bridge analytics I: a tutorial on formulating and using qubo models

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.187911Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 58682cf5-a0dd-4fcb-ae97-022e8b922743 · outbound

This paper cites Rydberg-mediated entanglement in a two-dimensional neutral atom qubit array.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Rydberg-mediated entanglement in a two-dimensional neutral atom qubit array

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.173584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 9c497769-5be8-4c50-96ce-226c5accf7b3 · outbound

This paper cites Hadamard matrices and their applications.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Hadamard matrices and their applications

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.159696Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation ac6e9caf-d13b-44a5-b683-d48b6da071e9 · outbound

This paper cites Quantum computing with neutral atoms.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Quantum computing with neutral atoms

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.144323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 01f57688-b083-4e40-875c-af98e666779c · outbound

This paper cites Reducibility among combinatorial problems.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Reducibility among combinatorial problems

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-15T16:53:33.229946Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 165f6e56-ab91-4021-be5f-db511776d941 · outbound

This paper cites Practical guidelines for solving difficult mixed integer linear programs.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Practical guidelines for solving difficult mixed integer linear programs

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.075314Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 5830591a-8697-41bb-8c7a-b02bf4191a35 · outbound

This paper cites A unified framework for modeling and solving combi- natorial optimization problems: A tutorial.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips A unified framework for modeling and solving combi- natorial optimization problems: A tutorial

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.015612Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 3f57b1e9-82aa-4874-be11-68d041b1ce99 · outbound

This paper cites High-fidelity control and entanglement of rydberg-atom qubits.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips High-fidelity control and entanglement of rydberg-atom qubits

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:34.001141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 73ddbaa6-e410-402e-9129-273b165e1860 · outbound

This paper cites Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-15T16:53:33.272725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11bc6a30-08f2-475c-a326-d38bee46b93a · outbound

This paper cites A quantum annealer with fully pro- grammable all-to-all coupling via floquet engineering.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips A quantum annealer with fully pro- grammable all-to-all coupling via floquet engineering

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.986087Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 77cea187-79b8-44a2-a95a-fabc6ce94151 · outbound

This paper cites The boolean quadric polytope: some characteristics, facets and relatives.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips The boolean quadric polytope: some characteristics, facets and relatives

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.950884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation fe6ddbd5-591c-46e6-97cf-ad1f8ae59d8b · outbound

This paper cites Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Quantum approximate optimization of the long-range ising model with a trapped-ion quantum simulator

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.909484Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 260cf1f7-d0f5-49d8-8065-7c570944ac48 · outbound

This paper cites Quantum Computing in the NISQ era and beyond.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Quantum Computing in the NISQ era and beyond

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-15T16:53:33.435087Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aceda605-e4a9-4789-bb88-7c99f322777f · outbound

This paper cites Generat- ing target graph couplings for the quantum approximate optimization algorithm from native quantum hardware couplings.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Generat- ing target graph couplings for the quantum approximate optimization algorithm from native quantum hardware couplings

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.884555Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 51658a1a-544a-4068-a8b7-01e5230c9080 · outbound

This paper cites Introduction to Linear Algebra.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Introduction to Linear Algebra

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.838229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2c92e8f5-8ae9-4f59-9801-f63fa8cde1e6 · outbound

This paper cites Experimental realization of shor’s quantum factoring algo- rithm using nuclear magnetic resonance.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Experimental realization of shor’s quantum factoring algo- rithm using nuclear magnetic resonance

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.751875Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Observation 2da951a8-aafb-4d6f-8b15-3682ccd48d5f · outbound

This paper cites Emulating many-body localization with a superconducting quantum processor.

Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips Emulating many-body localization with a superconducting quantum processor

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T16:53:33.734828Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.

Pith citing papers

No inbound Pith citation observations are available.