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:2103.02073 · Leibniz international proceedings in informatics

Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams

Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix

Published Jan 1, 2021• 12 citations
arXivHTMLPDF

Abstract

Even though coherent control of quantum operations appears to be achievable in practice, it is still not yet well understood. Among theoretical challenges, standard completely positive trace preserving (CPTP) maps are known not to be appropriate to represent coherently controlled quantum channels. We introduce here a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS). We consider different situations of coherent control and disambiguate CPTP maps by considering purified channels, an extension of Stinespring’s dilation. First, we show that in classical control settings, the observational equivalence classes of purified channels correspond to the standard definition of quantum channels (CPTP maps). Then, we propose a refinement of this equivalence class generalising the "half quantum switch" situation, where one is allowed to coherently control which quantum channel is applied; in this case, quantum channel implementations can be distinguished using a so-called transformation matrix. A further refinement characterising observational equivalence with general extended PBS-diagrams as contexts is also obtained. Finally, we propose a refinement that could be used for more general coherent control settings.

DOI
10.4230/lipics.mfcs.2021.22

Related papers

PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations

Alexandre Clément, Simon Perdrix

We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. Coherent control, and in particular indefinite causal order, is known to enable multiple computational and communication advantages over classically ordered models like quantum circuits. The PBS-calculus is inspired by quantum optics, in particular the polarising beam splitter (PBS for short). We formalise the syntax and the semantics of the PBS-diagrams, and we equip the language with an equational theory, which is proved to be sound and complete: two diagrams are representing the same quantum evolution if and only if one can be transformed into the other using the rules of the PBS-calculus. Moreover, we show that the equational theory is minimal. Finally, we consider applications like the implementation of controlled permutations and the unrolling of loops.

arXiv:2002.09387•Leibniz international proceedings in informatics•Jan 1, 2020•23 citations

PBS-calculus: A Graphical Language for Quantum-Controlled Computations

Alexandre Clément, Simon Perdrix

We introduce the PBS-calculus to represent and reason on quantum computations involving polarising beam splitters (PBS for short). PBS-diagrams can be used to represent various schemes including quantum-controlled computations, which are known to have multiple computational and communication advantages over classically ordered models like quantum circuits. The PBS-calculus is equipped with an equational theory, which is proved to be sound and complete: two diagrams are representing the same quantum evolution if and only if one can be transformed into the other using the rules of the PBS-calculus. Moreover, we show that the equational theory is minimal. Finally, we show that any PBS-diagram involving only unitary matrices can be transformed into a diagram without feedback loop.

•Feb 21, 2020•3 citations

Communication through coherent control of quantum channels

Alastair A. Abbott, Julian Wechs, Dominic C. Horsman +2 more

\n A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter, a surprising result was shown [D. Ebler et al., Phys. Rev. Lett. 120, 120502 (2018)]: if a quantum state passes through two such channels in a quantum superposition of different orders---a setup known as the "quantum switch"---then information can nevertheless be transmitted through the channels. It is perhaps tempting to attribute this result to the indefinite causal order between the channels. Here, however, we show that a similar effect can be obtained when one coherently controls between applying one of two identical depolarising channels to a target system. Such a situation involves no indefinite causal order; we argue that this result should therefore rather be understood as resulting from coherent control of channels. Additionally, we see that when quantum channels are controlled coherently, information about their specific implementation is accessible in the output state of the joint control-target system. This allows two different implementations of what is usually considered to be the same channel to therefore be differentiated. More generally, we find that to completely describe the action of a coherently controlled quantum channel, one needs to specify not only a description of the channel (e.g., in terms of Kraus operators), but an additional "transformation matrix" depending on its implementation.\n

•Jan 1, 2018•95 citations

Quantum Channels and Quantum Operations

Reinhold A. Bertlmann, Nicolai Friis

