Cargando…
An Efficient Exact Quantum Algorithm for the Integer Square-free Decomposition Problem
Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to develop other types of quantum algorithms that widen the ran...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3277347/ https://www.ncbi.nlm.nih.gov/pubmed/22355772 http://dx.doi.org/10.1038/srep00260 |