Pages that link to "Item:Q2819571"
From MaRDI portal
The following pages link to The quantum query complexity of approximating the median and related statistics (Q2819571):
Displaying 40 items.
- Quantum computation and quantum information (Q252779) (← links)
- Optimality proofs of quantum weight decision algorithms (Q430107) (← links)
- On the quantum and randomized approximation of linear functionals on function spaces (Q544821) (← links)
- Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights (Q548212) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788) (← links)
- The quantum setting with randomized queries for continuous problems (Q850543) (← links)
- A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer (Q855896) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- Adiabatic quantum counting by geometric phase estimation (Q989904) (← links)
- On a problem in quantum summation. (Q1394934) (← links)
- Quantum integration in Sobolev classes (Q1394935) (← links)
- Quantum summation with an application to integration. (Q1599193) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- From Monte Carlo to quantum computation (Q1873014) (← links)
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces (Q1883582) (← links)
- Quantum complexity of parametric integration (Q1883586) (← links)
- Sharp error bounds on quantum Boolean summation in various settings (Q1888376) (← links)
- The power of various real-valued quantum queries (Q1888377) (← links)
- Average case quantum lower bounds for computing the Boolean mean (Q1888378) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions (Q1993748) (← links)
- The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries (Q2384174) (← links)
- Histogram-based segmentation of quantum images (Q2440830) (← links)
- Quantum lower bounds by entropy numbers (Q2465304) (← links)
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem (Q2465305) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)
- Classical and quantum complexity of the Sturm-Liouville eigenvalue problem (Q2573108) (← links)
- Improved bounds on the randomized and quantum complexity of initial-value problems (Q2576279) (← links)
- Quantum and classical query complexities for generalized Deutsch-Jozsa problems (Q2677211) (← links)
- Testing Boolean Functions Properties (Q5025054) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
- (Q5092454) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- Development of a novel robust identification scheme for nonlinear dynamic systems (Q5743770) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- Quantum complexity of integration (Q5938578) (← links)
- Quantum attribute-based encryption: a comprehensive study (Q6050246) (← links)
- Non-Boolean quantum amplitude amplification and quantum mean estimation (Q6176970) (← links)