Abstract In this chapter we visit the ‘church of the larger Hilbert space’: we take a closer look at the relationship of pure and mixed quantum states via purification, and discuss a similar connection between completely positive and trace-preserving (CPTP) maps and unitary dynamics on a larger Hilbert space. We show that such CPTP maps, which represent quantum channels, are equivalent to operations admitting a Kraus decomposition, as well as to unitary dynamics on a larger Hilbert space with factoring initial condition, the famous Stinespring dilation of quantum operations. In this context we introduce the Choi-Jamiołkowski isomorphism, which expresses a duality between maps between two Hilbert spaces and states on tensor products of these Hilbert spaces, and we review several important examples of quantum channels such as the dephasing channel, amplitude-damping channel, and depolarizing channel. Finally, we examine operations that are not possible in quantum theory, focusing on the no-cloning theorem.

Oxford University Press eBooks•Sep 7, 2023•2 citations

Supermaps between channels of any type

Robert F. Allen, Dominic Verdon

Supermaps between quantum channels (completely positive trace-preserving (CPTP) maps of matrix algebras) were introduced in [Chiribella et al., EPL 83(3) (2008)]. In this work we generalise to supermaps between channels of any type; by channels we mean CPTP maps of finite-dimensional C*-algebras. Channels include POVMs, quantum instruments, classically controlled families of quantum channels, classical channels, quantum multimeters, and more. We show that deterministic supermaps between channels of any type can be realised using simple circuits, recovering the previous realisation theorems of [Chiribella et al., EPL 83(3) (2008)] (for deterministic supermaps between quantum channels) and [Bluhm et al. (2024)] (for deterministic supermaps between quantum multimeters) as special cases. To prove this realisation theorem we use the graphical calculus of the 2-category of finite-dimensional 2-Hilbert spaces; the paper includes an accessible and elementary introduction to this graphical calculus, and no prior knowledge of category theory is expected of the reader.

arXiv:2410.01389•Oct 2, 2024•1 citation

Choi representation of completely positive maps in brief

Gábor Homa, Adrián Ortega, Mátyás Koniorczyk

Abstract The Choi representation of completely positive trace preserving (CPTP) maps, i.e. quantum channels is often used in the context of quantum information and computation as it is easy to work with. It is a correspondence between CPTP maps and quantum states also termed as the Choi–Jamiołkowski isomorphism. It is especially useful if a parametrization of the set of CPTP maps is needed in order to consider a general map or optimize over the set of these. Here we provide a brief introduction to this topic, focusing on certain useful calculational techniques which are presented in full detail.

