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

Quantum Information Processing

A centralized quantum switch network based on probabilistic channels

Min Jiang, Re-Bing Wu, Hui Li, Zengke Zhang

Published Mar 12, 2012• 5 citations
Publisher
DOI
10.1007/s11128-012-0384-9

Related papers

Deterministic teleportation in a switch network via probabilistic channels

Jiang , Huang, Zhou Zhou

Chinese Control Conference (CCC)•Jan 1, 2011•0 citations

Deterministic teleportation in a switch network via probabilistic channels

Min Jiang, Xu Huang, Mintong Zhou

We present a systematic scheme for deterministic teleportation in a quantum switch network based on probabilistic communication channels. In this scheme, the burden of terminal agents originally caused by the introduction of auxiliary qubits and the operations of high dimensional unitary gates could be released. In such a way, our scheme will bring great convenience to realize deterministic teleportation in quantum probabilistic network for the present purpose.

Chinese Control Conference (CCC)•Jul 22, 2011•0 citations

Multi-party quantum state sharing via various probabilistic channels

Min Jiang, Daoyi Dong

Quantum Information Processing•Feb 9, 2012•24 citations

Quantum Probability Distribution Network

Ri‐Gui Zhou

Springer eBooks•Jul 30, 2007•3 citations

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•2 citations

Quantum Computing through Quantum Networks

Cheng Li Wu

Bulletin of the American Physical Society•Mar 18, 2013•0 citations
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.