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:2106.12463 · Quantum Information and Computation

Universal control of quantum processes using sector-preserving channels

Augustin Vanrietvelde, Giulio Chiribella

Published Oct 7, 2021• 22 citations
arXivHTMLPDF

Abstract

No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we formalise the task achieved by these experiments, extending it to the control of arbitrary noisy channels, and to more general types of control involving higher dimensional control systems. For the standard notion of coherent control, we identify the information-theoretic resource for controlling an arbitrary quantum channel on a $d$-dimensional system: specifically, the resource is an extended quantum channel acting as the original channel on a $d$-dimensional sector of a $(d+1)$-dimensional system. Using this resource, arbitrary controlled channels can be built with a universal circuit architecture. We then extend the standard notion of control to more general notions, including control of multiple channels with possibly different input and output systems. Finally, we develop a theoretical framework, called supermaps on routed channels, which provides a compact representation of coherent control as an operation performed on the extended channels, and highlights the way the operation acts on different sectors.

DOI
10.26421/qic21.15-16-5

Related papers

Routed quantum circuits: an extended framework for coherent control and indefinite causal order

Augustin Vanrietvelde

Quantum circuits form the standard framework of quantum computing, and have started playing the same role for some parts of quantum foundations. However, they cannot satisfactorily capture some possibilities offered by quantum theory, in particular coherent control and indefinite causal order. In this thesis, we therefore propose an extension to this framework, given by routed quantum circuits. Our extension is based on the addition of sectorial constraints, which specify the basic sectorial structure of the scenarios at hand, on top of the factorial structure described by the connectivity of circuits. This yields a consistent and scalable framework, applicable to pure and mixed quantum theory. It admits a sound and intuitive diagrammatic notation. We show that this framework allows to properly model all forms of coherent control of the application of a channel, for instance the superposition of a quantum information carrier's trajectory, or the 'extended circuit diagrams' recently introduced for the study of causal decompositions. We demonstrate how this leads to a redefinition of the task of coherently controlling a channel, and study in detail the necessary resources for this task. We further show that the scenarios featuring indefinite causal order also fit within our framework once feedback loops are introduced. The connectivity and sectorial constraints are then sufficient to specify the core behaviour of a process, and in particular to check that it is valid, i.e. that its cycles do not lead to any logical inconsistency. We display how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way; we conjecture that this class in fact includes all unitarily extendible processes.

•Sep 1, 2022•0 citations

Quantum and classical resources for unitary design of open-system evolutions

Francesco Ticozzi, Lorenza Viola

Abstract A variety of tasks in quantum control, ranging from purification and cooling to quantum stabilisation and open-system simulation, rely on the ability to implement a target quantum channel over a specified time interval within prescribed accuracy. This can be achieved by engineering a suitable unitary dynamics of the system of interest along with its environment, which, depending on the available level of control, is fully or partly exploited as a coherent quantum controller . After formalising a controllability framework for completely positive trace-preserving quantum dynamics, we provide sufficient conditions on the environment state and dimension that allow for the realisation of relevant classes of quantum channels, including extreme channels, stochastic unitaries or simply any channel. The results hinge on generalisations of Stinespring’s dilation via a subsystem principle . In the process, we show that a conjecture by Lloyd on the minimal dimension of the environment required for arbitrary open-system simulation, albeit formally disproved, can in fact be salvaged, provided that classical randomisation is included among the available resources. Existing measurement-based feedback protocols for universal simulation, dynamical decoupling and dissipative state preparation are recast within the proposed coherent framework as concrete applications, and the resources they employ discussed in the light of the general results.

arXiv:1704.01486•Quantum Science and Technology•May 10, 2017•17 citations

Quantum Circuits with Classical Versus Quantum Control of Causal Order

Julian Wechs, Hippolyte Dourdent, Alastair A. Abbott +1 more

Quantum supermaps are transformations that map quantum operations to quantum operations.It is known that quantum supermaps which respect a definite, predefined causal order between their input operations correspond to fixed-order quantum circuits, also called quantum combs.A systematic understanding of the physical interpretation of more general types of quantum supermaps-in particular, those incompatible with a definite causal structure-is however lacking.In this paper, we identify two types of circuits that naturally generalize the fixed-order case and that likewise correspond to distinct classes of quantum supermaps, which we fully characterize.We first introduce "quantum circuits with classical control of causal order," in which the order of operations is still well defined, but not necessarily fixed in advance: it can, in particular, be established dynamically, in a classically controlled manner, as the circuit is being used.We then consider "quantum circuits with quantum control of causal order," in which the order of operations is controlled coherently.The supermaps described by these classes of circuits are physically realizable, and the latter encompasses all known examples of physically realizable processes with indefinite causal order, including the celebrated "quantum switch."Interestingly, it also contains other examples arising from the combination of dynamical and coherent control of causal order, and we detail explicitly one such process.Nevertheless, we show that quantum circuits with quantum control of causal order can only generate "causal" correlations, compatible with a well-defined causal order.We furthermore extend our considerations to probabilistic circuits that produce also classical outcomes, and we demonstrate by an example how the characterizations derived in this work allow us to identify advantages for quantum information processing tasks that could be demonstrated in practice.

