{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A3R6V6KPBYP6CUNFNIBC4T4OHJ","short_pith_number":"pith:A3R6V6KP","schema_version":"1.0","canonical_sha256":"06e3eaf94f0e1fe151a56a022e4f8e3a6a11637d4f5b7e003951633684d539a6","source":{"kind":"arxiv","id":"2503.15751","version":2},"attestation_state":"computed","paper":{"title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Andreas Bauer, Benjamin J. Brown, Dominic J. Williamson, Julio C. Magdalena de la Fuente, Margarita Davydova, Mark Webster","submitted_at":"2025-03-19T23:59:46Z","abstract_excerpt":"We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a path integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus, establishing a new co"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.15751","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-19T23:59:46Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"5f3dc1ec681b6ad2f98711012ec6cdba09e59ebdb6831d1b945038f3a10bafd8","abstract_canon_sha256":"6ee3f453f9013d812f5224326a8de20bb428d90123df49d23c2012b143ed8ed9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:22.532868Z","signature_b64":"SBxRtkpr/mrH1ViqX3L8zDXgDbAhVsr2yMPdLNlKE7MNKnh+gz1boOb2osmqevFnuFkYD7dOPi+tPuU8vM2bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e3eaf94f0e1fe151a56a022e4f8e3a6a11637d4f5b7e003951633684d539a6","last_reissued_at":"2026-07-05T11:03:22.532440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:22.532440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal fault tolerant quantum computation in 2D without getting tied in knots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Andreas Bauer, Benjamin J. Brown, Dominic J. Williamson, Julio C. Magdalena de la Fuente, Margarita Davydova, Mark Webster","submitted_at":"2025-03-19T23:59:46Z","abstract_excerpt":"We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a path integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus, establishing a new co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.15751","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.15751/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.15751","created_at":"2026-07-05T11:03:22.532497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.15751v2","created_at":"2026-07-05T11:03:22.532497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.15751","created_at":"2026-07-05T11:03:22.532497+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3R6V6KPBYP6","created_at":"2026-07-05T11:03:22.532497+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3R6V6KPBYP6CUNF","created_at":"2026-07-05T11:03:22.532497+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3R6V6KP","created_at":"2026-07-05T11:03:22.532497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"2606.05664","citing_title":"Gauging the Spacetime Code","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2507.16152","citing_title":"Practical blueprint for low-depth photonic quantum computing with quantum dots","ref_index":107,"is_internal_anchor":true},{"citing_arxiv_id":"2511.02900","citing_title":"Clifford Hierarchy Stabilizer Codes: Transversal Non-Clifford Gates and Magic","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2601.10964","citing_title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2603.05429","citing_title":"Constant depth magic state cultivation with Clifford measurements by gauging","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ","json":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ.json","graph_json":"https://pith.science/api/pith-number/A3R6V6KPBYP6CUNFNIBC4T4OHJ/graph.json","events_json":"https://pith.science/api/pith-number/A3R6V6KPBYP6CUNFNIBC4T4OHJ/events.json","paper":"https://pith.science/paper/A3R6V6KP"},"agent_actions":{"view_html":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ","download_json":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ.json","view_paper":"https://pith.science/paper/A3R6V6KP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.15751&json=true","fetch_graph":"https://pith.science/api/pith-number/A3R6V6KPBYP6CUNFNIBC4T4OHJ/graph.json","fetch_events":"https://pith.science/api/pith-number/A3R6V6KPBYP6CUNFNIBC4T4OHJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ/action/storage_attestation","attest_author":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ/action/author_attestation","sign_citation":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ/action/citation_signature","submit_replication":"https://pith.science/pith/A3R6V6KPBYP6CUNFNIBC4T4OHJ/action/replication_record"}},"created_at":"2026-07-05T11:03:22.532497+00:00","updated_at":"2026-07-05T11:03:22.532497+00:00"}