Quantum Speedup Based on Classical Decision Trees
Lin and Lin \cite{LL16} have recently shown how starting with a classical query algorithm (decision tree) for a function, we may find upper bounds on its quantum query complexity. More precisely, they have shown that given a decision tree for a function $f:\{0,1\}^n\to[m]$ whose input can be accesse...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2020-03-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2020-03-02-241/pdf/ |