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: | , , |
---|---|
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 |
_version_ | 1784747114079715328 |
---|---|
author | Antipov, A. V. Kiktenko, E. O. Fedorov, A. K. |
author_facet | Antipov, A. V. Kiktenko, E. O. Fedorov, A. K. |
author_sort | Antipov, A. V. |
collection | PubMed |
description | 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-known quantum algorithms using PennyLane library. Additoinally, we used a simplified technique for decomposition of algorithms into a set of gates which are native for trapped-ion quantum processor and realized this technique using PennyLane library. The decomposition is used to analyze resources required for an execution of Shor’s algorithm on the level of native operations of trapped-ion quantum computer. Our original contribution is the derivation of coefficients needed for implementation of the decomposition. Templates within the package include all required elements from the quantum part of Shor’s algorithm, specifically, efficient modular exponentiation and quantum Fourier transform that can be realized for an arbitrary number of qubits specified by a user. All the qubit operations are decomposed into elementary gates realized in PennyLane library. Templates from the developed package can be used as qubit-operations when defining a QNode. |
format | Online Article Text |
id | pubmed-9282478 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-92824782022-07-15 Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library Antipov, A. V. Kiktenko, E. O. Fedorov, A. K. PLoS One Research Article 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-known quantum algorithms using PennyLane library. Additoinally, we used a simplified technique for decomposition of algorithms into a set of gates which are native for trapped-ion quantum processor and realized this technique using PennyLane library. The decomposition is used to analyze resources required for an execution of Shor’s algorithm on the level of native operations of trapped-ion quantum computer. Our original contribution is the derivation of coefficients needed for implementation of the decomposition. Templates within the package include all required elements from the quantum part of Shor’s algorithm, specifically, efficient modular exponentiation and quantum Fourier transform that can be realized for an arbitrary number of qubits specified by a user. All the qubit operations are decomposed into elementary gates realized in PennyLane library. Templates from the developed package can be used as qubit-operations when defining a QNode. Public Library of Science 2022-07-14 /pmc/articles/PMC9282478/ /pubmed/35834546 http://dx.doi.org/10.1371/journal.pone.0271462 Text en © 2022 Antipov et al https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Antipov, A. V. Kiktenko, E. O. Fedorov, A. K. Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library |
title | Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library |
title_full | Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library |
title_fullStr | Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library |
title_full_unstemmed | Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library |
title_short | Efficient realization of quantum primitives for Shor’s algorithm using PennyLane library |
title_sort | efficient realization of quantum primitives for shor’s algorithm using pennylane library |
topic | Research Article |
url | 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 |
work_keys_str_mv | AT antipovav efficientrealizationofquantumprimitivesforshorsalgorithmusingpennylanelibrary AT kiktenkoeo efficientrealizationofquantumprimitivesforshorsalgorithmusingpennylanelibrary AT fedorovak efficientrealizationofquantumprimitivesforshorsalgorithmusingpennylanelibrary |