{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BIF4JWPQJO7NKDVTIEGOLPX6WQ","short_pith_number":"pith:BIF4JWPQ","schema_version":"1.0","canonical_sha256":"0a0bc4d9f04bbed50eb3410ce5befeb4290655493dfc5924eacfc757c153cb6c","source":{"kind":"arxiv","id":"2203.11882","version":2},"attestation_state":"computed","paper":{"title":"Linear-depth quantum circuits for multiqubit 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, Daniel K. Park","submitted_at":"2022-03-22T16:57:59Z","abstract_excerpt":"Quantum circuit depth minimization is critical for practical applications of circuit-based quantum computation. In this work, we present a systematic procedure to decompose multiqubit controlled unitary gates, which is essential in many quantum algorithms, to controlled-NOT and single-qubit gates with which the quantum circuit depth only increases linearly with the number of control qubits. Our algorithm does not require any ancillary qubits and achieves a quadratic reduction of the circuit depth against known methods. We show the advantage of our algorithm with proof-of-principle experiments "},"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":"2203.11882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-03-22T16:57:59Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"ec84d7985332f75476ef3fd9991470085b5f47c4144c8ec9108d02eb13454d48","abstract_canon_sha256":"89895e7dc9664cc2378e5cf07b44bc0c8dabde3978e1856fbd1271ef00829f98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:36.433101Z","signature_b64":"Zevn9a3ucwXgyKeb2GAj9UDkLiVGPlPV90p2kjPN0gzmowEbOyx2YObJS8KnRwHnNcQPgO9E2mYF7RmO92zQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a0bc4d9f04bbed50eb3410ce5befeb4290655493dfc5924eacfc757c153cb6c","last_reissued_at":"2026-07-05T05:03:36.432680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:36.432680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-depth quantum circuits for multiqubit 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, Daniel K. Park","submitted_at":"2022-03-22T16:57:59Z","abstract_excerpt":"Quantum circuit depth minimization is critical for practical applications of circuit-based quantum computation. In this work, we present a systematic procedure to decompose multiqubit controlled unitary gates, which is essential in many quantum algorithms, to controlled-NOT and single-qubit gates with which the quantum circuit depth only increases linearly with the number of control qubits. Our algorithm does not require any ancillary qubits and achieves a quadratic reduction of the circuit depth against known methods. We show the advantage of our algorithm with proof-of-principle experiments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.11882","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/2203.11882/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":"2203.11882","created_at":"2026-07-05T05:03:36.432735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.11882v2","created_at":"2026-07-05T05:03:36.432735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.11882","created_at":"2026-07-05T05:03:36.432735+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIF4JWPQJO7N","created_at":"2026-07-05T05:03:36.432735+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIF4JWPQJO7NKDVT","created_at":"2026-07-05T05:03:36.432735+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIF4JWPQ","created_at":"2026-07-05T05:03:36.432735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27482","citing_title":"Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ","json":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ.json","graph_json":"https://pith.science/api/pith-number/BIF4JWPQJO7NKDVTIEGOLPX6WQ/graph.json","events_json":"https://pith.science/api/pith-number/BIF4JWPQJO7NKDVTIEGOLPX6WQ/events.json","paper":"https://pith.science/paper/BIF4JWPQ"},"agent_actions":{"view_html":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ","download_json":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ.json","view_paper":"https://pith.science/paper/BIF4JWPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.11882&json=true","fetch_graph":"https://pith.science/api/pith-number/BIF4JWPQJO7NKDVTIEGOLPX6WQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BIF4JWPQJO7NKDVTIEGOLPX6WQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ/action/storage_attestation","attest_author":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ/action/author_attestation","sign_citation":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ/action/citation_signature","submit_replication":"https://pith.science/pith/BIF4JWPQJO7NKDVTIEGOLPX6WQ/action/replication_record"}},"created_at":"2026-07-05T05:03:36.432735+00:00","updated_at":"2026-07-05T05:03:36.432735+00:00"}