An Efficient Quantum Addition Circuit (Extended Abstract)

良徳 川田, Yoshinori Kawata, 智 田湯 +2 more

Nirupma Pathak, Santosh D. Kumar, Neeraj Kumar Misra +1 more

Abstract Quantum technology has an attractive application nowadays for its minimizing the energy dissipation, which is a prominent part of any system-level design. In this article, the significant module of a multiplexer, an extended ton:1 is framed with prominent application in the control unit of the processor. The proposed multiplexer modules are framed by the algorithm, which is extended perspective based. Further, quantum cost and gate count are less to ensure the efficient quantum computing framed. In addition, the QCA computing framework is an attempt to synthesize the optimal primitives in conservative reversible multiplexer in nano-electronic confine application. The developed lemmas is framed to prove the optimal parameters in the reversible circuit. Compared with existing state-of-art-works, the proposed modular multiplexer, the gate count, quantum cost and unit delay are optimal.

康博 高橋

Tingyan Zhang, Yi Li, Shih-Wen Lu +6 more

Abstract Multi-valued quantum systems have more significant advantages in computational performance than binary quantum system, since the circuit design is more compact and efficient in multi-valued quantum systems. Hence, synthesizing multi-valued logic circuits is a better choice for future quantum computing technology. A subcircuit in the Grover’s algorithm is called an oracle, which inputs a set of quantum qudits and gives an output according to the search conditions. Greater-than/less-than/equality comparators are widely used in search conditions. In this paper, the ternary Toffoli gate proposed by Monfared and Haghparast is extended to multi-valued under certain conditions, and the existing optimal quaternary n-qudit comparator is optimized using the multi-valued Toffoli gate. In addition, we design universal multi-valued equality/greater-than/less-than comparators and complementary component, which constitute a comprehensive multi-valued n-qudit comparator. Compared to existing comparator circuits, these comparator circuits are more efficient in terms of quantum cost, garbage output, hardware complexity, and constant input.

Dedy Septono Catur Putranto, Rini Wisnu Wardhani, Howon Kim

Shor’s algorithm remains a cornerstone of quantum cryptanalysis, driving active research into reducing quantum resource overheads in both spatial and temporal dimensions. This work presents a dual-optimization framework targeting resource-efficient Shor-based quantum cryptanalysis on binary elliptic curves. Our approach conducts a comprehensive resource assessment across multiple abstraction levels—ranging from finite field arithmetic to elliptic curve group operations. At the low-level layer, we benchmark various quantum arithmetic constructor designs—including GCD-based, FLT-based, FLT-Basic or extended variants, in-place, and out-of-place execution models—analyzing Toffoli gate counts, qubit requirements, and circuit depths. At the group operation layer, we examine point addition and doubling circuits, employing complete iterations of Shor’s algorithm with elliptic curve point multiplication (ECPM) that require point addition (PA) only (with (2n+ 2) PA) and point doubling (PD) utilization (2nPD + 2 PA). We further simulate selected (2nPD + 2 PAoutplace) circuit designs, highlighting the advantages of optimized out-of-place PA circuits and integrated ECPM techniques from prior work. Additionally, we explore decompositions of multi-controlled gates to achieve a practical trade-off between qubit count and overall depth.

Hafiz Md. Hasan Babu