{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C4IEBMYFNL3ZYLIWGDWCQOXL66","short_pith_number":"pith:C4IEBMYF","schema_version":"1.0","canonical_sha256":"171040b3056af79c2d1630ec283aebf7bacb9288c2a634aa46116d60bf635109","source":{"kind":"arxiv","id":"1803.05047","version":2},"attestation_state":"computed","paper":{"title":"Canonical forms for single-qutrit Clifford+T operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew N. Glaudell, Jacob M. Taylor, Neil J. Ross","submitted_at":"2018-03-13T21:09:22Z","abstract_excerpt":"We introduce canonical forms for single qutrit Clifford+T circuits and prove that every single-qutrit Clifford+T operator admits a unique such canonical form. We show that our canonical forms are T-optimal in the sense that among all the single-qutrit Clifford+T circuits implementing a given operator our canonical form uses the least number of T gates. Finally, we provide an algorithm which inputs the description of an operator (as a matrix or a circuit) and constructs the canonical form for this operator. The algorithm runs in time linear in the number of T gates. Our results provide a higher"},"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":"1803.05047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-03-13T21:09:22Z","cross_cats_sorted":[],"title_canon_sha256":"a97f761eadfe7396da75e87a4643cd5267cae7ce3255fa7aca775ec08c96362e","abstract_canon_sha256":"d791945c69b1a6cd04b417ce31c97ed1290ec540b750aec67cb296fb5966c061"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:02.983000Z","signature_b64":"UOSExkR4tytLM2NHdFuXU8R66Eh0Jy2exzWfvHGJD5VCZUFzdl0ZlxKfbIoa/Mzvra3Ah+UB/BCEwDEeE8deDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"171040b3056af79c2d1630ec283aebf7bacb9288c2a634aa46116d60bf635109","last_reissued_at":"2026-07-04T23:58:02.982587Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:02.982587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Canonical forms for single-qutrit Clifford+T operators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew N. Glaudell, Jacob M. Taylor, Neil J. Ross","submitted_at":"2018-03-13T21:09:22Z","abstract_excerpt":"We introduce canonical forms for single qutrit Clifford+T circuits and prove that every single-qutrit Clifford+T operator admits a unique such canonical form. We show that our canonical forms are T-optimal in the sense that among all the single-qutrit Clifford+T circuits implementing a given operator our canonical form uses the least number of T gates. Finally, we provide an algorithm which inputs the description of an operator (as a matrix or a circuit) and constructs the canonical form for this operator. The algorithm runs in time linear in the number of T gates. Our results provide a higher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05047","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/1803.05047/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":"1803.05047","created_at":"2026-07-04T23:58:02.982642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05047v2","created_at":"2026-07-04T23:58:02.982642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05047","created_at":"2026-07-04T23:58:02.982642+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4IEBMYFNL3Z","created_at":"2026-07-04T23:58:02.982642+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4IEBMYFNL3ZYLIW","created_at":"2026-07-04T23:58:02.982642+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4IEBMYF","created_at":"2026-07-04T23:58:02.982642+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/C4IEBMYFNL3ZYLIWGDWCQOXL66","json":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66.json","graph_json":"https://pith.science/api/pith-number/C4IEBMYFNL3ZYLIWGDWCQOXL66/graph.json","events_json":"https://pith.science/api/pith-number/C4IEBMYFNL3ZYLIWGDWCQOXL66/events.json","paper":"https://pith.science/paper/C4IEBMYF"},"agent_actions":{"view_html":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66","download_json":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66.json","view_paper":"https://pith.science/paper/C4IEBMYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05047&json=true","fetch_graph":"https://pith.science/api/pith-number/C4IEBMYFNL3ZYLIWGDWCQOXL66/graph.json","fetch_events":"https://pith.science/api/pith-number/C4IEBMYFNL3ZYLIWGDWCQOXL66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66/action/storage_attestation","attest_author":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66/action/author_attestation","sign_citation":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66/action/citation_signature","submit_replication":"https://pith.science/pith/C4IEBMYFNL3ZYLIWGDWCQOXL66/action/replication_record"}},"created_at":"2026-07-04T23:58:02.982642+00:00","updated_at":"2026-07-04T23:58:02.982642+00:00"}