{"id":"https://openalex.org/W7128074748","doi":"https://doi.org/10.48550/arxiv.2602.05541","title":"Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm","display_name":"Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm","publication_year":2026,"publication_date":"2026-02-05","ids":{"openalex":"https://openalex.org/W7128074748","doi":"https://doi.org/10.48550/arxiv.2602.05541"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.05541","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5125121608","display_name":"Jiaqi Yao","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yao, Jiaqi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100456725","display_name":"Ding Liu","orcid":"https://orcid.org/0000-0002-0931-1345"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Ding","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5125121608"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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.9677000045776367,"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.9677000045776367,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.0026000000070780516,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.002400000113993883,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/matrix-multiplication","display_name":"Matrix multiplication","score":0.63919997215271},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.5993000268936157},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5918999910354614},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5331000089645386},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5023000240325928},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.49869999289512634},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.48969998955726624},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.45969998836517334},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4284999966621399}],"concepts":[{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.63919997215271},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.5993000268936157},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5918999910354614},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5331000089645386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5322999954223633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5252000093460083},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.49869999289512634},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.48969998955726624},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.45969998836517334},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.4059000015258789},{"id":"https://openalex.org/C195906000","wikidata":"https://www.wikidata.org/wiki/Q1191722","display_name":"Matrix exponential","level":3,"score":0.39730000495910645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3702000081539154},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.36719998717308044},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3296000063419342},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.32409998774528503},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C2780427248","wikidata":"https://www.wikidata.org/wiki/Q17014996","display_name":"Fundamental matrix (linear differential equation)","level":2,"score":0.2888999879360199},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26840001344680786},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C101471828","wikidata":"https://www.wikidata.org/wiki/Q17083575","display_name":"Quantum algorithm for linear systems of equations","level":5,"score":0.25589999556541443}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.05541","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.05541","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.05541","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.05541","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Matrix":[0],"multiplication":[1,45],"is":[2],"a":[3,11,32,41],"fundamental":[4],"classical":[5,63],"computing":[6],"operation":[7],"whose":[8],"efficiency":[9,94],"becomes":[10],"major":[12],"challenge":[13],"at":[14],"scale,":[15],"especially":[16],"for":[17],"machine":[18],"learning":[19],"applications.":[20],"Quantum":[21],"computing,":[22],"with":[23],"its":[24],"inherent":[25],"parallelism":[26],"and":[27,78,103],"exponential":[28],"storage":[29],"capacity,":[30],"offers":[31],"potential":[33],"solution":[34],"to":[35],"these":[36],"limitations.":[37],"This":[38],"work":[39],"presents":[40],"quantum":[42,80],"kernel-based":[43],"matrix":[44,74],"algorithm":[46,88],"(QKMM)":[47],"that":[48,85],"achieves":[49],"an":[50],"asymptotically":[51],"optimal":[52,64],"computational":[53],"complexity":[54,65],"of":[55,66],"$":[56,67],"O(N^2":[57],"\\log_2":[58],"N)":[59],"$,":[60,69],"outperforming":[61],"the":[62,73,86],"O(N^{2.371552})":[68],"where":[70],"$N$":[71],"denotes":[72],"dimension.":[75],"Through":[76],"noiseless":[77],"noisy":[79],"simulation":[81],"experiments,":[82],"we":[83],"demonstrate":[84],"proposed":[87],"not":[89],"only":[90],"exhibits":[91],"superior":[92],"theoretical":[93],"but":[95],"also":[96],"shows":[97],"practical":[98],"advantages":[99],"in":[100],"runtime":[101],"performance":[102],"stability.":[104]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-07T00:00:00"}