{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ERAP3LFNVH6DAER47FGHO63RUE","short_pith_number":"pith:ERAP3LFN","schema_version":"1.0","canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","source":{"kind":"arxiv","id":"1906.06400","version":1},"attestation_state":"computed","paper":{"title":"Clifford Gate Optimisation and T Gate Scheduling: Using Queueing Models for Topological Assemblies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Robert Basmadjian","submitted_at":"2019-06-14T20:57:45Z","abstract_excerpt":"Clifford gates play a role in the optimisation of Clifford+T circuits. Reducing the count and the depth of Clifford gates, as well as the optimal scheduling of T gates, influence the hardware and the time costs of executing quantum circuits. This work focuses on circuits protected by the surface quantum error-correcting code. The result of compiling a quantum circuit for the surface code is called a topological assembly. We use queuing theory to model a part of the compiled assemblies, evaluate the models, and make the empiric observation that at least for certain Clifford+T circuits (e.g. add"},"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":"1906.06400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-14T20:57:45Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"2a79b32151353c739d898bef40cd195e6b771443ed61c3bb80a82c4ebdcc4910","abstract_canon_sha256":"f90bf39e9a9b834c27d1b78e899ae726f7b03dc96a16cb6830bf9e4653fbee34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.811923Z","signature_b64":"VdhCloLcTvmvJbTfaAjSxuDpKtRqbB+eSDuVPJNxqlrBmWnQ9mGWYzGSPw8LTBQ3MD6A/xZaFvXc3vOrepMrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2440fdacada9fc30123cf94c777b71a128aec168f54fa62646c4b45b2060c8ae","last_reissued_at":"2026-05-17T23:43:13.811496Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.811496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clifford Gate Optimisation and T Gate Scheduling: Using Queueing Models for Topological Assemblies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alexandru Paler, Robert Basmadjian","submitted_at":"2019-06-14T20:57:45Z","abstract_excerpt":"Clifford gates play a role in the optimisation of Clifford+T circuits. Reducing the count and the depth of Clifford gates, as well as the optimal scheduling of T gates, influence the hardware and the time costs of executing quantum circuits. This work focuses on circuits protected by the surface quantum error-correcting code. The result of compiling a quantum circuit for the surface code is called a topological assembly. We use queuing theory to model a part of the compiled assemblies, evaluate the models, and make the empiric observation that at least for certain Clifford+T circuits (e.g. add"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06400","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":"1906.06400","created_at":"2026-05-17T23:43:13.811563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.06400v1","created_at":"2026-05-17T23:43:13.811563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06400","created_at":"2026-05-17T23:43:13.811563+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERAP3LFNVH6D","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERAP3LFNVH6DAER4","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERAP3LFN","created_at":"2026-05-18T12:33:15.570797+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/ERAP3LFNVH6DAER47FGHO63RUE","json":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE.json","graph_json":"https://pith.science/api/pith-number/ERAP3LFNVH6DAER47FGHO63RUE/graph.json","events_json":"https://pith.science/api/pith-number/ERAP3LFNVH6DAER47FGHO63RUE/events.json","paper":"https://pith.science/paper/ERAP3LFN"},"agent_actions":{"view_html":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE","download_json":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE.json","view_paper":"https://pith.science/paper/ERAP3LFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.06400&json=true","fetch_graph":"https://pith.science/api/pith-number/ERAP3LFNVH6DAER47FGHO63RUE/graph.json","fetch_events":"https://pith.science/api/pith-number/ERAP3LFNVH6DAER47FGHO63RUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/action/storage_attestation","attest_author":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/action/author_attestation","sign_citation":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/action/citation_signature","submit_replication":"https://pith.science/pith/ERAP3LFNVH6DAER47FGHO63RUE/action/replication_record"}},"created_at":"2026-05-17T23:43:13.811563+00:00","updated_at":"2026-05-17T23:43:13.811563+00:00"}