7 papers
The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
Michael E. Beverland, Aleksander Kubica, Krysta M. Svore
Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-…
Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
Aleksander Kubica, Rafal Demkowicz-Dobrzanski
We present a simple proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code (QECC) with its ability to achieve a universal set…
Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
Michael Vasmer, Dan E. Browne, Aleksander Kubica
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplici…
Triangular color codes on trivalent graphs with flag qubits
Christopher Chamberland, Aleksander Kubica, Theodore J. Yoder +1
The color code is a topological quantum error-correcting code supporting a variety of valuable fault-tolerant logical gates. Its two-dimensional version, the triangular color code,…
Cellular-automaton decoders with provable thresholds for topological codes
Aleksander Kubica, John Preskill
We propose a new cellular automaton (CA), the Sweep Rule, which generalizes Toom's rule to any locally Euclidean lattice. We use the Sweep Rule to design a local decoder for the to…
Ungauging quantum error-correcting codes
Aleksander Kubica, Beni Yoshida
We develop the procedures of gauging and ungauging, reveal their operational meaning and propose their generalization in a systematic manner within the framework of quantum error-c…