REVIEW 5 cited by
Exponential Communication Complexity Advantage from Quantum Superposition of the Direction of Communication
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In communication complexity, a number of distant parties have the task of calculating a distributed function of their inputs, while minimizing the amount of communication between them. It is known that with quantum resources, such as entanglement and quantum channels, one can obtain significant reductions in the communication complexity of some tasks. In this work, we study the role of the quantum superposition of the direction of communication as a resource for communication complexity. We present a tripartite communication task for which such a superposition allows for an exponential saving in communication, compared to one-way quantum (or classical) communication; the advantage also holds when we allow for protocols with bounded error probability.
Forward citations
Cited by 5 Pith papers
-
Routing Quantum Control of Causal Order
Every N-party quantum circuit with quantum control of causal order can be represented as a routed quantum circuit built from one fixed routed graph G_QC-QC(N).
-
Toward an Experimental Device-Independent Verification of Indefinite Causal Order
First experimental implementation of a device-independent inequality violation for indefinite causal order, with measured value 1.8328 ± 0.0045 against bound 1.75.
-
Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order
Causally indefinite classical processes can compute a constructed Boolean function family with D^0.792 queries instead of D, and indefinite causal order gives an exact three-query quantum algorithm where sequential qu...
-
Subsystem decompositions of quantum evolutions and transformations between causal perspectives
Alice's and Bob's causal perspectives in the quantum switch cannot be related by any fixed change of subsystem decomposition, so they are not equivalent descriptions of the same evolution.
-
Surpassing the Global Heisenberg Limit Using a High-effciency Quantum Switch
A 50.6%-efficient photonic quantum switch yields geometric-phase precision below the global Heisenberg limit without postselection, for n=29,30 displacement pairs.
Discussion (0). Continue with ORCID to comment.