1Center for Complex Quantum Systems, University of Texas at Austin, Austin, TX 78712, USA
2Department of Computer Science, University of Texas at Austin, Austin, TX 78712, USA
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
Abstract
We present a general framework for modifying quantum approximate optimization algorithms (QAOA) to solve constrained network flow problems. By exploiting an analogy between flow-constraints and Gauss’ law for electromagnetism, we design lattice quantum electrodynamics (QED)- inspired mixing Hamiltonians that preserve flow constraints throughout the QAOA process. This results in an exponential reduction in the size of the configuration space that needs to be explored, which we show through numerical simulations, yields higher quality approximate solutions compared to the original QAOA routine. We outline a specific implementation for edge-disjoint path (EDP) problems related to traffic congestion minimization, numerically analyze the effect of initial state choice, and explore trade-offs between circuit complexity and qubit resources via a particle-vortex duality mapping. Comparing the effect of initial states reveals that starting with an ergodic (unbiased) superposition of solutions yields better performance than beginning with the mixer ground-state, suggesting a departure from the “short-cut to adiabaticity” mechanism often used to motivate QAOA.
► BibTeX data
► References
[1] Quantum supremacy using a programmable superconducting processor. Nature, 574: 505–510, 2019. https://doi.org/10.1038/s41586-019-1666-5.
https://doi.org/10.1038/s41586-019-1666-5
[2] Boaz Barak, Ankur Moitra, Ryan O’Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, and John Wright. Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR, abs/1505.03424, 2015. URL http://arxiv.org/abs/1505.03424.
arXiv:1505.03424
[3] Richard Bellman. On a routing problem. Quarterly of applied mathematics, 16 (1): 87–90, 1958.
[4] Dominic W. Berry, Andrew M. Childs, and Robin Kothari. Hamiltonian simulation with nearly optimal dependence on all parameters. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, Oct 2015. https://doi.org/10.1109/focs.2015.54. URL http://dx.doi.org/10.1109/FOCS.2015.54.
https://doi.org/10.1109/focs.2015.54
[5] Sergey Bravyi, Alexander Kliesch, Robert Koenig, and Eugene Tang. Obstacles to variational quantum optimization from symmetry protection, Dec 2020. URL https://doi.org/10.1103/PhysRevLett.125.260505.
https://doi.org/10.1103/PhysRevLett.125.260505
[6] Julia Chuzhoy and Shi Li. A polylogarithmic approximation algorithm for edge-disjoint paths with congestion 2. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pages 233–242, 2012. 10.1109/FOCS.2012.54.
https://doi.org/10.1109/FOCS.2012.54
[7] Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. Computational geometry: algorithms and applications, 3rd Edition. Springer, 2008. ISBN 9783540779735. URL http://www.worldcat.org/oclc/227584184.
http://www.worldcat.org/oclc/227584184
[8] Edsger W Dijkstra et al. A note on two problems in connexion with graphs. Numerische mathematik, 1 (1): 269–271, 1959.
[9] Shimon Even, Alon Itai, and Adi Shamir. “on the complexity of time table and multi-commodity flow problems”. In 16th Annual Symposium on Foundations of Computer Science (sfcs 1975), pages 184–193. IEEE, 1975. https://doi.org/10.1137/0205048.
https://doi.org/10.1137/0205048
[10] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A Quantum Approximate Optimization Algorithm. arXiv e-prints, art. arXiv:1411.4028, November 2014. URL https://ui.adsabs.harvard.edu/abs/2014arXiv1411.4028F.
arXiv:1411.4028
[11] Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum approximate optimization algorithm applied to a bounded occurrence constraint problem, 2014. URL https://arxiv.org/abs/1412.6062.
arXiv:1412.6062
[12] Edward Farhi, David Gamarnik, and Sam Gutmann. The quantum approximate optimization algorithm needs to see the whole graph: Worst case examples, 2020a. URL https://arxiv.org/abs/2005.08747.
arXiv:2005.08747
[13] Edward Farhi, David Gamarnik, and Sam Gutmann. The quantum approximate optimization algorithm needs to see the whole graph: A typical case, 2020b. URL https://arxiv.org/abs/2004.09002.
arXiv:2004.09002
[14] Matthew P. A. Fisher. Chapter 13 duality in low dimensional quantum field theories. 2018. https://doi.org/10.1007/978-1-4020-3463-3_13.
https://doi.org/10.1007/978-1-4020-3463-3_13
[15] Roger Fletcher. Practical methods of optimization. John Wiley & Sons, 2013.
[16] Lov K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, page 212–219, New York, NY, USA, 1996. Association for Computing Machinery. ISBN 0897917855. 10.1145/237814.237866.
https://doi.org/10.1145/237814.237866
[17] Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G Rieffel, Davide Venturelli, and Rupak Biswas. From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms, 12 (2): 34, 2019. 10.3390/a12020034.
https://doi.org/10.3390/a12020034
[18] Thomas C Hales. The jordan curve theorem, formally and informally. The American Mathematical Monthly, 114 (10): 882–894, 2007. https://doi.org/10.1080/00029890.2007.11920481.
https://doi.org/10.1080/00029890.2007.11920481
[19] Matthew B Hastings. Classical and quantum bounded depth approximation algorithms. arXiv preprint arXiv:1905.07047, 2019. https://doi.org/10.26421/QIC19.13-14-3.
https://doi.org/10.26421/QIC19.13-14-3
arXiv:1905.07047
[20] KR Khadiev and LI Safina. Quantum algorithm for shortest path search in directed acyclic graph. Moscow University Computational Mathematics and Cybernetics, 43 (1): 47–51, 2019. https://doi.org/10.3103/S0278641919010023.
https://doi.org/10.3103/S0278641919010023
[21] D. Marcos, P. Widmer, E. Rico, M. Hafezi, P. Rabl, U.-J. Wiese, and P. Zoller. Two-dimensional lattice gauge theories with superconducting quantum circuits. Annals of Physics, 351: 634–654, Dec 2014. ISSN 0003-4916. 10.1016/j.aop.2014.09.011.
https://doi.org/10.1016/j.aop.2014.09.011
[22] Peter W Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science, pages 124–134. Ieee, 1994. 10.1109/SFCS.1994.365700.
https://doi.org/10.1109/SFCS.1994.365700
[23] Zhihui Wang, Nicholas C Rubin, Jason M Dominy, and Eleanor G Rieffel. $xy$ mixers: Analytical and numerical results for the quantum alternating operator ansatz. Physical Review A, 101 (1): 012320, 2020. 10.1103/PhysRevA.101.012320.
https://doi.org/10.1103/PhysRevA.101.012320
Cited by
[1] Bobak Toussi Kiani, Giacomo De Palma, Milad Marvian, Zi-Wen Liu, and Seth Lloyd, “Quantum Earth Mover’s Distance: A New Approach to Learning Quantum Data”, arXiv:2101.03037.
The above citations are from SAO/NASA ADS (last updated successfully 2021-07-27 13:33:47). The list may be incomplete as not all publishers provide suitable and complete citation data.
Could not fetch Crossref cited-by data during last attempt 2021-07-27 13:33:45: Could not fetch cited-by data for 10.22331/q-2021-07-27-510 from Crossref. This is normal if the DOI was registered recently.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.
PlatoAi. Web3 Reimagined. Data Intelligence Amplified.
Click here to access.
Source: https://quantum-journal.org/papers/q-2021-07-27-510/
