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

Designing a Universal Quantum Switch for Arbitrary Quantum Dynamics

Priya Ghosh, Kornikar Sen, Ujjwal Sen

Published Jul 26, 2024• 3 citations
arXivHTMLPDF

Abstract

A quantum switch is a superoperator that, in general, creates a superposition of various causal orders of two or more quantum dynamics that are all divisible in the complete positivity (CP) sense. We introduce a process that we term as the universal quantum switch (UQS), which unlike conventional quantum switches, allows for the construction of a quantum switch that can superpose different causal orders of any set of quantum dynamics, regardless of their CP-divisibility. Our approach also enables the construction of a quantum switch while considering a single environment connected with the system, in contrast to the traditional one. Moreover, we show the UQS provides more advantages in performance for a certain state discrimination task compared to traditional quantum switches. The next question that we address is the following: What is the CP-divisibility characteristic of a dynamics built by acting a quantum switch on CP-divisible or -indivisible dynamics? In this regard, an example is presented where the dynamics created by the action of the UQS on two CP-indivisible dynamics is CP-indivisible. Additionally, we prove a necessary and sufficient condition for the channel created by acting the traditional quantum switch on two CP-divisible dynamics to be CP-divisible. Furthermore, we present some examples of CP-divisible dynamics on which, when the usual quantum switch is operated, the resulting dynamics not only becomes CP-indivisible but also turns into P-indivisible. Our findings demonstrate that quantum switches can build CP-divisible, CP-indivisible, and even P-indivisible dynamics from CP-divisible dynamics, underscoring the versatility of this technique.

DOI
10.48550/arxiv.2407.19037

Related papers

Effects of non-Markovianity in quantum compositions of channels with indefinite causal order

Jian Wei Cheong

Quantum compositions of channels can grant advantages over classical compositions in quantum information processing or thermodynamical tasks. One of such quantum composition is one with indefinite causal order, where multiple quantum channels are placed in a superposition of different causal or operation orders. The advantages of indefinite causal order were demonstrated in an experimentally realizable setup known as the quantum switch and were often attributed to this new quantum resource of indefinite causality, but some doubts and disagreements still remains as compositions without indefinite causal order can achieve the same advantages. In this work, we proposed that the quantum switch's uniqueness lies in its ability to exhibit coherent non-Markovianity, where memory effects acts across different paths of superposition. We showed that the quantum switch violates completely positive or CP-divisibility and thus has intrinsic non-Markovianity in its evolution, which allows for non-Markovian backflow of information from the environment. This backflow of information can then play a role in the many advantages seen in the quantum switch, and by extending the quantum switch operation such that the non-Markovianity is controllable, we showed that these advantages depend on the presence and amount of non-Markovianity, achieving the quantum switch case when the system is fully non-Markovian. Particularly, we demonstrated this for the quantum switch's advantages in communication capacities, work extraction via daemonic ergotropy, and refrigeration via heat extraction. Other quantum compositions that are often compared to indefinite causal order, such as the superposition of independent channels and superposition of trajectories, are also captured by this extended construction of the quantum switch, and we showed that their difference with the quantum switch lies in the presence or absence of non-Markovianity. Our work suggests that non-Markovianity is an important recipe for the quantum switch or indefinite causal order, and is a nonnegligible factor for its advantages.

•Jan 1, 2023•0 citations

Activating information backflow with the assistance of quantum SWITCH

Ananda G. Maity, Samyadeb Bhattacharya

Abstract There are certain dynamics while being non-Markovian, do never exhibit information backflow. We show that if two such dynamical maps are considered in a scenario where the order of application of these two dynamical maps are not definite, the effective channel can manifest information backflow. In particular, we use quantum SWITCH to activate such a channel. In contrast, activation of those channels are not possible even if one uses many copies of such channels in series or in parallel action. We then investigate the dynamics behind the quantum SWITCH experiment and find out that after the action of quantum SWITCH both the CP (Complete Positive)- divisiblity and P (Positive)- divisibility of the channel breaks down, along with the activation of information backflow. Our study elucidate the advantage of quantum SWITCH by investigating its dynamical behaviour.

