Almost-linear time decoding algorithm for topological codes
N Delfosse, NH Nickerson - Quantum, 2021 - quantum-journal.org
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 …
extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli …
Afs: Accurate, fast, and scalable error-decoding for fault-tolerant quantum computers
P Das, CA Pattison, S Manne… - … Symposium on High …, 2022 - ieeexplore.ieee.org
Quantum computers promise computational advantages for many important problems
across various application domains. Unfortunately, physical quantum devices are highly …
across various application domains. Unfortunately, physical quantum devices are highly …
Local predecoder to reduce the bandwidth and latency of quantum error correction
SC Smith, BJ Brown, SD Bartlett - Physical Review Applied, 2023 - APS
A fault-tolerant quantum computer will be supported by a classical decoding system
interfacing with quantum hardware to perform quantum error correction. It is important that …
interfacing with quantum hardware to perform quantum error correction. It is important that …
Pauli stabilizer models of twisted quantum doubles
We construct a Pauli stabilizer model for every two-dimensional Abelian topological order
that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four …
that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four …
Control and readout of a 13-level trapped ion qudit
To implement useful quantum algorithms which demonstrate quantum advantage, we must
scale currently demonstrated quantum computers up significantly. Leading platforms such …
scale currently demonstrated quantum computers up significantly. Leading platforms such …
Fault-tolerant error correction with the gauge color code
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 …
we have developed quantum error-correcting codes to protect quantum information from …
A scalable decoder micro-architecture for fault-tolerant quantum computing
P Das, CA Pattison, S Manne, D Carmean… - arXiv preprint arXiv …, 2020 - arxiv.org
Quantum computation promises significant computational advantages over classical
computation for some problems. However, quantum hardware suffers from much higher …
computation for some problems. However, quantum hardware suffers from much higher …
Analysing correlated noise on the surface code using adaptive decoding algorithms
NH Nickerson, BJ Brown - Quantum, 2019 - quantum-journal.org
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 …
codes can be realised. As such, we must learn how to deal with the complex nature of the …
Multi-path summation for decoding 2D topological codes
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D
topological codes are effective for near-term implementations of fault tolerance. To obtain …
topological codes are effective for near-term implementations of fault tolerance. To obtain …
Decoding algorithms for surface codes
Quantum technologies have the potential to solve certain computationally hard problems
with polynomial or super-polynomial speedups when compared to classical methods …
with polynomial or super-polynomial speedups when compared to classical methods …