2k citations · 18.4k across the 171 of their papers we have counts for
7 papers · 2 filters
Algorithmic complexity of quantum states
C. Mora, H. J. Briegel
In this paper we give a definition for the Kolmogorov complexity of a pure quantum state. In classical information theory the algorithmic complexity of a string is a measure of the…
Multipartite secure state distribution
W. Dür, J. Calsamiglia, H. -J. Briegel
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…
Bell Inequalities for Graph States
Otfried Guehne, Geza Toth, Philipp Hyllus +1
We investigate the non-local properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maxima…
Entanglement properties of multipartite entangled states under the influence of decoherence
M. Hein, W. Dür, H. -J. Briegel
We investigate entanglement properties of multipartite states under the influence of decoherence. We show that the lifetime of (distillable) entanglement for GHZ-type superposition…
Entanglement in spin chains and lattices with long-range Ising-type interactions
W. Dür, L. Hartmann, M. Hein +2
We consider N initially disentangled spins, embedded in a ring or d-dimensional lattice of arbitrary geometry, which interact via some long--range Ising--type interaction. We inves…
Multiparticle entanglement purification for two-colorable graph states
H. Aschauer, W. Dür, H. -J. Briegel
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 s…