{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:QSFW3KCQQU6XPI7BVVMFEPL3QO","short_pith_number":"pith:QSFW3KCQ","schema_version":"1.0","canonical_sha256":"848b6da850853d77a3e1ad58523d7b839bdc00433259e8bafab062fbac42dacd","source":{"kind":"arxiv","id":"1005.3034","version":1},"attestation_state":"computed","paper":{"title":"Fast quantum algorithms for traversing paths of eigenstates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill, R.D. Somma, S. Boixo","submitted_at":"2010-05-17T20:17:05Z","abstract_excerpt":"Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this problem have applications ranging from quantum physics simulation to optimization. For Hamiltonians, the conventional way of doing this is by applying the adiabatic theorem. We give ``digital'' methods for performing the transformation that require no assumption on path continuity or differentiability other than the absence of large jumps. Given sufficient in"},"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":"1005.3034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-17T20:17:05Z","cross_cats_sorted":[],"title_canon_sha256":"67a9f37966b79973d267a9c9751411896b217b683471d2a936ae8760aed8ba4a","abstract_canon_sha256":"801908fff3281a8ad68d933b7986204e473a05d40fcf822150a9b4f03a939afd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:56.722795Z","signature_b64":"mh5zqcENer4nlq+K3N9oe7ck3sc7vIYmuaXoALCKROG2EwEvgBs72yXPLujKiUgS0Imq+6phVG89Jos+dKmYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"848b6da850853d77a3e1ad58523d7b839bdc00433259e8bafab062fbac42dacd","last_reissued_at":"2026-05-18T02:23:56.722140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:56.722140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast quantum algorithms for traversing paths of eigenstates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"E. Knill, R.D. Somma, S. Boixo","submitted_at":"2010-05-17T20:17:05Z","abstract_excerpt":"Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this problem have applications ranging from quantum physics simulation to optimization. For Hamiltonians, the conventional way of doing this is by applying the adiabatic theorem. We give ``digital'' methods for performing the transformation that require no assumption on path continuity or differentiability other than the absence of large jumps. Given sufficient in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.3034","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":""},"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":"1005.3034","created_at":"2026-05-18T02:23:56.722240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.3034v1","created_at":"2026-05-18T02:23:56.722240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.3034","created_at":"2026-05-18T02:23:56.722240+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSFW3KCQQU6X","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSFW3KCQQU6XPI7B","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSFW3KCQ","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/QSFW3KCQQU6XPI7BVVMFEPL3QO","json":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO.json","graph_json":"https://pith.science/api/pith-number/QSFW3KCQQU6XPI7BVVMFEPL3QO/graph.json","events_json":"https://pith.science/api/pith-number/QSFW3KCQQU6XPI7BVVMFEPL3QO/events.json","paper":"https://pith.science/paper/QSFW3KCQ"},"agent_actions":{"view_html":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO","download_json":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO.json","view_paper":"https://pith.science/paper/QSFW3KCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.3034&json=true","fetch_graph":"https://pith.science/api/pith-number/QSFW3KCQQU6XPI7BVVMFEPL3QO/graph.json","fetch_events":"https://pith.science/api/pith-number/QSFW3KCQQU6XPI7BVVMFEPL3QO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO/action/storage_attestation","attest_author":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO/action/author_attestation","sign_citation":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO/action/citation_signature","submit_replication":"https://pith.science/pith/QSFW3KCQQU6XPI7BVVMFEPL3QO/action/replication_record"}},"created_at":"2026-05-18T02:23:56.722240+00:00","updated_at":"2026-05-18T02:23:56.722240+00:00"}