Show simple item record Sanders, Barry C. 2018-07-25T10:11:46Z 2018-07-25T10:11:46Z 2009
dc.identifier.issn 1815-3852
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 *
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

Files in this item

This item appears in the following Issue(s)

Show simple item record

Attribution-NonCommercial-ShareAlike 4.0 International Except where otherwise noted, this item's license is described as Attribution-NonCommercial-ShareAlike 4.0 International

All Journals

Advanced Search


Administrator Account