A divide-and-conquer algorithm for quantum state preparation

Abstract Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states requir...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Israel F. Araujo, Daniel K. Park, Francesco Petruccione, Adenilton J. da Silva
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2021
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/a136e05410b94f9092cfe162388ad960
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:a136e05410b94f9092cfe162388ad960
record_format	dspace
spelling	oai:doaj.org-article:a136e05410b94f9092cfe162388ad9602021-12-02T13:17:49ZA divide-and-conquer algorithm for quantum state preparation10.1038/s41598-021-85474-12045-2322https://doaj.org/article/a136e05410b94f9092cfe162388ad9602021-03-01T00:00:00Zhttps://doi.org/10.1038/s41598-021-85474-1https://doaj.org/toc/2045-2322Abstract Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with exponential time advantage using a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space. We demonstrate a proof of concept on a real quantum device and present two applications for quantum machine learning. We expect that this new loading strategy allows the quantum speedup of tasks that require to load a significant volume of information to quantum devices.Israel F. AraujoDaniel K. ParkFrancesco PetruccioneAdenilton J. da SilvaNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 11, Iss 1, Pp 1-12 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Israel F. Araujo Daniel K. Park Francesco Petruccione Adenilton J. da Silva A divide-and-conquer algorithm for quantum state preparation
description	Abstract Advantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with exponential time advantage using a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space. We demonstrate a proof of concept on a real quantum device and present two applications for quantum machine learning. We expect that this new loading strategy allows the quantum speedup of tasks that require to load a significant volume of information to quantum devices.
format	article
author	Israel F. Araujo Daniel K. Park Francesco Petruccione Adenilton J. da Silva
author_facet	Israel F. Araujo Daniel K. Park Francesco Petruccione Adenilton J. da Silva
author_sort	Israel F. Araujo
title	A divide-and-conquer algorithm for quantum state preparation
title_short	A divide-and-conquer algorithm for quantum state preparation
title_full	A divide-and-conquer algorithm for quantum state preparation
title_fullStr	A divide-and-conquer algorithm for quantum state preparation
title_full_unstemmed	A divide-and-conquer algorithm for quantum state preparation
title_sort	divide-and-conquer algorithm for quantum state preparation
publisher	Nature Portfolio
publishDate	2021
url	https://doaj.org/article/a136e05410b94f9092cfe162388ad960
work_keys_str_mv	AT israelfaraujo adivideandconqueralgorithmforquantumstatepreparation AT danielkpark adivideandconqueralgorithmforquantumstatepreparation AT francescopetruccione adivideandconqueralgorithmforquantumstatepreparation AT adeniltonjdasilva adivideandconqueralgorithmforquantumstatepreparation AT israelfaraujo divideandconqueralgorithmforquantumstatepreparation AT danielkpark divideandconqueralgorithmforquantumstatepreparation AT francescopetruccione divideandconqueralgorithmforquantumstatepreparation AT adeniltonjdasilva divideandconqueralgorithmforquantumstatepreparation
_version_	1718393347893100544

A divide-and-conquer algorithm for quantum state preparation

Ejemplares similares