Aleksander Kubica
YOU?
Author Swipe
View article: Layer codes as partially self-correcting quantum memories
Layer codes as partially self-correcting quantum memories Open
We investigate layer codes, a family of three-dimensional stabilizer codes that can achieve optimal scaling of code parameters and a polynomial energy barrier, as candidates for self-correcting quantum memories. First, we introduce two dec…
View article: Snakes and Ladders: Adapting the Surface Code to Defects
Snakes and Ladders: Adapting the Surface Code to Defects Open
One of the critical challenges solid-state quantum processors face is the presence of fabrication imperfections and two-level systems, which render certain qubits and gates either inoperable or much noisier than tolerable by quantum error-…
View article: Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays Open
Neutral atom arrays have recently emerged as a promising platform for fault-tolerant quantum computing. Based on these advances, including dynamically-reconfigurable connectivity and fast transversal operations, we present a low-overhead a…
View article: Fault-Tolerant Compiling of Classically Hard Instantaneous Quantum Polynomial Circuits on Hypercubes
Fault-Tolerant Compiling of Classically Hard Instantaneous Quantum Polynomial Circuits on Hypercubes Open
Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic algori…
View article: A distillation-teleportation protocol for fault-tolerant QRAM
A distillation-teleportation protocol for fault-tolerant QRAM Open
We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation, given access to a specialized, noisy QRAM device. For coherently accessing classical memories of size $2^n$, our protocol co…
View article: Fast correlated decoding of transversal logical algorithms
Fast correlated decoding of transversal logical algorithms Open
Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number …
View article: Lattice Surgery Compilation Beyond the Surface Code
Lattice Surgery Compilation Beyond the Surface Code Open
Large-scale fault-tolerant quantum computation requires compiling logical circuits into physical operations tailored to a given architecture. Prior work addressing this challenge has mostly focused on the surface code and lattice surgery s…
View article: Fault-tolerant quantum architectures based on erasure qubits
Fault-tolerant quantum architectures based on erasure qubits Open
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, relying on an efficient conversion of the dominant noise into…
View article: Hardware-efficient quantum error correction via concatenated bosonic qubits
Hardware-efficient quantum error correction via concatenated bosonic qubits Open
View article: Snakes and Ladders: Adapting the surface code to defects
Snakes and Ladders: Adapting the surface code to defects Open
One of the critical challenges solid-state quantum processors face is the presence of fabrication imperfections and two-level systems, which render certain qubits and gates either inoperable or much noisier than tolerable by quantum error …
View article: Hardware-efficient quantum error correction via concatenated bosonic qubits
Hardware-efficient quantum error correction via concatenated bosonic qubits Open
In order to solve problems of practical importance, quantum computers will likely need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits. The large physical-qubit overhead t…
View article: Data for "Fault-tolerant quantum architectures based on erasure qubits"
Data for "Fault-tolerant quantum architectures based on erasure qubits" Open
Example Stim circuits used to simulate Floquet codes implemented with erasure qubits. Each circuit is the converted stabilizer circuit for a given pattern of erasure check detection events. To view the circuit diagram, please download the …
View article: Optimizing quantum error correction protocols with erasure qubits
Optimizing quantum error correction protocols with erasure qubits Open
Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction (QEC) protocols. However, they require additional operations, such as erasure checks, that may add extra noise and increase runtime of QEC pro…
View article: Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation Open
Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, one can achieve low logi…
View article: Fault-tolerant compiling of classically hard IQP circuits on hypercubes
Fault-tolerant compiling of classically hard IQP circuits on hypercubes Open
Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic algori…
View article: Lifting Topological Codes: Three-Dimensional Subsystem Codes from Two-Dimensional Anyon Models
Lifting Topological Codes: Three-Dimensional Subsystem Codes from Two-Dimensional Anyon Models Open
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 this single-shot property remain elusive, in part due to t…
View article: Demonstrating a Long-Coherence Dual-Rail Erasure Qubit Using Tunable Transmons
Demonstrating a Long-Coherence Dual-Rail Erasure Qubit Using Tunable Transmons Open
Quantum error correction with erasure qubits promises significant advantages over standard error correction due to favorable thresholds for erasure errors. To realize this advantage in practice requires a qubit for which nearly all errors …
View article: Clifford-Deformed Surface Codes
Clifford-Deformed Surface Codes Open
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 surface codes (CDSCs) obtained from the surface code by the a…
View article: Single-Shot Decoding of Good Quantum LDPC Codes
Single-Shot Decoding of Good Quantum LDPC Codes Open
View article: Erasure Qubits: Overcoming the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:msub><mml:mi>T</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> Limit in Superconducting Circuits
Erasure Qubits: Overcoming the Limit in Superconducting Circuits Open
The amplitude-damping time T_{1} has long stood as the major factor limiting quantum fidelity in superconducting circuits, prompting concerted efforts in the material science and design of qubits aimed at increasing T_{1}. In contrast, the…
View article: Quantum algorithms: A survey of applications and end-to-end complexities
Quantum algorithms: A survey of applications and end-to-end complexities Open
The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically co…
View article: Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes
Improved Decoding of Circuit Noise and Fragile Boundaries of Tailored Surface Codes Open
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 use multiple noisy physical qubits to encode information in …
View article: Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons
Demonstrating a long-coherence dual-rail erasure qubit using tunable transmons Open
Quantum error correction with erasure qubits promises significant advantages over standard error correction due to favorable thresholds for erasure errors. To realize this advantage in practice requires a qubit for which nearly all errors …
View article: Single-shot decoding of good quantum LDPC codes
Single-shot decoding of good quantum LDPC codes Open
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, we prove that quantum Tanner codes also facilitate single-…
View article: Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models Open
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 this single-shot property remain elusive, in part due to t…
View article: Protecting information via probabilistic cellular automata
Protecting information via probabilistic cellular automata Open
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic f…
View article: Efficient color code decoders in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>d</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>2</mml:mn></mml:math> dimensions from toric code decoders
Efficient color code decoders in dimensions from toric code decoders Open
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 lifting procedure to find a recovery operation. We prove that the Restriction…
View article: Tailored XZZX codes for biased noise
Tailored XZZX codes for biased noise Open
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 tailor our QEC schemes to the noise to improve performance. Her…
View article: Single-shot quantum error correction with the three-dimensional subsystem toric code
Single-shot quantum error correction with the three-dimensional subsystem toric code Open
View article: Data for "Single-shot quantum error correction with the three-dimensional subsystem toric code".
Data for "Single-shot quantum error correction with the three-dimensional subsystem toric code". Open
Data used to make the plots in the paper "Single-shot quantum error correction with the three-dimensional subsystem toric code" (arXiv link).