148 citations · 1.3k across the 31 of their papers we have counts for
32 papers
Entropy threshold: A simple proxy for performance of quantum error correction
Diego Ruiz, Aleksander Kubica
The rapidly growing landscape of quantum error-correction (QEC) protocols has produced a wealth of numerical data, but comparatively few heuristics for understanding and predicting…
Kinetics of sliding-window quantum error correction
Adithya Sriram, Charles Stahl, Aleksander Kubica +1
Practical implementations of quantum error correction (QEC) require rapid measurement and continuous processing of the syndrome information in order to prevent a backlog of unproce…
Fault-tolerant distributed quantum computing with a single nucleus per node
Yotam Vaknin, Shoham Jacoby, Roi Nevo +2
Distributed quantum computing interconnects small, high-quality nodes through optical links, but this architecture carries a pronounced asymmetry: in-node gates and measurements ar…
Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward
Yunzhe Zheng, Allen Zang, Aleksander Kubica
Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate te…
Optimizing quantum error correction protocols with erasure qubits
Shouzhen Gu, Yotam Vaknin, Alex Retzker +1
Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction (QEC) protocols. However, they require additional operations, such as erasure check…
Fault-tolerant quantum architectures based on erasure qubits
Shouzhen Gu, Alex Retzker, Aleksander Kubica
The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, re…
Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons
Harry Levine, Arbel Haim, Jimmy S. C. Hung +110
Quantum error correction with erasure qubits promises significant advantages over standard error correction due to favorable thresholds for erasure errors. To realize this advantag…
Single-shot decoding of good quantum LDPC codes
Shouzhen Gu, Eugene Tang, Libor Caha +3
Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article,…
Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
Jacob C. Bridgeman, Aleksander Kubica, Michael Vasmer
Topological subsystem codes in three spatial dimensions allow for quantum error correction with no time overhead, even in the presence of measurement noise. The physical origins of…
Protecting information via probabilistic cellular automata
Annie Ray, Raymond Laflamme, Aleksander Kubica
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature , can serve as classical memory capable of storing info…
Erasure qubits: Overcoming the limit in superconducting circuits
Aleksander Kubica, Arbel Haim, Yotam Vaknin +2
The amplitude damping time, , has long stood as the major factor limiting quantum fidelity in superconducting circuits, prompting concerted efforts in the material science and…
Tailored XZZX codes for biased noise
Qian Xu, Nam Mannucci, Alireza Seif +3
Quantum error correction (QEC) for generic errors is challenging due to the demanding threshold and resource requirements. Interestingly, when physical noise is biased, we can tail…
Improved decoding of circuit noise and fragile boundaries of tailored surface codes
Oscar Higgott, Thomas C. Bohdanowicz, Aleksander Kubica +2
Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code. QEC codes u…
Clifford-deformed Surface Codes
Arpit Dua, Aleksander Kubica, Liang Jiang +2
Various realizations of Kitaev's surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed su…
Morphing quantum codes
Michael Vasmer, Aleksander Kubica
We introduce a morphing procedure that can be used to generate new quantum codes from existing quantum codes. In particular, we morph the 15-qubit Reed-Muller code to obtain a $[\!…
Finding the disjointness of stabilizer codes is NP-complete
John Bostanci, Aleksander Kubica
The disjointness of a stabilizer code is a quantity used to constrain the level of the logical Clifford hierarchy attainable by transversal gates and constant-depth quantum circuit…
Single-shot quantum error correction with the three-dimensional subsystem toric code
Aleksander Kubica, Michael Vasmer
We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC), which is a generalization of the stabilizer toric code. The 3D STC can be realized…
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,…
Efficient color code decoders in dimensions from toric code decoders
Aleksander Kubica, Nicolas Delfosse
We introduce an efficient decoder of the color code in dimensions, the Restriction Decoder, which uses any -dimensional toric code decoder combined with a local liftin…
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…