arXiv subjects

Hein Roehrig

Publications and source records attributed to Hein Roehrig.

4 recordsLinked to original sources

arXiv2006

Robust Polynomials and Quantum Algorithms

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 compare several different possible definitions. Our main results are * For every n-bit Boolean function f there is an n-variate polynomial p of degree O(n) that robustly approximates it, in the sense that p(x) remains close to f(x) if we slightly vary each of the n inputs of the polynomial. * There is an O(n)-query quantum algorithm that robustly recovers n noisy input bits. Hence every n-bit function can be quantum computed with O(n) queries in the presence of noise. This contrasts with the classical model of Feige et al., where functions such as parity need Theta(n*log n) queries. We give several extensions and applications of these results.

quant-ph↗

arXiv2004

Multiparty Quantum Coin Flipping

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 broadcast channel is new. (2) We discovered that quantum broadcast is essentially a combination of pairwise quantum channels and a classical broadcast channel. This is a somewhat surprising conclusion, but helps us in both our lower and upper bounds. (3) We provide tight upper and lower bounds on the optimal bias epsilon of a coin which can be flipped by k parties of which exactly g parties are honest: for any 1 <= g <= k, epsilon = 1/2 - Theta(g/k). Thus, as long as a constant fraction of the players are honest, they can prevent the coin from being fixed with at least a constant probability. This result stands in sharp contrast with the classical setting, where no non-trivial coin-flipping is possible when g <= k/2.

quant-ph↗

arXiv2003

Combinatorics and Quantum Nonlocality

We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of super-luminal communication) for being able to reproduce the quantum correlations occurring in EPR-type experiments with classical local hidden-variable theories. As an application, we consider n parties sharing a GHZ-type state and show that the amount of super-luminal classical communication required to reproduce the correlations is at least n(log n - 3) bits and the maximum detector efficiency eta* for which the resulting correlations can still be reproduced by a local hidden-variable theory is upper bounded by eta* <= 8/n and thus decreases with n.

quant-ph↗

arXiv1999

Searching an Ordered List on a Quantum Computer

Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least 1/2, whereas classically, log N - O(1) queries are needed to obtain constant success probability. Moreover, our algorithm employs the Haar transform and thus differs substantially from Grover's search algorithm and from algorithms relying on the quantum Fourier transform.

quant-ph↗