Abstract
AbstractWe introduce nebit, a classical bit with a signed probability distribution. We study its properties and basic transformations that can be applied to it. Then, we introduce a simple dynamical model – a classical random walk supplemented with nebits. We show that such a model exhibits some counterintuitive non-classical properties and that it can achieve or even exceed the speedup of Grover’s quantum search algorithm. The proposed classical dynamics never reveals negativity of nebits and thus we do not need any operational interpretation of negative probabilities. We argue that nebits can be useful as a measure of non-classicality as well as a tool to find new quantum algorithms.
Funder
the Ministry of Education, Singapore
Ministerstwo Nauki i Szkolnictwa Wyzszego
National Research Foundation Singapore
Publisher
Springer Science and Business Media LLC
Subject
General Physics and Astronomy
Reference20 articles.
1. Shor, P.W.: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20–22, (1994)
2. Grover, L.K.: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, 212–219 (1996)
3. Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. Theory of Computing 9, 143–252 (2013)
4. Benioff, P.: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. Stat. Phys. 22, 563 (1980)
5. Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574, 505 (2019)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献