Papers › New Circuit for Quantum Adder by Constant
New Circuit for Quantum Adder by Constant
Dmytro Fedoriaka
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We propose a new circuit for in-place addition of a classical n-bit constant to a quantum n-qubit integer modulo 2ⁿ. Our circuit uses n-3 ancilla qubits and has a T-count of 4n-5. We also propose controlled version of this circuit that uses n-2 ancillas and has a T-count of 11n-15. We implement these circuits in Q#.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections