2020/11/03 by Yunheung Song, Minhyuk Kim, Hansub Hwang +2
Computer Science · Mathematics · Physics and Astronomy · #Antiferromagnetism #Combinatorics #Computer science #Condensed matter physics #Hamiltonian (control theory) #Ising model #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum annealing #Quantum computer #Quantum many-body systems #Quantum mechanics #Quantum simulator #Qubit #Rydberg atom #Rydberg formula #Spins #physics.atom-ph #quant-ph
paper · pdf · doi:10.1103/physrevresearch.3.013286
published as Phys. Rev. Research 3, 013286 (2021) · 7 pages,5 figures
openalex publication_date 2020/11/03 · arxiv created 2021/02/19 · arxiv updated 2021/04/07 · openalex created_date 2021/04/13 · openalex updated_date 2026/08/05
Significant efforts are being directed towards developing a quantum annealer capable of solving combinatorial optimization problems. The challenges are Hamiltonian programming and large-scale implementations. Here we report quantum annealing demonstration of Ising Hamiltonians programmed with up to N=22 spins mapped on various Cayley tree graphs. Experiments are performed with a Rydberg-atom quantum simulator, in which rubidium single atoms are arranged in three dimensional space in such a way that their Rydberg atoms and blockaded strong couplings respectively represent the nodes and edges of each graph. Three different Cayley-tree graphs of Z=3 neighbors and of up to S=4 shells are constructed, and their ground-state phases and N'eel's order formations are probed. In good agreement with model calculations, the anti-ferromagnetic phase in regular Cayley trees and frustrated competing ground-states in a dual-center Cayley tree are directly observed. This demonstrates the possibilities of high-dimensional qubit connection programming in quantum simulators.