Quantum random power method for ground state computation

• URL: http://arxiv.org/abs/2408.08556v2
• Date: Wed, 16 Apr 2025 10:08:48 GMT
• Title: Quantum random power method for ground state computation
• Authors: Taehee Ko, Hyowon Park, Sangkook Choi,
• Abstract summary: We present a quantum-classical hybrid random power method that approximates a Hamiltonian.<n>We numerically validate this sparsity condition for well-known model Hamiltonians.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial filtering techniques with either Hamiltonian simulation or block encoding. The use of the techniques provides a computational advantage that may not be achieved classically in terms of the degree of the polynomial. The classical part of our method is a randomized iterative algorithm that takes as input the matrix elements computed from the quantum part and outputs an approximation of ground state of the Hamiltonian. We prove that with probability one, our method converges to an approximation of a ground state of the Hamiltonian, requiring a constant scaling of the per-iteration classical complexity. The required quantum circuit depth is independent of the initial overlap and has no or a square-root dependence on the spectral gap. The iteration complexity scales linearly as the dimension of the Hilbert space when the quantum polynomial filtering corresponds to a sparse matrix. We numerically validate this sparsity condition for well-known model Hamiltonians. We also present a lower bound of the fidelity, which depends on the magnitude of noise occurring from quantum computation regardless of its charateristics, if it is smaller than a critical value. Several numerical experiments demonstrate that our method provides a good approximation of ground state in the presence of systematic and/or sampling noise.

Related papers

• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• A polynomial-time dissipation-based quantum algorithm for solving the ground states of a class of classically hard Hamiltonians [4.500918096201963]
  We give a complexity-time quantum algorithm for solving the ground states of a class of classically hard Hamiltonians. We show that the Hamiltonians that can be efficiently solved by our algorithms contain classically hard instances.
  arXiv  Detail & Related papers  (2024-01-25T05:01:02Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• 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)
• Quantum-Selected Configuration Interaction: classical diagonalization of Hamiltonians in subspaces selected by quantum computers [0.0]
  We propose a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits.
  arXiv  Detail & Related papers  (2023-02-22T12:05:31Z)
• 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)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation [7.620967781722716]
  We present a variational quantum algorithm for solving the Poisson equation. The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian. Because the number of terms is independent of the size of the problem, this method requires relatively few quantum measurements.
  arXiv  Detail & Related papers  (2021-06-17T09:01:53Z)
• 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)
• A Hybrid Quantum-Classical Hamiltonian Learning Algorithm [6.90132007891849]
  Hamiltonian learning is crucial to the certification of quantum devices and quantum simulators. We propose a hybrid quantum-classical Hamiltonian learning algorithm to find the coefficients of the Pauli operator of the Hamiltonian.
  arXiv  Detail & Related papers  (2021-03-01T15:15:58Z)
• Iterative Quantum Assisted Eigensolver [0.0]
  We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian. Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
  arXiv  Detail & Related papers  (2020-10-12T12:25:16Z)
• Quantum Power Method by a Superposition of Time-Evolved States [0.9137554315375919]
  We show that the number of gates required for approximating $hatcal Hn$ scales linearly in the power and the number of qubits. Using numerical simulation, we show that the power method can control systematic errors in approximating the Hamiltonian power $hatcal Hn$ for $n$ as large as 100.
  arXiv  Detail & Related papers  (2020-08-09T05:21: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.