| Summary: | Quantum comparators and modular arithmetic are fundamental in many quantum algorithms. Current research mainly focuses on operations between two quantum states. However, various applications, such as integer factorization, optimization, and financial risk analysis, commonly require one of the inputs to be classical. It requires many ancillary qubits, especially when subsequent computations are involved. In this paper, we propose a quantum–classical comparator based on the quantum Fourier transform. Then we extend it to compare two quantum integers and modular arithmetic. Proposed operators only require up to one ancilla qubit, which is optimal for qubit resources. We analyze limitations in the current modular addition circuit and develop it to process arbitrary quantum states in the entire n -qubit space. The proposed algorithms reduce computing resources and make them valuable for noisy intermediate-scale quantum computers.
|
|---|