Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

JCSS

2008

2008

Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate complexity QC(f). Using Ambainis' adversary method, we exactly characterize QC (f) as the square root of RC(f). We then use this result to prove the new relation R0 (f) = O Q2 (f)2 Q0 (f) log n for total f, where R0, Q2, and Q0 are zero-error randomized, bounded-error quantum, and zero-error quantum query complexities respectively. Finally we give asymptotic gaps between the measures, including a total f for which C(f) is superquadratic in QC (f), and a symmetric partial f for which QC (f) = O (1) yet Q2 (f) = (n/ log n). Most of what is known about the power of quantum computing can be cast in the query or decision-tree model [1, 3, 4, 7, 6, 9, 10, 11, 20, 25, 24]. Here one counts only the number of queries to the input, not the number of computational steps. The appeal of this model lies in its extreme si...

Related Content

Added |
13 Dec 2010 |

Updated |
13 Dec 2010 |

Type |
Journal |

Year |
2008 |

Where |
JCSS |

Authors |
Scott Aaronson |

Comments (0)