From Monte Carlo to quantum computation

Stefan Heinrich

Mathematics and Computers in Simulation (MATCOM), 2003, vol. 62, issue 3, 219-230

Abstract: Quantum computing was so far mainly concerned with discrete problems. Recently, Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, what advantages quantum computing can bring over classical deterministic or randomized methods for this type of a problem.

Keywords: Monte Carlo algorithms; Quantum computation complexity (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475402002392
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:62:y:2003:i:3:p:219-230

DOI: 10.1016/S0378-4754(02)00239-2

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().