Quantum summation with an application to integration.

DOI10.1006/jcom.2001.0629zbMath1050.68043arXivquant-ph/0105116OpenAlexW2018655598WikidataQ57636025 ScholiaQ57636025MaRDI QIDQ1599193

Stefan Heinrich

Publication date: 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0105116

zbMATH Keywords

quantum algorithms information-based complexity theory

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items

From Monte Carlo to quantum computation, Randomized and quantum complexity of nonlinear two-point BVPs, Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces, Quantum approximation. II: Sobolev embeddings, Quantum complexity of parametric integration, Sharp error bounds on quantum Boolean summation in various settings, The power of various real-valued quantum queries, Average case quantum lower bounds for computing the Boolean mean, Three-party secure semiquantum summation without entanglement among quantum user and classical users, The quantum setting with randomized queries for continuous problems, A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer, Almost optimal solution of initial-value problems by randomized and quantum algorithms, The quantum query complexity of elliptic PDE, What can quantum computers do?, An efficient protocol for the secure multi-party quantum summation, On a problem in quantum summation., Quantum integration in Sobolev classes, Multi-party quantum summation within a \(d\)-level quantum system, Complexity of Monte Carlo integration for Besov classes on the unit sphere, Improvements on: ``Secure multi-party quantum summation based on quantum Fourier transform, Some Results on the Complexity of Numerical Integration, Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case, Quantum summation using \(d\)-level entanglement swapping, A protocol for the secure two-party quantum scalar product, Multi-party quantum summation without a trusted third party based on single particles, High-capacity quantum summation with single photons in both polarization and spatial-mode degrees of freedom, Integration error for multivariate functions from anisotropic classes, Quantum lower bounds by entropy numbers, On the complexity of the multivariate Sturm-Liouville eigenvalue problem, Quantum secure multiparty summation based on the phase shifting operation of \(d\)-level quantum system and its application, Secure three-party semi-quantum summation using single photons, Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms, Secure multi-party quantum summation based on quantum Fourier transform, Lower bound for quantum integration error on anisotropic Sobolev classes, On the quantum and randomized approximation of linear functionals on function spaces, On the complexity of searching for a maximum of a function on a quantum computer, Randomized and quantum algorithms yield a speed-up for initial-value problems, Adiabatic quantum counting by geometric phase estimation, On the complexity of a two-point boundary value problem in different settings, Optimal query error of quantum approximation on some Sobolev classes, Quantum Chebyshev's Inequality and Applications, Lower bound for quantum phase estimation, Improved bounds on the randomized and quantum complexity of initial-value problems, Three-party quantum summation without a trusted third party, Solving Burgers' equation with quantum computing, A lightweight three-user secure quantum summation protocol without a third party based on single-particle states, Secure device-independent quantum bit-wise XOR summation based on a pseudo-telepathy game, Two-party secure semiquantum summation against the collective-dephasing noise

Cites Work