Answers are grounded in this paper and cite their sources.
We provide a modular circuit-level implementation and resource estimates for several methods of block-encoding a dense <tex-math notation="LaTeX">N× N</tex-math> matrix of classical data to precision <tex-math notation="LaTeX">ε</tex-math> ; the minimal-depth method achieves a <tex-math notation="LaTeX">T</tex-math> -depth of <tex-math notation="LaTeX">O(log (N/ε)),</tex-math> while the minimal-count method achieves a <tex-math notation="LaTeX">T</tex-math> -count of <tex-math notation="LaTeX">O(Nlog (1/ε))</tex-math> . We examine resource tradeoffs between the different approaches, and we explore implementations of two separate models of quantum random access memory (QRAM). As part of this analysis, we provide a novel state preparation routine with <tex-math notation="LaTeX">T</tex-math> -depth <tex-math notation="LaTeX">O(log (N/ε)),</tex-math> improving on previous constructions with scaling <tex-math notation="LaTeX">O(log ² (N/ε))</tex-math> . Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
No takes yet. Share an insight, caveat, or question.
Clader et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: