{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:STFOR2Y4SQ75K7KYAHD4OFH5OD","short_pith_number":"pith:STFOR2Y4","schema_version":"1.0","canonical_sha256":"94cae8eb1c943fd57d5801c7c714fd70d04d76cba7d76125eef0eddf92fc03dc","source":{"kind":"arxiv","id":"1905.10481","version":1},"attestation_state":"computed","paper":{"title":"Asymptotic Improvements to Quantum Circuits via Qutrits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Casey Duckering, Frederic T. Chong, Jonathan M. Baker, Kenneth R. Brown, Natalie C. Brown, Pranav Gokhale","submitted_at":"2019-05-24T23:31:30Z","abstract_excerpt":"Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\\log_2(3)$ binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla--a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qub"},"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":"1905.10481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-24T23:31:30Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"5fe9839056f805e76bc2cfe680e855be302352ef4c221639f154f7fab71c0e86","abstract_canon_sha256":"f4c67cdfd19509c68661e2a8937655fed4ddef5d1f1460a137c7a4c04455b4d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:08.393243Z","signature_b64":"0pKjrYLY324Ebf/pmwBiGasRwicN70rTzGxS1idw4Mp0ziIUzjXgErHvbE1m7GucXq54Ac5jKk1BD5SxpF3WCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94cae8eb1c943fd57d5801c7c714fd70d04d76cba7d76125eef0eddf92fc03dc","last_reissued_at":"2026-05-17T23:45:08.392726Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:08.392726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Improvements to Quantum Circuits via Qutrits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Casey Duckering, Frederic T. Chong, Jonathan M. Baker, Kenneth R. Brown, Natalie C. Brown, Pranav Gokhale","submitted_at":"2019-05-24T23:31:30Z","abstract_excerpt":"Quantum computation is traditionally expressed in terms of quantum bits, or qubits. In this work, we instead consider three-level qu$trits$. Past work with qutrits has demonstrated only constant factor improvements, owing to the $\\log_2(3)$ binary-to-ternary compression factor. We present a novel technique using qutrits to achieve a logarithmic depth (runtime) decomposition of the Generalized Toffoli gate using no ancilla--a significant improvement over linear depth for the best qubit-only equivalent. Our circuit construction also features a 70x improvement in two-qudit gate count over the qub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10481","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":"1905.10481","created_at":"2026-05-17T23:45:08.392808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10481v1","created_at":"2026-05-17T23:45:08.392808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10481","created_at":"2026-05-17T23:45:08.392808+00:00"},{"alias_kind":"pith_short_12","alias_value":"STFOR2Y4SQ75","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"STFOR2Y4SQ75K7KY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"STFOR2Y4","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27015","citing_title":"Congestion-free routing on quantum chips","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD","json":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD.json","graph_json":"https://pith.science/api/pith-number/STFOR2Y4SQ75K7KYAHD4OFH5OD/graph.json","events_json":"https://pith.science/api/pith-number/STFOR2Y4SQ75K7KYAHD4OFH5OD/events.json","paper":"https://pith.science/paper/STFOR2Y4"},"agent_actions":{"view_html":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD","download_json":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD.json","view_paper":"https://pith.science/paper/STFOR2Y4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10481&json=true","fetch_graph":"https://pith.science/api/pith-number/STFOR2Y4SQ75K7KYAHD4OFH5OD/graph.json","fetch_events":"https://pith.science/api/pith-number/STFOR2Y4SQ75K7KYAHD4OFH5OD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/action/storage_attestation","attest_author":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/action/author_attestation","sign_citation":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/action/citation_signature","submit_replication":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/action/replication_record"}},"created_at":"2026-05-17T23:45:08.392808+00:00","updated_at":"2026-05-17T23:45:08.392808+00:00"}