We show how to compile an arbitrary classical circuit into a fault-tolerant circuit, which performs the desired computation even when an almost-linear number of bits are adversarially chosen and corrupted in each timestep. Using a variant of this fault-tolerance scheme that only detects (rather than corrects) corruptio...
Anurag Anshu, N. P. Breuckmann, Louis Golowich et al.· 0 citations
This result demonstrates that fault-tolerant quantum computation remains possible under noise models that are global, worst-case, and non-Markovian over the full duration of the computation, directly countering concerns that correlated noise could fundamentally undermine quantum fault tolerance.
N. P. Breuckmann, Louis Golowich, U. Vazirani· 0 citations
We prove a fault-tolerance theorem for quantum computation against adversarial noise. For every quantum circuit on $\bar{N}$ logical qudits of depth $\bar{T}$, we construct a fault-tolerant circuit on $N=\text{poly}(\bar{N})$ physical qudits of depth $\bar{T}\cdot\bar{N}^{o(1)}$, which is robust against an adversary wh...
N. P. Breuckmann, Louis Golowich, U. Vazirani· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.