Ancilla-free quantum adder with sublinear depth

DOI10.1007/978-3-031-97063-4_11MaRDI QIDQ6899778zbMATH OpenFDO

Authors Maxime Remaud, Vivien Vandaele

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97063-4_11

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites work

• A fast quantum circuit for addition with few qubits
• A logarithmic-depth quantum carry-lookahead adder
• A quantum circuit for Shor's factoring algorithm using 2n+2 qubits
• Faster quantum chemistry simulation on fault-tolerant quantum computers
• Parallel Prefix Computation
• Parallelizing quantum circuits
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum addition circuits and unbounded fan-out
• Quantum lower bounds for fanout

This page was built for publication: Ancilla-free quantum adder with sublinear depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899778)