Quantum Boolean Summation with Repetitions in the Worst-Average Setting

Stefan Heinrich (), Marek Kwas () and Henryk Woźniakowski ()
Additional contact information
Stefan Heinrich: Universität Kaiserslautern
Marek Kwas: Columbia University, Department of Computer Science
Henryk Woźniakowski: Columbia University, Department of Computer Science

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2002, 2004, pp 243-258 from Springer

Abstract: Summary We study the quantum summation (QS) algorithm of Brassard, Høyer, Mosca and Tapp, see [1], which approximates the arithmetic mean of a Boolean function defined on N elements. We present sharp error bounds of the QS algorithm in the worst-average setting with the average performance measured in the L q norm, q∈ [l,∞]. We prove that the QS algorithm with M quantum queries, M

Keywords: Boolean Function; Error Bound; Quantum Algorithm; Error Formula; Local Average Error (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-18743-8_14

Ordering information: This item can be ordered from
http://www.springer.com/9783642187438

DOI: 10.1007/978-3-642-18743-8_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().