DOE OSTI · 3366773
Unified architecture for quantum lookup tables
Abstract
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Zhu, Shuchen [Microsoft Corporation, Redmond, WA (United States); Duke Univ., Durham, NC (United States); Georgetown Univ., Washington, DC (United States)] (ORCID:0000000212402002), Sundaram, Aarthi [Microsoft Corporation, Redmond, WA (United States)], Low, Guang Hao [Microsoft Corporation, Redmond, WA (United States)] (ORCID:0000000269341052). 2025-12-01. Unified architecture for quantum lookup tables. https://doi.org/10.1103/d896-mktn
Cite the original work for its findings. Save a collection to share your selection of sources.