Nikolas Breuckmann

Last updated
Nikolas P. Breuckmann
Born
Duisburg, Germany
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.

Contents

Education and early life

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

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]

Related Research Articles

<span class="mw-page-title-main">Quantum computing</span> Technology that uses quantum mechanics

A quantum computer is a computer that exploits quantum mechanical phenomena. On small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior using specialized hardware. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer. In particular, a large-scale quantum computer could break widely used encryption schemes and aid physicists in performing physical simulations; however, the current state of the art is largely experimental and impractical, with several obstacles to useful applications.

In quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer. Although all classical algorithms can also be performed on a quantum computer, the term quantum algorithm is generally reserved for algorithms that seem inherently quantum, or use some essential feature of quantum computation such as quantum superposition or quantum entanglement.

Quantum information science is a field that combines the principles of quantum mechanics with information theory to study the processing, analysis, and transmission of information. It covers both theoretical and experimental aspects of quantum physics, including the limits of what can be achieved with quantum information. The term quantum information theory is sometimes used, but it does not include experimental research and can be confused with a subfield of quantum information science that deals with the processing of quantum information.

Quantum error correction (QEC) is a set of techniques used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is theorised as essential to achieve fault tolerant quantum computing that can reduce the effects of noise on stored quantum information, faulty quantum gates, faulty quantum state preparation, and faulty measurements. Effective quantum error correction would allow quantum computers with low qubit fidelity to execute algorithms of higher complexity or greater circuit depth.

In mathematics, Floer homology is a tool for studying symplectic geometry and low-dimensional topology. Floer homology is a novel invariant that arises as an infinite-dimensional analogue of finite-dimensional Morse homology. Andreas Floer introduced the first version of Floer homology, now called symplectic Floer homology, in his proof of the Arnold conjecture in symplectic geometry. Floer also developed a closely related theory for Lagrangian submanifolds of a symplectic manifold. A third construction, also due to Floer, associates homology groups to closed three-dimensional manifolds using the Yang–Mills functional. These constructions and their descendants play a fundamental role in current investigations into the topology of symplectic and contact manifolds as well as (smooth) three- and four-dimensional manifolds.

In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs of constant query complexity and logarithmic randomness complexity.

A topological quantum computer is a theoretical quantum computer proposed by Russian-American physicist Alexei Kitaev in 1997. It employs quasiparticles in two-dimensional systems, called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime. These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids' topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball bumping into a wall.

<span class="mw-page-title-main">Greg Kuperberg</span> Polish American mathematician

Greg Kuperberg is a Polish-born American mathematician known for his contributions to geometric topology, quantum algebra, and combinatorics. Kuperberg is a professor of mathematics at the University of California, Davis.

In quantum computing, the threshold theorem states that a quantum computer with a physical error rate below a certain threshold can, through application of quantum error correction schemes, suppress the logical error rate to arbitrarily low levels. This shows that quantum computers can be made fault-tolerant, as an analogue to von Neumann's threshold theorem for classical computation. This result was proven by the groups of Dorit Aharanov and Michael Ben-Or; Emanuel Knill, Raymond Laflamme, and Wojciech Zurek; and Alexei Kitaev independently. These results built on a paper of Peter Shor, which proved a weaker version of the threshold theorem.

<span class="mw-page-title-main">Gil Kalai</span> Israeli mathematician and computer scientist

Gil Kalai is an Israeli mathematician and computer scientist. He is the Henry and Manya Noskwith Professor Emeritus of Mathematics at the Hebrew University of Jerusalem, Israel, Professor of Computer Science at the Interdisciplinary Center, Herzliya, and adjunct Professor of mathematics and of computer science at Yale University, United States.

The toric code is a topological quantum error correcting code, and an example of a stabilizer code, defined on a two-dimensional spin lattice. It is the simplest and most well studied of the quantum double models. It is also the simplest example of topological order—Z2 topological order (first studied in the context of Z2 spin liquid in 1991). The toric code can also be considered to be a Z2 lattice gauge theory in a particular limit. It was introduced by Alexei Kitaev.

