{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:XSXWM6YXK2SPKZZFOPJDCI2AUF","short_pith_number":"pith:XSXWM6YX","schema_version":"1.0","canonical_sha256":"bcaf667b1756a4f5672573d2312340a1488074ea137b0ea552352919594e27e0","source":{"kind":"arxiv","id":"quant-ph/0001106","version":1},"attestation_state":"computed","paper":{"title":"Quantum Computation by Adiabatic Evolution","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Jeffrey Goldstone, Michael Sipser, Sam Gutmann","submitted_at":"2000-01-28T22:12:03Z","abstract_excerpt":"We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are un"},"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/0001106","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2000-01-28T22:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"9ac596acf778415031df1cc67a3ec7d7ca39100e813dda224770c4978428b437","abstract_canon_sha256":"66600702bf356548a5c237d6bc1559b0e45ff8a53f7526e624a70e2402bc22a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:26.373511Z","signature_b64":"qsVnVCFPQw6Eucy3eriSXmT8azBG5Gs6O54E49pjdkkgs0sRzoUIXfrWZ6Fl0ud8PGYC/gsrcl+fbW4xwAYRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcaf667b1756a4f5672573d2312340a1488074ea137b0ea552352919594e27e0","last_reissued_at":"2026-07-04T14:45:26.373114Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:26.373114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computation by Adiabatic Evolution","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Edward Farhi, Jeffrey Goldstone, Michael Sipser, Sam Gutmann","submitted_at":"2000-01-28T22:12:03Z","abstract_excerpt":"We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0001106","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0001106/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/0001106","created_at":"2026-07-04T14:45:26.373166+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0001106v1","created_at":"2026-07-04T14:45:26.373166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0001106","created_at":"2026-07-04T14:45:26.373166+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSXWM6YXK2SP","created_at":"2026-07-04T14:45:26.373166+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSXWM6YXK2SPKZZF","created_at":"2026-07-04T14:45:26.373166+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSXWM6YX","created_at":"2026-07-04T14:45:26.373166+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":59,"internal_anchor_count":47,"sample":[{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26870","citing_title":"Dissipation-Induced Deviations from Kibble-Zurek Scaling in Non-Hermitian Quantum Annealing","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13481","citing_title":"Towards a Control interpretation of Quantum Advantage","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2606.13481","citing_title":"Towards a Control interpretation of Quantum Advantage","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12968","citing_title":"Quantum-Driven Neuromorphic Computing for Million-Qubit-Scale Workloads","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2606.12310","citing_title":"Partitioned Iterative Quantum Scheduling of Satellites for Urgent Disaster Response: Case study of Wildfire","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09706","citing_title":"Leveraging Landau-Zener-St\\\"uckelberg interference for accelerating diabatic quantum annealing","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22744","citing_title":"Quantum circuit design via dynamic Pauli constraints","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07084","citing_title":"Projector Quantum Variational Ansatz","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05815","citing_title":"Engineered dissipation for faster adiabatic state preparation","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2607.01037","citing_title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2606.05297","citing_title":"Continuous-variable ADAPT-VQE for bosonic lattice models","ref_index":102,"is_internal_anchor":true},{"citing_arxiv_id":"2606.03405","citing_title":"Quantum annealing for materials","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2606.01403","citing_title":"Spatial Search by Nonlinear Quantum Walk","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14719","citing_title":"A Toolbox to Understand the Physics of Quantum Data Management","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2606.26297","citing_title":"A Distributed Quantum Approximate Optimization Algorithm Simulator for Engineering Design Optimization","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30110","citing_title":"Alternative adiabatic quantum dynamics with algorithmic applications","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2606.02721","citing_title":"Simulating Condensed Matter Physics on Quantum Hardware","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2208.13557","citing_title":"Controlled Gate Networks: Theory and Application to Eigenvalue Estimation","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2307.00791","citing_title":"Proof of avoidability of the quantum first-order transition in transverse magnetization in quantum annealing of finite-dimensional spin glasses","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2404.19497","citing_title":"Light Cone Cancellation for Variational Quantum Eigensolver in Solving Noisy Max-Cut","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2408.07774","citing_title":"Elevating Variational Quantum Semidefinite Programs for Polynomial Objectives","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2505.00087","citing_title":"Quantum Glassiness From Efficient Learning","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF","json":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF.json","graph_json":"https://pith.science/api/pith-number/XSXWM6YXK2SPKZZFOPJDCI2AUF/graph.json","events_json":"https://pith.science/api/pith-number/XSXWM6YXK2SPKZZFOPJDCI2AUF/events.json","paper":"https://pith.science/paper/XSXWM6YX"},"agent_actions":{"view_html":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF","download_json":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF.json","view_paper":"https://pith.science/paper/XSXWM6YX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0001106&json=true","fetch_graph":"https://pith.science/api/pith-number/XSXWM6YXK2SPKZZFOPJDCI2AUF/graph.json","fetch_events":"https://pith.science/api/pith-number/XSXWM6YXK2SPKZZFOPJDCI2AUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF/action/storage_attestation","attest_author":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF/action/author_attestation","sign_citation":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF/action/citation_signature","submit_replication":"https://pith.science/pith/XSXWM6YXK2SPKZZFOPJDCI2AUF/action/replication_record"}},"created_at":"2026-07-04T14:45:26.373166+00:00","updated_at":"2026-07-04T14:45:26.373166+00:00"}