{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TYRX5M3D3L6EZSNUM2KFLLIIP3","short_pith_number":"pith:TYRX5M3D","schema_version":"1.0","canonical_sha256":"9e237eb363dafc4cc9b4669455ad087eda51b1cc80e4eb170d1dda37279194a7","source":{"kind":"arxiv","id":"1903.12456","version":1},"attestation_state":"computed","paper":{"title":"Optimizing T gates in Clifford+T circuit as $\\pi/4$ rotations around Paulis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fang Zhang, Jianxin Chen","submitted_at":"2019-03-29T11:55:10Z","abstract_excerpt":"In this work, we introduce a new circuit optimization technique to reduce the number of T gates in Clifford+T circuits by treating T gates conjugated by Clifford gates as $\\frac{\\pi}{4}$-rotations around Pauli operators. The tested benchmarks shows up to $71.43\\%$ and an average $42.67\\%$ reduction in T-count, both surpass the best performance reported. The worst case complexity of our algorithm is $O(nk^2)$ where $n$ is the number of qubits and $k$ is the number of T gates in the original Clifford+T circuit."},"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":"1903.12456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-29T11:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"9b1e6c0859051d0016c1d44fa509eb050fbcf03ada5b5008bdd3a8e1012b49fb","abstract_canon_sha256":"4454b3fcf912aa15a2ee25e7315851e62a6a8e9fbb47ff7de65a502d6a70a287"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.981549Z","signature_b64":"6a1FnBvOrT6h30EGOBsNhIVjO5IDz7oTI5feJa5w+tg6l09RULxEv9gJFDIkcK+oJ4M18dB3khmCRUuJTwQVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e237eb363dafc4cc9b4669455ad087eda51b1cc80e4eb170d1dda37279194a7","last_reissued_at":"2026-05-17T23:49:53.981162Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.981162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing T gates in Clifford+T circuit as $\\pi/4$ rotations around Paulis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fang Zhang, Jianxin Chen","submitted_at":"2019-03-29T11:55:10Z","abstract_excerpt":"In this work, we introduce a new circuit optimization technique to reduce the number of T gates in Clifford+T circuits by treating T gates conjugated by Clifford gates as $\\frac{\\pi}{4}$-rotations around Pauli operators. The tested benchmarks shows up to $71.43\\%$ and an average $42.67\\%$ reduction in T-count, both surpass the best performance reported. The worst case complexity of our algorithm is $O(nk^2)$ where $n$ is the number of qubits and $k$ is the number of T gates in the original Clifford+T circuit."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12456","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":""},"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":"1903.12456","created_at":"2026-05-17T23:49:53.981224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12456v1","created_at":"2026-05-17T23:49:53.981224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12456","created_at":"2026-05-17T23:49:53.981224+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYRX5M3D3L6E","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYRX5M3D3L6EZSNU","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYRX5M3D","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3","json":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3.json","graph_json":"https://pith.science/api/pith-number/TYRX5M3D3L6EZSNUM2KFLLIIP3/graph.json","events_json":"https://pith.science/api/pith-number/TYRX5M3D3L6EZSNUM2KFLLIIP3/events.json","paper":"https://pith.science/paper/TYRX5M3D"},"agent_actions":{"view_html":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3","download_json":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3.json","view_paper":"https://pith.science/paper/TYRX5M3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12456&json=true","fetch_graph":"https://pith.science/api/pith-number/TYRX5M3D3L6EZSNUM2KFLLIIP3/graph.json","fetch_events":"https://pith.science/api/pith-number/TYRX5M3D3L6EZSNUM2KFLLIIP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3/action/storage_attestation","attest_author":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3/action/author_attestation","sign_citation":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3/action/citation_signature","submit_replication":"https://pith.science/pith/TYRX5M3D3L6EZSNUM2KFLLIIP3/action/replication_record"}},"created_at":"2026-05-17T23:49:53.981224+00:00","updated_at":"2026-05-17T23:49:53.981224+00:00"}