Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor

A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is challenging to build a quantum system that can efficiently map any structured problems. Here, we present a trapped-ion quantum processor that can efficient encode arbitrary Ising models with all-to-all connectivity for up to four spins. We implement the spin-spin interactions by using the coupling of trapped ions to multiple collective motional modes and realize the programmability through phase modulation of the Raman laser beams that are individually addressed on ions. As an example, we realize several Ising models with different interaction connectivities, where the interactions can be ferromagnetic or antiferromagnetic. We confirm the programmed interaction geometry by observing the ground states of the corresponding models through quantum state tomography. Our experimental demonstrations serve as an important basis for realizing practical quantum advantages with trapped ions.

Authors

Institutions

Publication Details

Journal
Physical Review Letters
Published
2025-02-04
DOI
https://doi.org/10.1103/physrevlett.134.050602
Citations
5
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
12.40

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor

Jing-Ning Zhang, Yao Lu, Shuaining Zhang, Jialiang Zhang et al.
5 citations
Physical Review Letters
Quantum Computing Algorithms and Architecture
12.40
article

Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor

Jing-Ning Zhang, Yao Lu, Shuaining Zhang, Jialiang Zhang, Kihwan Kim, Wentao Chen, Kuan Zhang
article en
5 citations

Abstract

A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is challenging to build a quantum system that can efficiently map any structured problems. Here, we present a trapped-ion quantum processor that can efficient encode arbitrary Ising models with all-to-all connectivity for up to four spins. We implement the spin-spin interactions by using the coupling of trapped ions to multiple collective motional modes and realize the programmability through phase modulation of the Raman laser beams that are individually addressed on ions. As an example, we realize several Ising models with different interaction connectivities, where the interactions can be ferromagnetic or antiferromagnetic. We confirm the programmed interaction geometry by observing the ground states of the corresponding models through quantum state tomography. Our experimental demonstrations serve as an important basis for realizing practical quantum advantages with trapped ions.

Physical Review LettersVol. 134(5)
Southern University of Science and Technology (CN), Hefei University (CN), Quantum (Australia) (AU), Beijing Academy of Quantum Information Sciences (CN), Huazhong University of Science and Technology (CN), Renmin University of China (CN), Tsinghua University (CN)
National Natural Science Foundation of China, Shenzhen Science and Technology Innovation Program, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
12.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.