Unified Architecture for Quantum Lookup Tables

TL;DR

This paper introduces a versatile quantum circuit architecture for lookup tables that optimizes resource tradeoffs, enabling efficient implementation on devices with limited connectivity and error resilience.

Contribution

It presents a unified, parameterized framework for quantum lookup tables that generalizes prior methods and achieves optimal tradeoffs under realistic hardware constraints.

Findings

Achieves poly-logarithmic error scaling with local 2D connectivity

Enables sublinear scaling in qubits, gates, and error resilience simultaneously

Provides tailored implementations for resource-constrained quantum devices

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. We present a general parameterized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal tradeoffs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results that previously required all-to-all connectivity, particularly, with the appropriate parameters, poly-logarithmic error scaling. We also identify novel 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.