Although quantum computers are believed to be more powerful than classical ones, a convincing experimental demonstration of this fact remains elusive. Proposed schemes either rely on unproven complexity-theoretic hardness assumptions, and/or require universal, fault-tolerant scalable quantum computers to implement. Thi...
Libor Caha, Xavier Coiteux-Roy, Robert Koenig· Nature Communications· 4 citations
We consider quantum devices restricted to local operations in 2D and subject to local stochastic noise below a constant threshold. We show that such circuits are computationally more powerful than AC0-circuits, i.e., noise-free, geometrically-unconstrained constant-depth classical circuits with unbounded fan-in AND, OR...
Libor Caha, Robert Koenig, Louis Paletta· 0 citations
We consider quantum circuits consisting of $d$ layers of nearest-neighbor two-qubit gates acting on $n$ qubits arranged on a line, where every qubit is independently depolarized with a constant probability before each layer. We describe a randomized parallel algorithm which samples from the output distribution of any s...
Robert Koenig, Marco Tomamichel· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.