{"title":"Multicommodity information flow through quantum annealer","authors":"Munawar Ali, Hasnat Ahmed, Madiha Hussain Malik, Aeysha Khalique","doi":"10.1007/s11128-024-04518-3","DOIUrl":null,"url":null,"abstract":"<div><p>Quantum computing offers a novel perspective for solving classically intractable problems. The computational heuristic non-binary nature of quantum computers, based on quantum mechanical properties, associates several advantages and disadvantages. We explore quantum annealing (QA), a metaheuristic algorithm with the primary objective of solving NP-hard optimization problems intractable to classical algorithms. Here we solve a particular family of NP problems, called origin–destination integer multi-commodity flow problem (ODIMCF), using QA. This includes the quadratic unconstrained binary optimization (QUBO) formulation and the practical implementation of this problem on the D-Wave QA. Additionally, quantum annealers are benchmarked against other classical solvers to assess the ODIMCF problem’s solution quality and runtime performance.\n</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04518-3","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0
Abstract
Quantum computing offers a novel perspective for solving classically intractable problems. The computational heuristic non-binary nature of quantum computers, based on quantum mechanical properties, associates several advantages and disadvantages. We explore quantum annealing (QA), a metaheuristic algorithm with the primary objective of solving NP-hard optimization problems intractable to classical algorithms. Here we solve a particular family of NP problems, called origin–destination integer multi-commodity flow problem (ODIMCF), using QA. This includes the quadratic unconstrained binary optimization (QUBO) formulation and the practical implementation of this problem on the D-Wave QA. Additionally, quantum annealers are benchmarked against other classical solvers to assess the ODIMCF problem’s solution quality and runtime performance.
期刊介绍:
Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.