REVIEW 13 cited by
The Variational Quantum Eigensolver: a review of methods and best practices
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian, a problem that is central to quantum chemistry and condensed matter physics. Conventional computing methods are constrained in their accuracy due to the computational limits. The VQE may be used to model complex wavefunctions in polynomial time, making it one of the most promising near-term applications for quantum computing. Finding a path to navigate the relevant literature has rapidly become an overwhelming task, with many methods promising to improve different parts of the algorithm. Despite strong theoretical underpinnings suggesting excellent scaling of individual VQE components, studies have pointed out that their various pre-factors could be too large to reach a quantum computing advantage over conventional methods. This review aims to provide an overview of the progress that has been made on the different parts of the algorithm. All the different components of the algorithm are reviewed in detail including representation of Hamiltonians and wavefunctions on a quantum computer, the optimization process, the post-processing mitigation of errors, and best practices are suggested. We identify four main areas of future research:(1) optimal measurement schemes for reduction of circuit repetitions; (2) large scale parallelization across many quantum computers;(3) ways to overcome the potential appearance of vanishing gradients in the optimization process, and how the number of iterations required for the optimization scales with system size; (4) the extent to which VQE suffers for quantum noise, and whether this noise can be mitigated. The answers to these open research questions will determine the routes for the VQE to achieve quantum advantage as the quantum computing hardware scales up and as the noise levels are reduced.
Forward citations
Cited by 13 Pith papers
-
Feynman's clock and hierarchy-informed sampling for quantum error mitigation
Feynman's clock maps arbitrary circuits onto Hamiltonian dynamics whose BBGKY hierarchy enables polynomial-overhead, controllable error mitigation via informed sampling.
-
Spin-$s$ $U(1)$-eigenstate preparation
A Gray-code-based quantum circuit prepares arbitrary fixed-digit-sum (U(1)) eigenstates of spin-s chains, yielding the first preparation of spin-s XXX Bethe states.
-
Exploiting biased noise in variational quantum models
Twirling amplitude-damping noise into uniform Pauli/depolarising channels reduces expressivity and gradient magnitudes, while preserving the noise bias yields better VQA optimisation in the studied models.
-
STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation
STABSim is a GPU-accelerated Clifford tableau simulator with new measurement handling, exact T1/T2 noise sampling in a common regime, and a fast Clifford+T to PBC transpiler.
-
Quantum computation of hadron scattering in a lattice gauge theory
On a trapped-ion quantum computer, the authors prepared multiple meson wave packets and simulated their early-time collisions in a 1+1D Z2 lattice gauge theory.
-
Effective Bethe Ansatz for Spin-1 Non-integrable Models
The Effective Bethe Ansatz approximates ground and first excited states of the spin-1 bilinear-biquadratic chain in finite windows around both integrable endpoints, with fidelity to exact diagonalization degrading con...
-
Optimizing QUBO on a quantum computer by mimicking imaginary time evolution
ITEMC iteratively mimics imaginary time evolution to solve QUBO instances, achieving high CVaR-based approximation ratios in simulation and finding the best known solution on IBM hardware for up to 80 qubits.
-
Scalable parallel simulation of quantum circuits on CPU and GPU systems
Q2Chemistry, a full-amplitude quantum simulator, is accelerated 2.7x to 4.5x on benchmark circuits by overlapping communication, fusing gates, and using a two-dimensional GPU thread layout.
-
Quantum computing of magnetic-skyrmion-like patterns in Heisenberg ferromagnets
A simulator-based quantum eigensolver reveals field-driven discontinuities in a small Heisenberg ferromagnet, which the authors read as hints of zero-temperature skyrmion-like magnetic patterns.
-
Quantum-Assisted Space Logistics Mission Planning
A 7-node space logistics routing problem was encoded as a QUBO-style Hamiltonian and solved on QCi's Dirac-3 entropy quantum computer, producing a feasible but admitted-suboptimal plan.
-
Variational Quantum Eigensolver: A Comparative Analysis of Classical and Quantum Optimizer Methods
The hybrid optimizer QN-SPSA+PSR, mixing SPSA metric estimates with parameter-shift gradients, converges faster and more stably than QN-SPSA+SPSA on a 12-spin Ising model.
-
Pattern Tree: Enhancing Efficiency in Quantum Circuit Optimization Based on Pattern-matching
Organizing quantum circuit rewrite rules into a prefix-sharing pattern tree cuts pattern-matching compilation time by 20% on benchmarks, and up to 90% on two larger circuits.
-
Quantum Frontiers in High Energy Physics
A review of quantum sensing, quantum simulation, quantum machine learning, and collider-based quantum tests applied to open high-energy physics problems.
Discussion (0). Continue with ORCID to comment.