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

Optical and Quantum Electronics

Optical quantum bit string comparator

C. P. de Sousa, João Batista Rosa Silva, Rubens Viana Ramos

Published Jan 1, 2019• 4 citations
Publisher
DOI
10.1007/s11082-018-1732-5

Related papers

The quantum bit string comparator

Hafiz Md. Hasan Babu

Institute of Physics eBooks•May 1, 2020•0 citations

Implementable Quantum Bit String Commitment

Toyohiro Tsurumaru

IEICE Technical Report; IEICE Tech. Rep.•Jul 13, 2004•0 citations

Quantum search algorithm using quantum bit string comparator

David Sena Oliveira, Paulo Benicio Melo de Sousa, Rubens Viana Ramos

In this work, a quantum circuit able to compare if two bit strings are equal or not and, in this last case, identify which of them is the largest, is proposed. It is named quantum bit string comparator. Further, we present two applications of the quantum bit string comparator working together with Grover quantum search algorithm: implementation of conditional statements in quantum algorithms and a finder of the zero of a logical function.

International Telecommunications Symposium (ITS)•Sep 1, 2006•13 citations

Area and Delay Efficient Design of a Quantum Bit String Comparator

Hafiz Md. Hasan Babu, Lafifa Jamal, Sayanton Vhaduri Dibbo +1 more

This paper presents a new technique of magnitudecomparator for quantum bit string comparison. In the proposedmethod, the comparison between two quantum bit strings isperformed with the optimum number of operations. We have alsoshown that the proposed technique has time complexityO(( + )), whereas the best known existing technique hasO(nlog n),where n is the number of quantum bits. In addition, wehave proposed another technique to produce a compact quantumcomparator circuit. We have also introduced three new quantumgates with unique unitary matrices which represent the proposedquantum circuit more compactly than the existing quantumgates. The proposed comparator circuit has been designed usingthe proposed quantum bit comparator circuit named MidpointQubits Comparison (MQC) Circuit and another proposedquantum bit comparator circuit named Rest Qubits Comparison(RQC) Circuit. The comparative study shows that the proposedcomparator circuit outperforms the existing comparators; e.g.,the proposed 64-qubit comparator improves 7.19% on number ofquantum gates, area and delay; and 50.39% on garbage outputsover the existing best one

IEEE Computer Society Annual Symposium on VLSI•Jul 1, 2017•4 citations

The quantum qubit string comparator

Hafiz Md. Hasan Babu

Institute of Physics eBooks•Jun 1, 2023•0 citations

A Generalized Space-Efficient Algorithm for Quantum Bit String Comparators

Khuram Shahzad, Omar Khan

Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in programming languages. Consequently, QBSCs play a crucial role in various algorithms that can be executed or adapted for quantum computers. The development of efficient and generalized comparators for any \(n\)-qubit length has long posed a challenge, as they have a high-cost footprint and lead to quantum delays. Comparators that are efficient are associated with inputs of fixed length. As a result, comparators without a generalized circuit cannot be employed at a higher level, though they are well-suited for problems with limited size requirements. In this paper, we introduce a generalized design for the comparison of two \(n\)-qubit logic states using just two ancillary bits. The design is examined on the basis of qubit requirements, ancillary bit usage, quantum cost, quantum delay, gate operations, and circuit complexity, and is tested comprehensively on various input lengths. The work allows for sufficient flexibility in the design of quantum algorithms, which can accelerate quantum algorithm development.

arXiv:2311.06573•Qeios•Mar 14, 2024•2 citations
This paper presents a new technique of magnitudecomparator for quantum bit string comparison. In the proposedmethod, the comparison between two quantum bit strings isperformed with the optimum number of operations. We have alsoshown that the proposed technique has time complexityO(( + )), whereas the best known existing technique hasO(nlog n),where n is the number of quantum bits. In addition, wehave proposed another technique to produce a compact quantumcomparator circuit. We have also introduced three new quantumgates with unique unitary matrices which represent the proposedquantum circuit more compactly than the existing quantumgates. The proposed comparator circuit has been designed usingthe proposed quantum bit comparator circuit named MidpointQubits Comparison (MQC) Circuit and another proposedquantum bit comparator circuit named Rest Qubits Comparison(RQC) Circuit. The comparative study shows that the proposedcomparator circuit outperforms the existing comparators; e.g.,the proposed 64-qubit comparator improves 7.19% on number ofquantum gates, area and delay; and 50.39% on garbage outputsover the existing best one
Quantum Bit String Comparators (QBSC) operate on two sequences of n-qubits, enabling the determination of their relationships, such as equality, greater than, or less than. This is analogous to the way conditional statements are used in programming languages. Consequently, QBSCs play a crucial role in various algorithms that can be executed or adapted for quantum computers. The development of efficient and generalized comparators for any nnn-qubit length has long posed a challenge, as they have a high-cost footprint and lead to quantum delays. Comparators that are efficient are associated with inputs of fixed length. As a result, comparators without a generalized circuit cannot be employed at a higher level, though they are well-suited for problems with limited size requirements. In this paper, we introduce a generalized design for the comparison of two nnn-qubit logic states using just two ancillary bits. The design is examined on the basis of qubit requirements, ancillary bit usage, quantum cost, quantum delay, gate operations, and circuit complexity, and is tested comprehensively on various input lengths. The work allows for sufficient flexibility in the design of quantum algorithms, which can accelerate quantum algorithm development.