1.1k citations · 4.5k across the 89 of their papers we have counts for
15 papers · 2 filters
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…
A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics
Jon Nelson, Joel Rajakumar, Chao Yin +2
Developing classical simulation algorithms for noisy quantum circuits is essential to delineating the limits of quantum advantage. Existing classical sampling approaches for genera…
Verifiable quantum advantage based on polynomials with planted structures
Markus Bläser, Michael Gullans, Dominik Hangleiter +2
A central question in the theory of quantum advantage is whether there are quantum advantage protocols with similar resource requirements as random circuit sampling that are also v…
Probing the Error-Mitigation Threshold with Matrix Product States
Jia-Yao Zhao, Zhi-Yuan Wei, Michael J. Gullans
Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between s…
Error-Adaptive Quasi-local Decoding of the Toric Code
Hossein Dehghani, Sarang Gopalakrishnan, Michael Gullans
Topological quantum memories need decoders that are both reliable and scalable, but these goals compete: globally informed decoders are accurate near threshold yet expensive, while…
Continuous-angle logical rotations in the Steane code
Eric Huang, Daiwei Zhu, Matteo Ippoliti +2
We experimentally demonstrate continuous-angle logical rotations in the Steane code on the IonQ Forte trapped-ion processor. A round of the protocol applies a trans…
Fault-Tolerant Heisenberg-Limited Quantum Sensing
Lorcan O. Conlon, Yu-Xin Wang, Erfan Abbasgholinejad +3
Quantum sensors hold great promise for achieving better sensitivity in the measurement of physical quantities compared to their classical counterparts. However, the conditions unde…
Strategic Plan for Neutral Atom Quantum Computation
Adrian J. Menssen, Tout Wang, Michael Gullans +53
We present a strategic plan for neutral atom quantum computation, bringing together hardware development and theory advancements to achieve the goal of practical quantum advantage.…
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2
Random circuit sampling (RCS) remains one of the most competitive frameworks for demonstrating quantum advantage in near-term noisy intermediate-scale quantum (NISQ) hardware. Unfo…
Noise-induced contraction of MPO truncation errors in noisy random circuits and Lindbladian dynamics
Zhi-Yuan Wei, Joel Rajakumar, Jon Nelson +3
We study how matrix-product-operator (MPO) truncation errors evolve when simulating two setups: (1) 1D Haar-random circuits under either depolarizing noise or amplitude-damping noi…