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.
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.
This thesis is an attempt to apply the tools and techniques developed by quantum information science to gain Insight into strongly-interacting many-body quantum systems. The principle concept we make use of to do this is quantum entanglement. The thesis is divided into two parts. Part I is about quantum entanglement. The second part applies the techniques developed to understand quantum entanglement to complex quantum systems. In Part I we explore the rules governing the manipulation of quantum information. More specifically, we take as our premise the idea that quantum entanglement is the quantity responsible for the difference between classical and quantum information. We discuss the basic principles governing entanglement manipulation, focusing on the problem of quantifying quantum entanglement for quantum states. We prove that the probability that a certain class of quantum algorithms succeeds is an entanglement monotone for the initial state of the register used by these algorithms. We provide an easily-computable formula for a good mixed-state bipartite entanglement measure. We then use this formula to investigate a possible law of entanglement, namely, entanglement cannot be shared arbitrarily. In Part II we focus on using the concepts and tools of quantum information science to study complex quantum systems. The principal tool we use to do this is quantum entanglement. We begin with a definition of what we mean by a complex quantum system. This is followed with a study of the quantum entanglement present in a variety of complex quantum systems. We argue that quantum entanglement constitutes a signature of complex quantum behaviour. We conclude this thesis with a discussion of a well-known technique to understand complex quantum systems, namely, the density matrix renormalization group. We show that the success of this method is due to the way it treats the quantum entanglement present in a system.
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.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers. The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected. This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate. Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.
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.
Quantum information science has grown from being a very small subfield in the 70s until being one of the most dynamic fields in physics, both in fundamentals and applications. In the theoretical section, perhaps the feature that has attracted most interest is the notion of entanglement, the ghostly relation between particles that dazzled Einstein and has provided fabulous challenges to build a coherent interpretation of quantum mechanics. While not completely solved, we have today learned enough to feel less uneasy with this fundamental problem, and the focus has shifted towards its potential powerful applications. Entanglement is now being studied from different perspectives as a resource for performing information processing tasks.\n\n\t\t\t\t With bipartite entanglement being largely understood nowadays, many questions remain unanswered in the multipartite case. The first part of this thesis deals with multipartite entanglement in different contexts. In the first chapters it is studied within the whole corresponding Hilbert space, and we investigate several entanglement measures searching for states that maximize them, including violations of Bell inequalities. Later, focus is shifted towards hamiltonians that have entangled ground states, and we investigate entanglement as a way to establish a distance between theories and we study frustration and methods to efficiently solve hamiltonians that exhibit it.\n\n\t\t\t\t In the practical section, the most promised upcoming technological advance is the advent of quantum computers. In the 90s some quantum algorithms improving the performance of all known classical algorithms for certain problems started to appear, while in the 2000s the first universal computers of few atoms began to be built, allowing implementation of those algorithms in small scales. The D-Wave machine already performs quantum annealing in thousands of qubits, although some controversy over the true quantumness of its internal workings surrounds it. Many countries in the planet are devoting large amounts of money to this field, with the recent European flagship and the involvement of the largest US technological companies giving reasons for optimism.\n\n\t\t\t\t The second part of this thesis deals with some aspects of quantum computation, starting with the creation of the field of cloud quantum computation with the appearance of the first computer available to the general public through internet, which we have used and analysed extensively. Also small incursions in quantum adiabatic computation and quantum thermodynamics are present in this second part.
Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here we show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms or to prove limitations on the power of quantum computers.