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:2406.19373 · New Journal of Physics

Enhancing quantum state discrimination with indefinite causal order

Spiros Kechrimparis, James Moran, Athena Karsa, Changhyoup Lee, Hyukjoon Kwon

Published Dec 1, 2024• 10 citations
arXivHTMLPDF

Abstract

Abstract The standard quantum state discrimination problem can be understood as a communication scenario involving a sender and a receiver following these three steps: (i) the sender encodes information in pre-agreed quantum states, (ii) sends them over a noiseless channel, and (iii) the receiver decodes the information by performing appropriate measurements on the received states. In a practical setting, however, the channel is not only noisy but often also unknown, thus altering the states and making optimal decoding generally not possible. In this work, we study this noisy discrimination scenario using a protocol based on indefinite causal order. To this end, we consider the quantum switch and define its higher-order generalisations, which we call superswitches. We find that, for certain channels and ensembles, the guessing probability can be significantly improved compared to both single- and multiple-copy state discrimination.

DOI
10.1088/1367-2630/ada05e

Related papers

Probabilistic channel distillation via indefinite causal order

Spiros Kechrimparis, James Moran, Hyukjoon Kwon

The quantum switch has been widely studied as a prototypical example of indefinite causal order in quantum information processing. However, the potential advantages of utilizing more general forms of indefinite causal orders remain largely unexplored. We study higher-order switches, which involve concatenated applications of the quantum switch, and we demonstrate that they provide a strict advantage over the conventional quantum switch in the task of quantum channel distillation. Specifically, we show that higher-order quantum switches enable the probabilistic distillation of any qubit Pauli channel into the identity channel with nonzero probability. This capability contrasts with the conventional quantum switch, which allows only a limited set of Pauli channels to be distilled with nonzero probability. We observe that, counterintuitively, the distillation rate generally increases the noisier the channel is. We fully characterize the asymptotic distillation rates of higher-order superswitches for qubit Pauli channels. Finally, we prove a no-go result for multiqubit generalizations.

arXiv:2501.13696•Physical Review Research•Nov 4, 2025•5 citations

Superposition of causal orders for quantum discrimination of quantum processes

Seid Koudia, Abdelhakim Gharbi

We address the superposition of causal orders in the quantum switch as a convenient framework for quantum process discrimination in the presence of noise in qubit systems, using Bayes strategy. We show that, for different kinds of qubit noises, the indefinite causal order between the unitary to be discriminated and noise gives enhancement compared to the definite causal order case without reaching the ultimate bound of discrimination in general. Whereas, for entanglement breaking channels, the enhancement is significant, where the quantum switch allows for the attainability of the ultimate bound for discrimination posed by quantum mechanics. Memory effects escorting the superposition of causal orders are discussed, where we point out that processes describing an indefinite causal order, violate the notion of Markov locality. Accordingly, a suggestion for the simulation of indefinite causal orders in more generic scenarios beyond the quantum switch is given.

International Journal of Quantum Information•Oct 1, 2019•7 citations

Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies

Jessica Bavaresco, Mio Murao, Marco Túlio Quintino

For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels. Finally, we derive an absolute upper bound for the maximal probability of successfully discriminating any set of unitary channels with any number of copies for the most general strategies that are suitable for channel discrimination. Our bound is tight since it is saturated by sets of unitary channels forming a group k-design.

arXiv:2105.13369•Journal of Mathematical Physics•Apr 1, 2022•50 citations

Operational Causality Without Definite Order: Certifying Indefinite Causal Structure via a Causal Inequality and Causal Witness

Horace T. Crogman

Quantum processes with indefinite causal order challenge the classical assumption that operations must occur in a single fixed temporal sequence. The quantum switch provides a concrete setting in which two operation orders, A≺B and B≺A, are coherently controlled by a quantum system. In the strict process matrix formulation of the lazy guess your neighbour’s input (LGYNI) game, however, quantum theory, including the quantum switch, does not violate the standard causal inequality when probabilities are computed solely from local instruments. In this work, we study an extended control-assisted operational protocol in which the control system of the quantum switch is measured and used to define the task output. We compare increasingly expressive strategy classes, including single-qubit SU(2) operations, product target-ancilla operations, and entangling Cartan-decomposed two-qubit operations with generalized POVMs. Restricted models saturate or remain below the 3/4 fixed-order benchmark, whereas the optimized Cartan + ancilla + POVM strategy reaches Psuccext≈0.83596, demonstrating enhanced task performance within the extended protocol. The optimized strategy remains operationally no-signaling to numerical precision and retains its extended protocol advantage under more than 25% white noise admixture. These results identify the operational resources required for control-assisted quantum switch enhancement and support the view that indefinite temporal order can be used as a quantum informational resource without implying a breakdown of operational causality.

