Exact Diagonal Completion on Reachable Subspaces: Application to QAOA Placement
quant-ph, cs.AR, cs.ET
Submitted: 2026-09-30
Updated: 2026-09-30
Terminology
Sources
- Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
- Improving Variational Quantum Optimization using CVaR
- Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
- Domain wall encoding of discrete variables for quantum annealing and QAOA
- Warm-starting quantum optimization
- A Quantum Approximate Optimization Algorithm
- Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components
- Constrained mixers for the quantum approximate optimization algorithm
- FPGA-Placement via Quantum Annealing
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum computing with Qiskit
- Graph-controlled Permutation Mixers in QAOA for the Flexible Job-Shop Problem
- Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
- Path Matters: Industrial Data Meet Quantum Optimization
- Synthesis of Quantum Logic Circuits
- Quantum Circuits for Incompletely Specified Two-Qubit Operators
- $XY$-mixers: analytical and numerical results for QAOA
- Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity