824 citations · 2.4k across the 30 of their papers we have counts for
32 papers
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…
Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond
Shoham Jacoby, Alex Retzker, Fernando Pastawski
Floquet codes define fault-tolerant protocols through periodic measurement sequences that drive a dynamically evolving stabilizer group. They provide a natural framework for hardwa…
Error correction for encoded quantum annealing revisited
Yoshihiro Nambu
F. Pastawski and J. Preskill discussed error correction of quantum annealing (QA) based on a parity-encoded spin system, known as the Sourlas-Lechner-Hauke-Zoller (SLHZ) system. Th…
Fault-tolerant complexes
Hector Bombin, Chris Dawson, Terry Farrelly +5
Fault-tolerant complexes describe surface-code fault-tolerant protocols from a single geometric object. We first introduce fusion complexes that define a general family of fusion-b…
Modular decoding: parallelizable real-time decoding for quantum computers
Héctor Bombín, Chris Dawson, Ye-Hua Liu +3
Universal fault-tolerant quantum computation will require real-time decoding algorithms capable of quickly extracting logical outcomes from the stream of data generated by noisy qu…
Unifying flavors of fault tolerance with the ZX calculus
Hector Bombin, Daniel Litinski, Naomi Nickerson +2
There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different…