arXiv subjects

J. Eisert

Publications and source records attributed to J. Eisert.

At least 163 records · Page 9Linked to original sources

arXiv2006

Multi-particle entanglement

We review the theory of multi-particle entanglement. In this book chapter we aim at briefly ``setting the coordinates'' and guiding through the extensive literature in this field. Our coordinate system chosen for this chapter has the axes labeled pure and mixed states on the one hand, entanglement in single specimens and the asymptotic setting on the other hand. We very briefly mention ways to detect multi-particle entanglement, and introduce the concepts of stabilizer and graph states.

quant-ph↗

arXiv2006

On the experimental feasibility of continuous-variable optical entanglement distillation

Entanglement distillation aims at preparing highly entangled states out of a supply of weakly entangled pairs, using local devices and classical communication only. In this note we discuss the experimentally feasible schemes for optical continuous-variable entanglement distillation that have been presented in [D.E. Browne, J. Eisert, S. Scheel, and M.B. Plenio, Phys. Rev. A 67, 062320 (2003)] and [J. Eisert, D.E. Browne, S. Scheel, and M.B. Plenio, Annals of Physics (NY) 311, 431 (2004)]. We emphasize their versatility in particular with regards to the detection process and discuss the merits of the two proposed detection schemes, namely photo-detection and homodyne detection, in the light of experimental realizations of this idea becoming more and more feasible.

quant-ph↗

arXiv2006

Minimal resources for linear optical one-way computing

We address the question of how many maximally entangled photon pairs are needed in order to build up cluster states for quantum computing using the toolbox of linear optics. As the needed gates in dual-rail encoding are necessarily probabilistic with known optimal success probability, this question amounts to finding the optimal strategy for building up cluster states, from the perspective of classical control. We develop a notion of classical strategies, and present rigorous statements on the ultimate maximal and minimal use of resources of the globally optimal strategy. We find that this strategy - being also the most robust with respect to decoherence - gives rise to an advantage of already more than an order of magnitude in the number of maximally entangled pairs when building chains with an expected length of L=40, compared to other legitimate strategies. For two-dimensional cluster states, we present a first scheme achieving the optimal quadratic asymptotic scaling. This analysis shows that the choice of appropriate classical control leads to a very significant reduction in resource consumption.

quant-ph↗

arXiv2006

Optimal entanglement witnesses for continuous-variable systems

This paper is concerned with all tests for continuous-variable entanglement that arise from linear combinations of second moments or variances of canonical coordinates, as they are commonly used in experiments to detect entanglement. All such tests for bi-partite and multi-partite entanglement correspond to hyperplanes in the set of second moments. It is shown that all optimal tests, those that are most robust against imperfections with respect to some figure of merit for a given state, can be constructed from solutions to semi-definite optimization problems. Moreover, we show that for each such test, referred to as entanglement witness based on second moments, there is a one-to-one correspondence between the witness and a stronger product criterion, which amounts to a non-linear witness, based on the same measurements. This generalizes the known product criteria. The presented tests are all applicable also to non-Gaussian states. To provide a service to the community, we present the documentation of two numerical routines, FULLYWIT and MULTIWIT, which have been made publicly available.

quant-ph↗

arXiv2006

Quantum computing

This article gives an elementary introduction to quantum computing. It is a draft for a book chapter of the "Handbook of Nature-Inspired and Innovative Computing", Eds. A. Zomaya, G.J. Milburn, J. Dongarra, D. Bader, R. Brent, M. Eshaghian-Wilner, F. Seredynski (Springer, Berlin Heidelberg New York, 2006).

quant-ph↗

arXiv2006

Feed-forward and its role in conditional linear optical quantum dynamics

Nonlinear optical quantum gates can be created probabilistically using only single photon sources, linear optical elements and photon-number resolving detectors. These gates are heralded but operate with probabilities much less than one. There is currently a large gap between the performance of the known circuits and the established upper bounds on their success probabilities. One possibility for increasing the probability of success of such gates is feed-forward, where one attempts to correct certain failure events that occurred in the gate's operation. In this brief report we examine the role of feed-forward in improving the success probability. In particular, for the non-linear sign shift gate, we find that in a three-mode implementation with a single round of feed-forward the optimal average probability of success is approximately given by p= 0.272. This value is only slightly larger than the general optimal success probability without feed-forward, P= 0.25.

quant-ph↗

arXiv2006

Entanglement in Graph States and its Applications

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a variety of applications in quantum information theory, most prominently as algorithmic resources in the context of the one-way quantum computer, but also in other fields such as quantum error correction and multi-partite quantum communication, as well as in the study of foundational issues such as non-locality and decoherence. In this review, we give a tutorial introduction into the theory of graph states. We introduce various equivalent ways how to define graph states, and discuss the basic notions and properties of these states. The focus of this review is on their entanglement properties. These include aspects of non-locality, bi-partite and multi-partite entanglement and its classification in terms of the Schmidt measure, the distillability properties of mixed entangled states close to a pure graph state, as well as the robustness of their entanglement under decoherence. We review some of the known applications of graph states, as well as proposals for their experimental implementation.

quant-ph↗

arXiv2006

Single-copy entanglement in critical spin chains

We introduce the single-copy entanglement as a quantity to assess quantum correlations in the ground state in quantum many-body systems. We show for a large class of models that already on the level of single specimens of spin chains, criticality is accompanied with the possibility of distilling a maximally entangled state of arbitrary dimension from a sufficiently large block deterministically, with local operations and classical communication. These analytical results -- which refine previous results on the divergence of block entropy as the rate at which EPR pairs can be distilled from many identically prepared chains, and which apply to single systems as encountered in actual experimental situations -- are made quantitative for general isotropic translationally invariant spin chains that can be mapped onto a quasi-free fermionic system, and for the anisotropic XY model. For the XX model, we provide the asymptotic scaling of ~(1/6) log_2(L), and contrast it with the block entropy. The role of superselection rules on single-copy entanglement in systems consisting of indistinguishable particles is emphasized.

