Strong empiricalHamiltonian simulation · product formula
Transverse-field Ising simulation
A compact Hamiltonian-simulation pattern for spin chains: alternate local field rotations with entangling ZZ evolution.
Explore quantum algorithms and circuits, with resource estimates, verification evidence, and sources.
Every record is classified by how it was verified. The badge shows the strongest tier of evidence; the chips list each method that applies.
The defining behavior was checked exactly: a mathematical identity, a full statevector or stabilizer simulation, or an exhaustive basis-state truth table.
The design was verified by construction plus measured evidence: statistical re-execution, small-instance analytic agreement, sub-block, echo, or invariant checks. Scale-specific bugs can still survive.
The record rests on external authority: peer-reviewed papers, standard textbooks, expert review, or evidence carried over from related verified entries. Nothing here was re-executed by this catalog.
Only automated (LLM-assisted) review or an unreviewed community submission backs this record so far. Treat it as a starting point, not evidence.
A compact Hamiltonian-simulation pattern for spin chains: alternate local field rotations with entangling ZZ evolution.
A block-encoding primitive that turns a weighted sum of unitary operations into one larger unitary circuit.
A single-qubit rotation sequence that transforms an encoded signal into a polynomial response.
Approximates the time evolution of a Hamiltonian with non-commuting terms by alternating their individual exponentials.
Simulate the wave equation under Dirichlet and Neumann boundary conditions on a quantum computer, using Hamiltonian simulation and quantum linear system algorithms as subroutines.
Atlas stars stay in this public list. Saving an entry to your workspace starts an unstarred private copy.