Ground state blind quantum computation on AKLT state
نویسندگان
چکیده
منابع مشابه
Ground state blind quantum computation on AKLT state
The blind quantum computing protocols (BQC) enable a classical client with limited quantum technology to delegate a computation to the quantum server(s) in such a way that the privacy of the computation is preserved. Here we present a new scheme for BQC that uses the concept of the measurement based quantum computing with the novel resource state of Affleck-Kennedy-LiebTasaki (AKLT) chains lead...
متن کاملQuantum ground-state computation with static gates
We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static in the sense that they contribute Hamiltonian 0 and hold as constants of the motion; only the wires are dynamic. Just as a spin 1/2 makes an ideal 1-bit memo...
متن کاملThe Spin-2 AKLT State on the Square Lattice is Universal for Measurement-based Quantum Computation
One-way quantum computation was first invented using the cluster state. Since then graph states, the generalization of the cluster state, were investigated and understood when they would enable such a measurement-based approach for quantum computation. Are there any other family of states, i.e., states with different entanglement structures, that can also serve as the universal resource for qua...
متن کاملThe 2D AKLT state is a universal quantum computational resource
Quantum computation promises exponential speedup over classical computation by exploiting the quantum mechanical nature of physical processes [1]. In addition to the standard circuit models, surprisingly, local measurement alone provides the same power of computation, given only a prior sufficiently entangled state [2]. Cluster states are the first known resource states for such measurement-bas...
متن کاملFinkelstein state computation with kinematical gates − Quantum ground
state computation with kinematical gates − Quantum ground Email alerting service here corner of the article or click Receive free email alerts when new articles cite this article-sign up in the box at the top right-hand We develop a computation model for solving Boolean networks that implements wires dynamically through quantum ground-state computation and implements gates kine-matically throug...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2015
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic15.3-4-2