{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GQHLCZA3CU4Z7I27GBSDHL4GSR","short_pith_number":"pith:GQHLCZA3","schema_version":"1.0","canonical_sha256":"340eb1641b15399fa35f306433af8694712b7d5215497e9d81ff448577307c7c","source":{"kind":"arxiv","id":"2507.12511","version":1},"attestation_state":"computed","paper":{"title":"Unfolded distillation: very low-cost magic state preparation for biased-noise qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christophe Vuillot, Diego Ruiz, J\\'er\\'emie Guillaud, Mazyar Mirrahimi","submitted_at":"2025-07-16T18:00:00Z","abstract_excerpt":"Magic state distillation enables universal fault-tolerant quantum computation by implementing non-Clifford gates via the preparation of high-fidelity magic states. However, it comes at the cost of substantial logical-level overhead in both space and time. In this work, we propose a very low-cost magic state distillation scheme for biased-noise qubits. By leveraging the noise bias, our scheme enables the preparation of a magic state with a logical error rate of $3 \\times 10^{-7}$, using only 53 qubits and 5.5 error correction rounds, under a noise bias of $\\eta \\gtrsim 5 \\times 10^6$ and a phas"},"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":"2507.12511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-07-16T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"d472955428d4a450a5ef04752a84d80a40211087cf717907c117bb25fe322684","abstract_canon_sha256":"5f66aa61c2adde71bd49601267fcb2bc116ec2b35a20d52276457d26a1992419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T02:06:13.012607Z","signature_b64":"0VGGPaWtZoIEDi9nZEcVdSwpJWJjfZzDJ16VKxWqVYDQZwMZsjJ3Gey2HBgvgZijKfb+AmOqQY3FcFrqyrC6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"340eb1641b15399fa35f306433af8694712b7d5215497e9d81ff448577307c7c","last_reissued_at":"2026-05-27T02:06:13.011760Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T02:06:13.011760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unfolded distillation: very low-cost magic state preparation for biased-noise qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christophe Vuillot, Diego Ruiz, J\\'er\\'emie Guillaud, Mazyar Mirrahimi","submitted_at":"2025-07-16T18:00:00Z","abstract_excerpt":"Magic state distillation enables universal fault-tolerant quantum computation by implementing non-Clifford gates via the preparation of high-fidelity magic states. However, it comes at the cost of substantial logical-level overhead in both space and time. In this work, we propose a very low-cost magic state distillation scheme for biased-noise qubits. By leveraging the noise bias, our scheme enables the preparation of a magic state with a logical error rate of $3 \\times 10^{-7}$, using only 53 qubits and 5.5 error correction rounds, under a noise bias of $\\eta \\gtrsim 5 \\times 10^6$ and a phas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12511","kind":"arxiv","version":1},"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/2507.12511/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":"2507.12511","created_at":"2026-05-27T02:06:13.011881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.12511v1","created_at":"2026-05-27T02:06:13.011881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12511","created_at":"2026-05-27T02:06:13.011881+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQHLCZA3CU4Z","created_at":"2026-05-27T02:06:13.011881+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQHLCZA3CU4Z7I27","created_at":"2026-05-27T02:06:13.011881+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQHLCZA3","created_at":"2026-05-27T02:06:13.011881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.06284","citing_title":"Local distillation from Reed Muller codes unfolding","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15436","citing_title":"Parity-unfolded distillation architecture for noise-biased platforms","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR","json":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR.json","graph_json":"https://pith.science/api/pith-number/GQHLCZA3CU4Z7I27GBSDHL4GSR/graph.json","events_json":"https://pith.science/api/pith-number/GQHLCZA3CU4Z7I27GBSDHL4GSR/events.json","paper":"https://pith.science/paper/GQHLCZA3"},"agent_actions":{"view_html":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR","download_json":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR.json","view_paper":"https://pith.science/paper/GQHLCZA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.12511&json=true","fetch_graph":"https://pith.science/api/pith-number/GQHLCZA3CU4Z7I27GBSDHL4GSR/graph.json","fetch_events":"https://pith.science/api/pith-number/GQHLCZA3CU4Z7I27GBSDHL4GSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR/action/storage_attestation","attest_author":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR/action/author_attestation","sign_citation":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR/action/citation_signature","submit_replication":"https://pith.science/pith/GQHLCZA3CU4Z7I27GBSDHL4GSR/action/replication_record"}},"created_at":"2026-05-27T02:06:13.011881+00:00","updated_at":"2026-05-27T02:06:13.011881+00:00"}