Cargando…
Demonstration of Shor’s factoring algorithm for N [Formula: see text] 21 on IBM quantum processors
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 configuration of...
Autores principales: | Skosana, Unathi, Tame, Mark |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8368060/ https://www.ncbi.nlm.nih.gov/pubmed/34400695 http://dx.doi.org/10.1038/s41598-021-95973-w |
Ejemplares similares
-
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) -
Pseudo-scalar Higgs boson production at N[Formula: see text] LO[Formula: see text] +N[Formula: see text] LL[Formula: see text]
por: Ahmed, Taushif, et al.
Publicado: (2016) -
Observation of B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] and B[Formula: see text]
[Formula: see text]
[Formula: see text] (2S)K[Formula: see text] decays
por: Tumasyan, A., et al.
Publicado: (2022) -
Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library
por: Antipov, A. V., et al.
Publicado: (2022)