Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2504.21564 · Physical Review A

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers

Kushagra Garg, Zeeshan Ahmed, Subhadip Mitra, Shantanav Chakraborty

Published Jul 29, 2025• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/3trk-smbh

Related papers

Collision-model-based approach to non-Markovian quantum dynamics

Francesco Ciccarello, G. Massimo Palma, Vittorio Giovannetti

We present a theoretical framework to tackle quantum non-Markovian dynamics based on a microscopic collision model (CM), where the bath consists of a large collection of initially uncorrelated ancillas. Unlike standard memoryless CMs, we endow the bath with memory by introducing interancillary collisions between next system-ancilla interactions. Our model interpolates between a fully Markovian dynamics and the continuous interaction of the system with a single ancilla, i.e., a strongly non-Markovian process. We show that in the continuous limit one can derive a general master equation, which, while keeping such features, is guaranteed to describe an unconditionally completely positive and trace-preserving dynamics. We apply our theory to an atom in a dissipative cavity for a Lorentzian spectral density of bath modes, a dynamics which can be exactly solved. The predicted evolution shows a significant improvement in approaching the exact solution with respect to two well-known memory-kernel master equations.

arXiv:1207.6554•Physical Review A•Apr 25, 2013•177 citations

Making quantum collision models exact

Thibaut Lacroix, Dario Cilluffo, Susana F. Huelga +1 more

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.

arXiv:2411.13166•Communications Physics•Jul 1, 2025•11 citations

Simulating the Dynamics of Markovian Quantum Processes by Quantum Collision Models on Quantum Computers

Zeqing Wang, Julian D. Teske, Anshuman Bhardwaj +2 more

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.

quant-pharXiv:2606.27856•Jun 29, 2026•3 citations

Exponentially Accurate Open Quantum Simulation via Randomized Dissipation with Minimal Ancilla

Jumpei Kato, Kaito Wada, Kosuke Ito +1 more

Simulating open quantum systems is an essential technique for understanding complex physical phenomena and advancing quantum technologies. Some quantum algorithms simulate Lindblad dynamics exponentially accurately, i.e., they achieve logarithmically short circuit depth in terms of accuracy, but they need to coherently encode all possible jump operators with a large ancilla consumption. Minimizing the gate and ancilla counts while achieving such a logarithmic scaling in accuracy remains an important challenge. In this work, we present two randomized quantum algorithms for simulating general Lindblad dynamics with multiple jump operators aimed at an observable estimation that achieves a circuit depth with not only logarithmic scaling in accuracy but also either partial or complete independence from the parameters specifying the Lindbladian. This is based on a novel random circuit compilation method that leverages dissipative processes with only a single jump operator, leading to the proposed methods using minimal ancilla qubits— 4 + ⌈ log 2 M ⌉ in the first case and seven in the other, where each single jump operator has at most M Pauli strings. In addition, we numerically demonstrate the practical advantage over existing approaches by providing a detailed analysis of the required gate and ancilla counts. This work represents a significant step toward making open quantum system simulations more feasible on early fault-tolerant quantum computing devices.

arXiv:2412.19453•PRX Quantum•May 20, 2026•15 citations

Optimizing digital quantum simulation of open quantum lattice models

Xie-Hang Yu, Hongchao Li, J. I. Cirac +1 more

Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption on the system-environment interaction, we develop near-optimal algorithms that, for a model with $N$ spins and evolution time $t$, attain a simulation error $δ$ in the system-state with $\mathcal{O}(Nt(Nt/δ)^{o(1)})$ gates, $\mathcal{O}(t(Nt/δ)^{o(1)})$ parallelized circuit depth and $\tilde{\mathcal{O}}(N(Nt/δ)^{o(1)})$ ancillas. We additionally show that, if only simulating local observables is of interest, then the circuit depth of the digital algorithm can be chosen to be independent of the system size $N$. This provides theoretical evidence for the utility of these algorithms for simulating physically relevant models, where typically local observables are of interest, on pre-fault tolerant devices. Finally, for the limiting case of Markovian dynamics with commuting jump operators, we propose two algorithms based on sampling a Wiener process and on a locally dilated Hamiltonian construction, respectively. These algorithms reduce the asymptotic gate complexity on $N$ compared to currently available algorithms in terms of the required number of geometrically local gates.

arXiv:2509.02268•Sep 2, 2025•5 citations

A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer

Karthik Seetharam, Burak Sahinoglu, Matteo Lostaglio +2 more

