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

Nature Physics

Breaking the communication barrier

Stephen Patrick Walborn

Published Apr 1, 2008• 18 citations
Publisher
DOI
10.1038/nphys927

Related papers

Communication cost of breaking the Bell barrier

Karl Svozil

Correlations in an Einstein-Podolsky-Rosen-Bohm experiment can be made stronger than quantum correlations by allowing a single bit of classical communication between the two sides of the experiment.

arXiv:quant-ph/0411190•Physical Review A•Nov 14, 2005•16 citations

Freely communicating

Charles H. Bennett

Nature•Aug 1, 1996•1 citation

Barriers between Realities

Mariette DiChristina

Scientific American•Jun 20, 2018•0 citations

Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model

Taisuke Izumi, François Le Gall

The All-Pairs Shortest Path problem (APSP) is one of the most central problems in distributed computation. In the CONGEST-CLIQUE model, in which n nodes communicate with each other over a fully connected network by exchanging messages of O(łog n) bits in synchronous rounds, the best known general algorithm for APSP uses Õ(n1/3) rounds. Breaking this barrier is a fundamental challenge in distributed graph algorithms. In this paper we investigate for the first time quantum distributed algorithms in the CONGEST-CLIQUE model, where nodes can exchange messages of O(log n) quantum bits, and show that this barrier can be broken: we construct a Õ(n1/4)-round quantum distributed algorithm for the APSP over directed graphs with polynomial weights in the CONGEST-CLIQUE model. This speedup in the quantum setting contrasts with the case of the standard CONGEST model, for which Elkin et al. (PODC 2014) showed that quantum communication does not offer significant advantages over classical communication.

arXiv:1906.02456•ACM Symposium on Principles of Distributed Computing (PODC)•Jul 16, 2019•29 citations

Superconducting Coplanar Waveguides for High Fidelity Operation of Quantum Repeaters

Williams, Conner

Quantum repeaters, and the quantum communication they enable, are as vital to the efficient use of quantum computers as the internet is to current computing. The Lukin Group has developed a repeater architecture using Silicon Vacancy Centers in diamond, and members have used it to experimentally demonstrate single-qubit communication. Currently, though, its circuit depth and two-qubit functionality are limited by heating due to microwave driving from gold coplanar waveguides (CPW) atop the diamond’s surface. To break through this barrier, superconducting CPW’s, which do not dissipate heat, have been developed.

•Jan 1, 2021•0 citations

PERCEPTIONS AND REALITIES

Bruce M. Bennett, Donald D. Hoffman, Chetan Prakash

Elsevier eBooks•Jan 1, 1989•0 citations
The All-Pairs Shortest Path problem (APSP) is one of the most central problems in distributed computation. In the CONGEST-CLIQUE model, in which n nodes communicate with each other over a fully connected network by exchanging messages of O(łog n) bits in synchronous rounds, the best known general algorithm for APSP uses Õ(n1/3) rounds. Breaking this barrier is a fundamental challenge in distributed graph algorithms. In this paper we investigate for the first time quantum distributed algorithms in the CONGEST-CLIQUE model, where nodes can exchange messages of O(log n) quantum bits, and show that this barrier can be broken: we construct a Õ(n1/4)-round quantum distributed algorithm for the APSP over directed graphs with polynomial weights in the CONGEST-CLIQUE model. This speedup in the quantum setting contrasts with the case of the standard CONGEST model, for which Elkin et al. (PODC 2014) showed that quantum communication does not offer significant advantages over classical communication.
Quantum repeaters, and the quantum communication they enable, are as vital to the efficient use of quantum computers as the internet is to current computing. The Lukin Group has developed a repeater architecture using Silicon Vacancy Centers in diamond, and members have used it to experimentally demonstrate single-qubit communication. Currently, though, its circuit depth and two-qubit functionality are limited by heating due to microwave driving from gold coplanar waveguides (CPW) atop the diamond’s surface. To break through this barrier, superconducting CPW’s, which do not dissipate heat, have been developed.