SearcharxivSearch

arXiv subjects

Hans Briegel

Publications and source records attributed to Hans Briegel.

4 recordsLinked to original sources

Epsilon-measures of entanglement

We associate to every entanglement measure a family of measures which depend on a precision parameter, and which we call epsilon-measures of entanglement. Their definition aims at addressing a realistic scenario in which we need to estimate the amount of entanglement in a state that is only partially known. We show that many properties of the original measure are inherited by the family, in particular weak monotonicity under transformations applied by means of Local Operations and Classical Communication (LOCC). On the other hand, they may increase on average under stochastic LOCC. Remarkably, the epsilon-version of a convex entanglement measure is continuous even if the original entanglement measure is not, so that the epsilon-version of an entanglement measure may be actually considered a smoothed version of it.

quant-ph

Algorithmic complexity and entanglement of quantum states

We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its algorithmic complexity.

quant-ph

Experimental Demonstration of Five-photon Entanglement and Open-destination Teleportation

Universal quantum error-correction requires the ability of manipulating entanglement of five or more particles. Although entanglement of three or four particles has been experimentally demonstrated and used to obtain the extreme contradiction between quantum mechanics and local realism, the realization of five-particle entanglement remains an experimental challenge. Meanwhile, a crucial experimental challenge in multi-party quantum communication and computation is the so-called open-destination teleportation. During open-destination teleportation, an unknown quantum state of a single particle is first teleported onto a N-particle coherent superposition to perform distributed quantum information processing. At a later stage this teleported state can be readout at any of the N particles for further applications by performing a projection measurement on the remaining N-1 particles. Here, we report a proof-of-principle demonstration of five-photon entanglement and open-destination teleportation. In the experiment, we use two entangled photon pairs to generate a four-photon entangled state, which is then combined with a single photon state to achieve the experimental goals. The methods developed in our experiment would have various applications e.g. in quantum secret sharing and measurement-based quantum computation.

quant-ph

Computational model underlying the one-way quantum computer

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.

quant-ph