Dissertation · 2026
Quantenfehlerkorrektur mit Low-Density Parity-Check Codes
mediaTUM (Technical University of Munich) · Published 26 January 2026
In brief
“Quantenfehlerkorrektur mit Low-Density Parity-Check Codes” is a 2026 dissertation by Lucas Berent, published in mediaTUM (Technical University of Munich). OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
Fault-tolerant quantum computing requires noise-robust architectures that protect quantum information while minimizing overhead. Quantum low-density parity-check (QLDPC) codes are strong candidates because they admit constant-depth error-detection circuits and can achieve optimal asymptotic scaling, yet efficient practical schemes remain an open challenge. This dissertation proposes advances in fault-tolerant protocols based on QLDPC codes to bring them… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Berent, L. (2026). Quantenfehlerkorrektur mit Low-Density Parity-Check Codes. mediaTUM (Technical University of Munich). https://mediatum.ub.tum.de/1796174
MLA 9
Berent, Lucas. “Quantenfehlerkorrektur mit Low-Density Parity-Check Codes.” mediaTUM (Technical University of Munich), 2026. https://mediatum.ub.tum.de/1796174.
Chicago
Berent, Lucas. 2026. “Quantenfehlerkorrektur mit Low-Density Parity-Check Codes.” mediaTUM (Technical University of Munich). https://mediatum.ub.tum.de/1796174.
Harvard
Berent, L. (2026) ‘Quantenfehlerkorrektur mit Low-Density Parity-Check Codes’, mediaTUM (Technical University of Munich). Available at: https://mediatum.ub.tum.de/1796174.
IEEE
L. Berent, “Quantenfehlerkorrektur mit Low-Density Parity-Check Codes,” mediaTUM (Technical University of Munich), 2026.
BibTeX
@phdthesis{berent2026quantenfehlerkorrektur,
title = {{Quantenfehlerkorrektur mit Low-Density Parity-Check Codes}},
author = {Berent, Lucas},
year = {2026},
url = {https://mediatum.ub.tum.de/1796174}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- quantum error correction
- LDPC codes
- fault-tolerant quantum computing
- quantum error-correcting codes
- constant-depth circuits
- overhead reduction
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Berent, L. (2026). Quantenfehlerkorrektur mit Low-Density Parity-Check Codes. mediaTUM (Technical University of Munich). https://mediatum.ub.tum.de/1796174
How many times has this paper been cited?
0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Lucas Berent.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.