Rapid initial state preparation for the quantum simulation of strongly correlated molecules

• URL: http://arxiv.org/abs/2409.11748v1
• Date: Wed, 18 Sep 2024 07:04:32 GMT
• Title: Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Authors: Dominic W. Berry, Yu Tong, Tanuj Khattar, Alec White, Tae In Kim, Sergio Boixo, Lin Lin, Seunghoon Lee, Garnet Kin-Lic Chan, Ryan Babbush, Nicholas C. Rubin,
• Abstract summary: We show how to achieve unitary synthesis with a Toffoli complexity about $7 times$ lower than that in prior work. For filtering we present two different approaches: sampling and binary search.
• Score: 4.639143844012453
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Studies on quantum algorithms for ground state energy estimation often assume perfect ground state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here we address that problem in two ways: by faster preparation of matrix product state (MPS) approximations, and more efficient filtering of the prepared state to find the ground state energy. We show how to achieve unitary synthesis with a Toffoli complexity about $7 \times$ lower than that in prior work, and use that to derive a more efficient MPS preparation method. For filtering we present two different approaches: sampling and binary search. For both we use the theory of window functions to avoid large phase errors and minimise the complexity. We find that the binary search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about $0.003$. Finally, we estimate the total resources to perform ground state energy estimation of Fe-S cluster systems, including the FeMo cofactor by estimating the overlap of different MPS initial states with potential ground-states of the FeMo cofactor using an extrapolation procedure. {With a modest MPS bond dimension of 4000, our procedure produces an estimate of $\sim 0.9$ overlap squared with a candidate ground-state of the FeMo cofactor, producing a total resource estimate of $7.3 \times 10^{10}$ Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that used perfect ground state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system.

Related papers

• Improving Reinforcement Learning Sample-Efficiency using Local Approximation [2.5582913676558205]
  We derive PAC bounds on the sample-complexity for RL within the infinite-horizon Markov Decision Process setting.<n>We are able to extend these results to an infinite-horizon, model-free setting by constructing a PAC-MDP algorithm with the aforementioned sample-complexity.
  arXiv  Detail & Related papers  (2025-07-16T16:31:17Z)
• Accurate generation of chemical reaction transition states by conditional flow matching [0.6872939325656702]
  We introduce TS-GEN, a conditional flow-matching generative model.<n>It maps samples from a simple Gaussian prior directly to transition-state saddle-point geometries in a single, deterministic pass.<n>It delivers unprecedented accuracy, achieving a root-mean-square deviation of $0.004 rmmathringA$.
  arXiv  Detail & Related papers  (2025-07-14T17:54:47Z)
• Entanglement-minimized orbitals enable faster quantum simulation of molecules [1.7042264000899534]
  We introduce an efficient classical algorithm to find entanglement-minimized orbitals (EMOs) using spin-adapted matrix product states (MPS)<n>Our algorithm improves initial state overlap by nearly an order of magnitude over prior orbital optimization approaches for an iron-sulfur cluster with four irons.<n>Our results show that initial state preparation for these challenging systems requires far fewer resources than prior estimates suggested.
  arXiv  Detail & Related papers  (2025-06-16T11:49:20Z)
• Dividing and Conquering the Van Vleck Catastrophe [0.39089069256361736]
  The Van Vleck catastrophe has frequently been invoked to suggest that quantum computers may not be able to efficiently prepare ground states of large systems. We show that this intuition is not necessarily true. Specifically, we introduce a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems.
  arXiv  Detail & Related papers  (2025-04-04T14:15:12Z)
• Initial state preparation for quantum chemistry on quantum computers [1.4336086085916357]
  Quantum algorithms for ground-state energy estimation of chemical systems require a high-quality initial state. We address the initial state preparation problem with an end-to-end algorithm that prepares and quantifies the quality of initial states. We show how the energy distribution can help in identifying potential quantum advantage.
  arXiv  Detail & Related papers  (2023-10-27T18:00:59Z)
• Classical-Assisted Quantum Ground State Preparation with Tensor Network States and Monte Carlo Sampling [7.113098673094148]
  We propose a classical-assisted quantum ground state preparation method for quantum many-body systems. We extract a trial state by sampling from TNS, which can be efficiently prepared by a quantum algorithm on early fault-tolerant quantum computers. Our method demonstrates an improvement in scaling of overlap between the trial state and genuine ground state compared to random trial states.
  arXiv  Detail & Related papers  (2023-06-29T10:14:27Z)
• Towards Faster Non-Asymptotic Convergence for Diffusion-Based Generative Models [49.81937966106691]
  We develop a suite of non-asymptotic theory towards understanding the data generation process of diffusion models. In contrast to prior works, our theory is developed based on an elementary yet versatile non-asymptotic approach.
  arXiv  Detail & Related papers  (2023-06-15T16:30:08Z)
• Ground state preparation with shallow variational warm-start [5.526775342940154]
  This work provides a quantum ground state preparation scheme with shallow variational warm-start to tackle the bottlenecks of current algorithms. We demonstrate the effectiveness of our methods via extensive numerical simulations on spin-$1/2$ Heisenberg models. We extend research on the Hubbard model, demonstrating superior performance compared to the prevalent variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-03-20T15:36:23Z)
• Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs [60.40452803295326]
  We propose a new reward-free algorithm for learning linear Markov decision processes (MDPs) At the core of our algorithm is uncertainty-weighted value-targeted regression with exploration-driven pseudo-reward. We show that our algorithm only needs to explore $tilde O( d2varepsilon-2)$ episodes to find an $varepsilon$-optimal policy.
  arXiv  Detail & Related papers  (2023-03-17T17:53:28Z)
• Deep reinforced learning heuristic tested on spin-glass ground states: The larger picture [0.0]
  Authors present a deep reinforced learning approach to augment optimizations. In particular, they present results for several spin glass ground state problems. Here, we put these studies into a larger context, showing that the claimed superiority is marginal for smaller samples.
  arXiv  Detail & Related papers  (2023-02-21T17:59:10Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• A New Framework for Variance-Reduced Hamiltonian Monte Carlo [88.84622104944503]
  We propose a new framework of variance-reduced Hamiltonian Monte Carlo (HMC) methods for sampling from an $L$-smooth and $m$-strongly log-concave distribution. We show that the unbiased gradient estimators, including SAGA and SVRG, based HMC methods achieve highest gradient efficiency with small batch size. Experimental results on both synthetic and real-world benchmark data show that our new framework significantly outperforms the full gradient and gradient HMC approaches.
  arXiv  Detail & Related papers  (2021-02-09T02:44:24Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model [50.38446482252857]
  This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator) We first consider $gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space $mathcalS$ and action space $mathcalA$. We prove that a plain model-based planning algorithm suffices to achieve minimax-optimal sample complexity given any target accuracy level.
  arXiv  Detail & Related papers  (2020-05-26T17:53:18Z)
• Near-optimal ground state preparation [3.7747526957907303]
  We propose a quantum-classical algorithm to estimate the ground energy of a Hamiltonian. The dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm. We also prove that our algorithms reach the complexity lower bounds by applying it to the unstructured search problem and the quantum approximate counting problem.
  arXiv  Detail & Related papers  (2020-02-28T01:46:25Z)

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.