Quantum non-identical mean estimation: efficient algorithms and fundamental limits

DOI10.4230/LIPICS.TQC.2024.9MaRDI QIDQ6859964zbMATH OpenFDO

Authors Jiachen Hu, Tongyang Li, Xinzhao Wang, Yecheng Xue, Chenyi Zhang, Han Zhong

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2024.9

zbMATH Keywords

mean estimationnon-identical samplesquantum algorithmsquery complexity

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites work

• A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
• An Optimal Algorithm for Monte Carlo Estimation
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 5485488 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Mean estimation when you have the source code; or, quantum Monte Carlo methods
• On the sample complexity of the linear quadratic regulator
• Optimal parallel quantum query algorithms
• Quantum Chebyshev's Inequality and Applications
• Quantum non-identical mean estimation: efficient algorithms and fundamental limits
• Quantum speedup of Monte Carlo methods
• Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
• Time/Space Trade-Offs for Reversible Computation

Cited in

(1)

• Quantum non-identical mean estimation: efficient algorithms and fundamental limits

This page was built for publication: Quantum non-identical mean estimation: efficient algorithms and fundamental limits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859964)