Resource Estimation for Quantum Variational Simulations of the Hubbard Model

@article{Cai2019ResourceEF,
  title={Resource Estimation for Quantum Variational Simulations of the Hubbard Model},
  author={Zhenyu Cai},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • Zhenyu Cai
  • Published 7 October 2019
  • Physics
  • arXiv: Quantum Physics
As the advances in quantum hardware bring us into the noisy intermediate-scale quantum (NISQ) era, one possible task we can perform without quantum error correction using NISQ machines is the variational quantum eigensolver (VQE) due to its shallow depth. A specific problem that we can tackle is the strongly interacting Fermi-Hubbard model, which is classically intractable and has practical implications in areas like superconductivity. In this Article, we will perform resource estimation on… 

Figures from this paper

Strategies for solving the Fermi-Hubbard model on near-term quantum computers
TLDR
If the numerical results on small lattice sizes are representative of the somewhat larger lattices accessible to near-term quantum hardware, they suggest that optimising over quantum circuits with a gate depth less than a thousand could be sufficient to solve instances of the Hubbard model beyond the capacity of classical exact diagonalisation.
Nearly tight Trotterization of correlated electrons
We consider simulating quantum systems on digital quantum computers. We show that the performance of quantum simulation can be improved by simultaneously exploiting the commutativity of Hamiltonian,
Error mitigation by training with fermionic linear optics
Noisy intermediate-scale quantum (NISQ) computers could solve quantum-mechanical simulation problems that are beyond the capabilities of classical computers. However, NISQ devices experience
Entanglement production and convergence properties of the variational quantum eigensolver
TLDR
A systematic investigation of variational forms (wave function Ansatze) is performed, to determine the ground state energies and properties of two-dimensional model fermionic systems on triangular lattices using the Variational Quantum Eigensolver (VQE) algorithm.
Variational Quantum Algorithms
TLDR
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.
Compressed variational quantum eigensolver for the Fermi-Hubbard model.
The Fermi-Hubbard model is a plausible target to be solved by a quantum computer using the variational quantum eigensolver algorithm. However, problem sizes beyond the reach of classical exact
Nearly tight Trotterization of interacting electrons
TLDR
It suffices to use O gates to simulate electronic structure in the plane-wave basis with $n$ spin orbitals and $\eta$ electrons up to a negligible factor, improving the best previous result in second quantization while outperforming the first-quantized simulation when $n=\mathcal{O}\left(\eta^2\right)$.
Efficient calculation of gradients in classical simulations of variational quantum algorithms
TLDR
A novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time and using O(1) state-vectors, compatible with "full-state" state-vector simulators and compatible with hardware accelerated and distributed simulators.
Quantum Error Mitigation using Symmetry Expansion
Even with the recent rapid developments in quantum hardware, noise remains the biggest challenge for the practical applications of any near-term quantum devices. Full quantum error correction cannot
Multi-exponential error extrapolation and combining error mitigation techniques for NISQ applications
  • Zhenyu Cai
  • Computer Science
    npj Quantum Information
  • 2021
TLDR
This Article develops methods to combine error extrapolation with two other error mitigation techniques: quasi-probability and symmetry verification, through exploiting features of these individual techniques, and shows how this combined method can achieve low estimation bias with a sampling cost multiple times smaller than quasi-Probability while without needing to be able to adjust the hardware error rate as required in canonicalerror extrapolation.
...
...

References

SHOWING 1-10 OF 84 REFERENCES
Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
A key goal of digital quantum computing is the simulation of fermionic systems such as molecules or the Hubbard model. Unfortunately, for present and near-future quantum computers the use of quantum
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
TLDR
If the numerical results on small lattice sizes are representative of the somewhat larger lattices accessible to near-term quantum hardware, they suggest that optimising over quantum circuits with a gate depth less than a thousand could be sufficient to solve instances of the Hubbard model beyond the capacity of classical exact diagonalisation.
Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological
Self-verifying variational quantum simulation of lattice models
TLDR
Experiments are presented that demonstrate self-verifying, hybrid, variational quantum simulation of lattice models in condensed matter and high-energy physics, enabling the study of a wide variety of previously intractable target models.
Gate-Efficient Simulation of Molecular Eigenstates on a Quantum Computer
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence
Progress towards practical quantum variational algorithms
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the
Error mitigation extends the computational reach of a noisy quantum processor
TLDR
This work applies the error mitigation protocol to mitigate errors in canonical single- and two-qubit experiments and extends its application to the variational optimization of Hamiltonians for quantum chemistry and magnetism.
Low-Depth Quantum Simulation of Materials
TLDR
Simulations of low-density jellium are identified as a promising first setting to explore quantum supremacy in electronic structure and a proposal to simulate the uniform electron gas using a low-depth variational ansatz realizable on near-term quantum devices is proposed.
Extending the computational reach of a noisy superconducting quantum processor
Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of
Quantum algorithms to simulate many-body physics of correlated fermions.
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum
...
...