Quantum simulation of open quantum systems in heavy-ion collisions

• URL: http://arxiv.org/abs/2010.03571v2
• Date: Tue, 7 Sep 2021 18:13:06 GMT
• Title: Quantum simulation of open quantum systems in heavy-ion collisions
• Authors: Wibe A. de Jong, Mekena Metcalf, James Mulligan, Mateusz P{\l}osko\'n, Felix Ringer, Xiaojun Yao
• Abstract summary: We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a framework to simulate the dynamics of hard probes such as heavy quarks or jets in a hot, strongly-coupled quark-gluon plasma (QGP) on a quantum computer. Hard probes in the QGP can be treated as open quantum systems governed in the Markovian limit by the Lindblad equation. However, due to large computational costs, most current phenomenological calculations of hard probes evolving in the QGP use semiclassical approximations of the quantum evolution. Quantum computation can mitigate these costs, and offers the potential for a fully quantum treatment with exponential speedup over classical techniques. We report a simplified demonstration of our framework on IBM Q quantum devices, and apply the Random Identity Insertion Method (RIIM) to account for CNOT depolarization noise, in addition to measurement error mitigation. Our work demonstrates the feasibility of simulating open quantum systems on current and near-term quantum devices, which is of broad relevance to applications in nuclear physics, quantum information, and other fields.

Related papers

• 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)
• Quantum Algorithms and Applications for Open Quantum Systems [1.7717834336854132]
  We provide a succinct summary of the fundamental theory of open quantum systems. We then delve into a discussion on recent quantum algorithms. We conclude with a discussion of pertinent applications, demonstrating the applicability of this field to realistic chemical, biological, and material systems.
  arXiv  Detail & Related papers  (2024-06-07T19:02:22Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• 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)
• Kernel-Function Based Quantum Algorithms for Finite Temperature Quantum Simulation [5.188498150496968]
  We present a quantum kernel function (QKFE) algorithm for solving thermodynamic properties of quantum many-body systems. As compared to its classical counterpart, namely the kernel method (KPM), QKFE has an exponential advantage in the cost of both time and memory. We demonstrate its efficiency with applications to one and two-dimensional quantum spin models, and a fermionic lattice.
  arXiv  Detail & Related papers  (2022-02-02T18:00:04Z)
• Solving hadron structures using the basis light-front quantization approach on quantum computers [0.8726465590483234]
  We show that quantum computing can be used to solve for the structure of hadrons governed by strongly-interacting quantum field theory. We present the numerical calculations on simulated quantum devices using the basis light-front quantization approach.
  arXiv  Detail & Related papers  (2021-12-03T14:28:18Z)
• 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)
• Efficient Quantum Simulation of Open Quantum System Dynamics on Noisy Quantum Computers [0.0]
  We show that quantum dissipative dynamics can be simulated efficiently across coherent-to-incoherent regimes. This work provides a new direction for quantum advantage in the NISQ era.
  arXiv  Detail & Related papers  (2021-06-24T10:37:37Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers [0.0]
  We combine the so-called seniority-zero, or paired-electron, approximation of computational quantum chemistry with techniques for simulating molecular chemistry on gate-based quantum computers. We show that using the freed-up quantum resources for increasing the basis set can lead to more accurate results and reductions in the necessary number of quantum computing runs.
  arXiv  Detail & Related papers  (2020-01-31T19:44:37Z)
• Probing the Universality of Topological Defect Formation in a Quantum Annealer: Kibble-Zurek Mechanism and Beyond [46.39654665163597]
  We report on experimental tests of topological defect formation via the one-dimensional transverse-field Ising model. We find that the quantum simulator results can indeed be explained by the KZM for open-system quantum dynamics with phase-flip errors. This implies that the theoretical predictions of the generalized KZM theory, which assumes isolation from the environment, applies beyond its original scope to an open system.
  arXiv  Detail & Related papers  (2020-01-31T02:55:35Z)

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.