http://orcid.org/0000-0002-1641-5388 / Pricing options quickly and accurately is a well known problem in finance. Quantum computing is being researched with the hope that quantum computers will be able to price options more efficiently than classical computers. This research extends
the quantum binomial option pricing model proposed by Zeqian Chen to European
put options and to Barrier options and develops a quantum algorithm to price them.
This research produced three key results. First, when Maxwell-Boltzmann statistics
are assumed, the quantum binomial model option prices are equivalent to the classical binomial model. Second, options can be priced efficiently on a quantum computer after the circuit has been built. The time complexity is O((N − τ)log(N − τ)) and it is in the BQP quantum computational complexity class. Finally, challenges extending the quantum binomial model to American, Asian and Bermudan options exist as the quantum binomial model does not take early exercise into account. / May 2009
| Identifer | oai:union.ndltd.org:MANITOBA/oai:mspace.lib.umanitoba.ca:1993/3154 |
| Date | 23 April 2009 |
| Creators | Meyer, Keith |
| Contributors | Kocay, W. (Computer Science), Thulasiram, T. (Computer Science)Southern, B.W. (Physics & Astronomy) |
| Source Sets | University of Manitoba Canada |
| Language | en_US |
| Detected Language | English |
| Format | 2401265 bytes, application/pdf |
Page generated in 0.0022 seconds