Resource Optimized Quantum Squaring Circuit
Afrin Sultana, Edgard Mu\~noz-Coreas

TL;DR
This paper introduces a resource-efficient quantum squaring circuit optimized for low T-count, CNOT-count, and depth, significantly reducing quantum resource requirements for various algorithms.
Contribution
It presents a novel quantum integer squaring architecture that reduces resource costs by 50-77% compared to prior designs, with no garbage outputs.
Findings
66.67% reduction in T-count
50% reduction in T-depth
29.41% reduction in CNOT-count
Abstract
Quantum squaring operation is a useful building block in implementing quantum algorithms such as linear regression, regularized least squares algorithm, order-finding algorithm, quantum search algorithm, Newton Raphson division, Euclidean distance calculation, cryptography, and in finding roots and reciprocals. Quantum circuits could be made fault-tolerant by using error correcting codes and fault-tolerant quantum gates (such as the Clifford + T-gates). However, the T-gate is very costly to implement. Two qubit gates (such as the CNOT-gate) are more prone to noise errors than single qubit gates. Consequently, in order to realize reliable quantum algorithms, the quantum circuits should have a low T-count and CNOT-count. In this paper, we present a novel quantum integer squaring architecture optimized for T-count, CNOT-count, T-depth, CNOT-depth, and that produces no garbage…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
