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:1607.03207 · Physical Review A

Modular quantum-information processing by dissipation

Jeffrey Marshall, Lorenzo Campos Venuti, Paolo Zanardi A

Published Nov 30, 2016• 13 citations
arXivHTMLPDF

Abstract

Dissipation can be used as a resource to control and simulate quantum systems. We discuss a modular model based on fast dissipation capable of performing universal quantum computation, and simulating arbitrary Lindbladian dynamics. The model consists of a network of elementary dissipation-generated modules and it is in principle scalable. In particular, we demonstrate the ability to dissipatively prepare all single-qubit gates, and the controlled-not gate; prerequisites for universal quantum computing. We also show a way to implement a type of quantum memory in a dissipative environment, whereby we can arbitrarily control the loss in both coherence, and concurrence, over the evolution. Moreover, our dissipation-assisted modular construction exhibits a degree of inbuilt robustness to Hamiltonian and, indeed, Lindbladian errors, and as such is of potential practical relevance.

DOI
10.1103/physreva.94.052339

Related papers

Dissipative universal Lindbladian simulation

Paolo Zanardi A, Jeffrey Marshall, Lorenzo Campos Venuti

It is by now well understood that quantum dissipative processes can be harnessed and turned into a resource for quantum-information processing tasks. In this paper we demonstrate yet another way in which this is true by providing a dissipation-assisted protocol for the simulation of general Markovian dynamics. More precisely, we show how a suitable coherent coupling of a quantum system to a set of Markovian dissipating qubits allows one to enact an effective Liouvillian generator of any Lindbladian form. This effective dynamical generator arises from high-order virtual-dissipative processes and governs the system dynamics exactly in the limit of infinitely fast dissipation. Applications to the simulation of collective decoherence are discussed as an illustration.

arXiv:1506.04311•Physical Review A•Feb 10, 2016•43 citations

Dissipation as a resource in quantum algorithms

Elias Zapusek

Quantum information processing holds immense promise, but its practical implementation is fundamentally challenged by dissipation, the irreversible loss of information and energy to the environment. The conventional approach treats dissipation as an obstacle to overcome, typically through resource-intensive quantum error correction. Such schemes impose overheads of orders of magnitude in terms of both qubits and operations. This creates significant space, control and time costs, making near-term practical implementation highly challenging. This thesis adopts a different viewpoint, harnessing dissipation for quantum algorithms. We explore the design, application, and conceptual advantages of dissipative quantum algorithms. We establish the foundational tools for this approach by demonstrating how to engineer a universal set of nonunitary operations using intrinsic, controllable dissipation. We present a hardware-efficient method, experimentally realized in a trapped-ion system, for implementing any two-qubit Markovian quantum channel without requiring ancilla qubits or measurements. This provides a practical and versatile toolbox for constructing dissipative algorithms on near-term quantum devices. Building on this, we apply these tools to an inherently dissipative task: the preparation of thermal states. We introduce a variational quantum-classical algorithm that integrates engineered nonunitary operations with unitary gates. By leveraging weak symmetries of the target Hamiltonian, we design efficient ansätze that significantly improve the fidelity of state preparation. Finally, we address one of the most significant barriers to scaling variational quantum algorithms: the prevalence of barren plateaus, where optimization gradients vanish exponentially with system size. We prove that dissipative algorithms, by incorporating periodic qubit resets, can mitigate both noise-induced and unitary barren plateaus. This mechanism allows for a class of scalable computations that are intractable for purely unitary approaches in the presence of noise. Together, these results demonstrate that dissipation is not just a source of error, but a powerful resource. By systematically developing the necessary operations, applying them to relevant problems, and identifying fundamental scalability advantages, this work showcases dissipative quantum computing as a compelling avenue in quantum information processing.

•Jan 1, 2025•0 citations

Universal Quantum Gate Set for Multi-Mode Schrödinger Cat States Stabilized by Non-Local Dissipation Engineering

Jesper Lind-Olsen, Jonas Lidal, Tron Omland +1 more

Schrödinger cat states provide a hardware-efficient platform for bosonic quantum error correction by encoding logical information in protected manifolds of harmonic oscillators. While previous work has demonstrated the dissipative stabilization of multi-mode Schrödinger cat states as robust quantum memories, a framework for universal quantum computation has remained unavailable. Here we work towards this by introducing a universal gate set for dissipatively stabilized multi-mode cat qubits as a necessary resource for computation. Using a chain of Kerr non-linear oscillators coupled through engineered non-local dissipation and an effective low-dimensional description, we show how single-qubit control can be achieved through arbitrary rotation around the $X$-axis and $π/2$-rotation around the $Z$-axis. We further show how coupling two such stabilized arrays through just one oscillator on each respective array enables coherent entangling operations through implementation of the $XX_{π/2}$ gate. Numerical simulations demonstrate high-fidelity gate dynamics and entanglement generation under realistic parameters. Finally, we analyze the effects of induced and intrinsic photon loss, disorder, and the validity regime of the effective low-dimensional theory. Our results establish dissipatively stabilized multi-mode Schrödinger cat states as a potential architecture for universal bosonic quantum computation.

