2012/02/29 by Tetsufumi Tanamoto, Daniel Becker, Daniel G. Becker +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Cluster state #Coherence (philosophical gambling strategy) #Computation #Computer science #Eigenvalues and eigenvectors #Hamiltonian (control theory) #Ising model #Mathematical optimization #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum information #Quantum mechanics #Statistical physics #cond-mat.str-el #quant-ph
paper · pdf · doi:10.1103/physreva.86.032327
published as Phys. Rev. A 86, 032327 (2012) · 5 pages, 2 figures
openalex publication_date 2012/09/20 · arxiv created 2012/10/04 · arxiv updated 2013/12/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The common spin Hamiltonians such as the Ising, XY, and Heisenberg models do not have eigenstates that are suitable resources for measurement-based quantum computation. Various highly entangled many-body states have been suggested as a universal resource for this type of computation; however, it is not easy to preserve these states in solid-state systems due to their short coherence times. To solve this problem, we propose a scheme for generating a Hamiltonian that has a cluster state as a ground state. Our approach employs a series of pulse sequences inspired by established NMR techniques and holds promise for applications in many areas of quantum information processing.