Abstract We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3 and BF3 (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 10^11 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.

arXiv:2504.06348•Sep 18, 2025•16 citations
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 nnn-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 ttt while employing different near-term Hamiltonian simulation techniques, requiring at most n+2n+2n+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.
We present a theoretical framework to tackle quantum non-Markovian dynamics based on a microscopic collision model (CM), where the bath consists of a large collection of initially uncorrelated ancillas. Unlike standard memoryless CMs, we endow the bath with memory by introducing interancillary collisions between next system-ancilla interactions. Our model interpolates between a fully Markovian dynamics and the continuous interaction of the system with a single ancilla, i.e., a strongly non-Markovian process. We show that in the continuous limit one can derive a general master equation, which, while keeping such features, is guaranteed to describe an unconditionally completely positive and trace-preserving dynamics. We apply our theory to an atom in a dissipative cavity for a Lorentzian spectral density of bath modes, a dynamics which can be exactly solved. The predicted evolution shows a significant improvement in approaching the exact solution with respect to two well-known memory-kernel master equations.
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.
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.
Simulating open quantum systems is an essential technique for understanding complex physical phenomena and advancing quantum technologies. Some quantum algorithms simulate Lindblad dynamics exponentially accurately, i.e., they achieve logarithmically short circuit depth in terms of accuracy, but they need to coherently encode all possible jump operators with a large ancilla consumption. Minimizing the gate and ancilla counts while achieving such a logarithmic scaling in accuracy remains an important challenge. In this work, we present two randomized quantum algorithms for simulating general Lindblad dynamics with multiple jump operators aimed at an observable estimation that achieves a circuit depth with not only logarithmic scaling in accuracy but also either partial or complete independence from the parameters specifying the Lindbladian. This is based on a novel random circuit compilation method that leverages dissipative processes with only a single jump operator, leading to the proposed methods using minimal ancilla qubits— 4 + ⌈ log 2 M ⌉ in the first case and seven in the other, where each single jump operator has at most M Pauli strings. In addition, we numerically demonstrate the practical advantage over existing approaches by providing a detailed analysis of the required gate and ancilla counts. This work represents a significant step toward making open quantum system simulations more feasible on early fault-tolerant quantum computing devices.
Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption on the system-environment interaction, we develop near-optimal algorithms that, for a model with NNN spins and evolution time ttt, attain a simulation error δδδ in the system-state with O(Nt(Nt/δ)o(1))\mathcal{O}(Nt(Nt/δ)^{o(1)})O(Nt(Nt/δ)o(1)) gates, O(t(Nt/δ)o(1))\mathcal{O}(t(Nt/δ)^{o(1)})O(t(Nt/δ)o(1)) parallelized circuit depth and O~(N(Nt/δ)o(1))\tilde{\mathcal{O}}(N(Nt/δ)^{o(1)})O~(N(Nt/δ)o(1)) ancillas. We additionally show that, if only simulating local observables is of interest, then the circuit depth of the digital algorithm can be chosen to be independent of the system size NNN. This provides theoretical evidence for the utility of these algorithms for simulating physically relevant models, where typically local observables are of interest, on pre-fault tolerant devices. Finally, for the limiting case of Markovian dynamics with commuting jump operators, we propose two algorithms based on sampling a Wiener process and on a locally dilated Hamiltonian construction, respectively. These algorithms reduce the asymptotic gate complexity on NNN compared to currently available algorithms in terms of the required number of geometrically local gates.
Abstract We present a comprehensive end-to-end framework for simulating the real-time dynamics of chemical systems on a fault-tolerant quantum computer, incorporating both electronic and nuclear quantum degrees of freedom. An all-particle simulation is nominally efficient on a quantum computer, but practically infeasible. Hence, central to our approach is the construction of a first-quantized plane-wave algorithm making use of pseudoions. The latter consolidate chemically inactive electrons and the nucleus into a single effective dynamical ionic entity, extending the well-established concept of pseudopotentials in quantum chemistry to a two-body interaction. We explicitly describe efficient quantum circuits for initial state preparation across all degrees of freedom, as well as for block-encoding the Hamiltonian describing interacting pseudoions and chemically active electrons, by leveraging recent advances in quantum rejection sampling to optimize the implementations. To extract useful chemical information, we first design molecular fingerprints by combining density-functional calculations with machine learning techniques, and subsequently validate them through surrogate classical molecular dynamics simulations. These fingerprints are then coherently encoded on a quantum computer for efficient molecular identification via amplitude estimation. We provide an extensive analysis of the cost of running the algorithm on a fault-tolerant quantum computer for several chemically interesting systems. As an illustration, simulating the interaction between NH3 and BF3 (a 40-particle system) requires 808 logical qubits to encode the problem, and approximately 10^11 Toffoli gates per femtosecond of time evolution. Our results establish a foundation for further quantum algorithm development targeting chemical and material dynamics.