An Evaluation of Computational Complexity of Shor’s Algorithm on Surface Codes for Factorization
IEEE Access · 2026 · 14 · 27264-27289
DOI: 10.1109/access.2026.3665887 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Kento Oonishi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Japan Society for the Promotion of Science (JSPS) KAKENHI, Japan Science and Technology CREST.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Japan Society for the Promotion of Science (JSPS) KAKENHI
- Japan Science and Technology CREST
Zitieren
APA
Oonishi, K., & Kunihiro, N. (2026). An Evaluation of Computational Complexity of Shor’s Algorithm on Surface Codes for Factorization. IEEE Access, 14, 27264-27289. https://doi.org/10.1109/access.2026.3665887
Vancouver
Oonishi K, Kunihiro N. An Evaluation of Computational Complexity of Shor’s Algorithm on Surface Codes for Factorization. IEEE Access. 2026;14:27264-27289. doi:10.1109/access.2026.3665887
BibTeX
@article{Oonishi2026,
author = {Oonishi, Kento and Kunihiro, Noboru},
title = {An Evaluation of Computational Complexity of Shor’s Algorithm on Surface Codes for Factorization},
journal = {IEEE Access},
year = {2026},
volume = {14},
pages = {27264--27289},
doi = {10.1109/access.2026.3665887}
}
EUVIMED