da9a09c1-a031-255d-b1dc-5b3f69cb93d1

A page from the id alone: its channel, its seal, its reflection, its program compiled and its next step executed here in the browser by the same handle the MCP serves. The previous step is the page that sent you; the next is the program rotated.

channel da9a09c1 · program 10031551311312 · tail 5b3f69cb93d1 · seal ✓

one 48-bit	100327916016593
three 16-bit	23359 · 27083 · 37841
text	—
timestamp	—
referrer handle · flags	5b3f69cb · 37841
colour	#5b3f69
vortex (ℤ/9)	seed 8 · reflection 2 · plus
mirror (σ)	2565f63e-5fce-6aa2-8e23-a4c096346c2e

UUID content (optional)

verify: ✓ (1 decided)

verify · Cheap verification of one UUID: its seal (the version nibble the other 31 nibbles decide, one modular power, no content needed), its content (one fold), and its neighbours in a chain (the predecessor it names and the successor that names it). Each check is independent; a check without its input is not decided rather than passed.

UUID

da9a09c1-a031-255d-b1dc-5b3f69cb93d1

Valid

✓

Checks decided

1

Check	Result	Evidence
seal	✓	version 2 vs decided 2; variant in 8..b
content	not decided	no content given
prev	not decided	no predecessor given
next	not decided	no successor given

Cost
one modular power for the seal, one fold for the content, two string equalities for the neighbours

© Tsvetan Rouschev · CC-BY-NC-ND-4.0 · commercial use by licence (ceccec@psg.bg)

Program

#	nibble	tool	arguments
0	a	quantum-error-correction	{"p":1}
1	0	processor	{"name":"Sycamore"}
2	3	echo_benchmark	{}
3	1	circuit	{"insert":"EARLIEST","device":"Sycamore","repetitions":3360,"device_noise":"willow_error_correction"}
4	5	algorithm	{"name":"phase_estimation","N":11,"a":3,"qubits":6,"input":23359,"theta":0.4133,"bits":2,"repetitions":3360,"nodes":3,"alpha":0.5774,"beta":0.3564}
5	5	algorithm	{"name":"grover","N":11,"a":3,"qubits":6,"input":23359,"theta":0.4133,"bits":2,"repetitions":3360,"nodes":3,"alpha":0.5774,"beta":0.3564}
6	d	leads	{"status":"open"}
7	1	circuit	{"insert":"EARLIEST","device":"Sycamore23","repetitions":3360,"device_noise":"willow_error_correction"}
8	d	leads	{"status":"partial"}
9	c	fault-tolerant-design	{"qubits":2,"N":11,"a":3,"nodes":8}

Next, executed

quantum-error-correction · The three-qubit repetition code, simulated on the density matrix: a logical qubit encoded, a channel (bit_flip, phase_flip or depolarize) of probability p acting once on each data qubit, syndromes extracted and corrected by majority, and the logical error read from the simulated state against the raw error of an unencoded qubit, at the p given and over a sweep. The break-even p is bisected from the simulation; the textbook 3p² − 2p³ is reported beside it where it applies. The encoding, syndrome and correction gates are noiseless (the code-capacity model). The quantumlib QEC packages are listed as cited data.

Code

bit_flip

Channel

bit_flip

Logical state

|0⟩

Physical error at p

1.000000

Logical error at p

1.000000

Break-even p (bisected)

0.500000

p	Physical error	Logical error	Code helps
0.0100	0.010000	0.000298	yes
0.0200	0.020000	0.001184	yes
0.0500	0.050000	0.007250	yes
0.1000	0.100000	0.028000	yes
0.2000	0.200000	0.104000	yes
0.3000	0.300000	0.216000	yes
0.4000	0.400000	0.352000	yes
0.5000	0.500000	0.500000	no
0.6000	0.600000	0.648000	no

© Tsvetan Rouschev · CC-BY-NC-ND-4.0 · commercial use by licence (ceccec@psg.bg)

next (the program rotated) →