Cargando…
Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian
Prime factorization (P = M × N) is a promising application for quantum computing. Shor’s algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-correctable logical qubits. Here, we describe...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Nature Publishing Group UK
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9372081/ https://www.ncbi.nlm.nih.gov/pubmed/35953585 http://dx.doi.org/10.1038/s41598-022-17867-9 |