# [Subpolynomial query complexity for well-conditioned log-concave sampling](article.pdf)

**Author:** OpenAI  
**Date:** September 26, 2026

## Citation

```bibtex
@misc{OAI:Subpolynomial-query-complexity-for-well-conditioned-log-concave-sampling-September-26-2026,
  author = {{OpenAI}},
  title = {{Subpolynomial query complexity for well-conditioned log-concave sampling}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Subpolynomial-query-complexity-for-well-conditioned-log-concave-sampling-September-26-2026/article.pdf}{OAI:Subpolynomial-query-complexity-for-well-conditioned-log-concave-sampling-September-26-2026}},
  year = {2026}
}
```