quant-pharXiv:2607.13975•Jul 16, 2026•0 citations

Dissipation-assisted quantum computation in atom-cavity systems

Almut Beige, Hugo V. Cable, P. L. Knight

The principal obstacle to quantum information processing with many qubits is decoherence. One source of decoherence is spontaneous emission which causes loss of energy and information. Inability to control system parameters with high precision is another possible source of error. Strategies aimed at overcoming one kind of error typically increase sensitivity to others. As a solution we propose quantum computing with dissipation-assisted quantum gates. These can be run relatively fast while achieving fidelities close to one. The success rate of each gate operation can, at least in principle, be arbitrary close to one.

arXiv:quant-ph/0303151•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 16, 2003•9 citations

Dissipation as a resource for Quantum Reservoir Computing

Antonio Sannia, Rodrigo Martínez‐Peña, Miguel C. Soriano +2 more

Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.

arXiv:2212.12078•Quantum•Mar 20, 2024•42 citations

Rigorous error bounds for dissipative thermal state preparation from weak system-bath coupling

Christopher Ong, S. A. Parameswaran, Benedikt Placke +1 more

Thermal state preparation is a central challenge in the simulation of quantum many-body systems. Yet, provably efficient algorithms for this task were only introduced recently [Chen et al. Nature 646, 561 (2025)]. These algorithms are based on dissipative Lindbladian evolution which exactly fixes the thermal state. Controlled and efficient digital simulation of this evolution, although possible in principle, remains out of reach for present-day quantum hardware. Subsequent work has therefore focused on analog approximations of the proposed Lindbladians via `collision models' with relatively modest requirements -- a resettable bath of ancilla qubits whose couplings to the system can be tuned in time-dependent fashion -- while still admitting rigorous fixed-point error bounds. Existing rigorous approaches, however, do not exploit the fact that these constructions generically implement not only the desired Lindblad dynamics, but also an additional unitary evolution generated by the system Hamiltonian which may aid convergence to the thermal state [Lloyd and Abanin arXiv:2506.21318 (2025)]. Here, we show that this unitary contribution does indeed tighten the fixed-point error bound and demonstrate that it is rigorously controlled by the system-bath coupling strength $J$, scaling as $J^2$. This demonstrates that the effect of the spurious `Lamb shift' term generated by the system-bath interaction can be controlled by tuning $J$. We clarify the role, previously observed, of a randomized implementation in suppressing possible resonances of the drive with the many-body spectrum, and bound the additional variance that this randomization imposes on observables. Finally, we numerically study aspects of the protocol which are relevant for its practical realization, such as the mixing time.

