{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DGTZUVXY7LBHEKCISFEHPOJOT5","short_pith_number":"pith:DGTZUVXY","schema_version":"1.0","canonical_sha256":"19a79a56f8fac2722848914877b92e9f6cd13a292634d486ae9a7fe33ad3f85e","source":{"kind":"arxiv","id":"2406.05581","version":2},"attestation_state":"computed","paper":{"title":"Optimizing Gate Decomposition for High-Level Quantum Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eduardo I. Duzzioni, Evandro C. R. Rosa, Rafael de Santiago","submitted_at":"2024-06-08T21:36:08Z","abstract_excerpt":"This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit for phase correction. This reduces the number of CNOT gates required to decompose any multi-controlled quantum gate from $O(n^2)$ to at most $32n$. Additionally, we can reduce the number of CNOTs for multi-controlled Pauli gates from $16n$ to $12n$ and propose an optimization to reduce the number of controlled gates in high-level quantum programming. We have "},"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":"2406.05581","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-08T21:36:08Z","cross_cats_sorted":[],"title_canon_sha256":"6d31766308470e5dce099531f9a34f02d2c194c3557043b9b58423ceba9f2d06","abstract_canon_sha256":"fbb891f65cd3a0fb7fb9c5f251f38dfa182503ff789acbb74fd9722add29848f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:28:17.319406Z","signature_b64":"goddyXqZ5Mohf+QuunpFAWjDgME+8BYAHF7wm5wNagBHgHnIsx9sXcNjiYrn/X8XbICD1iwY5SYPAZklUU6UCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a79a56f8fac2722848914877b92e9f6cd13a292634d486ae9a7fe33ad3f85e","last_reissued_at":"2026-07-05T10:28:17.318486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:28:17.318486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Gate Decomposition for High-Level Quantum Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eduardo I. Duzzioni, Evandro C. R. Rosa, Rafael de Santiago","submitted_at":"2024-06-08T21:36:08Z","abstract_excerpt":"This paper presents novel methods for optimizing multi-controlled quantum gates, which naturally arise in high-level quantum programming. Our primary approach involves rewriting $U(2)$ gates as $SU(2)$ gates, utilizing one auxiliary qubit for phase correction. This reduces the number of CNOT gates required to decompose any multi-controlled quantum gate from $O(n^2)$ to at most $32n$. Additionally, we can reduce the number of CNOTs for multi-controlled Pauli gates from $16n$ to $12n$ and propose an optimization to reduce the number of controlled gates in high-level quantum programming. We have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05581","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/2406.05581/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":"2406.05581","created_at":"2026-07-05T10:28:17.318581+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05581v2","created_at":"2026-07-05T10:28:17.318581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05581","created_at":"2026-07-05T10:28:17.318581+00:00"},{"alias_kind":"pith_short_12","alias_value":"DGTZUVXY7LBH","created_at":"2026-07-05T10:28:17.318581+00:00"},{"alias_kind":"pith_short_16","alias_value":"DGTZUVXY7LBHEKCI","created_at":"2026-07-05T10:28:17.318581+00:00"},{"alias_kind":"pith_short_8","alias_value":"DGTZUVXY","created_at":"2026-07-05T10:28:17.318581+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.18533","citing_title":"A Time Optimization Framework for the Implementation of Robust and Low-latency Quantum Circuits","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5","json":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5.json","graph_json":"https://pith.science/api/pith-number/DGTZUVXY7LBHEKCISFEHPOJOT5/graph.json","events_json":"https://pith.science/api/pith-number/DGTZUVXY7LBHEKCISFEHPOJOT5/events.json","paper":"https://pith.science/paper/DGTZUVXY"},"agent_actions":{"view_html":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5","download_json":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5.json","view_paper":"https://pith.science/paper/DGTZUVXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05581&json=true","fetch_graph":"https://pith.science/api/pith-number/DGTZUVXY7LBHEKCISFEHPOJOT5/graph.json","fetch_events":"https://pith.science/api/pith-number/DGTZUVXY7LBHEKCISFEHPOJOT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5/action/storage_attestation","attest_author":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5/action/author_attestation","sign_citation":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5/action/citation_signature","submit_replication":"https://pith.science/pith/DGTZUVXY7LBHEKCISFEHPOJOT5/action/replication_record"}},"created_at":"2026-07-05T10:28:17.318581+00:00","updated_at":"2026-07-05T10:28:17.318581+00:00"}