Cargando…
Quantum annealing for systems of polynomial equations
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct matrix inversion or iteratively with judicious preconditionin...
Autores principales: | Chang, Chia Cheng, Gambhir, Arjun, Humble, Travis S., Sota, Shigetoshi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6635388/ https://www.ncbi.nlm.nih.gov/pubmed/31311997 http://dx.doi.org/10.1038/s41598-019-46729-0 |
Ejemplares similares
-
Application of Quantum Annealing to Nurse Scheduling Problem
por: Ikeda, Kazuki, et al.
Publicado: (2019) -
Quantum Annealing for Prime Factorization
por: Jiang, Shuxian, et al.
Publicado: (2018) -
Solving polynomial equation systems
por: Mora, Teo, et al.
Publicado: (2003) -
Polynomials and Equations
por: Leung, KT, et al.
Publicado: (1992) -
Solving polynomial equation systems IV
por: Mora, Teo
Publicado: (2000)