arXiv subjects

Matthias Christandl

Publications and source records attributed to Matthias Christandl.

At least 91 records · Page 5Linked to original sources

arXiv2016

Entanglement distillation from Greenberger-Horne-Zeilinger shares

We study the problem of converting a product of Greenberger-Horne-Zeilinger (GHZ) states shared by subsets of several parties in an arbitrary way into GHZ states shared by every party. Our result is that if SLOCC transformations are allowed, then the best asymptotic rate is the minimum of bipartite log-ranks of the initial state. This generalizes a result by Strassen on the asymptotic subrank of the matrix multiplication tensor.

quant-ph↗

arXiv2015

Entanglement Cost of Quantum Channels

The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this paper we show how to express this quantity as a regularised optimisation of the entanglement formation over states that can be generated between sender and receiver. Our formula is the channel analog of a well-known formula for the entanglement cost of quantum states in terms of the entanglement of formation; and shares a similar relation to the recently shattered hope for additivity. The entanglement cost of a quantum channel can be seen as the analog of the quantum reverse Shannon theorem in the case where free classical communication is allowed. The techniques used in the proof of our result are then also inspired by a recent proof of the quantum reverse Shannon theorem and feature the one-shot formalism for quantum information theory, the post-selection technique for quantum channels as well as Sion's minimax theorem. We discuss two applications of our result. First, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only improves the range of parameters where security can be shown, but also allows us to prove security for storage devices for which no results were known before. Second, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.

quant-ph↗

arXiv2015

Smooth Entropy Bounds on One-Shot Quantum State Redistribution

In quantum state redistribution as introduced in [Luo and Devetak (2009)] and [Devetak and Yard (2008)], there are four systems of interest: the $A$ system held by Alice, the $B$ system held by Bob, the $C$ system that is to be transmitted from Alice to Bob, and the $R$ system that holds a purification of the state in the $ABC$ registers. We give upper and lower bounds on the amount of quantum communication and entanglement required to perform the task of quantum state redistribution in a one-shot setting. Our bounds are in terms of the smooth conditional min- and max-entropy, and the smooth max-information. The protocol for the upper bound has a clear structure, building on the work [Oppenheim (2008)]: it decomposes the quantum state redistribution task into two simpler quantum state merging tasks by introducing a coherent relay. In the independent and identical (iid) asymptotic limit our bounds for the quantum communication cost converge to the quantum conditional mutual information $I(C:R|B)$, and our bounds for the total cost converge to the conditional entropy $H(C|B)$. This yields an alternative proof of optimality of these rates for quantum state redistribution in the iid asymptotic limit. In particular, we obtain a strong converse for quantum state redistribution, which even holds when allowing for feedback.

quant-ph↗

arXiv2015

Limitations on Quantum Key Repeaters

A major application of quantum communication is the distribution of entangled particles for use in quantum key distribution (QKD). Due to noise in the communication line, QKD is in practice limited to a distance of a few hundred kilometres, and can only be extended to longer distances by use of a quantum repeater, a device which performs entanglement distillation and quantum teleportation. The existence of noisy entangled states that are undistillable but nevertheless useful for QKD raises the question of the feasibility of a quantum key repeater, which would work beyond the limits of entanglement distillation, hence possibly tolerating higher noise levels than existing protocols. Here we exhibit fundamental limits on such a device in the form of bounds on the rate at which it may extract secure key. As a consequence, we give examples of states suitable for QKD but unsuitable for the most general quantum key repeater protocol.

quant-ph↗

arXiv2015

Position-Momentum Uncertainty Relations in the Presence of Quantum Memory

A prominent formulation of the uncertainty principle identifies the fundamental quantum feature that no particle may be prepared with certain outcomes for both position and momentum measurements. Often the statistical uncertainties are thereby measured in terms of entropies providing a clear operational interpretation in information theory and cryptography. Recently, entropic uncertainty relations have been used to show that the uncertainty can be reduced in the presence of entanglement and to prove security of quantum cryptographic tasks. However, much of this recent progress has been focused on observables with only a finite number of outcomes not including Heisenberg's original setting of position and momentum observables. Here we show entropic uncertainty relations for general observables with discrete but infinite or continuous spectrum that take into account the power of an entangled observer. As an illustration, we evaluate the uncertainty relations for position and momentum measurements, which is operationally significant in that it implies security of a quantum key distribution scheme based on homodyne detection of squeezed Gaussian states.

quant-ph↗

arXiv2014

Entanglement Polytopes: Multiparticle Entanglement from Single-Particle Information

