{"id":"https://openalex.org/W3210180238","doi":null,"title":"A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs","display_name":"A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs","publication_year":2021,"publication_date":"2021-10-29","ids":{"openalex":"https://openalex.org/W3210180238","mag":"3210180238"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-04239958v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-04239958v1","pdf_url":"http://arxiv.org/pdf/2110.15587","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2023","raw_type":"info:eu-repo/semantics/preprint"},"volume":null,"type":"preprint","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://arxiv.org/pdf/2110.15587","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029752138","display_name":"Simon Apers","orcid":"https://orcid.org/0000-0003-3823-6804","observed_orcids":["https://orcid.org/0000-0003-3823-6804"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon Apers","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-3823-6804","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015347517","display_name":"Arinta Auza","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arinta Auza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083542323","display_name":"Troy Lee","orcid":"https://orcid.org/0000-0001-6912-2338","observed_orcids":["https://orcid.org/0000-0001-6912-2338"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Troy Lee","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6912-2338","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.5884000062942505,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.5884000062942505,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.40869998931884766,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.871999979019165},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.6899999976158142},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.781000018119812},{"id":"https://openalex.org/keywords/sublinear-time","display_name":"sublinear time","score":0.675000011920929},{"id":"https://openalex.org/keywords/simple-graphs","display_name":"simple graphs","score":0.7210000157356262},{"id":"https://openalex.org/keywords/undirected-graphs","display_name":"undirected graphs","score":0.7070000171661377},{"id":"https://openalex.org/keywords/edge-weights","display_name":"edge weights","score":0.6050000190734863},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.4099999964237213},{"id":"https://openalex.org/keywords/graph-connectivity","display_name":"graph connectivity","score":0.6299999952316284}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8314929008483887},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6939098238945007},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6917623281478882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6544510126113892},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6204835176467896},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5892901420593262},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5646970272064209},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5081899166107178},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4798419177532196},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44515782594680786},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.435366690158844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4266134202480316},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11330831050872803},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-04239958v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-04239958v1","pdf_url":"http://arxiv.org/pdf/2110.15587","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2023","raw_type":"info:eu-repo/semantics/preprint"},{"id":"mag:3210180238","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2110.15587.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"pmh:oai:HAL:hal-04239958v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-04239958v1","pdf_url":"http://arxiv.org/pdf/2110.15587","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2023","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1371337724","display_name":"Quantum algorithms for massive data","funder_award_id":"ANR-18-CE47-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2191957979","display_name":"Etude de la pile quantique : Algorithmes, mod\u00e8les de calcul et simulation pour l\u2019informatique quantique","funder_award_id":"ANR-22-PETQ-0007","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2838674790","display_name":null,"funder_award_id":"ERA-NET Cofund 2022-25","funder_id":"https://openalex.org/F4320330828","funder_display_name":"QuantERA"},{"id":"https://openalex.org/G4656594441","display_name":null,"funder_award_id":"ANR18","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6802314197","display_name":"Quantum computation: through the algorithm and complexity theory lens","funder_award_id":"DP200100950","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320330828","display_name":"QuantERA","ror":null},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3210180238.pdf","grobid_xml":"https://content.openalex.org/works/W3210180238.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1516729503","https://openalex.org/W1543491698","https://openalex.org/W2002531683","https://openalex.org/W2051165831","https://openalex.org/W2099463627","https://openalex.org/W2106759055","https://openalex.org/W2133352257","https://openalex.org/W2153441719","https://openalex.org/W2153887174","https://openalex.org/W2263976044","https://openalex.org/W2584830529","https://openalex.org/W2886596322","https://openalex.org/W2963702123","https://openalex.org/W2982534635","https://openalex.org/W3041308142","https://openalex.org/W3126714247","https://openalex.org/W3127041097","https://openalex.org/W3167705025","https://openalex.org/W3186087377"],"related_works":["https://openalex.org/W4286890193","https://openalex.org/W3130215558","https://openalex.org/W7118997954","https://openalex.org/W2767688676","https://openalex.org/W2590431233","https://openalex.org/W7119032203","https://openalex.org/W3170529680","https://openalex.org/W2057463094","https://openalex.org/W1575871512","https://openalex.org/W822981335"],"abstract_inverted_index":{"An":[0],"$s{\\operatorname{-}}t$":[1,55,88],"minimum":[2,10,54,87],"cut":[3,25,56,89],"in":[4,90,115],"a":[5,9,24,27,37,49,86,125,137],"graph":[6,64,139],"corresponds":[7],"to":[8,33,42,103,132,142],"weight":[11,84],"subset":[12],"of":[13,35,85,136],"edges":[14],"whose":[15],"removal":[16],"disconnects":[17],"vertices":[18],"$s$":[19,41,145],"and":[20,70,146],"$t$.":[21,43],"Finding":[22],"such":[23],"is":[26,31,110],"classic":[28],"problem":[29,57],"that":[30,34],"dual":[32],"finding":[36],"maximum":[38],"flow":[39],"from":[40],"In":[44,123],"this":[45,108],"work":[46],"we":[47],"describe":[48],"quantum":[50],"algorithm":[51,78,127],"for":[52],"the":[53,77,83,116,133],"on":[58],"undirected":[59,63],"graphs.":[60],"For":[61,105],"an":[62],"with":[65,80],"$n$":[66],"vertices,":[67],"$m$":[68],"edges,":[69],"integral":[71],"edge":[72],"weights":[73],"bounded":[74],"by":[75],"$W$,":[76],"computes":[79],"high":[81],"probability":[82],"time":[91],"$\\widetilde":[92,112],"O(\\sqrt{m}":[93],"n^{5/6}":[94],"W^{1/3}":[95],"+":[96],"n^{5/3}":[97],"W^{2/3})$,":[98],"given":[99],"adjacency":[100,134],"list":[101,135],"access":[102],"$G$.":[104],"simple":[106,138],"graphs":[107],"bound":[109],"always":[111],"O(n^{11/6})$,":[113],"even":[114,141],"dense":[117],"case":[118],"when":[119],"$m":[120],"=":[121],"\\Omega(n^2)$.":[122],"contrast,":[124],"randomized":[126],"must":[128],"make":[129],"$\\Omega(m)$":[130],"queries":[131],"$G$":[140],"decide":[143],"whether":[144],"$t$":[147],"are":[148],"connected.":[149]},"counts_by_year":[],"updated_date":"2026-10-25T09:29:13.331239","created_date":"2021-11-08T00:00:00"}