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

Physical Review Letters

Programmable Open Quantum Systems

Mingrui Jing, Mengbo Guo, Lin Zhu, Hongshun Yao, Xin Wang

Published May 27, 2026• 0 citations
Publisher

Abstract

Programmability is a unifying paradigm for enacting families of quantum transformations via fixed processors and program states, with a fundamental role and broad impact in quantum computation and control. While there has been a shift from viewing open systems solely as a source of error to treating them as a computational resource, their programmability remains largely unexplored. In this Letter, we develop a framework that characterizes and quantifies the programmability of Lindbladian semigroups by combining physically implementable retrieval maps with time-varying program states. We identify quantum programmable classes enabled by symmetry and stochastic structures, including covariant semigroups and fully dissipative Pauli Lindbladians with finite program dimension. We further provide a necessary condition for physical programmability that rules out coherent generators and typical dissipators generating amplitude damping. For such nonphysically programmable cases, we construct quasisampling protocols with finite resources. Finally, we introduce an operational programming cost, defined via the number of samples required to program the Lindbladian, and establish its core structural properties. These results provide a notion of programming cost for Lindbladians, bridge programmable channel theory and open system dynamics, and yield symmetry-driven compression schemes and actionable resource estimates for the semigroup simulation and control in noisy quantum technologies.

DOI
10.1103/yqlr-2dhr

Related papers

Programmable Open Quantum Systems

Mingrui Jing, Mengbo Guo, Lin Zhu +2 more

Programmability is a unifying paradigm for enacting families of quantum transformations via fixed processors and program states, with a fundamental role and broad impact in quantum computation and control. While there has been a shift from viewing open systems solely as a source of error to treating them as a computational resource, their programmability remains largely unexplored. In this work, we develop a framework that characterizes and quantifies the programmability of Lindbladian semigroups by combining physically implementable retrieval maps with time varying program states. Within this framework, we identify quantum programmable classes enabled by symmetry and stochastic structure, including covariant semigroups and fully dissipative Pauli Lindbladians with finite program dimension. We further provide a necessary condition for physical programmability that rules out coherent generators and typical dissipators generating amplitude damping. For such nonphysically programmable cases, we construct explicit protocols with finite resources. Finally, we introduce an operational programming cost, defined via the number of samples required to program the Lindbladian, and establish its core structural properties, such as continuity and faithfulness. These results provide a notion of programming cost for Lindbladians, bridge programmable channel theory and open system dynamics, and yield symmetry driven compression schemes and actionable resource estimates for semigroup simulation and control in noisy quantum technologies.

quant-pharXiv:2512.08279•Dec 10, 2025•0 citations

Controlling open quantum systems

Benjamin Dive

All physical quantum systems are in contact with the external world which is inevitably a source of noise. It is therefore necessary to take into account this dissipation when designing controls that accomplish useful tasks in quantum information processing. This thesis is on that overlap of open quantum systems and control theory; it looks at what dynamics can happen with the use of external driving, and how this driving can be chosen to accomplish a desired goal. The first result looks at how a given quantum dissipator can be manipulated, using coherent controls, into replicating the action of a different type of noise. This results in no-go theorems for how noise can be transformed based on its isotropy, with applications in simulating open systems. Another way of doing simulations is to use only unitary dynamics over the system and a finite dimensional ancilla, and it is proved that there always exists a dilation Hamiltonian that replicates the noisy dynamics continuously in time. This also highlights the fact that adding controls on noise can result in a different evolution than if the controls were done on the under- lying system-environment level. A conjecture is introduced and studied which states that both approaches are equivalent in the special case of the controls commuting with the Lindbladian. A way around this difficulty is to use a quantum system to compute in situ which controls are best for achieving a desired task on itself. This problem is studied in the context of reaching entangling gates on a quantum simulator in order to upgrade it into a quantum computer. The experimental cost of doing so is found to be polynomial in the number of qubits in simulations. The same underlying principle is also used to find error correcting codes tailored to the dissipation in a system.

