{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5SAZUWW2V6SFPE245HWV6CLDOF","short_pith_number":"pith:5SAZUWW2","schema_version":"1.0","canonical_sha256":"ec819a5adaafa457935ce9ed5f0963716cd71ca6190327d52810eb55a2dc5ca0","source":{"kind":"arxiv","id":"1003.5760","version":2},"attestation_state":"computed","paper":{"title":"Quantum-state preparation with universal gate decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Martin Plesch, \\v{C}aslav Brukner","submitted_at":"2010-03-30T08:22:41Z","abstract_excerpt":"In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when judging the complexity of the circuit: the total number of CNOT gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitr"},"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":"1003.5760","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-03-30T08:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"acf873e2780c13e2d7930c81427afc776a3b32d5e2203128cc9a1df3f5fe14e2","abstract_canon_sha256":"7d1011d186d26857030321ad0256ca973c8796d055d74c35b02c8760b9d33be0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:27.117942Z","signature_b64":"GS8sGFTja/cyJBB0Y/qqOLJ3abnFbAjin+n7wSpXk41ultdj6nRZ7eB1vvlajgsoNaMpHYb0KohNyfhlTx4BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec819a5adaafa457935ce9ed5f0963716cd71ca6190327d52810eb55a2dc5ca0","last_reissued_at":"2026-05-18T04:27:27.117357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:27.117357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-state preparation with universal gate decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Martin Plesch, \\v{C}aslav Brukner","submitted_at":"2010-03-30T08:22:41Z","abstract_excerpt":"In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when judging the complexity of the circuit: the total number of CNOT gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.5760","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":""},"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":"1003.5760","created_at":"2026-05-18T04:27:27.117434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.5760v2","created_at":"2026-05-18T04:27:27.117434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.5760","created_at":"2026-05-18T04:27:27.117434+00:00"},{"alias_kind":"pith_short_12","alias_value":"5SAZUWW2V6SF","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5SAZUWW2V6SFPE24","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5SAZUWW2","created_at":"2026-05-18T12:26:04.259169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF","json":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF.json","graph_json":"https://pith.science/api/pith-number/5SAZUWW2V6SFPE245HWV6CLDOF/graph.json","events_json":"https://pith.science/api/pith-number/5SAZUWW2V6SFPE245HWV6CLDOF/events.json","paper":"https://pith.science/paper/5SAZUWW2"},"agent_actions":{"view_html":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF","download_json":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF.json","view_paper":"https://pith.science/paper/5SAZUWW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.5760&json=true","fetch_graph":"https://pith.science/api/pith-number/5SAZUWW2V6SFPE245HWV6CLDOF/graph.json","fetch_events":"https://pith.science/api/pith-number/5SAZUWW2V6SFPE245HWV6CLDOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF/action/storage_attestation","attest_author":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF/action/author_attestation","sign_citation":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF/action/citation_signature","submit_replication":"https://pith.science/pith/5SAZUWW2V6SFPE245HWV6CLDOF/action/replication_record"}},"created_at":"2026-05-18T04:27:27.117434+00:00","updated_at":"2026-05-18T04:27:27.117434+00:00"}