Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
Quantum arithmetic with the quantum Fourier transform
3 Pith papers cite this work, alongside 168 external citations. Polarity classification is still indexing.
3
Pith papers citing it
168
external citations · OpenAlex
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Quantum algorithm finds eigenvalues of parameterized matrix families by minimizing singular values and applies it to Schrödinger equation collocation with O(sqrt(N)) scaling.
A quantum Monte Carlo algorithm solves multidimensional Black-Scholes PDEs for option pricing with polynomial complexity in dimension d and accuracy 1/ε, with rigorous error bounds and a claimed speedup over classical Monte Carlo for bounded payoffs.
citing papers explorer
-
A Polylogarithmic-Depth Quantum Multiplier
Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
-
Quantum algorithm for solving generalized eigenvalue problems with application to the Schr\"odinger equation
Quantum algorithm finds eigenvalues of parameterized matrix families by minimizing singular values and applies it to Schrödinger equation collocation with O(sqrt(N)) scaling.
-
Quantum Monte Carlo algorithm for option pricing and its complexity analysis
A quantum Monte Carlo algorithm solves multidimensional Black-Scholes PDEs for option pricing with polynomial complexity in dimension d and accuracy 1/ε, with rigorous error bounds and a claimed speedup over classical Monte Carlo for bounded payoffs.