{"artifact_id":"L1-924","layer":"L1","title":"Quantum Compilation — Circuit Synthesis & Routing","domain":"Quantum Software","sub_domain":"Circuit Compilation","physics_fingerprint":{"title":"Quantum Compilation — Circuit Synthesis & Routing","domain":"Quantum Software","chapter":"Ch.12 Quantum Technology","sub_domain":"Circuit Compilation","forward_model":"Map a logical circuit to a device coupling graph by inserting SWAPs and decomposing to the native gate set; success probability ≈ (1−ε₂)^{N₂} falls with two-qubit-gate count N₂, so minimizing depth/N₂ maximizes fidelity.","challenge_blurb":"Make quantum programs runnable — compile and route circuits to hardware with the fewest two-qubit gates so the result survives noise.","challenge_group":"quantum","challenge_short":"Quantum Circuit Compilation","grand_challenge":true,"governing_equation":"minimize N₂(routing, synthesis)  s.t.  coupling graph;   P_success ≈ (1−ε₂)^{N₂}"},"observable_profile":{"unit":"two-qubit gates after compile (lower better, normalized)","floor":1.0,"metric":"two_qubit_count","sota_reference":"SABRE routing + ZX-calculus / template optimization (Qiskit, t|ket⟩)"},"size_tiers":{"qubits":[5,27,127],"circuit_depth":[20,200,2000]},"hardness_fn":{"type":"grand_challenge","metric":"two_qubit_count","baseline":"Greedy SABRE routing","delta_tier":50},"initiator_dataset":[{"name":"Compilation benchmark circuit suite","weight":0.6,"ipfs_cid":null,"license_hash":null},{"name":"Device coupling-map library","weight":0.4,"ipfs_cid":null,"license_hash":null}],"status":"testnet","staked_pwm":5000.0,"chain_hash":null,"chain_tx_hash":null,"chain_block":null}