Quantum Reports•Jun 3, 2026•0 citations

Communication Enhancement through Quantum Coherent Control of N Channels in an Indefinite Causal-Order Scenario

Lorenzo M. Procopio, Francisco Delgado, Marco Enríquez +2 more

In quantum Shannon theory, transmission of information is enhanced by quantum features. Up to very recently, the trajectories of transmission remained fully classical. Recently, a new paradigm was proposed by playing quantum tricks on two completely depolarizing quantum channels i.e., using coherent control in space or time of the two quantum channels. We extend here this control to the transmission of information through a network of an arbitrary number N of channels with arbitrary individual capacity i.e., information preservation characteristics in the case of indefinite causal order. We propose a formalism to assess information transmission in the most general case of N channels in an indefinite causal order scenario yielding the output of such transmission. Then, we explicitly derive the quantum switch output and the associated Holevo limit of the information transmission for N = 2 , N = 3 as a function of all involved parameters. We find in the case N = 3 that the transmission of information for three channels is twice that of transmission of the two-channel case when a full superposition of all possible causal orders is used.

arXiv:1902.01807•Entropy•Oct 18, 2019•81 citations

Decoding Protocols for Classical Communication on Quantum Channels

Matteo Rosati

We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief introduction to the main theoretical formalism employed in the rest of the thesis, i.e., continuous-variable Quantum Information Theory and Quantum Communication Theory, we consider several decoding schemes. First, we treat the problem from an abstract perspective, presenting a method to decompose any quantum measurement into a sequence of easier nested measurements through a binary-tree search. Furthermore we show that this decomposition can be used to build a capacity-achieving decoding protocol for classical communication on quantum channels and to solve the optimal discrimination of some sets of quantum states. These results clarify the structure of optimal quantum measurements, showing that it can be recast in a more operational and experimentally-oriented fashion. Second, we consider a more practical approach and describe three receiver structures for coherent states of the electromagnetic field with applications to single-mode state discrimination and multi-mode decoding at the output of a quantum channel. We treat the problem bearing in mind the technological limitations faced nowadays in the field of optical communications: we evaluate the performance of general decoding schemes based on such technology and report increased performance of two schemes, the first one employing a non-Gaussian transformation and the second one employing a code tailored to be read out easily by the most common detectors. Eventually we characterize a large class of multi-mode adaptive receivers based on common technological resources, obtaining a no-go theorem for their capacity.

