{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WC2EF3IO7AGYGALQJNSBYN3E5H","short_pith_number":"pith:WC2EF3IO","schema_version":"1.0","canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","source":{"kind":"arxiv","id":"2407.05162","version":1},"attestation_state":"computed","paper":{"title":"Low-depth Quantum Circuit Decomposition of Multi-controlled Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Adenilton J. da Silva, Jefferson D. S. Silva, Thiago Melo D. Azevedo","submitted_at":"2024-07-06T19:42:38Z","abstract_excerpt":"Multi-controlled gates are fundamental components in the design of quantum algorithms, where efficient decompositions of these operators can enhance algorithm performance. The best asymptotic decomposition of an n-controlled X gate with one borrowed ancilla into single qubit and CNOT gates produces circuits with degree 3 polylogarithmic depth and employs a divide-and-conquer strategy. In this paper, we reduce the number of recursive calls in the divide-and-conquer algorithm and decrease the depth of n-controlled X gate decomposition to a degree of 2.799 polylogarithmic depth. With this optimiz"},"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":"2407.05162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T19:42:38Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"014b032c51d0048e1eadb8b408dfd4419377765cd9bc1d91c3b001a3f571b3ca","abstract_canon_sha256":"1762a50eca0aebdc5d98e52715bf44946a4b60766dd9ce4d61eace482e7aff8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:08.621895Z","signature_b64":"e+Gezo3ez0KVHBP0CIvNt81HkMcfT+6NbnLOKCYNXvnA0zXOStD5zxVlCx8sMvwfu/WVl/JHnTNXtNi3dhFTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","last_reissued_at":"2026-07-05T08:41:08.621514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:08.621514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-depth Quantum Circuit Decomposition of Multi-controlled Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Adenilton J. da Silva, Jefferson D. S. Silva, Thiago Melo D. Azevedo","submitted_at":"2024-07-06T19:42:38Z","abstract_excerpt":"Multi-controlled gates are fundamental components in the design of quantum algorithms, where efficient decompositions of these operators can enhance algorithm performance. The best asymptotic decomposition of an n-controlled X gate with one borrowed ancilla into single qubit and CNOT gates produces circuits with degree 3 polylogarithmic depth and employs a divide-and-conquer strategy. In this paper, we reduce the number of recursive calls in the divide-and-conquer algorithm and decrease the depth of n-controlled X gate decomposition to a degree of 2.799 polylogarithmic depth. With this optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05162","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.05162/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":"2407.05162","created_at":"2026-07-05T08:41:08.621578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05162v1","created_at":"2026-07-05T08:41:08.621578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05162","created_at":"2026-07-05T08:41:08.621578+00:00"},{"alias_kind":"pith_short_12","alias_value":"WC2EF3IO7AGY","created_at":"2026-07-05T08:41:08.621578+00:00"},{"alias_kind":"pith_short_16","alias_value":"WC2EF3IO7AGYGALQ","created_at":"2026-07-05T08:41:08.621578+00:00"},{"alias_kind":"pith_short_8","alias_value":"WC2EF3IO","created_at":"2026-07-05T08:41:08.621578+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/WC2EF3IO7AGYGALQJNSBYN3E5H","json":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H.json","graph_json":"https://pith.science/api/pith-number/WC2EF3IO7AGYGALQJNSBYN3E5H/graph.json","events_json":"https://pith.science/api/pith-number/WC2EF3IO7AGYGALQJNSBYN3E5H/events.json","paper":"https://pith.science/paper/WC2EF3IO"},"agent_actions":{"view_html":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H","download_json":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H.json","view_paper":"https://pith.science/paper/WC2EF3IO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05162&json=true","fetch_graph":"https://pith.science/api/pith-number/WC2EF3IO7AGYGALQJNSBYN3E5H/graph.json","fetch_events":"https://pith.science/api/pith-number/WC2EF3IO7AGYGALQJNSBYN3E5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/action/storage_attestation","attest_author":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/action/author_attestation","sign_citation":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/action/citation_signature","submit_replication":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/action/replication_record"}},"created_at":"2026-07-05T08:41:08.621578+00:00","updated_at":"2026-07-05T08:41:08.621578+00:00"}