Entangled many-body states are an essential resource for quantum computing and interferometry. Determining the type of entanglement present in a system usually requires access to an exponential number of parameters. We show that in the case of pure multi-particle quantum states, features of the global entanglement can already be extracted from local information alone. This is achieved by associating with any given class of entanglement an entanglement polytope---a geometric object which characterizes the single-particle states compatible with that class. Our results, applicable to systems of arbitrary size and statistics, give rise to local witnesses for global pure-state entanglement, and can be generalized to states affected by low levels of noise.

quant-ph↗

arXiv2014

Eigenvalue Distributions of Reduced Density Matrices

Given a random quantum state of multiple distinguishable or indistinguishable particles, we provide an effective method, rooted in symplectic geometry, to compute the joint probability distribution of the eigenvalues of its one-body reduced density matrices. As a corollary, by taking the distribution's support, which is a convex moment polytope, we recover a complete solution to the one-body quantum marginal problem. We obtain the probability distribution by reducing to the corresponding distribution of diagonal entries (i.e., to the quantitative version of a classical marginal problem), which is then determined algorithmically. This reduction applies more generally to symplectic geometry, relating invariant measures for the coadjoint action of a compact Lie group to their projections onto a Cartan subalgebra, and can also be quantized to provide an efficient algorithm for computing bounded height Kronecker and plethysm coefficients.

quant-ph↗

arXiv2014

Asymptotic entanglement transformation between W and GHZ states

We investigate entanglement transformations with stochastic local operations and classical communication (SLOCC) in an asymptotic setting using the concepts of degeneration and border rank of tensors from algebraic complexity theory. Results well-known in that field imply that GHZ states can be transformed into W states at rate 1 for any number of parties. As a generalization, we find that the asymptotic conversion rate from GHZ states to Dicke states is bounded as the number of subsystems increase and the number of excitations is fixed. By generalizing constructions of Coppersmith and Winograd and by using monotones introduced by Strassen we also compute the conversion rate from W to GHZ states.

quant-ph↗

arXiv2013

Electric-magnetic duality of lattice systems with topological order

We investigate the duality structure of quantum lattice systems with topological order, a collective order also appearing in fractional quantum Hall systems. We define electromagnetic (EM) duality for all of Kitaev's quantum double models based on discrete gauge theories with Abelian and non-Abelian groups, and identify its natural habitat as a new class of topological models based on Hopf algebras. We interpret these as extended string-net models, whereupon Levin and Wen's string-nets, which describe all intrinsic topological orders on the lattice with parity and time-reversal invariance, arise as magnetic and electric projections of the extended models. We conjecture that all string-net models can be extended in an analogous way, using more general algebraic and tensor-categorical structures, such that EM duality continues to hold. We also identify this EM duality with an invertible domain wall. Physical applications include topology measurements in the form of pairs of dual tensor networks.

cond-mat.str-el↗

arXiv2012

Reliable Quantum State Tomography

Quantum state tomography is the task of inferring the state of a quantum system by appropriate measurements. Since the frequency distributions of the outcomes of any finite number of measurements will generally deviate from their asymptotic limits, the estimates computed by standard methods do not in general coincide with the true state, and therefore have no operational significance unless their accuracy is defined in terms of error bounds. Here we show that quantum state tomography, together with an appropriate data analysis procedure, yields reliable and tight error bounds, specified in terms of confidence regions - a concept originating from classical statistics. Confidence regions are subsets of the state space in which the true state lies with high probability, independently of any prior assumption on the distribution of the possible states. Our method for computing confidence regions can be applied to arbitrary measurements including fully coherent ones; it is practical and particularly well suited for tomography on systems consisting of a small number of qubits, which are currently in the focus of interest in experimental quantum information science.

quant-ph↗

arXiv2012

Computing Multiplicities of Lie Group Representations

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is based on a finite difference formula which makes the multiplicities amenable to Barvinok's algorithm for counting integral points in polytopes. The Kronecker coefficients of the symmetric group, which can be seen to be a special case of such multiplicities, play an important role in the geometric complexity theory approach to the P vs. NP problem. Whereas their computation is known to be #P-hard for Young diagrams with an arbitrary number of rows, our algorithm computes them in polynomial time if the number of rows is bounded. We complement our work by showing that information on the asymptotic growth rates of multiplicities in the coordinate rings of orbit closures does not directly lead to new complexity-theoretic obstructions beyond what can be obtained from the moment polytopes of the orbit closures. Non-asymptotic information on the multiplicities, such as provided by our algorithm, may therefore be essential in order to find obstructions in geometric complexity theory.

