Quantum pricing with a smile: implementation of local volatility model on quantum computer

被引:13
作者
Kaneko, Kazuya [1 ]
Miyamoto, Koichi [1 ,2 ]
Takeda, Naoyuki [1 ]
Yoshino, Kazuyoshi [1 ]
机构
[1] Mizuho DL Financial Technol Co Ltd, Tokyo, Japan
[2] Osaka Univ, Ctr Quantum Informat & Quantum Biol, Osaka, Japan
关键词
Finance; Pricing; Quantum computing; NETWORKS; CIRCUITS;
D O I
10.1140/epjqt/s40507-022-00125-2
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Quantum algorithms for the pricing of financial derivatives have been discussed in recent papers. However, the pricing model discussed in those papers is too simple for practical purposes. It motivates us to consider how to implement more complex models used in financial institutions. In this paper, we consider the local volatility (LV) model, in which the volatility of the underlying asset price depends on the price and time. As in previous studies, we use the quantum amplitude estimation (QAE) as the main source of quantum speedup and discuss the state preparation step of the QAE, or equivalently, the implementation of the asset price evolution. We compare two types of state preparation: One is the amplitude encoding (AE) type, where the probability distribution of the derivative's payoff is encoded to the probabilistic amplitude. The other is the pseudo-random number (PRN) type, where sequences of PRNs are used to simulate the asset price evolution as in classical Monte Carlo simulation. We present detailed circuit diagrams for implementing these preparation methods in fault-tolerant quantum computation and roughly estimate required resources such as the number of qubits and T-count.
引用
收藏
页数:32
相关论文
共 51 条
[1]   A quantum architecture for multiplying signed integers [J].
Alvarez-Sanchez, J. J. ;
Alvarez-Bravo, J. V. ;
Nieto, L. M. .
5TH INTERNATIONAL SYMPOSIUM ON QUANTUM THEORY AND SYMMETRIES QTS5, 2008, 128
[2]   Polynomial-Time T-Depth Optimization of Clifford plus T Circuits Via Matroid Partitioning [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2014, 33 (10) :1476-1489
[3]   A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele ;
Roetteler, Martin .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (06) :818-830
[4]  
[Anonymous], 1994, Risk
[5]  
[Anonymous], 1955, Rend. Circolo Mat. Palermo, DOI [DOI 10.1007/BF02846028, 10.1007/BF02846028]
[6]  
[Anonymous], 2004, Stochastic calculus for finance 2. Continuous-time models
[7]   Cost-efficient design of a quantum multiplier-accumulator unit [J].
Babu, Hafiz Md. Hasan .
QUANTUM INFORMATION PROCESSING, 2017, 16 (01)
[8]   Efficient networks for quantum factoring [J].
Beckman, D ;
Chari, AN ;
Devabhaktuni, S ;
Preskill, J .
PHYSICAL REVIEW A, 1996, 54 (02) :1034-1063
[9]   PRICING OF OPTIONS AND CORPORATE LIABILITIES [J].
BLACK, F ;
SCHOLES, M .
JOURNAL OF POLITICAL ECONOMY, 1973, 81 (03) :637-654
[10]  
Brassard G., 2002, CONTEMP MATH-SINGAP, V305, P53, DOI 10.1090/conm/305/05215