{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZZBYE4M7NTSTHB6DWLPF7NHYON","short_pith_number":"pith:ZZBYE4M7","schema_version":"1.0","canonical_sha256":"ce4382719f6ce53387c3b2de5fb4f873660801ca0cca46701c37ade1b955b8a5","source":{"kind":"arxiv","id":"2310.14974","version":1},"attestation_state":"computed","paper":{"title":"Linear decomposition of approximate multi-controlled single qubit 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, Israel F. Araujo, Jefferson D. S. Silva, Thiago Melo D. Azevedo","submitted_at":"2023-10-23T14:23:08Z","abstract_excerpt":"We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and the previous best approximate approach without auxiliary qubits requires 32nk elementary operations, where k is a function that depends on the error threshold. The proposed decomposition depends on an optimization technique that minimizes the CNOT gate count for multi-target and multi-controlled CNOT and SU(2) gates. Computational experiments show the reducti"},"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":"2310.14974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-10-23T14:23:08Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"37a31ae44da16c93a22d1ead6249c856d8e7a3966543a72461ed881583bf248e","abstract_canon_sha256":"d66364315322a2ea2d018ca1518ed74d62ee07e97e82d7648f4f60b2bc5e1eb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:46.667202Z","signature_b64":"1W6blfAmqFiPyMclE5kRdNyKpCRWbqh7ja6mxbWNj22/P6ONOeoJjLQWUEQ9e13Yn6lk5Al7kyjN6jUHRIjkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce4382719f6ce53387c3b2de5fb4f873660801ca0cca46701c37ade1b955b8a5","last_reissued_at":"2026-07-05T11:29:46.666765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:46.666765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear decomposition of approximate multi-controlled single qubit 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, Israel F. Araujo, Jefferson D. S. Silva, Thiago Melo D. Azevedo","submitted_at":"2023-10-23T14:23:08Z","abstract_excerpt":"We provide a method for compiling approximate multi-controlled single qubit gates into quantum circuits without ancilla qubits. The total number of elementary gates to decompose an n-qubit multi-controlled gate is proportional to 32n, and the previous best approximate approach without auxiliary qubits requires 32nk elementary operations, where k is a function that depends on the error threshold. The proposed decomposition depends on an optimization technique that minimizes the CNOT gate count for multi-target and multi-controlled CNOT and SU(2) gates. Computational experiments show the reducti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14974","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/2310.14974/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":"2310.14974","created_at":"2026-07-05T11:29:46.666822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.14974v1","created_at":"2026-07-05T11:29:46.666822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14974","created_at":"2026-07-05T11:29:46.666822+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZBYE4M7NTST","created_at":"2026-07-05T11:29:46.666822+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZBYE4M7NTSTHB6D","created_at":"2026-07-05T11:29:46.666822+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZBYE4M7","created_at":"2026-07-05T11:29:46.666822+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.03955","citing_title":"Utilizing redundancies in Qubit Hilbert Space to reduce entangling gate counts in the Unitary Vibrational Coupled-Cluster Method","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON","json":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON.json","graph_json":"https://pith.science/api/pith-number/ZZBYE4M7NTSTHB6DWLPF7NHYON/graph.json","events_json":"https://pith.science/api/pith-number/ZZBYE4M7NTSTHB6DWLPF7NHYON/events.json","paper":"https://pith.science/paper/ZZBYE4M7"},"agent_actions":{"view_html":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON","download_json":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON.json","view_paper":"https://pith.science/paper/ZZBYE4M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.14974&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZBYE4M7NTSTHB6DWLPF7NHYON/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZBYE4M7NTSTHB6DWLPF7NHYON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON/action/storage_attestation","attest_author":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON/action/author_attestation","sign_citation":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON/action/citation_signature","submit_replication":"https://pith.science/pith/ZZBYE4M7NTSTHB6DWLPF7NHYON/action/replication_record"}},"created_at":"2026-07-05T11:29:46.666822+00:00","updated_at":"2026-07-05T11:29:46.666822+00:00"}