Share This Author
A one-way quantum computer.
A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program.
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
This work presents a scheme of a quantum repeater that connects a string of (imperfect) entangled pairs of particles by using a novel nested purification protocol, thereby creating a single distant pair of high fidelity.
Multiparty entanglement in graph states
This work characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which it provides upper and lower bounds in graph theoretical terms.
Measurement-based quantum computation on cluster states
We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster…
Entanglement in Graph States and its Applications
- M. Hein, W. Dur, J. Eisert, R. Raussendorf, M. V. D. Nest, H. Briegel
- Computer Science, Physics
- 11 February 2006
This review gives a tutorial introduction into the theory of graph states, and discusses the basic notions and properties of these states, including aspects of non-locality, bi-partite and multi- partite entanglement and its classification in terms of the Schmidt measure.
Quantum repeaters based on entanglement purification
A scheme is presented that allows entanglement purification over arbitrary long channels and tolerates errors on the percent level and requires a polynomial overhead in time, and an overhead in local resources that grows only logarithmically with the length of the channel.
Persistent entanglement in arrays of interacting particles.
These states can be regarded as an entanglement resource since one can generate a family of other multiparticle entangled states such as the generalized Greenberger-Horne-Zeilinger states of <N/2 qubits by simple measurements and classical communication.
Measurement-based quantum computation
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation…
Fast simulation of stabilizer circuits using a graph-state representation
An algorithm for this task, which is based on the graph-state formalism, shows significant improvement in comparison to an existing algorithm, given by Gottesman and Aaronson, in terms of speed and of the number of qubits the simulator can handle.
Projective simulation for artificial intelligence
A model of a learning agent whose interaction with the environment is governed by a simulation-based projection, which allows the agent to project itself into future situations before it takes real action, which provides a natural route for generalization to quantum-mechanical operation and connects the fields of reinforcement learning and quantum computation.