Classical-Assisted Quantum Ground State Preparation with Tensor Network States and Monte Carlo Sampling

• URL: http://arxiv.org/abs/2306.16831v1
• Date: Thu, 29 Jun 2023 10:14:27 GMT
• Title: Classical-Assisted Quantum Ground State Preparation with Tensor Network States and Monte Carlo Sampling
• Authors: Feng-Yu Le, Zhao-Yun Chen, Lu Wang, Cheng Xue, Chao Wang, Yong-Jian Han, Yu-Chun Wu, Qing Yan, Shaojun Dong, and Guo-Ping Guo
• Abstract summary: 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.
• Score: 7.113098673094148
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing offers potential solutions for finding ground states in condensed-matter physics and chemistry. However, achieving effective ground state preparation is also computationally hard for arbitrary Hamiltonians. It is necessary to propose certain assumptions to make this problem efficiently solvable, including preparing a trial state of a non-trivial overlap with the genuine ground state. Here, we propose a classical-assisted quantum ground state preparation method for quantum many-body systems, combining Tensor Network States (TNS) and Monte Carlo (MC) sampling as a heuristic method to prepare a trial state with a non-trivial overlap with the genuine ground state. We extract a sparse trial state by sampling from TNS, which can be efficiently prepared by a quantum algorithm on early fault-tolerant quantum computers. Our method demonstrates a polynomial improvement in scaling of overlap between the trial state and genuine ground state compared to random trial states, as evidenced by numerical tests on the spin-$1/2$ $J_1$-$J_2$ Heisenberg model. Furthermore, our method is a novel approach to hybridize a classical numerical method and a quantum algorithm and brings inspiration to ground state preparation in other fields.

Related papers

• Tensor Train Quantum State Tomography using Compressed Sensing [2.493374942115722]
  Quantum state tomography (QST) is a fundamental technique for estimating the state of a quantum system from measured data.<n>In this work, we address this challenge by parameterizing the state using a low-rank block tensor train decomposition.<n>This framework applies to a broad class of quantum states that can be well approximated by low-rank decompositions.
  arXiv  Detail & Related papers  (2025-06-30T07:06:50Z)
• Excited States from ADAPT-VQE convergence path in Many-Body Problems: application to nuclear pairing problem and $H_4$ molecule dissociation [6.5877766193350675]
  A quantum computing algorithm is proposed to obtain low-lying excited states in many-body interacting systems.<n>The approximate eigenstates are obtained by using a quantum space diagonalization method in a subspace of states selected from the convergence path of the ADAPT-VQE.
  arXiv  Detail & Related papers  (2025-06-27T14:45:01Z)
• State-space gradient descent and metastability in quantum systems [0.7204413136269974]
  We propose a quantum algorithm to variationally prepare the ground state of a quantum Hamiltonian.<n>If it fails to find the ground state, it still yields a physically meaningful local-minimum state.<n>We show that our algorithm does not suffer from the barren plateau problem.
  arXiv  Detail & Related papers  (2025-05-14T18:37:56Z)
• A Quantum Super-Krylov Method for Ground State Energy Estimation [0.562479170374811]
  Krylov quantum diagonalization methods for ground state energy estimation have emerged as a compelling use case for quantum computers. We present a quantum Krylov method that uses only time evolutions and recovery probabilities, making it well adapted for current quantum computers. We prove that the resulting ground energy estimate converges in the noise-free regime and provide a classical numerical demonstration of the method in the presence of noise.
  arXiv  Detail & Related papers  (2024-12-23T05:21:43Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Arbitrary Ground State Observables from Quantum Computed Moments [0.0]
  We extend the quantum computed moments (QCM) method to estimate arbitrary ground state observables of quantum systems. We present preliminary results of using QCM to determine the ground state magnetisation and spin-spin correlations of the Heisenberg model.
  arXiv  Detail & Related papers  (2023-12-12T04:29:43Z)
• Scalable Quantum Ground State Preparation of the Heisenberg Model: A Variational Quantum Eigensolver Approach [0.0]
  Variational Quantumsolver (VQE) algorithm is a system composed of a quantum circuit and a classical Eigenational Quantumsolver. We present an ansatz capable of preparing the ground states for all possible values of the coupling, including the critical states for the anisotropic XXZ model.
  arXiv  Detail & Related papers  (2023-08-23T09:26:34Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• 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)
• Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization [0.0879626117219674]
  We investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland, and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values.
  arXiv  Detail & Related papers  (2022-06-10T20:25:40Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Quantum Davidson Algorithm for Excited States [42.666709382892265]
  We introduce the quantum Krylov subspace (QKS) method to address both ground and excited states. By using the residues of eigenstates to expand the Krylov subspace, we formulate a compact subspace that aligns closely with the exact solutions. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems.
  arXiv  Detail & Related papers  (2022-04-22T15:03:03Z)
• Low-rank quantum state preparation [1.5427245397603195]
  We propose an algorithm to reduce state preparation circuit depth by offloading computational complexity to a classical computer. We show that the approximation is better on today's quantum processors.
  arXiv  Detail & Related papers  (2021-11-04T19:56:21Z)
• Bose-Einstein condensate soliton qubit states for metrological applications [58.720142291102135]
  We propose novel quantum metrology applications with two soliton qubit states. Phase space analysis, in terms of population imbalance - phase difference variables, is also performed to demonstrate macroscopic quantum self-trapping regimes.
  arXiv  Detail & Related papers  (2020-11-26T09:05:06Z)
• Neural network quantum state tomography in a two-qubit experiment [52.77024349608834]
  Machine learning inspired variational methods provide a promising route towards scalable state characterization for quantum simulators. We benchmark and compare several such approaches by applying them to measured data from an experiment producing two-qubit entangled states. We find that in the presence of experimental imperfections and noise, confining the variational manifold to physical states greatly improves the quality of the reconstructed states.
  arXiv  Detail & Related papers  (2020-07-31T17:25:12Z)
• State preparation and measurement in a quantum simulation of the O(3) sigma model [65.01359242860215]
  We show that fixed points of the non-linear O(3) sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. We apply Trotter methods to obtain results for the complexity of adiabatic ground state preparation in both the weak-coupling and quantum-critical regimes. We present and analyze a quantum algorithm based on non-unitary randomized simulation methods.
  arXiv  Detail & Related papers  (2020-06-28T23:44:12Z)

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.