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:2606.27856

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

Zeqing Wang, Julian D. Teske, Anshuman Bhardwaj, Masahiro O. Takahashi, Seiji Yunoki

quant-phSubmitted Jun 26, 2026• Announced Jun 29, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
20 pages, 9 figures

Related papers

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

Kushagra Garg, Zeeshan Ahmed, Subhadip Mitra +1 more

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.

arXiv:2504.21564•Physical Review A•Jul 29, 2025•2 citations

Revealing the quantum nature of memory in non-Markovian dynamics on IBM quantum

Charlotte Bäcker, Krishna Palaparthy, Walter T. Strunz

Abstract We investigate memory effects in non-Markovian dynamics on superconducting quantum processors provided by IBM Quantum. We use a collision-model approach to implement suitable single- and two-qubit dynamics with a gate-based quantum circuit. Coupling the system of interest to an ancilla allows for a characterization of the process with respect to non-Markovian memory effects in general, as well as concerning the quantumness of that memory. We demonstrate that current noisy quantum hardware is capable of verifying quantum memory in single-qubit dynamics. We then discuss why a generalization of this dynamics to the two-qubit case cannot directly be simulated in a way that allows quantum memory to be observed. Nevertheless, we present an alternative toy example that demonstrates how quantum memory of two-qubit dynamics can be witnessed using current noisy quantum computers.

arXiv:2510.19522•New Journal of Physics•Apr 1, 2026•0 citations

Low-depth simulation of non-Markovianity under quantum hardware noise

Diana A. Chisholm

Simulating open quantum systems on digital quantum computers typically relies on the use of auxiliary qubits, resulting in overheads of noisy multi-qubit gates, that severely limit execution on near-term hardware. In this work, we explore the simulation of non-Markovian dynamics as well as memory channels leveraging the method of trajectory mixing, valid for mixed unitary channels. This allows to drastically reduce circuit depth, trading entangling gates for a statistical mixture of independent, pure state trajectories. Using a realistic noise model calibrated to modern quantum processors, we show the benefits of this approach, yielding higher state fidelity and better preservation of quantum correlations. This shows the possibility of simulating long-time non-Markovian evolutions with low noise and limited resources.

quant-pharXiv:2607.05519•Jul 8, 2026•0 citations

Variational quantum simulation of many-body dissipative dynamics on a superconducting quantum processor

Huanyu Liu, Tai‐Ping Sun, Zhao‐Yun Chen +7 more

Open quantum systems host a wide range of intriguing phenomena, yet their simulation on well-controlled quantum devices is challenging, owing to the exponential growth of the Hilbert space and the inherently non-unitary nature of the dynamics. Here we propose and experimentally demonstrate a variational quantum algorithm capable of scalable simulation of non-unitary many-body dissipative dynamics. The algorithm builds on the framework of linear combination of Hamiltonian simulation, which converts non-unitary dynamics into a weighted sum of unitary evolutions. With the further introduction of a simplified quantum circuit for loss-function evaluation, our scheme is suitable for near-term quantum hardware, with the circuit depth independent of the simulation time. We illustrate our scheme by simulating the collective dynamics of a dissipative transverse Ising model, as well as an interacting Hatano-Nelson model, on the superconducting quantum processor Wukong. Our work underlines the capability of noisy intermediate-scale quantum devices in simulating dissipative many-body dynamics and represents a step forward in exploiting their potential for solving outstanding physical problems.

arXiv:2510.20118•Oct 23, 2025•0 citations

Utility-scale quantum experiments using dynamic circuits to address collective dissipation in interacting qubits

Benjamin Tirado, Joana Fraxanet, Adrián Juan-Delgado +2 more

Open quantum systems are central to quantum optics, condensed matter, and chemistry, yet their simulation remains challenging for both classical and near-term quantum hardware. In this work we implement and execute utility-scale quantum circuits that accurately reproduce the dissipative dynamics of interacting qubits. We consider a one-dimensional chain of many qubits weakly coupled to a common Markovian bath. The Markovian time evolution of the system is implemented through Trotterized evolution with the introduction of ancilla-assisted dissipative channels, including single-qubit and two-qubit dissipators to capture collective decay. Mid-circuit measurements, conditional gates, and hardware-aware transpilation significantly reduce circuit depth. We further implement a biased Clifford data regression (biased CDR), an error mitigation strategy that outperforms the uniform Cliffordization baseline and a variety of zero-noise extrapolation protocols. We execute large-scale quantum experiments of the dynamics of chains comprising up to 86 emitters on the IBM System Two \texttt{ibm\_basquecountry}. In order to do so, we use 129 total qubits (including ancillas), with the largest circuits contain about 8000 two-qubit gates. To validate these experiments we develop a classical Monte Carlo-Time-Evolving Block-Decimation (MC-TEBD) tensor-network method that incorporates reset operations through stochastic pure-state trajectories, obtaining very good agreement. The approach presented here opens a practical route for utility-scale quantum simulation of dissipative dynamics, enabled by dynamic circuits, targeted error mitigation, and tensor-network validation, and enables to tackle complex dynamics of systems such as quantum emitters in dissipative optical cavities.

quant-pharXiv:2605.25830•May 26, 2026•0 citations

