Cargando…
A formally certified end-to-end implementation of Shor’s factorization algorithm
Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but it is useful only if computed answers are correct. While hardware-level decoherence errors have garnered significant attention, a less recognized obstacle to correctness is that of human programm...
Autores principales: | Peng, Yuxiang, Hietala, Kesha, Tao, Runzhou, Li, Liyi, Rand, Robert, Hicks, Michael, Wu, Xiaodi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
National Academy of Sciences
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10214188/ https://www.ncbi.nlm.nih.gov/pubmed/37186832 http://dx.doi.org/10.1073/pnas.2218775120 |
Ejemplares similares
-
Computing Shor’s algorithmic steps with interference patterns of classical light
por: Wang, Wei, et al.
Publicado: (2022) -
Author Correction: Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors
por: Skosana, Unathi, et al.
Publicado: (2023) -
Author Correction: Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors
por: Skosana, Unathi, et al.
Publicado: (2023) -
Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library
por: Antipov, A. V., et al.
Publicado: (2022) -
Demonstration of Shor’s factoring algorithm for N [Formula: see text] 21 on IBM quantum processors
por: Skosana, Unathi, et al.
Publicado: (2021)