{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PXC7HA3ZE6SDQLXOQBUGTRKZFW","short_pith_number":"pith:PXC7HA3Z","schema_version":"1.0","canonical_sha256":"7dc5f3837927a4382eee806869c5592d9a68faf448b63f6ec8eaed32af8377d7","source":{"kind":"arxiv","id":"1002.0420","version":2},"attestation_state":"computed","paper":{"title":"Universal 2-local Hamiltonian Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj","submitted_at":"2010-02-02T08:44:13Z","abstract_excerpt":"We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local qubit-qubit interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits. The computer runs in three steps - starts in a simple initial product-state, evolves it for time of order L^2 (up to logarithmic factors) and wraps up with a two-qubit measurement. Our model differs from the previous universal 2-local Hamilt"},"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":"1002.0420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-02T08:44:13Z","cross_cats_sorted":[],"title_canon_sha256":"0234c162eb3c872215770800ca842bb3474b89469290f26bef071811c73ed837","abstract_canon_sha256":"ba909b0386b4f6cf980b4946c93e8f74526ac2da3e4cc583f30250f130358f33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:23:37.858418Z","signature_b64":"IYys+ESf4/dyWFtpNmWJiRxgfqa565SdqpZrOe1wuAI51L58u1KOGqJf/YWateHmS72o69UpoPX1DX1cSI7+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dc5f3837927a4382eee806869c5592d9a68faf448b63f6ec8eaed32af8377d7","last_reissued_at":"2026-05-18T03:23:37.857596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:23:37.857596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal 2-local Hamiltonian Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel Nagaj","submitted_at":"2010-02-02T08:44:13Z","abstract_excerpt":"We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local qubit-qubit interaction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits. The computer runs in three steps - starts in a simple initial product-state, evolves it for time of order L^2 (up to logarithmic factors) and wraps up with a two-qubit measurement. Our model differs from the previous universal 2-local Hamilt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0420","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":"1002.0420","created_at":"2026-05-18T03:23:37.857723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0420v2","created_at":"2026-05-18T03:23:37.857723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0420","created_at":"2026-05-18T03:23:37.857723+00:00"},{"alias_kind":"pith_short_12","alias_value":"PXC7HA3ZE6SD","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PXC7HA3ZE6SDQLXO","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PXC7HA3Z","created_at":"2026-05-18T12:26:12.377268+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/PXC7HA3ZE6SDQLXOQBUGTRKZFW","json":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW.json","graph_json":"https://pith.science/api/pith-number/PXC7HA3ZE6SDQLXOQBUGTRKZFW/graph.json","events_json":"https://pith.science/api/pith-number/PXC7HA3ZE6SDQLXOQBUGTRKZFW/events.json","paper":"https://pith.science/paper/PXC7HA3Z"},"agent_actions":{"view_html":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW","download_json":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW.json","view_paper":"https://pith.science/paper/PXC7HA3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0420&json=true","fetch_graph":"https://pith.science/api/pith-number/PXC7HA3ZE6SDQLXOQBUGTRKZFW/graph.json","fetch_events":"https://pith.science/api/pith-number/PXC7HA3ZE6SDQLXOQBUGTRKZFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW/action/storage_attestation","attest_author":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW/action/author_attestation","sign_citation":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW/action/citation_signature","submit_replication":"https://pith.science/pith/PXC7HA3ZE6SDQLXOQBUGTRKZFW/action/replication_record"}},"created_at":"2026-05-18T03:23:37.857723+00:00","updated_at":"2026-05-18T03:23:37.857723+00:00"}