Cargando…
Experimental quantum annealing: case study involving the graph isomorphism problem
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is kn...
Autores principales: | Zick, Kenneth M., Shehab, Omar, French, Matthew |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4459189/ https://www.ncbi.nlm.nih.gov/pubmed/26053973 http://dx.doi.org/10.1038/srep11168 |
Ejemplares similares
-
MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
por: Liu, Kai, et al.
Publicado: (2019) -
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
por: Wang, Xin, et al.
Publicado: (2018) -
Computational complexity of equivalence and isomorphism problems
por: Goos, Gerhard, et al.
Publicado: (1999) -
Some isomorphic properties of m-polar fuzzy graphs with applications
por: Ghorai, Ganesh, et al.
Publicado: (2016) -
Solving problems with quantum annealing
por: Thom, Murray
Publicado: (2021)