arXiv subjects

H. -J. Briegel

Publications and source records attributed to H. -J. Briegel.

At least 19 recordsLinked to original sources

arXiv2007

Entanglement and its dynamics in open, dissipative systems

Quantum mechanical entanglement can exist in noisy open quantum systems at high temperature. A simple mechanism, where system particles are randomly reset to some standard initial state, can counteract the deteriorating effect of decoherence, resulting in an entangled steady state far from thermodynamical equilibrium. We present models for both gas-type systems and for strongly coupled systems. We point out in which way the entanglement resulting from such a reset mechanism is different from the entanglement that one can find in thermal states. We develop master equations to describe the system and its interaction with an environment, study toy models with two particles (qubits), where the master equation can often be solved analytically, and finally examine larger systems with possibly fluctuating particle numbers. We find that in gas-type systems, the reset mechanism can produce an entangled steady state for an arbitrary temperature of the environment, while this is not true in strongly coupled systems. But even then, the temperature range where one can find entangled steady states is typically much higher with the reset mechanism.

quant-ph↗

arXiv2006

On the role of memory errors in quantum repeaters

We investigate the influence of memory errors in the quantum repeater scheme for long-range quantum communication. We show that the communication distance is limited in standard operation mode due to memory errors resulting from unavoidable waiting times for classical signals. We show how to overcome these limitations by (i) improving local memory, and (ii) introducing two new operational modes of the quantum repeater. In both operational modes, the repeater is run blindly, i.e. without waiting for classical signals to arrive. In the first scheme, entanglement purification protocols based on one-way classical communication are used allowing to communicate over arbitrary distances. However, the error thresholds for noise in local control operations are very stringent. The second scheme makes use of entanglement purification protocols with two-way classical communication and inherits the favorable error thresholds of the repeater run in standard mode. One can increase the possible communication distance by an order of magnitude with reasonable overhead in physical resources. We outline the architecture of a quantum repeater that can possibly ensure intercontinental quantum communication.

quant-ph↗

arXiv2006

Ground state approximation for strongly interacting systems in arbitrary dimension

We introduce a variational method for the approximation of ground states of strongly interacting spin systems in arbitrary geometries and spatial dimensions. The approach is based on weighted graph states and superpositions thereof. These states allow for the efficient computation of all local observables (e.g. energy) and include states with diverging correlation length and unbounded multi-particle entanglement. As a demonstration we apply our approach to the Ising model on 1D, 2D and 3D square-lattices. We also present generalizations to higher spins and continuous-variable systems, which allows for the investigation of lattice field theories.

quant-ph↗

arXiv2006

Entanglement in Graph States and its Applications

Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a variety of applications in quantum information theory, most prominently as algorithmic resources in the context of the one-way quantum computer, but also in other fields such as quantum error correction and multi-partite quantum communication, as well as in the study of foundational issues such as non-locality and decoherence. In this review, we give a tutorial introduction into the theory of graph states. We introduce various equivalent ways how to define graph states, and discuss the basic notions and properties of these states. The focus of this review is on their entanglement properties. These include aspects of non-locality, bi-partite and multi-partite entanglement and its classification in terms of the Schmidt measure, the distillability properties of mixed entangled states close to a pure graph state, as well as the robustness of their entanglement under decoherence. We review some of the known applications of graph states, as well as proposals for their experimental implementation.

quant-ph↗

arXiv2005

Steady state entanglement in open and noisy quantum systems at high temperature

We show that quantum mechanical entanglement can prevail even in noisy open quantum systems at high temperature and far from thermodynamical equilibrium, despite the deteriorating effect of decoherence. The system consists of a number N of interacting quantum particles, and it can interact and exchange particles with some environment. The effect of decoherence is counteracted by a simple mechanism, where system particles are randomly reset to some standard initial state, e.g. by replacing them with particles from the environment. We present a master equation that describes this process, which we can solve analytically for small N. If we vary the interaction strength and the reset against decoherence rate, we find a threshold below which the equilibrium state is classically correlated, and above which there is a parameter region with genuine entanglement.

quant-ph↗

arXiv2005

Standard forms of noisy quantum operations via depolarization

We consider noisy, non-local unitary operations or interactions, i.e. the corresponding evolutions are described by completely positive maps or master equations of Lindblad form. We show that by random local operations the completely positive maps can be depolarized to a standard form with a reduced number of parameters describing the noise process in such a way that the noiseless (unitary) part of the evolution is not altered. A further reduction of the parameters, in many cases even to a single one (i.e. global white noise), is possible by tailoring the decoherence process and increasing the amount of noise. We generalize these results to the dynamical case where the ideal unitary operation is given by some interaction Hamiltonian. The resulting standard forms may be used to compute lower bounds on channel capacities, to simplify quantum process tomography or to derive error thresholds for entanglement purification and quantum computation.

quant-ph↗

arXiv2005

Multipartite secure state distribution

We introduce the distribution of a secret multipartite entangled state in a real-world scenario as a quantum primitive. We show that in the presence of noisy quantum channels (and noisy control operations) any state chosen from the set of two-colorable graph states (CSS codewords) can be created with high fidelity while it remains unknown to all parties. This is accomplished by either blind multipartite entanglement purification, which we introduce in this paper, or by multipartite entanglement purification of enlarged states, which offers advantages over an alternative scheme based on standard channel purification and teleportation. The parties are thus provided with a secret resource of their choice for distributed secure applications.

quant-ph↗

arXiv2005

Entanglement and decoherence in spin gases

We study the dynamics of entanglement in spin gases. A spin gas consists of a (large) number of interacting particles whose random motion is described classically while their internal degrees of freedom are described quantum-mechanically. We determine the entanglement that occurs naturally in such systems for specific types of quantum interactions. At the same time, these systems provide microscopic models for non--Markovian decoherence: the interaction of a group of particles with other particles belonging to a background gas are treated exactly, and differences between collective and non--collective decoherence processes are studied. We give quantitative results for the Boltzmann gas and also for a lattice gas, which could be realized by neutral atoms hopping in an optical lattice. These models can be simulated efficiently for systems of mesoscopic sizes (N ~ 10^5).

quant-ph↗

arXiv2005

Multiparticle entanglement purification for two-colorable graph states

We investigate multiparticle entanglement purification schemes which allow one to purify all two colorable graph states, a class of states which includes e.g. cluster states, GHZ states and codewords of various error correction codes. The schemes include both recurrence protocols and hashing protocols. We analyze these schemes under realistic conditions and observe for a generic error model that the threshold value for imperfect local operations depends on the structure of the corresponding interaction graph, but is otherwise independent of the number of parties. The qualitative behavior can be understood from an analytically solvable model which deals only with a restricted class of errors. We compare direct multiparticle entanglement purification protocols with schemes based on bipartite entanglement purification and show that the direct multiparticle entanglement purification is more efficient and the achievable fidelity of the purified states is larger. We also show that the purification protocol allows one to produce private entanglement, an important aspect when using the produced entangled states for secure applications. Finally we discuss an experimental realization of a multiparty purification protocol in optical lattices which is issued to improve the fidelity of cluster states created in such systems.

quant-ph↗

arXiv2004

Entanglement properties of multipartite entangled states under the influence of decoherence

We investigate entanglement properties of multipartite states under the influence of decoherence. We show that the lifetime of (distillable) entanglement for GHZ-type superposition states decreases with the size of the system, while for a class of other states -namely all graph states with constant degree- the lifetime is independent of the system size. We show that these results are largely independent of the specific decoherence model and are in particular valid for all models which deal with individual couplings of particles to independent environments, described by some quantum optical master equation of Lindblad form. For GHZ states, we derive analytic expressions for the lifetime of distillable entanglement and determine when the state becomes fully separable. For all graph states, we derive lower and upper bounds on the lifetime of entanglement. To this aim, we establish a method to calculate the spectrum of the partial transposition for all mixed states which are diagonal in a graph state basis. We also consider entanglement between different groups of particles and determine the corresponding lifetimes as well as the change of the kind of entanglement with time. This enables us to investigate the behavior of entanglement under re-scaling and in the limit of large (infinite) number of particles. Finally we investigate the lifetime of encoded quantum superposition states and show that one can define an effective time in the encoded system which can be orders of magnitude smaller than the physical time. This provides an alternative view on quantum error correction and examples of states whose lifetime of entanglement (between groups of particles) in fact increases with the size of the system.

quant-ph↗

arXiv2003

Multiparticle entanglement purification for graph states

We introduce a class of multiparticle entanglement purification protocols that allow us to distill a large class of entangled states. These include cluster states, GHZ states and various error correction codes all of which belong to the class of two-colorable graph states. We analyze these schemes under realistic conditions and observe that they are scalable, i.e. the threshold value for imperfect local operations does not depend on the number of parties for many of these states. When compared to schemes based on bipartite entanglement purification, the protocol is more efficient and the achievable quality of the purified states is larger. As an application we discuss an experimental realization of the protocol in optical lattices which allows one to purify cluster states.

quant-ph↗

arXiv2003

Stability of macroscopic entanglement under decoherence

We investigate the lifetime of macroscopic entanglement under the influence of decoherence. For GHZ-type superposition states we find that the lifetime decreases with the size of the system (i.e. the number of independent degrees of freedom) and the effective number of subsystems that remain entangled decreases with time. For a class of other states (e.g. cluster states), however, we show that the lifetime of entanglement is independent of the size of the system.

quant-ph↗

arXiv2003

Entanglement purification for Quantum Computation

We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit and additional auxiliary dimensions are used to create and purify entanglement between systems. Physical, possibly probabilistic two-system operations with error rates up to 2/3 are still tolerable to realize deterministic high quality two-qubit gates on the logical qubits. The achievable error rate is of the same order of magnitude as of the single-system operations. We investigate possible implementations of our scheme for several physical set-ups.

quant-ph↗

arXiv2002

Quantum random walks in optical lattices

We propose an experimental realization of discrete quantum random walks using neutral atoms trapped in optical lattices. The random walk is taking place in position space and experimental implementation with present day technology --even using existing set-ups-- seems feasible. We analyze the influence of possible imperfections in the experiment and investigate the transition from a quantum random walk to the classical random walk for increasing errors and decoherence.

quant-ph↗

arXiv2001

The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement

We present a measure of quantum entanglement which is capable of quantifying the degree of entanglement of a multi-partite quantum system. This measure, which is based on a generalization of the Schmidt rank of a pure state, is defined on the full state space and is shown to be an entanglement monotone, that is, it cannot increase under local quantum operations with classical communication and under mixing. For a large class of mixed states this measure of entanglement can be calculated exactly, and it provides a detailed classification of mixed states.

quant-ph↗

arXiv1999

Quantum computing with neutral atoms

We develop a method to entangle neutral atoms using cold controlled collisions. We analyze this method in two particular set-ups: optical lattices and magnetic micro-traps. Both offer the possibility of performing certain multi-particle operations in parallel. Using this fact, we show how to implement efficient quantum error correction and schemes for fault-tolerant computing.

quant-ph↗

arXiv1998

Entanglement of atoms via cold controlled collisions

We show that by using cold controlled collisions between two atoms one can achieve conditional dynamics in moving trap potentials. We discuss implementing two qubit quantum--gates and efficient creation of highly entangled states of many atoms in optical lattices.

quant-ph↗

arXiv1998

Quantum repeaters for communication

In quantum communication via noisy channels, the error probability scales exponentially with the length of the channel. We present a scheme of a quantum repeater that overcomes this limitation. The central idea is to connect a string of (imperfect) entangled pairs of particles by using a novel nested purification protocol, thereby creating a single distant pair of high fidelity. The scheme tolerates general errors on the percent level.

quant-ph↗