quantum-geometry-oracles

# Quantum Geometry Oracles ## Problem Quantum algorithms for linear systems require oracle access to matrix geometry. For materials with exponentially many geometric features, oracles are generally intractable (Grover-type lower bounds). ## Key Result **Pseudorandom locally textured materials** admit polynomial-size quantum circuit oracles when suitable structure is imposed, despite having exponentially many geometric features. ## Oracle Design Framework ### Intractable Cases (Lower Bounds) - Unstructured geometries with exponentially many features → Grover-type Ω(√N) lower bounds - No additional symmetry or structure to exploit ### Tractable Cases (Polynomial Circuits) - **Pseudorandom local textures**: Materials with rule-based (not exhaustive) descriptions - **Structured randomness**: Local patterns with global pseudorandom properties - Explicit circuit constructions provided for these oracles ## Design Steps 1. **Characterize material structure** — Is it rule-based or exhaustively described? 2. **Check for local texture patterns** — Can features be described by local rules? 3. **Design oracle circuit** — Use rule-composition to build polynomial-size circuits 4. **Verify numerically** — Test oracle behavior through simulation ## Applications - Quantum simulation of structured materials - Linear system solvers with geometric oracles - Materials science on quantum computers ## Trigger Keywords quantum oracle, geometry oracle, material simulation, pseudorandom structure, quantum linear systems, Grover lower bound ## Reference - arXiv:2606.00222: "How to make quantum cheese: efficient geometry oracles for exponentially many pseudorandom microstructures" (Barthe, 2026)