{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4PICGFKSENETLPUHHU546E5BWF","short_pith_number":"pith:4PICGFKS","schema_version":"1.0","canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","source":{"kind":"arxiv","id":"1712.01557","version":3},"attestation_state":"computed","paper":{"title":"An Efficient Quantum Compiler that reduces $T$ count","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell, Luke Heyfron","submitted_at":"2017-12-05T10:19:30Z","abstract_excerpt":"Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count -- the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical"},"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":"1712.01557","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-12-05T10:19:30Z","cross_cats_sorted":[],"title_canon_sha256":"4d9bfe3e41a5ae27bbcefd116cc2f8fd1376a0496a083fd03049cc8e687fc7c7","abstract_canon_sha256":"5d88d7b6d59d2eb373b7876f991da8eb56065afd3ad323d0e985f26f5e25624e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.563199Z","signature_b64":"siX5o/kdxNG/TIpYd6RsIFV0qd12aseeC3v+Gr91a04TYhwwOapyZhF1AfGL6MNeGRAEdL8TmeaiUNlTV8T3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3d0231552234935be873d3bcf13a1b16c193e789698abde762a6ccecfeac2c3","last_reissued_at":"2026-05-18T00:14:00.562360Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.562360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Quantum Compiler that reduces $T$ count","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl T. Campbell, Luke Heyfron","submitted_at":"2017-12-05T10:19:30Z","abstract_excerpt":"Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum circuit decompositions for the same algorithm but it is desirable to compile leaner circuits. A fundamentally important cost metric is the $T$ count -- the number of $T$ gates in a circuit. For the single qubit case, optimal compiling is essentially a solved problem. However, multi-qubit compiling is a harder problem with optimal algorithms requiring classical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01557","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":""},"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":"1712.01557","created_at":"2026-05-18T00:14:00.562483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01557v3","created_at":"2026-05-18T00:14:00.562483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01557","created_at":"2026-05-18T00:14:00.562483+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PICGFKSENET","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PICGFKSENETLPUH","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PICGFKS","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.00683","citing_title":"Quantum Circuit Overhead","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.04758","citing_title":"Quantum Magic in early FTQC: From Diagonal Clifford Hierarchy No-Go Theorems to Architecture Design Blueprints","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF","json":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF.json","graph_json":"https://pith.science/api/pith-number/4PICGFKSENETLPUHHU546E5BWF/graph.json","events_json":"https://pith.science/api/pith-number/4PICGFKSENETLPUHHU546E5BWF/events.json","paper":"https://pith.science/paper/4PICGFKS"},"agent_actions":{"view_html":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF","download_json":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF.json","view_paper":"https://pith.science/paper/4PICGFKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01557&json=true","fetch_graph":"https://pith.science/api/pith-number/4PICGFKSENETLPUHHU546E5BWF/graph.json","fetch_events":"https://pith.science/api/pith-number/4PICGFKSENETLPUHHU546E5BWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/action/storage_attestation","attest_author":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/action/author_attestation","sign_citation":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/action/citation_signature","submit_replication":"https://pith.science/pith/4PICGFKSENETLPUHHU546E5BWF/action/replication_record"}},"created_at":"2026-05-18T00:14:00.562483+00:00","updated_at":"2026-05-18T00:14:00.562483+00:00"}