✦ LIBER ✦

Quantum certificate complexity

✍ Scribed by Scott Aaronson

Book ID: 108166546
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 167 KB
Volume: 74
Category: Article
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.06.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boolean functions with a simple certific

Boolean functions with a simple certificate for CNF complexity

✍ Ondřej Čepek; Petr Kučera; Petr Savický 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 329 KB

Quantum Communication Complexity

✍ Gilles Brassard 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 332 KB

Quantum Kolmogorov Complexity

✍ André Berthiaume; Wim van Dam; Sophie Laplante 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the

Quantum Complexity Theory

✍ Bernstein, Ethan; Vazirani, Umesh 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 737 KB

Nonadaptive quantum query complexity

✍ Ashley Montanaro 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 136 KB

Quantum communication and complexity

✍ Ronald de Wolf 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 182 KB

In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be signiÿcantly lowered if we allow the parties the use of quantum communication. We surv