Nikolas Breuckmann
Nikolas P. Breuckmann | |
|---|---|
| Born | |
| Alma mater | RWTH Aachen University, Germany |
| Known for |
|
| Awards | James Clerk Maxwell Medal & Prize (2023) |
| Scientific career | |
| Fields | |
| Institutions |
|
| Thesis | Homological Quantum Codes Beyond the Toric Code (2017) |
| Doctoral advisor | Barbara Terhal |
Nikolas P. Breuckmann (born 1988) is a German mathematical physicist affiliated with the University of Bristol, England.[1][2] He is, as of Spring 2024, a visiting scientist and program organizer at the Simons Institute for the Theory of Computing at the University of California, Berkeley.[3] His research focuses on quantum information theory, in particular quantum error correction and quantum complexity theory. He is known for his work (together with Anurag Anshu and Chinmay Nirkhe) on proving the NLTS conjecture, a famous open problem in quantum information theory.
Education and early life
[edit]Breuckmann was born in Duisburg and grew up in Waltrop, North Rhine-Westphalia, Germany. He earned a BSc in Mathematics and a BSc, an MSc and a PhD in Physics from RWTH Aachen University. His doctoral thesis was titled "Homological Quantum Codes Beyond the Toric Code" and he was supervised by Barbara Terhal.[4]
Career and research
[edit]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. [citation needed]
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
[edit]- ^ "Dr Nikolas Breuckmann - Our People". www.bristol.ac.uk. Retrieved 2023-12-22.
- ^ "People – UCL CS Quantum". quantum.cs.ucl.ac.uk. Retrieved 2023-12-24.
- ^ "Current Long-Term Visitors". Simons Institute for the Theory of Computing. Retrieved 2024-01-14.
- ^ Breuckmann, Nikolas P. (2018-02-05), PhD thesis: Homological Quantum Codes Beyond the Toric Code, arXiv:1802.01520
- ^ "Nikolas Breuckmann". Simons Institute for the Theory of Computing. Retrieved 2023-12-22.
- ^ "2023 James Clerk Maxwell Medal and Prize". Institute of Physics.
- ^ Bristol, University of. "2023: Dr Nikolas Breuckmann awarded the '2023 James Clerk Maxwell Medal and Prize' | School of Mathematics | University of Bristol". www.bristol.ac.uk. Retrieved 2023-12-23.
- ^ Rorvig, Mordechai (18 July 2022). "Computer Science Proof Unveils Unexpected Form of Entanglement".
- ^ Andrews, Bill (December 21, 2022). "The Year in Computer Science". Quanta.
- ^ Bristol, University of. "2022: Nikolas Breuckmann announces proof | School of Mathematics | University of Bristol". www.bristol.ac.uk. Retrieved 2023-12-24.
- ^ Breuckmann, Nikolas P.; Eberhardt, Jens N. (2021). "Balanced Product Quantum Codes". IEEE Transactions on Information Theory. 67 (10): 6653–6674. arXiv:2012.09271. doi:10.1109/TIT.2021.3097347. S2CID 229297848. Retrieved 2023-12-25.
- ^ "Building the future of quantum error correction". IBM Research Blog. 2021-02-09. Retrieved 2023-12-23.
- ^ Anshu, Anurag; Breuckmann, Nikolas P.; Nirkhe, Chinmay (2023-06-02). "NLTS Hamiltonians from Good Quantum Codes". 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. doi:10.1145/3564246.3585114. ISBN 978-1-4503-9913-5. S2CID 250072529.
- ^ "Quantum Information Processing 2023". Indico. 2023-02-04. Retrieved 2023-12-24.
- ^ 20230071000, Higgott, Oscar & Breuckmann, Nikolas P., "Quantum Computing Error Correction Method, Code, and System", issued 2023-03-09
- ^ Higgott, Oscar; Breuckmann, Nikolas P. (2023-08-07), Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes, arXiv:2308.03750
- ^ Wood, Charlie (August 25, 2023). "New Codes Could Make Quantum Computing 10 Times More Efficient". Quanta.
- ^ Andrews, Bill (December 20, 2023). "The Year in Computer Science". Quanta.