Algorithm for quantum simulation

dc.contributor.author	Sanders, Barry C.
dc.date.accessioned	2018-07-25T10:11:46Z
dc.date.available	2018-07-25T10:11:46Z
dc.date.issued	2009
dc.identifier.issn	1815-3852
dc.identifier.uri	https://journal.uob.edu.bh:443/handle/123456789/733
dc.description.abstract	We summarize our algorithm for simulating Hamiltonian evolution and show that the cost of the simulation, in terms of black-box calls to the Hamiltonian oracle, is nearly linear in time and the space complexity for given sparseness is nearly constant	en_US
dc.language.iso	en	en_US
dc.publisher	University of Bahrain	en_US
dc.rights	Attribution-NonCommercial-ShareAlike 4.0 International	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/4.0/	*
dc.title	Algorithm for quantum simulation	en_US
dc.type	Article	en_US
dc.source.title	Arab Journal of Basic and Applied Sciences
dc.abbreviatedsourcetitle	AJBAS