Related papers: String Diagrams for Defect-Based Surface Code Comp…
Topological gauge theories in four dimensions which admit surface operators provide a natural framework for realizing homological knot invariants. Every such theory leads to an action of the braid group on branes on the corresponding moduli…
Fault-tolerant quantum computation using lattice surgery can be abstracted as operations on graphs, wherein each logical qubit corresponds to a vertex of the graph, and multi-qubit measurements are accomplished by connecting the vertices…
The topological model for quantum computation is an inherently fault-tolerant model built on anyons in topological phases of matter. A key role is played by the braid group, and in this survey we focus on a selection of ways that the…
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However, all of the known hardware implementations of these codes…
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes…
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…
Modular architectures are a promising approach to scaling quantum computers to fault tolerance. Small, low-noise quantum processors connected through relatively noisy quantum links are capable of fault-tolerant operation as long as the…
We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations…
The strongly correlated systems we use to realise quantum error-correcting codes may give rise to high-weight, problematic errors. Encouragingly, we can expect local quantum error-correcting codes with no string-like logical operators $-$…
Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum…
Quantum code surgery is a promising technique to perform fault-tolerant computation on quantum low-density parity-check codes. Recent developments have significantly reduced the space overhead of surgery. However, generic surgery operations…
The surface code is a spin-1/2 lattice system that can exhibit non-trivial topological order when defects are punctured in the lattice and thus can be used as a stabiliser code. The protocols developed to create defects in the system have…
Surface codes are the most promising candidates for fault-tolerant quantum computation. Single qudit errors are typically modelled as Pauli operators, to which general errors are converted via randomizing methods. In this Letter, we…
In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…
Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [googlemachine,gambetta2015building], and several-hundred-qubit machines are around the corner.…
Quantum networks serve as the means to transmit information, encoded in quantum bits or qubits, between quantum processors that are physically separated. Given the instability of qubits, the design of such networks is challenging,…
Defect-adaptive surface-code methods have substantially advanced the construction of valid logical patches on imperfect hardware, but fault-tolerant computation also requires executable logical oper ations on the resulting irregular…
Low-precision weights and activations in deep neural networks (DNNs) outperform their full-precision counterparts in terms of hardware efficiency. When implemented with low-precision operations, specifically in the extreme case where…
Quantum error correction allows inherently noisy quantum devices to emulate an ideal quantum computer with reasonable resource overhead. As a crucial component, decoding architectures have received significant attention recently. In this…
Holistic resource estimates are essential for guiding the development of fault-tolerant quantum algorithms and the computers they will run on. This is particularly true when we focus on highly-constrained early fault-tolerant devices. Many…