7 papers
Optimization Using Locally-Quantum Decoders
Noah Shutty, Avijit Mandal, Seyoon Ragavan +8
It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related t…
Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
Anuj Apte, Sami Boulebnane, Yuwei Jin +3
Quantum algorithms for binary optimization problems have been the subject of extensive study. However, the application of quantum algorithms to integer optimization problems remain…
Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
Anuj Apte, Shree Hari Sureshbabu, Ruslan Shaydulin +5
Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a…
Spin-Boson Mapping of the Quantum Approximate Optimization Algorithm
Sami Boulebnane, Abid Khan, Minzhao Liu +4
The Quantum Approximate Optimization Algorithm (QAOA) achieves monotonically improving performance with circuit depth , yet the study of the high-depth regime has been obstructe…
Quantum Approximate Optimization Algorithm in Finite Size and Large Depth and Equivalence to Quantum Annealing
Sami Boulebnane, James Sud, Ruslan Shaydulin +1
The quantum approximate optimization algorithm (QAOA) and quantum annealing are two of the most popular quantum optimization heuristics. While QAOA is known to be able to approxima…
Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
Sivaprasad Omanakuttan, Zichang He, Zhiwei Zhang +9
Optimization is often cited as a promising application of quantum computers. However, the low degree of provable quantum speedups has led prior rigorous end-to-end resource analyse…