Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Quantum Arithmetic Circuits

Hafiz Md. Hasan Babu

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-981-97-7154-7_6

Related papers

Efficient quantum circuits for arithmetic operations and their applications

康博 高橋

•Jan 1, 2008•1 citation

Efficient implementation of quantum arithmetic operation circuits

Heng Fan

Science China Physics Mechanics and Astronomy•Nov 26, 2020•2 citations

Quantum Circuits for Floating-Point Arithmetic

Thomas Häner, Mathias Soeken, Martin Roetteler +1 more

arXiv:1807.02023•Lecture notes in computer science•Jan 1, 2018•52 citations

Efficient quantum arithmetic operation circuits for quantum image processing

Hai-Sheng Li, Ping Fan, Haiying Xia +2 more

Science China Physics Mechanics and Astronomy•Jun 4, 2020•101 citations

Quantum Arithmetic Circuits in Public-Key Cryptography

Siyi Wang, Kyungbae Jang, Hyunji Kim +4 more

Quantum computing has advanced rapidly in recent decades, driven by developments across the technology stack, including quantum error-correcting codes and efficient quantum algorithms. Among these, quantum arithmetic circuits serve as fundamental building blocks for various promising algorithms. Despite their crucial role, the design of quantum arithmetic circuits faces challenges arising from the no-cloning theorem, qubit limitations, and circuit depth constraints, which significantly impact the efficiency of large-scale quantum computing. We provide an overview of quantum arithmetic circuits in the context of public-key cryptanalysis, with particular emphasis on optimization strategies such as measurement-based uncomputation and conditionally clean ancilla. We review state-of-the-art designs for essential arithmetic operations in public-key cryptanalysis such as addition, multiplication, and modular exponentiation. We also present an overview of the techniques used for fault-tolerant runtime and resource estimation in quantum cryptanalysis. In brief, this chapter emphasizes strategies for designing resource-efficient quantum arithmetic circuits, providing a basis for realistic evaluations of quantum cryptanalytic capabilities.

quant-pharXiv:2607.11713•Jul 14, 2026•0 citations

Formal Verification of Quantum Arithmetic Circuits in Maude

Naoto Sato, Tsubasa Takagi

Quantum arithmetic circuits are fundamental components of many quantum algorithms, including Shor's algorithm. However, ensuring their correctness is challenging because circuit behavior becomes increasingly complex as the number of qubits grows, making exhaustive classical simulation intractable. Subtle design errors may compromise the reliability of entire algorithms. To address this challenge, we present a systematic approach to the formal verification of quantum arithmetic circuits using Maude, a rewriting logic framework suited for algebraic specification and reasoning about complex systems. In our approach, quantum gates and circuits are formally specified as rewrite rules in Maude, enabling a rigorous analysis of their behavior for all possible inputs. Using this framework, we formally verify the correctness of the fundamental quantum arithmetic circuits used in Shor's algorithm, including modular multiplication and modular exponentiation. Our results demonstrate that algebraic specification provides a practical foundation for verifying quantum arithmetic circuits. This work contributes to the development of reliable quantum software and strengthens confidence in arithmetic-intensive quantum algorithms, including the HHL algorithm.

International Symposium on System Security, Safety, and Reliability (ISSSR)•May 1, 2026•0 citations
Quantum computing has advanced rapidly in recent decades, driven by developments across the technology stack, including quantum error-correcting codes and efficient quantum algorithms. Among these, quantum arithmetic circuits serve as fundamental building blocks for various promising algorithms. Despite their crucial role, the design of quantum arithmetic circuits faces challenges arising from the no-cloning theorem, qubit limitations, and circuit depth constraints, which significantly impact the efficiency of large-scale quantum computing. We provide an overview of quantum arithmetic circuits in the context of public-key cryptanalysis, with particular emphasis on optimization strategies such as measurement-based uncomputation and conditionally clean ancilla. We review state-of-the-art designs for essential arithmetic operations in public-key cryptanalysis such as addition, multiplication, and modular exponentiation. We also present an overview of the techniques used for fault-tolerant runtime and resource estimation in quantum cryptanalysis. In brief, this chapter emphasizes strategies for designing resource-efficient quantum arithmetic circuits, providing a basis for realistic evaluations of quantum cryptanalytic capabilities.
Quantum arithmetic circuits are fundamental components of many quantum algorithms, including Shor's algorithm. However, ensuring their correctness is challenging because circuit behavior becomes increasingly complex as the number of qubits grows, making exhaustive classical simulation intractable. Subtle design errors may compromise the reliability of entire algorithms. To address this challenge, we present a systematic approach to the formal verification of quantum arithmetic circuits using Maude, a rewriting logic framework suited for algebraic specification and reasoning about complex systems. In our approach, quantum gates and circuits are formally specified as rewrite rules in Maude, enabling a rigorous analysis of their behavior for all possible inputs. Using this framework, we formally verify the correctness of the fundamental quantum arithmetic circuits used in Shor's algorithm, including modular multiplication and modular exponentiation. Our results demonstrate that algebraic specification provides a practical foundation for verifying quantum arithmetic circuits. This work contributes to the development of reliable quantum software and strengthens confidence in arithmetic-intensive quantum algorithms, including the HHL algorithm.