Journal ArticleDOI
A one-way quantum computer.
Reads0
Chats0
TLDR
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.Abstract:
We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.read more
Citations
More filters
Journal ArticleDOI
Robustness and device independence of verifiable blind quantum computing
TL;DR: In this article, the authors prove the robustness of the single server verifiable universal blind quantum computing protocol in the most general scenario, including the case where the purification of the deviated input state is in the hands of an adversarial server.
Journal ArticleDOI
Hierarchies of geometric entanglement
TL;DR: Wei and Goldbart as mentioned in this paper introduced a class of generalized geometric measures of entanglement for pure quantum states of $\mathit{N}$ elementary subsystems, they are defined as the distances from the sets of $K-separable states $(K=2,\dots{},N) ).
Journal ArticleDOI
Quantum Information Processing in Optical Lattices and Magnetic Microtraps
Philipp Treutlein,Tilo Steinmetz,Yves Colombe,Benjamin Lev,Peter Hommelhoff,Jakob Reichel,Markus Greiner,Olaf Mandel,Arthur Widera,Tim Rom,Immanuel Bloch,Theodor W. Hänsch +11 more
TL;DR: In this paper, a spin-dependent lattice is used to split and delocalize the atomic wave functions in a controlled and coherent way over a defined number of lattice sites.
Book ChapterDOI
Composable Security of Delegated Quantum Computation
Vedran Dunjko,Joseph F. Fitzsimons,Joseph F. Fitzsimons,Christopher Portmann,Christopher Portmann,Renato Renner +5 more
TL;DR: In this paper, the authors define composable security for delegated quantum computation and distinguish between protocols which provide only blindness and those that are also verifiable, so that the client can check that it has received the correct result.
Journal ArticleDOI
Quantifying multipartite nonlocality
TL;DR: It is shown how upper bounds on m and lower bounds on k can be computed from the violation of the Mermin-Svetlichny inequalities, while n-partite Greenberger-Horne-Zeilinger states violate these inequalities maximally and it is found that W states violate them only by a very small amount.
References
More filters
Journal ArticleDOI
Elementary gates for quantum computation.
Adriano Barenco,Charles H. Bennett,Richard Cleve,David P. DiVincenzo,Norman Margolus,Peter W. Shor,Tycho Sleator,John A. Smolin,Harald Weinfurter +8 more
TL;DR: U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Journal ArticleDOI
Quantum information and computation
TL;DR: In information processing, as in physics, the classical world view provides an incomplete approximation to an underlying quantum reality that can be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.
Journal ArticleDOI
Good quantum error-correcting codes exist
A. R. Calderbank,Peter W. Shor +1 more
TL;DR: The techniques investigated in this paper can be extended so as to reduce the accuracy required for factorization of numbers large enough to be difficult on conventional computers appears to be closer to one part in billions.
Journal ArticleDOI
Error Correcting Codes in Quantum Theory.
TL;DR: It is shown that a pair of states which are, in a certain sense, “macroscopically different,” can form a superposition in which the interference phase between the two parts is measurable, providing a highly stabilized “Schrodinger cat” state.
Journal ArticleDOI
Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
TL;DR: It is shown that single quantum bit operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states are sufficient to construct a universal quantum computer.