Quantum Simulation of an Open System: A Dissipative 1+1D Ising Model

• URL: http://arxiv.org/abs/2311.18728v1
• Date: Thu, 30 Nov 2023 17:25:48 GMT
• Title: Quantum Simulation of an Open System: A Dissipative 1+1D Ising Model
• Authors: Erik Gustafson, Michael Hite, Jay Hubisz, Bharath Sambasivam, Judah Unmuth-Yockey
• Abstract summary: We implement quantum algorithms for the simulation of open or complex coupling quantum field theories on IBM devices. Our successful reproduction of the transition represents a non-trivial test for current hardware.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms designed for the simulation of open or complex coupling quantum field theories on IBM devices with a focus on the measurement of the Lee-Yang edge singularity. This feature corresponds (at large volumes) to a phase transition, and our successful reproduction of the transition represents a non-trivial test for current hardware and its ability to distinguish features of interest in quantum field theories.

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)
• Towards Quantum Simulation of Non-Markovian Open Quantum Dynamics: A Universal and Compact Theory [10.708145906104205]
  We introduce the dissipaton-embedded quantum master equation in second quantization (DQME-SQ) This exact and compact theory offers two key advantages: representability by quantum circuits and universal applicability to any Gaussian environment. We demonstrate these capabilities through digital quantum simulations of non-Markovian dissipative dynamics in both bosonic and fermionic environments.
  arXiv  Detail & Related papers  (2024-01-30T18:46:30Z)
• A Gell-Mann & Low Theorem Perspective on Quantum Computing: New Paradigm for Designing Quantum Algorithm [7.680510419135912]
  This work offers a new conceptual perspective for variational quantum computing based upon the Gell-Mann & Low theorem. We employ an innovative mathematical technique to explicitly unfold the normalized S-matrix, thereby enabling the systematic reconstruction of the Dyson series on a quantum computer, order by order. Our simulations indicate that this method not only successfully recovers the Dyson series but also exhibits robust and stable convergence.
  arXiv  Detail & Related papers  (2023-11-30T06:18:24Z)
• Quantum simulation of excited states from parallel contracted quantum eigensolvers [5.915403570478968]
  We show that a ground-state contracted quantum eigensolver can be generalized to compute any number of quantum eigenstates simultaneously. We introduce two excited-state CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm.
  arXiv  Detail & Related papers  (2023-11-08T23:52:31Z)
• Quantum Simulation of the Radical Pair Dynamics of the Avian Compass [5.5047128171540205]
  We apply a unitary-dilation-based quantum algorithm to simulating the dynamics of the radical pair mechanism in the avian compass. This work is the first application of any quantum algorithm to simulating the radical pair mechanism in the avian compass.
  arXiv  Detail & Related papers  (2022-11-28T15:12:34Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Prime number factorization using a spinor Bose-Einstein condensate inspired topological quantum computer [0.0]
  We consider the quantum double $mathcalD(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. All necessary quantum gates, less one, can be compiled exactly for this hybrid topological quantum computer.
  arXiv  Detail & Related papers  (2021-05-12T06:06:19Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.