Quantum Computation of Eigenvalues within Target Intervals

Abstract

There is widespread interest in calculating the energy spectrum of a Hamiltonian, for example to analyze optical spectra and energy deposition by ions in materials. In this study, we propose a quantum algorithm that samples the set of energies within a target energy-interval without requiring good approximations of the target energy-eigenstates. We discuss the implementation of direct and iterative amplification protocols and give resource and runtime estimates. We illustrate initial applications by amplifying excited states on molecular Hydrogen.

arXiv comment21+10 pages, 8 figures, 3 tables; comments welcome

References in corpus (24)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Mechanics helps in searching for a needle in a haystack
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Quantum Amplitude Amplification and Estimation
• Quantum Algorithms Revisited
• Quantum Computation and Decision Trees
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Towards Quantum Chemistry on a Quantum Computer
• Tight bounds on quantum searching
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Variational Quantum Computation of Excited States
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Variational quantum algorithms for discovering Hamiltonian spectra
• Amplitude estimation without phase estimation
• Fixed-point quantum search with an optimal number of queries
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• Novel constructions for the fault-tolerant Toffoli gate
• Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
• Five Two-Qubit Gates Are Necessary for Implementing Toffoli Gate
• New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
• Obtaining A Linear Combination of the Principal Components of a Matrix on Quantum Computers

Cited by in corpus (10)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Hybrid quantum-classical algorithms and quantum error mitigation
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation
• Quantum Equation of Motion with Orbital Optimization for Computing Molecular Properties in Near-Term Quantum Computing
• Efficient Quantum Algorithm for Filtering Product States
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation