#### Filter Results:

- Full text PDF available (23)

#### Publication Year

1978

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Invertible local transformations of a multipartite system are used to define equivalence classes in the set of entangled states. This classification concerns the entanglement properties of a single copy of the state. Accordingly, we say that two states have the same kind of entanglement if both of them can be obtained from the other by means of local… (More)

The generation, manipulation and fundamental understanding of entanglement lies at the very heart of quantum mechanics. Entangled particles are non-interacting but are described by a common wavefunction; consequently, individual particles are not independent of each other and their quantum properties are inextricably interwoven. The intriguing features of… (More)

- W. Dür
- 2008

We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and… (More)

In this article, we build a framework allowing for a systematic investigation of the fundamental issue: " Which quantum states serve as universal resources for measurement-based (one-way) quantum computation? " We start our study by reexamining what is exactly meant by " universality " in quantum computation, and what the implications are for universal… (More)

We quantify the capability of creating entanglement for a general physical interaction acting on two qubits. We give a procedure for optimizing the generation of entanglement. We also show that a Hamiltonian can create more entanglement if one uses auxiliary systems.

We study when a nonlocal unitary operation acting on two d-level systems can probabilistically simulate another one when arbitrary local operations and classical communication are allowed. We provide necessary and sufficient conditions for the simulation to be possible. Probabilistic interconvertability is used to define an equivalence relation between… (More)

- W Dür, P Sekatski, M Skotiniotis
- Physical review letters
- 2015

We show that one can deterministically generate, out of N copies of an unknown unitary operation, up to N^{2} almost perfect copies. The result holds for all operations generated by a Hamiltonian with an unknown interaction strength. This generalizes a similar result in the context of phase-covariant cloning where, however, superreplication comes at the… (More)

- Enric Jané, Guifre Vidal, Wolfgang Dür, Peter Zoller, J. Ignacio Cirac
- Quantum Information & Computation
- 2003

We propose the use of quantum optical systems to perform universal simulation of quantum dynamics. Two specific implementations that require present technology are put forward for illustrative purposes. The first scheme consists of neutral atoms stored in optical lattices, while the second scheme consists of ions stored in an array of micro–traps. Each atom… (More)

- W Dür, H Aschauer, H-J Briegel
- Physical review letters
- 2003

We introduce a class of multiparticle entanglement purification protocols that allow us to distill a large class of entangled states. These include cluster states, Greenberger-Horne-Zeilinger 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… (More)

- Maarten Van den Nest, Akimasa Miyake, Wolfgang Dür, Hans J Briegel
- Physical review letters
- 2006

We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess the universality of graph states by introducing an entanglement… (More)