{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LCHCEY3ORDPLMHNNHN646HQVRY","short_pith_number":"pith:LCHCEY3O","schema_version":"1.0","canonical_sha256":"588e22636e88deb61dad3b7dcf1e158e2f96d5007d6076f8b3ba94c78018fabc","source":{"kind":"arxiv","id":"2410.01887","version":1},"attestation_state":"computed","paper":{"title":"Matchgate hierarchy: A Clifford-like hierarchy for deterministic gate teleportation in matchgate circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Angelos Bampounis, Nadish de Silva, Rui Soares Barbosa","submitted_at":"2024-10-02T18:00:01Z","abstract_excerpt":"The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing sequence of sets of quantum gates crucial to the gate teleportation model for fault-tolerant quantum computation. Gates in the hierarchy can be deterministically implemented, with increasing complexity, via gate teleportation using (adaptive) Clifford circuits with access to magic states.\n  We propose an analogous gate teleportation protocol and a related hierarchy in the context of matchgate circuits, another restricted class of quantum circuits that can be efficiently classically simulated but are promoted t"},"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":"2410.01887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-02T18:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"d8a7fa3c0395350b6c1676f1f02df8f707c4c91c944b87065cdff220495b7382","abstract_canon_sha256":"d7e4836721a04d7f93edb388dbca5055602a22584a208472f1a1337f828cab51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:57.326310Z","signature_b64":"duvwFkQyqMwV8hScIM2z9WymiHJmrqdrBZ/xGz95Y51ikmZmFjNzopJJzKw74LFX8CHB8vY1oV8FvUl/8kzDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"588e22636e88deb61dad3b7dcf1e158e2f96d5007d6076f8b3ba94c78018fabc","last_reissued_at":"2026-07-05T09:14:57.325935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:57.325935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matchgate hierarchy: A Clifford-like hierarchy for deterministic gate teleportation in matchgate circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Angelos Bampounis, Nadish de Silva, Rui Soares Barbosa","submitted_at":"2024-10-02T18:00:01Z","abstract_excerpt":"The Clifford hierarchy, introduced by Gottesman and Chuang in 1999, is an increasing sequence of sets of quantum gates crucial to the gate teleportation model for fault-tolerant quantum computation. Gates in the hierarchy can be deterministically implemented, with increasing complexity, via gate teleportation using (adaptive) Clifford circuits with access to magic states.\n  We propose an analogous gate teleportation protocol and a related hierarchy in the context of matchgate circuits, another restricted class of quantum circuits that can be efficiently classically simulated but are promoted t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.01887","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/2410.01887/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":"2410.01887","created_at":"2026-07-05T09:14:57.325993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.01887v1","created_at":"2026-07-05T09:14:57.325993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.01887","created_at":"2026-07-05T09:14:57.325993+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCHCEY3ORDPL","created_at":"2026-07-05T09:14:57.325993+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCHCEY3ORDPLMHNN","created_at":"2026-07-05T09:14:57.325993+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCHCEY3O","created_at":"2026-07-05T09:14:57.325993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07804","citing_title":"Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement","ref_index":88,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY","json":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY.json","graph_json":"https://pith.science/api/pith-number/LCHCEY3ORDPLMHNNHN646HQVRY/graph.json","events_json":"https://pith.science/api/pith-number/LCHCEY3ORDPLMHNNHN646HQVRY/events.json","paper":"https://pith.science/paper/LCHCEY3O"},"agent_actions":{"view_html":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY","download_json":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY.json","view_paper":"https://pith.science/paper/LCHCEY3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.01887&json=true","fetch_graph":"https://pith.science/api/pith-number/LCHCEY3ORDPLMHNNHN646HQVRY/graph.json","fetch_events":"https://pith.science/api/pith-number/LCHCEY3ORDPLMHNNHN646HQVRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY/action/storage_attestation","attest_author":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY/action/author_attestation","sign_citation":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY/action/citation_signature","submit_replication":"https://pith.science/pith/LCHCEY3ORDPLMHNNHN646HQVRY/action/replication_record"}},"created_at":"2026-07-05T09:14:57.325993+00:00","updated_at":"2026-07-05T09:14:57.325993+00:00"}