We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Quantum circuits for computing Hamming distance requiring fewer T gates.
- Authors
Orts, Francisco; Ortega, Gloria; Combarro, Elías F.; Rúa, Ignacio F.; Garzón, Ester M.
- Abstract
The so-called Hamming distance measures the difference between two binary strings A and B. In simplified form, it measures the number of changes in A to get B. This type of distance is very useful in classical computing in applications such as error correction. It is also advantageous in quantum computing, being for example widely used in quantum machine learning. Since current quantum computers have limited resources, this type of distance is particularly attractive because it can be computed using fewer qubits and operations than other distances such as Euclidean or Manhattan distances. In this paper, two circuits for calculating Hamming distances using exclusively Clifford+T gates are presented. The aim of both circuits is to reduce the quantum cost and number of T gates needed to compute the Hamming distance. The T gate is more expensive than the other gates, so this reduction will have a significant impact on the total cost of the circuits. Furthermore, the proposed circuits are implemented using only Clifford+T gates. The circuits implemented exclusively with this group of gates are compatible with proven error detection and correction codes.
- Subjects
MANHATTAN (New York, N.Y.); HAMMING distance; QUANTUM computing; QUANTUM computers; QUANTUM numbers; EUCLIDEAN distance; QUBITS
- Publication
Journal of Supercomputing, 2024, Vol 80, Issue 9, p12527
- ISSN
0920-8542
- Publication type
Article
- DOI
10.1007/s11227-024-05916-1