Efficient state preparation for the quantum simulation of molecules in first quantization

• URL: http://arxiv.org/abs/2407.00249v1
• Date: Fri, 28 Jun 2024 22:46:01 GMT
• Title: Efficient state preparation for the quantum simulation of molecules in first quantization
• Authors: William J. Huggins, Oskar Leimkuhler, Torin F. Stetina, K. Birgitta Whaley,
• Abstract summary: We show how to efficiently map states defined in a Gaussian type orbital basis to a plane wave basis with a scaling that is logarithmic in the number of plane waves. Our work allows for the first quantum simulation of molecular systems whose end-to-end complexity is truly sublinear in the basis set size.
• Score: 0.027042267806481293
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane wave representation are especially promising due to their asymptotic efficiency. However, previous proposals for preparing initial states for these simulation algorithms scale poorly with the size of the basis set. We address this shortcoming by showing how to efficiently map states defined in a Gaussian type orbital basis to a plane wave basis with a scaling that is logarithmic in the number of plane waves. Our key technical result is a proof that molecular orbitals constructed from Gaussian type basis functions can be compactly represented in a plane wave basis using matrix product states. While we expect that other approaches could achieve the same logarithmic scaling with respect to basis set size, our proposed state preparation technique is also highly efficient in practice. For example, in a series of numerical experiments on small molecules, we find that our approach allows us to prepare an approximation to the Hartree-Fock state using orders of magnitude fewer non-Clifford gates than a naive approach. By resolving the issue of state preparation, our work allows for the first quantum simulation of molecular systems whose end-to-end complexity is truly sublinear in the basis set size.

Related papers

• Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials [1.3166122476354067]
  This paper improves and demonstrates the usefulness of the first quantized plane-wave algorithms for the quantum simulation of electronic structure. We focus on the Goedecker-Tetter-Hutter (GTH) pseudopotential, which is among the most accurate and widely used norm-conserving pseudopotentials. Despite the complicated form of the GTH pseudopotential, we are able to block encode the associated operator without significantly increasing the overall cost of quantum simulation.
  arXiv  Detail & Related papers  (2023-12-12T19:00:01Z)
• Computing excited states of molecules using normalizing flows [0.0]
  We present a new nonlinear variational framework for simultaneously computing ground and excited states of quantum systems. Our approach is based on approxingimating wavefunctions in the linear span of basis functions that are augmented and optimized emphvia composition with normalizing flows.
  arXiv  Detail & Related papers  (2023-08-31T05:22:51Z)
• Single-ancilla ground state preparation via Lindbladians [4.328210085579236]
  We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer.
  arXiv  Detail & Related papers  (2023-08-30T00:11:19Z)
• Predicting RNA Secondary Structure on Universal Quantum Computer [2.277461161767121]
  It is the first step for understanding how RNA structure folds from base sequences that to know how its secondary structure is formed. Traditional energy-based algorithms are short of precision, particularly for non-nested sequences. Gate model algorithms for universal quantum computing are not available.
  arXiv  Detail & Related papers  (2023-05-16T15:57:38Z)
• Exact and efficient Lanczos method on a quantum computer [0.0]
  We present an algorithm that uses block encoding on a quantum computer to exactly construct a Krylov space. The construction is exact in the sense that the Krylov space is identical to that of the Lanczos method.
  arXiv  Detail & Related papers  (2022-08-01T01:57:23Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Optimal radial basis for density-based atomic representations [58.720142291102135]
  We discuss how to build an adaptive, optimal numerical basis that is chosen to represent most efficiently the structural diversity of the dataset at hand. For each training dataset, this optimal basis is unique, and can be computed at no additional cost with respect to the primitive basis. We demonstrate that this construction yields representations that are accurate and computationally efficient.
  arXiv  Detail & Related papers  (2021-05-18T17:57:08Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.