Quantum annealing of Cayley-tree Ising spins at small scales

Understand

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.