Squeezing and quantum approximate optimization
arXiv:2205.10383 · doi:10.1103/PhysRevA.109.012413
Abstract
Variational quantum algorithms offer fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such algorithms and the role of quantum correlations therein remain unclear. Here, we shed light on this open issue by establishing a tight connection to the seemingly unrelated field of quantum metrology: Metrological applications employ quantum states of spin-ensembles with a reduced variance to achieve an increased sensitivity, and we cast the generation of such squeezed states in the form of finding optimal solutions to a combinatorial MaxCut problem with an increased precision. By solving this optimization problem with a quantum approximate optimization algorithm (QAOA), we show numerically as well as on an IBM quantum chip how highly squeezed states are generated in a systematic procedure that can be adapted to a wide variety of quantum machines. Moreover, squeezing tailored for the QAOA of the MaxCut permits us to propose a figure of merit for future hardware benchmarks.
8+7 pages, 4+8 figures
References in corpus (15)
- Entanglement detection
- 14-qubit entanglement: creation and coherence
- Nonlinear atom interferometer surpasses classical precision limit
- Quantum metrology from a quantum information science perspective
- Squeezing and entanglement in a Bose-Einstein condensate
- Robust randomized benchmarking of quantum processes
- Quantum circuits with many photons on a programmable nanophotonic chip
- Fisher Information and entanglement of non-Gaussian spin states
- Detecting multiparticle entanglement of Dicke states
- Process verification of two-qubit quantum gates by randomized benchmarking
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- Non-negative Wigner functions in prime dimensions
- Quantum Volume in Practice: What Users Can Expect from NISQ Devices
- Experimental realisation of multipartite entanglement via quantum Fisher information in a uniform antiferromagnetic quantum spin chain
- Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols
Cited by in corpus (9)
- Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
- Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
- Genuine Multipartite Entanglement in Quantum Optimization
- Counterdiabatic Route to Entanglement Steering and Dynamical Freezing in the Floquet Lipkin-Meshkov-Glick Model
- A Monte Carlo Tree Search approach to QAOA: finding a needle in the haystack
- Simulating methylamine using symmetry adapted qubit-excitation-based variational quantum eigensolver
- Quantum Optimization Benchmarking Library - The Intractable Decathlon
- Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
- Efficient Online Quantum Circuit Learning with No Upfront Training