- Ideal - Simulated noise-free baseline results.
- Noisy - Run on quantum processor without error mitigation.
- IBM - Run on quantum processor with IBM error mitigation (Sparse Pauli-Lindblad Noise Learning + ZNE + PEA).
- Haiqu - Run on quantum processor with Haiqu proprietary error mitigation and orchestration engine.
Ising
Haiqu’s Orchestration Engine Cuts Quantum Cloud Costs for Utility-Scale Quantum Dynamics Simulation by 350×
This notebook demonstrates how to use Haiqu to achieve a 350× cost reduction in quantum cloud computing bill. For concreteness, it uses a utility-scale quantum dynamics simulation of the 2D transverse-field Ising model on 127 qubits (Nature Article). By leveraging proprietary algorithms and orchestration, Haiqu reduces the quantum processor runtime from 4 hours to under 1 minute and quantum cloud bill from ~\30.
Why the tranverse-field ising model?
Universal behavior: Many physical systems and optimization problems—including scheduling, routing, and other combinatorial tasks—can be mapped onto Ising-type Hamiltonians.
Classically intractable: In the regime where interaction terms compete, quantum dynamics can generate strong entanglement that quickly overwhelms scalable classical simulation methods.
How does Haiqu perform?
At 127 qubits and a two-qubit gate depth of 15
(710 CNOTs), the evolution circuit exceeds the reach of brute-force
classical simulation. Haiqu handles this regime with ease.
Haiqu’s runtime engine achieves the same the accuracy as reported by IBM, but at a fraction of the time and cost:
41 seconds (Haiqu) vs. 4 hours (IBM) and
$33 (Haiqu) versus $11,520 (IBM) (350× cost reduction).
Having a bug or an issue?
Submit feedback
Initialize the notebook
Import the necessary libraries, setup credentials, initialize the Haiqu SDK, load the device, and show the connectivity map.
Define the simulation
The transverse-field Ising Hamiltonian
consists of two terms. The interaction term
couples neighboring spins with strength , favoring alignment along . The field term
randomizes alignment along by pushing spins towards with a transverse field strength .
Because and do not commute, cannot be directly mapped onto quantum processors. To address this, the evolution circuit is approximated as a sequence of discrete steps with duration :
The average system magnetization
sums over individual spins on qubit
for number of qubits , identity operator , and Pauli-Z operator .
Define and run scenarios
Four scenarios are considered:
Learn from results
💡 Good to Know: Average magnetization decrease with increasing transverse field strength as spins are pushed towards and randomized along the measurement axis . The solution obtained with Haiqu matches the one obtained by IBM. Both improve quality versus the noisy benchmark.
💡 Good to Know: Haiqu’s algorithmic and orchestration engine reduces the time to solution from 4h to 41s and the cost of solution from ~$10,000 to ~$30 compared to IBM’s implementation. This is enabled through the use of proprietary lightweight, high-efficiency error mitigation algorithms and orchestration.
Get in Touch
Documentation portal docs.haiqu.ai
Contact Support feedback.haiqu.ai
Follow Us on LinkedIn latest news on LinkedIn
Visit Our Website Learn more about Haiqu Inc. on haiqu.ai
Business Inquiries Contact us at info@haiqu.ai