{"schema":"pith.reference-change-event.v1","doi":"10.1103/physrevlett.130.140601","canonical_url":"https://pith.science/event/10.1103/physrevlett.130.140601","json_url":"https://pith.science/event/10.1103/physrevlett.130.140601.json","not_a_judgment":"This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.","primary":{"event_id":216270,"doi":"10.1103/physrevlett.130.140601","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2023-04-05","title":"Lower Bounds on Quantum Annealing Times","work_title":"Lower Bounds on Quantum Annealing Times,","work_doi":"10.1103/physrevlett.130.140601","work_arxiv_id":null,"notice_doi":"10.1103/physrevlett.130.140601","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1103/physrevlett.130.140601","json_href":"/event/10.1103/physrevlett.130.140601.json"},"events":[{"event_id":216270,"doi":"10.1103/physrevlett.130.140601","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2023-04-05","title":"Lower Bounds on Quantum Annealing Times","work_title":"Lower Bounds on Quantum Annealing Times,","work_doi":"10.1103/physrevlett.130.140601","work_arxiv_id":null,"notice_doi":"10.1103/physrevlett.130.140601","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1103/physrevlett.130.140601","json_href":"/event/10.1103/physrevlett.130.140601.json"}],"flags":[{"id":2402,"status":"open","status_label":"Open","citing_arxiv_id":"2605.25132","citing_title":"Resource Management in Heterogeneous Quantum Repeater Networks","ref_index":59,"evidence_raw":"objectivevaluedistributiontomodifythestandardGroversearch,andcanbeunderstood as a specific instance of the broader QAOA framework. The main contribution, however, is a rigorous analysis of QAOA itself. In a work with my collaborators Andreas Bärtschi, Luis Pedro García-Pintos, John Golden, Nathan Lemons,andStephanEidenbenz,publishedinPhysicalReviewA[58],weutilizespeed limit results from quantum annealing [59] to derive some of the first analytical lower boundsonQAOA'sruntime. Thekeyresultofthisworkisshowingthattherequiredrun- timeisnotmonolithic;itcanrangefromconstant-timeforeasyproblemstopolynomial or even square-root scaling for unstructured search. Using these findings, I argue about the workload implications for a distributed datacenter model. This chapter discusses","evidence_cleaned":null,"evidence_source_label":"citation context","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2023-04-05","work_title":"Lower Bounds on Quantum Annealing Times,","work_doi":"10.1103/physrevlett.130.140601","event_doi":"10.1103/physrevlett.130.140601","flag_href":"/flags/2402","event_href":"/event/10.1103/physrevlett.130.140601","paper_href":"/paper/2605.25132","created_at":"2026-07-11T03:18:59.077362Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":1,"flags_open":1,"flags_disputed":0,"desk_url":"https://pith.science/flags"}