Information scrambling and entanglement in quantum approximate optimization algorithm circuits
arXiv:2301.07445 · doi:10.1140/epjp/s13360-023-04801-9
Abstract
Variational quantum algorithms, which consist of optimal parameterized quantum circuits, are promising for demonstrating quantum advantages in the noisy intermediate-scale quantum (NISQ) era. Apart from classical computational resources, different kinds of quantum resources have their contributions to the process of computing, such as information scrambling and entanglement. Characterizing the relation between the complexity of specific problems and quantum resources consumed by solving these problems is helpful for us to understand the structure of VQAs in the context of quantum information processing. In this work, we focus on the quantum approximate optimization algorithm (QAOA), which aims to solve combinatorial optimization problems. We study information scrambling and entanglement in QAOA circuits, respectively, and discover that for a harder problem, more quantum resource is required for the QAOA circuit to obtain the solution in most cases. We note that in the future, our results can be used to benchmark the complexity of quantum many-body problems by information scrambling or entanglement accumulation in the computing process.
11 pages, 12 figures
References in corpus (33)
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Topological entanglement entropy
- Many-body localization, thermalization, and entanglement
- Quantum Resource Theories
- Dynamics of a Quantum Phase Transition and Relaxation to a Steady State
- Chaos in quantum channels
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Jerusalem Lectures on Black Holes and Quantum Information
- Chaos and complexity by design
- Training variational quantum algorithms is NP-hard
- Verified Quantum Information Scrambling
- Information Scrambling in Computationally Complex Quantum Circuits
- Chaos, Complexity, and Random Matrices
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Deep inelastic scattering as a probe of entanglement
- Variational Thermal Quantum Simulation via Thermofield Double States
- Scrambling of Quantum Information in Quantum Many-Body Systems
- Information Scrambling in Quantum Neural Networks
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Observation of thermalization and information scrambling in a superconducting quantum processor
- Resource theory of quantum scrambling
- Quantum variational optimization: The role of entanglement and problem hardness
- An entanglement perspective on the quantum approximate optimization algorithm
- Scrambling Ability of Quantum Neural Networks Architectures
- Recovery of Damaged Information and the Out-of-Time-Ordered Correlators
- Quantum Information Scrambling: From Holography to Quantum Simulators
- Firewalls vs. Scrambling
- Quantum Computational Phase Transition in Combinatorial Problems
- Benchmarking Information Scrambling
- Quantifying scrambling in quantum neural networks