Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLinks and Quantum Entanglement
162
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We discuss the analogy between topological entanglement and quantum entanglement, particularly for tripartite quantum systems. We illustrate our approach by first discussing two clearly (topologically) inequivalent systems of three-ring links: The Borromean rings, in which the removal of any one link leaves the remaining two non-linked (or, by analogy, non-entangled); and an inequivalent system (which we call the NUS link) for which the removal of any one link leaves the remaining two linked (or, entangled in our analogy). We introduce unitary representations for the appropriate Braid Group ($B_3$) which produce the related quantum entangled systems. We finally remark that these two quantum systems, which clearly possess inequivalent entanglement properties, are locally unitarily equivalent.
rate research
Read More
Important developments in fault-tolerant quantum computation using the braiding of anyons have placed the theory of braid groups at the very foundation of topological quantum computing. Furthermore, the realization by Kauffman and Lomonaco that a specific braiding operator from the solution of the Yang-Baxter equation, namely the Bell matrix, is universal implies that in principle all quantum gates can be constructed from braiding operators together with single qubit gates. In this paper we present a new class of braiding operators from the Temperley-Lieb algebra that generalizes the Bell matrix to multi-qubit systems, thus unifying the Hadamard and Bell matrices within the same framework. Unlike previous braiding operators, these new operators generate {it directly}, from separable basis states, important entangled states such as the generalized Greenberger-Horne-Zeilinger states, cluster-like states, and other states with varying degrees of entanglement.
We construct a linear system non-local game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy. In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed non-local game provides another counterexample to the middle Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.
Distribution and distillation of entanglement over quantum networks is a basic task for Quantum Internet applications. A fundamental question is then to determine the ultimate performance of entanglement distribution over a given network. Although this question has been extensively explored for bipartite entanglement-distribution scenarios, less is known about multipartite entanglement distribution. Here we establish the fundamental limit of distributing multipartite entanglement, in the form of GHZ states, over a quantum network. In particular, we determine the multipartite entanglement distribution capacity of a quantum network, in which the nodes are connected through lossy bosonic quantum channels. This setting corresponds to a practical quantum network consisting of optical links. The result is also applicable to the distribution of multipartite secret key, known as common key, for both a fully quantum network and trusted-node based quantum key distribution network. Our results set a general benchmark for designing a network topology and network quantum repeaters (or key relay in trusted nodes) to realize efficient GHZ state/common key distribution in both fully quantum and trusted-node-based networks. We show an example of how to overcome this limit by introducing a network quantum repeater. Our result follows from an upper bound on distillable GHZ entanglement introduced here, called the recursive-cut-and-merge bound, which constitutes major progress on a longstanding fundamental problem in multipartite entanglement theory. This bound allows for determining the distillable GHZ entanglement for a class of states consisting of products of bipartite pure states.
A rigorous proof is presented of the boundedness of the entanglement entropy of a block of spins for the ground state of the one-dimensional quantum Ising model with sufficiently strong transverse field. This is proved by a refinement of the arguments in the earlier work by the same authors (J. Statist. Phys. 131 (2008) 305-339). The proof is geometrical, and utilises a transformation to a model of classical probability called the continuum random-cluster model. Our method of proof is fairly robust, and applies also to certain disordered systems.
We consider a non-interacting bipartite quantum system $mathcal H_S^Aotimesmathcal H_S^B$ undergoing repeated quantum interactions with an environment modeled by a chain of independant quantum systems interacting one after the other with the bipartite system. The interactions are made so that the pieces of environment interact first with $mathcal H_S^A$ and then with $mathcal H_S^B$. Even though the bipartite systems are not interacting, the interactions with the environment create an entanglement. We show that, in the limit of short interaction times, the environment creates an effective interaction Hamiltonian between the two systems. This interaction Hamiltonian is explicitly computed and we show that it keeps track of the order of the successive interactions with $mathcal H_S^A$ and $mathcal H_S^B$. Particular physical models are studied, where the evolution of the entanglement can be explicitly computed. We also show the property of return of equilibrium and thermalization for a family of examples.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
