• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 1
  • Tagged with
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Extending and simulating the quantum binomial options pricing model

Meyer, Keith 23 April 2009 (has links)
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
2

Extending and simulating the quantum binomial options pricing model

Meyer, Keith 23 April 2009 (has links)
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
3

Extending and simulating the quantum binomial options pricing model

Meyer, Keith 23 April 2009 (has links)
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.
4

Discrete time methods of pricing Asian options

Dyakopu, Neliswa B. January 2014 (has links)
>Magister Scientiae - MSc / This dissertation studies the computation methods of pricing of Asian options. Asian options are options in which the underlying variable is the average price over a period of time. Because of this, Asian options have a lower volatility and this render them cheaper relative to their European counterparts. Asian options belong to the so-called path-dependent derivatives; they are among the most difficult to price and hedge both analytically and numerically. In practice, it is only discrete Asian options that are traded, however continuous Asian options are used for studying purposes. Several approaches have been proposed in the literature, including Monte Carlo simulations, tree-based methods, Taylor’s expansion, partial differential equations, and analytical ap- proximations among others. When using partial differential equations for pricing of continuous time Asian options, the high dimensionality is problematic. In this dissertation we focus on the discrete time methods. We start off by explaining the binomial tree method, and our last chapter presents the very exciting and relatively simple method of Tsao and Huang, using Taylor approximations. The main papers that are used in this dissertation are articles by Jan Vecer (2001); LCG Rogers (1995); Eric Benhamou (2001); Gianluca Fusai (2007); Kamizono, Kariya and Nakatsuma (2006) and Tsao and Huang (2007). The author has provided computations, including graphs and tables dispersed over the different chapters, to demonstrate the utility of the methods. We observe various parameters of influence such as correlation, volatility, strike, etc. A further contribution by the author of this dissertation is, in particular, in Chapter 5, in the presentation of the work of Tsao et al. Here we have provided slightly more detailed explanations and again some further computational tables.

Page generated in 0.0537 seconds