696 citations · 6.6k across the 85 of their papers we have counts for
6 papers · 1 filter
A Small Quantum Computer is Needed to Optimize Fault-Tolerant Protocols
Pavithran S. Iyer, David Poulin
As far as we know, a useful quantum computer will require fault-tolerant gates, and existing schemes demand a prohibitively large space and time overhead. We argue that a first gen…
Quantum Algorithm for Spectral Measurement with Lower Gate Count
David Poulin, Alexei Kitaev, Damian S. Steiger +2
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations…
Magic State Distillation at Intermediate Size
Jeongwan Haah, Matthew B. Hastings, D. Poulin +1
Recently we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, c…
Convolutional Polar Codes
Andrew James Ferris, Christoph Hirche, David Poulin
Arikan's Polar codes attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block er…
Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
Christopher Chamberland, Pavithran Iyer, David Poulin
We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our sch…
Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
Jeongwan Haah, Matthew B. Hastings, D. Poulin +1
We present an infinite family of protocols to distill magic states for -gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a give…