Barbara M. Terhal is a theoretical physicist working in quantum information and quantum computing. She is a professor in the Delft Institute of Applied Mathematics at TU Delft, as well as leading the Terhal Group at QuTech, the Dutch institute for quantum computing and quantum internet, founded by TU Delft and the Netherlands Organisation for Applied Scientific Research (TNO). Her research concerns many areas in quantum information theory, including entanglement detection, quantum error correction, fault-tolerant quantum computing and quantum memories.

In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2012, but the concept dates to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing.

Dorje C. Brody is a British applied mathematician and mathematical physicist.

In quantum computing, a qubit is a unit of information analogous to a bit in classical computing, but it is affected by quantum mechanical properties such as superposition and entanglement which allow qubits to be in some ways more powerful than classical bits for some tasks. Qubits are used in quantum circuits and quantum algorithms composed of quantum logic gates to solve computational problems, where they are used for input/output and intermediate computations.

Oded Regev is an Israeli-American theoretical computer scientist and mathematician. He is a professor of computer science at the Courant institute at New York University. He is best known for his work in lattice-based cryptography, and in particular for introducing the learning with errors problem.

Mark McMahon Wilde is an American quantum information scientist. He is an Associate Professor in the School of Electrical and Computer Engineering at Cornell University, and he is also a Fields Member in the School of Applied and Engineering Physics and the Department of Computer Science at Cornell.

In quantum information theory, the no low-energy trivial state (NLTS) conjecture is a precursor to a quantum PCP theorem (qPCP) and posits the existence of families of Hamiltonians with all low-energy states of non-trivial complexity. It was formulated by Michael Freedman and Matthew Hastings in 2013. An NLTS proof would be a consequence of one aspect of qPCP problems – the inability to certify an approximation of local Hamiltonians via NP completeness. In other words, an NLTS proof would be one consequence of the QMA complexity of qPCP problems. On a high level, if proved, NLTS would be one property of the non-Newtonian complexity of quantum computation. NLTS and qPCP conjectures posit the near-infinite complexity involved in predicting the outcome of quantum systems with many interacting states. These calculations of complexity would have implications for quantum computing such as the stability of entangled states at higher temperatures, and the occurrence of entanglement in natural systems. There is currently a proof of NLTS conjecture published in preprint.

This glossary of quantum computing is a list of definitions of terms and concepts used in quantum computing, its sub-disciplines, and related fields.

<span class="mw-page-title-main">James Clerk Maxwell Medal and Prize</span> Award

The James Clerk Maxwell Medal and Prize is awarded by the Institute of Physics (IOP) in theoretical physics. The award is made "for exceptional early-career contributions to theoretical physics." It was awarded every two years between 1962 and 1970 and has since been awarded annually. It is named in honour of James Clerk Maxwell.

References

  1. ↑ "Dr Nikolas Breuckmann - Our People". www.bristol.ac.uk. Retrieved 2023-12-22.
  2. ↑ "People – UCL CS Quantum". quantum.cs.ucl.ac.uk. Retrieved 2023-12-24.
  3. ↑ "Current Long-Term 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
  5. ↑ "Nikolas Breuckmann". Simons Institute for the Theory of Computing. Retrieved 2023-12-22.
  6. ↑ "2023 James 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". www.bristol.ac.uk. Retrieved 2023-12-23.
  8. ↑ Rorvig, Mordechai (18 July 2022). "Computer Science Proof Unveils Unexpected Form of Entanglement".
  9. ↑ Andrews, Bill (December 21, 2022). "The Year in Computer Science". Quanta.
  10. ↑ Bristol, University of. "2022: Nikolas Breuckmann announces proof | School of Mathematics | University of Bristol". www.bristol.ac.uk. Retrieved 2023-12-24.
  11. ↑ 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.
  12. ↑ "Building the future of quantum 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". 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.
  14. ↑ "Quantum Information Processing 2023". Indico. 2023-02-04. Retrieved 2023-12-24.
  15. ↑ 20230071000,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
  17. ↑ Wood, Charlie (August 25, 2023). "New Codes Could Make Quantum Computing 10 Times More Efficient". Quanta.
  18. ↑ Andrews, Bill (December 20, 2023). "The Year in Computer Science". Quanta.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.