Corpus ID: 198985865

Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers

  title={Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers},
  author={William J. Huggins and J. McClean and N. Rubin and Z. Jiang and N. Wiebe and K. Whaley and R. Babbush},
  journal={arXiv: Quantum Physics},
  • William J. Huggins, J. McClean, +4 authors R. Babbush
  • Published 2019
  • Mathematics, Physics
  • arXiv: Quantum Physics
  • Variational algorithms are a promising paradigm for utilizing near-term quantum devices for modeling molecular systems. However, previous bounds on the measurement time required have suggested that the application of these techniques to larger molecules might be infeasible. We present a measurement strategy based on a low rank factorization of the two-electron integral tensor. Our approach provides a cubic reduction in term groupings over prior state-of-the-art and enables measurement times… CONTINUE READING
    46 Citations

    Figures from this paper

    Measurement Error Mitigation for Variational Quantum Algorithms
    • 2
    • PDF
    Using Models to Improve Optimizers for Variational Quantum Algorithms
    • 4
    • PDF
    Optimization of Simultaneous Measurement for Variational Quantum Eigensolver Applications
    Precise measurement of quantum observables with neural-network estimators
    • 8
    • PDF
    Variational Quantum Algorithms
    • 4
    • PDF
    A Non-Orthogonal Variational Quantum Eigensolver
    • 15
    • PDF
    Bayesian Inference with Engineered Likelihood Functions for Robust Amplitude Estimation
    • 8
    • PDF
    Low Depth Mechanisms for Quantum Optimization
    • 5
    • PDF


    Application of Fermionic Marginal Constraints to Hybrid Quantum Algorithms
    • 48
    • PDF
    Progress towards practical quantum variational algorithms
    • 177
    • PDF
    Qubitization of Arbitrary Basis Quantum Chemistry by Low Rank Factorization
    • 14
    • PDF
    Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
    • 28
    • PDF
    Accounting for errors in quantum algorithms via individual error reduction
    • 19
    • PDF
    Decoding quantum errors with subspace expansions
    • 24
    • PDF
    Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
    • 672
    • PDF
    The theory of variational hybrid quantum-classical algorithms
    • JarrodRMcClean, JonathanRomero, RyanBabbush, andAlánAspuru-Guzik
    • 2016
    • 267
    • PDF
    The Trotter step size required for accurate quantum simulation of quantum chemistry
    • 103
    • PDF