Zobrazeno 1 - 10
of 935
pro vyhledávání: '"Maxcut Problem"'
Finding ground state solutions of diagonal Hamiltonians is relevant for both theoretical as well as practical problems of interest in many domains such as finance, physics and computer science. These problems are typically very hard to tackle by clas
Externí odkaz:
http://arxiv.org/abs/2411.10737
We investigate the Maximum Cut (MaxCut) problem on different graph classes with the Quantum Approximate Optimization Algorithm (QAOA) using symmetries. In particular, heuristics on the relationship between graph symmetries and the approximation ratio
Externí odkaz:
http://arxiv.org/abs/2408.15413
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bechtold, Marvin, Barzen, Johanna, Leymann, Frank, Mandl, Alexander, Obst, Julian, Truger, Felix, Weder, Benjamin
Publikováno v:
Quantum Science and Technology, Volume 8, Number 4, 045022 (2023)
Noisy Intermediate-Scale Quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. An approach addressing these problems is quantum circuit cutting. It decomposes the execution of a large quantum circu
Externí odkaz:
http://arxiv.org/abs/2302.01792
Autor:
Rančić, Marko J.
Publikováno v:
Physical Review Research 5, L012021 (2023)
Quantum computers are devices, which allow more efficient solutions of problems as compared to their classical counterparts. As the timeline to developing a quantum-error corrected computer is unclear, the quantum computing community has dedicated mu
Externí odkaz:
http://arxiv.org/abs/2110.10788
Publikováno v:
Algorithmica 83(12), 3649-3680 (2021)
Interval graphs, intersection graphs of segments on a real line (intervals), play a key role in the study of algorithms and special structural properties. Unit interval graphs, their proper subclass, where each interval has a unit length, has also be
Externí odkaz:
http://arxiv.org/abs/2002.08311
Publikováno v:
In Swarm and Evolutionary Computation March 2022 69
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Marko J. Rančić
Publikováno v:
Physical Review Research, Vol 5, Iss 1, p L012021 (2023)
Quantum computers are devices, which allow more efficient solutions of problems as compared to their classical counterparts. As the timeline to developing a quantum-error corrected computer is unclear, the quantum computing community has dedicated mu
Externí odkaz:
https://doaj.org/article/c4ed5404edbd4e85a259487235a945e8
Autor:
Lins, Sostenes L., Henriques, Diogo B.
A polytope $P$ is a {\em model} for a combinatorial problem on finite graphs $G$ whose variables are indexed by the edge set $E$ of $G$ if the points of $P$ with (0,1)-coordinates are precisely the characteristic vectors of the subset of edges induci
Externí odkaz:
http://arxiv.org/abs/1604.02325