Universal quantum circuits for quantum chemistry

Abstract

Universal gate sets for quantum computing have been known for decades, yet no universal gate set has been proposed for particle-conserving unitaries, which are the operations of interest in quantum chemistry. In this work, we show that controlled single-excitation gates in the form of Givens rotations are universal for particle-conserving unitaries. Single-excitation gates describe an arbitrary $U(2)$ rotation on the two-qubit subspace spanned by the states $|01⟩,|10⟩$, while leaving other states unchanged -- a transformation that is analogous to a single-qubit rotation on a dual-rail qubit. The proof is constructive, so our result also provides an explicit method for compiling arbitrary particle-conserving unitaries. Additionally, we describe a method for using controlled single-excitation gates to prepare an arbitrary state of a fixed number of particles. We derive analytical gradient formulas for Givens rotations as well as decompositions into single-qubit and CNOT gates. Our results offer a unifying framework for quantum computational chemistry where every algorithm is a unique recipe built from the same universal ingredients: Givens rotations.

arXiv comment11 pages, 12 figures

References in corpus (24)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Two-Bit Gates are Universal for Quantum Computation
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Scalable Quantum Simulation of Molecular Energies
• Elucidating Reaction Mechanisms on Quantum Computers
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• From transistor to trapped-ion computers for quantum chemistry
• Quantum algorithms to simulate many-body physics of correlated fermions
• Estimating the gradient and higher-order derivatives on quantum hardware
• Efficient quantum circuits for quantum computational chemistry
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Simple factorization of unitary transformations
• Theory of analytical energy derivatives for the variational quantum eigensolver
• Calculating transition amplitudes by variational quantum deflation
• Preparation of many-body states for quantum simulation
• Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer
• Universal extensions of restricted classes of quantum operations

Cited by in corpus (10)

• Exploiting symmetry in variational quantum machine learning
• Variational approaches to constructing the many-body nuclear ground state for quantum computing
• T-count and T-depth of any multi-qubit unitary
• Quantum simulation of molecules in solution
• Differentiable quantum computational chemistry with PennyLane
• Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer
• Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
• Variational Quantum Simulation of Valence-Bond Solids
• Basis set generation and optimization in the NISQ era with Quiqbox.jl
• Chemistry beyond the Hartree-Fock limit via quantum computed moments