{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HYFL5PHA6AYLUTZ74HT4IQ2DNY","short_pith_number":"pith:HYFL5PHA","schema_version":"1.0","canonical_sha256":"3e0abebce0f030ba4f3fe1e7c443436e339ac6f013260366645c65bd183f4146","source":{"kind":"arxiv","id":"1206.3223","version":1},"attestation_state":"computed","paper":{"title":"A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore","submitted_at":"2012-06-14T19:42:55Z","abstract_excerpt":"Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit quantum circuits, and the corresponding rules for exactly reducing an arbitrary single-qubit circuit to this canonical form. We focus on the single-qubit universal H,T basis due to its role in fault-tolerant quantum computing, and show how our formalism might be extended to other universal bases. We then extend our canonical representation to the family of S"},"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":"1206.3223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-14T19:42:55Z","cross_cats_sorted":[],"title_canon_sha256":"47b19e569e98aa13f974d388ccaba2d506df8114151beb81e6d57031a229ed6c","abstract_canon_sha256":"c064554c4b5b085e8d6e7022749e85578190bdcd3767e2c991a2df29b17a67a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:43.765620Z","signature_b64":"cQzIJTonNUvTPFt0G1BQnt26GAH7iJeGVQHoAip0Kp9WxEzLDUmfHHXmT6y6u7QG2xba3fN6jeuzr0bvO33kAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e0abebce0f030ba4f3fe1e7c443436e339ac6f013260366645c65bd183f4146","last_reissued_at":"2026-05-18T03:38:43.765046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:43.765046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore","submitted_at":"2012-06-14T19:42:55Z","abstract_excerpt":"Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit quantum circuits, and the corresponding rules for exactly reducing an arbitrary single-qubit circuit to this canonical form. We focus on the single-qubit universal H,T basis due to its role in fault-tolerant quantum computing, and show how our formalism might be extended to other universal bases. We then extend our canonical representation to the family of S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3223","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":"1206.3223","created_at":"2026-05-18T03:38:43.765126+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3223v1","created_at":"2026-05-18T03:38:43.765126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3223","created_at":"2026-05-18T03:38:43.765126+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYFL5PHA6AYL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYFL5PHA6AYLUTZ7","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYFL5PHA","created_at":"2026-05-18T12:27:09.501522+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/HYFL5PHA6AYLUTZ74HT4IQ2DNY","json":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY.json","graph_json":"https://pith.science/api/pith-number/HYFL5PHA6AYLUTZ74HT4IQ2DNY/graph.json","events_json":"https://pith.science/api/pith-number/HYFL5PHA6AYLUTZ74HT4IQ2DNY/events.json","paper":"https://pith.science/paper/HYFL5PHA"},"agent_actions":{"view_html":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY","download_json":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY.json","view_paper":"https://pith.science/paper/HYFL5PHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3223&json=true","fetch_graph":"https://pith.science/api/pith-number/HYFL5PHA6AYLUTZ74HT4IQ2DNY/graph.json","fetch_events":"https://pith.science/api/pith-number/HYFL5PHA6AYLUTZ74HT4IQ2DNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY/action/storage_attestation","attest_author":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY/action/author_attestation","sign_citation":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY/action/citation_signature","submit_replication":"https://pith.science/pith/HYFL5PHA6AYLUTZ74HT4IQ2DNY/action/replication_record"}},"created_at":"2026-05-18T03:38:43.765126+00:00","updated_at":"2026-05-18T03:38:43.765126+00:00"}