String Breaking in the Heavy Quark Limit with Scalable Circuits

• URL: http://arxiv.org/abs/2411.05915v1
• Date: Fri, 08 Nov 2024 19:00:27 GMT
• Title: String Breaking in the Heavy Quark Limit with Scalable Circuits
• Authors: Anthony N. Ciavarella,
• Abstract summary: A truncation of the Hilbert space of non-Abelian lattice gauge theories with matter in the heavy quark limit is developed. A state with a single $qoverlineq$ pair is prepared on quantum hardware and the inelastic production of $qoverlineq$ pairs is observed using $104$ qubits on IBM's Heron quantum computer ibm_torino.
• Score: 0.0
• License:
• Abstract: Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with matter in the heavy quark limit is developed. This truncation is applied to $SU(2)$ lattice gauge theory in $1+1D$ to map the theory efficiently onto a quantum computer. Scalable variational circuits are found to prepare the vacuum and single meson states. It is also shown how these state preparation circuits can be used to perform measurements of the number of mesons produced during the system's time evolution. A state with a single $q\overline{q}$ pair is prepared on quantum hardware and the inelastic production of $q\overline{q}$ pairs is observed using $104$ qubits on IBM's Heron quantum computer ibm_torino.

Related papers

• Sample-Optimal Quantum State Tomography for Structured Quantum States in One Dimension [25.333797381352973]
  We study whether the number of state copies can saturate the information theoretic bound (i.e., $O(n)$) using physical quantum measurements. We propose a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem and show that it can efficiently find an estimate with bounded recovery error.
  arXiv  Detail & Related papers  (2024-10-03T15:26:26Z)
• Spontaneous symmetry breaking in a $SO(3)$ non-Abelian lattice gauge theory in $2+1$D with quantum algorithms [0.0]
  We study the ability of quantum algorithms to prepare ground states in a matter-free non-Abelian $SO(3)$ lattice gauge theory in $2+1$D. To deal with the large Hilbert space of gauge fields, we demonstrate how the exact imposition of the non-Abelian Gauss Law in the rishon representation of the quantum link operator significantly reduces the degrees of freedom.
  arXiv  Detail & Related papers  (2024-09-11T08:55:59Z)
• Exploring quantum weight enumerators from the $n$-qubit parallelized SWAP test [19.183393329155567]
  We build the connection between quantum weight enumerators and the $n$-qubit parallelized SWAP test. We find that each shadow enumerator corresponds precisely to a probability in the $n$-qubit parallelized SWAP test. For applications, we employ the $n$-qubit parallelized SWAP test to determine the distances of quantum error-correcting codes.
  arXiv  Detail & Related papers  (2024-06-26T12:06:40Z)
• Trainability and Expressivity of Hamming-Weight Preserving Quantum Circuits for Machine Learning [2.2301710048942103]
  We analyze the trainability and controllability of variational quantum circuits (VQCs) We first design and prove the feasibility of new data loaders, performing quantum amplitude encoding of $binomnk$-dimensional vectors. Lastly, we analyze the trainability of Hamming weight preserving circuits, and show that the variance of the $binomnk$ of the subspace is bounded according to the $binomnk$ of the subspace.
  arXiv  Detail & Related papers  (2023-09-27T10:11:07Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer [0.0]
  Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. Inspired by data-loading circuits developed for quantum machine learning, we propose an alternate paradigm that provides shallower, yet scalable $mathcalO(d log2N)$ two-qubit gate depth circuits to prepare such states with d-fermions.
  arXiv  Detail & Related papers  (2023-01-18T12:43:18Z)
• Multi-state Swap Test Algorithm [2.709321785404766]
  Estimating the overlap between two states is an important task with several applications in quantum information. We design a quantum circuit to measure overlaps of multiple quantum states.
  arXiv  Detail & Related papers  (2022-05-15T03:31:57Z)
• Quantum algorithms for estimating quantum entropies [6.211541620389987]
  We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state. We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
  arXiv  Detail & Related papers  (2022-03-04T15:44:24Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Hamiltonian operator approximation for energy measurement and ground state preparation [23.87373187143897]
  We show how to approximate the Hamiltonian operator as a sum of propagators using a differential representation. The proposed approach, named Hamiltonian operator approximation (HOA), is designed to benefit analog quantum simulators.
  arXiv  Detail & Related papers  (2020-09-07T18:11:00Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.