Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1606.01824

A Quantum Abacus based encoding system

J.V. Alvarez-Bravo, J. J. Álvarez-Sánchez, Ignacio Aparicio Morgado

Published Jun 6, 2016• 0 citations
arXivHTMLPDF

Abstract

A formal description of a quantum abacus based encoding system is presented. This way of representing data for processing purposes is based on a quantum algorithm for counting qubits introduced by Lesovik et al. \cite{LesovikEtal2010} and Suslov et al. \cite{SuslovEtal2011}, but formally developed in this work. Finally, in order to illustrate the potential of this proposal, the implementation of the basic quantum array operations through this encoding system is presented.

DOI
10.48550/arxiv.1606.01824

Related papers

Quantum abacus for counting and factorizing numbers

M. V. Suslov, Gordey B. Lesovik, G. Blatter

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 semiclassical 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 simpler single-shot measurement allows us to find the powers of 2, 3, and other primes $d$ in the number $n$. We show that the counting task naturally leads to the shift operation and an algorithm based on the quantum Fourier transformation. We discuss possible implementations of the algorithm using quantum spin-$d$ systems, $d$-well systems, and their emulation with spin-1/2 or double-well systems. We establish the analogy between our counting algorithm and the phase estimation algorithm and make use of the latter's performance analysis in stabilizing our scheme. Applications embrace a quantum metrological scheme to measure voltage (an analog to digital converter) and a simple procedure to entangle multiparticle states.

arXiv:1011.3646•Physical Review A•May 19, 2011•17 citations

Algebra, Logic and Qubits: Quantum Abacus

Alexander Yu. Vlasov

The canonical anticommutation relations (CAR) for fermion systems can be represented by finite-dimensional matrix algebra, but it is impossible for canonical commutation relations (CCR) for bosons. After description of more simple case with representation of CAR and (bounded) quantum computational networks via Clifford algebras in the paper are discussed CCR. For representation of the algebra it is not enough to use quantum networks with fixed number of qubits and it is more convenient to consider Turing machine with essential operation of appending new cells for description of infinite tape in finite terms --- it has straightforward generalization for quantum case, but for CCR it is necessary to work with symmetrized version of the quantum Turing machine. The system is called here quantum abacus due to understanding analogy with the ancient counting devices (abacus).

arXiv:quant-ph/0001100•Jan 27, 2000•2 citations

Quantum superposing algorithm for quantum encoding

Jae-Hee Kim, Taewan Kim, Kyunghyun Baek +3 more

Abstract Efficient encoding of classical data into quantum state—currently referred to as quantum encoding—holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum encoding entails establishing a classical mapping that correlates machine-recognizable data addresses with qubit indices that are subsequently superposed. Herein, the most imperative lies in casting an algorithm for generating the superposition of any given number of qubit indices. This algorithm is formally known as quantum superposing algorithm. In this work, we present an efficient quantum superposing algorithm, affirming its effectiveness and superior computational performance in a practical quantum encoding scenario. Our theoretical and numerical analyses demonstrate a substantial enhancement in computational efficiency compared to existing algorithms. Notably, our algorithm has a maximum of 2n − 3 controlled-not (CNOT) counts, representing the most optimized result to date.

arXiv:2409.19496•Physica Scripta•Sep 27, 2024•1 citation

Qubit description of the functions and structures for computing

Vladimir I. Hahanov, Eugenia I. Litvinova, Svetlana V. Chumachenko +1 more

Qubit models for defining the structures and functionalities are developed to improve the performance of the analysis of digital devices by increasing the dimension of the data and memory structures. The basic concepts, terminology, definitions, necessary for the implementation of quantum computation in the practice of modeling computer structures, are introduced. The examples proving the efficiency of qubit data structures for parallel operations on the data are represented.

IEEE East-West Design & Test Symposium (EWDTS)•Oct 1, 2016•8 citations

Quantum Abacus : Qubit Operation by Quantum Singularity(Quantum Field Theories : Fundamental Problems and Applications)

Taksu Cheon, Tamàs Fülöp, 泉 筒井

素粒子論研究•Jun 20, 2005•0 citations

From Bits to Qubits: The Theory and Practice of Quantum Data Encoding

Xiao-Ming Zhang, Arthur G. Rattew, Bujiao Wu +4 more

