231 citations · 1.2k across the 34 of their papers we have counts for
36 papers
CUDA-Q Logical: Retargetable Compilation for Fault-Tolerant Quantum Computing
Alexander McCaskey, Justin Lietz, Adam Holmes +8
Realizing fault-tolerant quantum computing requires mapping logical programs to heterogeneous quantum error correction (QEC) codes and diverse fault-tolerant execution models, sche…
Composing Detector Error Models
Vadym Kliuchnikov, Justin Lietz, Fernando Pastawski
Fault-tolerant quantum programs thread together reusable logical operations, yet correcting errors requires comparing measurements across operation boundaries. Correlations tie eac…
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…
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…
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…
Stabilizer operators and Barnes-Wall lattices
Vadym Kliuchnikov, Sebastian Schönnenbeck
We give a simple description of rectangular matrices that can be implemented by a post-selected stabilizer circuit. Given a matrix with entries in dyadic cyclotomic number fields $…
Multi-qubit circuit synthesis and Hermitian lattices
Vadym Kliuchnikov, Sebastian Schönnenbeck
We present new optimal and heuristic algorithms for exact synthesis of multi-qubit unitaries and isometries. For example, our algorithms find Clifford and T circuits for unitaries…
Minimal entanglement for injecting diagonal gates
Vadym Kliuchnikov, Eddie Schoute
Non-Clifford gates are frequently exclusively implemented on fault-tolerant architectures by first distilling magic states in specialised magic-state factories. In the rest of the…
Fault tolerance of stabilizer channels
Michael E. Beverland, Shilin Huang, Vadym Kliuchnikov
Stabilizer channels are stabilizer circuits that implement logical operations while mapping from an input stabilizer code to an output stabilizer code. They are widely used to impl…
Stabilizer circuit verification
Vadym Kliuchnikov, Michael Beverland, Adam Paetznick
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits,…
Assessing requirements to scale to practical quantum advantage
Michael E. Beverland, Prakash Murali, Matthias Troyer +7
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require…
Space-time optimized table lookup
Thomas Häner, Vadym Kliuchnikov, Martin Roetteler +1
We describe a space-time optimized circuit for the table lookup subroutine from lattice-surgery surface code primitives respecting 2D grid connectivity. Table lookup circuits are u…
QParallel: Explicit Parallelism for Programming Quantum Computers
Thomas Häner, Vadym Kliuchnikov, Martin Roetteler +2
We present a language extension for parallel quantum programming to (1) remove ambiguities concerning parallelism in current quantum programming languages and (2) facilitate space-…
Shorter quantum circuits via single-qubit gate approximation
Vadym Kliuchnikov, Kristin Lauter, Romy Minko +2
We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achi…
Counting unitaries of T-depth one
Vadym Kliuchnikov
We show that the number of T-depth one unitaries on qubits is where i…
Surface code compilation via edge-disjoint paths
Michael Beverland, Vadym Kliuchnikov, Eddie Schoute
We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor lo…
Enabling Dataflow Optimization for Quantum Programs
David Ittah, Thomas Häner, Vadym Kliuchnikov +1
We propose an IR for quantum computing that directly exposes quantum and classical data dependencies for the purpose of optimization. The Quantum Intermediate Representation for Op…
Well-conditioned multiproduct Hamiltonian simulation
Guang Hao Low, Vadym Kliuchnikov, Nathan Wiebe
Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting co…
Lower bounds on the non-Clifford resources for quantum computations
Michael Beverland, Earl Campbell, Mark Howard +1
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. O…
Trading T gates for dirty qubits in state preparation and unitary synthesis
Guang Hao Low, Vadym Kliuchnikov, Luke Schaeffer
Efficient synthesis of arbitrary quantum states and unitaries from a universal fault-tolerant gate-set e.g. Clifford+T is a key subroutine in quantum computation. As large quantum…
Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
Krysta M. Svore, Alan Geller, Matthias Troyer +7
Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the p…