Refine
Has Fulltext
- no (58)
Year of publication
Document Type
- Article (56)
- Monograph/Edited Volume (1)
- Doctoral Thesis (1)
Language
- English (58)
Is part of the Bibliography
- yes (58)
Institute
- Institut für Physik und Astronomie (58) (remove)
We present an event-ready procedure that is capable of distilling Gaussian two-mode entangled states from a supply of weakly entangled states that have become mixed in a decoherence process. This procedure relies on passive optical elements and photon detectors distinguishing the presence and the absence of photons, but does not make use of photon counters. We identify fixed points of the iteration map, and discuss in detail its convergence properties. Necessary and sufficient criteria for the convergence to two-mode Gaussian states are presented. On the basis of various examples we discuss the performance of the procedure as far as the increase of the degree of entanglement and two-mode squeezing is concerned. Finally, we consider imperfect operations and outline the robustness of the scheme under non- unit detection efficiencies of the detectors. This analysis implies that the proposed protocol can be implemented with currently available technology and detector efficiencies. (C) 2004 Elsevier Inc. All rights reserved
We consider 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 maximally entangled pairs can be distilled from many identically prepared chains-are made quantitative for general isotropic translationally invariant spin chains that can be mapped onto a quasifree fermionic system, and for the anisotropic XY model. For the XX model, we provide the asymptotic scaling of similar to(1/6)log(2)(L), and contrast it with the block entropy
Physical interactions in quantum many-body systems are typically local: Individual constituents interact mainly with their few nearest neighbors. This locality of interactions is inherited by a decay of correlation functions, but also reflected by scaling laws of a quite profound quantity: the entanglement entropy of ground states. This entropy of the reduced state of a subregion often merely grows like the boundary area of the subregion, and not like its volume, in sharp contrast with an expected extensive behavior. Such "area laws" for the entanglement entropy and related quantities have received considerable attention in recent years. They emerge in several seemingly unrelated fields, in the context of black hole physics, quantum information science, and quantum many-body physics where they have important implications on the numerical simulation of lattice models. In this Colloquium the current status of area laws in these fields is reviewed. Center stage is taken by rigorous results on lattice models in one and higher spatial dimensions. The differences and similarities between bosonic and fermionic models are stressed, area laws are related to the velocity of information propagation in quantum lattice models, and disordered systems, nonequilibrium situations, and topological entanglement entropies are discussed. These questions are considered in classical and quantum systems, in their ground and thermal states, for a variety of correlation measures. A significant proportion is devoted to the clear and quantitative connection between the entanglement content of states and the possibility of their efficient numerical simulation. Matrix-product states, higher-dimensional analogs, and variational sets from entanglement renormalization are also discussed and the paper is concluded by highlighting the implications of area laws on quantifying the effective degrees of freedom that need to be considered in simulations of quantum states.
We establish a quantitative connection between the amount of lost classical information about a quantum state and the concomitant loss of entanglement. Using menthods that have been developed for the optimal purification of miced states, we find a class of miced states with known distillable entanglement. These results can be used to determine the quantum capacity of a quantum channel which randomizes the order of transmitted signals.
When locally exciting a quantum lattice model, the excitation will propagate through the lattice. This effect is responsible for a wealth of nonequilibrium phenomena, and has been exploited to transmit quantum information. It is a commonly expressed belief that for local Hamiltonians, any such propagation happens at a finite "speed of sound". Indeed, the Lieb-Robinson theorem states that in spin models, all effects caused by a perturbation are essentially limited to a causal cone. We show that for meaningful translationally invariant bosonic models with nearest-neighbor interactions (addressing the challenging aspect of an experimental realization) this belief is incorrect: We prove that one can encounter accelerating excitations under the natural dynamics that allow for reliable transmission of information faster than any finite speed of sound. It also implies that the simulation of dynamics of strongly correlated bosonic models may be much harder than that of spin chains even in the low-energy sector.
We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multiparty entangled, (B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multiparty entanglement, (D) the test whether states are multiparty entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree 3 or less. We then apply very recently established known methods from the theory of semidefinite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of efficiently decidable sufficient criteria for multiparticle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach
We study arrays of mechanical oscillators in the quantum domain and demonstrate how the motions of distant oscillators can be entangled without the need for control of individual oscillators and without a direct interaction between them. These oscillators are thought of as being members of an array of nanoelectromechanical resonators with a voltage being applicable between neighboring resonators. Sudden nonadiabatic switching of the interaction results in a squeezing of the states of the mechanical oscillators, leading to an entanglement transport in chains of mechanical oscillators. We discuss spatial dimensions, Q factors, temperatures and decoherence sources in some detail, and find a distinct robustness of the entanglement in the canonical coordinates in such a scheme. We also briefly discuss the challenging aspect of detection of the generated entanglement
Quantum many-body models describing natural systems or materials and physical systems assembled piece by piece in the laboratory for the purpose of realizing quantum information processing share an important feature: intricate correlations that originate from the coherent interaction between a large number of constituents. In recent years it has become manifest that the cross-fertilization between research devoted to quantum information science and to quantum many- body physics leads to new ideas, methods, tools, and insights in both fields. Issues of criticality, quantum phase transitions, quantum order and magnetism that play a role in one field find relations to the classical simulation of quantum systems, to error correction and fault tolerance thresholds, to channel capacities and to topological quantum computation, to name but a few. The structural similarities of typical problems in both fields and the potential for pooling of ideas then become manifest. Notably, methods and ideas from quantum information have provided fresh approaches to long-standing problems in strongly correlated systems in the condensed matter context, including both numerical methods and conceptual insights.
We consider entanglement-assisted remote quantum state manipulation of bipartite mixed states. Several aspects are addressed: we present a class of mixed states of rank two that can be transformed into another class of mixed states under entanglement-assisted local operations with classical communication, but for which such a transformation is impossible without assistance. Furthermore, we demonstrate enhancement of the efficiency of purification protocols with the help of entanglement-assisted operations. Finally, transformations from one mixed state to mixed target states which are sufficiently close to the source state are contrasted with similar transformations in the pure-state case.
Quantum games
(2000)
In these lecture notes we investigate the implications of the identification of strategies with quantum operations in game theory beyond the results presented in [J. Eisert, M. Wilkens, and M. Lewenstein, Phys. Rev. Lett. 83, 3077 (1999)]. After introducing a general framework, we study quantum games with a classical analogue in order to flesh out the peculiarities of game theoretical settings in the quantum domain. Special emphasis is given to a detailed investigation of different sets of quantum strategies.
We investigate the quantization of nonzero sum games. For the particular case of the Prisoners' Dilemma we show that this game ceases to pose a dilemma if quantum strategies are allowed for. We also construct a particular quantum strategy which always gives reward if played against any classical strategy.
Recent efforts have applied quantum tomography techniques to the calibration and characterization of complex quantum detectors using minimal assumptions. In this work, we provide detail and insight concerning the formalism, the experimental and theoretical challenges and the scope of these tomographical tools. Our focus is on the detection of photons with avalanche photodiodes and photon-number resolving detectors and our approach is to fully characterize the quantum operators describing these detectors with a minimal set of well-specified assumptions. The formalism is completely general and can be applied to a wide range of detectors.
Recent efforts have applied quantum tomography techniques to the calibration and characterization of complex quantum detectors using minimal assumptions. In this work, we provide detail and insight concerning the formalism, the experimental and theoretical challenges and the scope of these tomographical tools. Our focus is on the detection of photons with avalanche photodiodes and photon-number resolving detectors and our approach is to fully characterize the quantum operators describing these detectors with a minimal set of well-specified assumptions. The formalism is completely general and can be applied to a wide range of detectors.
We establish a link between unitary relaxation dynamics after a quench in closed many-body systems and the entanglement in the energy eigenbasis. We find that even if reduced states equilibrate, they can have memory on the initial conditions even in certain models that are far from integrable. We show that in such situations the equilibrium states are still described by a maximum entropy or generalized Gibbs ensemble, regardless of whether a model is integrable or not, thereby contributing to a recent debate. In addition, we discuss individual aspects of the thermalization process, comment on the role of Anderson localization, and collect and compare different notions of integrability.
Quantum computational webs
(2010)
We discuss the notion of quantum computational webs: These are quantum states universal for measurement-based computation, which can be built up from a collection of simple primitives. The primitive elements-reminiscent of building blocks in a construction kit-are (i) one-dimensional states (computational quantum wires) with the power to process one logical qubit and (ii) suitable couplings, which connect the wires to a computationally universal web. All elements are preparable by nearest-neighbor interactions in a single pass, of the kind accessible in a number of physical architectures. We provide a complete classification of qubit wires, a physically well-motivated class of universal resources that can be fully understood. Finally, we sketch possible realizations in superlattices and explore the power of coupling mechanisms based on Ising or exchange interactions.
It is often argued that entanglement is at the root of the speedup for quantum compared to classical computation, and that one needs a sufficient amount of entanglement for this speedup to be manifest. In measurement- based quantum computing, the need for a highly entangled initial state is particularly obvious. Defying this intuition, we show that quantum states can be too entangled to be useful for the purpose of computation, in that high values of the geometric measure of entanglement preclude states from offering a universal quantum computational speedup. We prove that this phenomenon occurs for a dramatic majority of all states: the fraction of useful n-qubit pure states is less than exp(-n(2)). This work highlights a new aspect of the role entanglement plays for quantum computational speedups.
We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In particular, they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rdlog(2)d) measurement settings, compared to standard methods that require d(2) settings. Our methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements, use fast convex optimization, are stable against noise, and can be applied to states that are only approximately low rank. The acquired data can be used to certify that the state is indeed close to pure, so no a priori assumptions are needed.