Variational Phase Estimation with Variational Fast Forwarding

Abstract

Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained by a quantum computer. The recently proposed Variational Quantum Phase Estimation (VQPE) algorithm uses a basis of real time-evolved states, for which the energy eigenvalues can be obtained directly from the unitary matrix U = exp(-iHt), which can be computed with cost linear in the number of states used. In this paper, we report a circuit-based implementation of VQPE for arbitrary molecular systems and assess its performance and costs for the H2, H3+ and H6 molecules. We also propose using Variational Fast Forwarding (VFF) to decrease to quantum depth of time-evolution circuits for use in VQPE. We show that the approximation provides a good basis for Hamiltonian diagonalisation even when its fidelity to the true time evolved states is low. In the high fidelity case, we show that the approximate unitary U can be diagonalised instead, preserving the linear cost of exact VQPE.

References in corpus (22)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Fast quantum gates for neutral atoms
• Simulated Quantum Computation of Molecular Energies
• Fermionic quantum computation
• Scalable Quantum Simulation of Molecular Energies
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Experimental Comparison of Two Quantum Computing Architectures
• A Theory of Trotter Error
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• A Non-Orthogonal Variational Quantum Eigensolver
• Quantum Krylov subspace algorithms for ground and excited state energy estimation
• Phase Gadget Synthesis for Shallow Circuits
• Fast-forwarding of Hamiltonians and Exponentially Precise Measurements
• Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
• Demonstrating Bayesian Quantum Phase Estimation with Quantum Error Detection
• Local variational quantum compilation of a large-scale Hamiltonian dynamics

Cited by in corpus (5)

• Anderson impurity solver integrating tensor network methods with quantum computing
• Towards Practical Quantum Phase Estimation: A Modular, Scalable, and Adaptive Approach
• Low bit-flip rate probabilistic error cancellation
• Interferometric binary phase estimations
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation