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:1302.6555 · Quantum Information Processing

Non-Hermitian quantum annealing in the antiferromagnetic Ising chain

Alexander I. Nesterov, G. P. Berman, Juan Carlos Beas Zepeda, A. R. Bishop

Published Oct 18, 2013• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-013-0656-z

Related papers

Adiabatic quantum annealing dynamics in a random Ising chain

Tommaso Caneva, Rosario Fazio, Giuseppe E. Santoro

•Jun 13, 2007•1 citation

Isothermal quantum annealing of the 1D transverse Ising chain

Davide Venturelli, Vadim Smelyanskiy, Alejandro Perdomo‐Ortiz +3 more

Bulletin of the American Physical Society•Mar 4, 2015•0 citations

Coherent quantum annealing in a programmable 2,000 qubit Ising chain

Andrew D. King, Sei Suzuki, Jack Raymond +21 more

arXiv:2202.05847•Nature Physics•Sep 15, 2022•213 citations

Non-Hermitian Quantum Annealing and Superradiance

Alexander I. Nesterov, G. P. Berman, F. Aceves de la Cruz +1 more

arXiv:1512.01618•Springer proceedings in physics•Jan 1, 2016•1 citation

Non-Hermitian Quantum Annealing in the Transverse Ising Model

Alexander I. Nesterov, Juan Carlos Beas Zepeda, G. P. Berman

We create a non-Hermitian quantum optimization algorithm to find the ground state of an Ising model with up to 1024 spins (qubits). Our approach leads to significant reduction of the annealing time. Analytic and numerical results demonstrate that the total annealing time is proportional to ln N, where N is the number of spins. This encouraging result is important for the rapid solution of NP-complete problems. Additional research is proposed for extending our dissipative algorithm to more complicated problems.

•Nov 14, 2012•0 citations

Quantum annealing in the transverse Ising model

秀稔 西森, Hidetoshi Nishimori, 隼一 井上 +1 more

•Jul 1, 1998•0 citations
We create a non-Hermitian quantum optimization algorithm to find the ground state of an Ising model with up to 1024 spins (qubits). Our approach leads to significant reduction of the annealing time. Analytic and numerical results demonstrate that the total annealing time is proportional to ln N, where N is the number of spins. This encouraging result is important for the rapid solution of NP-complete problems. Additional research is proposed for extending our dissipative algorithm to more complicated problems.