2
talks
2
posters
1
committee roles
0
leadership roles
2010–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| No quantum advantage without classical communication: fundamental limitations of quantum networks | TQC 2025 | regular | Justus Neumann, Nikolai Wyderka, Tulja Varun Kondra, Kiara Hansenne, Lisa T. Weinbrenner, Hermann Kampermann, Otfried Gühne |
|
Foundations for estimating Pauli noise in quantum error correction ↗
|
TQC 2023 | regular | Thomas Wagner, Hermann Kampermann, ▸Martin Kliesch |
The characterization of quantum devices is crucial for their practical implementation but can be costly in experimental effort and classical post-processing. Therefore, it is desirable to measure only information that is relevant for specific applications and develop protocols that require little additional effort. In this work, we focus on the characterization of quantum computers in the context of stabilizer quantum error correction. We prove that (i) physical and (ii) logical error channels induced by Pauli noise can be estimated from syndrome data under minimal conditions. Essentially, any Pauli channel a code can correct can also be estimated from its syndrome measurements. We also provide a concrete estimation algorithm for this task. |
|||
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Security of Iterative Sifting in Quantum Key Distribution | QCRYPT 2025 | Yien Liang, Anton Trushechkin, Hermann Kampermann |
We investigate the security of a quantum key distribution scheme, where Bob right after each detection announces publicly his choice of measurement basis, and the measurement results if the measurement is performed in the testing basis (used for parameter estimation). Such a scheme saves memory and communication time on both sides by not sending all the classical information only at the end of each block but immediately after each detection. We prove its security and show that this method will not reduce the key rate compared to conventional sifting. |
||
| Quantum conference key agreement in pair-entangled networks | QCRYPT 2025 | Justus Neumann, Anton Trushechkin, Hermann Kampermann |
We investigate the problem of conference key agreement in pair entangled networks (PEN) where
the parties can share bipartite entangled states. In such networks, a source whose global state
factorizes into bipartite “pair-entangled network” (PEN) states is distributed to honest parties
which can perform local operations and public classical post-processing (LOSR+PP) to establish
a shared secret key among each other. In this setting, we derive several new upper bounds on the
achievable conference key rate. In particular for pure PEN states we show that the optimal key rate
can be achieved by a bipartite QKD strategy. |
||
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| TQC 2010 | PC | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Hermann Kampermann | 4 |
| Anton Trushechkin | 2 |
| Justus Neumann | 2 |
| Kiara Hansenne | 1 |
| Lisa T. Weinbrenner | 1 |
| Martin Kliesch | 1 |
| Nikolai Wyderka | 1 |
| Otfried Gühne | 1 |
| Thomas Wagner | 1 |
| Tulja Varun Kondra | 1 |
| Yien Liang | 1 |