arXiv:1710.08638•Oct 24, 2017•3 citations
Abstract The standard quantum state discrimination problem can be understood as a communication scenario involving a sender and a receiver following these three steps: (i) the sender encodes information in pre-agreed quantum states, (ii) sends them over a noiseless channel, and (iii) the receiver decodes the information by performing appropriate measurements on the received states. In a practical setting, however, the channel is not only noisy but often also unknown, thus altering the states and making optimal decoding generally not possible. In this work, we study this noisy discrimination scenario using a protocol based on indefinite causal order. To this end, we consider the quantum switch and define its higher-order generalisations, which we call superswitches. We find that, for certain channels and ensembles, the guessing probability can be significantly improved compared to both single- and multiple-copy state discrimination.
The quantum switch has been widely studied as a prototypical example of indefinite causal order in quantum information processing. However, the potential advantages of utilizing more general forms of indefinite causal orders remain largely unexplored. We study higher-order switches, which involve concatenated applications of the quantum switch, and we demonstrate that they provide a strict advantage over the conventional quantum switch in the task of quantum channel distillation. Specifically, we show that higher-order quantum switches enable the probabilistic distillation of any qubit Pauli channel into the identity channel with nonzero probability. This capability contrasts with the conventional quantum switch, which allows only a limited set of Pauli channels to be distilled with nonzero probability. We observe that, counterintuitively, the distillation rate generally increases the noisier the channel is. We fully characterize the asymptotic distillation rates of higher-order superswitches for qubit Pauli channels. Finally, we prove a no-go result for multiqubit generalizations.
We address the superposition of causal orders in the quantum switch as a convenient framework for quantum process discrimination in the presence of noise in qubit systems, using Bayes strategy. We show that, for different kinds of qubit noises, the indefinite causal order between the unitary to be discriminated and noise gives enhancement compared to the definite causal order case without reaching the ultimate bound of discrimination in general. Whereas, for entanglement breaking channels, the enhancement is significant, where the quantum switch allows for the attainability of the ultimate bound for discrimination posed by quantum mechanics. Memory effects escorting the superposition of causal orders are discussed, where we point out that processes describing an indefinite causal order, violate the notion of Markov locality. Accordingly, a suggestion for the simulation of indefinite causal orders in more generic scenarios beyond the quantum switch is given.
For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of unitary channels. Finally, we derive an absolute upper bound for the maximal probability of successfully discriminating any set of unitary channels with any number of copies for the most general strategies that are suitable for channel discrimination. Our bound is tight since it is saturated by sets of unitary channels forming a group k-design.
Quantum processes with indefinite causal order challenge the classical assumption that operations must occur in a single fixed temporal sequence. The quantum switch provides a concrete setting in which two operation orders, A≺B and B≺A, are coherently controlled by a quantum system. In the strict process matrix formulation of the lazy guess your neighbour’s input (LGYNI) game, however, quantum theory, including the quantum switch, does not violate the standard causal inequality when probabilities are computed solely from local instruments. In this work, we study an extended control-assisted operational protocol in which the control system of the quantum switch is measured and used to define the task output. We compare increasingly expressive strategy classes, including single-qubit SU(2) operations, product target-ancilla operations, and entangling Cartan-decomposed two-qubit operations with generalized POVMs. Restricted models saturate or remain below the 3/4 fixed-order benchmark, whereas the optimized Cartan + ancilla + POVM strategy reaches Psuccext≈0.83596, demonstrating enhanced task performance within the extended protocol. The optimized strategy remains operationally no-signaling to numerical precision and retains its extended protocol advantage under more than 25% white noise admixture. These results identify the operational resources required for control-assisted quantum switch enhancement and support the view that indefinite temporal order can be used as a quantum informational resource without implying a breakdown of operational causality.
In quantum Shannon theory, transmission of information is enhanced by quantum features. Up to very recently, the trajectories of transmission remained fully classical. Recently, a new paradigm was proposed by playing quantum tricks on two completely depolarizing quantum channels i.e., using coherent control in space or time of the two quantum channels. We extend here this control to the transmission of information through a network of an arbitrary number N of channels with arbitrary individual capacity i.e., information preservation characteristics in the case of indefinite causal order. We propose a formalism to assess information transmission in the most general case of N channels in an indefinite causal order scenario yielding the output of such transmission. Then, we explicitly derive the quantum switch output and the associated Holevo limit of the information transmission for N = 2 , N = 3 as a function of all involved parameters. We find in the case N = 3 that the transmission of information for three channels is twice that of transmission of the two-channel case when a full superposition of all possible causal orders is used.
We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief introduction to the main theoretical formalism employed in the rest of the thesis, i.e., continuous-variable Quantum Information Theory and Quantum Communication Theory, we consider several decoding schemes. First, we treat the problem from an abstract perspective, presenting a method to decompose any quantum measurement into a sequence of easier nested measurements through a binary-tree search. Furthermore we show that this decomposition can be used to build a capacity-achieving decoding protocol for classical communication on quantum channels and to solve the optimal discrimination of some sets of quantum states. These results clarify the structure of optimal quantum measurements, showing that it can be recast in a more operational and experimentally-oriented fashion. Second, we consider a more practical approach and describe three receiver structures for coherent states of the electromagnetic field with applications to single-mode state discrimination and multi-mode decoding at the output of a quantum channel. We treat the problem bearing in mind the technological limitations faced nowadays in the field of optical communications: we evaluate the performance of general decoding schemes based on such technology and report increased performance of two schemes, the first one employing a non-Gaussian transformation and the second one employing a code tailored to be read out easily by the most common detectors. Eventually we characterize a large class of multi-mode adaptive receivers based on common technological resources, obtaining a no-go theorem for their capacity.