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:1208.3918 · Annals of Physics

Low depth quantum circuits for Ising models

S. Iblisdir, Mauro Cirio, O. Boada, Gavin K. Brennen

Published Nov 13, 2013• 16 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2013.11.001

Related papers

Ground- and excited-state energies extraction via Trotterization on IBM quantum computers

Fernando Espinoza-Ortiz, Chungwei Lin, Chih-Chun Chien

We implement the Hadamard test with Trotterized time-evolution operators on IBM quantum computers to simultaneously extract ground- and excited-state energies of the transverse field Ising model (TFIM) and transverse longitudinal field Ising model (TLFIM). The Trotterization circuits for the TFIM admit constant-depth circuits (CDCs) for arbitrary time, allowing us to locate a large number of eigen-energies above the background noise for up to six spins. Via circuit synthesis we show that the three-spin TLFIM has constant-depth structure although it does not meet the known CDC criteria. The CDCs enable the extraction of the ground and first-excited state energies of the three-site TLFIM via its dynamics. We also address complications from the noisy background and discrete Fourier transform to enhance the reliability of the extraction process and compare the results from different generations of IBM hardware to highlight the improvement.

quant-pharXiv:2606.18534•Jun 18, 2026•0 citations

Quantum computation of Fisher zeros for the Ising model

H. P. Laba, V. M. Tkachuk

Physics Letters A•Jan 13, 2025•3 citations

Circuit depth reduction algorithm for QUBO and Ising models in gate-model quantum computers

Sun Woo Park, Hyunju Lee, Byung Chun Kim +2 more

Gate-model quantum computers, including IBM and IonQ, have gained considerable attention as backbones for implementing near-term quantum computer architectures and quantum devices. Their performances rely on circuit depths, whose minimization ensures optimal results and reduced noises. We develop an algorithm which rearranges the terms in the quadratics of the QUBO model and the Ising model, when implementing the Quantum Approximate Optimization Algorithm for the Hamiltonian of a linear system. We test the algorithm on IBM quantum computer and IBM simulator to verify the effectiveness of our algorithm for minimizing circuit depths.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 20, 2021•3 citations

From Frustrated Ising Models to Quantum Computing

Matthias Troyer, L. B. Ioffe, M. V. Feigel’man +3 more

Springer proceedings in physics•Jan 1, 2003•0 citations

On Complexity of the Quantum Ising Model

Sergey B. Bravyi, Matthew B. Hastings

arXiv:1410.0703•Communications in Mathematical Physics•Nov 11, 2016•83 citations

A quantum algorithm to train neural networks using low-depth circuits

Guillaume Verdon, Michael Broughton, Jacob Biamonte

Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called classical-quantum hybrid variational algorithms. Here we develop a low-depth quantum algorithm to generative neural networks using variational quantum circuits. We introduce a method which employs the quantum approximate optimization algorithm as a subroutine in order produce then sample low-energy distributions of Ising Hamiltonians. We sample these states to train neural networks and demonstrate training convergence for numerically simulated noisy circuits with depolarizing errors of rates of up to $4\%$.

arXiv:1712.05304•Dec 14, 2017•135 citations
We implement the Hadamard test with Trotterized time-evolution operators on IBM quantum computers to simultaneously extract ground- and excited-state energies of the transverse field Ising model (TFIM) and transverse longitudinal field Ising model (TLFIM). The Trotterization circuits for the TFIM admit constant-depth circuits (CDCs) for arbitrary time, allowing us to locate a large number of eigen-energies above the background noise for up to six spins. Via circuit synthesis we show that the three-spin TLFIM has constant-depth structure although it does not meet the known CDC criteria. The CDCs enable the extraction of the ground and first-excited state energies of the three-site TLFIM via its dynamics. We also address complications from the noisy background and discrete Fourier transform to enhance the reliability of the extraction process and compare the results from different generations of IBM hardware to highlight the improvement.
Gate-model quantum computers, including IBM and IonQ, have gained considerable attention as backbones for implementing near-term quantum computer architectures and quantum devices. Their performances rely on circuit depths, whose minimization ensures optimal results and reduced noises. We develop an algorithm which rearranges the terms in the quadratics of the QUBO model and the Ising model, when implementing the Quantum Approximate Optimization Algorithm for the Hamiltonian of a linear system. We test the algorithm on IBM quantum computer and IBM simulator to verify the effectiveness of our algorithm for minimizing circuit depths.
Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called classical-quantum hybrid variational algorithms. Here we develop a low-depth quantum algorithm to generative neural networks using variational quantum circuits. We introduce a method which employs the quantum approximate optimization algorithm as a subroutine in order produce then sample low-energy distributions of Ising Hamiltonians. We sample these states to train neural networks and demonstrate training convergence for numerically simulated noisy circuits with depolarizing errors of rates of up to 4%4\%4%.