In this thesis, we focus on the questions of how quantum entanglement can be generated between two or more spatially separated systems and, once generated, how it can be applied in quantum technology. First we will discuss a protocol, which we conjecture to be optimal in some regimes, that quickly creates entangled states across long distances in systems with power-law interactions. We will discuss how this protocol compares with currently known bounds on entangled state generation and how it might be implemented in a three-dimensional lattice of Rydberg atoms. Next, we will turn our attention to more general questions of how the Lieb-Robinson bound and other limitations on entanglement can be used to inform the design of quantum computers. Quantum computers will be required to create entanglement if they are to realize significant advantages over classical computers, meaning that the generation of entanglement is an important question. First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions for architectures, such as maximum graph degree and total number of necessary connections. We will present a proposed graph architecture, the hierarchical product, which we believe provides excellent balance between these considerations. We will then introduce new methods of evaluating graphs that allow us to include quantum architectures capable of measurement and feedback operations. After doing so, we will show that the generation of entanglement entropy becomes a limit on computation. We will show that, for several possible physical models of computation, the generation of entanglement can be bounded by simple graph properties. We demonstrate a connection between worst-case scenarios for entanglement generation and a graph quantity called the Cheeger constant or isoperimetric number, which we evaluate for several proposed quantum computing architectures. Finally, we will look at the scenario of quantum sensing. In particular, we will examine protocols for quantum function estimation, where quantum sensors are available to measure all of the inputs to the function. We will demonstrate that entangled sensors are more capable than non-entangled ones by first deriving a new lower bound on measurement error and then presenting protocols that saturate these bounds. We will first do so for linear functions of the measured quantities and then extend this to general functions using a two-step linearizing protocol.
In this thesis, we focus on the questions of how quantum entanglement can be generated between two or more spatially separated systems and, once generated, how it can be applied in quantum technology. First we will discuss a protocol, which we conjecture to be optimal in some regimes, that quickly creates entangled states across long distances in systems with power-law interactions. We will discuss how this protocol compares with currently known bounds on entangled state generation and how it might be implemented in a three-dimensional lattice of Rydberg atoms. Next, we will turn our attention to more general questions of how the Lieb-Robinson bound and other limitations on entanglement can be used to inform the design of quantum computers. Quantum computers will be required to create entanglement if they are to realize significant advantages over classical computers, meaning that the generation of entanglement is an important question. First, we will discuss the implications of the Lieb-Robinson bound on graph descriptions of quantum computer architectures, and how the relevant graph parameter (diameter) compares to likely cost functions for architectures, such as maximum graph degree and total number of necessary connections. We will present a proposed graph architecture, the hierarchical product, which we believe provides excellent balance between these considerations. We will then introduce new methods of evaluating graphs that allow us to include quantum architectures capable of measurement and feedback operations. After doing so, we will show that the generation of entanglement entropy becomes a limit on computation. We will show that, for several possible physical models of computation, the generation of entanglement can be bounded by simple graph properties. We demonstrate a connection between worst-case scenarios for entanglement generation and a graph quantity called the Cheeger constant or isoperimetric number, which we evaluate for several proposed quantum computing architectures. Finally, we will look at the scenario of quantum sensing. In particular, we will examine protocols for quantum function estimation, where quantum sensors are available to measure all of the inputs to the function. We will demonstrate that entangled sensors are more capable than non-entangled ones by first deriving a new lower bound on measurement error and then presenting protocols that saturate these bounds. We will first do so for linear functions of the measured quantities and then extend this to general functions using a two-step linearizing protocol.
This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .
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 . . . . . . . . .
Quantum sensor networks promise precision advantages over classical and single-sensor strategies, in particular when the estimator is non-local. We address the problem of finding such estimators through a framework we connote spatial quantum sensing: given an underlying field interrogated by a network of quantum sensors at fixed positions, construct an estimator for a property of the field, for example, distinguishing a source of signal, or evaluating the field or its derivatives at an arbitrary point. We first treat polynomial fields, casting the task as an interpolation problem, and then generalize to fields modeled by analytic functions, which yields general least-squares estimators. A central and largely unaddressed question is under what conditions on sensor placement these estimators are well-defined and error-free. For m-dimensional arrays we give explicit constructions and proofs in the interpolation setting using algebraic geometry, and establish necessary and sufficient conditions in the general case. Comparing a non-local entangled protocol with the best local strategy, we show that entanglement yields maximal precision in distributed sensing under global resource constraints. Finally, we introduce error-free subspaces, a technique that translates prior knowledge of the field into a reduction in the number of required sensors. We expect these techniques to be broadly useful in sensing problems across scales, ranging from earth-scale experiments to local applications such as biological imaging.
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 explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many areas of theoretical quantum information science, including quantum error correction, quantum cryptography, and quantum algorithms. We first investigate the equivalence classes of a particular class of entangled states (known as graph states due to their association with mathematical graphs) under local operations. We prove that for graph states corresponding to graphs with neither cycles of length 3 nor 4, the equivalence classes can be characterized in a very simple way. We also present software for analyzing and manipulating graph states. We then study quantum error-correcting codes whose codewords are highly entangled states. An important area of investigation concerning QECCs is to determine which resources are necessary in order to carry out any computation on the code to an arbitrary degree of accuracy, while simultaneously maintaining a high degree of resistance to noise. We prove that transversal gates, which are designed to prevent the propagation of errors through a system, are insufficient to achieve universal computation on almost all QECCs. Finally, we study the problem of creating efficient quantum circuits for creating entangling measurements. Entangling measurements can be used to harness the apparent extra computing power of quantum systems by allowing us to extract information about the global, collective properties of a quantum state using local measurements. We construct explicit quantum circuits that create entangling measurements, and show that these circuits scale polynomially in the input parameters.
The main focus of this thesis is quantum entanglement and, more specifically, pro- tocols that allow its distribution between distant places. In the last decades, with the rise of attention on quantum technologies, entangle- ment is mostly seen as a resource, that could be exchanged, measured, and ideally stored and used when convenient. However, entanglement is not as stable and cheap as the classical resources. One reason for this is that entanglement between two quantum systems is easily disrupted by the interaction with the environment that surrounds them. The presence of noise is even more significant when we wish to entangle two systems that are very far away, a task that is essential for quantum communication technologies. In this case, what can disrupt the entanglement is not only the noise that the particles experience locally, but also the noise in the quantum channel during the communication process, which can be significant over long distances. For this reason, it is important to design distribution protocols that work well in such conditions. In 2003, Cubitt et al. showed the existence of a very curious class of protocols, often called entanglement distribution with separable states (EDSS). They proved that a non-entangled (separable) carrier can be used to increase, or even gener- ate entanglement between two already distant parties. From this, some questions arise. First, what limits or allows an entanglement distribution protocol, if not the entanglement that is sent. Quantum discord was shown to be a necessary, but not sufficient, resource for entanglement distribution. Another natural question is whether these protocols can beat others, for technological purposes, especially in noisy conditions. I will describe some work I have done in an attempt to partially 9 address both of these questions. After introducing various tools and concepts that are useful to understand this topic (chapter 1) and motivate the necessity of entanglement distribution in quantum communication (chapter 2), I will describe a proof-of-principle experiment demon- strating EDSS schemes (chapter 3). Later (chapter 4), I will introduce a more general classification of distribution protocols (excessive or non-excessive protocols), based on whether the entanglement gain is larger than the one that is communicated, describing specific examples and general properties of such protocols. I will then partially address the problem regarding the robustness to the noise of communica- tion protocols (chapter 5). Finally, in chapter 6, I will describe how entanglement of a bipartite state can grow with a quantum measurement with unknown results. I discuss the properties of the measurement and of the initial state that make this process effective.