Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks

Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Buhrman, Harry, Loff, Bruno, Patro, Subhasree, Speelman, Florian
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 03.06.2021
Subjects:
Algorithms
Complexity
Computational geometry
Lower bounds
Upper bounds
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of fine-grained complexity allows us to prove optimal lower-bounds on the complexity of various computational problems, based on the conjectured hardness of certain natural, well-studied problems. This theory has recently been extended to the quantum setting, in two independent papers by Buhrman, Patro, and Speelman (arXiv:1911.05686), and by Aaronson, Chia, Lin, Wang, and Zhang (arXiv:1911.01973). In this paper, we further extend the theory of fine-grained complexity to the quantum setting. A fundamental conjecture in the classical setting states that the 3SUM problem cannot be solved by (classical) algorithms in time O(n^{2-a}), for any a>0. We formulate an analogous conjecture, the Quantum-3SUM-Conjecture, which states that there exist no sublinear O(n^{1-b})-time quantum algorithms for the 3SUM problem. Based on the Quantum-3SUM-Conjecture, we show new lower-bounds on the time complexity of quantum algorithms for several computational problems. Most of our lower-bounds are optimal, in that they match known upper-bounds, and hence they imply tight limits on the quantum speedup that is possible for these problems.
AbstractList Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of fine-grained complexity allows us to prove optimal lower-bounds on the complexity of various computational problems, based on the conjectured hardness of certain natural, well-studied problems. This theory has recently been extended to the quantum setting, in two independent papers by Buhrman, Patro, and Speelman (arXiv:1911.05686), and by Aaronson, Chia, Lin, Wang, and Zhang (arXiv:1911.01973). In this paper, we further extend the theory of fine-grained complexity to the quantum setting. A fundamental conjecture in the classical setting states that the 3SUM problem cannot be solved by (classical) algorithms in time O(n^{2-a}), for any a>0. We formulate an analogous conjecture, the Quantum-3SUM-Conjecture, which states that there exist no sublinear O(n^{1-b})-time quantum algorithms for the 3SUM problem. Based on the Quantum-3SUM-Conjecture, we show new lower-bounds on the time complexity of quantum algorithms for several computational problems. Most of our lower-bounds are optimal, in that they match known upper-bounds, and hence they imply tight limits on the quantum speedup that is possible for these problems.
Author Loff, Bruno
Patro, Subhasree
Speelman, Florian
Buhrman, Harry
Author_xml – sequence: 1
  givenname: Harry
  surname: Buhrman
  fullname: Buhrman, Harry
– sequence: 2
  givenname: Bruno
  surname: Loff
  fullname: Loff, Bruno
– sequence: 3
  givenname: Subhasree
  surname: Patro
  fullname: Patro, Subhasree
– sequence: 4
  givenname: Florian
  surname: Speelman
  fullname: Speelman, Florian
