{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TPNETZE6RYBZF2U6ATWESSGH6M","short_pith_number":"pith:TPNETZE6","schema_version":"1.0","canonical_sha256":"9bda49e49e8e0392ea9e04ec4948c7f3093bbac763e5e8da1efcd834fa3f7088","source":{"kind":"arxiv","id":"2508.10107","version":1},"attestation_state":"computed","paper":{"title":"Projective Measurements: Topological Quantum Computing with an Arbitrary Number of Qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Philipp Frey, Stephan Rachel, Themba Hodge","submitted_at":"2025-08-13T18:03:52Z","abstract_excerpt":"Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a critical yet often overlooked challenge arises when scaling beyond two qubits: the naive extension of braiding based gates fails to support even the full Clifford group. To overcome this limitation, we incorporate projective measurements that enable transitions between different qubit encodings, thus restoring computational universality. We perform many-body s"},"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":"2508.10107","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-13T18:03:52Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"e57851d2e9d951f540b7b99ddbfdf30206bd1ef7c91f9fa3949f55e7e15affaf","abstract_canon_sha256":"c778999488c12fe39d9d706289b41e6daa7b6eed0088bc2cb1b224bd103f2fd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:31.060408Z","signature_b64":"Y8oridAJw7G/wSXz/OF3ddX3IbvFqgPAlo2vkHIloE3c2oKlPMzTna0Xz7dQlCDk9Hh7YSU12HzTfmTIxA7OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bda49e49e8e0392ea9e04ec4948c7f3093bbac763e5e8da1efcd834fa3f7088","last_reissued_at":"2026-07-05T11:53:31.059870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:31.059870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projective Measurements: Topological Quantum Computing with an Arbitrary Number of Qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"Philipp Frey, Stephan Rachel, Themba Hodge","submitted_at":"2025-08-13T18:03:52Z","abstract_excerpt":"Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a critical yet often overlooked challenge arises when scaling beyond two qubits: the naive extension of braiding based gates fails to support even the full Clifford group. To overcome this limitation, we incorporate projective measurements that enable transitions between different qubit encodings, thus restoring computational universality. We perform many-body s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.10107","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/2508.10107/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":"2508.10107","created_at":"2026-07-05T11:53:31.059943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.10107v1","created_at":"2026-07-05T11:53:31.059943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.10107","created_at":"2026-07-05T11:53:31.059943+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPNETZE6RYBZ","created_at":"2026-07-05T11:53:31.059943+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPNETZE6RYBZF2U6","created_at":"2026-07-05T11:53:31.059943+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPNETZE6","created_at":"2026-07-05T11:53:31.059943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10108","citing_title":"Amazon Nova AI Challenge -- Trusted AI: Advancing secure, AI-assisted software development","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M","json":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M.json","graph_json":"https://pith.science/api/pith-number/TPNETZE6RYBZF2U6ATWESSGH6M/graph.json","events_json":"https://pith.science/api/pith-number/TPNETZE6RYBZF2U6ATWESSGH6M/events.json","paper":"https://pith.science/paper/TPNETZE6"},"agent_actions":{"view_html":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M","download_json":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M.json","view_paper":"https://pith.science/paper/TPNETZE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.10107&json=true","fetch_graph":"https://pith.science/api/pith-number/TPNETZE6RYBZF2U6ATWESSGH6M/graph.json","fetch_events":"https://pith.science/api/pith-number/TPNETZE6RYBZF2U6ATWESSGH6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M/action/storage_attestation","attest_author":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M/action/author_attestation","sign_citation":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M/action/citation_signature","submit_replication":"https://pith.science/pith/TPNETZE6RYBZF2U6ATWESSGH6M/action/replication_record"}},"created_at":"2026-07-05T11:53:31.059943+00:00","updated_at":"2026-07-05T11:53:31.059943+00:00"}