Built on

S. Bravyi, D. Gosset, R. Koenig, and M. Tomamichel, “Quantum advantage with noisy shallow circuits in 3d,” (2019), arXiv:1904.01502 [quant-ph]
Original
1904
Earlier work this paper cites.
D. J. Egger, R. G. Gutiérrez, J. C. Mestre, and S. Woerner, “Credit risk analysis using quantum computers,” (2019), arXiv:1907.03044 [quant-ph]
Original
1907
Earlier work this paper cites.
I. Kerenidis, A. Prakash, and D. Szilágyi, “Quantum algorithms for portfolio optimization,” (2019), arXiv:1908.08040 [math.OC]
Original
1908
Earlier work this paper cites.
C. Bravo-Prieto, R. LaRose, M. Cerezo, Y. Subasi, L. Cincio, and P. J. Coles, “Variational quantum linear solver,” (2019), arXiv:1909.05820 [quant-ph]
Original
1909
Earlier work this paper cites.
X. Xu, J. Sun, S. Endo, Y. Li, S. C. Benjamin, and X. Yuan, “Variational algorithms for linear algebra,” (2019), arXiv:1909.03898 [quant-ph]
Original
1909
Earlier work this paper cites.
H.-Y. Huang, K. Bharti, and P. Rebentrost, “Near-term quantum algorithms for linear systems of equations,” (2019), arXiv:1909.07344 [quant-ph]
Original
1909
Earlier work this paper cites.
J. J. García-Ripoll, “Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations,” (2019), arXiv:1909.06619 [quant-ph]
Original
1909
Earlier work this paper cites.
C. Cirstoiu, Z. Holmes, J. Iosue, L. Cincio, P. J. Coles, and A. Sornborger, “Variational fast forwarding for quantum simulation beyond the coherence time,” (2019), arXiv:1910.04292 [quant-ph]
Original
1910
Earlier work this paper cites.
J. Cook, S. Eidenbenz, and A. Bärtschi, “The quantum alternating operator ansatz on max-k vertex cover,” (2019), arXiv:1910.13483 [quant-ph]
Original
1910
Earlier work this paper cites.
K. Itô, Proceedings of the Imperial Academy 20
1944
Earlier work this paper cites.
S. Kullback and R. A. Leibler, The Annals of Mathematical Statistics 22
1951
Earlier work this paper cites.
F. Black and M. Scholes, Journal of Political Economy 81
1973
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Physical Review A 52
1995
Earlier work this paper cites.
P. W. Shor, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
L. K. Grover, Physical Review Letters 79
1997
Earlier work this paper cites.
W. Dür, G. Vidal, and J. I. Cirac, Physical Review A 62
2000
Earlier work this paper cites.
G. Brassard, P. Høyer, and M. Mosca, in Quantum Computation and Information, Contemporary Mathematics Series. AMS (2002) p. 0005055
2002
Earlier work this paper cites.
L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” (2002), arXiv:quant-ph/0208112 [quant-ph]
2002
Earlier work this paper cites.
N. Schuch and J. Siewert, Physical Review A 67
2003
Earlier work this paper cites.
S. Iblisdir, R. Orús, and J. I. Latorre, Physical Review B 75
2007
Earlier work this paper cites.
F. Verstraete, J. I. Cirac, and J. I. Latorre, Physical Review A 79
2009
Earlier work this paper cites.
R. C. Bialczak et al. , Nature Physics 6
2010
Earlier work this paper cites.

Similar

S. Wallis, Journal of Quantitative Linguistics 20
2013
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, Nature Communications 5
2014
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” (2014), arXiv:1411.4028 [quant-ph]
Original
2014
Cited alongside, same era.
M. L. de Prado, SSRN Electronic Journal , (2015)
2015
Cited alongside, same era.
A. Montanaro, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471
2015
Cited alongside, same era.
G. Rosenberg, P. Haghnegahdar, P. Goddard, P. Carr, K. Wu, and M. L. de Prado, IEEE Journal of Selected Topics in Signal Processing 10

Then

