no sw
85e17cc2-5c68-3b55-a2c6-a2868d7cd751
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 85e17cc2 · program 5126811552126 · tail a2868d7cd751 · seal ✓
| one 48-bit | 178698783086417 |
| three 16-bit | 41606 · 36220 · 55121 |
| text | — |
| timestamp | — |
| referrer handle · flags | a2868d7c · 55121 |
| colour | #a2868d |
| vortex (ℤ/9) | seed 2 · reflection 8 · minus |
| mirror (σ) | 7a1e833d-a397-24aa-8d39-5d79728328ae |
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
85e17cc2-5c68-3b55-a2c6-a2868d7cd751
Valid
✓
Checks decided
1
| Check | Result | Evidence |
|---|---|---|
| seal | ✓ | version 3 vs decided 3; 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 | 5 | algorithm | {"name":"qaoa","N":18,"a":3,"qubits":6,"input":41606,"theta":0.5527,"bits":2,"repetitions":1607,"nodes":10,"alpha":0.8411,"beta":0.6349} |
| 1 | c | fault-tolerant-design | {"qubits":3,"N":9,"a":3,"nodes":6} |
| 2 | 6 | software | {} |
| 3 | 8 | repositories | {} |
| 4 | b | chemistry-simulation | {"bond_length":0.6349,"steps":7} |
| 5 | 5 | algorithm | {"name":"grover","N":18,"a":3,"qubits":6,"input":41606,"theta":0.5527,"bits":2,"repetitions":1607,"nodes":10,"alpha":0.8411,"beta":0.6349} |
| 6 | 5 | algorithm | {"name":"teleportation","N":18,"a":3,"qubits":6,"input":41606,"theta":0.5527,"bits":2,"repetitions":1607,"nodes":10,"alpha":0.8411,"beta":0.6349} |
| 7 | 2 | echo | {} |
| 8 | c | fault-tolerant-design | {"qubits":3,"N":9,"a":3,"nodes":6} |
| 9 | 6 | software | {} |
Next, executed
algorithm · The textbook algorithms of the Cirq page: qft and inverse_qft (on 1 to 6 qubits, from input x), phase_estimation (of θ with 1 to 8 bits), grover (two qubits, marked |00>), teleportation (the message state, sent and received), qaoa (depth 1 on the first 2 to 12 sorted qubits of the Sycamore device, the page's instance, with the expected cut), and shor (order finding for N from 3 to 21, the state-vector bound). Each returns its summary and a table.
Device
Sycamore
Nodes
10
Edges
12
Expected cut
15.2453
Random baseline
14.9900
| Edge | Weight |
|---|---|
| grid:0,5 – grid:0,6 | 4.09 |
| grid:0,5 – grid:1,5 | 1.91 |
| grid:0,6 – grid:1,6 | 0.80 |
| grid:1,4 – grid:1,5 | 0.91 |
| grid:1,4 – grid:2,4 | 3.37 |
| grid:1,5 – grid:1,6 | 4.39 |
| grid:1,5 – grid:2,5 | 2.69 |
| grid:1,6 – grid:1,7 | 3.32 |
| grid:1,6 – grid:2,6 | 1.61 |
| grid:2,3 – grid:2,4 | 0.71 |
| grid:2,4 – grid:2,5 | 3.38 |
| grid:2,5 – grid:2,6 | 2.80 |
© Tsvetan Rouschev · CC-BY-NC-ND-4.0 · commercial use by licence (ceccec@psg.bg)