Unified Architecture for Quantum Lookup Tables
arXiv:2406.18030 · doi:10.1103/d896-mktn
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.
References in corpus (28)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- Suppressing quantum errors by scaling a surface code logical qubit
- Logical quantum processor based on reconfigurable atom arrays
- Quantum random access memory
- Hamiltonian Simulation by Qubitization
- Quantum algorithms for quantum chemistry and quantum materials science
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Roads towards fault-tolerant universal quantum computation
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Quantum machine learning: a classical perspective
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Architectures for a quantum random access memory
- Demonstration of fault-tolerant universal quantum gate operations
- Quantum computing enhanced computational catalysis
- Provably efficient machine learning for quantum many-body problems
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Entangling logical qubits with lattice surgery
- On the robustness of bucket brigade quantum RAM
- Fault tolerant resource estimation of quantum random-access memories
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Resilience of quantum random access memory to generic noise
- Surface code compilation via edge-disjoint paths
- Quantum algorithms: A survey of applications and end-to-end complexities
- Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates