Quantum Abacus for counting and factorizing numbers
M. V. Suslov, G. B. Lesovik, and G. Blatter

TL;DR
This paper extends quantum counting algorithms to higher bases using qubits, qutrits, and qudits, enabling efficient number representation, factorization, and applications in quantum metrology and entanglement.
Contribution
It introduces a generalized quantum counting algorithm for bases beyond binary, utilizing quantum Fourier transforms and multi-level systems, with potential practical implementations and applications.
Findings
Algorithm effectively counts numbers in various bases.
Demonstrates potential for quantum factorization and metrology.
Establishes analogy with phase estimation for performance analysis.
Abstract
We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base 2, base 3, or base d representation. In operating the algorithm, the number n < N = d^K is read into a K-qudit register through its interaction with a stream of n particles passing in a nearby wire; this step corresponds to a quantum Fourier transformation from the Hilbert space of particles to the Hilbert space of qudit states. An inverse quantum Fourier transformation provides the number n in the base d representation; the inverse transformation is fully quantum at the level of individual qudits, while a simpler semi-classical version can be used on the level of qudit registers. Combining registers of qubits, qutrits, and qudits, where d is a prime number, with a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
