{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:NJBQU5OA6QYYWSDB3ZUVJDOCCS","short_pith_number":"pith:NJBQU5OA","schema_version":"1.0","canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","source":{"kind":"arxiv","id":"quant-ph/0602174","version":2},"attestation_state":"computed","paper":{"title":"Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"P. B. M. Sousa, R. V. Ramos","submitted_at":"2006-02-21T19:41:05Z","abstract_excerpt":"Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ"},"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":"quant-ph/0602174","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-02-21T19:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"f1364fa348827173203f4f808be24b6a9511cceedcc09717bbb505e2e873dcd3","abstract_canon_sha256":"b5417ef3fdb28bfd7630c05893805c2310a7d136e73dc22eba168b81e4329ce9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:53:31.060489Z","signature_b64":"8RGg4DblyoTFZOEe4xVbr5MXTF4KPRjbheSGTPIaVHgiwbcAYYRUAgv2NGPA/d6GlAsmM1Dj7Rn6dG2cYOL1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a430a75c0f4318b4861de69548dc214b6d3d382e4ad17d49221ac9b7531be76","last_reissued_at":"2026-07-04T14:53:31.060054Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:53:31.060054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"P. B. M. Sousa, R. V. Ramos","submitted_at":"2006-02-21T19:41:05Z","abstract_excerpt":"Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a differ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0602174","kind":"arxiv","version":2},"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/quant-ph/0602174/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":"quant-ph/0602174","created_at":"2026-07-04T14:53:31.060120+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0602174v2","created_at":"2026-07-04T14:53:31.060120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0602174","created_at":"2026-07-04T14:53:31.060120+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJBQU5OA6QYY","created_at":"2026-07-04T14:53:31.060120+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJBQU5OA6QYYWSDB","created_at":"2026-07-04T14:53:31.060120+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJBQU5OA","created_at":"2026-07-04T14:53:31.060120+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22550","citing_title":"Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS","json":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS.json","graph_json":"https://pith.science/api/pith-number/NJBQU5OA6QYYWSDB3ZUVJDOCCS/graph.json","events_json":"https://pith.science/api/pith-number/NJBQU5OA6QYYWSDB3ZUVJDOCCS/events.json","paper":"https://pith.science/paper/NJBQU5OA"},"agent_actions":{"view_html":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS","download_json":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS.json","view_paper":"https://pith.science/paper/NJBQU5OA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0602174&json=true","fetch_graph":"https://pith.science/api/pith-number/NJBQU5OA6QYYWSDB3ZUVJDOCCS/graph.json","fetch_events":"https://pith.science/api/pith-number/NJBQU5OA6QYYWSDB3ZUVJDOCCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/action/storage_attestation","attest_author":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/action/author_attestation","sign_citation":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/action/citation_signature","submit_replication":"https://pith.science/pith/NJBQU5OA6QYYWSDB3ZUVJDOCCS/action/replication_record"}},"created_at":"2026-07-04T14:53:31.060120+00:00","updated_at":"2026-07-04T14:53:31.060120+00:00"}