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.
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.
Quantum mechanics led us to reconsider the scope of physics and its building principles, such as the notions of realism and locality. More recently, quantum theory has changed in an equally dramatic manner our understanding of information processing and computation. On one hand, the fundamental properties of quantum systems can be harnessed to transmit, store, and manipulate information in a more efficient and secure way than possible in the realm of classical physics. On the other hand, the development of systematic procedures to manipulate systems of a large number of particles in the quantum regime, crucial to the implementation of quantum-based information processing, has triggered new possibilities in the exploration of quantum many-body physics and related areas. In this thesis, we present new results relevant to two important problems in quantum information science: the development of a theory of entanglement, intrinsically quantum correlations, and the exploration of the use of controlled quantum systems to the computation and simulation of quantum many-body phenomena. In the first part we introduce a new approach to the study of entanglement
This thesis is devoted to the theoretical characterization and generation of strongly correlated many-body states from the perspective of quantum information theory.We first study the entanglement properties of general many-body states and define a new measure for multipartite entanglement, the "Localizable Entanglement (LE)".It quantifies the maximal entanglement that can be localized, on average, between two parties by performing local measurements on the other parties.This measure provides knowledge of the "entanglement length", which is of particular importance in the context of quantum repeaters for long-distance quantum communication.We prove upper and lower bounds on LE in terms of two-body correlation functions and develop a method for the numerical computation of LE in one-dimensional spin systems.We analyze the localizable entanglement in various spin systems and observe characteristic features for a quantum phase transition such as a diverging entanglement length.In the second part of the thesis we focus on a specific many-body system: ultra-cold atoms in an optical lattice.This system is a promising candidate for the first physical realization of a "quantum simulator", but the temperature in current experiments is still too high.We propose, analyze and compare several schemes to cool the atoms close to the ground state of the strong interaction regime.In particular, we devise an algorithmic cooling protocol that combines occupation number filtering with spin-dependent lattice shifts.In addition, we propose two different physical realizations of filtering and also design protocols that generate an ensemble of quantum registers for quantum computation.In the third part we propose how to create entanglement in small atomic clouds by deforming and rotating the harmonic trapping potential.The resulting states are entangled in their motional degrees of freedom and can be identified with strongly correlated fractional quantum Hall states.For the case of two, three and four atoms we show how to adiabatically transform the unentangled ground state into the desired entangled state.We further discuss characteristic features of these states and propose how to create and detect them experimentally using an optical lattice setup. A Proof of the lower bound on LEA.1 Theorem on connected correlation functions and local measurements . . . . . . . . .
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.
One of the most important predictions of quantum mechanics is the existence of quantum entanglement. Since the inception of quantum theory, the study of entanglement has become ubiquitous in several branches of physics, from high energy to condensed matter physics and quantum information. To this avail, different measures of entanglement in quantum systems have been introduced. The most successful ones are the von Neumann and the Rényi entanglement entropies, which have been heavily studied both in lattice models and in quantum field theories (QFTs). A different, more complete characterization of entanglement is provided by the entanglement (or modular) Hamiltonian, defined as the logarithm of the reduced density matrix. One of the key property of this operator is that, under generic conditions, in 1+1-dimensional conformal field theories (CFTs) presents a local and few-body structure. Beyond just being of theoretical interest, this property has been recently used to efficiently construct the ground state of spin chains in quantum simulators. A recently introduced generalisation of the entanglement Hamiltonian is the negativity Hamiltonian, a non-Hermitian operator which is more useful for mixed states and tripartite entanglement. In this thesis we study these quantifications in many-body quantum systems and in QFTs. In the first part of the thesis, we focus on fermionic systems at equilibrium, and we obtain analytical expressions for the entanglement and the negativity Hamiltonians in the massless Dirac fermion QFT, both in presence of boundaries and at finite temperature. We compare these predictions in the continuum QFT with numerical calculations on the lattice, showing that a proper comparison requires a non-trivial continuum limit of the lattice expression, which we detail. We also investigate a lattice realisation of a non-unitary CFT, the bc-ghost theory, showing that the entanglement Hamiltonian presents an additional term with respect to the unitary case. In the second part, we study the entanglement entropies in an integrable QFT, the massless renormalisation group flow from the tricritical to the critical Ising CFT, demonstrating that the entropy is monotonically decreasing under the renormalisation group flow, as expected from the entropic c-theorem. In the third part we consider out-of-equilibrium problems. We study the melting of a domain wall configuration, computing analytically the entanglement Hamiltonian and showing that the insertion of a defect dramatically modifies the entanglement properties, changing the growth of the entropies from logarithmic to linear in time. Finally, we study generic quantum quenches in free fermionic theories, using the celebrated quasiparticle picture to obtain a prediction for the evolution of the entanglement Hamiltonian during the quench.
Quantum computing is the offspring of quantum mechanics and computer science, two great scientific fields founded in the 20th century. Quantum computing is a relatively young field and is recognized as having the potential to revolutionize science and technology in the coming century. The primary question in this field is essentially to ask which problems are feasible with potential quantum computers and which are not. In this dissertation, we study this question with a physical bent of mind. We apply tools from computer science and mathematical physics to study the complexity of simulating quantum systems. In general, our goal is to identify parameter regimes under which simulating quantum systems is easy (efficiently solvable) or hard (not efficiently solvable). This study leads to an understanding of the features that make certain problems easy or hard to solve. We also get physical insight into the behavior of the system being simulated. In the first part of this dissertation, we study the classical complexity of simulating quantum dynamics. In general, the systems we study transition from being easy to simulate at short times to being harder to simulate at later times. We argue that the transition timescale is a useful measure for various Hamiltonians and is indicative of the physics behind the change in complexity. We illustrate this idea for a specific bosonic system, obtaining a complexity phase diagram that delineates the system into easy or hard for simulation. We also prove that the phase diagram is robust, supporting our statement that the phase diagram is indicative of the underlying physics. In the next part, we study open quantum systems from the point of view of their potential to encode hard computational problems. We study a class of fermionic Hamiltonians subject to Markovian noise described by Lindblad jump operators and illustrate how, sometimes, certain Lindblad operators can induce computational complexity into the problem. Specifically, we show that these operators can implement entangling gates, which can be used for universal quantum computation. We also study a system of bosons with Gaussian initial states subject to photon loss and detected using photon-number-resolving measurements. We show that such systems can remain hard to simulate exactly and retain a relic of the "quantumness" present in the lossless system. Finally, in the last part of this dissertation, we study the complexity of simulating a class of equilibrium states, namely ground states. We give complexity-theoretic evidence to identify two structural properties that can make ground states easier to simulate. These are the existence of a spectral gap and the existence of a classical description of the ground state. Our findings complement and guide efforts in the search for efficient algorithms.
This dissertation investigates the theory of quantum stochastic processes and its applications in quantum many-body physics. The main goal is to analyse complexity-theoretic aspects of both static and dynamic properties of physical systems modelled by quantum stochastic processes. The thesis consists of two parts: the first one addresses the computational complexity of certain quantum and classical divisibility questions, whereas the second one addresses the topic of Hamiltonian complexity theory. In the divisibility part, we discuss the question whether one can efficiently sub-divide a map describing the evolution of a system in a noisy environment, i.e. a CPTP- or stochastic map for quantum and classical processes, respectively, and we prove that taking the nth root of a CPTP or stochastic map is an NP-complete problem. Furthermore, we show that answering the question whether one can divide up a random variable X into a sum of n iid random variables Yi, i.e. X=∑i=1nYi, is poly-time computable; relaxing the iid condition renders the problem NP-hard. In the local Hamiltonian part, we study computation embedded into the ground state of a many-body quantum system, going beyond "history state" constructions with a linear clock. We first develop a series of mathematical techniques which allow us to study the energy spectrum of the resulting Hamiltonian, and extend classical string rewriting to the quantum setting. This allows us to construct the most physically-realistic QMAEXP-complete instances for the LOCAL HAMILTONIAN problem (i.e. the question of estimating the ground state energy of a quantum many-body system) known to date, both in one- and three dimensions. Furthermore, we study weighted versions of linear history state constructions, allowing us to obtain tight lower and upper bounds on the promise gap of the LOCAL HAMILTONIAN problem in various cases. We finally study a classical embedding of a Busy Beaver Turing Machine into a low-dimensional lattice spin model, which allows us to dictate a transition from a purely classical phase to a Toric Code phase at arbitrarily large and potentially even uncomputable system sizes.