{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AXQ4ERC2QVG7PAQMWGDUKREBU6","short_pith_number":"pith:AXQ4ERC2","schema_version":"1.0","canonical_sha256":"05e1c2445a854df7820cb187454481a784d88b44929ee29c621be682f7f2afda","source":{"kind":"arxiv","id":"1011.2159","version":1},"attestation_state":"computed","paper":{"title":"Block-based quantum-logic synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Mehdi Saeedi, Mehdi Sedighi (The first two authors contributed equally to this work), Mona Arabzadeh, Morteza Saheb Zamani","submitted_at":"2010-11-09T17:42:08Z","abstract_excerpt":"In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT g"},"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":"1011.2159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-09T17:42:08Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"8ff41f7613d79db2b7e1b2298a52878efdebfdf0dd0d5cbd6780e84b344d7285","abstract_canon_sha256":"667da0afba1a6c9a93417489b9d904bd223f5aa116e4a58e4045efecfad592b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:31.992363Z","signature_b64":"AHac73LwR/I4U7uKddkdNsXGLCrYTWLwvTRQ6RmZAZ2atRTAYrYNRUmBhl9RXGVsRso0ii8s0ZCN5q42UB/RBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05e1c2445a854df7820cb187454481a784d88b44929ee29c621be682f7f2afda","last_reissued_at":"2026-05-18T03:46:31.991442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:31.991442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block-based quantum-logic synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Mehdi Saeedi, Mehdi Sedighi (The first two authors contributed equally to this work), Mona Arabzadeh, Morteza Saheb Zamani","submitted_at":"2010-11-09T17:42:08Z","abstract_excerpt":"In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2159","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":""},"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":"1011.2159","created_at":"2026-05-18T03:46:31.991585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.2159v1","created_at":"2026-05-18T03:46:31.991585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2159","created_at":"2026-05-18T03:46:31.991585+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXQ4ERC2QVG7","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXQ4ERC2QVG7PAQM","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXQ4ERC2","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.00543","citing_title":"GULPS: Two-Qubit Gate Synthesis via Linear Programming for Heterogeneous Instruction Sets","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6","json":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6.json","graph_json":"https://pith.science/api/pith-number/AXQ4ERC2QVG7PAQMWGDUKREBU6/graph.json","events_json":"https://pith.science/api/pith-number/AXQ4ERC2QVG7PAQMWGDUKREBU6/events.json","paper":"https://pith.science/paper/AXQ4ERC2"},"agent_actions":{"view_html":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6","download_json":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6.json","view_paper":"https://pith.science/paper/AXQ4ERC2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.2159&json=true","fetch_graph":"https://pith.science/api/pith-number/AXQ4ERC2QVG7PAQMWGDUKREBU6/graph.json","fetch_events":"https://pith.science/api/pith-number/AXQ4ERC2QVG7PAQMWGDUKREBU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6/action/storage_attestation","attest_author":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6/action/author_attestation","sign_citation":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6/action/citation_signature","submit_replication":"https://pith.science/pith/AXQ4ERC2QVG7PAQMWGDUKREBU6/action/replication_record"}},"created_at":"2026-05-18T03:46:31.991585+00:00","updated_at":"2026-05-18T03:46:31.991585+00:00"}