Cargando…
On a poset of quantum exact promise problems
Two of the most well-known quantum algorithms, those introduced by Deutsch–Jozsa and Bernstein–Vazirani, can solve promise problems with just one function query, showing an oracular separation with deterministic classical algorithms. In this work, we generalise those methods to study a family of qua...
| Autores principales: | , , , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
2021
|
| Acceso en línea: | https://dx.doi.org/10.1007/s11128-021-03156-3 http://cds.cern.ch/record/2776952 |