Christian Majenz

Dr. Christian Majenz


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
6 January 2015 in Nature Communications
Verified
Journal Article
Open access
PDF file
RCRafael Chaves
Rafael Chaves
CMChristian Majenz
Christian Majenz
DGDavid Gross
David Gross
It is a relatively new insight of classical statistics that empirical data can contain information about causation rather than mere correlation. First algorithms have been proposed that are capable of testing whether a presumed causal relationship is compatible with an observed distribution. However, no systematic method is known for treating such problems in a way that generalizes to quantum systems. Here, we describe a general algorithm for computing information–theoretic constraints on the correlations that can arise from a given causal structure, where we allow for quantum systems as well as classical random variables. The general technique is applied to two relevant cases: first, we show that the principle of information causality appears naturally in our framework and go on to generalize and strengthen it. Second, we derive bounds on the correlations that can occur in a networked architecture, where a set of few-body quantum systems is distributed among some parties.

1 August 2019
Verified
Book Chapter
Closed access
PDF file
JDJelle Don
Jelle Don
SFSerge Fehr
Serge Fehr
CMChristian Majenz
Christian Majenz
CSChristian Schaffner
Christian Schaffner

8 July 2013 in Physical Review A
Verified
Journal Article
Open access
PDF file
CMChristian Majenz
Christian Majenz
TATameem Albash
Tameem Albash
HBHeinz-Peter Breuer
Heinz-Peter Breuer
DLDaniel A. Lidar
Daniel A. Lidar
We present a first-principles derivation of the Markovian semigroup master equation without invoking the rotating-wave approximation (RWA). Instead we use a time coarse-graining approach that leaves us with a free time-scale parameter, which we can optimize. Comparing this approach to the standard RWA-based Markovian master equation, we find that significantly better agreement is possible using the coarse-graining approach, for a three-level model coupled to a bath of oscillators, whose exact dynamics we can solve for at zero temperature. The model has the important feature that the RWA has a nontrivial effect on the dynamics of the populations. We show that the two different master equations can exhibit strong qualitative differences for the population of the energy eigenstates even for such a simple model. The RWA-based master equation misses an important feature which the coarse-graining-based scheme does not. By optimizing the coarse-graining time scale the latter scheme can be made to approach the exact solution much more closely than the RWA-based master equation.

23 February 2017 in Physical Review Letters
Verified
Journal Article
Open access
PDF file
CMChristian Majenz
Christian Majenz
MBMario Berta
Mario Berta
FDFrédéric Dupuis
Frédéric Dupuis
RRRenato Renner
Renato Renner
MCMatthias Christandl
Matthias Christandl
The decoupling technique is a fundamental tool in quantum information theory with applications ranging from thermodynamics to many-body physics and black hole radiation whereby a quantum system is decoupled from another one by discarding an appropriately chosen part of it. Here, we introduce catalytic decoupling, i.e., decoupling with the help of an independent system. Thereby, we remove a restriction on the standard decoupling notion and present a tight characterization in terms of the max-mutual information. The novel notion unifies various tasks and leads to a resource theory of decoupling.

20 November 2020 in Communications in Mathematical Physics
Verified
Journal Article
Open access
PDF file
MCMatthias Christandl
Matthias Christandl
FLFelix Leditzky
Felix Leditzky
CMChristian Majenz
Christian Majenz
GSGraeme Smith
Graeme Smith
FSFlorian Speelman
Florian Speelman
MWMichael Walter
Michael Walter
Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number N of ports, the error of the optimal protocol is proportional to the inverse square of N. We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur–Weyl distribution by Johansson, which might be of independent interest.

25 May 2022
Verified
Book Chapter
Closed access
PDF file
JDJelle Don
Jelle Don
SFSerge Fehr
Serge Fehr
CMChristian Majenz
Christian Majenz
CSChristian Schaffner
Christian Schaffner