← all papers

QCCDSim

Prakash Murali, Dripto M. Debroy, Kenneth R. Brown, Margaret Martonosi. Architecting Noisy Intermediate-Scale Trapped Ion Quantum Computers. ISCA 2020. arXiv:2004.04706 · their code: prakashmurali/QCCDSim (no license)

Two six-trap machines, a line (L6) and a two-by-three grid (G2x3), trap capacity swept from 14 to 34 ions, six NISQ benchmarks; the simulator every later paper in this list builds on.

No license file: we ran it locally and publish only the schedules it produced, never its code.

How the column “the paper” is made. The paper prints none of these numbers; it plots them. Its figures are vector drawings in its arXiv source, so every plotted point is stored as coordinates, to a thousandth of a typographic point or finer. Each value is a point's height mapped through the labelled ticks of its axis and rounded to four significant digits. Unrounded, the plotted points are their code's own outputs to within 0.02 % (2 µs at most); the small differences from the column “their code” are that rounding. “matches” means within 0.5 % of our replay, the precision allowed for a number read from a plot; the largest difference here is 0.03 %.

The rules each run is judged by

This paper's model is written as the rule sets QCCDSim's rules, QCCDSim's rules, with a physical gate swap. Every run above was replayed and each rule of the set evaluated on it. Our schedules are held to the same rules, and also keep each qubit's gates in the circuit's exact order (R25): we may not reorder a circuit, even where its gates commute.

✓ the rule holds on that run; ✗ it fails, with the number of counterexamples (hover for the first); – it does not apply to that run (hover for why); · the rule is not in that run's rule set.

setup_ok()
and (for all o in operations: well_formed(o) and found(o))
and (for all i in ions: position(i, final()) != none)

for all s in sites, t in instants:
  occupancy(s, t) <= capacity(s)

for all j in junctions, t in instants where not exchange(t):
  occupancy(j, t) <= 1

for all r in rails, t in instants where not exchange(t):
  occupancy(r, t) <= capacity(r)

(for all g in two_qubit_gates, i in ions(g): position(i, start(g)) = site(g))
and (for all g in two_qubit_gates where size(declared_sites(g)) > 0:
       site(g) in declared_sites(g))

for all a, b in operations where a != b and simultaneous(a, b):
  disjoint(ions(a), ions(b))

for all m in splits: at_chain_end(m) or swap_paid(m)

(for all c in circuit_ops where needs_gate(c): gate_count(c) >= 1)
and (for all g in two_qubit_gates: serves_circuit(g))

for all c1, c2 in circuit_ops where next_on_qubit(c1, c2) and performed(c1) and performed(c2):
  end(last(c1)) <= start(first(c2))

for all a, b in operations where a != b and kind(a) in serial_kinds and kind(b) in serial_kinds
    and site(a) = site(b) and site(a) != none:
  not simultaneous(a, b)

for all o in operations where clocked(o): approx(duration(o), clock(o))

How a paper is checked · all papers