Prof Vlatko Vedral FInstP

Abstract:

Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the requirements for quantum computation and more generally how we think about quantum physics. This new model requires qubits to be initialized in a highly entangled cluster state. From this point, the quantum computation proceeds by a sequence of single-qubit measurements with classical feedforward of their outcomes. Because of the essential role of measurement, a one-way quantum computer is irreversible. In the one-way quantum computer, the order and choices of measurements determine the algorithm computed. We have experimentally realized four-qubit cluster states encoded into the polarization state of four photons. We characterize the quantum state fully by implementing experimental four-qubit quantum state tomography. Using this cluster state, we demonstrate the feasibility of one-way quantum computing through a universal set of one- and two-qubit operations. Finally, our implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.

Abstract:

Entanglement distance is the maximal separation between two entangled electrons in a degenerate electron gas. Beyond that distance, all entanglement disappears. We relate entanglement distance to degeneracy pressure both for extreme relativistic and nonrelativistic systems, and estimate the entanglement distance in a white dwarf. Treating entanglement as a thermodynamical quantity, we relate the entropy of formation and concurrence to relative electron distance, pressure, and temperature, to form an equation of state for entanglement. © 2005 The American Physical Society.