arXiv:2206.04524•Journal of Physics A Mathematical and Theoretical•Apr 22, 2024•19 citations

The quantum switch is uniquely defined by its action on unitary operations

Qingxiuxiong Dong, Marco Túlio Quintino, Akihito Soeda +1 more

The quantum switch is a quantum process that creates a coherent control between different unitary operations, which is often described as a quantum process which transforms a pair of unitary operations (U1,U2) into a controlled unitary operation that coherently applies them in different orders as |0⟩⟨0|⊗U1U2+|1⟩⟨1|⊗U2U1 . This description, however, does not directly define its action on non-unitary operations. The action of the quantum switch on non-unitary operations is then chosen to be a ``natural'' extension of its action on unitary operations. In general, the action of a process on non-unitary operations is not uniquely determined by its action on unitary operations. It may be that there could be a set of inequivalent extensions of the quantum switch for non-unitary operations. We prove, however, that the natural extension is the only possibility for the quantum switch for the 2-slot case. In other words, contrary to the general case, the action of the quantum switch on non-unitary operations (as a linear and completely CP preserving supermap) is completely determined by its action on unitary operations. We also discuss the general problem of when the complete description of a quantum process is uniquely determined by its action on unitary operations and identify a set of single-slot processes which are completely defined by their action on unitary operations.

arXiv:2106.00034•Quantum•Nov 7, 2023•13 citations

Comparing the quantum switch and its simulations with energetically constrained operations

Marco Fellous-Asiani, Raphaël Mothe, Léa Bresque +5 more

Quantum mechanics allows processes to be superposed, leading to a genuinely quantum lack of causal structure. For example, the process known as the quantum switch applies two operations $\mathcal{A}$ and $\mathcal{B}$ in a superposition of the two possible orders, $\mathcal{A}$ before $\mathcal{B}$ and $\mathcal{B}$ before $\mathcal{A}$. Experimental implementations of the quantum switch have been challenged by some on the grounds that the operations $\mathcal{A}$ and $\mathcal{B}$ were implemented more than once, thereby simulating indefinite causal order rather than actually implementing it. Motivated by this debate, we consider a situation in which the quantum operations are physically described by a light-matter interaction model. While for our model the two processes are indistinguishable in the infinite-energy regime, restricting the energy available for the implementation of the operations introduces imperfections, which allow one to distinguish processes using different numbers of operations. We consider such an energetically constrained scenario and compare the quantum switch to one of its natural simulations, where each operation is implemented twice. Considering a commuting-versus-anticommuting unitary discrimination task, we find that within our model the quantum switch performs better, for some fixed amount of energy, than its simulation. In addition to the known computational or communication advantages of causal superpositions, our work raises questions about their potential energetic advantages.

arXiv:2208.01952•Physical Review Research•May 19, 2023•19 citations

Quantum communication using a quantum switch of quantum switches

Debarshi Das, Somshubhro Bandyopadhyay

The quantum switch describes a quantum operation in which two or more quantum channels act on a quantum system with the order of application determined by the state of an order quantum system. And by suitably choosing the state of the order system, one can create a quantum superposition of the different orders of application, which can perform communication tasks impossible within the framework of the standard quantum Shannon theory. In this paper, we consider the scenario of one-shot heralded qubit communication and ask whether there are protocols using a given quantum switch or switches that could outperform the given ones. We answer this question in the affirmative. We define a higher-order quantum switch composed of two quantum switches, with their order of application controlled by another order quantum system. We then show that the quantum switches placed in a quantum superposition of their alternative orders can transmit a qubit, without any error, with a probability higher than that achievable with the quantum switches individually. We demonstrate this communication advantage over quantum switches that are useful as a resource and those that are useless. We also show that there are situations where there is no communication advantage over the individual quantum switches.

arXiv:2111.08266•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 1, 2022•15 citations

Simulating the quantum switch with quantum circuits is impossible

Caisheng Cheng