•Sep 1, 2017•2 citations

Ansatz-Free Learning of Lindbladian Dynamics In Situ

Petr Ivashkov, Nikita Romanov, Weiyuan Gong +3 more

Characterizing the dynamics of open quantum systems at the level of microscopic interactions and error mechanisms is essential for calibrating quantum hardware, designing robust simulation protocols, and developing tailored error-correction methods. Under Markovian noise/dissipation, a natural characterization approach is to identify the full Lindbladian generator that gives rise to both coherent (Hamiltonian) and dissipative dynamics. Prior protocols for learning Lindbladians from dynamical data assumed pre-specified interaction structure, which can be restrictive when the relevant noise channels or control imperfections are not known in advance. In this paper, we present a sample-efficient protocol for learning sparse Lindbladians without assuming any a priori structure. Our protocol is ancilla-free, uses only product-state preparations and Pauli-basis measurements, admits provably stable coefficient reconstruction, and achieves near-optimal time resolution, making it compatible with near-term experimental capabilities. Together, this provides a systematic route to scalable characterization of open-system quantum dynamics, especially in settings where the error mechanisms of interest are unknown.

quant-pharXiv:2603.05492•Mar 6, 2026•0 citations

Programmable Dissipation via Partial Quantum Error Correction

Sameer Dambal, Michael AD Taylor, Yu Zhang

Noise is typically treated as the adversary of quantum information processing. For open quantum dynamics, however, dissipation is part of the target physics, creating a tension with fault-tolerant architectures designed to suppress decoherence. Here we show that logical noise can instead be turned into a calibrated resource. We treat the error-correction cycle as a programmable primitive: one fault-tolerant round induces a logical completely positive trace-preserving map, and decoder/recovery randomization generates a controllable family of logical channels whose convex mixtures realize Kraus-channel mixing. This enables direct compilation of target dissipators into effective logical dynamics without explicit ancilla qubits for encoding the bath degree of freedoms. We derive an accuracy criterion for multi-step simulation in which the code distance is chosen so that uncontrolled logical errors remain a small fraction of the intended dissipation per step, rather than being driven below an arbitrarily small closed-system tolerance. Partial quantum error correction thus repurposes fault-tolerant structure to sculpt dissipation, offering a resource-efficient route to quantum simulation of open quantum systems.

quant-pharXiv:2605.30217•May 29, 2026•0 citations

Programmability of covariant quantum channels

Martina Gschwendtner, Andreas Blühm, Andreas Winter

