Biomedical subjects

Hans J Briegel

Publications and source records attributed to Hans J Briegel.

6 recordsLinked to original sources

PubMed2006

Universal resources for measurement-based quantum computation.

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 measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal nongraph state.

Journal Article↗

PubMed2005

Distillation of multipartite entanglement by complementary stabilizer measurements.

We propose a scheme of multipartite entanglement distillation driven by a complementary pair of stabilizer measurements to distill directly a wider range of states beyond the stabilizer code states (such as the Greenberger-Horne-Zeilinger states). We make our idea explicit by constructing a recurrence protocol for the 3-qubit state [formula: see text]. Noisy states resulting from typical decoherence can be directly purified in a few steps, if their initial fidelity is larger than a threshold. For general input mixed states, we observe distillations to hierarchical fixed points, i.e., not only to the state but also to the 2-qubit Bell pair, depending on their initial entanglement.

Journal Article↗

PubMed2005

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.

Journal Article↗

PubMed2005

Bell inequalities for graph states.

We investigate the nonlocal properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state there is an inequality maximally violated only by that state. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positivity of the partial transpose or the geometric measure of entanglement.

Journal Article↗

PubMed2004

Experimental demonstration of five-photon entanglement and open-destination teleportation.

Quantum-mechanical entanglement of three or four particles has been achieved experimentally, and has been used to demonstrate the extreme contradiction between quantum mechanics and local realism. However, the realization of five-particle entanglement remains an experimental challenge. The ability to manipulate the entanglement of five or more particles is required for universal quantum error correction. Another key process in distributed quantum information processing, similar to encoding and decoding, is a teleportation protocol that we term 'open-destination' teleportation. An unknown quantum state of a single particle is teleported onto a superposition of N particles; at a later stage, this teleported state can be read out (for further applications) at any of the N particles, by a projection measurement on the remaining particles. Here we report a proof-of-principle demonstration of five-photon entanglement and open-destination teleportation (for N = 3). 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. Our experimental methods can be used for investigations of measurement-based quantum computation and multi-party quantum communication.

Journal Article↗

PubMed2002

Private entanglement over arbitrary distances, even using noisy apparatus.

We give a security proof of quantum cryptography based entirely on entanglement purification. Our proof applies to all possible attacks (individual and coherent). It implies the security of cryptographic keys distributed with the help of entanglement-based quantum repeaters. We prove the security of the obtained quantum channel which may not be used only for quantum key distribution, but also for secure, albeit noisy, transmission of quantum information.

Journal Article↗