arXiv:2402.12944•Zeitschrift für Naturforschung A•Oct 17, 2024•16 citations
Even though coherent control of quantum operations appears to be achievable in practice, it is still not yet well understood. Among theoretical challenges, standard completely positive trace preserving (CPTP) maps are known not to be appropriate to represent coherently controlled quantum channels. We introduce here a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS). We consider different situations of coherent control and disambiguate CPTP maps by considering purified channels, an extension of Stinespring’s dilation. First, we show that in classical control settings, the observational equivalence classes of purified channels correspond to the standard definition of quantum channels (CPTP maps). Then, we propose a refinement of this equivalence class generalising the "half quantum switch" situation, where one is allowed to coherently control which quantum channel is applied; in this case, quantum channel implementations can be distinguished using a so-called transformation matrix. A further refinement characterising observational equivalence with general extended PBS-diagrams as contexts is also obtained. Finally, we propose a refinement that could be used for more general coherent control settings.
We introduce the PBS-calculus to represent and reason on quantum computations involving coherent control of quantum operations. Coherent control, and in particular indefinite causal order, is known to enable multiple computational and communication advantages over classically ordered models like quantum circuits. The PBS-calculus is inspired by quantum optics, in particular the polarising beam splitter (PBS for short). We formalise the syntax and the semantics of the PBS-diagrams, and we equip the language with an equational theory, which is proved to be sound and complete: two diagrams are representing the same quantum evolution if and only if one can be transformed into the other using the rules of the PBS-calculus. Moreover, we show that the equational theory is minimal. Finally, we consider applications like the implementation of controlled permutations and the unrolling of loops.
We introduce the PBS-calculus to represent and reason on quantum computations involving polarising beam splitters (PBS for short). PBS-diagrams can be used to represent various schemes including quantum-controlled computations, which are known to have multiple computational and communication advantages over classically ordered models like quantum circuits. The PBS-calculus is equipped with an equational theory, which is proved to be sound and complete: two diagrams are representing the same quantum evolution if and only if one can be transformed into the other using the rules of the PBS-calculus. Moreover, we show that the equational theory is minimal. Finally, we show that any PBS-diagram involving only unitary matrices can be transformed into a diagram without feedback loop.
\n A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter, a surprising result was shown [D. Ebler et al., Phys. Rev. Lett. 120, 120502 (2018)]: if a quantum state passes through two such channels in a quantum superposition of different orders---a setup known as the "quantum switch"---then information can nevertheless be transmitted through the channels. It is perhaps tempting to attribute this result to the indefinite causal order between the channels. Here, however, we show that a similar effect can be obtained when one coherently controls between applying one of two identical depolarising channels to a target system. Such a situation involves no indefinite causal order; we argue that this result should therefore rather be understood as resulting from coherent control of channels. Additionally, we see that when quantum channels are controlled coherently, information about their specific implementation is accessible in the output state of the joint control-target system. This allows two different implementations of what is usually considered to be the same channel to therefore be differentiated. More generally, we find that to completely describe the action of a coherently controlled quantum channel, one needs to specify not only a description of the channel (e.g., in terms of Kraus operators), but an additional "transformation matrix" depending on its implementation.\n
Abstract In this chapter we visit the ‘church of the larger Hilbert space’: we take a closer look at the relationship of pure and mixed quantum states via purification, and discuss a similar connection between completely positive and trace-preserving (CPTP) maps and unitary dynamics on a larger Hilbert space. We show that such CPTP maps, which represent quantum channels, are equivalent to operations admitting a Kraus decomposition, as well as to unitary dynamics on a larger Hilbert space with factoring initial condition, the famous Stinespring dilation of quantum operations. In this context we introduce the Choi-Jamiołkowski isomorphism, which expresses a duality between maps between two Hilbert spaces and states on tensor products of these Hilbert spaces, and we review several important examples of quantum channels such as the dephasing channel, amplitude-damping channel, and depolarizing channel. Finally, we examine operations that are not possible in quantum theory, focusing on the no-cloning theorem.
Supermaps between quantum channels (completely positive trace-preserving (CPTP) maps of matrix algebras) were introduced in [Chiribella et al., EPL 83(3) (2008)]. In this work we generalise to supermaps between channels of any type; by channels we mean CPTP maps of finite-dimensional C*-algebras. Channels include POVMs, quantum instruments, classically controlled families of quantum channels, classical channels, quantum multimeters, and more. We show that deterministic supermaps between channels of any type can be realised using simple circuits, recovering the previous realisation theorems of [Chiribella et al., EPL 83(3) (2008)] (for deterministic supermaps between quantum channels) and [Bluhm et al. (2024)] (for deterministic supermaps between quantum multimeters) as special cases. To prove this realisation theorem we use the graphical calculus of the 2-category of finite-dimensional 2-Hilbert spaces; the paper includes an accessible and elementary introduction to this graphical calculus, and no prior knowledge of category theory is expected of the reader.
Abstract The Choi representation of completely positive trace preserving (CPTP) maps, i.e. quantum channels is often used in the context of quantum information and computation as it is easy to work with. It is a correspondence between CPTP maps and quantum states also termed as the Choi–Jamiołkowski isomorphism. It is especially useful if a parametrization of the set of CPTP maps is needed in order to consider a general map or optimize over the set of these. Here we provide a brief introduction to this topic, focusing on certain useful calculational techniques which are presented in full detail.