Nikolas Breuckmann

Nikolas P. Breuckmann (born 1988) is a German

mathematical physicist affiliated with the University of Nikolas P. Breuckmann
Bristol, England.[1][2] He is, as of Spring 2024, a Born Duisburg, Germany
visiting scientist and program organizer at the Simons Alma mater RWTH Aachen University,
Institute for the Theory of Computing at the University Germany
of California, Berkeley.[3] His research focuses on Known for Proof of NLTS conjecture
quantum information theory, in particular quantum
Quantum computing
error correction and quantum complexity theory. He is
known for his work (together with Anurag Anshu and Awards James Clerk Maxwell Medal &
Chinmay Nirkhe) on proving the NLTS conjecture, a Prize (2023)
famous open problem in quantum information theory. Scientific career
Fields Physics (theoretical)
Mathematics
Education and early life
Computer science
Breuckmann was born in Duisburg and grew up in Institutions University College London
Waltrop, North Rhine-Westphalia, Germany. He earned
University of Bristol
a BSc in Mathematics and a BSc, an MSc and a PhD in
Physics from RWTH Aachen University. His doctoral Thesis Homological Quantum Codes
thesis was titled "Homological Quantum Codes Beyond the Toric Code (https://a
Beyond the Toric Code" and he was supervised by rxiv.org/pdf/1802.01520.pd
Barbara Terhal.[4] f) (2017)
Doctoral Barbara Terhal
advisor
Career and research
After his PhD, he deferred his University College London Post-Doctoral Fellowship in Quantum
Technologies funded by EPSRC for a year to work for Palo Alto-based quantum computing start-up
PsiQuantum, which was co-founded by Jeremy O'Brien and Terry Rudolph (among other scientists).

In 2022, he became Lecturer (Assistant Professor)[5] in Quantum Computing Theory at the University of
Bristol.

In 2023, he was awarded the James Clerk Maxwell Medal and Prize by the Institute of Physics for his
"outstanding contributions to the quantum error correction field, particularly work on proving the no low-
energy trivial state conjecture, a famous open problem in quantum information theory".[6][7] Quanta
Magazine described the proof as "one of the biggest developments in theoretical computer
science".[8][9][10] This result built on his introduction with Jens Eberhardt of “Balanced Product Quantum
Codes”.[11][12]
The NLTS conjecture posits that there exist families of Hamiltonians with all low-energy states of non-
trivial complexity. It was formulated in 2013 by Fields Medallist Michael Freedman and Matthew
Hastings at Microsoft Research. The conjecture was proven by Breuckmann and colleagues (Anurag
Anshu and Chinmay Nirkhe) by showing that the recently discovered families of constant-rate and linear-
distance low-density parity-check (LDPC) quantum codes correspond to NLTS local Hamiltonians.[13][14]
This result is a step towards proving the quantum PCP conjecture, considered the most important open
problem in quantum complexity theory.

He and his former doctoral student Oscar Higgott are inventors of a U.S. patent titled “Subsystem codes
with high thresholds by gauge fixing and reduced qubit overhead”, which concerns a technique to
significantly improve the performance of quantum error correction in quantum computers.[15] Their
related work was included as a major development for computer science in 2023 by Quanta.[16][17][18]

