{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KV662PO4Y3G5B23RQGRMJFVODA","short_pith_number":"pith:KV662PO4","schema_version":"1.0","canonical_sha256":"557ded3ddcc6cdd0eb7181a2c496ae18283ae0739508725b19efe43727b88666","source":{"kind":"arxiv","id":"2506.00695","version":2},"attestation_state":"computed","paper":{"title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Zindorf, Sougato Bose","submitted_at":"2025-05-31T20:01:21Z","abstract_excerpt":"Multi-controlled single-target (MC) gates are some of the most crucial building blocks for varied quantum algorithms. How to implement them optimally is thus a pivotal question. To answer this question in an architecture-independent manner, and to get a worst-case estimate, we should look at a linear nearest-neighbor (LNN) architecture, as this can be embedded in almost any qubit connectivity. Motivated by the above, here we describe a method which implements MC gates using no more than $\\sim 4k+8n$ CNOT gates -- up-to $60\\%$ reduction over state-of-the-art -- while allowing for complete flexi"},"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":"2506.00695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-31T20:01:21Z","cross_cats_sorted":[],"title_canon_sha256":"4a0f9a82685814fa51a4330168695169b36c00773133e345fde4997227c8648d","abstract_canon_sha256":"334bb3ac0834191395e2f9ed6212d775d87b4886fe8572743ea0d868c405646a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:12.294029Z","signature_b64":"mJ09gU5ovhDqhb/l5FFq7Fq8kU1S41jrL1AYXhvalt8Ql07K63lcuYwceTm+gG7m5LncR+FCQWlmzwZCrNS5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557ded3ddcc6cdd0eb7181a2c496ae18283ae0739508725b19efe43727b88666","last_reissued_at":"2026-07-05T11:29:12.291507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:12.291507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Zindorf, Sougato Bose","submitted_at":"2025-05-31T20:01:21Z","abstract_excerpt":"Multi-controlled single-target (MC) gates are some of the most crucial building blocks for varied quantum algorithms. How to implement them optimally is thus a pivotal question. To answer this question in an architecture-independent manner, and to get a worst-case estimate, we should look at a linear nearest-neighbor (LNN) architecture, as this can be embedded in almost any qubit connectivity. Motivated by the above, here we describe a method which implements MC gates using no more than $\\sim 4k+8n$ CNOT gates -- up-to $60\\%$ reduction over state-of-the-art -- while allowing for complete flexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00695","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/2506.00695/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":"2506.00695","created_at":"2026-07-05T11:29:12.293491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00695v2","created_at":"2026-07-05T11:29:12.293491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00695","created_at":"2026-07-05T11:29:12.293491+00:00"},{"alias_kind":"pith_short_12","alias_value":"KV662PO4Y3G5","created_at":"2026-07-05T11:29:12.293491+00:00"},{"alias_kind":"pith_short_16","alias_value":"KV662PO4Y3G5B23R","created_at":"2026-07-05T11:29:12.293491+00:00"},{"alias_kind":"pith_short_8","alias_value":"KV662PO4","created_at":"2026-07-05T11:29:12.293491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24973","citing_title":"Approximate Sparse State Preparation with the Grover-Rudolph Algorithm","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA","json":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA.json","graph_json":"https://pith.science/api/pith-number/KV662PO4Y3G5B23RQGRMJFVODA/graph.json","events_json":"https://pith.science/api/pith-number/KV662PO4Y3G5B23RQGRMJFVODA/events.json","paper":"https://pith.science/paper/KV662PO4"},"agent_actions":{"view_html":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA","download_json":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA.json","view_paper":"https://pith.science/paper/KV662PO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00695&json=true","fetch_graph":"https://pith.science/api/pith-number/KV662PO4Y3G5B23RQGRMJFVODA/graph.json","fetch_events":"https://pith.science/api/pith-number/KV662PO4Y3G5B23RQGRMJFVODA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA/action/storage_attestation","attest_author":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA/action/author_attestation","sign_citation":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA/action/citation_signature","submit_replication":"https://pith.science/pith/KV662PO4Y3G5B23RQGRMJFVODA/action/replication_record"}},"created_at":"2026-07-05T11:29:12.293491+00:00","updated_at":"2026-07-05T11:29:12.293491+00:00"}