New Circuit for Quantum Adder by Constant

2025/01/13 by Fedoriaka, Dmytro · 1 citation
#FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2501.07060

Abstract

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#.

Cited by

• Quantum Arithmetic Algorithms: Implementation, Resource Estimation, and Comparison

Related

• A Classical-Quantum Adder with Constant Workspace and Linear Gates
• Halving the cost of quantum addition
• Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures
• Efficient Quantum Circuit Decompositions via Intermediate Qudits
• Reversible addition circuit using one ancillary bit with application to quantum computing