Quantum-echo Markov process for combinatorial optimization
quant-ph, cond-mat.dis-nn, cond-mat.stat-mech
Submitted: 2026-09-30
Updated: 2026-09-30
Terminology
Sources
- A Quantum Approximate Optimization Algorithm
- Classical and Quantum Bounded Depth Approximation Algorithms
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
- The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
- Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
- Analog-Digital Quantum Computing with Quantum Annealing Processors
- Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemes
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