Cargando…

‘Quantum supremacy’ revisited: low-complexity, deterministic solutions of the original Deutsch–Jozsa problem in classical physical systems

The original Deutsch–Jozsa (oDJ) problem is for an oracle (realized here as a database) of size N, where, according to their claim, the deterministic solution of the problem on a classical Turing computer requires O(N) computational complexity. They produced the famous Deutsch–Jozsa quantum algorith...

Descripción completa

Detalles Bibliográficos
Autor principal: Kish, Laszlo Bela
Formato: Online Artículo Texto
Lenguaje:English
Publicado: The Royal Society 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9974295/
https://www.ncbi.nlm.nih.gov/pubmed/36866081
http://dx.doi.org/10.1098/rsos.221327