Zobrazeno 1 - 10
of 10 731
pro vyhledávání: '"max-cut"'
We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in a graph. In the classical streaming model, while a $1/2$-approximation for estimating the value of MAX-CUT can be trivially achieved with $O(1)$ words of space, K
Externí odkaz:
http://arxiv.org/abs/2412.09773
Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
This paper investigates the performance of quantum, classical, and hybrid solvers on the NP-hard Max-Cut and QUBO problems, examining their solution quality relative to the global optima and their computational efficiency. We benchmark the new fast a
Externí odkaz:
http://arxiv.org/abs/2412.07460
We show a linear sized reduction from the Maximum Cut Problem (Max-Cut) with completeness $1 - \varepsilon$ and soundness $1 - \varepsilon^{1/2}$ to the $\gamma$-Approximate Closest Vector Problem under any finite $\ell_p$-norm including $p = 2$. Thi
Externí odkaz:
http://arxiv.org/abs/2411.04124
Autor:
Kang, Yu Gyeong1 (AUTHOR), Ishii, Masatoshi2 (AUTHOR), Park, Jaeweon1 (AUTHOR), Shin, Uicheol1 (AUTHOR), Jang, Suyeon1 (AUTHOR), Yoon, Seongwon1 (AUTHOR), Kim, Mingi1 (AUTHOR), Okazaki, Atsuya2 (AUTHOR), Ito, Megumi2 (AUTHOR), Nomura, Akiyo2 (AUTHOR), Hosokawa, Kohji2 (AUTHOR), BrightSky, Matthew3 (AUTHOR) breitm@us.ibm.com, Kim, Sangbum1 (AUTHOR) sangbum.kim@snu.ac.kr
Publikováno v:
Advanced Science. 12/11/2024, Vol. 11 Issue 46, p1-13. 13p.
Quantum approximate optimization algorithm (QAOA) is a variational quantum algorithm (VQA) ideal for noisy intermediate-scale quantum (NISQ) processors, and is highly successful for solving combinatorial optimization problems (COPs). It has been obse
Externí odkaz:
http://arxiv.org/abs/2412.21071
Autor:
Cheairi, Houssam El, Gamarnik, David
Universality, namely distributional invariance, is a well-known property for many random structures. For example it is known to hold for a broad range of variational problems with random input. Much less is known about the universality of the perform
Externí odkaz:
http://arxiv.org/abs/2412.18014
Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing theoretic
Externí odkaz:
http://arxiv.org/abs/2411.04120
Autor:
Patwardhan, Ishan, Akkapelli, Akhil
This research explores the integration of the Quantum Approximate Optimization Algorithm (QAOA) into Hybrid Quantum-HPC systems for solving the Max-Cut problem, comparing its performance with classical algorithms like brute-force search and greedy he
Externí odkaz:
http://arxiv.org/abs/2410.15626
Quantum Approximate Optimization Algorithm (QAOA) is a quantum-classical hybrid algorithm proposed with the goal of approximately solving combinatorial optimization problems such as the MAX-CUT problem. It has been considered a potential candidate fo
Externí odkaz:
http://arxiv.org/abs/2408.13207