English
Related papers

Related papers: Solving Combinatorial Optimization Problems on a P…

200 papers

Optimally-shaped electromagnetic fields have the capacity to coherently control the dynamics of quantum systems and thus offer a promising means for controlling molecular transformations relevant to chemical, biological, and materials…

Quantum Physics · Physics 2021-06-08 Alicia B. Magann , Matthew D. Grace , Herschel A. Rabitz , Mohan Sarovar

We study quantum computing algorithms for solving certain constrained resource allocation problems we coin as Mission Covering Optimization (MCO). We compare formulations of constrained optimization problems using Quantum Annealing…

Quantum Physics · Physics 2022-05-05 Massimiliano Cutugno , Annarita Giani , Paul M. Alsing , Laura Wessing , Austars Schnore

Quantum computing offers significant potential for solving NP-hard combinatorial (optimization) problems that are beyond the reach of classical computers. One way to tap into this potential is by reformulating combinatorial problems as a…

This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process…

Quantum Physics · Physics 2024-08-02 Tavis Bennett , Lyle Noakes , Jingbo Wang

Quantum computers can be used to address molecular structure, materials science and condensed matter physics problems, which currently stretch the limits of existing high-performance computing resources. Finding exact numerical solutions to…

The complexity of large-scale 6G-and-beyond networks demands innovative approaches for multi-objective optimization over vast search spaces, a task often intractable. Quantum computing (QC) emerges as a promising technology for efficient…

Networking and Internet Architecture · Computer Science 2025-09-10 Sebastian Macaluso , Giovanni Geraci , Elías F. Combarro , Sergi Abadal , Ioannis Arapakis , Sofia Vallecorsa , Eduard Alarcón

Quantum approximate optimization algorithm (QAOA) is one of the popular quantum algorithms that are used to solve combinatorial optimization problems via approximations. QAOA is able to be evaluated on both physical and virtual quantum…

Quantum Physics · Physics 2023-12-07 Yu-Cheng Lin , Chuan-Chi Wang , Chia-Heng Tu , Shih-Hao Hung

Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…

Quantum Physics · Physics 2007-05-23 T. B. Pittman , B. C. Jacobs , J. D. Franson

Quantum computers can in principle solve certain problems exponentially more quickly than their classical counterparts. We have not yet reached the advent of useful quantum computation, but when we do, it will affect nearly all scientific…

The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…

Quantum Physics · Physics 2018-04-10 Bogdan Opanchuk , Laura Rosales-Zarate , Margaret D Reid , Peter D Drummond

We develop a general method for incentive-based programming of hybrid quantum-classical computing systems using reinforcement learning, and apply this to solve combinatorial optimization problems on both simulated and real gate-based…

Quantum Physics · Physics 2019-08-23 Keri A. McKiernan , Erik Davis , M. Sohaib Alam , Chad Rigetti

Quantum computing offers an alternative paradigm for addressing combinatorial optimization problems compared to classical computing. Despite recent hardware improvements, the execution of empirical quantum optimization experiments at scales…

Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the Filtering Variational Quantum…

We observe that fault-tolerant quantum computers have an optimal advantage over classical computers in approximating solutions to many NP optimization problems. This observation however gives nothing in practice.

Quantum Physics · Physics 2022-12-27 Mario Szegedy

Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…

Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…

Quantum Physics · Physics 2016-02-24 Ashley Montanaro

Quantum computing devices are believed to be powerful in solving hard computational tasks, in particular, combinatorial optimization problems. In the present work, we consider a particular type of the minimum bin packing problem, which can…

Quantum Physics · Physics 2024-02-28 A. A. Bozhedarov , A. S. Boev , S. R. Usmanov , G. V. Salahov , E. O. Kiktenko , A. K. Fedorov

Quantum computer, harnessing quantum superposition to boost a parallel computational power, promises to outperform its classical counterparts and offer an exponentially increased scaling. The term "quantum advantage" was proposed to mark…

Optimization problems are ubiquitous in various industrial settings, and multi-knapsack optimization is one recurrent task faced daily by several industries. The advent of quantum computing has opened a new paradigm for computationally…

Quantum computing aims at exploiting quantum phenomena to efficiently perform computations that are unfeasible even for the most powerful classical supercomputers. Among the promising technological approaches, photonic quantum computing…