Refine
Year of publication
Document Type
- Article (56)
- Monograph/Edited Volume (1)
- Doctoral Thesis (1)
- Part of Periodical (1)
Is part of the Bibliography
- yes (59)
Institute
We present a measure of quantum entanglement which is capable of quantifying the degree of entanglement of a multi-partite quantum system. This measure, which is based on a generalization of the Schmidt rank of a pure state, is defined on the full state space and is shown to be an entanglement monotone, that is, it cannot increase under local quantum operations with classical communication and under mixing. For a large class of mixed states this measure of entanglement can be calculated exactly, and it provides a detailed classification of mixed states.
We analyze the resilience under photon loss of the bipartite entanglement present in multiphoton 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 positive partial transpose states as losses increase, and calculate the relative entropy of entanglement. We find that some bipartite distillable entanglement persists for arbitrarily high losses
We introduce a class of variational states to describe quantum many-body systems. This class generalizes matrix product states which underlie the density-matrix renormalization-group approach by combining them with weighted graph states. States within this class may (i) possess arbitrarily long-ranged two-point correlations, (ii) exhibit an arbitrary degree of block entanglement entropy up to a volume law, (iii) be taken translationally invariant, while at the same time (iv) local properties and two-point correlations can be computed efficiently. This variational class of states can be thought of as being prepared from matrix product states, followed by commuting unitaries on arbitrary constituents, hence truly generalizing both matrix product and weighted graph states. We use this class of states to formulate a renormalization algorithm with graph enhancement and present numerical examples, demonstrating that improvements over density-matrix renormalization-group simulations can be achieved in the simulation of ground states and quantum algorithms. Further generalizations, e.g., to higher spatial dimensions, are outlined.
Real-space renormalization approaches for quantum lattice systems generate certain hierarchical classes of states that are subsumed by the multiscale entanglement renormalization Ansatz (MERA). It is shown that, with the exception of one spatial dimension, MERA states are actually states with finite correlations, i.e., projected entangled pair states (PEPS) with a bond dimension independent of the system size. Hence, real-space renormalization generates states which can be encoded with local effective degrees of freedom, and MERA states form an efficiently contractible class of PEPS that obey the area law for the entanglement entropy. It is further pointed out that there exist other efficiently contractible schemes violating the area law.
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.
We present an excerpt of the document "Quantum Information Processing and Communication: Strategic report on current status, visions and goals for research in Europe", which has been recently published in electronic form at the website of FET (the Future and Emerging Technologies Unit of the Directorate General Information Society of the European Commission, http://www.cordis.lu/ist/fet/qipc-sr.htm). This document has been elaborated, following a former suggestion by FET, by a committee of QIPC scientists to provide input towards the European Commission for the preparation of the Seventh Framework Program. Besides being a document addressed to policy makers and funding agencies (both at the European and national level), the document contains a detailed scientific assessment of the state-of-the-art, main research goals, challenges, strengths, weaknesses, visions and perspectives of all the most relevant QIPC sub-fields, that we report here
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.
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.
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.