411 citations · 1.4k across the 20 of their papers we have counts for
20 papers
Macromux: scalable postselection for high-threshold fault-tolerant quantum computation
Patrick Birchall, Jacob Bridgeman, Christopher Dawson +7
We introduce a new resource-efficient scheme for fault-tolerant quantum computation known as `macroscale multiplexing' (or simply `Macromux'), that utilizes scalable postselection…
Comparison of schemes for highly loss tolerant photonic fusion based quantum computing
Sara Bartolucci, Tom Bell, Hector Bombin +18
We summarize the performance of recently-proposed methods for achieving fault tolerant fusions-based quantum computation with high tolerance to qubit loss, specifically aimed at ph…
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…
Increasing error tolerance in quantum computers with dynamic bias arrangement
Hector Bombín, Chris Dawson, Naomi Nickerson +2
Many quantum operations are expected to exhibit bias in the structure of their errors. Recent works have shown that a fixed bias can be exploited to improve error tolerance by stat…
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…
Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
Daniel Litinski, Naomi Nickerson
In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the…
Logical blocks for fault-tolerant topological quantum computation
Hector Bombin, Chris Dawson, Ryan V. Mishmash +3
Logical gates constitute the building blocks of fault-tolerant quantum computation. While quantum error-corrected memories have been extensively studied in the literature, explicit…
Switch networks for photonic fusion-based quantum computing
Sara Bartolucci, Patrick Birchall, Damien Bonneau +6
Fusion-based quantum computing (FBQC) offers a powerful approach to building a fault-tolerant universal quantum computer using photonic components -- single-photon sources, linear-…
Interleaving: Modular architectures for fault-tolerant photonic quantum computing
Hector Bombin, Isaac H. Kim, Daniel Litinski +5
Useful fault-tolerant quantum computers require very large numbers of physical qubits. Quantum computers are often designed as arrays of static qubits executing gates and measureme…
Fusion-based quantum computation
Sara Bartolucci, Patrick Birchall, Hector Bombin +10
We introduce fusion-based quantum computing (FBQC) - a model of universal quantum computation in which entangling measurements, called fusions, are performed on the qubits of small…
Measurement based fault tolerance beyond foliation
Naomi Nickerson, Héctor Bombín
In order to build a scalable quantum computer error correction will be required to reduce the impact of errors. Implementing error correction in the framework of measurement based…
Analysing correlated noise on the surface code using adaptive decoding algorithms
Naomi H. Nickerson, Benjamin J. Brown
Laboratory hardware is rapidly progressing towards a state where quantum error-correcting codes can be realised. As such, we must learn how to deal with the complex nature of the n…
Almost-linear time decoding algorithm for topological codes
Nicolas Delfosse, Naomi H. Nickerson
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli…
Entanglement Distillation between Solid-State Quantum Network Nodes
Norbert Kalb, Andreas A. Reiserer, Peter C. Humphreys +7
The potential impact of future quantum networks hinges on high-quality quantum entanglement shared between network nodes. Unavoidable real-world imperfections necessitate means to…
Error correcting power of small topological codes
Naomi H. Nickerson
Many quantum technologies are now reaching a high level of maturity and control, and it is likely that the first demonstrations of suppression of naturally occurring quantum noise…
Fault-tolerant error correction with the gauge color code
Benjamin J. Brown, Naomi H. Nickerson, Dan E. Browne
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from no…
Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links
Naomi H. Nickerson, Joseph F. Fitzsimons, Simon C. Benjamin
Exquisite quantum control has now been achieved in small ion traps, in nitrogen-vacancy centres and in superconducting qubit clusters. We can regard such a system as a universal ce…
A silicon-based surface code quantum computer
Joe O'Gorman, Naomi H. Nickerson, Philipp Ross +2
Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: There is a basic conflict between nano…
Topological quantum computing with a very noisy network and local error rates approaching one percent
Naomi H. Nickerson, Ying Li, Simon C. Benjamin
A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that r…