Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
Black-box quantum state preparation without arithmetic
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Precomputes rotation angles classically and adds a magnitude-then-phase procedure to enable complex-valued state preparation on BBQRAM at unchanged O(log²(MN)) query cost with no reversible arithmetic on the QPU.
citing papers explorer
-
Quantum algorithm for solving high-dimensional linear stochastic differential equations via amplitude encoding of the noise term
Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
-
Efficient Complex-Valued State Preparation on Bucket Brigade QRAM
Precomputes rotation angles classically and adds a magnitude-then-phase procedure to enable complex-valued state preparation on BBQRAM at unchanged O(log²(MN)) query cost with no reversible arithmetic on the QPU.