References
1. "Dr Nikolas Breuckmann - Our People" (https://www.bristol.ac.uk/people). www.bristol.ac.uk.
Retrieved 2023-12-22.
2. "People – UCL CS Quantum" (https://quantum.cs.ucl.ac.uk/people/). quantum.cs.ucl.ac.uk.
Retrieved 2023-12-24.
3. "Current Long-Term Visitors" (https://simons.berkeley.edu/people/visitors). Simons Institute
for the Theory of Computing. Retrieved 2024-01-14.
4. Breuckmann, Nikolas P. (2018-02-05), PhD thesis: Homological Quantum Codes Beyond
the Toric Code, arXiv:1802.01520 (https://arxiv.org/abs/1802.01520)
5. "Nikolas Breuckmann" (https://simons.berkeley.edu/people/nikolas-breuckmann). Simons
Institute for the Theory of Computing. Retrieved 2023-12-22.
6. "2023 James Clerk Maxwell Medal and Prize" (https://www.iop.org/about/awards/2023-jame
s-clerk-maxwell-medal-and-prize). Institute of Physics.
7. Bristol, University of. "2023: Dr Nikolas Breuckmann awarded the '2023 James Clerk
Maxwell Medal and Prize' | School of Mathematics | University of Bristol" (https://www.bristo
l.ac.uk/maths/news/2023/dr-nikolas-breuckmann-awarded-the-2023-james-clerk-maxwell-m
edal-and-prize.html). www.bristol.ac.uk. Retrieved 2023-12-23.
8. Rorvig, Mordechai (18 July 2022). "Computer Science Proof Unveils Unexpected Form of
Entanglement" (https://www.quantamagazine.org/computer-science-proof-lifts-limits-on-qua
ntum-entanglement-20220718/).
9. Andrews, Bill (December 21, 2022). "The Year in Computer Science" (https://www.quantama
gazine.org/the-biggest-discoveries-in-computer-science-in-2022-20221221/). Quanta.
10. Bristol, University of. "2022: Nikolas Breuckmann announces proof | School of Mathematics
| University of Bristol" (https://www.bristol.ac.uk/maths/news/2022/nikolas-breuckmann-anno
unces-proof.html). www.bristol.ac.uk. Retrieved 2023-12-24.
11. Breuckmann, Nikolas P.; Eberhardt, Jens N. (2021). "Balanced Product Quantum Codes" (ht
tps://ieeexplore.ieee.org/document/9490244). IEEE Transactions on Information Theory. 67
(10): 6653–6674. arXiv:2012.09271 (https://arxiv.org/abs/2012.09271).
doi:10.1109/TIT.2021.3097347 (https://doi.org/10.1109%2FTIT.2021.3097347).
S2CID 229297848 (https://api.semanticscholar.org/CorpusID:229297848). Retrieved
2023-12-25.
12. "Building the future of quantum error correction" (https://research.ibm.com/blog/future-quant
um-error-correction). IBM Research Blog. 2021-02-09. Retrieved 2023-12-23.
13. Anshu, Anurag; Breuckmann, Nikolas P.; Nirkhe, Chinmay (2023-06-02). "NLTS
Hamiltonians from Good Quantum Codes" (https://doi.org/10.1145/3564246.3585114).
Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC 2023.
New York, NY, USA: Association for Computing Machinery. pp. 1090–1096.
arXiv:2206.13228 (https://arxiv.org/abs/2206.13228). doi:10.1145/3564246.3585114 (https://
doi.org/10.1145%2F3564246.3585114). ISBN 978-1-4503-9913-5. S2CID 250072529 (http
s://api.semanticscholar.org/CorpusID:250072529).
14. "Quantum Information Processing 2023" (https://indico.cern.ch/event/1175020/timetable/?vi
ew=standard). Indico. 2023-02-04. Retrieved 2023-12-24.
15. 20230071000 (https://www.freepatentsonline.com/y2023/0071000.html), Higgott, Oscar &
Breuckmann, Nikolas P., "Quantum Computing Error Correction Method, Code, and
System", issued 2023-03-09
16. Higgott, Oscar; Breuckmann, Nikolas P. (2023-08-07), Constructions and performance of
hyperbolic and semi-hyperbolic Floquet codes, arXiv:2308.03750 (https://arxiv.org/abs/2308.
03750)
17. Wood, Charlie (August 25, 2023). "New Codes Could Make Quantum Computing 10 Times
More Efficient" (https://www.quantamagazine.org/new-codes-could-make-quantum-computin
g-10-times-more-efficient-20230825/). Quanta.
18. Andrews, Bill (December 20, 2023). "The Year in Computer Science" (https://www.quantama
gazine.org/the-biggest-discoveries-in-computer-science-in-2023-20231220/). Quanta.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Nikolas_Breuckmann&oldid=1235640257"