Approximating the quantum approximate optimization algorithm with digital-analog interactions
arXiv:2002.12215 · doi:10.1103/PhysRevA.106.042446
Abstract
The quantum approximate optimisation algorithm was proposed as a heuristic method for solving combinatorial optimisation problems on near-term quantum computers and may be among the first algorithms to perform useful computations in the post-supremacy, noisy, intermediate scale era of quantum computing. In this work, we exploit the recently proposed digital-analog quantum computation paradigm, in which the versatility of programmable universal quantum computers and the error resilience of quantum simulators are combined to improve platforms for quantum computation. We show that the digital-analog paradigm is suited to the variational quantum approximate optimisation algorithm, due to its inherent resilience against coherent errors, by performing large-scale simulations and providing analytical bounds for its performance in devices with finite single-qubit operation times. We observe regimes of single-qubit operation speed in which the considered variational algorithm provides a significant improvement over non-variational counterparts.
arXiv comment14 pages, 8 figures
References in corpus (38)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Quantum Simulation
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- A Quantum Engineer's Guide to Superconducting Qubits
- Adiabatic Quantum Computing
- Quantum random walks - an introductory overview
- Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
- Effective quantum spin systems with ion traps
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- The European Quantum Technologies Roadmap
- High-Fidelity Universal Gate Set for Be Ion Qubits
- Experimental Comparison of Two Quantum Computing Architectures
- Universal Control of Decoupled Quantum Systems
- Stability of macroscopic entanglement under decoherence
- Single-qubit quantum memory exceeding -minute coherence time
- Improving Variational Quantum Optimization using CVaR
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Reachability Deficits in Quantum Approximate Optimization
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- A random walk approach to quantum algorithms
- Digital-Analog Quantum Computation
- Finite-range interacting Ising quantum magnets with Rydberg atoms in optical lattices - From Rydberg superatoms to crystallization
- Digital-Analog Quantum Simulations with Superconducting Circuits
- Generalized swap networks for near-term quantum computing
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Finding spin-glass ground states using quantum walks
- Digital-analog quantum algorithm for the quantum Fourier transform
- Quantum Algorithms for Scientific Computing and Approximate Optimization
- Digital-Analog Quantum Simulations Using The Cross-Resonance Effect
- Enhanced connectivity of quantum hardware with digital-analog control
- When Diabatic Trumps Adiabatic in Quantum Optimization
- Beating the random assignment on constraint satisfaction problems of bounded degree
Cited by in corpus (15)
- A Review on Quantum Approximate Optimization Algorithm and its Variants
- Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
- Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
- Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
- Squeezing and quantum approximate optimization
- Mitigating noise in digital and digital-analog quantum computation
- Digital-analog quantum simulation of fermionic models
- Error estimation in current noisy quantum computers
- Digital-analog quantum genetic algorithm using Rydberg-atom arrays
- Digital-Analog Counterdiabatic Quantum Optimization with Trapped Ions
- Enhancing Quantum Annealing in Digital-Analog Quantum Computing
- Benchmarking Digital-Analog Quantum Computation
- Digital-Analog Quantum Machine Learning
- Programming tools for Analogue Quantum Computing in the High-Performance Computing Context -- A Review
- A Useful Metric for the NISQ Era: Qubit Error Probability and Its Role in Zero Noise Extrapolation