Hamiltonian simulation with optimal sample complexity

Quantum Software from Quantum States One of the hallmarks of quantum computation is the storage and extraction of information within quantum systems. Recently, Lloyd, Mohseni and Rebentrost created a protocol to treat multiple identical copies of a quantum state as “quantum software”, specifying a q...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Shelby Kimmel, Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, Theodore J. Yoder
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2017
Materias:	Physics QC1-999 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/991483e91eb14e1bb598a6138ba66485
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:991483e91eb14e1bb598a6138ba66485
record_format	dspace
spelling	oai:doaj.org-article:991483e91eb14e1bb598a6138ba664852021-12-02T12:33:37ZHamiltonian simulation with optimal sample complexity10.1038/s41534-017-0013-72056-6387https://doaj.org/article/991483e91eb14e1bb598a6138ba664852017-03-01T00:00:00Zhttps://doi.org/10.1038/s41534-017-0013-7https://doaj.org/toc/2056-6387Quantum Software from Quantum States One of the hallmarks of quantum computation is the storage and extraction of information within quantum systems. Recently, Lloyd, Mohseni and Rebentrost created a protocol to treat multiple identical copies of a quantum state as “quantum software”, specifying a quantum program to be run on any other state. They use this approach to do principal component analysis of the software state. Here, we expand on their results, providing protocols for running more-complex quantum programs specified by several different states. Our protocols can be used to analyze the relationship between different states (for example, deciding whether states are orthogonal) and to create new states (such as coherent linear combinations of two states). We also outline the optimality of Lloyd et al.’s original protocol, as well as our new protocols.Shelby KimmelCedric Yen-Yu LinGuang Hao LowMaris OzolsTheodore J. YoderNature PortfolioarticlePhysicsQC1-999Electronic computers. Computer scienceQA75.5-76.95ENnpj Quantum Information, Vol 3, Iss 1, Pp 1-7 (2017)
institution	DOAJ
collection	DOAJ
language	EN
topic	Physics QC1-999 Electronic computers. Computer science QA75.5-76.95
spellingShingle	Physics QC1-999 Electronic computers. Computer science QA75.5-76.95 Shelby Kimmel Cedric Yen-Yu Lin Guang Hao Low Maris Ozols Theodore J. Yoder Hamiltonian simulation with optimal sample complexity
description	Quantum Software from Quantum States One of the hallmarks of quantum computation is the storage and extraction of information within quantum systems. Recently, Lloyd, Mohseni and Rebentrost created a protocol to treat multiple identical copies of a quantum state as “quantum software”, specifying a quantum program to be run on any other state. They use this approach to do principal component analysis of the software state. Here, we expand on their results, providing protocols for running more-complex quantum programs specified by several different states. Our protocols can be used to analyze the relationship between different states (for example, deciding whether states are orthogonal) and to create new states (such as coherent linear combinations of two states). We also outline the optimality of Lloyd et al.’s original protocol, as well as our new protocols.
format	article
author	Shelby Kimmel Cedric Yen-Yu Lin Guang Hao Low Maris Ozols Theodore J. Yoder
author_facet	Shelby Kimmel Cedric Yen-Yu Lin Guang Hao Low Maris Ozols Theodore J. Yoder
author_sort	Shelby Kimmel
title	Hamiltonian simulation with optimal sample complexity
title_short	Hamiltonian simulation with optimal sample complexity
title_full	Hamiltonian simulation with optimal sample complexity
title_fullStr	Hamiltonian simulation with optimal sample complexity
title_full_unstemmed	Hamiltonian simulation with optimal sample complexity
title_sort	hamiltonian simulation with optimal sample complexity
publisher	Nature Portfolio
publishDate	2017
url	https://doaj.org/article/991483e91eb14e1bb598a6138ba66485
work_keys_str_mv	AT shelbykimmel hamiltoniansimulationwithoptimalsamplecomplexity AT cedricyenyulin hamiltoniansimulationwithoptimalsamplecomplexity AT guanghaolow hamiltoniansimulationwithoptimalsamplecomplexity AT marisozols hamiltoniansimulationwithoptimalsamplecomplexity AT theodorejyoder hamiltoniansimulationwithoptimalsamplecomplexity
_version_	1718393874810929152

Hamiltonian simulation with optimal sample complexity

Ejemplares similares