A Near-Quartic Separation Between Certificate Complexity and Quantum Query Complexity
Andris Ambainis, Jānis Iraids, Martins Kokainis
Abstract
We construct a total Boolean function f for which Q(f) = O([4]C(f)), where Q(f) denotes the bounded-error quantum query complexity and C(f) denotes the certificate complexity. This resolves a longstanding open question and is tight up to logarithmic factors.
Create a lesson
Related papers
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
All causally separable quantum processes are quantum circuits with classical control of causal order
Julian Wechs, Alastair A. Abbott, Cyril Branciard
Analytic leakage suppression with a single control field: fast two-qubit gates with tunable couplers
Lukas Heunisch, Michael J. Hartmann, Aashish A. Clerk
Procrastinating einselection in non-Markovian quantum dynamics
Michael J. Moody, Tara Kalsi, Agung Budiyono et al.
Quantum Entropy Contraction and Factorization from Hypercontractivity
Li Gao, Lijun Wang