Realization of quantum signal processing on a noisy quantum computer

Yuta Kikuchi, Conor Mc Keever, Luuk Coopmans +2 more

Abstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in general. We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. To illustrate the approach, we consider the application of Hamiltonian simulation for which QSP implements a polynomial approximation of the time evolution operator. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. In particular, we compute the time dependence of bipartite entanglement entropies for Ising spin chains and find good agreements with exact numerical simulations. To make the best use of the device, we determine optimal experimental parameters by using a simplified error model for the hardware and numerically studying the trade-off between Hamiltonian simulation time, polynomial degree, and total accuracy. Our results are the first step in the experimental realization of QSP-based quantum algorithms.

arXiv:2303.05533•npj Quantum Information•Sep 23, 2023•41 citations
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.
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.
Abstract We investigate memory effects in non-Markovian dynamics on superconducting quantum processors provided by IBM Quantum. We use a collision-model approach to implement suitable single- and two-qubit dynamics with a gate-based quantum circuit. Coupling the system of interest to an ancilla allows for a characterization of the process with respect to non-Markovian memory effects in general, as well as concerning the quantumness of that memory. We demonstrate that current noisy quantum hardware is capable of verifying quantum memory in single-qubit dynamics. We then discuss why a generalization of this dynamics to the two-qubit case cannot directly be simulated in a way that allows quantum memory to be observed. Nevertheless, we present an alternative toy example that demonstrates how quantum memory of two-qubit dynamics can be witnessed using current noisy quantum computers.
Simulating open quantum systems on digital quantum computers typically relies on the use of auxiliary qubits, resulting in overheads of noisy multi-qubit gates, that severely limit execution on near-term hardware. In this work, we explore the simulation of non-Markovian dynamics as well as memory channels leveraging the method of trajectory mixing, valid for mixed unitary channels. This allows to drastically reduce circuit depth, trading entangling gates for a statistical mixture of independent, pure state trajectories. Using a realistic noise model calibrated to modern quantum processors, we show the benefits of this approach, yielding higher state fidelity and better preservation of quantum correlations. This shows the possibility of simulating long-time non-Markovian evolutions with low noise and limited resources.
Open quantum systems host a wide range of intriguing phenomena, yet their simulation on well-controlled quantum devices is challenging, owing to the exponential growth of the Hilbert space and the inherently non-unitary nature of the dynamics. Here we propose and experimentally demonstrate a variational quantum algorithm capable of scalable simulation of non-unitary many-body dissipative dynamics. The algorithm builds on the framework of linear combination of Hamiltonian simulation, which converts non-unitary dynamics into a weighted sum of unitary evolutions. With the further introduction of a simplified quantum circuit for loss-function evaluation, our scheme is suitable for near-term quantum hardware, with the circuit depth independent of the simulation time. We illustrate our scheme by simulating the collective dynamics of a dissipative transverse Ising model, as well as an interacting Hatano-Nelson model, on the superconducting quantum processor Wukong. Our work underlines the capability of noisy intermediate-scale quantum devices in simulating dissipative many-body dynamics and represents a step forward in exploiting their potential for solving outstanding physical problems.
Open quantum systems are central to quantum optics, condensed matter, and chemistry, yet their simulation remains challenging for both classical and near-term quantum hardware. In this work we implement and execute utility-scale quantum circuits that accurately reproduce the dissipative dynamics of interacting qubits. We consider a one-dimensional chain of many qubits weakly coupled to a common Markovian bath. The Markovian time evolution of the system is implemented through Trotterized evolution with the introduction of ancilla-assisted dissipative channels, including single-qubit and two-qubit dissipators to capture collective decay. Mid-circuit measurements, conditional gates, and hardware-aware transpilation significantly reduce circuit depth. We further implement a biased Clifford data regression (biased CDR), an error mitigation strategy that outperforms the uniform Cliffordization baseline and a variety of zero-noise extrapolation protocols. We execute large-scale quantum experiments of the dynamics of chains comprising up to 86 emitters on the IBM System Two \texttt{ibm\_basquecountry}. In order to do so, we use 129 total qubits (including ancillas), with the largest circuits contain about 8000 two-qubit gates. To validate these experiments we develop a classical Monte Carlo-Time-Evolving Block-Decimation (MC-TEBD) tensor-network method that incorporates reset operations through stochastic pure-state trajectories, obtaining very good agreement. The approach presented here opens a practical route for utility-scale quantum simulation of dissipative dynamics, enabled by dynamic circuits, targeted error mitigation, and tensor-network validation, and enables to tackle complex dynamics of systems such as quantum emitters in dissipative optical cavities.
Abstract Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is challenging because it requires a deep quantum circuit in general. We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step. To illustrate the approach, we consider the application of Hamiltonian simulation for which QSP implements a polynomial approximation of the time evolution operator. We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell. In particular, we compute the time dependence of bipartite entanglement entropies for Ising spin chains and find good agreements with exact numerical simulations. To make the best use of the device, we determine optimal experimental parameters by using a simplified error model for the hardware and numerically studying the trade-off between Hamiltonian simulation time, polynomial degree, and total accuracy. Our results are the first step in the experimental realization of QSP-based quantum algorithms.