arXiv (All)
open access
Optimal Quantum Speedups for Repeatedly Nested Expectation Estimation
We study the estimation of repeatedly nested expectations (RNEs) with a constant horizon (number of nestings) using quantum computing. We propose a quantum algorithm that achieves $\varepsilon$-error with cost $\tilde O(\varepsilon^{-1})$, up to logarithmic factors. Standard lower bounds show this s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Benchmarking a randomized quantum algorithm for estimating expectation values of molecular observables#1327969
- Optimal Quantum Likelihood Estimation#924449
- Optimal Quantum Likelihood Estimation#920218
- A log-depth in-place quantum Fourier transform that rarely needs ancillas#1110088
- A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics#1155483
Record · ID 1186416
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive