{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:NZ277E4C7XUS4HDELSXRRQCSG6","short_pith_number":"pith:NZ277E4C","schema_version":"1.0","canonical_sha256":"6e75ff9382fde92e1c645caf18c05237a6d464692b147b47ca73472c11357fd3","source":{"kind":"arxiv","id":"quant-ph/0405098","version":2},"attestation_state":"computed","paper":{"title":"Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Julia Kempe, Oded Regev, Seth Lloyd, Wim van Dam, Zeph Landau","submitted_at":"2004-05-18T08:30:59Z","abstract_excerpt":"Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the centra"},"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/0405098","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-05-18T08:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"74581748681b3ff2dbc5430a6f47f46af9657da1bf9b0c77c0fe9ead0f54bb48","abstract_canon_sha256":"229148c0c9d998350c6811d5c4540dc001f581b62e7ff7c77a35be6a22f34812"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:05:46.448456Z","signature_b64":"RyGfYeyNzAmax1Q2IAE9UySk/FMlp8xlSIdi2a1bZ2tON96pFsEyirMiV+KsGKMhJHy/n+Da+O7zEtufYetDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e75ff9382fde92e1c645caf18c05237a6d464692b147b47ca73472c11357fd3","last_reissued_at":"2026-07-04T15:05:46.448026Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:05:46.448026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dorit Aharonov, Julia Kempe, Oded Regev, Seth Lloyd, Wim van Dam, Zeph Landau","submitted_at":"2004-05-18T08:30:59Z","abstract_excerpt":"Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the centra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0405098","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/0405098/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/0405098","created_at":"2026-07-04T15:05:46.448095+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0405098v2","created_at":"2026-07-04T15:05:46.448095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0405098","created_at":"2026-07-04T15:05:46.448095+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZ277E4C7XUS","created_at":"2026-07-04T15:05:46.448095+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZ277E4C7XUS4HDE","created_at":"2026-07-04T15:05:46.448095+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZ277E4C","created_at":"2026-07-04T15:05:46.448095+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/NZ277E4C7XUS4HDELSXRRQCSG6","json":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6.json","graph_json":"https://pith.science/api/pith-number/NZ277E4C7XUS4HDELSXRRQCSG6/graph.json","events_json":"https://pith.science/api/pith-number/NZ277E4C7XUS4HDELSXRRQCSG6/events.json","paper":"https://pith.science/paper/NZ277E4C"},"agent_actions":{"view_html":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6","download_json":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6.json","view_paper":"https://pith.science/paper/NZ277E4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0405098&json=true","fetch_graph":"https://pith.science/api/pith-number/NZ277E4C7XUS4HDELSXRRQCSG6/graph.json","fetch_events":"https://pith.science/api/pith-number/NZ277E4C7XUS4HDELSXRRQCSG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6/action/storage_attestation","attest_author":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6/action/author_attestation","sign_citation":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6/action/citation_signature","submit_replication":"https://pith.science/pith/NZ277E4C7XUS4HDELSXRRQCSG6/action/replication_record"}},"created_at":"2026-07-04T15:05:46.448095+00:00","updated_at":"2026-07-04T15:05:46.448095+00:00"}