S. Endo, S. C. Benjamin, and Y. Li, Physical Review X 8
2018
Later among the works it cites.
O. Higgott, D. Wang, and S. Brierley, Quantum 3
2019
Closest in time.
T. Jones, S. Endo, S. McArdle, X. Yuan, and S. C. Benjamin, Physical Review A 99
2019
Closest in time.
C. Kokail et al. , Nature 569
2019
Closest in time.
R. LaRose, A. Tikku, E. O’Neel-Judy, L. Cincio, and P. J. Coles, npj Quantum Information 5
2019
Closest in time.
D. Zhu et al. , Science advances 5
2019
Closest in time.
Y. Subasi, L. Cincio, and P. J. Coles, Journal of Physics A: Mathematical and Theoretical 52

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…

2019

Quantum unary approach to option pricing

Ramos-Calderer, Sergi, Pérez-Salinas, Adrián, García-Martín, Diego et al.

Understand

We present a quantum algorithm for European option pricing in finance, where the key idea is to work in the unary representation of the asset value.

The algorithm needs novel circuitry and is divided in three parts: first, the amplitude distribution corresponding to the asset value at maturity is generated using a low depth circuit; second, the computation of the expected return is computed with simple controlled gates; and third, standard Amplitude Estimation is used to gain quantum advantage.
On the positive side, unary representation remarkably simplifies the structure and depth of the quantum circuit.
Amplitude distributions uses quantum superposition to bypass the role of classical Monte Carlo simulation.

Built on

S. Bravyi, D. Gosset, R. Koenig, and M. Tomamichel, “Quantum advantage with noisy shallow circuits in 3d,” (2019), arXiv:1904.01502 [quant-ph]
Original
1904
Earlier work this paper cites.
D. J. Egger, R. G. Gutiérrez, J. C. Mestre, and S. Woerner, “Credit risk analysis using quantum computers,” (2019), arXiv:1907.03044 [quant-ph]
Original
1907
Earlier work this paper cites.
I. Kerenidis, A. Prakash, and D. Szilágyi, “Quantum algorithms for portfolio optimization,” (2019), arXiv:1908.08040 [math.OC]
Original
1908
Earlier work this paper cites.
C. Bravo-Prieto, R. LaRose, M. Cerezo, Y. Subasi, L. Cincio, and P. J. Coles, “Variational quantum linear solver,” (2019), arXiv:1909.05820 [quant-ph]
Original
1909
Earlier work this paper cites.
X. Xu, J. Sun, S. Endo, Y. Li, S. C. Benjamin, and X. Yuan, “Variational algorithms for linear algebra,” (2019), arXiv:1909.03898 [quant-ph]
Original
1909
Earlier work this paper cites.
H.-Y. Huang, K. Bharti, and P. Rebentrost, “Near-term quantum algorithms for linear systems of equations,” (2019), arXiv:1909.07344 [quant-ph]
Original
1909
Earlier work this paper cites.
J. J. García-Ripoll, “Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations,” (2019), arXiv:1909.06619 [quant-ph]
Original
1909
Earlier work this paper cites.
C. Cirstoiu, Z. Holmes, J. Iosue, L. Cincio, P. J. Coles, and A. Sornborger, “Variational fast forwarding for quantum simulation beyond the coherence time,” (2019), arXiv:1910.04292 [quant-ph]
Original
1910
Earlier work this paper cites.
J. Cook, S. Eidenbenz, and A. Bärtschi, “The quantum alternating operator ansatz on max-k vertex cover,” (2019), arXiv:1910.13483 [quant-ph]
Original
1910
Earlier work this paper cites.
K. Itô, Proceedings of the Imperial Academy 20
1944
Earlier work this paper cites.
S. Kullback and R. A. Leibler, The Annals of Mathematical Statistics 22
1951
Earlier work this paper cites.
F. Black and M. Scholes, Journal of Political Economy 81
1973
Earlier work this paper cites.
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Physical Review A 52
1995
Earlier work this paper cites.
P. W. Shor, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
L. K. Grover, Physical Review Letters 79
1997
Earlier work this paper cites.
W. Dür, G. Vidal, and J. I. Cirac, Physical Review A 62
2000
Earlier work this paper cites.
G. Brassard, P. Høyer, and M. Mosca, in Quantum Computation and Information, Contemporary Mathematics Series. AMS (2002) p. 0005055
2002
Earlier work this paper cites.
L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” (2002), arXiv:quant-ph/0208112 [quant-ph]
2002
Earlier work this paper cites.
N. Schuch and J. Siewert, Physical Review A 67
2003
Earlier work this paper cites.
S. Iblisdir, R. Orús, and J. I. Latorre, Physical Review B 75
2007
Earlier work this paper cites.
F. Verstraete, J. I. Cirac, and J. I. Latorre, Physical Review A 79
2009
Earlier work this paper cites.
R. C. Bialczak et al. , Nature Physics 6
2010
Earlier work this paper cites.

