{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:STFOR2Y4SQ75K7KYAHD4OFH5OD","short_pith_number":"pith:STFOR2Y4","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"},"canonical_sha256":"94cae8eb1c943fd57d5801c7c714fd70d04d76cba7d76125eef0eddf92fc03dc","source":{"kind":"arxiv","id":"1905.10481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10481","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10481v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10481","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"STFOR2Y4SQ75","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"STFOR2Y4SQ75K7KY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"STFOR2Y4","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:STFOR2Y4SQ75K7KYAHD4OFH5OD","target":"record","payload":{"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"},"canonical_sha256":"94cae8eb1c943fd57d5801c7c714fd70d04d76cba7d76125eef0eddf92fc03dc","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"},"source_kind":"arxiv","source_id":"1905.10481","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BC0j98rl5Zifl0z84MCBiPbyEIm0rMVVz7O2CtViPlEM94DB/p241Zn/ocDFsZOrG0ZnGyDJ7wOayzftfPUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:59.631644Z"},"content_sha256":"66fdb5f5eaf717f8f642ddb95604c9b0562cba5948584d683aaf1237542b36a7","schema_version":"1.0","event_id":"sha256:66fdb5f5eaf717f8f642ddb95604c9b0562cba5948584d683aaf1237542b36a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:STFOR2Y4SQ75K7KYAHD4OFH5OD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUgmIcvurc5XLMkN38fwjXxOGyK+B6uPBadVSrJ7zAuPaHUJNtM4e9VcY96/lEDEw2JI/FWjah1lZODHWfk9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:59.631989Z"},"content_sha256":"8857302b965809b05ae9989814642825c67600133b7cf5c1647c1f454fda21b0","schema_version":"1.0","event_id":"sha256:8857302b965809b05ae9989814642825c67600133b7cf5c1647c1f454fda21b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/bundle.json","state_url":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T05:01:59Z","links":{"resolver":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD","bundle":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/bundle.json","state":"https://pith.science/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STFOR2Y4SQ75K7KYAHD4OFH5OD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:STFOR2Y4SQ75K7KYAHD4OFH5OD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f4c67cdfd19509c68661e2a8937655fed4ddef5d1f1460a137c7a4c04455b4d0","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-24T23:31:30Z","title_canon_sha256":"5fe9839056f805e76bc2cfe680e855be302352ef4c221639f154f7fab71c0e86"},"schema_version":"1.0","source":{"id":"1905.10481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10481","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10481v1","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10481","created_at":"2026-05-17T23:45:08Z"},{"alias_kind":"pith_short_12","alias_value":"STFOR2Y4SQ75","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"STFOR2Y4SQ75K7KY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"STFOR2Y4","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:8857302b965809b05ae9989814642825c67600133b7cf5c1647c1f454fda21b0","target":"graph","created_at":"2026-05-17T23:45:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Casey Duckering, Frederic T. Chong, Jonathan M. Baker, Kenneth R. Brown, Natalie C. Brown, Pranav Gokhale","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-24T23:31:30Z","title":"Asymptotic Improvements to Quantum Circuits via Qutrits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10481","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:66fdb5f5eaf717f8f642ddb95604c9b0562cba5948584d683aaf1237542b36a7","target":"record","created_at":"2026-05-17T23:45:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f4c67cdfd19509c68661e2a8937655fed4ddef5d1f1460a137c7a4c04455b4d0","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-24T23:31:30Z","title_canon_sha256":"5fe9839056f805e76bc2cfe680e855be302352ef4c221639f154f7fab71c0e86"},"schema_version":"1.0","source":{"id":"1905.10481","kind":"arxiv","version":1}},"canonical_sha256":"94cae8eb1c943fd57d5801c7c714fd70d04d76cba7d76125eef0eddf92fc03dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94cae8eb1c943fd57d5801c7c714fd70d04d76cba7d76125eef0eddf92fc03dc","first_computed_at":"2026-05-17T23:45:08.392726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:08.392726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0pKjrYLY324Ebf/pmwBiGasRwicN70rTzGxS1idw4Mp0ziIUzjXgErHvbE1m7GucXq54Ac5jKk1BD5SxpF3WCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:08.393243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66fdb5f5eaf717f8f642ddb95604c9b0562cba5948584d683aaf1237542b36a7","sha256:8857302b965809b05ae9989814642825c67600133b7cf5c1647c1f454fda21b0"],"state_sha256":"5274e83066e5c9eb6c17dee03de82824a7e4156d3c2ca92b7f938887ac37b561"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CY27BAjaB8pi5ACgc2xM3ZOPKoiWjpAvJzT6VE2u40lZjpTvzgPNdMi9MthgEWMswPq6xMALPrjs3rHP596rBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:01:59.634309Z","bundle_sha256":"18f69cfecce0ff766d90fd2eca6b3cc2ebd2f1f0cd95e1e5b76a016c723b5dfc"}}