A New Perspective of Constructing Resource-Efficient Data-Lookup Quantum Oracles
Year: 2025
Type: conference-paper
Abstract: Quantum oracles are essential components in quantum algorithms, enabling the efficient evaluation of Boolean functions. This paper presents a novel approach to constructing resource-efficient data-lookup quantum oracles for fault-tolerant quantum computing (FTQC) systems. By leveraging the algebraic normal form (ANF) of Boolean functions, rather than the truth tables used in existing approaches, we achieve a provable$\mathcal{O}(n)$reduction in the minimum Toffoli gate count - a key cost metric in FTQC - for constructing an$n$-variable data-lookup oracle. Additionally, exploiting ANF product terms allows for the exploration of space-time trade-offs, enabling the design of data-lookup oracles with distinct resource requirements that can adapt to varying system constraints - flexibility that current methods do not offer. Based on the target quantum system's requirements, our approach offers the ability to tailor oracle designs to minimize either Toffoli count and depth, or ancillary qubit usage.
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Synopsys
OpenAlex ID: W4416874849