TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ansätze

Abstract

Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this work, we introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ansätze a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of CNOT gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared to ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware.

10 pages, 7 figures

References in corpus (3)

• Quantum Computing
• Is the Trotterized UCCSD Ansatz chemically well-defined?
• ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus

Cited by in corpus (20)

• Barren Plateaus in Variational Quantum Computing
• A general framework for active space embedding methods: applications in quantum computing
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• Physically motivated improvements of Variational Quantum Eigensolvers
• Adaptive projected variational quantum dynamics
• Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise
• Classical Pre-optimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications
• Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers
• Shortcut to Chemically Accurate Quantum Computing via Density-based Basis-set Correction
• Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
• Hamiltonian-based graph-state ansatz for variational quantum algorithms
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz
• Exploring new variational quantum circuit ansatzes for solving $SU(2)$ matrix models
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Consensus-based qubit configuration optimization for variational algorithms on neutral atom quantum systems
• Counterdiabatic ADAPT-VQE for molecular simulation
• Shot-Efficient ADAPT-VQE via Reused Pauli Measurements and Variance-Based Shot Allocation
• Slice-Wise Initial State Optimization to Improve Cost and Accuracy of the VQE on Lattice Models
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions