Show simple item record

Quantum conditional query complexity

dc.creatorSardharwalla, Imdad
dc.creatorStrelchuk, Sergii
dc.creatorJozsa, Richard
dc.date.accessioned2017-05-11
dc.date.accessioned2018-11-24T23:20:17Z
dc.date.available2017-08-11T12:44:24Z
dc.date.available2018-11-24T23:20:17Z
dc.date.issued2017-06-01
dc.identifierhttps://www.repository.cam.ac.uk/handle/1810/266286
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/123456789/3582
dc.description.abstractWe define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain highly efficient quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of these oracles for testing properties of boolean functions, and obtain an algorithm for checking whether an n-input m-output boolean function is balanced or ϵ-far from balanced; and (c) give an algorithm, requiring Õ(n/ϵ) queries, for testing whether an n-dimensional quantum state is maximally mixed or not.
dc.languageen
dc.publisherRinton Press
dc.publisherQuantum Information and Computation
dc.publisherhttp://www.rintonpress.com/journals/qicabstracts/qicabstracts17-78.html
dc.subjectquantum query complexity
dc.subjectboolean functions
dc.subjectquantum oracle
dc.subjectquantum spectrum testing
dc.titleQuantum conditional query complexity
dc.typeArticle


Files in this item

FilesSizeFormatView
1609.01600v1.pdf231.2Kbapplication/pdfView/Open
QIC.pdf301.2Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record