Similar

S. Wallis, Journal of Quantitative Linguistics 20
2013
Cited alongside, same era.
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, Nature Communications 5
2014
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” (2014), arXiv:1411.4028 [quant-ph]
Original
2014
Cited alongside, same era.
M. L. de Prado, SSRN Electronic Journal , (2015)
2015
Cited alongside, same era.
A. Montanaro, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471
2015
Cited alongside, same era.
G. Rosenberg, P. Haghnegahdar, P. Goddard, P. Carr, K. Wu, and M. L. de Prado, IEEE Journal of Selected Topics in Signal Processing 10

Then

S. Endo, S. C. Benjamin, and Y. Li, Physical Review X 8
2018
Later among the works it cites.
O. Higgott, D. Wang, and S. Brierley, Quantum 3
2019
Closest in time.
T. Jones, S. Endo, S. McArdle, X. Yuan, and S. C. Benjamin, Physical Review A 99
2019
Closest in time.
C. Kokail et al. , Nature 569
2019
Closest in time.
R. LaRose, A. Tikku, E. O’Neel-Judy, L. Cincio, and P. J. Coles, npj Quantum Information 5
2019
Closest in time.
D. Zhu et al. , Science advances 5
2019
Closest in time.
Y. Subasi, L. Cincio, and P. J. Coles, Journal of Physics A: Mathematical and Theoretical 52

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…

2016

Cited alongside, same era.

A. Montanaro and S. Pallister, Physical Review A 93

2016

Cited alongside, same era.

Y. Li and S. C. Benjamin, Physical Review X 7

2017

Cited alongside, same era.

M. Hebenstreit, D. Alsina, J. I. Latorre, and B. Kraus, Physical Review A 95

2017

Cited alongside, same era.

K. Temme, S. Bravyi, and J. M. Gambetta, Physical Review Letters 119

2017

Cited alongside, same era.

J. Preskill, Quantum 2

2018

Cited alongside, same era.

K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, Physical Review A 98

2018

Cited alongside, same era.

2019

Closest in time.

S. Woerner and D. J. Egger, npj Quantum Information 5

2019

Closest in time.

C. Zoufal, A. Lucchi, and S. Woerner, npj Quantum Information 5

2019

Closest in time.

F. Arute et al. , Nature 574

2019

Closest in time.

S. Hadfield, Z. Wang, B. O’Gorman, E. Rieffel, D. Venturelli, and R. Biswas, Algorithms 12

2019

Closest in time.

H. Abraham et al. , “Qiskit: An open-source framework for quantum computing,” (2019)

2019

Closest in time.

C. Bravo-Prieto, D. García-Martín, and J. I. Latorre, Physical Review A 101

2020

Closest in time.

A. Pérez-Salinas, A. Cervera-Lierta, E. Gil-Fuster, and J. I. Latorre, Quantum 4

2020

Closest in time.

N. Stamatopoulos, D. J. Egger, Y. Sun, C. Zoufal, R. Iten, N. Shen, and S. Woerner, Quantum 4

2020

Closest in time.

S. Aaronson and P. Rall, Symposium on Simplicity in Algorithms , 24–32 (2020)

2020

Closest in time.

M. Steudtner and S. Wehner, Physical Review A 101

2020

Closest in time.

Y. Suzuki, S. Uno, R. Raymond, T. Tanaka, T. Onodera, and N. Yamamoto, Quantum Information Processing 19

2020

Closest in time.

B. T. Gard, L. Zhu, G. S. Barron, N. J. Mayhall, S. E. Economou, and E. Barnes, npj Quantum Information 6

2020

Closest in time.

Z. Wang, N. C. Rubin, J. M. Dominy, and E. G. Rieffel, Physical Review A 101

2020

Closest in time.

S. Ramos-Calderer and A. Pérez-Salinas, “Quantum finance,” https://github.com/UB-Quantic/quantum-unary-option-pricing (2020)

2020

Closest in time.

A. Martin, B. Candelas, Á. Rodríguez-Rozas, J. D. Martín-Guerrero, X. Chen, L. Lamata, R. Orús, E. Solano, and M. Sanz, Physical Review Research 3

2021

Closest in time.