Michael Epping

Dr. Michael Epping

Institute of Software Technology, German Aerospace Center, Cologne, North Rhine-Westphalia, Germany
orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
MEMichael Epping
Michael Epping
HKHermann Kampermann
Hermann Kampermann
Chiara MacchiavelloChiara Macchiavello
Chiara Macchiavello
DBDagmar Bruß
Dagmar Bruß

1 May 2016 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
MEMichael Epping
Michael Epping
HKHermann Kampermann
Hermann Kampermann
DBDagmar Bruß
Dagmar Bruß
Society relies and depends increasingly on information exchange and communication. In the quantum world, security and privacy is a built-in feature for information processing. The essential ingredient for exploiting these quantum advantages is the resource of entanglement, which can be shared between two or more parties. The distribution of entanglement over large distances constitutes a key challenge for current research and development. Due to losses of the transmitted quantum particles, which typically scale exponentially with the distance, intermediate quantum repeater stations are needed. Here we show how to generalise the quantum repeater concept to the multipartite case, by describing large-scale quantum networks, i.e. network nodes and their long-distance links, consistently in the language of graphs and graph states. This unifying approach comprises both the distribution of multipartite entanglement across the network, and the protection against errors via encoding. The correspondence to graph states also provides a tool for optimising the architecture of quantum networks.

1 October 2016 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
MEMichael Epping
Michael Epping
HKHermann Kampermann
Hermann Kampermann
DBDagmar Bruß
Dagmar Bruß
Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, 'consume' entangled quantum states during their execution. When participants are located at distant sites, these resource states need to be distributed. Due to transmission losses quantum repeater become necessary for large distances (e.g. ). Here we generalize the concept of the graph state repeater to D-dimensional graph states and to repeaters that can perform basic measurement-based quantum computations, which we call quantum routers. This processing of data at intermediate network nodes is called quantum network coding. We describe how a scheme to distribute general two-colourable graph states via quantum routers with network coding can be constructed from classical linear network codes. The robustness of the distribution of graph states against outages of network nodes is analysed by establishing a link to stabilizer error correction codes. Furthermore we show, that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.

11 December 2013 in Physical Review Letters
Verified
Journal Article
Closed access
MEMichael Epping
Michael Epping
HKHermann Kampermann
Hermann Kampermann
DBDagmar Bruß
Dagmar Bruß
We present a simple analytic bound on the quantum value of general correlation type Bell inequalities, similar to Tsirelson's bound. It is based on the maximal singular value of the coefficient matrix associated with the inequality. We provide a criterion for tightness of the bound and show that the class of inequalities where our bound is tight covers many famous examples from the literature. We describe how this bound helps to construct Bell inequalities, in particular inequalities that witness the dimension of the measured observables.

6 March 2013 in Physical Review A
Verified
Journal Article
Closed access
MEMichael Epping
Michael Epping
ČBČaslav Brukner
Časlav Brukner
We present a simple communication complexity problem where three parties benefit from sharing bound entanglement. This demonstrates that entanglement distillability of the shared state is not necessary in order to surpass classical communication complexity.

18 June 2026 in Physical Review Letters
Verified
Journal Article
Open access
PHPedro Barrios Hita
Pedro Barrios Hita
ATAnton Trushechkin
Anton Trushechkin
HKHermann Kampermann
Hermann Kampermann
MEMichael Epping
Michael Epping
DBDagmar Bruß
Dagmar Bruß
Complex numbers play a crucial role in quantum mechanics. However, their necessity remains debated: whether they are fundamental or merely convenient. Recently, it was shown that any real-number quantum theory satisfying certain postulates can be falsified with multipartite experiments. In this Letter we show that a physically motivated postulate about composite quantum systems allows us to construct quantum mechanics based on real numbers that reproduces predictions for all multipartite quantum experiments. Thus, we argue that real-valued quantum mechanics cannot be falsified, and therefore the use of complex numbers is a matter of convenience.