activity
20242026
collaborators

7 papers

quant-ph2026

Phased outcome-complete simulation

Vadym Kliuchnikov, Adam Paetznick, Marcus P. da Silva

We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased out…

quant-ph2025

Excising dead components in the surface code using minimally invasive alterations: A performance study

Ryan V. Mishmash, Vadym Kliuchnikov, Juan Bello-Rivas +7

The physical implementation of a large-scale error-corrected quantum processor will necessarily need to mitigate the presence of defective (thereby "dead") physical components in i…

quant-ph2025

Roadmap to fault tolerant quantum computation using topological qubit arrays

David Aasen, Morteza Aghaee, Zulfi Alam +179

We describe a concrete device roadmap towards a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits. Our roadmap e…

quant-ph2025

A Topologically Fault-Tolerant Quantum Computer with Four Dimensional Geometric Codes

David Aasen, Matthew B. Hastings, Vadym Kliuchnikov +8

Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance o…

quant-ph2025

Fault-tolerant quantum computation with a neutral atom processor

Ben W. Reichardt, Adam Paetznick, David Aasen +69

Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and ha…

quant-ph2024

Demonstration of quantum computation and error correction with a tesseract code

Ben W. Reichardt, David Aasen, Rui Chao +15

A critical milestone for quantum computers is to demonstrate fault-tolerant computation that outperforms computation on physical qubits. The tesseract subsystem color code protects…