1.1k citations · 4.5k across the 89 of their papers we have counts for
97 papers
Single-shot magic state factories for quantum LDPC codes
Varun Menon, Rohan Mehta, Andi Gu +8
Quantum low-density parity-check (qLDPC) codes can substantially reduce the qubit overhead of fault-tolerant quantum computation, but any useful architecture based on such codes al…
Protecting Quantum Computers against Untrusted Users
Shiv Akshar Yadavalli, Joel Rajakumar, Alexander Schuckert +1
Publicly accessible fault-tolerant quantum computers must preserve scientific utility while limiting cryptanalytic power. We propose the restricted model of computation, 1/2BQP_1:…
Qubit CSS codes with Universal Transversal Gates
Arpit Dua, Adam Holmes, Michael J. Gullans +1
The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors. The theorem constrains one partition of the qubits at…
Symmetry-preserving quantum compilation
Maryam Mudassar, Zhi-Yuan Wei, Alexander Schuckert +3
Fault-tolerant quantum simulation requires compiling symmetry-preserving time evolutions into discrete gate sets. Standard Clifford+T synthesis can break continuous symmetries even…
Efficient fidelity simulation of high-rate magic distillation circuits
Xiao Xiao, Dominik Hangleiter, J. Pablo Bonilla Ataides +4
Non-Clifford gates are essential for avoiding classical simulability under the Gottesman-Knill theorem. An error-corrected circuit with non-Clifford gates will therefore be an impo…
Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
Matthew Coudron, Michael J. Gullans, Jon Nelson +2
We give a deterministic classical algorithm that estimates to additive error in time, where is a co…