most citedQuantum Anonymous Transmissions

88 citations

Showing quant-phShow all

7 papers · 1 filter

quant-ph200518 cited

Quantum Algorithms for Matching and Network Flows

Andris Ambainis, Robert Spalek

We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time…

quant-ph200526 cited

Entanglement in Interactive Proof Systems with Binary Answers

Stephanie Wehner

If two classical provers share an entangled state, the resulting interactive proof system is significantly weakened [quant-ph/0404076]. We show that for the case where the verifier…

quant-ph2005

Lower Bounds on Matrix Rigidity via a Quantum Argument

Ronald de Wolf

The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix woul…

quant-ph200556 cited

Implications of Superstrong Nonlocality for Cryptography

Harry Buhrman, Matthias Christandl, Falk Unger +2

Non-local boxes are hypothetical ``machines'' that give rise to superstrong non-local correlations, leading to a stronger violation of Bell/CHSH inequalities than is possible withi…

quant-ph2005

The quantum adversary method and classical formula size lower bounds

Sophie Laplante, Troy Lee, Mario Szegedy

We introduce two new complexity measures for Boolean functions, or more generally for functions of the form f:S->T. We call these measures sumPI and maxPI. The quantity sumPI has b…

quant-ph200488 cited

Quantum Anonymous Transmissions

Matthias Christandl, Stephanie Wehner

We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for…