{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:53LPVZ3EZCXSYDJT2RBZETN3WC","short_pith_number":"pith:53LPVZ3E","schema_version":"1.0","canonical_sha256":"eed6fae764c8af2c0d33d443924dbbb09b685ee222d71cd955f8e5c15098e7eb","source":{"kind":"arxiv","id":"2402.05053","version":1},"attestation_state":"computed","paper":{"title":"Quantum circuit for multi-qubit Toffoli gate with optimal resource","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Junhong Nie, Wei Zi, Xiaoming Sun","submitted_at":"2024-02-07T17:53:21Z","abstract_excerpt":"Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are fundamental building blocks in the field of quantum computing and quantum simulation. We design new quantum circuits for the $n$-Toffoli gate and general multi-controlled unitary, which have only $O(\\log n)$-depth and $O(n)$-size, and only require $1$ ancillary qubit. To achieve these results, we explore the potential of ancillary qubits and discover a method to creat"},"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":"2402.05053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-07T17:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"b0683a89a826fa9e300758cfa8cf042367e31e16b2f2df856ff14aadb22c0279","abstract_canon_sha256":"cf2696c4a9dfeec0c10b934f6974a9f44be7ec953f53ccd0a41891cb9e1ac174"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:42:35.590248Z","signature_b64":"Z40KCfQo0UGUbVoJnHKs2ytDnqOKSFQDuwTBrjcRbN2DQeOpQ4sCCAu+i3wquUiwxGtZMiuIRTG5KiS7PUfKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eed6fae764c8af2c0d33d443924dbbb09b685ee222d71cd955f8e5c15098e7eb","last_reissued_at":"2026-07-05T07:42:35.589784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:42:35.589784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit for multi-qubit Toffoli gate with optimal resource","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Junhong Nie, Wei Zi, Xiaoming Sun","submitted_at":"2024-02-07T17:53:21Z","abstract_excerpt":"Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are fundamental building blocks in the field of quantum computing and quantum simulation. We design new quantum circuits for the $n$-Toffoli gate and general multi-controlled unitary, which have only $O(\\log n)$-depth and $O(n)$-size, and only require $1$ ancillary qubit. To achieve these results, we explore the potential of ancillary qubits and discover a method to creat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05053","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/2402.05053/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":"2402.05053","created_at":"2026-07-05T07:42:35.589858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05053v1","created_at":"2026-07-05T07:42:35.589858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05053","created_at":"2026-07-05T07:42:35.589858+00:00"},{"alias_kind":"pith_short_12","alias_value":"53LPVZ3EZCXS","created_at":"2026-07-05T07:42:35.589858+00:00"},{"alias_kind":"pith_short_16","alias_value":"53LPVZ3EZCXSYDJT","created_at":"2026-07-05T07:42:35.589858+00:00"},{"alias_kind":"pith_short_8","alias_value":"53LPVZ3E","created_at":"2026-07-05T07:42:35.589858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19971","citing_title":"Semantic Prompting: Agentic Incremental Narrative Refinement through Spatial Semantic Interaction","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21380","citing_title":"Modeling and Resource Optimization for Quantum Oracles","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18169","citing_title":"Adaptive Clifford+T Decomposition of Large Toffoli Gates with One Clean Ancilla","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25861","citing_title":"Minimum Toffoli depth for the multi-controlled Toffoli gate via teleportation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23535","citing_title":"A Fully Quantum Algorithm for Image Edge Detection","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC","json":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC.json","graph_json":"https://pith.science/api/pith-number/53LPVZ3EZCXSYDJT2RBZETN3WC/graph.json","events_json":"https://pith.science/api/pith-number/53LPVZ3EZCXSYDJT2RBZETN3WC/events.json","paper":"https://pith.science/paper/53LPVZ3E"},"agent_actions":{"view_html":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC","download_json":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC.json","view_paper":"https://pith.science/paper/53LPVZ3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05053&json=true","fetch_graph":"https://pith.science/api/pith-number/53LPVZ3EZCXSYDJT2RBZETN3WC/graph.json","fetch_events":"https://pith.science/api/pith-number/53LPVZ3EZCXSYDJT2RBZETN3WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC/action/storage_attestation","attest_author":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC/action/author_attestation","sign_citation":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC/action/citation_signature","submit_replication":"https://pith.science/pith/53LPVZ3EZCXSYDJT2RBZETN3WC/action/replication_record"}},"created_at":"2026-07-05T07:42:35.589858+00:00","updated_at":"2026-07-05T07:42:35.589858+00:00"}