Nikolas Peter Breuckmann

Nikolas Peter Breuckmann

Auto-generated profile, based on publicly available information

Nikolas Peter Breuckmann

School of Mathematics, University of Bristol, Bristol BS8 1UG, UK

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 October 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
NBNikolas P. Breuckmann
Nikolas P. Breuckmann
JEJens Niklas Eberhardt
Jens Niklas Eberhardt
Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called “quantum low-density parity-check (LDPC) codes.” The codes we discuss are alternatives to the surface code, which is currently the leading candidate to implement quantum fault tolerance. We introduce the zoo of quantum LDPC codes and discuss their potential for making quantum computers robust with regard to noise. In particular, we explain recent advances in the theory of quantum LDPC codes related to certain product constructions and discuss open problems in the field.

19 July 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NBNikolas P. Breuckmann
Nikolas P. Breuckmann
JEJens N. Eberhardt
Jens N. Eberhardt
This work provides the first explicit and non-random family of [[N,K,D]] LDPC quantum codes which encode K ∈ Θ(N 4/5 ) logical qubits with distance D ∈ Ω(N 3/5 ). The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the polylog(N)√N distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have K ∈ Θ(N) and that we conjecture to have linear distance D ∈ Θ(N).

19 August 2021 in Physical Review X
Verified
Journal Article
Open access
PDF file
OHOscar Higgott
Oscar Higgott
NBNikolas P. Breuckmann
Nikolas P. Breuckmann
We introduce a technique that uses gauge fixing to significantly improve the quantum-error-correcting performance of subsystem codes. By changing the order in which check operators are measured, valuable additional information can be gained, and we introduce a new method for decoding which uses this information to improve performance. Applied to the subsystem toric code with three-qubit check operators, we increase the threshold under circuit-level depolarizing noise from 0.67% to 0.81%. The threshold increases further under a circuit-level noise model with small finite bias, up to 2.22% for infinite bias. Furthermore, we construct families of finite-rate subsystem low-density parity-check codes with three-qubit check operators and optimal-depth parity-check measurement schedules. To the best of our knowledge, these finite-rate subsystem codes outperform all known codes at circuit-level depolarizing error rates as high as 0.2%, where they have a qubit overhead that is 4.3× lower than the most efficient version of the surface code and 5.1× lower than the subsystem toric code. Their threshold and pseudo-threshold exceeds 0.42% for circuit-level depolarizing noise, increasing to 2.4% under infinite bias using gauge fixing.

24 May 2018 in Quantum
Verified
Journal Article
Open access
PDF file
NBNikolas P. Breuckmann
Nikolas P. Breuckmann
XNXiaotong Ni
Xiaotong Ni
Machine learning has the potential to become an important tool in quantum error correction as it allows the decoder to adapt to the error distribution of a quantum chip. An additional motivation for using neural networks is the fact that they can be evaluated by dedicated hardware which is very fast and consumes little power. Machine learning has been previously applied to decode the surface code. However, these approaches are not scalable as the training has to be redone for every system size which becomes increasingly difficult. In this work the existence of local decoders for higher dimensional codes leads us to use a low-depth convolutional neural network to locally assign a likelihood of error on each qubit. For noiseless syndrome measurements, numerical simulations show that the decoder has a threshold of around 7.1% when applied to the 4D toric code. When the syndrome measurements are noisy, the decoder performs better for larger code sizes when the error probability is low. We also give theoretical and numerical analysis to show how a convolutional neural network is different from the 1-nearest neighbor algorithm, which is a baseline machine learning method.

13 June 2024 in Quantum
Verified
Journal Article
Open access
PDF file
NBNikolas P. Breuckmann
Nikolas P. Breuckmann
SBSimon Burton
Simon Burton
We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal gates and qubit permutations only.To demonstrate our approach, we specifically consider a [[30, 8, 3]] hyperbolic quantum code called Bring's code. Further, we show that by restricting the logical subspace of Bring's code to four qubits, we can obtain the full Clifford group on that subspace.

26 October 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
NBNikolas P. Breuckmann
Nikolas P. Breuckmann
VLVivien Londe
Vivien Londe
We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, distance scaling as $n^\epsilon $ for $\epsilon > 0$ and efficient decoding schemes. The code family is based on tessellations of closed, four-dimensional, hyperbolic manifolds, as first suggested by Guth and Lubotzky. The main contribution of this work is the construction of suitable manifolds via finite presentations of Coxeter groups, their linear representations over Galois fields and topological coverings. We establish a lower bound on the encoding rate $k/n$ of $13/72 = 0.180\ldots $ and we show that the bound is tight for the examples that we construct. Numerical simulations give evidence that parallelizable decoding schemes of low computational complexity suffice to obtain high performance. These decoding schemes can deal with syndrome noise, so that parity check measurements do not have to be repeated to decode. Our data is consistent with a threshold of around 4% in the phenomenological noise model with syndrome noise in the single-shot regime.