Demonstration of Shor’s factoring algorithm for N $$=$$ = 21 on IBM quantum processors
Abstract We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous demonstration. We go beyond this work by using a configu...
Guardado en:
Autores principales: | Unathi Skosana, Mark Tame |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/83ad215236954f3fa443398042bc8bfa |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Demonstration of non-Markovian process characterisation and control on a quantum processor
por: G. A. L. White, et al.
Publicado: (2020) -
An improved novel quantum image representation and its experimental test on IBM quantum experience
por: Jie Su, et al.
Publicado: (2021) -
A quantum Hopfield associative memory implemented on an actual quantum processor
por: Nathan Eli Miller, et al.
Publicado: (2021) -
Efficient quantum walk on a quantum processor
por: Xiaogang Qiang, et al.
Publicado: (2016) -
Fault-tolerant interface between quantum memories and quantum processors
por: Hendrik Poulsen Nautrup, et al.
Publicado: (2017)