The quantum switch is a higher-order transformation that combines input quantum channels in an indefinite causal order. Whether quantum circuits can simulate its action, and how many calls to the input channels such a simulation requires, are natural questions about the power of quantum control of causal order. In this work, we prove that no quantum circuit with classically controlled causal order can exactly and deterministically simulate the quantum switch for arbitrary input channels using any finite number of calls. This impossibility holds already for qubit channels and extends to the complete $r$-switch, which coherently controls all permutations of $r$ input channels. These results settle the question of exact deterministic circuit simulation of the quantum switch. They demonstrate that processes with indefinite causal order cannot, in general, be efficiently simulated in this setting even by quantum circuits with classically controlled causal order.

arXiv:2611.10615•Nov 7, 2026•1 citation
A quantum switch is a superoperator that, in general, creates a superposition of various causal orders of two or more quantum dynamics that are all divisible in the complete positivity (CP) sense. We introduce a process that we term as the universal quantum switch (UQS), which unlike conventional quantum switches, allows for the construction of a quantum switch that can superpose different causal orders of any set of quantum dynamics, regardless of their CP-divisibility. Our approach also enables the construction of a quantum switch while considering a single environment connected with the system, in contrast to the traditional one. Moreover, we show the UQS provides more advantages in performance for a certain state discrimination task compared to traditional quantum switches. The next question that we address is the following: What is the CP-divisibility characteristic of a dynamics built by acting a quantum switch on CP-divisible or -indivisible dynamics? In this regard, an example is presented where the dynamics created by the action of the UQS on two CP-indivisible dynamics is CP-indivisible. Additionally, we prove a necessary and sufficient condition for the channel created by acting the traditional quantum switch on two CP-divisible dynamics to be CP-divisible. Furthermore, we present some examples of CP-divisible dynamics on which, when the usual quantum switch is operated, the resulting dynamics not only becomes CP-indivisible but also turns into P-indivisible. Our findings demonstrate that quantum switches can build CP-divisible, CP-indivisible, and even P-indivisible dynamics from CP-divisible dynamics, underscoring the versatility of this technique.
Quantum compositions of channels can grant advantages over classical compositions in quantum information processing or thermodynamical tasks. One of such quantum composition is one with indefinite causal order, where multiple quantum channels are placed in a superposition of different causal or operation orders. The advantages of indefinite causal order were demonstrated in an experimentally realizable setup known as the quantum switch and were often attributed to this new quantum resource of indefinite causality, but some doubts and disagreements still remains as compositions without indefinite causal order can achieve the same advantages. In this work, we proposed that the quantum switch's uniqueness lies in its ability to exhibit coherent non-Markovianity, where memory effects acts across different paths of superposition. We showed that the quantum switch violates completely positive or CP-divisibility and thus has intrinsic non-Markovianity in its evolution, which allows for non-Markovian backflow of information from the environment. This backflow of information can then play a role in the many advantages seen in the quantum switch, and by extending the quantum switch operation such that the non-Markovianity is controllable, we showed that these advantages depend on the presence and amount of non-Markovianity, achieving the quantum switch case when the system is fully non-Markovian. Particularly, we demonstrated this for the quantum switch's advantages in communication capacities, work extraction via daemonic ergotropy, and refrigeration via heat extraction. Other quantum compositions that are often compared to indefinite causal order, such as the superposition of independent channels and superposition of trajectories, are also captured by this extended construction of the quantum switch, and we showed that their difference with the quantum switch lies in the presence or absence of non-Markovianity. Our work suggests that non-Markovianity is an important recipe for the quantum switch or indefinite causal order, and is a nonnegligible factor for its advantages.
Abstract There are certain dynamics while being non-Markovian, do never exhibit information backflow. We show that if two such dynamical maps are considered in a scenario where the order of application of these two dynamical maps are not definite, the effective channel can manifest information backflow. In particular, we use quantum SWITCH to activate such a channel. In contrast, activation of those channels are not possible even if one uses many copies of such channels in series or in parallel action. We then investigate the dynamics behind the quantum SWITCH experiment and find out that after the action of quantum SWITCH both the CP (Complete Positive)- divisiblity and P (Positive)- divisibility of the channel breaks down, along with the activation of information backflow. Our study elucidate the advantage of quantum SWITCH by investigating its dynamical behaviour.
The quantum switch is a quantum process that creates a coherent control between different unitary operations, which is often described as a quantum process which transforms a pair of unitary operations (U1,U2) into a controlled unitary operation that coherently applies them in different orders as |0⟩⟨0|⊗U1U2+|1⟩⟨1|⊗U2U1 . This description, however, does not directly define its action on non-unitary operations. The action of the quantum switch on non-unitary operations is then chosen to be a ``natural'' extension of its action on unitary operations. In general, the action of a process on non-unitary operations is not uniquely determined by its action on unitary operations. It may be that there could be a set of inequivalent extensions of the quantum switch for non-unitary operations. We prove, however, that the natural extension is the only possibility for the quantum switch for the 2-slot case. In other words, contrary to the general case, the action of the quantum switch on non-unitary operations (as a linear and completely CP preserving supermap) is completely determined by its action on unitary operations. We also discuss the general problem of when the complete description of a quantum process is uniquely determined by its action on unitary operations and identify a set of single-slot processes which are completely defined by their action on unitary operations.
Quantum mechanics allows processes to be superposed, leading to a genuinely quantum lack of causal structure. For example, the process known as the quantum switch applies two operations A\mathcal{A}A and B\mathcal{B}B in a superposition of the two possible orders, A\mathcal{A}A before B\mathcal{B}B and B\mathcal{B}B before A\mathcal{A}A. Experimental implementations of the quantum switch have been challenged by some on the grounds that the operations A\mathcal{A}A and B\mathcal{B}B were implemented more than once, thereby simulating indefinite causal order rather than actually implementing it. Motivated by this debate, we consider a situation in which the quantum operations are physically described by a light-matter interaction model. While for our model the two processes are indistinguishable in the infinite-energy regime, restricting the energy available for the implementation of the operations introduces imperfections, which allow one to distinguish processes using different numbers of operations. We consider such an energetically constrained scenario and compare the quantum switch to one of its natural simulations, where each operation is implemented twice. Considering a commuting-versus-anticommuting unitary discrimination task, we find that within our model the quantum switch performs better, for some fixed amount of energy, than its simulation. In addition to the known computational or communication advantages of causal superpositions, our work raises questions about their potential energetic advantages.
The quantum switch describes a quantum operation in which two or more quantum channels act on a quantum system with the order of application determined by the state of an order quantum system. And by suitably choosing the state of the order system, one can create a quantum superposition of the different orders of application, which can perform communication tasks impossible within the framework of the standard quantum Shannon theory. In this paper, we consider the scenario of one-shot heralded qubit communication and ask whether there are protocols using a given quantum switch or switches that could outperform the given ones. We answer this question in the affirmative. We define a higher-order quantum switch composed of two quantum switches, with their order of application controlled by another order quantum system. We then show that the quantum switches placed in a quantum superposition of their alternative orders can transmit a qubit, without any error, with a probability higher than that achievable with the quantum switches individually. We demonstrate this communication advantage over quantum switches that are useful as a resource and those that are useless. We also show that there are situations where there is no communication advantage over the individual quantum switches.
The quantum switch is a higher-order transformation that combines input quantum channels in an indefinite causal order. Whether quantum circuits can simulate its action, and how many calls to the input channels such a simulation requires, are natural questions about the power of quantum control of causal order. In this work, we prove that no quantum circuit with classically controlled causal order can exactly and deterministically simulate the quantum switch for arbitrary input channels using any finite number of calls. This impossibility holds already for qubit channels and extends to the complete rrr-switch, which coherently controls all permutations of rrr input channels. These results settle the question of exact deterministic circuit simulation of the quantum switch. They demonstrate that processes with indefinite causal order cannot, in general, be efficiently simulated in this setting even by quantum circuits with classically controlled causal order.