Genuine Multipartite Entanglement in Quantum Optimization
Preprint
Abstract
The ability to generate bipartite entanglement in quantum computing technologies is widely regarded as pivotal. However, the role of genuinely multipartite entanglement is much less understood than bipartite entanglement, particularly in the context of solving complicated optimization problems using quantum devices. It is thus crucial from both the algorithmic and hardware standpoints to understand whether multipartite entanglement contributes to achieving a good solution. Here, we tackle this challenge by analyzing genuine multipartite entanglement -- quantified by the generalized geometric measure -- generated in Trotterized quantum annealing and the quantum approximate optimization algorithm. Using numerical benchmarks, we analyze its occurrence in the annealing schedule in detail. We observe a multipartite-entanglement barrier, and we explore how it correlates to the algorithm's success. We also prove how multipartite entanglement provides an upper bound to the overlap of the instantaneous state with an exact solution. Vice versa, the overlaps to the initial and final product states, which can be easily measured experimentally, offer upper bounds for the multipartite entanglement during the entire schedule. Our results help to shed light on how complex quantum correlations come to bear as a resource in quantum optimization.Keywords
All Related Versions
This publication has 55 references indexed in Scilit:
- Challenges and opportunities in quantum optimizationNature Reviews Physics, 2024
- Quantum discord and its allies: a review of recent progressReports on Progress in Physics, 2017
- Measuring multipartite entanglement through dynamic susceptibilitiesNature Physics, 2016
- Computational multiqubit tunnelling in programmable quantum annealersNature Communications, 2016
- Anderson localization makes adiabatic quantum optimization failProceedings of the National Academy of Sciences, 2010
- Measurement-based quantum computationNature Physics, 2009
- Review on the study of entanglement in quantum computation speedupChinese Science Bulletin, 2007
- Quantum computing without entanglementTheoretical Computer Science, 2004
- Monotones and invariants for multi-particle quantum statesJournal of Physics A: General Physics, 2001
- Quantum Effects in Algorithms1999