Phase estimation with partially randomized time evolution
arXiv:2503.05647 · doi:10.1103/ynxb-p2xq
Abstract
Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computational overhead derives from the Hamiltonian simulation subroutine. In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation. We propose new partially randomized Hamiltonian simulation methods in which some terms are kept deterministically and others are randomly sampled. We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry and obtain orders-of-magnitude improvements compared to other simulations based on product formulas. When applied to the hydrogen chain, we have numerical evidence that our methods exhibit asymptotic scaling with the system size that is competitive with the best known qubitization approaches.
44 pages, 22 figures
References in corpus (66)
- Quantum metrology
- Hamiltonian Simulation by Qubitization
- Quantum algorithms for quantum chemistry and quantum materials science
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Elucidating Reaction Mechanisms on Quantum Computers
- Toward the first quantum simulation with quantum speedup
- A Theory of Trotter Error
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- A random compiler for fast Hamiltonian simulation
- Gate count estimates for performing quantum chemistry on small quantum computers
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Halving the cost of quantum addition
- Quantum computing enhanced computational catalysis
- Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
- Is there evidence for exponential quantum advantage in quantum chemistry?
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Magic State Distillation: Not as Costly as You Think
- Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
- Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
- Efficient Bayesian Phase Estimation
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
- Demonstrating Heisenberg-limited unambiguous phase estimation without adaptive measurements
- The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
- Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
- Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
- A randomized quantum algorithm for statistical phase estimation
- Hamiltonian simulation in the low-energy subspace
- Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
- Quantum Filter Diagonalization with Double-Factorized Hamiltonians
- Efficient ab initio auxiliary-field quantum Monte Carlo calculations in Gaussian bases via low-rank tensor decomposition
- Nearly tight Trotterization of interacting electrons
- Efficient synthesis of probabilistic quantum circuits with fallback
- Shorter gate sequences for quantum computing by mixing unitaries
- Hamiltonian simulation with random inputs
- Compilation by stochastic Hamiltonian sparsification
- Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
- Hybridized Methods for Quantum Simulation in the Interaction Picture
- Initial state preparation for quantum chemistry on quantum computers
- Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
- On low-depth algorithms for quantum phase estimation
- Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
- Orbital transformations to reduce the 1-norm of the electronic structure Hamiltonian for quantum computing applications
- Achieving Heisenberg scaling with maximally entangled states: an analytic upper bound for the attainable root mean square error
- Rapid initial state preparation for the quantum simulation of strongly correlated molecules
- Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
- Shorter quantum circuits via single-qubit gate approximation
- On the complexity of implementing Trotter steps
- Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry
- Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
- Composite Quantum Simulations
- Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
- Perturbation theory with quantum signal processing
- Importance sampling for stochastic quantum simulations
- Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
- Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
- Probabilistic Interpolation of Quantum Rotation Angles
- Continuous Hamiltonian dynamics on digital quantum computers without discretization error
- Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
- Average-case Speedup for Product Formulas
- High ground state overlap via quantum embedding methods
- More quantum chemistry with fewer qubits
- TE-PAI: Exact Time Evolution by Sampling Random Circuits