Hamiltonian Simulation with Optimal Sample Complexity
| Autor: | Shelby Kimmel, Maris Ozols, Theodore J. Yoder, Cedric Yen-Yu Lin, Guang Hao Low |
|---|---|
| Přispěvatelé: | Ozols, Maris [0000-0002-3238-8594], Apollo - University of Cambridge Repository |
| Rok vydání: | 2016 |
| Předmět: |
Density matrix
Computer Networks and Communications Computer science QC1-999 FOS: Physical sciences 01 natural sciences 010305 fluids & plasmas symbols.namesake Superposition principle quant-ph Quantum state 0103 physical sciences Computer Science (miscellaneous) 010306 general physics Linear combination Quantum Quantum computer Quantum Physics Physics Statistical and Nonlinear Physics QA75.5-76.95 16. Peace & justice Hermitian matrix Computational Theory and Mathematics ComputerSystemsOrganization_MISCELLANEOUS Electronic computers. Computer science symbols Hamiltonian (quantum mechanics) Quantum Physics (quant-ph) Algorithm |
| Zdroj: | npj Quantum Information, Vol 3, Iss 1, Pp 1-7 (2017) |
| DOI: | 10.48550/arxiv.1608.00281 |
| Popis: | We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating a coherent superposition of pure states, when given sample access to those states. We also show that this sample-based Hamiltonian simulation can be used as the basis of a universal model of quantum computation that requires only partial swap operations and simple single-qubit states. Comment: Accepted talk at TQC 2016, 3 Fig, 5 Appendices |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|