Quantum Gaussian filter for exploring ground-state properties
arXiv:2112.06026 · doi:10.1103/PhysRevA.106.032420
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.
arXiv comment11 pages, 8 figures; close to the published version; code at https://github.com/Min-Quan/QGF-eigensolver
References in corpus (43)
- Quantum Computing in the NISQ era and beyond
- Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
- Quantum information with continuous variables
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Simulation
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- Barren plateaus in quantum neural network training landscapes
- A Quantum Approximate Optimization Algorithm
- Quantum computational chemistry
- Simulated Quantum Computation of Molecular Energies
- Error mitigation for short-depth quantum circuits
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Hamiltonian Simulation by Qubitization
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Universal digital quantum simulation with trapped ions
- Optimal Quantum Phase Estimation
- Quantum measurements and the Abelian Stabilizer Problem
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Hamiltonian simulation with nearly optimal dependence on all parameters
- Subspace-search variational quantum eigensolver for excited states
- Accelerated Variational Quantum Eigensolver
- Variational Quantum Eigensolver with Fewer Qubits
- Filtering variational quantum algorithms for combinatorial optimization
- Algorithms for quantum simulation at finite energies
- Quantum machine learning over infinite dimensions
- Quantum Power Method by a Superposition of Time-Evolved States
- Calculating energy derivatives for quantum chemistry on a quantum computer
- Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
- Quadratic speedup for spatial search by continuous-time quantum walk
- Hybrid quantum computation gate with trapped ion system
- Quantum inverse iteration algorithm for programmable quantum simulators
- Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
- Hamiltonian operator approximation for energy measurement and ground state preparation
- Continuous-variable assisted thermal quantum simulation
- Collective optimization for variational quantum eigensolvers
- State Preparation Boosters for Early Fault-Tolerant Quantum Computation
- Protocol for implementing quantum nonparametric learning with trapped ions
- Quantum Algorithms for Ground-State Preparation and Green's Function Calculation
- Inverse iteration quantum eigensolvers assisted with a continuous variable
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