quant-pharXiv:2605.03011•Physical Review A•May 6, 2026•0 citations
Dissipation can be used as a resource to control and simulate quantum systems. We discuss a modular model based on fast dissipation capable of performing universal quantum computation, and simulating arbitrary Lindbladian dynamics. The model consists of a network of elementary dissipation-generated modules and it is in principle scalable. In particular, we demonstrate the ability to dissipatively prepare all single-qubit gates, and the controlled-not gate; prerequisites for universal quantum computing. We also show a way to implement a type of quantum memory in a dissipative environment, whereby we can arbitrarily control the loss in both coherence, and concurrence, over the evolution. Moreover, our dissipation-assisted modular construction exhibits a degree of inbuilt robustness to Hamiltonian and, indeed, Lindbladian errors, and as such is of potential practical relevance.
It is by now well understood that quantum dissipative processes can be harnessed and turned into a resource for quantum-information processing tasks. In this paper we demonstrate yet another way in which this is true by providing a dissipation-assisted protocol for the simulation of general Markovian dynamics. More precisely, we show how a suitable coherent coupling of a quantum system to a set of Markovian dissipating qubits allows one to enact an effective Liouvillian generator of any Lindbladian form. This effective dynamical generator arises from high-order virtual-dissipative processes and governs the system dynamics exactly in the limit of infinitely fast dissipation. Applications to the simulation of collective decoherence are discussed as an illustration.
Quantum information processing holds immense promise, but its practical implementation is fundamentally challenged by dissipation, the irreversible loss of information and energy to the environment. The conventional approach treats dissipation as an obstacle to overcome, typically through resource-intensive quantum error correction. Such schemes impose overheads of orders of magnitude in terms of both qubits and operations. This creates significant space, control and time costs, making near-term practical implementation highly challenging. This thesis adopts a different viewpoint, harnessing dissipation for quantum algorithms. We explore the design, application, and conceptual advantages of dissipative quantum algorithms. We establish the foundational tools for this approach by demonstrating how to engineer a universal set of nonunitary operations using intrinsic, controllable dissipation. We present a hardware-efficient method, experimentally realized in a trapped-ion system, for implementing any two-qubit Markovian quantum channel without requiring ancilla qubits or measurements. This provides a practical and versatile toolbox for constructing dissipative algorithms on near-term quantum devices. Building on this, we apply these tools to an inherently dissipative task: the preparation of thermal states. We introduce a variational quantum-classical algorithm that integrates engineered nonunitary operations with unitary gates. By leveraging weak symmetries of the target Hamiltonian, we design efficient ansätze that significantly improve the fidelity of state preparation. Finally, we address one of the most significant barriers to scaling variational quantum algorithms: the prevalence of barren plateaus, where optimization gradients vanish exponentially with system size. We prove that dissipative algorithms, by incorporating periodic qubit resets, can mitigate both noise-induced and unitary barren plateaus. This mechanism allows for a class of scalable computations that are intractable for purely unitary approaches in the presence of noise. Together, these results demonstrate that dissipation is not just a source of error, but a powerful resource. By systematically developing the necessary operations, applying them to relevant problems, and identifying fundamental scalability advantages, this work showcases dissipative quantum computing as a compelling avenue in quantum information processing.
Schrödinger cat states provide a hardware-efficient platform for bosonic quantum error correction by encoding logical information in protected manifolds of harmonic oscillators. While previous work has demonstrated the dissipative stabilization of multi-mode Schrödinger cat states as robust quantum memories, a framework for universal quantum computation has remained unavailable. Here we work towards this by introducing a universal gate set for dissipatively stabilized multi-mode cat qubits as a necessary resource for computation. Using a chain of Kerr non-linear oscillators coupled through engineered non-local dissipation and an effective low-dimensional description, we show how single-qubit control can be achieved through arbitrary rotation around the XXX-axis and π/2π/2π/2-rotation around the ZZZ-axis. We further show how coupling two such stabilized arrays through just one oscillator on each respective array enables coherent entangling operations through implementation of the XXπ/2XX_{π/2}XXπ/2​ gate. Numerical simulations demonstrate high-fidelity gate dynamics and entanglement generation under realistic parameters. Finally, we analyze the effects of induced and intrinsic photon loss, disorder, and the validity regime of the effective low-dimensional theory. Our results establish dissipatively stabilized multi-mode Schrödinger cat states as a potential architecture for universal bosonic quantum computation.
The principal obstacle to quantum information processing with many qubits is decoherence. One source of decoherence is spontaneous emission which causes loss of energy and information. Inability to control system parameters with high precision is another possible source of error. Strategies aimed at overcoming one kind of error typically increase sensitivity to others. As a solution we propose quantum computing with dissipation-assisted quantum gates. These can be run relatively fast while achieving fidelities close to one. The success rate of each gate operation can, at least in principle, be arbitrary close to one.
Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.
Thermal state preparation is a central challenge in the simulation of quantum many-body systems. Yet, provably efficient algorithms for this task were only introduced recently [Chen et al. Nature 646, 561 (2025)]. These algorithms are based on dissipative Lindbladian evolution which exactly fixes the thermal state. Controlled and efficient digital simulation of this evolution, although possible in principle, remains out of reach for present-day quantum hardware. Subsequent work has therefore focused on analog approximations of the proposed Lindbladians via `collision models' with relatively modest requirements -- a resettable bath of ancilla qubits whose couplings to the system can be tuned in time-dependent fashion -- while still admitting rigorous fixed-point error bounds. Existing rigorous approaches, however, do not exploit the fact that these constructions generically implement not only the desired Lindblad dynamics, but also an additional unitary evolution generated by the system Hamiltonian which may aid convergence to the thermal state [Lloyd and Abanin arXiv:2506.21318 (2025)]. Here, we show that this unitary contribution does indeed tighten the fixed-point error bound and demonstrate that it is rigorously controlled by the system-bath coupling strength JJJ, scaling as J2J^2J2. This demonstrates that the effect of the spurious `Lamb shift' term generated by the system-bath interaction can be controlled by tuning JJJ. We clarify the role, previously observed, of a randomized implementation in suppressing possible resonances of the drive with the many-body spectrum, and bound the additional variance that this randomization imposes on observables. Finally, we numerically study aspects of the protocol which are relevant for its practical realization, such as the mixing time.