8 papers
Direct U(2) approximation via repeat-until-success circuits
Vadym Kliuchnikov, Jendrik Brachter, Marcus P. da Silva
We show how to directly and efficiently approximate arbitrary one-qubit unitaries, bypassing the Euler decomposition and the magnitude approximation problem, at the cost of one anc…
Clifford synthesis via generalized S and CZ gates
Vadym Kliuchnikov, Marcus P. da Silva
We show that any -qubit Clifford unitary can be implemented using at most multi-qubit joint measurements. All the multi-qubit joint measurements used for implementing the C…
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…
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…
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…
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…