cs.CC↗

arXiv2012

Pinning of Fermionic Occupation Numbers

The Pauli exclusion principle is a constraint on the natural occupation numbers of fermionic states. It has been suspected since at least the 1970's, and only proved very recently, that there is a multitude of further constraints on these numbers, generalizing the Pauli principle. Here, we provide the first analytic analysis of the physical relevance of these constraints. We compute the natural occupation numbers for the ground states of a family of interacting fermions in a harmonic potential. Intriguingly, we find that the occupation numbers are almost, but not exactly, pinned to the boundary of the allowed region (quasi-pinned). The result suggests that the physics behind the phenomenon is richer than previously appreciated. In particular, it shows that for some models, the generalized Pauli constraints play a role for the ground state, even though they do not limit the ground-state energy. Our findings suggest a generalization of the Hartree-Fock approximation.

quant-ph↗

arXiv2012

Complete Insecurity of Quantum Protocols for Classical Two-Party Computation

A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of the function. In this Letter, we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing, and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate and if the function that is computed for Bob is different from that of Alice.

quant-ph↗

arXiv2012

Faithful Squashed Entanglement

Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, strictly positive if and only if the state is entangled. We derive the bound on squashed entanglement from a bound on quantum conditional mutual information, which is used to define squashed entanglement and corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof is based on two recent results from quantum information theory: the operational interpretation of the quantum mutual information as the optimal rate for state redistribution and the interpretation of the regularised relative entropy of entanglement as an error exponent in hypothesis testing. The distance to the set of separable states is measured by the one-way LOCC norm, an operationally-motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shared by two parties, using any protocol formed by local quantum operations and one-directional classical communication between the parties. A similar result for the Frobenius or Euclidean norm follows immediately. The result has two applications in complexity theory. The first is a quasipolynomial-time algorithm solving the weak membership problem for the set of separable states in one-way LOCC or Euclidean norm. The second concerns quantum Merlin-Arthur games. Here we show that multiple provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations thereby providing a new characterisation of the complexity class QMA.

quant-ph↗

arXiv2012

Nonvanishing of Kronecker coefficients for rectangular shapes

We prove that for any partition $(λ_1,...,λ_{d^2})$ of size $\ell d$ there exists $k\ge 1$ such that the tensor square of the irreducible representation of the symmetric group $S_{k\ell d}$ with respect to the rectangular partition $(k\ell,...,k\ell)$ contains the irreducible representation corresponding to the stretched partition $(kλ_1,...,kλ_{d^2})$. We also prove a related approximate version of this statement in which the stretching factor $k$ is effectively bounded in terms of $d$. This investigation is motivated by questions of geometric complexity theory.

math.GR↗

arXiv2012

Entanglement of the Antisymmetric State

We analyse the entanglement of the antisymmetric state in dimension d x d and present two main results. First, we show that the amount of secrecy that can be extracted from the state is low, more precisely, the distillable key is bounded by O(1/d). Second, we show that the state is highly entangled in the sense that a large number of ebits are needed in order to create the state: entanglement cost is larger than a constant, independent of d. The second result is shown to imply that the regularised relative entropy with respect to separable states is also lower bounded by a constant. Finally, we note that the regularised relative entropy of entanglement is asymptotically continuous in the state. Elementary and advanced facts from the representation theory of the unitary group, including the concept of plethysm, play a central role in the proofs of the main results.

quant-ph↗

arXiv2011

The Quantum Reverse Shannon Theorem based on One-Shot Information Theory

The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel's entanglement assisted classical capacity. In this paper, we provide a new proof of this theorem, which has previously been proved by Bennett, Devetak, Harrow, Shor, and Winter. Our proof has a clear structure being based on two recent information-theoretic results: one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.

quant-ph↗

arXiv2011

Detection of Multiparticle Entanglement: Quantifying the Search for Symmetric Extensions

We provide quantitative bounds on the characterisation of multiparticle separable states by states that have locally symmetric extensions. The bounds are derived from two-particle bounds and relate to recent studies on quantum versions of de Finetti's theorem. We discuss algorithmic applications of our results, in particular a quasipolynomial-time algorithm to decide whether a multiparticle quantum state is separable or entangled (for constant number of particles and constant error in the LOCC or Frobenius norm). Our results provide a theoretical justification for the use of the Search for Symmetric Extensions as a practical test for multiparticle entanglement.

quant-ph↗