Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm

Abstract

Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long preparation times which depend on the a priori unknown spectral gap. Our work relates in a twofold way. First, we propose a method to obtain information about the spectral profile of the adiabatic evolution. Second, we present the concept of a variational quantum adiabatic algorithm (VQAA) for optimized adiabatic paths. We aim at combining the strengths of the adiabatic and the variational approaches for fast and high-fidelity ground state preparation while keeping the number of measurements as low as possible. Our algorithms build upon ancilla protocols which we present that allow to directly evaluate the ground state overlap. We benchmark for a non-integrable spin-1/2 transverse and longitudinal Ising chain with $N=53$ sites using tensor network techniques. Using a black box, gradient-based approach, we report a reduction in the total evolution time for a given desired ground state fidelity by a factor of ten, which makes our method suitable for the limited decoherence time of noisy-intermediate scale quantum devices.

arXiv comment23+9 pages, 22 figures (main text)

References in corpus (48)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Elementary gates for quantum computation
• The density-matrix renormalization group in the age of matrix product states
• Variational Quantum Algorithms
• Quantum computational advantage using photons
• A Quantum Approximate Optimization Algorithm
• Efficient simulation of one-dimensional quantum many-body systems
• Adiabatic Quantum Computing
• An Area Law for One Dimensional Quantum Systems
• Shortcuts to adiabaticity: concepts, methods, and applications
• Observation of Rydberg blockade between two atoms
• Quantum information processing with superconducting circuits: a review
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Matrix product states represent ground states faithfully
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Time-evolution methods for matrix-product states
• Quantum Search by Local Adiabatic Evolution
• Robustness of adiabatic quantum computation
• Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
• Training variational quantum algorithms is NP-hard
• Bounds for the adiabatic approximation with applications to quantum computation
• Real time confinement following a quantum quench to a non-integrable model
• Minimal Universal Two-qubit Quantum Circuits
• Microwave Quantum Link between Superconducting Circuits Housed in Spatially Separated Cryogenic Systems
• Finding Exponential Product Formulas of Higher Orders
• The mass spectrum of the Schwinger model with Matrix Product States
• Virtual Distillation for Quantum Error Mitigation
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• What limits the simulation of quantum computers?
• Consistency of the Adiabatic Theorem
• Quantum Adiabatic Brachistochrone
• Exponential Error Suppression for Near-Term Quantum Devices
• Beyond the Quantum Adiabatic Approximation: Adiabatic Perturbation Theory
• Exact higher-spin symmetry in CFT: all correlators in unbroken Vasiliev theory
• The antiferromagnetic Ising chain in a mixed transverse and longitudinal magnetic field
• Algorithms for quantum simulation at finite energies
• Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
• Error mitigation via verified phase estimation
• Next-Generation Topology of D-Wave Quantum Processors
• A note on the switching adiabatic theorem
• Quantum Adiabatic Algorithm Design using Reinforcement Learning
• Simulation of many-qubit quantum computation with matrix product states
• Adiabatic theorem revisited: the unexpectedly good performance of adiabatic passage
• Limitations of optimization algorithms on noisy quantum devices
• Emergent conservation laws and nonthermal states in the mixed-field Ising model
• Quantum algorithm for spectral projection by measuring an ancilla iteratively

Cited by in corpus (32)

• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Designing Quantum Annealing Schedules using Bayesian Optimization
• Quantum kernels to learn the phases of quantum matter
• Simulating quantum circuits using tree tensor networks
• Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
• Quantum Programming of the Satisfiability Problem with Rydberg Atom Graphs
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity
• Universal Quantum Optimization with Cold Atoms in an Optical Cavity
• Certificates of quantum many-body properties assisted by machine learning
• Experimental Demonstration of Break-Even for the Compact Fermionic Encoding
• Circuit Complexity through phase transitions: consequences in quantum state preparation
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
• Why adiabatic quantum annealing is unlikely to yield speed-up
• Symmetric quantum states: a review of recent progress
• From quantum-enhanced to quantum-inspired Monte Carlo
• How to experimentally evaluate the adiabatic condition for quantum annealing
• Virtual mitigation of coherent non-adiabatic transitions by echo verification
• Search for optimal driving in finite quantum systems with precursors of criticality
• Quantum metrology enhanced by the $XY$ spin interaction in a generalized Tavis-Cummings model
• Quantum eigenstate broadcasting assisted by a coherent link
• Hardware-efficient quantum phase estimation via local control
• Quantum annealing showing an exponentially small success probability despite a constant energy gap with polynomial energy
• Spectral Gap Optimization for Enhanced Adiabatic State Preparation
• Machine-learning-inspired quantum control in many-body dynamics
• Atom Cavity Encoding for NP-Complete Problems
• Hardness-dependent quantum adiabatic schedules for the maximum-independent-set problem
• Generation of quantum phases of matter and finding a maximum-weight independent set of unit-disk graphs using Rydberg atoms
• Generalized Probabilistic Approximate Optimization Algorithm
• Ab initio nuclear structure via quantum adiabatic algorithm
• Tangent Space Excitation Ansatz for Quantum Circuits
• Quantum Hamiltonian Algorithms for Maximum Independent Sets
• Ancillary entangling Floquet kicks for accelerating quantum algorithms