quant-ph↗

arXiv2005

Optical generation of matter qubit graph states

We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph state edges even as qubits elsewhere are measured, in a `just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus.

quant-ph↗

arXiv2005

Continuity bounds on the quantum relative entropy

The quantum relative entropy is frequently used as a distance, or distinguishability measure between two quantum states. In this paper we study the relation between this measure and a number of other measures used for that purpose, including the trace norm distance. More precisely, we derive lower and upper bounds on the relative entropy in terms of various distance measures for the difference of the states based on unitarily invariant norms. The upper bounds can be considered as statements of continuity of the relative entropy distance in the sense of Fannes. We employ methods from optimisation theory to obtain bounds that are as sharp as possible.

quant-ph↗

arXiv2005

Multi-party entanglement in graph states

Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multi-party quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multi-particle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimension, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphies.

quant-ph↗

arXiv2005

Optimizing linear optics quantum gates

In this paper, the problem of finding optimal success probabilities of static linear optics quantum gates is linked to the theory of convex optimization. It is shown that by exploiting this link, upper bounds for the success probability of networks realizing single-mode gates can be derived, which hold in generality for linear optical networks followed by postselection, i.e., for networks of arbitrary size, any number of auxiliary modes, and arbitrary photon numbers. As a corollary, the previously formulated conjecture is proven that the optimal success probability of a postselected non-linear sign shift without feed-forward is 1/4, a gate playing the central role in the scheme of Knill-Laflamme-Milburn for quantum computation with linear optics. The concept of Lagrange duality is shown to be applicable to provide rigorous proofs for such bounds for elementary gates, although the original problem is a difficult non-convex problem in infinitely many objective variables. The versatility of this approach to identify other optimal linear optical schemes is demonstrated.

quant-ph↗

arXiv2005

Quantum Physics from A to Z

This is a collection of statements gathered on the occasion of the Quantum Physics of Nature meeting in Vienna.

quant-ph↗

arXiv2005

An entanglement-area law for general bosonic harmonic lattice systems

We demonstrate that the entropy of entanglement and the distillable entanglement of regions with respect to the rest of a general harmonic lattice system in the ground or a thermal state scale at most as the boundary area of the region. This area law is rigorously proven to hold true in non-critical harmonic lattice system of arbitrary spatial dimension, for general finite-ranged harmonic interactions, regions of arbitrary shape and states of nonzero temperature. For nearest-neighbor interactions - corresponding to the Klein-Gordon case - upper and lower bounds to the degree of entanglement can be stated explicitly for arbitrarily shaped regions, generalizing the findings of [Phys. Rev. Lett. 94, 060503 (2005)]. These higher dimensional analogues of the analysis of block entropies in the one-dimensional case show that under general conditions, one can expect an area law for the entanglement in non-critical harmonic many-body systems. The proofs make use of methods from entanglement theory, as well as of results on matrix functions of block banded matrices. Disordered systems are also considered. We moreover construct a class of examples for which the two-point correlation length diverges, yet still an area law can be proven to hold. We finally consider the scaling of classical correlations in a classical harmonic system and relate it to a quantum lattice system with a modified interaction. We briefly comment on a general relationship between criticality and area laws for the entropy of entanglement.

quant-ph↗

arXiv2005

Gaussian quantum channels

This article provides an elementary introduction to Gaussian channels and their capacities. We review results on the classical, quantum, and entanglement assisted capacities and discuss related entropic quantities as well as additivity issues. Some of the known results are extended. In particular, it is shown that the quantum conditional entropy is maximized by Gaussian states and that some implications for additivity problems can be extended to the Gaussian setting.

quant-ph↗

arXiv2005

Classical information capacity of a class of quantum channels

We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels the norm of the output is maximized for the output being a normalized projection. We prove the additivity of the minimal output Renyi entropies with entropic parameters contained in [0, 2], generalizing an argument by Alicki and Fannes, and present a number of examples in detail. In order to relate these results to the classical information capacity, we introduce a weak form of covariance of a channel. We then identify several instances of weakly covariant channels for which we can infer the additivity of the classical information capacity. Both additivity results apply to the case of an arbitrary number of different channels. Finally, we relate the obtained results to instances of bi-partite quantum states for which the entanglement cost can be calculated.

quant-ph↗

arXiv2005

Entropy, entanglement, and area: analytical results for harmonic lattice systems

We revisit the question of the relation between entanglement, entropy, and area for harmonic lattice Hamiltonians corresponding to discrete versions of real free Klein-Gordon fields. For the ground state of the d-dimensional cubic harmonic lattice we establish a strict relationship between the surface area of a distinguished hypercube and the degree of entanglement between the hypercube and the rest of the lattice analytically, without resorting to numerical means. We outline extensions of these results to longer ranged interactions, finite temperatures and for classical correlations in classical harmonic lattice systems. These findings further suggest that the tools of quantum information science may help in establishing results in quantum field theory that were previously less accessible.

quant-ph↗

arXiv2004

Resilience of multi-photon entanglement under losses

We analyze the resilience under photon loss of the bi-partite entanglement present in multi-photon states produced by parametric down-conversion. The quantification of the entanglement is made possible by a symmetry of the states that persists even under polarization-independent losses. We examine the approach of the states to the set of states with a positive partial transpose as losses increase, and calculate the relative entropy of entanglement. We find that some bi-partite distillable entanglement persists for arbitrarily high losses.

quant-ph↗