On a Problem in Quantum Summation
- We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a \(p\)-summability condition for \(1\le p<2\). This settles a problem left open in Heinrich (2001).
Download full text files
Additional Services
| Author: | Stefan Heinrich, Erich Novak |
|---|---|
| URN (permanent link): | urn:nbn:de:hbz:386-kluedo-50296 |
| Serie (Series number): | Interner Bericht des Fachbereich Informatik (315) |
| Document Type: | Report |
| Language of publication: | English |
| Publication Date: | 2017/11/06 |
| Year of Publication: | 2001 |
| Publishing Institute: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2017/11/06 |
| Number of page: | 21 |
| Faculties / Organisational entities: | Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Licence (German): |  Creative Commons 4.0 - Namensnennung, nicht kommerziell, keine Bearbeitung (CC BY-NC-ND 4.0) |