A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional program register for any set that contains infinitely many unitary quantum channels (Nielsen and Chuang's No-Programming Theorem ), meaning that a universal programmable quantum processor does not exist. The situation changes if the system has symmetries. Indeed, here we consider group-covariant channels. If the group acts irreducibly on the channel input, these channels can be implemented exactly by a programmable quantum processor with finite program dimension (via teleportation simulation , which uses the Choi-Jamiolkowski state of the channel as a program). Moreover, by leveraging the representation theory of the symmetry group action, we show how to remove redundancy in the program and prove that the resulting program register has minimum Hilbert space dimension. Furthermore, we provide upper and lower bounds on the program register dimension of a processor implementing all group-covariant channels approximately.

arXiv:2012.00717•Quantum•Jun 29, 2021•16 citations

Quantum Telescoping Part VII: Telescoping for Open Quantum Systems (Lindbladian Dynamics)

Joshua Bald

This paper extends the theory of quantum telescoping to open quantum systems governedby Lindblad generators. We develop a comprehensive channel-level telescoping framework forcompletely positive trace-preserving (CPTP) semigroups and conduct a rigorous analysis ofachievable convergence rates in Lindbladian simulation. We show that dissipative dynamicswith non-normal generators admit at best power-law telescoping under physically reasonableoracle models, in sharp contrast with the exponential telescoping possible for Hamiltonian evolution.We identify structural conditions—such as normality, commutativity, or unitary dilation—under which faster convergence may occur, and we establish that the absence of efficientquantum signal processing mechanisms obstructs exponential telescoping for typical non-normalLindbladians. We provide detailed convergence analysis, explicit error bounds, computationalcomplexity characterizations, and concrete examples including a non-normal toy model illustratingpseudospectral obstructions. These results establish fundamental limits on open-systemsimulation and clarify the distinction between coherent and dissipative quantum dynamics froma telescoping perspective, with implications for quantum algorithm design, noise modeling, andquantum thermodynamics.

•Feb 4, 2026•0 citations
Programmability is a unifying paradigm for enacting families of quantum transformations via fixed processors and program states, with a fundamental role and broad impact in quantum computation and control. While there has been a shift from viewing open systems solely as a source of error to treating them as a computational resource, their programmability remains largely unexplored. In this Letter, we develop a framework that characterizes and quantifies the programmability of Lindbladian semigroups by combining physically implementable retrieval maps with time-varying program states. We identify quantum programmable classes enabled by symmetry and stochastic structures, including covariant semigroups and fully dissipative Pauli Lindbladians with finite program dimension. We further provide a necessary condition for physical programmability that rules out coherent generators and typical dissipators generating amplitude damping. For such nonphysically programmable cases, we construct quasisampling protocols with finite resources. Finally, we introduce an operational programming cost, defined via the number of samples required to program the Lindbladian, and establish its core structural properties. These results provide a notion of programming cost for Lindbladians, bridge programmable channel theory and open system dynamics, and yield symmetry-driven compression schemes and actionable resource estimates for the semigroup simulation and control in noisy quantum technologies.
Programmability is a unifying paradigm for enacting families of quantum transformations via fixed processors and program states, with a fundamental role and broad impact in quantum computation and control. While there has been a shift from viewing open systems solely as a source of error to treating them as a computational resource, their programmability remains largely unexplored. In this work, we develop a framework that characterizes and quantifies the programmability of Lindbladian semigroups by combining physically implementable retrieval maps with time varying program states. Within this framework, we identify quantum programmable classes enabled by symmetry and stochastic structure, including covariant semigroups and fully dissipative Pauli Lindbladians with finite program dimension. We further provide a necessary condition for physical programmability that rules out coherent generators and typical dissipators generating amplitude damping. For such nonphysically programmable cases, we construct explicit protocols with finite resources. Finally, we introduce an operational programming cost, defined via the number of samples required to program the Lindbladian, and establish its core structural properties, such as continuity and faithfulness. These results provide a notion of programming cost for Lindbladians, bridge programmable channel theory and open system dynamics, and yield symmetry driven compression schemes and actionable resource estimates for semigroup simulation and control in noisy quantum technologies.
All physical quantum systems are in contact with the external world which is inevitably a source of noise. It is therefore necessary to take into account this dissipation when designing controls that accomplish useful tasks in quantum information processing. This thesis is on that overlap of open quantum systems and control theory; it looks at what dynamics can happen with the use of external driving, and how this driving can be chosen to accomplish a desired goal. The first result looks at how a given quantum dissipator can be manipulated, using coherent controls, into replicating the action of a different type of noise. This results in no-go theorems for how noise can be transformed based on its isotropy, with applications in simulating open systems. Another way of doing simulations is to use only unitary dynamics over the system and a finite dimensional ancilla, and it is proved that there always exists a dilation Hamiltonian that replicates the noisy dynamics continuously in time. This also highlights the fact that adding controls on noise can result in a different evolution than if the controls were done on the under- lying system-environment level. A conjecture is introduced and studied which states that both approaches are equivalent in the special case of the controls commuting with the Lindbladian. A way around this difficulty is to use a quantum system to compute in situ which controls are best for achieving a desired task on itself. This problem is studied in the context of reaching entangling gates on a quantum simulator in order to upgrade it into a quantum computer. The experimental cost of doing so is found to be polynomial in the number of qubits in simulations. The same underlying principle is also used to find error correcting codes tailored to the dissipation in a system.
Characterizing the dynamics of open quantum systems at the level of microscopic interactions and error mechanisms is essential for calibrating quantum hardware, designing robust simulation protocols, and developing tailored error-correction methods. Under Markovian noise/dissipation, a natural characterization approach is to identify the full Lindbladian generator that gives rise to both coherent (Hamiltonian) and dissipative dynamics. Prior protocols for learning Lindbladians from dynamical data assumed pre-specified interaction structure, which can be restrictive when the relevant noise channels or control imperfections are not known in advance. In this paper, we present a sample-efficient protocol for learning sparse Lindbladians without assuming any a priori structure. Our protocol is ancilla-free, uses only product-state preparations and Pauli-basis measurements, admits provably stable coefficient reconstruction, and achieves near-optimal time resolution, making it compatible with near-term experimental capabilities. Together, this provides a systematic route to scalable characterization of open-system quantum dynamics, especially in settings where the error mechanisms of interest are unknown.
Noise is typically treated as the adversary of quantum information processing. For open quantum dynamics, however, dissipation is part of the target physics, creating a tension with fault-tolerant architectures designed to suppress decoherence. Here we show that logical noise can instead be turned into a calibrated resource. We treat the error-correction cycle as a programmable primitive: one fault-tolerant round induces a logical completely positive trace-preserving map, and decoder/recovery randomization generates a controllable family of logical channels whose convex mixtures realize Kraus-channel mixing. This enables direct compilation of target dissipators into effective logical dynamics without explicit ancilla qubits for encoding the bath degree of freedoms. We derive an accuracy criterion for multi-step simulation in which the code distance is chosen so that uncontrolled logical errors remain a small fraction of the intended dissipation per step, rather than being driven below an arbitrarily small closed-system tolerance. Partial quantum error correction thus repurposes fault-tolerant structure to sculpt dissipation, offering a resource-efficient route to quantum simulation of open quantum systems.
A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional program register for any set that contains infinitely many unitary quantum channels (Nielsen and Chuang's No-Programming Theorem ), meaning that a universal programmable quantum processor does not exist. The situation changes if the system has symmetries. Indeed, here we consider group-covariant channels. If the group acts irreducibly on the channel input, these channels can be implemented exactly by a programmable quantum processor with finite program dimension (via teleportation simulation , which uses the Choi-Jamiolkowski state of the channel as a program). Moreover, by leveraging the representation theory of the symmetry group action, we show how to remove redundancy in the program and prove that the resulting program register has minimum Hilbert space dimension. Furthermore, we provide upper and lower bounds on the program register dimension of a processor implementing all group-covariant channels approximately.
This paper extends the theory of quantum telescoping to open quantum systems governedby Lindblad generators. We develop a comprehensive channel-level telescoping framework forcompletely positive trace-preserving (CPTP) semigroups and conduct a rigorous analysis ofachievable convergence rates in Lindbladian simulation. We show that dissipative dynamicswith non-normal generators admit at best power-law telescoping under physically reasonableoracle models, in sharp contrast with the exponential telescoping possible for Hamiltonian evolution.We identify structural conditions—such as normality, commutativity, or unitary dilation—under which faster convergence may occur, and we establish that the absence of efficientquantum signal processing mechanisms obstructs exponential telescoping for typical non-normalLindbladians. We provide detailed convergence analysis, explicit error bounds, computationalcomplexity characterizations, and concrete examples including a non-normal toy model illustratingpseudospectral obstructions. These results establish fundamental limits on open-systemsimulation and clarify the distinction between coherent and dissipative quantum dynamics froma telescoping perspective, with implications for quantum algorithm design, noise modeling, andquantum thermodynamics.