Strong empiricalBasic circuitsBenchmark circuitRouting benchmark3 q192 physical qubits
Linear SWAP-network benchmark · 3 qubits
A forward-and-reverse nearest-neighbor SWAP network for testing routing and qubit-order preservation.
Every quantum algorithm worth knowing about, written down the same way: what it takes, what it returns, what it costs, and who proved it.
The Map draws our corpus as one connected structure: Open the Map
Every source behind both surfaces: See the papers
A speedup class on a record is quoted: See whose claim it is
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.
3 entries · 4 records, sized variants folded
Atlas stars stay in this public list. Saving an entry to your workspace starts an unstarred private copy.
A forward-and-reverse nearest-neighbor SWAP network for testing routing and qubit-order preservation.
A two-qubit permutation gate defined as two CNOTs with reversed control and target applied back to back — a genuinely different two-CNOT gate from SWAP (which uses three), and notable for not being self-inverse.
A routing primitive that exchanges two qubit states and makes hardware connectivity explicit.