44 citations · 217 across the 7 of their papers we have counts for
7 papers
Partitioning qubits in hypergraph product codes to implement logical gates
Armanda O. Quintavalle, Paul Webster, Michael Vasmer
The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-t…
Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
T. R. Scruby, D. E. Browne, P. Webster +1
We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which ca…
Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
Paul Webster, Michael Vasmer, Thomas R. Scruby +1
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the…
Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes
Paul Webster, Stephen D. Bartlett
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations…
Braiding defects in topological stabiliser codes of any dimension cannot be universal
Paul Webster, Stephen D. Bartlett
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very st…
Locality-Preserving Logical Operators in Topological Stabiliser Codes
Paul Webster, Stephen D. Bartlett
Locality-preserving logical operators in topological codes are naturally fault-tolerant, since they preserve the correctability of local errors. Using a correspondence between such…