{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZS44K2OWHD2O4I37KSFW4ZN2JK","short_pith_number":"pith:ZS44K2OW","schema_version":"1.0","canonical_sha256":"ccb9c569d638f4ee237f548b6e65ba4a8d2225b30b1b14c6485a926e25418a98","source":{"kind":"arxiv","id":"2109.13223","version":1},"attestation_state":"computed","paper":{"title":"Quantum-gate decomposer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ken M. Nakanishi, Synge Todo, Takahiko satoh","submitted_at":"2021-09-27T17:51:03Z","abstract_excerpt":"Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates, under several qubit connectivities. We can construct the CCZ gate with only four CZ-depth when the qubit is square-shaped, including one auxiliary qubit. In T-shaped qubit connectivity, which has no closed loop, we can decompose the CCCZ gate with 17 CZ gates. While previous studies have shown a CCCZ gate decomposition with 14 CZ gates for the fully connected ca"},"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.13223","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-09-27T17:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"da579db478d91bebe0a63af30d599e6684908e10f8ef3700cdd2fe2b7a104e0c","abstract_canon_sha256":"583e8640fed4a17d3a005744f420be6bd2b1fb3ae7dad8a9cf203b181ab722f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:42.790011Z","signature_b64":"JPCWUgDc/T2nsrO1Wodq0/NYy99GjxuNt3ZAXeDuPBcoCVvnsS4EQvwF1+X2tarZB5+nUGMB9q4J7PC5ezcmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccb9c569d638f4ee237f548b6e65ba4a8d2225b30b1b14c6485a926e25418a98","last_reissued_at":"2026-07-05T03:17:42.789518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:42.789518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-gate decomposer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ken M. Nakanishi, Synge Todo, Takahiko satoh","submitted_at":"2021-09-27T17:51:03Z","abstract_excerpt":"Efficient decompositions of multi-qubit gates are essential in NISQ applications, where the number of gates or the circuit depth is limited. This paper presents efficient decompositions of CCZ and CCCZ gates, typical multi-qubit gates, under several qubit connectivities. We can construct the CCZ gate with only four CZ-depth when the qubit is square-shaped, including one auxiliary qubit. In T-shaped qubit connectivity, which has no closed loop, we can decompose the CCCZ gate with 17 CZ gates. While previous studies have shown a CCCZ gate decomposition with 14 CZ gates for the fully connected ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.13223","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/2109.13223/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.13223","created_at":"2026-07-05T03:17:42.789591+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.13223v1","created_at":"2026-07-05T03:17:42.789591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.13223","created_at":"2026-07-05T03:17:42.789591+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS44K2OWHD2O","created_at":"2026-07-05T03:17:42.789591+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS44K2OWHD2O4I37","created_at":"2026-07-05T03:17:42.789591+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS44K2OW","created_at":"2026-07-05T03:17:42.789591+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00695","citing_title":"Multi-Controlled Quantum Gates in Linear Nearest Neighbor","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK","json":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK.json","graph_json":"https://pith.science/api/pith-number/ZS44K2OWHD2O4I37KSFW4ZN2JK/graph.json","events_json":"https://pith.science/api/pith-number/ZS44K2OWHD2O4I37KSFW4ZN2JK/events.json","paper":"https://pith.science/paper/ZS44K2OW"},"agent_actions":{"view_html":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK","download_json":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK.json","view_paper":"https://pith.science/paper/ZS44K2OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.13223&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS44K2OWHD2O4I37KSFW4ZN2JK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS44K2OWHD2O4I37KSFW4ZN2JK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK/action/storage_attestation","attest_author":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK/action/author_attestation","sign_citation":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK/action/citation_signature","submit_replication":"https://pith.science/pith/ZS44K2OWHD2O4I37KSFW4ZN2JK/action/replication_record"}},"created_at":"2026-07-05T03:17:42.789591+00:00","updated_at":"2026-07-05T03:17:42.789591+00:00"}