BookMark eNo9j71OwzAURi0EEqX0AdgsMSf4N3HZUEUBqRJL9-qmvi4uSZzGTmnfnggQ05m-o-_ckMs2tEjIHWe5MlqzB-hP_pgLzoqcCcb0BZkIKXlmlBDXZBbjnjEmilJoLSckrXzjU6TB0cMAbRoaGjtEmw1dpC70dBuabkiQfGihpjsMDab-TKG1NKQP7GnXh6rGJj7SpW8x2_Uwwv7sajz5dKZHD__yL6g_4y25clBHnP1xStbL5_XiNVu9v7wtnlYZaCGyynFebBVw6VAWtjTGAuOqcNzgXM0rhBIYWlOB1baU3NpSOT1WGr3VBkFOyf2vdrx4GDCmzT4M_ZgRN0LLkgkhlZDfRQdhFQ
ContentType Paper
Copyright 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2106.02005
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
AUTh Library subscriptions: ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a522-bf116c4a13fe36d788da0146f18e949bea7a0ed8bad5d731dd74f542285c58ea3
IEDL.DBID M7S
IngestDate Mon Jun 30 09:29:06 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a522-bf116c4a13fe36d788da0146f18e949bea7a0ed8bad5d731dd74f542285c58ea3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2537022342?pq-origsite=%requestingapplication%
PQID 2537022342
PQPubID 2050157
ParticipantIDs proquest_journals_2537022342
PublicationCentury 2000
PublicationDate 20210603
PublicationDateYYYYMMDD 2021-06-03
PublicationDate_xml – month: 06
  year: 2021
  text: 20210603
  day: 03
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2021
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.7596197
SecondaryResourceType preprint
Snippet Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Complexity
Computational geometry
Lower bounds
Upper bounds
Title Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks
URI https://www.proquest.com/docview/2537022342
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8JAEN4oaOLJd3wg2YPXBdrtCy8mGogeJI1ywBOZfRGiUOgWlH_v7lrwYOLFY9O0aabZmW--nf0-hK4VjygTihGRxIwEkQhJWzFGTPWhQQuchJ0zm4h7vWQwaKcl4abLscp1TnSJWmTccuRNP6SxqTc08G9nc2Jdo-zuammhsY2qViXBc6N7LxuOxY9ig5jp92amk-5qQv45XjZMnxM1WpZQ-ZWCXV3p7v_3iw5QNYWZzA_RlpweoV03z8n1MSrcwSWNM4XnCxO8xQTrmSlUZDHT2OBUzJ2bQ8kE4pHMJrLIVximArszWbh0mtE3uGuAKBlZKwkp3HNWQ7NY4eUYNi__gPc3fYL63U7__oGUBgsEDOwiTHlexAPwqJI0EqYZFmC1ZJSXyHbQZhJiaEmRMBChiKknRByo0GqGhTxMJNBTVJlmU3mGMCQtnjCTrFQEgfDAtNw-cAMfPWlBTXSOausYDstFooc_Abz4-_Yl2vPtKIklP2gNVYp8Ia_QDl8WY53XUfWu00uf6-7fm6v08Sl9_QJBOryx
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTgMxDLVYBSd2sZMDHAMzk1mREAegAgEVEj1wq5ytqoC2TKaFfhT_SBJaOCBx48B5NJFmbD0_O7YfwL4WKeNScyrzjNM4lQktNOfURh8WB-hX2Hmxiaxezx8eirsJeB_Pwri2yjEmeqCWXeFq5EdRwjIbb1gcnfZeqFONcrerYwmNT7e4VsNXm7KZk6tza9-DKKpdNM4u6UhVgKLlGpTrMExFjCHTiqXSZoAS3QIVHeaqiAuuMMNAyZyjTGTGQimzWCduUVYiklwhs8dOwrRlEVHhOwXvv0o6UZpZgs4-7079prAjLN_ag0ObVqWHgavf_EB8H8ZqC__sByzC9B32VLkEE6qzDLO-W1WYFaj8WJYhXU1e-tY1-s_E9GwYpv2eIZaFE-G1KkZ1TtJS3WdVlUOCHUn8xBkZ6eiYY1KzNJu2nFCGkv49tyG0GpJBG78Of8WnR7MKjb_4zjWY6nQ7ah0I5oHIuYVinWIsQyyCLEJhyXGoHGVLN2B7bLLmCAJM89tem78_3oO5y8btTfPmqn69BfORa5pxZR62DVNV2Vc7MCMGVduUu97dCDT_2Lofb_YWaA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Limits+of+quantum+speed-ups+for+computational+geometry+and+other+problems%3A+Fine-grained+complexity+via+quantum+walks&rft.jtitle=arXiv.org&rft.au=Buhrman%2C+Harry&rft.au=Loff%2C+Bruno&rft.au=Patro%2C+Subhasree&rft.au=Speelman%2C+Florian&rft.date=2021-06-03&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2106.02005