Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Ngo, Hoang M."'
Quantum Annealing (QA) holds great potential for solving combinatorial optimization problems efficiently. However, the effectiveness of QA algorithms heavily relies on the embedding of problem instances, represented as logical graphs, into the quantu
Externí odkaz:
http://arxiv.org/abs/2406.07124
Network motif identification problem aims to find topological patterns in biological networks. Identifying non-overlapping motifs is a computationally challenging problem using classical computers. Quantum computers enable solving high complexity pro
Externí odkaz:
http://arxiv.org/abs/2311.03400
Quantum annealing (QA) has emerged as a powerful technique to solve optimization problems by taking advantages of quantum physics. In QA process, a bottleneck that may prevent QA to scale up is minor embedding step in which we embed optimization prob
Externí odkaz:
http://arxiv.org/abs/2307.01843
Target Identification by Enzymes (TIE) problem aims to identify the set of enzymes in a given metabolic network, such that their inhibition eliminates a given set of target compounds associated with a disease while incurring minimum damage to the res
Externí odkaz:
http://arxiv.org/abs/2303.07508
Publikováno v:
Bioinformatics Advances. 2023, Vol. 3 Issue 1, p1-10. 10p.
Publikováno v:
Proceedings of SPIE; August 2014, Vol. 9171 Issue: 1 p91710Y-91710Y-6, 825397p