Identifies conditions and explicit constructions allowing polynomial-size quantum circuits to implement geometry oracles for pseudorandom textured materials, in contrast to Grover-hard unstructured cases.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Demonstration of quantum circuit implementation for 2D obstacle flow via Carleman-linearized LBM solved with QSVT, achieving logarithmic qubit and gate scaling with lattice points.
citing papers explorer
-
How to make quantum cheese: efficient geometry oracles for exponentially many pseudorandom microstructures
Identifies conditions and explicit constructions allowing polynomial-size quantum circuits to implement geometry oracles for pseudorandom textured materials, in contrast to Grover-hard unstructured cases.
-
A Demonstration of Quantum Circuit Implementation for Obstacle Flow Using Carleman-Linearized Lattice Boltzmann Method
Demonstration of quantum circuit implementation for 2D obstacle flow via Carleman-linearized LBM solved with QSVT, achieving logarithmic qubit and gate scaling with lattice points.