Ground State Preparation via Qubitization

• URL: http://arxiv.org/abs/2306.14993v1
• Date: Mon, 26 Jun 2023 18:20:48 GMT
• Title: Ground State Preparation via Qubitization
• Authors: Charles Marteau
• Abstract summary: We describe a protocol for preparing the ground state of a Hamiltonian $H$ on a quantum computer. The method relies on the so-called qubitization'' procedure of Low and Chuang. We illustrate our method on two models: the transverse field Ising model and a single qubit toy model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We describe a protocol for preparing the ground state of a Hamiltonian $H$ on a quantum computer. This is done by designing a quantum algorithm that implements the imaginary time evolution operator: $e^{-\tau H}$. The method relies on the so-called ``qubitization'' procedure of Low and Chuang which, assuming the existence of a unitary encoding of the Hamiltonian $H = \langle G| U_H |G\rangle$, produces a new operator $W_H$ whose moments are the Chebyshev polynomials of $H$ when projected on $|G\rangle$. Using this result and the expansion of $e^{-\tau H}$ in terms of Chebyshev polynomials we construct a circuit that implements an approximation of the imaginary time evolution operator which, at large time, projects any state on the ground state, provided a non-trivial initial overlap between the two. We illustrate our method on two models: the transverse field Ising model and a single qubit toy model.

Related papers

• Graph-Theoretic Analysis of $n$-Replica Time Evolution in the Brownian Gaussian Unitary Ensemble [3.9404852133765083]
  We investigate the $n$-replica time evolution operator $mathcalU_n(t)equiv emathcalL_nt $ for the Brownian Gaussian Unitary Ensemble (BGUE) using a graph-theoretic approach. Explicit representations for the cases of $n = 2$ and $n = 3$ are derived, emphasizing the role of graph categorization in simplifying calculations.
  arXiv  Detail & Related papers  (2025-02-13T12:24:50Z)
• Evolved Quantum Boltzmann Machines [3.481985817302898]
  We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. We show how the gradient for these tasks can be estimated by means of quantum algorithms that involve classical sampling, Hamiltonian simulation, and the Hadamard test. We also establish analytical expressions for the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrix elements of evolved quantum Boltzmann machines.
  arXiv  Detail & Related papers  (2025-01-06T20:11:35Z)
• Learning the structure of any Hamiltonian from minimal assumptions [2.810160553339817]
  We study the problem of learning an unknown quantum many-body Hamiltonian $H$ from black-box queries to its time evolution. We present efficient algorithms to learn any $n$-qubit Hamiltonian, assuming only a bound on the number of Hamiltonian terms.
  arXiv  Detail & Related papers  (2024-10-29T00:43:33Z)
• Simplified projection on total spin zero for state preparation on quantum computers [0.5461938536945723]
  We introduce a simple algorithm for projecting on $J=0$ states of a many-body system. Our approach performs the necessary projections using the one-body operators $J_x$ and $J_z$. Given the reduced complexity in terms of gates, this approach can be used to prepare approximate ground states of even-even nuclei.
  arXiv  Detail & Related papers  (2024-10-03T17:44:24Z)
• Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs [56.237917407785545]
  We consider the problem of learning an $varepsilon$-optimal policy in a general class of continuous-space Markov decision processes (MDPs) having smooth Bellman operators. Key to our solution is a novel projection technique based on ideas from harmonic analysis. Our result bridges the gap between two popular but conflicting perspectives on continuous-space MDPs.
  arXiv  Detail & Related papers  (2024-05-10T09:58:47Z)
• Parent Hamiltonian Reconstruction via Inverse Quantum Annealing [0.0]
  Finding a local Hamiltonian $hatmathcalH$ having a given many-body wavefunction $|psirangle$ as its ground state, i.e. a parent Hamiltonian, is a challenge of fundamental importance in quantum technologies. We introduce a numerical method that efficiently performs this task through an artificial inverse dynamics. We illustrate the method on two paradigmatic models: the Kitaev fermionic chain and a quantum Ising chain in longitudinal and transverse fields.
  arXiv  Detail & Related papers  (2023-03-20T15:32:51Z)
• Self-healing of Trotter error in digital adiabatic state preparation [52.77024349608834]
  We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $mathcal O(T-2 delta t2)$ instead of $mathcal O(T2delta t2)$ expected from general Trotter error bounds. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-09-13T18:05:07Z)
• 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)
• 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)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.