Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/9810147 · The European Physical Journal B

Quantum spin- models on the Cayley tree - optimum ground state approach

H. Niggemann, J. Zittartz

Published Aug 1, 1999• 4 citations
arXivHTMLPDF
DOI
10.1007/s100510050904

Related papers

Quantum Markov states on Cayley trees

Farrukh Maksutovich Mukhamedov, Abdessatar Souissi

arXiv:1902.04156•Journal of Mathematical Analysis and Applications•Dec 20, 2018•23 citations

On Quantum Markov Chains on Cayley Tree III: Ising Model

Luigi Accardi, Farrukh Maksutovich Mukhamedov, Mansoor Khajibaevich Saburov

arXiv:1311.6545•Journal of Statistical Physics•Aug 6, 2014•23 citations

Mixed quantum Ising–XY model on a Cayley tree of order two

Ali AlAali, Farrukh Maksutovich Mukhamedov

The European Physical Journal B•Apr 1, 2025•2 citations

The Heisenberg model on the Cayley tree

Tohru Ogawa

Springer eBooks•Oct 29, 2005•1 citation

Optimum ground states for spin-3/2 chains

H. Niggemann, J. Zittartz

arXiv:cond-mat/9602080•Zeitschrift für Physik B Condensed Matter•Mar 1, 1996•30 citations

Quantum annealing of Cayley-tree Ising spins at small scales

Yunheung Song, Minhyuk Kim, Hansub Hwang +2 more

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\'{e}el'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.

arXiv:2011.01653•Nov 3, 2020•34 citations
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=22N=22N=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=3Z=3Z=3 neighbors and of up to S=4S=4S=4 shells are constructed, and their ground-state phases and N\'{e}el'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.