Fault-tolerant quantum speedup from constant depth quantum circuits

Abstract

A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can be done efficiently quantumly, but are not possible efficiently classically, assuming strongly held conjectures in complexity theory, a feature dubbed quantum speedup. However, the effect of noise on these proposals is not well understood in general, and in certain cases it is known that simple noise can destroy the quantum speedup. Here we develop a fault-tolerant version of one family of these sampling problems, based on nonadaptive measurements on regular graph states composed of m qubits. We show that these sampling problems can be implemented fault tolerantly using quantum circuits of constant depth. We present two constructions, each taking poly(m) physical qubits, some of which are prepared in noisy magic states. The first of our constructions is a constant depth quantum circuit composed of single-and two-qubit nearest-neighbor Clifford gates in four dimensions. This circuit has one layer of interaction with a classical computer before final measurements. Our second construction is a constant depth quantum circuit with single-and two-qubit nearest-neighbor Clifford gates in three dimensions, but with two layers of interaction with a classical computer before the final measurements. For each of these constructions, we show that there is no classical algorithm which can sample according to its output distribution in poly(m) time, assuming two standard complexity theoretic conjectures hold. The noise model we assume is the so-called local stochastic quantum noise. Along the way, we introduce various concepts such as constant depth magic state distillation and constant depth output routing, which arise naturally in measurement based quantum computation, but have no constant-depth analog in the circuit model.

Logical quantum processor based on reconfigurable atom arrays

“…We use these transversal operations to realize logical algorithms that are difficult to simulate classically 45 , 46 . More specifically, these circuits can be mapped to instantaneous quantum polynomial (IQP) circuits 20 , 45 , 46 .…”

“…We use these transversal operations to realize logical algorithms that are difficult to simulate classically 45 , 46 . More specifically, these circuits can be mapped to instantaneous quantum polynomial (IQP) circuits 20 , 45 , 46 . Sampling from the output distribution of such circuits is known to be classically hard in certain instances 20 , implying that a quantum device can be exponentially faster than a classical computer for this task.…”

Computational advantage of quantum random sampling

“…However, it is unclear to what extent the approximate average-case hardness conjecture required for this scheme is plausible, since it is based on the postselected success of magic-state distillation. Building on ideas of Bravyi et al (2020), Mezher et al (2020) develop high-dimensional and interactive measurement-based protocols in which this is achieved for every instance by appropriate classical postselection.…”