Adiabatic quantum computing with parameterized quantum circuits
arXiv:2206.04373 · doi:10.1088/2058-9565/ad80c0
Abstract
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term devices, a number of hybrid approaches have been pursued in which a parameterized quantum circuit prepares and measures quantum states and a classical optimization algorithm minimizes an objective function that encompasses the solution to the problem of interest. In this work, we propose a different approach starting by analyzing how a small perturbation of a Hamiltonian affects the parameters that minimize the energy within a family of parameterized quantum states. We derive a set of equations that allow us to compute the new minimum by solving a constrained linear system of equations that is obtained from measuring a series of observables on the unperturbed system. We then propose a discrete version of adiabatic quantum computing that can be implemented in a near-term device while at the same time is insensitive to the initialization of the parameters and to other limitations hindered in the optimization part of variational quantum algorithms. We compare our proposed algorithm with the Variational Quantum Eigensolver on two classical optimization problems, namely MaxCut and Number Partitioning, and on a quantum-spin configuration problem, the Transverse-Field Ising Chain model, and confirm that our approach demonstrates superior performance.
23 pages, 9 figures; v3 minor corrections and improvements
References in corpus (54)
- Quantum Computing in the NISQ era and beyond
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Noisy intermediate-scale quantum (NISQ) algorithms
- Adiabatic Quantum Computing
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Evaluating analytic gradients on quantum hardware
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Towards Practical Quantum Variational Algorithms
- Challenges and Opportunities in Quantum Machine Learning
- Quantum Search by Local Adiabatic Evolution
- Training variational quantum algorithms is NP-hard
- Bounds for the adiabatic approximation with applications to quantum computation
- Quantum-assisted quantum compiling
- Quantum Computing for Finance: State of the Art and Future Prospects
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Warm-starting quantum optimization
- QuEST and High Performance Simulation of Quantum Computers
- Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Improving Variational Quantum Optimization using CVaR
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Exploiting symmetry in variational quantum machine learning
- Consistency of the Adiabatic Theorem
- How Powerful is Adiabatic Quantum Computation?
- A Class of Prediction-Correction Methods for Time-Varying Convex Optimization
- Theory of overparametrization in quantum neural networks
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Estimating the gradient and higher-order derivatives on quantum hardware
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
- Digitized-counterdiabatic quantum approximate optimization algorithm
- Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
- Adiabatic quantum algorithm for search engine ranking
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Variational Neural Annealing
- Hamiltonian variational ansatz without barren plateaus
- Demonstration of Adiabatic Variational Quantum Computing with a Superconducting Quantum Coprocessor
- Neural Error Mitigation of Near-Term Quantum Simulations
- Characterizing the loss landscape of variational quantum circuits
- Quantum Analytic Descent
- Graph neural network initialisation of quantum approximate optimisation
- Progress toward favorable landscapes in quantum combinatorial optimization
- A note on the switching adiabatic theorem
- Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
- Demonstration of logical qubits and repeated error correction with better-than-physical error rates
- Learning Unitaries by Gradient Descent
- Improving the variational quantum eigensolver using variational adiabatic quantum computing
- An evolving objective function for improved variational quantum optimisation
- Adaptive variational simulation for open quantum systems
- Quantum Energy Landscape and VQA Optimization