{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XLII6HHBR4ITR6IEUHDFHBBJHM","short_pith_number":"pith:XLII6HHB","schema_version":"1.0","canonical_sha256":"bad08f1ce18f1138f904a1c65384293b3d434b2e1ec79db6e4a4d01e4fd9644e","source":{"kind":"arxiv","id":"2209.14501","version":2},"attestation_state":"computed","paper":{"title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Tongyang Li, Weijie J. Su, Yizhou Liu","submitted_at":"2022-09-29T01:39:20Z","abstract_excerpt":"Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the global effect of quantum tunneling. Specifically, we introduce a quantum algorithm termed the quantum tunneling walk (QTW) and apply it to nonconvex problems where local minima are approximately global minima. We show that QTW achieves quantum speedup over classical stochastic gradient descents (SGD) when the barriers between different local minima are high but"},"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":"2209.14501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-09-29T01:39:20Z","cross_cats_sorted":["cs.DS","cs.LG","math.OC"],"title_canon_sha256":"2c8efa57e667d78b151010e3a50bd68d66c4f416b192b40d414192815e6498c7","abstract_canon_sha256":"f3fdde1a47fe9c38bb63bfa400c4b16685428b35caf3a4393d354845fecd845b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:18:09.297383Z","signature_b64":"gIMdOBWzMm1zjdquFliSJahwYG3+My6yEiipwFlh0MKKjs8/TYumFrckN5yFal0G0rp75cC6ubVNP7uYMlrNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bad08f1ce18f1138f904a1c65384293b3d434b2e1ec79db6e4a4d01e4fd9644e","last_reissued_at":"2026-07-05T06:18:09.296936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:18:09.296936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Tongyang Li, Weijie J. Su, Yizhou Liu","submitted_at":"2022-09-29T01:39:20Z","abstract_excerpt":"Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the global effect of quantum tunneling. Specifically, we introduce a quantum algorithm termed the quantum tunneling walk (QTW) and apply it to nonconvex problems where local minima are approximately global minima. We show that QTW achieves quantum speedup over classical stochastic gradient descents (SGD) when the barriers between different local minima are high but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14501","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/2209.14501/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":"2209.14501","created_at":"2026-07-05T06:18:09.296991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.14501v2","created_at":"2026-07-05T06:18:09.296991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14501","created_at":"2026-07-05T06:18:09.296991+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLII6HHBR4IT","created_at":"2026-07-05T06:18:09.296991+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLII6HHBR4ITR6IE","created_at":"2026-07-05T06:18:09.296991+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLII6HHB","created_at":"2026-07-05T06:18:09.296991+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04438","citing_title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM","json":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM.json","graph_json":"https://pith.science/api/pith-number/XLII6HHBR4ITR6IEUHDFHBBJHM/graph.json","events_json":"https://pith.science/api/pith-number/XLII6HHBR4ITR6IEUHDFHBBJHM/events.json","paper":"https://pith.science/paper/XLII6HHB"},"agent_actions":{"view_html":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM","download_json":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM.json","view_paper":"https://pith.science/paper/XLII6HHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.14501&json=true","fetch_graph":"https://pith.science/api/pith-number/XLII6HHBR4ITR6IEUHDFHBBJHM/graph.json","fetch_events":"https://pith.science/api/pith-number/XLII6HHBR4ITR6IEUHDFHBBJHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM/action/storage_attestation","attest_author":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM/action/author_attestation","sign_citation":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM/action/citation_signature","submit_replication":"https://pith.science/pith/XLII6HHBR4ITR6IEUHDFHBBJHM/action/replication_record"}},"created_at":"2026-07-05T06:18:09.296991+00:00","updated_at":"2026-07-05T06:18:09.296991+00:00"}