{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3TCFLNQJ3G6A55DWQWG57TI6YO","short_pith_number":"pith:3TCFLNQJ","schema_version":"1.0","canonical_sha256":"dcc455b609d9bc0ef476858ddfcd1ec3bdfa2b993be7dd97571a217c58c6054a","source":{"kind":"arxiv","id":"2302.02654","version":2},"attestation_state":"computed","paper":{"title":"Extending Matchgate Simulation Methods to Universal Quantum Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avinash Mocherla, Dan E. Browne, Lingling Lao","submitted_at":"2023-02-06T09:50:16Z","abstract_excerpt":"Matchgates are a family of parity-preserving two-qubit gates, nearest-neighbour circuits of which are known to be classically simulable in polynomial time. In this work, we present a simulation method to classically simulate an $\\boldsymbol{n}$-qubit circuit containing $\\boldsymbol{N}$ gates, $\\boldsymbol{m}$ of which are universality-enabling gates and $\\boldsymbol{N-m}$ of which are matchgates, in the setting of single-qubit Pauli measurements and product state inputs. The universality-enabling gates we consider include the SWAP, CZ, and CPhase gates. For fixed $\\boldsymbol{m}$ as $\\boldsymb"},"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":"2302.02654","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-06T09:50:16Z","cross_cats_sorted":[],"title_canon_sha256":"ccd75a137aad6de521107601083de645d53ecf1ac80f9f2cf6943c2e7a050cfe","abstract_canon_sha256":"e05a7bcf552476a072699bc6e61a55d4b3feebd47f94d521beb14e86da2e1eca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:28.653468Z","signature_b64":"Ut8KnKy6FgAA2txGCD9jP2CMOO0XA8qLg/L6QdjTctyMpHfpIaqzX2ZBdoYUAjiuX4J3q/aA2errpNMMMOi0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcc455b609d9bc0ef476858ddfcd1ec3bdfa2b993be7dd97571a217c58c6054a","last_reissued_at":"2026-07-05T08:32:28.652945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:28.652945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending Matchgate Simulation Methods to Universal Quantum Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avinash Mocherla, Dan E. Browne, Lingling Lao","submitted_at":"2023-02-06T09:50:16Z","abstract_excerpt":"Matchgates are a family of parity-preserving two-qubit gates, nearest-neighbour circuits of which are known to be classically simulable in polynomial time. In this work, we present a simulation method to classically simulate an $\\boldsymbol{n}$-qubit circuit containing $\\boldsymbol{N}$ gates, $\\boldsymbol{m}$ of which are universality-enabling gates and $\\boldsymbol{N-m}$ of which are matchgates, in the setting of single-qubit Pauli measurements and product state inputs. The universality-enabling gates we consider include the SWAP, CZ, and CPhase gates. For fixed $\\boldsymbol{m}$ as $\\boldsymb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02654","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/2302.02654/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":"2302.02654","created_at":"2026-07-05T08:32:28.653007+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02654v2","created_at":"2026-07-05T08:32:28.653007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02654","created_at":"2026-07-05T08:32:28.653007+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TCFLNQJ3G6A","created_at":"2026-07-05T08:32:28.653007+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TCFLNQJ3G6A55DW","created_at":"2026-07-05T08:32:28.653007+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TCFLNQJ","created_at":"2026-07-05T08:32:28.653007+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08396","citing_title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20805","citing_title":"Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers","ref_index":151,"is_internal_anchor":false},{"citing_arxiv_id":"2607.02242","citing_title":"Computable fermionic non-Gaussianity from the covariance matrix","ref_index":170,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO","json":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO.json","graph_json":"https://pith.science/api/pith-number/3TCFLNQJ3G6A55DWQWG57TI6YO/graph.json","events_json":"https://pith.science/api/pith-number/3TCFLNQJ3G6A55DWQWG57TI6YO/events.json","paper":"https://pith.science/paper/3TCFLNQJ"},"agent_actions":{"view_html":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO","download_json":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO.json","view_paper":"https://pith.science/paper/3TCFLNQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02654&json=true","fetch_graph":"https://pith.science/api/pith-number/3TCFLNQJ3G6A55DWQWG57TI6YO/graph.json","fetch_events":"https://pith.science/api/pith-number/3TCFLNQJ3G6A55DWQWG57TI6YO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO/action/storage_attestation","attest_author":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO/action/author_attestation","sign_citation":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO/action/citation_signature","submit_replication":"https://pith.science/pith/3TCFLNQJ3G6A55DWQWG57TI6YO/action/replication_record"}},"created_at":"2026-07-05T08:32:28.653007+00:00","updated_at":"2026-07-05T08:32:28.653007+00:00"}