Quantum Advantage with Noisy Shallow Circuits in 3D
Sergey Bravyi, David Gosset, et al.
FOCS 2019
A big open question in the quantum information theory concerns the feasibility of a self-correcting quantum memory. A quantum state recorded in such memory can be stored reliably for a macroscopic time without need for active error correction, if the memory is in contact with a cold enough thermal bath. Here we report analytic and numerical evidence for self-correcting behavior in the quantum spin lattice model known as the 3D cubic code. We prove that its memory time is at least Lcβ, where L is the lattice size, β is the inverse temperature of the bath, and c>0 is a constant coefficient. However, this bound applies only if the lattice size L does not exceed a critical value which grows exponentially with β. In that sense, the model can be called a partially self-correcting memory. We also report a Monte Carlo simulation indicating that our analytic bounds on the memory time are tight up to constant coefficients. To model the readout step we introduce a new decoding algorithm, which can be implemented efficiently for any topological stabilizer code. A longer version of this work can be found in Bravyi and Haah, arXiv:1112.3252. © 2013 American Physical Society.
Sergey Bravyi, David Gosset, et al.
FOCS 2019
Sergey Bravyi, Joseph A. Latone, et al.
npj Quantum Information
Sergey Bravyi, David Gosset, et al.
Nature Physics
Sergey Bravyi, Giuseppe Carleo, et al.
QIP 2023