arXiv:2101.08796•PRX Quantum•Aug 26, 2021•101 citations

Higher-Order Programs with Indefinite Causal Orders: a Linear Approach to Coherent Control of Quantum Processes

Kathleen Barsse, Romain Péchoux, Simon Perdrix

Processes with indefinite causal orders (ICOs), such as the quantum switch, are higher-order quantum processes that superpose the order in which quantum operations are performed. Such coherent control yields computational advantages but is not faithfully captured by existing quantum programming languages: either they are restricted to the unitary case, and thus cannot combine ICOs with measurement, or they treat coherent control nonlinearly. In both cases, they do not realize the full computational power of ICOs. We introduce a higher-order quantum functional language that supports general quantum computation, not merely the permutation of channels, and whose linear type system allows quantum control to be well-defined beyond the unitary case, on arbitrary quantum channels. We equip this language with a small-step operational semantics that synchronizes measurement outcomes across superposed branches, using device references and a memory function. We also give a denotational semantics by means of completely positive maps. With linearity as the only constraint, some well-typed terms would denote unphysical maps. We therefore impose a typing discipline that goes beyond linearity, and interpret programs in the causal category Caus[CPM], under which every well-typed program is physically meaningful, a property that can be checked statically and efficiently. We prove soundness, and study the language's expressive power: it can express every quantum channel at first order, and at second order a large subclass of the so-called quantum circuits with quantum control (QC-QCs), containing the quantum switch. Last but not least, we show that this language is well-designed enough to be extended to the nonlinear setting with recursion.

cs.LOCross-listedarXiv:2607.09534•Jul 13, 2026•2 citations

Routing Quantum Control of Causal Order

Maarten Grothus, Alastair A. Abbott, Augustin Vanrietvelde +1 more

In recent years, various frameworks have been proposed for the study of quantum processes with indefinite causal order. In particular, quantum circuits with quantum control of causal order (QC-QCs) form a broad class of physical supermaps obtained from a bottom-up construction and are believed to represent all quantum processes physically realisable in a fixed spacetime. Complementarily, the formalism of routed quantum circuits introduces quantum operations constrained by "routes" to represent processes in terms of a more fine-grained routed circuit decomposition. This decomposition, formalised using a so-called routed graph, represents the information flow within the respective process. However, the existence of routed circuit decompositions has only been established for a small set of processes so far, including both certain specific QC-QCs and more exotic processes as examples. In this work, we remedy this fact by connecting these two frameworks. We prove that for any given $N$, one can use a single routed graph to systematically obtain a routed circuit decomposition for any QC-QC with $N$ parties. We detail this construction explicitly and contrast it with other routed circuit decompositions of QC-QCs, which we obtain from alternative routed graphs. We conclude by pointing out how this connection can be useful to tackle various open problems in the field of indefinite causal order, particularly establishing circuit representations of subclasses of QC-QCs.

arXiv:2507.08781•Jul 11, 2025•6 citations

The Structure of Higher-Order Quantum Resources with an Application to Coherence

Felix Ahnefeld, Thomas Theurer, Martin B. Plenio

We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.

