A New Scaling Function for QAOA Tensor Network Simulations
Goro Miki, Yasuhiro Tokura

TL;DR
This paper introduces a new scaling function for tensor network simulations of QAOA, revealing relationships between entanglement and algorithm performance, and extending existing scaling relations.
Contribution
It proposes a novel scaling function for tensor network simulations of QAOA and explores entanglement's role in quantum algorithm performance.
Findings
Scaling relations hold with entanglement entropy as the axis
A new scaling function for tensor network simulations is proposed
Insights into entanglement behavior during QAOA are uncovered
Abstract
With the rapid development of quantum computers in recent years, the importance of performance evaluation in quantum algorithms has been increasing. One method that has gained attention for performing this evaluation on classical computers is tensor networks. Tensor networks not only reduce the computational cost required for simulations by using approximations but are also deeply connected to entanglement. Entanglement is one of the most important elements for the quantum advantages of quantum algorithms, but the direct relationship between quantum advantages and entanglement remains largely unexplored. Tensor networks are promising as a means to address this question. In this study, we focus on the entanglement in the Quantum Approximate Optimization Algorithm (QAOA). This study aims to investigate entanglement in QAOA by examining the relationship between the approximation rates of…
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 · Quantum many-body systems · Quantum Information and Cryptography
