output
19942026
most citedLOFAR: The LOw-Frequency ARray

2.7k citations

Showing 2003 · quant-phShow all

6 papers · 2 filters

quant-ph2003

Robust Polynomials and Quantum Algorithms

Harry Buhrman, Ilan Newman, Hein Roehrig +1

We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We co…

quant-ph2003★ 2 cited

Quantum Symmetrically-Private Information Retrieval

Iordanis Kerenidis, Ronald de Wolf

Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k>=1 servers, while satisfying various privacy constraints. We…

quant-ph2003★ 3 cited

The statistical strength of nonlocality proofs

Wim van Dam, Peter Grunwald, Richard Gill

There exist numerous proofs of Bell's theorem, stating that quantum mechanics is incompatible with local realistic theories of nature. Here we define the strength of such nonlocali…

quant-ph2003★ 139 cited

Quantum Search on Bounded-Error Inputs

Peter Hoyer, Michele Mosca, Ronald de Wolf

Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O(sqrt{n}) repetitions o…

quant-ph2003★ 15 cited

A geometric proof of the Kochen-Specker no-go theorem

Richard D. Gill, Michael S. Keane

We give a short geometric proof of the Kochen-Specker no-go theorem for non-contextual hidden variables models. Note added to this version: I understand from Jan-Aake Larsson that…

quant-ph2003★ 48 cited

Multiparty Quantum Coin Flipping

Andris Ambainis, Harry Buhrman, Yevgeniy Dodis +1

We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: (1) We propose and motivate a definition for quantum broadcast. Our model of quantum bro…