{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BNH62DGDXEVBJUUBV77VNINC6U","short_pith_number":"pith:BNH62DGD","schema_version":"1.0","canonical_sha256":"0b4fed0cc3b92a14d281afff56a1a2f51c5e6453b7d7f6548e7a52334292e53f","source":{"kind":"arxiv","id":"2508.04092","version":2},"attestation_state":"computed","paper":{"title":"A Lazy Resynthesis Approach for Simultaneous T Gate and Two-Qubit Gate Optimization of Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chung-Yang Ric Huang, Hsiang-Chun Yang, Hsin-Yu Chen, Mu-Te Lau","submitted_at":"2025-08-06T05:21:14Z","abstract_excerpt":"State-of-the-art quantum circuit optimization (QCO) algorithms for T-count reduction often lead to a substantial increase in two-qubit gate count (2Q-count) -- a drawback that existing 2Q-count optimization techniques struggle to address effectively. In this work, we propose a novel lazy resynthesis approach for modern tableau-based QCO flows that significantly mitigates the 2Q-gate surges commonly introduced during T-count optimization in Clifford+T circuits. Experimental results show that our approach reduces 2Q-count overhead by 54.8%, 15.3%, and 68.0% compared to tableau-based, ZX-calculus"},"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.04092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-06T05:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"1c6a17d278b4a5e8aad5089edf3c62a421b609b9ca276c7a645a1f0961e6a652","abstract_canon_sha256":"586e90735e27087df783d56d521d05e08ea28a92aab4e3b3b1c54e125c2267fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:20.993790Z","signature_b64":"Po8M1/iLnh1aIBLbMm3wFxoAlUHKHB/PCGT3Cbj2NXRL1JUAV4d9tO1ihh0kc5kuBMqIkh1gVtCefQO2k5isCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b4fed0cc3b92a14d281afff56a1a2f51c5e6453b7d7f6548e7a52334292e53f","last_reissued_at":"2026-07-05T11:55:20.993367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:20.993367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lazy Resynthesis Approach for Simultaneous T Gate and Two-Qubit Gate Optimization of Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chung-Yang Ric Huang, Hsiang-Chun Yang, Hsin-Yu Chen, Mu-Te Lau","submitted_at":"2025-08-06T05:21:14Z","abstract_excerpt":"State-of-the-art quantum circuit optimization (QCO) algorithms for T-count reduction often lead to a substantial increase in two-qubit gate count (2Q-count) -- a drawback that existing 2Q-count optimization techniques struggle to address effectively. In this work, we propose a novel lazy resynthesis approach for modern tableau-based QCO flows that significantly mitigates the 2Q-gate surges commonly introduced during T-count optimization in Clifford+T circuits. Experimental results show that our approach reduces 2Q-count overhead by 54.8%, 15.3%, and 68.0% compared to tableau-based, ZX-calculus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04092","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/2508.04092/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.04092","created_at":"2026-07-05T11:55:20.993425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04092v2","created_at":"2026-07-05T11:55:20.993425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04092","created_at":"2026-07-05T11:55:20.993425+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNH62DGDXEVB","created_at":"2026-07-05T11:55:20.993425+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNH62DGDXEVBJUUB","created_at":"2026-07-05T11:55:20.993425+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNH62DGD","created_at":"2026-07-05T11:55:20.993425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02727","citing_title":"Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02727","citing_title":"Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U","json":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U.json","graph_json":"https://pith.science/api/pith-number/BNH62DGDXEVBJUUBV77VNINC6U/graph.json","events_json":"https://pith.science/api/pith-number/BNH62DGDXEVBJUUBV77VNINC6U/events.json","paper":"https://pith.science/paper/BNH62DGD"},"agent_actions":{"view_html":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U","download_json":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U.json","view_paper":"https://pith.science/paper/BNH62DGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04092&json=true","fetch_graph":"https://pith.science/api/pith-number/BNH62DGDXEVBJUUBV77VNINC6U/graph.json","fetch_events":"https://pith.science/api/pith-number/BNH62DGDXEVBJUUBV77VNINC6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U/action/storage_attestation","attest_author":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U/action/author_attestation","sign_citation":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U/action/citation_signature","submit_replication":"https://pith.science/pith/BNH62DGDXEVBJUUBV77VNINC6U/action/replication_record"}},"created_at":"2026-07-05T11:55:20.993425+00:00","updated_at":"2026-07-05T11:55:20.993425+00:00"}