Encoding classical data into quantum systems is a foundational step in the execution of nearly all quantum algorithms, and a critical bottleneck in realizing practical quantum advantage. This review provides a comprehensive account of the concepts, algorithms, and practical considerations associated with quantum data encoding. We trace the development from its early conceptual foundations to recent advances, considering commonly used access models, such as quantum state preparation, unitary synthesis, QRAM and block encoding. We survey the circuit size, depth, space-time tradeoffs, as well as non-Clifford resources required for fault-tolerant implementation. We also discuss the roles of different access models in quantum algorithms. Special attention is given to structured data, such as sparse data, Boolean functions and data represented by tensor networks. This review bridges theory and applications, serving both as a pedagogical guide for newcomers and as a reference for active researchers. We also highlight the pivotal role of quantum data encoding in quantum computing and provide insights into future directions that will enable quantum advantage.

quant-pharXiv:2609.08058•Sep 9, 2026•4 citations
A formal description of a quantum abacus based encoding system is presented. This way of representing data for processing purposes is based on a quantum algorithm for counting qubits introduced by Lesovik et al. \cite{LesovikEtal2010} and Suslov et al. \cite{SuslovEtal2011}, but formally developed in this work. Finally, in order to illustrate the potential of this proposal, the implementation of the basic quantum array operations through this encoding system is presented.
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-ddd representation. In operating the algorithm, the number n<N=dKn<N={d}^{K}n<N=dK is read into a KKK-qudit register through its interaction with a stream of nnn 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 nnn in the base-ddd representation; the inverse transformation is fully quantum at the level of individual qudits, while a simpler semiclassical version can be used on the level of qudit registers. Combining registers of qubits, qutrits, and qudits, where ddd is a prime number, with a simpler single-shot measurement allows us to find the powers of 2, 3, and other primes ddd in the number nnn. We show that the counting task naturally leads to the shift operation and an algorithm based on the quantum Fourier transformation. We discuss possible implementations of the algorithm using quantum spin-ddd systems, ddd-well systems, and their emulation with spin-1/2 or double-well systems. We establish the analogy between our counting algorithm and the phase estimation algorithm and make use of the latter's performance analysis in stabilizing our scheme. Applications embrace a quantum metrological scheme to measure voltage (an analog to digital converter) and a simple procedure to entangle multiparticle states.
The canonical anticommutation relations (CAR) for fermion systems can be represented by finite-dimensional matrix algebra, but it is impossible for canonical commutation relations (CCR) for bosons. After description of more simple case with representation of CAR and (bounded) quantum computational networks via Clifford algebras in the paper are discussed CCR. For representation of the algebra it is not enough to use quantum networks with fixed number of qubits and it is more convenient to consider Turing machine with essential operation of appending new cells for description of infinite tape in finite terms --- it has straightforward generalization for quantum case, but for CCR it is necessary to work with symmetrized version of the quantum Turing machine. The system is called here quantum abacus due to understanding analogy with the ancient counting devices (abacus).
Abstract Efficient encoding of classical data into quantum state—currently referred to as quantum encoding—holds crucial significance in quantum computation. For finite-size databases and qubit registers, a common strategy of the quantum encoding entails establishing a classical mapping that correlates machine-recognizable data addresses with qubit indices that are subsequently superposed. Herein, the most imperative lies in casting an algorithm for generating the superposition of any given number of qubit indices. This algorithm is formally known as quantum superposing algorithm. In this work, we present an efficient quantum superposing algorithm, affirming its effectiveness and superior computational performance in a practical quantum encoding scenario. Our theoretical and numerical analyses demonstrate a substantial enhancement in computational efficiency compared to existing algorithms. Notably, our algorithm has a maximum of 2n − 3 controlled-not (CNOT) counts, representing the most optimized result to date.
Encoding classical data into quantum systems is a foundational step in the execution of nearly all quantum algorithms, and a critical bottleneck in realizing practical quantum advantage. This review provides a comprehensive account of the concepts, algorithms, and practical considerations associated with quantum data encoding. We trace the development from its early conceptual foundations to recent advances, considering commonly used access models, such as quantum state preparation, unitary synthesis, QRAM and block encoding. We survey the circuit size, depth, space-time tradeoffs, as well as non-Clifford resources required for fault-tolerant implementation. We also discuss the roles of different access models in quantum algorithms. Special attention is given to structured data, such as sparse data, Boolean functions and data represented by tensor networks. This review bridges theory and applications, serving both as a pedagogical guide for newcomers and as a reference for active researchers. We also highlight the pivotal role of quantum data encoding in quantum computing and provide insights into future directions that will enable quantum advantage.