{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RVUTAB73TJQCU4P5KI25HJRADR","short_pith_number":"pith:RVUTAB73","schema_version":"1.0","canonical_sha256":"8d693007fb9a602a71fd5235d3a6201c46cbbf7231e920050f26ef7c8e43fff4","source":{"kind":"arxiv","id":"2509.20052","version":3},"attestation_state":"computed","paper":{"title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hideaki Hakoshima, Keisuke Fujii, Yusei Mori","submitted_at":"2025-09-24T12:19:30Z","abstract_excerpt":"Quantum compilers that reduce the number of T gates are essential for minimizing the overhead of fault-tolerant quantum computation. Achieving further T-count reduction calls for identifying equivalent circuit transformation rules beyond those utilized in existing tools. In this paper, we rewrite any given Clifford+T circuit using a Clifford block followed by a sequential Pauli-based computation, and introduce a nontrivial, ancilla-free transformation rule, the multi-product commutation relation (MCR). MCR constructs gate sequences based on specific commutation properties among multi-Pauli ope"},"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":"2509.20052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-09-24T12:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"79797da964597b6265302fc1c5676cca07980d54793dc2670d94ef17e317c2c8","abstract_canon_sha256":"a8d79b6dd7f83f2ac9a415367830da689d1900f41762dbfee7f0fcd75b32b1fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:05:03.934145Z","signature_b64":"5e7lc1fztflTxs5hBQ+UGHzXn3gXwoAfrwhckzn00lDKMpT8L5FuuWIZII2Hg/guoSJrOIm+Mi5L5QR7kl+EBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d693007fb9a602a71fd5235d3a6201c46cbbf7231e920050f26ef7c8e43fff4","last_reissued_at":"2026-06-02T03:05:03.933647Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:05:03.933647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hideaki Hakoshima, Keisuke Fujii, Yusei Mori","submitted_at":"2025-09-24T12:19:30Z","abstract_excerpt":"Quantum compilers that reduce the number of T gates are essential for minimizing the overhead of fault-tolerant quantum computation. Achieving further T-count reduction calls for identifying equivalent circuit transformation rules beyond those utilized in existing tools. In this paper, we rewrite any given Clifford+T circuit using a Clifford block followed by a sequential Pauli-based computation, and introduce a nontrivial, ancilla-free transformation rule, the multi-product commutation relation (MCR). MCR constructs gate sequences based on specific commutation properties among multi-Pauli ope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.20052","kind":"arxiv","version":3},"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/2509.20052/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":"2509.20052","created_at":"2026-06-02T03:05:03.933703+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.20052v3","created_at":"2026-06-02T03:05:03.933703+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.20052","created_at":"2026-06-02T03:05:03.933703+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVUTAB73TJQC","created_at":"2026-06-02T03:05:03.933703+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVUTAB73TJQCU4P5","created_at":"2026-06-02T03:05:03.933703+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVUTAB73","created_at":"2026-06-02T03:05:03.933703+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.19717","citing_title":"Qubit Routing for (Almost) Free","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR","json":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR.json","graph_json":"https://pith.science/api/pith-number/RVUTAB73TJQCU4P5KI25HJRADR/graph.json","events_json":"https://pith.science/api/pith-number/RVUTAB73TJQCU4P5KI25HJRADR/events.json","paper":"https://pith.science/paper/RVUTAB73"},"agent_actions":{"view_html":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR","download_json":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR.json","view_paper":"https://pith.science/paper/RVUTAB73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.20052&json=true","fetch_graph":"https://pith.science/api/pith-number/RVUTAB73TJQCU4P5KI25HJRADR/graph.json","fetch_events":"https://pith.science/api/pith-number/RVUTAB73TJQCU4P5KI25HJRADR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR/action/storage_attestation","attest_author":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR/action/author_attestation","sign_citation":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR/action/citation_signature","submit_replication":"https://pith.science/pith/RVUTAB73TJQCU4P5KI25HJRADR/action/replication_record"}},"created_at":"2026-06-02T03:05:03.933703+00:00","updated_at":"2026-06-02T03:05:03.933703+00:00"}