Quantum Gaussian filter for exploring ground-state properties

Abstract

Filter methods realize a projection from a superposed quantum state onto a target state, which can be efficient if two states have sufficient overlap. Here we propose a quantum Gaussian filter (QGF) with the filter operator being a Gaussian function of the system Hamiltonian. A hybrid quantum-classical algorithm feasible on near-term quantum computers is developed, which implements the quantum Gaussian filter as a linear combination of Hamiltonian evolution at various times. Remarkably, the linear combination coefficients are determined classically and can be optimized in the postprocessing procedure. Compared to the existing filter algorithms whose coefficients are given in advance, our method is more flexible in practice under given quantum resources with the help of postprocessing on classical computers. We demonstrate the quantum Gaussian filter algorithm for the quantum Ising model with numeral simulations under noises. We also propose an alternative full quantum approach that implements a QGF with an ancillary continuous-variable mode.

11 pages, 8 figures; close to the published version; code at https://github.com/Min-Quan/QGF-eigensolver

References in corpus (11)

• Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• A Quantum Approximate Optimization Algorithm
• Simulated Quantum Computation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Optimal Quantum Phase Estimation
• Filtering variational quantum algorithms for combinatorial optimization
• Quadratic speedup for spatial search by continuous-time quantum walk
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation
• Quantum Algorithms for Ground-State Preparation and Green's Function Calculation

Cited by in corpus (9)

• Quadratic speedup for spatial search by continuous-time quantum walk
• Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation
• Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
• Energy-filtered random-phase states as microcanonical thermal pure quantum states
• Entanglement-assisted phase estimation algorithm for calculating dynamical response functions
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Nonadiabatic Self-Healing of Trotter Errors in Digitized Counterdiabatic Dynamics