Encodes M by N matrix into quantum state using Θ(log(MN)) qubits in O(log²(MN)) time via segment tree embedded in bucket brigade QRAM with constant ancillas and O(MN) memory cells.
Quantum algorithm for stochastic optimal stopping problems with applications in finance
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative 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
-
Efficient Quantum State Preparation with Bucket Brigade QRAM
Encodes M by N matrix into quantum state using Θ(log(MN)) qubits in O(log²(MN)) time via segment tree embedded in bucket brigade QRAM with constant ancillas and O(MN) memory cells.
-
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.