We introduce the multipartite collision model, defined in terms of elementary interactions between subsystems and ancillas, 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.
We introduce the multipartite collision model, defined in terms of elementary interactions between subsystems and ancillas, 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.
Hamiltonian dynamics have been widely implemented on noisy intermediate-scale quantum devices in recent years. In contrast, experimental demonstrations of Markovian quantum dynamics remain limited, because implementing nonunitary evolution on quantum computers is challenging. Quantum collision models provide a natural approach to this problem by coupling the system to ancillas to realize dissipation. However, previous implementations of quantum collision models on quantum computers have typically been restricted to one or two system qubits and fewer than 12 time steps, owing to noise, circuit depth, the overhead of ancilla reset, and limited qubit resources. In this work, we experimentally simulate Markovian quantum processes with local and nonlocal dissipation on both trapped-ion and superconducting quantum computers. By employing hardware-specific ancilla strategies, we realize simulations with up to seven system qubits, corresponding to 13 qubits in total, and 40 time steps. Our results demonstrate that, even for the same physical model, the optimal implementation strategy depends strongly on the hardware characteristics of the quantum computer.
The quantum collision models are a useful method to describe the dynamics of an open quantum system by means of repeated interactions between the system and some particles of the environment, which are usually termed “ancillas”. In this paper, we review the main collision models for the dynamics of multipartite open quantum systems, which are composed of several subsystems. In particular, we are interested in models that are based on elementary collisions between the subsystems and the ancillas, and that simulate global and/or local Markovian master equations in the limit of infinitesimal timestep. After discussing the mathematical details of the derivation of a generic collision-based master equation, we provide the general ideas at the basis of the collision models for multipartite systems, we discuss their strengths and limitations, and we show how they may be simulated on a quantum computer. Moreover, we analyze some properties of a collision model based on entangled ancillas, derive the master equation it generates for small timesteps, and prove that the coefficients of this master equation are subject to a constraint that limits their generality. Finally, we present an example of such collision model with two bosonic ancillas entangled in a two-mode squeezed thermal state.
We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing time evolutions of the total (system, bath, and interaction) Hamiltonian and intermittent tracing out the environment degrees of freedom. This results in a unified framework where any near-term Hamiltonian simulation algorithm can be incorporated to implement an arbitrary number of such collisions on early fault-tolerant quantum computers: we do not assume access to specialized oracles such as block encodings and minimize the number of ancilla qubits needed. In particular, using the correspondence between Lindbladian evolution and completely positive trace-preserving maps arising out of memoryless collisions, we provide an end-to-end quantum algorithm for simulating Lindbladian dynamics. For a system of n-qubits, we exhaustively compare the circuit depth needed to estimate the expectation value of an observable with respect to the reduced state of the system after time t while employing different near-term Hamiltonian simulation techniques, requiring at most n+2 qubits in all. We compare the cnot gate counts of the various approaches for estimating the transverse field magnetization of a 10-qubit XX-Heisenberg spin chain under amplitude damping. Finally, we also develop a framework to efficiently simulate an arbitrary number of memory-retaining collisions, i.e., where environments interact, leading to non-Markovian dynamics. Overall, our methods can leverage quantum collision models for both Markovian and non-Markovian dynamics on early fault-tolerant quantum computers, shedding light on the advantages and limitations of simulating open systems dynamics using this framework.
A simple collision model is employed to introduce elementary concepts of open system dynamics of quantum systems. In particular, within the framework of collision models we introduce the quantum analogue of thermalization process called quantum homogenization and simulate quantum decoherence processes. These dynamics are driven by partial swaps and controlled unitary collisions, respectively. We show that collision models can be used to prepare multipartite entangled states. Partial swap dynamics generates W-type of entanglement saturating the CKW inequalities, whereas the decoherence collision models creates GHZ-type of entangled states. The considered evolution of a system in a sequence of collisions is described by a discrete semigroup E_1,...,E_n. Interpolating this discrete points within the set of quantum channels we derive for both processes the corresponding Lindblad master equations. In particular, we argue that collision models can be used as simulators of arbitrary Markovian dynamics, however, the inverse is not true.
Abstract Quantum collision models describe open quantum systems through repeated interactions with a coarse-grained environment. However, a complete certification of these models is lacking, as no complete error bounds on the simulation of system observables have been established. Here, we show that Markovian and non-Markovian collision models can be recovered analytically from chain mapping techniques starting from a general microscopic Hamiltonian. This derivation reveals a previously unidentified source of error—induced by an unfaithful sampling of the environment—in dynamics obtained with collision models that can become dominant for small but finite time-steps. With the complete characterization of this error, all collision models errors are now identified and quantified, which enables the promotion of collision models to the class of numerically exact methods. To confirm the predictions of our equivalence results, we implemented a non-Markovian collision model of the Spin Boson Model, and identified, as predicted, a regime in which the collision model is fundamentally inaccurate.
Simulating open-system dynamics on gate-based quantum computers offers a route to exploring dissipative quantum phenomena through programmable quantum processing. Collision models provide a direct and flexible framework by representing the environment through sequential system--ancilla collisions. At finite temperatures, however, they typically require repeated preparation of thermal ancillas, adding circuit overhead and gate errors. Here, we show that, for a broad class of U(1)-symmetric system--ancilla interactions, finite-temperature dynamics can instead be reconstructed from simulations with pure ancillas in orthogonal basis states. The target temperature enters only through classical post-processing of the resulting pure-branch data, allowing the same data to be reused for different temperatures without additional quantum processing. Bypassing explicit thermal-state preparation reduces ancilla-preparation overhead and preparation-induced errors.