quant-pharXiv:2609.40186•Oct 1, 2026•0 citations
No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we formalise the task achieved by these experiments, extending it to the control of arbitrary noisy channels, and to more general types of control involving higher dimensional control systems. For the standard notion of coherent control, we identify the information-theoretic resource for controlling an arbitrary quantum channel on a ddd-dimensional system: specifically, the resource is an extended quantum channel acting as the original channel on a ddd-dimensional sector of a (d+1)(d+1)(d+1)-dimensional system. Using this resource, arbitrary controlled channels can be built with a universal circuit architecture. We then extend the standard notion of control to more general notions, including control of multiple channels with possibly different input and output systems. Finally, we develop a theoretical framework, called supermaps on routed channels, which provides a compact representation of coherent control as an operation performed on the extended channels, and highlights the way the operation acts on different sectors.
Quantum circuits form the standard framework of quantum computing, and have started playing the same role for some parts of quantum foundations. However, they cannot satisfactorily capture some possibilities offered by quantum theory, in particular coherent control and indefinite causal order. In this thesis, we therefore propose an extension to this framework, given by routed quantum circuits. Our extension is based on the addition of sectorial constraints, which specify the basic sectorial structure of the scenarios at hand, on top of the factorial structure described by the connectivity of circuits. This yields a consistent and scalable framework, applicable to pure and mixed quantum theory. It admits a sound and intuitive diagrammatic notation. We show that this framework allows to properly model all forms of coherent control of the application of a channel, for instance the superposition of a quantum information carrier's trajectory, or the 'extended circuit diagrams' recently introduced for the study of causal decompositions. We demonstrate how this leads to a redefinition of the task of coherently controlling a channel, and study in detail the necessary resources for this task. We further show that the scenarios featuring indefinite causal order also fit within our framework once feedback loops are introduced. The connectivity and sectorial constraints are then sufficient to specify the core behaviour of a process, and in particular to check that it is valid, i.e. that its cycles do not lead to any logical inconsistency. We display how several standard examples of exotic processes, including ones that violate causal inequalities, are among the class of processes that can be generated in this way; we conjecture that this class in fact includes all unitarily extendible processes.
Abstract A variety of tasks in quantum control, ranging from purification and cooling to quantum stabilisation and open-system simulation, rely on the ability to implement a target quantum channel over a specified time interval within prescribed accuracy. This can be achieved by engineering a suitable unitary dynamics of the system of interest along with its environment, which, depending on the available level of control, is fully or partly exploited as a coherent quantum controller . After formalising a controllability framework for completely positive trace-preserving quantum dynamics, we provide sufficient conditions on the environment state and dimension that allow for the realisation of relevant classes of quantum channels, including extreme channels, stochastic unitaries or simply any channel. The results hinge on generalisations of Stinespring’s dilation via a subsystem principle . In the process, we show that a conjecture by Lloyd on the minimal dimension of the environment required for arbitrary open-system simulation, albeit formally disproved, can in fact be salvaged, provided that classical randomisation is included among the available resources. Existing measurement-based feedback protocols for universal simulation, dynamical decoupling and dissipative state preparation are recast within the proposed coherent framework as concrete applications, and the resources they employ discussed in the light of the general results.
Quantum supermaps are transformations that map quantum operations to quantum operations.It is known that quantum supermaps which respect a definite, predefined causal order between their input operations correspond to fixed-order quantum circuits, also called quantum combs.A systematic understanding of the physical interpretation of more general types of quantum supermaps-in particular, those incompatible with a definite causal structure-is however lacking.In this paper, we identify two types of circuits that naturally generalize the fixed-order case and that likewise correspond to distinct classes of quantum supermaps, which we fully characterize.We first introduce "quantum circuits with classical control of causal order," in which the order of operations is still well defined, but not necessarily fixed in advance: it can, in particular, be established dynamically, in a classically controlled manner, as the circuit is being used.We then consider "quantum circuits with quantum control of causal order," in which the order of operations is controlled coherently.The supermaps described by these classes of circuits are physically realizable, and the latter encompasses all known examples of physically realizable processes with indefinite causal order, including the celebrated "quantum switch."Interestingly, it also contains other examples arising from the combination of dynamical and coherent control of causal order, and we detail explicitly one such process.Nevertheless, we show that quantum circuits with quantum control of causal order can only generate "causal" correlations, compatible with a well-defined causal order.We furthermore extend our considerations to probabilistic circuits that produce also classical outcomes, and we demonstrate by an example how the characterizations derived in this work allow us to identify advantages for quantum information processing tasks that could be demonstrated in practice.
Processes with indefinite causal orders (ICOs), such as the quantum switch, are higher-order quantum processes that superpose the order in which quantum operations are performed. Such coherent control yields computational advantages but is not faithfully captured by existing quantum programming languages: either they are restricted to the unitary case, and thus cannot combine ICOs with measurement, or they treat coherent control nonlinearly. In both cases, they do not realize the full computational power of ICOs. We introduce a higher-order quantum functional language that supports general quantum computation, not merely the permutation of channels, and whose linear type system allows quantum control to be well-defined beyond the unitary case, on arbitrary quantum channels. We equip this language with a small-step operational semantics that synchronizes measurement outcomes across superposed branches, using device references and a memory function. We also give a denotational semantics by means of completely positive maps. With linearity as the only constraint, some well-typed terms would denote unphysical maps. We therefore impose a typing discipline that goes beyond linearity, and interpret programs in the causal category Caus[CPM], under which every well-typed program is physically meaningful, a property that can be checked statically and efficiently. We prove soundness, and study the language's expressive power: it can express every quantum channel at first order, and at second order a large subclass of the so-called quantum circuits with quantum control (QC-QCs), containing the quantum switch. Last but not least, we show that this language is well-designed enough to be extended to the nonlinear setting with recursion.
In recent years, various frameworks have been proposed for the study of quantum processes with indefinite causal order. In particular, quantum circuits with quantum control of causal order (QC-QCs) form a broad class of physical supermaps obtained from a bottom-up construction and are believed to represent all quantum processes physically realisable in a fixed spacetime. Complementarily, the formalism of routed quantum circuits introduces quantum operations constrained by "routes" to represent processes in terms of a more fine-grained routed circuit decomposition. This decomposition, formalised using a so-called routed graph, represents the information flow within the respective process. However, the existence of routed circuit decompositions has only been established for a small set of processes so far, including both certain specific QC-QCs and more exotic processes as examples. In this work, we remedy this fact by connecting these two frameworks. We prove that for any given NNN, one can use a single routed graph to systematically obtain a routed circuit decomposition for any QC-QC with NNN parties. We detail this construction explicitly and contrast it with other routed circuit decompositions of QC-QCs, which we obtain from alternative routed graphs. We conclude by pointing out how this connection can be useful to tackle various open problems in the field of indefinite causal order, particularly establishing circuit representations of subclasses of QC-QCs.
We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.