{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WC2EF3IO7AGYGALQJNSBYN3E5H","short_pith_number":"pith:WC2EF3IO","canonical_record":{"source":{"id":"2407.05162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T19:42:38Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"014b032c51d0048e1eadb8b408dfd4419377765cd9bc1d91c3b001a3f571b3ca","abstract_canon_sha256":"1762a50eca0aebdc5d98e52715bf44946a4b60766dd9ce4d61eace482e7aff8c"},"schema_version":"1.0"},"canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","source":{"kind":"arxiv","id":"2407.05162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05162","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05162v1","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05162","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"WC2EF3IO7AGY","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"pith_short_16","alias_value":"WC2EF3IO7AGYGALQ","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"pith_short_8","alias_value":"WC2EF3IO","created_at":"2026-07-05T08:41:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WC2EF3IO7AGYGALQJNSBYN3E5H","target":"record","payload":{"canonical_record":{"source":{"id":"2407.05162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T19:42:38Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"014b032c51d0048e1eadb8b408dfd4419377765cd9bc1d91c3b001a3f571b3ca","abstract_canon_sha256":"1762a50eca0aebdc5d98e52715bf44946a4b60766dd9ce4d61eace482e7aff8c"},"schema_version":"1.0"},"canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:08.621895Z","signature_b64":"e+Gezo3ez0KVHBP0CIvNt81HkMcfT+6NbnLOKCYNXvnA0zXOStD5zxVlCx8sMvwfu/WVl/JHnTNXtNi3dhFTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","last_reissued_at":"2026-07-05T08:41:08.621514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:08.621514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.05162","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spB+x+6am+yhaiGxt/XuKQSKmYhRpQV7VuwlykcLHO+UzsVXOuy9HpFMnAefTjxeXDiwrOykKHpIwjWDzQxDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:19:10.745647Z"},"content_sha256":"9befba78c2f29068a0050e562a0babb664f426167e366a0ab99a29d104133c20","schema_version":"1.0","event_id":"sha256:9befba78c2f29068a0050e562a0babb664f426167e366a0ab99a29d104133c20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WC2EF3IO7AGYGALQJNSBYN3E5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-depth Quantum Circuit Decomposition of Multi-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, Jefferson D. S. Silva, Thiago Melo D. Azevedo","submitted_at":"2024-07-06T19:42:38Z","abstract_excerpt":"Multi-controlled gates are fundamental components in the design of quantum algorithms, where efficient decompositions of these operators can enhance algorithm performance. The best asymptotic decomposition of an n-controlled X gate with one borrowed ancilla into single qubit and CNOT gates produces circuits with degree 3 polylogarithmic depth and employs a divide-and-conquer strategy. In this paper, we reduce the number of recursive calls in the divide-and-conquer algorithm and decrease the depth of n-controlled X gate decomposition to a degree of 2.799 polylogarithmic depth. With this optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05162","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/2407.05162/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5SOFeNyUxbsi5/C65xl+VzeWEi5b0GoV83IwRciwmiywt/XlP0rEVdHlJ0ZhxxgZlEUKPIL+f9oWqzXWZLZICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:19:10.746030Z"},"content_sha256":"11359a24b936c80e1636223f6757ccb44daad44f08fe7829b2a58495fef894fc","schema_version":"1.0","event_id":"sha256:11359a24b936c80e1636223f6757ccb44daad44f08fe7829b2a58495fef894fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/bundle.json","state_url":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T13:19:10Z","links":{"resolver":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H","bundle":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/bundle.json","state":"https://pith.science/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WC2EF3IO7AGYGALQJNSBYN3E5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WC2EF3IO7AGYGALQJNSBYN3E5H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1762a50eca0aebdc5d98e52715bf44946a4b60766dd9ce4d61eace482e7aff8c","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T19:42:38Z","title_canon_sha256":"014b032c51d0048e1eadb8b408dfd4419377765cd9bc1d91c3b001a3f571b3ca"},"schema_version":"1.0","source":{"id":"2407.05162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.05162","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"2407.05162v1","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05162","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"WC2EF3IO7AGY","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"pith_short_16","alias_value":"WC2EF3IO7AGYGALQ","created_at":"2026-07-05T08:41:08Z"},{"alias_kind":"pith_short_8","alias_value":"WC2EF3IO","created_at":"2026-07-05T08:41:08Z"}],"graph_snapshots":[{"event_id":"sha256:11359a24b936c80e1636223f6757ccb44daad44f08fe7829b2a58495fef894fc","target":"graph","created_at":"2026-07-05T08:41:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.05162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-controlled gates are fundamental components in the design of quantum algorithms, where efficient decompositions of these operators can enhance algorithm performance. The best asymptotic decomposition of an n-controlled X gate with one borrowed ancilla into single qubit and CNOT gates produces circuits with degree 3 polylogarithmic depth and employs a divide-and-conquer strategy. In this paper, we reduce the number of recursive calls in the divide-and-conquer algorithm and decrease the depth of n-controlled X gate decomposition to a degree of 2.799 polylogarithmic depth. With this optimiz","authors_text":"Adenilton J. da Silva, Jefferson D. S. Silva, Thiago Melo D. Azevedo","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T19:42:38Z","title":"Low-depth Quantum Circuit Decomposition of Multi-controlled Gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05162","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9befba78c2f29068a0050e562a0babb664f426167e366a0ab99a29d104133c20","target":"record","created_at":"2026-07-05T08:41:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1762a50eca0aebdc5d98e52715bf44946a4b60766dd9ce4d61eace482e7aff8c","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-06T19:42:38Z","title_canon_sha256":"014b032c51d0048e1eadb8b408dfd4419377765cd9bc1d91c3b001a3f571b3ca"},"schema_version":"1.0","source":{"id":"2407.05162","kind":"arxiv","version":1}},"canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0b442ed0ef80d8301704b641c3764e9f0d0c5c0abb8c39baa6aeefea7c928d3","first_computed_at":"2026-07-05T08:41:08.621514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:41:08.621514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e+Gezo3ez0KVHBP0CIvNt81HkMcfT+6NbnLOKCYNXvnA0zXOStD5zxVlCx8sMvwfu/WVl/JHnTNXtNi3dhFTCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:41:08.621895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.05162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9befba78c2f29068a0050e562a0babb664f426167e366a0ab99a29d104133c20","sha256:11359a24b936c80e1636223f6757ccb44daad44f08fe7829b2a58495fef894fc"],"state_sha256":"f241824328836cc7174eb743c445db04651e0f44ce4f4973c3ba7dc07d2c5511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qixN496QG/q+kv0e8ZS7RfkZOVE6yozIX2kMuXdTTpehk8vW5SudABita+R3SZ6wQilU7i4DIFZx9H2ppjABBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:19:10.748852Z","bundle_sha256":"a6de57b1650e8204c4fc7dbbbe194f26dbdd5f3c7a255f3d148ace11bdd6b74f"}}