26 citations · 70 across the 12 of their papers we have counts for
13 papers
Efficiently estimating failure rates of fault-tolerant logical non-Clifford blocks
Julio C. Magdalena de la Fuente, Thomas R. Scruby
Useful quantum computation requires the fault-tolerant implementations of a universal gate set which are generically not efficiently simulable. We devise an algebraic framework tha…
Scalable quantum error correction tailored for a heavy-hex qubit array
Seok-Hyung Lee, Xanda C. Kolesnikow, Jun Zen +7
To produce an operable quantum computer that is made with imperfect hardware, we must design and test scalable quantum error correcting codes that are suited for the devices we can…
Low-valency scalable quantum error correction with a dynamic compass code
Jun Zen, Xanda C. Kolesnikow, Campbell K. McLauchlan +6
The ongoing development of hardware that is capable of reliably executing general quantum algorithms requires quantum error-correcting codes that are both practical for realisation…
Plain Transformers Can be Powerful Graph Learners
Liheng Ma, Soumyasundar Pal, Yingxue Zhang +2
Transformers have attained outstanding performance across various modalities, owing to their simple but powerful scaled-dot-product (SDP) attention mechanisms. Researchers have att…
Fault-tolerant Quantum Computation without Distillation on a 2D Device
Thomas R. Scruby, Kae Nemoto, Zhenyu Cai
We show how looped pipeline architectures - which use short-range shuttling of physical qubits to achieve a finite amount of non-local connectivity - can be used to efficiently imp…
Quantum Rainbow Codes: Achieving Linear Rate, Growing Distance and Transversal Non-Clifford Gates with Generalised Colour Codes
Thomas R. Scruby, Arthur Pesah, Mark Webster
We introduce rainbow codes, a novel class of quantum error correcting codes generalising colour codes and pin codes. Rainbow codes can be defined on any -dimensional simplicial…
High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
Thomas R. Scruby, Timo Hillmann, Joschka Roffe
We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes…
Multiplexed Quantum Communication with Surface and Hypergraph Product Codes
Shin Nishio, Nicholas Connolly, Nicolò Lo Piparo +3
Connecting multiple processors via quantum interconnect technologies could help overcome scalability issues in single-processor quantum computers. Transmission via these interconne…
Local Probabilistic Decoding of a Quantum Code
T. R. Scruby, K. Nemoto
flip is an extremely simple and maximally local classical decoder which has been used to great effect in certain classes of classical codes. When applied to quantum codes there exi…
Non-Pauli Errors in the Three-Dimensional Surface Code
Thomas R. Scruby, Michael Vasmer, Dan E. Browne
A powerful feature of stabiliser error correcting codes is the fact that stabiliser measurement projects arbitrary errors to Pauli errors, greatly simplifying the physical error co…
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…
A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes
T. R. Scruby, D. E. Browne
Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls an…