.png){kind=icon}
.png){kind=icon}
Return
Efficient quantum arithmetic operation circuits for quantum image processing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11433-020-1582-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Efficient quantum circuits for arithmetic operations are vital for quantum algorithms. A fault-tolerant circuit is required for a robust quantum computing in the presence of noise. Quantum circuits based on Clifford+T gates are easily rendered fault-tolerant. Therefore, reducing the T-depth and T-Count without increasing the qubit number represents vital optimization goals for quantum circuits. In this study, we propose the fault-tolerant implementations for TR and Peres gates with optimized T-depth and T-Count. Next, we design fault-tolerant circuits for quantum arithmetic operations using the TR and Peres gates. Then, we implement cyclic and complete translations of quantum images using quantum arithmetic operations, and the scalar matrix multiplication. Comparative analysis and simulation results reveal that the proposed arithmetic and image operations are efficient. For instance, cyclic translations of a quantum image produce 50% T-depth reduction relative to the previous best-known cyclic translation.
Keywords:
quantum arithmetic operation
quantum fault tolerant circuit
quantum computation
quantum image processing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
S
IF:
7.5
Papers:
3.9K
Citations:
7.4K
Organization
View more organizations