{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PLLIO2JKWXZKRGCGTGMS3TADPZ","short_pith_number":"pith:PLLIO2JK","schema_version":"1.0","canonical_sha256":"7ad687692ab5f2a8984699992dcc037e53c08bd84ff9d6fceb994e2ba023cc98","source":{"kind":"arxiv","id":"2109.06770","version":4},"attestation_state":"computed","paper":{"title":"Approaching the theoretical limit in quantum gate decomposition","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"P\\'eter Rakyta, Zolt\\'an Zimbor\\'as","submitted_at":"2021-09-14T15:36:22Z","abstract_excerpt":"In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns out that $15$ and $63$ $CNOT$ gates are sufficient to decompose a general $3$- and $4$-qubit unitary, respectively, with high numerical accuracy. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be ado"},"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":"2109.06770","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2021-09-14T15:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"6462b2a19013e0ba137f79f310a71cda20a618aeab1c73b00ed2d6c9834fb8cc","abstract_canon_sha256":"1c58fe87398502a83a3603b5f4fd97c1e1730a16be32866c776c814e3c858382"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:12.754260Z","signature_b64":"v5GSdYfKOjGfbCszB+3wIn+24ZmGpR6xf79HPvJa/fT6dbTmFujG3JHNKpmmTsWb3up9dVtIteGqw/z41sYUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad687692ab5f2a8984699992dcc037e53c08bd84ff9d6fceb994e2ba023cc98","last_reissued_at":"2026-07-05T04:24:12.753722Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:12.753722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approaching the theoretical limit in quantum gate decomposition","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"P\\'eter Rakyta, Zolt\\'an Zimbor\\'as","submitted_at":"2021-09-14T15:36:22Z","abstract_excerpt":"In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns out that $15$ and $63$ $CNOT$ gates are sufficient to decompose a general $3$- and $4$-qubit unitary, respectively, with high numerical accuracy. Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition. In addition, the algorithm can be ado"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.06770","kind":"arxiv","version":4},"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/2109.06770/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":"2109.06770","created_at":"2026-07-05T04:24:12.753780+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.06770v4","created_at":"2026-07-05T04:24:12.753780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.06770","created_at":"2026-07-05T04:24:12.753780+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLLIO2JKWXZK","created_at":"2026-07-05T04:24:12.753780+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLLIO2JKWXZKRGCG","created_at":"2026-07-05T04:24:12.753780+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLLIO2JK","created_at":"2026-07-05T04:24:12.753780+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05395","citing_title":"Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ","json":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ.json","graph_json":"https://pith.science/api/pith-number/PLLIO2JKWXZKRGCGTGMS3TADPZ/graph.json","events_json":"https://pith.science/api/pith-number/PLLIO2JKWXZKRGCGTGMS3TADPZ/events.json","paper":"https://pith.science/paper/PLLIO2JK"},"agent_actions":{"view_html":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ","download_json":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ.json","view_paper":"https://pith.science/paper/PLLIO2JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.06770&json=true","fetch_graph":"https://pith.science/api/pith-number/PLLIO2JKWXZKRGCGTGMS3TADPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/PLLIO2JKWXZKRGCGTGMS3TADPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ/action/storage_attestation","attest_author":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ/action/author_attestation","sign_citation":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ/action/citation_signature","submit_replication":"https://pith.science/pith/PLLIO2JKWXZKRGCGTGMS3TADPZ/action/replication_record"}},"created_at":"2026-07-05T04:24:12.753780+00:00","updated_at":"2026-07-05T04:24:12.753780+00:00"}