Cargando…
Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library
Efficient realization of quantum algorithms is among main challenges on the way towards practical quantum computing. Various libraries and frameworks for quantum software engineering have been developed. Here we present a software package containing implementations of various quantum gates and well-...
Autores principales: | Antipov, A. V., Kiktenko, E. O., Fedorov, A. K. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9282478/ https://www.ncbi.nlm.nih.gov/pubmed/35834546 http://dx.doi.org/10.1371/journal.pone.0271462 |
Ejemplares similares
-
Penny Lane /
por: Sánchez Rodríguez, Francisco
Publicado: (1998) -
Generalized Toffoli Gate Decomposition Using Ququints: Towards Realizing Grover’s Algorithm with Qudits
por: Nikolaeva, Anstasiia S., 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) -
Author Correction: Demonstration of Shor’s factoring algorithm for N = 21 on IBM quantum processors
por: Skosana, Unathi, et al.
Publicado: (2023) -
Demonstration of Shor’s factoring algorithm for N [Formula: see text] 21 on IBM quantum processors
por: Skosana, Unathi, et al.
Publicado: (2021)