Prospects and challenges of quantum finance
Quantum computers are expected to have substantial impact on the finance industry, as they
will be able to solve certain problems considerably faster than the best known classical …
will be able to solve certain problems considerably faster than the best known classical …
[图书][B] Quantum walks and search algorithms
R Portugal - 2013 - Springer
This is a textbook about quantum walks and quantum search algorithms. The readers will
take advantage of the pedagogical aspects and learn the topics faster and make less effort …
take advantage of the pedagogical aspects and learn the topics faster and make less effort …
Quantum approximate counting, simplified
S Aaronson, P Rall - Symposium on simplicity in algorithms, 2020 - SIAM
In 1998, Brassard, Høyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for
approximate counting. Given a list of N items, K of them marked, their algorithm estimates K …
approximate counting. Given a list of N items, K of them marked, their algorithm estimates K …
Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE
S Jaques, JM Schanck - Advances in Cryptology–CRYPTO 2019: 39th …, 2019 - Springer
We introduce models of computation that enable direct comparisons between classical and
quantum algorithms. Incorporating previous work on quantum computation and error …
quantum algorithms. Incorporating previous work on quantum computation and error …
Low depth algorithms for quantum amplitude estimation
We design and analyze two new low depth algorithms for amplitude estimation (AE)
achieving an optimal tradeoff between the quantum speedup and circuit depth. For $\beta\in …
achieving an optimal tradeoff between the quantum speedup and circuit depth. For $\beta\in …
On the compressed-oracle technique, and post-quantum security of proofs of sequential work
We revisit the so-called compressed oracle technique, introduced by Zhandry for analyzing
quantum algorithms in the quantum random oracle model (QROM). To start off with, we offer …
quantum algorithms in the quantum random oracle model (QROM). To start off with, we offer …
Low-depth amplitude estimation on a trapped-ion quantum computer
Amplitude estimation (AE) is a fundamental quantum algorithmic primitive that enables
quantum computers to achieve quadratic speedups for a large class of statistical estimation …
quantum computers to achieve quadratic speedups for a large class of statistical estimation …
Parallel quantum algorithm for hamiltonian simulation
We study how parallelism can speed up quantum simulation. A parallel quantum algorithm
is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse …
is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse …
The NISQ Complexity of Collision Finding
Collision-resistant hashing, a fundamental primitive in modern cryptography, ensures that
there is no efficient way to find distinct inputs that produce the same hash value. This …
there is no efficient way to find distinct inputs that produce the same hash value. This …
Tight quantum depth lower bound for solving systems of linear equations
Since Harrow et al.[AW Harrow, A. Hassidim, and S. Lloyd, Phys. Rev. Lett. 103, 150502
(2009) 0031-9007 10.1103/PhysRevLett. 103.150502] showed that a system of linear …
(2009) 0031-9007 10.1103/PhysRevLett. 103.150502] showed that a system of linear …