Cargando…
Quantum-enhanced greedy combinatorial optimization solver
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are required to bolster their performance. Here, we introduce an...
Autores principales: | Dupont, Maxime, Evert, Bram, Hodson, Mark J., Sundar, Bhuvanesh, Jeffrey, Stephen, Yamaguchi, Yuki, Feng, Dennis, Maciejewski, Filip B., Hadfield, Stuart, Alam, M. Sohaib, Wang, Zhihui, Grabbe, Shon, Lott, P. Aaron, Rieffel, Eleanor G., Venturelli, Davide, Reagor, Matthew J. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
American Association for the Advancement of Science
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10637743/ https://www.ncbi.nlm.nih.gov/pubmed/37948523 http://dx.doi.org/10.1126/sciadv.adi0487 |
Ejemplares similares
-
GRISOTTO: A greedy approach to improve combinatorial algorithms for motif discovery with prior knowledge
por: Carvalho, Alexandra M, et al.
Publicado: (2011) -
Greedy Approximation
por: Temlyakov, Vladimir
Publicado: (2011) -
Beware greedy algorithms
por: Simmons, Benno I., et al.
Publicado: (2019) -
How greedy is too greedy? A network toy model for evaluating the sustainability of biased evolutionary dynamics
por: Weinberger, V. P., et al.
Publicado: (2024) -
On a greedy approach for genome scaffolding
por: Davot, Tom, et al.
Publicado: (2022)