{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NVCGWTLO5ECTGXQZYOEVTCGPWV","short_pith_number":"pith:NVCGWTLO","schema_version":"1.0","canonical_sha256":"6d446b4d6ee905335e19c3895988cfb568da9b04d3d82d26ec1ddf736b4e6124","source":{"kind":"arxiv","id":"2011.09495","version":1},"attestation_state":"computed","paper":{"title":"(Sub)Exponential advantage of adiabatic quantum computation with no sign problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Umesh Vazirani","submitted_at":"2020-11-18T19:04:51Z","abstract_excerpt":"We demonstrate the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem. This strengthens the superpolynomial separation recently proved by Hastings. The Hamiltonian that exhibits this speed-up comes from the adjacency matrix of an undirected graph, and we can view the adiabatic evolution as an efficient $\\mathcal{O}(\\mathrm{poly}(n))$-time quantum algorithm for finding a specific \"EXIT\" vertex in the graph given the \"ENTRANCE\" vertex. On the other hand we show that if the graph is given via an adjac"},"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":"2011.09495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-18T19:04:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cc400b97ddac7d9db45b81f1f96fa37295afc4260fe2086ce858900899642378","abstract_canon_sha256":"02c229194d73096071c443ad125baa55d68ef264454817f24e1f139a04b65a04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:49.158061Z","signature_b64":"8zIPFUjoZxz+pTVEhbvwjSOsJ1+NBhigdqISOPZGpvGk5UX/fDkbvILyXWFFuXXQ1jm2dQ3SKZah0/mVCZ5BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d446b4d6ee905335e19c3895988cfb568da9b04d3d82d26ec1ddf736b4e6124","last_reissued_at":"2026-07-05T01:52:49.157583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:49.157583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Sub)Exponential advantage of adiabatic quantum computation with no sign problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Umesh Vazirani","submitted_at":"2020-11-18T19:04:51Z","abstract_excerpt":"We demonstrate the possibility of (sub)exponential quantum speedup via a quantum algorithm that follows an adiabatic path of a gapped Hamiltonian with no sign problem. This strengthens the superpolynomial separation recently proved by Hastings. The Hamiltonian that exhibits this speed-up comes from the adjacency matrix of an undirected graph, and we can view the adiabatic evolution as an efficient $\\mathcal{O}(\\mathrm{poly}(n))$-time quantum algorithm for finding a specific \"EXIT\" vertex in the graph given the \"ENTRANCE\" vertex. On the other hand we show that if the graph is given via an adjac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09495","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/2011.09495/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":"2011.09495","created_at":"2026-07-05T01:52:49.157640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.09495v1","created_at":"2026-07-05T01:52:49.157640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09495","created_at":"2026-07-05T01:52:49.157640+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVCGWTLO5ECT","created_at":"2026-07-05T01:52:49.157640+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVCGWTLO5ECTGXQZ","created_at":"2026-07-05T01:52:49.157640+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVCGWTLO","created_at":"2026-07-05T01:52:49.157640+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09995","citing_title":"Quantum resources in non-stoquastic quantum annealing","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV","json":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV.json","graph_json":"https://pith.science/api/pith-number/NVCGWTLO5ECTGXQZYOEVTCGPWV/graph.json","events_json":"https://pith.science/api/pith-number/NVCGWTLO5ECTGXQZYOEVTCGPWV/events.json","paper":"https://pith.science/paper/NVCGWTLO"},"agent_actions":{"view_html":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV","download_json":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV.json","view_paper":"https://pith.science/paper/NVCGWTLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.09495&json=true","fetch_graph":"https://pith.science/api/pith-number/NVCGWTLO5ECTGXQZYOEVTCGPWV/graph.json","fetch_events":"https://pith.science/api/pith-number/NVCGWTLO5ECTGXQZYOEVTCGPWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV/action/storage_attestation","attest_author":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV/action/author_attestation","sign_citation":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV/action/citation_signature","submit_replication":"https://pith.science/pith/NVCGWTLO5ECTGXQZYOEVTCGPWV/action/replication_record"}},"created_at":"2026-07-05T01:52:49.157640+00:00","updated_at":"2026-07-05T01:52:49.157640+00:00"}