Quantum Algorithm for Spectral Measurement with Lower Gate Count

Abstract

We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground state of some Hamiltonian, it is not necessary to implement the time-evolution operator: any unitary operator which is a function of the Hamiltonian will do. We propose one such unitary operator which can be implemented exactly, circumventing any Taylor or Trotter approximation errors. The second technique is tailored to lattice models, and is targeted at reducing the use of generic single-qubit rotations, which are very expensive to produce by standard fault tolerant techniques. In particular, the number of generic single-qubit rotations used by our method scales with the number of parameters in the Hamiltonian, which contrasts with a growth proportional to the lattice size required by other techniques.

Fixed a few minor things in the "Spectrum by Quantum Walk" section

References in corpus (11)

• Quantum algorithm for solving linear systems of equations
• Simulated Quantum Computation of Molecular Energies
• Fault-tolerant quantum computation with high threshold in two dimensions
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Quantum Simulations of Classical Annealing Processes
• Efficient synthesis of universal Repeat-Until-Success circuits
• Multilevel distillation of magic states for quantum computing
• Fault-Tolerant Postselected Quantum Computation: Schemes
• Efficient synthesis of probabilistic quantum circuits with fallback
• Distillation with sublogarithmic overhead
• Hamiltonian Simulation by Uniform Spectral Amplification

Cited by in corpus (82)

• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Quantum algorithms for quantum chemistry and quantum materials science
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Quantum computing enhanced computational catalysis
• Low-cost error mitigation by symmetry verification
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Emerging quantum computing algorithms for quantum chemistry
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
• Drug design on quantum computers
• Measurement reduction in variational quantum algorithms
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems
• Linear Response on a Quantum Computer
• Downfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Quantum Computing for Neutrino-nucleus Scattering
• A randomized quantum algorithm for statistical phase estimation
• Early fault-tolerant simulations of the Hubbard model
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Fast multi-qubit gates through simultaneous two-qubit gates
• Quantum unary approach to option pricing
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Quantum Computing: An Overview Across the System Stack
• Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit
• Quantum simulations of excited states with active-space downfolded Hamiltonians
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Quantum Computation for Periodic Solids in Second Quantization
• On the complexity of implementing Trotter steps
• Quantum Phase Processing and its Applications in Estimating Phase and Entropies
• Simulating Effective QED on Quantum Computers
• Quantum simulations employing connected moments expansions
• Resource estimate for quantum many-body ground-state preparation on a quantum computer
• Coupled Cluster Downfolding Methods: the effect of double commutator terms on the accuracy of ground-state energies
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Minimal Effective Gibbs Ansatz (MEGA): A simple protocol for extracting an accurate thermal representation for quantum simulation
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• Doubling Efficiency of Hamiltonian Simulation via Generalized Quantum Signal Processing
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Quantum Simulations of Chemistry in First Quantization with any Basis Set
• Fault-tolerant quantum computation of molecular observables
• Variational quantum solver employing the PDS energy functional
• Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer
• Quantum algorithms for generator coordinate methods
• Duality in Quantum Quenches and Classical Approximation Algorithms: Pretty Good or Very Bad
• Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Fast quantum simulation of electronic structure by spectrum amplification
• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
• Quantum algorithm for spectral projection by measuring an ancilla iteratively
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
• Ladder Operator Block-Encoding
• Quantum simulation by qubitization without Toffoli gates
• Efficient multi-qubit subspace rotations via topological quantum walks
• Calculating response functions of coupled oscillators using quantum phase estimation
• Some Error Analysis for the Quantum Phase Estimation Algorithms
• Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation
• The Electronic Structure of the Hydrogen Molecule: A Tutorial Exercise in Classical and Quantum Computation
• Nonlinear Spectroscopy via Generalized Quantum Phase Estimation
• Fault-tolerant quantum simulation of generalized Hubbard models
• Generation of perfectly entangled two and three qubits states by classical random interaction
• Quantum algorithm for PageRank computation through multistep quantum resonant transitions
• Block Lanczos method for excited states on a quantum computer
• Efficient quantum algorithm for solving structured problems via multi-step quantum computation
• Microwave-activated high-fidelity three-qubit gate scheme for fixed-frequency superconducting qubits
• Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
• Quantum phase estimation with optimal confidence interval using three control qubits
• Saving resources through repeat-until-success positive-operator-valued-measure measurements in quantum computation
• Coupled Cluster Downfolding Theory: towards efficient many-body algorithms for dimensionality reduction of composite quantum systems
• Reflection-Based Adiabatic State Preparation