Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemes
Glen Bigan Mbeng, Rosario Fazio, Giuseppe Santoro

TL;DR
This paper explores the connections between digitized Quantum Annealing, QAOA, and quantum control, providing bounds on performance and demonstrating how optimized digitized-QA protocols can be constructed and analyzed.
Contribution
It introduces a rigorous performance bound for QAOA on MaxCut and shows how digitized-QA protocols can be optimized and interpreted as adiabatic processes.
Findings
Established a lower bound on residual energy for QAOA depth-P circuits
Demonstrated that optimal digitized-QA schedules are adiabatic and can be constructed explicitly
Connected digitized-QA, QAOA, and quantum control through theoretical analysis
Abstract
We establish and discuss a number of connections between a digitized version of Quantum Annealing (QA) with the Quantum Approximate Optimization Algorithm (QAOA) introduced by Farhi et al. (arXiv:1411.4028) as an alternative hybrid quantum-classical variational scheme for quantum-state preparation and optimization. We introduce a technique that allows to prove, for instance, a rigorous bound concerning the performance of QAOA for MaxCut on a -regular graph, equivalent to an unfrustrated antiferromagnetic Ising chain. The bound shows that the optimal variational error of a depth- quantum circuit has to satisfy . In a separate work (Mbeng et al., arXiv:1911.12259) we have explicitly shown, exploiting a Jordan-Wigner transformation, that among the degenerate variational minima which can be found for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
