Collision models can efficiently simulate any multipartite Markovian quantum dynamics

• URL: http://arxiv.org/abs/2010.13910v2
• Date: Sun, 4 Apr 2021 13:02:26 GMT
• Title: Collision models can efficiently simulate any multipartite Markovian quantum dynamics
• Authors: Marco Cattaneo, Gabriele De Chiara, Sabrina Maniscalco, Roberta Zambrini and Gian Luca Giorgi
• Abstract summary: We introduce the multipartite collision model, defined in terms of elementary interactions between subsystems and ancillae. We show that it can simulate the Markovian dynamics of any multipartite open quantum system. We show that it is efficiently simulable on a quantum computer according to the dissipative quantum Church-Turing theorem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce the multipartite collision model, defined in terms of elementary interactions between subsystems and ancillae, and show that it can simulate the Markovian dynamics of any multipartite open quantum system. We develop a method to estimate an analytical error bound for any repeated interactions model, and we use it to prove that the error of our scheme displays an optimal scaling. Finally, we provide a simple decomposition of the multipartite collision model into elementary quantum gates, and show that it is efficiently simulable on a quantum computer according to the dissipative quantum Church-Turing theorem, i.e. it requires a polynomial number of resources.

Related papers

• Efficiency of Dynamical Decoupling for (Almost) Any Spin-Boson Model [44.99833362998488]
  We analytically study the dynamical decoupling of a two-level system coupled with a structured bosonic environment. We find sufficient conditions under which dynamical decoupling works for such systems. Our bounds reproduce the correct scaling in various relevant system parameters.
  arXiv  Detail & Related papers  (2024-09-24T04:58:28Z)
• 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)
• Simulating quantum transport via collisional models on a digital quantum computer [0.0]
  We study the interplay between the accuracy of the result versus the depth of the circuit. We study the simulation of a boundary-driven spin chain in regimes of weak and strong interactions.
  arXiv  Detail & Related papers  (2023-07-25T15:30:40Z)
• Variational dynamics of open quantum systems in phase space [0.0]
  We present a method to simulate the dynamics of large driven-dissipative many-body open quantum systems. We present a proof of principle investigation into the physics of the driven-dissipative Bose-Hubbard model with weak nonlinearity.
  arXiv  Detail & Related papers  (2023-07-14T15:48:31Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• Error-Mitigated Quantum Simulation of Interacting Fermions with Trapped Ions [17.707261555353682]
  probabilistic error cancellation (PEC) has been proposed as a general and systematic protocol. PEC has been tested in two-qubit systems and a superconducting multi-qubit system. We benchmark PEC using up to four trapped-ion qubits.
  arXiv  Detail & Related papers  (2023-02-21T04:27:30Z)
• A brief journey through collision models for multipartite open quantum dynamics [0.0]
  We review the main collision models for the dynamics of multipartite open quantum systems. We show how they may be simulated on a quantum computer.
  arXiv  Detail & Related papers  (2022-09-30T13:59:24Z)
• On Quantum Circuits for Discrete Graphical Models [1.0965065178451106]
  We provide the first method that allows one to provably generate unbiased and independent samples from general discrete factor models. Our method is compatible with multi-body interactions and its success probability does not depend on the number of variables. Experiments with quantum simulation as well as actual quantum hardware show that our method can carry out sampling and parameter learning on quantum computers.
  arXiv  Detail & Related papers  (2022-06-01T11:03:51Z)
• 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)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)

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.