Quantum algorithms for transport coefficients in gauge theories

• URL: http://arxiv.org/abs/2104.02024v1
• Date: Mon, 5 Apr 2021 17:23:54 GMT
• Title: Quantum algorithms for transport coefficients in gauge theories
• Authors: Thomas D. Cohen, Henry Lamm, Scott Lawrence, Yukari Yamauchi
• Abstract summary: In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables requiring dramatically smaller volumes: transport coefficients.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the future, ab initio quantum simulations of heavy ion collisions may become possible with large-scale fault-tolerant quantum computers. We propose a quantum algorithm for studying these collisions by looking at a class of observables requiring dramatically smaller volumes: transport coefficients. These form nonperturbative inputs into theoretical models of heavy ions; thus, their calculation reduces theoretical uncertainties without the need for a full-scale simulation of the collision. We derive the necessary lattice operators in the Hamiltonian formulation and describe how to obtain them on quantum computers. Additionally, we discuss ways to efficiently prepare the relevant thermal state of a gauge theory.

Related papers

• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits [0.0]
  Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods. In this paper, scattering of wavepackets in one-dimensional scalar field theory is simulated using 120 qubits of IBM's Heron superconducting quantum computer ibm_fez. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103.
  arXiv  Detail & Related papers  (2024-11-04T19:00:00Z)
• An efficient finite-resource formulation of non-Abelian lattice gauge theories beyond one dimension [0.0]
  We propose a resource-efficient method to compute the running of the coupling in non-Abelian gauge theories beyond one spatial dimension. Our method enables computations at arbitrary values of the bare coupling and lattice spacing with current quantum computers, simulators and tensor-network calculations.
  arXiv  Detail & Related papers  (2024-09-06T17:59:24Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Toward Quantum Computing Phase Diagrams of Gauge Theories with Thermal Pure Quantum States [0.0]
  We propose a generalization of thermal-pure-quantum-state formulation of statistical mechanics applied to constrained gauge-theory dynamics. We numerically demonstrate that the phase diagram of a simple low-dimensional gauge theory is robustly determined using this approach.
  arXiv  Detail & Related papers  (2022-08-28T01:26:10Z)
• 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)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum simulation of quantum field theories as quantum chemistry [9.208624182273288]
  Conformal truncation is a powerful numerical method for solving generic strongly-coupled quantum field theories. We show that quantum computation could not only help us understand fundamental physics in the lattice approximation, but also simulate quantum field theory methods directly.
  arXiv  Detail & Related papers  (2020-04-28T01:20:04Z)
• Quantum Interference for Counting Clusters [0.10312968200748115]
  We show that a quantum theory can be a more robust statistical theory to separate data to count overlapping clusters. This works identify how quantum theory can be effective in counting clusters and hope to inspire the field to further apply such techniques.
  arXiv  Detail & Related papers  (2020-01-03T18:13:57Z)

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.