This thesis investigates questions related with the quantification, creation and application of entanglement. We first show how the notion of entanglement is modified by the presence of superselection rules. Next, we develop protocols for the optimal generation of squeezing and entanglement from noisy operations. The second part of the thesis applies quantum information methods to quantum many-body problems. We start by investigating the relation of Hamiltonian and correlations for lattices of harmonic oscillators. Next, we turn towards the description of many-body systems in terms of Matrix Product States (MPS) and Projected Entangled Pair States (PEPS). We clarify the relation between entropy scaling laws and the approximability by MPS, and determine the computational complexity of creating and simulating PEPS. Finally, we define Gaussian MPS as a generalization of MPS to bosonic systems.
This thesis investigates questions related with the quantification, creation and application of entanglement. We first show how the notion of entanglement is modified by the presence of superselection rules. Next, we develop protocols for the optimal generation of squeezing and entanglement from noisy operations. The second part of the thesis applies quantum information methods to quantum many-body problems. We start by investigating the relation of Hamiltonian and correlations for lattices of harmonic oscillators. Next, we turn towards the description of many-body systems in terms of Matrix Product States (MPS) and Projected Entangled Pair States (PEPS). We clarify the relation between entropy scaling laws and the approximability by MPS, and determine the computational complexity of creating and simulating PEPS. Finally, we define Gaussian MPS as a generalization of MPS to bosonic systems.
THESIS SUMMARYTEXT:This thesis is made of two parts. In the first one, the issue of entanglement in many body systems is addressed. The concept of entanglement and some of the recent progress on the study of entropy of entanglement in many body quantum systems are reviewed. Emphasis is placed on the scaling properties of entropy for one-dimensional models at quantum phase transitions. Then, we focus on the area-law scaling of the entanglement entropy. An explicit computation in arbitrary dimensions of the entanglement entropy of the ground state of a discretized scalar free field theory that shows the expected area law result is also presented. For this system, it is shown that area law scaling is a manifestation of a deeper reordering of the vacuum produced by majorization relations.To finish this first part, the issue of how simple can a quantum system be such as to give a highly entangled ground state is addressed. In particular, we propose a Hamiltonian of a XX model with a ground state whose entropy scales linearly with the size of the block. It provides a simple example of a one dimensional system of spin-1/2 particles with nearest neighbour interactions that violates area-law for the entanglement entropy.The second part of this thesis deals with the problem of simulating quantum mechanics for highly entangled systems. Two different approaches to this issue are considered. One consists of using ultra-cold atoms systems as quantum simulators. With this aim, some experimental techniques related to cold atoms that allow to simulate strongly correlated many body quantum systems are reviewed an explicit example of simulation is presented. In particular, we analyze how to achieve a Mott state of Laughlin wave functions in an optical lattice and study the consequences of considering anharmonic corrections to each single site potential expansion that were not taken into account until now.Finally, a different approach to simulate strongly correlated systems is considered: to use small quantum computers to simulate them. An explicit quantum algorithm that creates the Laughlin state for an arbitrary number of particles n in the case of falling fraction equal to one is presented. We further prove the optimality of the circuit using permutation theory arguments and we compute exactly how entanglement develops along the action of each gate. We also discuss its experimental feasibility decomposing the qudits and the gates in terms of qubits and two qubit-gates as well as the generalization to arbitrary falling fraction.KEYWORDS: Entanglement, Many body quantum systems, Quantum Information Condensed Matter, Cold atoms, Spin chains, Quantum simulator, Quantum computation.
The thesis presents research related to the dynamics of quantum systems, both isolated and in the presence of interactions with their environment. Generally, I employ matrix product state (MPS) techniques to explore quantum dynamics in open and closed systems. In the first part I present a study of quantum chaos and how mapping to a MPS variational manifold allow the use of techniques developed in the study of classical many-body systems. Using code developed for this project the Lyapunov spectrum is extracted to give an alternative perspective on eigenstate thermalization, pre-thermalization and integrability. In the second part, I present a novel combination of MPS methods with a Langevin description of the open system. I use this to show how coupling to the environment restricts the growth of entanglement. The consequences of this are relevant for simulations of open quantum systems and their use in in quantum technologies. Finally I discuss applications of these ideas to quantum search. I consider adiabatic and quantum walk algorithms for optimal scaling quantum search algorithms, and hybridizations between the two. The robustness of the different underlying physical mechanisms is investigated in a simple infinite-temperature model, and in a low-temperature limit using the MPS Langevin equation.
This thesis addresses a number of problems within the emerging field of quantum information science. Quantum information science can be said to encompass the more-established disciplines of quantum computation and quantum information, as well as rather more recent attempts to apply concepts, tools and techniques from these disciplines to gain greater understanding of quantum systems in general. The role of entanglement — non-classical correlation — has been of particular interest to date. Part I contributes to this later goal. In particular, we establish a connection between the energy of a many-body quantum system and the idea of an entanglement witness from the theory of mixed-state entanglement. This connection allows mathematical results about entanglement witnesses to be translated into physical results about many-body quantum systems, specifically energy and temperature thresholds for entanglement. For the case of two qubits we are able to establish fairly detailed results about the behaviour of entanglement with temperature. We also study entanglement in systems of indistinguishable particles, where even the question of which quantum states should be regarded as entangled has been the subject of much controversy. We aim to clarify this issue by applying Wiseman and Vaccaro’s notion of entanglement of particles to a number of wellunderstood model systems. We discuss the advantages of the entanglement of particles approach compared with other methods in common use. Finally, we study the operational meaning of superselection rules in quantum physics, in particular the connection to the existence or not of an appropriate reference frame. We propose an experiment that aims to exhibit a coherent superposition of an atom and a molecule, apparently in violation of the commonly-accepted particle-number superselection rule. This result sheds light on the entanglement of particles approach to entanglement of indistinguishable particles. Part II returns to a fundamental question at the heart of quantum computation and quantum information, namely: how many quantum gates are required to perform a particular quantum computation? In other words, how efficiently can a quantum computer solve a particular computational problem? We establish a connection between this question and the field of Riemannian geometry. Intuitively, optimal quantum circuits correspond to “free-falling” along the shortest path between two points in a curved space. This opens up the possibility of using Riemannian geometry to study quantum computation, a possibility that was previously unknown. We provide explicit calculations of all the basic geometric quantities associated with the space, and give some preliminary results of applying geometric ideas to quantum computing. Finally, we explore more generally the connection between optimal control and quantum circuit complexity, of which the Riemannian metric described above can be viewed as a special case.
In this thesis we present new results relevant to two important problems in quantum information science: the development of a theory of entanglement and the exploration of the use of controlled quantum systems to the simulation of quantum many-body phenomena. In the first part we introduce a new approach to the study of entanglement by considering its manipulation under operations not capable of generating entanglement and show there is a total order for multipartite quantum states in this framework. We also present new results on hypothesis testing of correlated sources and give further evidence on the existence of NPPT bound entanglement. In the second part, we study the potential as well as the limitations of a quantum computer for calculating properties of many-body systems. First we analyse the usefulness of quantum computation to calculate additive approximations to partition functions and spectral densities of local Hamiltonians. We then show that the determination of ground state energies of local Hamiltonians with an inverse polynomial spectral gap is QCMA-hard. In the third and last part, we approach the problem of quantum simulating many-body systems from a more pragmatic point of view. We analyze the realization of paradigmatic condensed matter Hamiltonians in arrays of coupled microcavities, such as the Bose-Hubbard and the anisotropic Heisenberg models, and discuss the feasibility of an experimental realization with state-of-the-art current technology.
This thesis is devoted to the study of quantum many-body systems. This investigation is performed in the framework of Matrix Product States (MPS) and their generalization to higher dimensions, Projected Entangled Pair States (PEPS). In the first part of the work, we discuss the mathematical properties of such tensor network states in depth. In the first chapters we deal with one-dimensional systems, for which we use the connections between MPS and completely positive maps to prove several new results, such as the quantum version of the Wielandt's inequality or the construction of locally invariant states under a symmetry group. Chapters 5-7 are dedicated to higher-dimensional systems, for which we provide the conditions to construct invariant PEPS. The second part of the thesis is dedicated to applications in condensed matter. In chapter 8 we provide several methods of constructing quasi-solvable Hamiltonians with two-body interactions, while in chapter 9 we show that these tensor network states can be used as a laboratory for theoretical condensed matter in, for instance, the characterization of the string-order, the generalization of the Lieb-Schultz-Mattis theorem, the demonstration of new theorems relating entanglement to magnetisation or to long-range interactions, etc.
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating non-classical correlations, or quantum entanglement, which is a phenomena hard or impossible to reproduce by classical-information methods. In this thesis I first investigate the simulation of quantum systems on a quantum computer constructed of two-level quantum elements or qubits. For this purpose, I present algebra mappings that allow one to obtain physical properties and compute correlation functions of fermionic, anyonic, and bosonic systems with such a computer. The results obtained show that the complexity of preparing a quantum state which contains the desired information for the computation is crucial. Second, I present a wide class of quantum computations, which could involve entangled states, that can be simulated with the same efficiency on both types of computers. The notion of generalized quantum entanglement then naturally emerges. This generalization of entanglement is based on the idea that entanglement is an observer-dependent concept, that is, relative to a set of preferred observables.