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.
Arbitrary bound- ary conditions and constraints in quantum algorithms for differential equations via penalty projections.arXiv preprint 26
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Pivot-shifted Carleman linearization with Lyapunov transform enables logarithmic truncation and removes initial-condition lower bounds for quantum simulation of a broader class of nonlinear ODEs.
Human-AI collaboration expanded a meta-idea on rational approximation into sign-embedding quantum algorithms for matrix problems, with humans retaining final judgment on routes and refinements.
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.
-
Quantum Algorithms for Nonlinear Differential Equations via Pivot-Shifted Carleman Linearization
Pivot-shifted Carleman linearization with Lyapunov transform enables logarithmic truncation and removes initial-condition lower bounds for quantum simulation of a broader class of nonlinear ODEs.
-
From Meta Idea to Advanced Mathematical Discovery -- Human-AI Co-Discovery of Sign-Embedding Quantum Algorithms
Human-AI collaboration expanded a meta-idea on rational approximation into sign-embedding quantum algorithms for matrix problems, with humans retaining final judgment on routes and refinements.