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

A New Method For Manipulating Circuits, Application To Quantum Adders — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 10, 2026• 0 citations
Publisher

Abstract

We use a new technique for manipulating controlled quantum circuits to convert between two distinct types of quantum adders, one based on the Quantum Fourier Transform and the other based on the Ripple-Carry technique from classical reversible logic. This conversion takes the form of an explicit gate-level transpilation. We also present a new quantum adder with a natural interpretation as a kind of Carry-Lookahead adder that uses no ancillas. Source: http://arxiv.org/abs/2609.26591v1 (arXiv:2609.26591v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24099410

Related papers

A New Method For Manipulating Circuits, Application To Quantum Adders

William Schober, Scott Wesley

We use a new technique for manipulating controlled quantum circuits to convert between two distinct types of quantum adders, one based on the Quantum Fourier Transform and the other based on the Ripple-Carry technique from classical reversible logic. This conversion takes the form of an explicit gate-level transpilation. We also present a new quantum adder with a natural interpretation as a kind of Carry-Lookahead adder that uses no ancillas.

quant-pharXiv:2609.26591•Sep 23, 2026•0 citations

E8 Root Lattice as Phi-Harmonic Universal Quantum Gate Compiler — E8 Intelligence Research

Andrew Stewart Caldin

The Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 1, 2026•0 citations

Efficient Non-Uniform Quantum Hermite Transform through Adaptive Sampling — E8 Intelligence Research

Andrew Stewart Caldin

On the span of the first $N$ oscillator modes, Gauss--Hermite quadrature gives an exact change of basis between mode coefficients and $N$ weighted position space samples. We implement this transform with $O(N\operatorname{polylog}(N,1/\varepsilon))$ logical gates and polylogarithmic quantum width. The operator-error bound $\varepsilon$ holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound. Source: http://arxiv.org/abs/2609.20739v1 (arXiv:2609.20739v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations

A new quantum ripple-carry addition circuit

Steven A. Cuccaro, Thomas G. Draper, Samuel Kutin +1 more

We present a new linear-depth ripple-carry quantum addition circuit. Previous addition circuits required linearly many ancillary qubits; our new adder uses only a single ancillary qubit. Also, our circuit has lower depth and fewer gates than previous ripple-carry adders.

arXiv:quant-ph/0410184•Oct 22, 2004•682 citations

Multipartite GHZ diagonal states and their entanglement properties — E8 Intelligence Research

Andrew Stewart Caldin

In this paper, we investigate the family of GHZ diagonal states, which are mixed multipartite quantum states that are diagonal in a GHZ type basis. We show that the class of GHZ diagonal states is highly symmetric and exhibits rich entanglement properties, making it relevant for applications in multipartite quantum key distribution. Source: http://arxiv.org/abs/2609.28351v1 (arXiv:2609.28351v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations

Reversible addition circuit using one ancillary bit with application to quantum computing

Phillip Kaye

Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networks are inherently classical, as they can be implemented with only the Toffoli gate. Draper [D00] has proposed an inherently "quantum" network for addition based on the quantum Fourier transform. His approach has the advantage that it requires no carry qubits (the previous approaches required O(n) carry qubits). The network in [D00] uses quantum rotation gates, which must either be implemented with exponential precision, or else be approximated. In this paper I give a network of O(n^3) Toffoli gates for reversibly performing in-place addition with only a single ancillary bit, demonstrating that inherently quantum techniques are not required to achieve this goal (provided we are willing to sacrifice quadratic circuit depth). After posting the original version of this note it was pointed out to me by C. Zalka that essentially the same technique for addition was used in [BCD+96]. The scenario in that paper was different, but it is clear how the technique they described generalizes to that in this paper.

arXiv:quant-ph/0408173•Aug 28, 2004•32 citations
We use a new technique for manipulating controlled quantum circuits to convert between two distinct types of quantum adders, one based on the Quantum Fourier Transform and the other based on the Ripple-Carry technique from classical reversible logic. This conversion takes the form of an explicit gate-level transpilation. We also present a new quantum adder with a natural interpretation as a kind of Carry-Lookahead adder that uses no ancillas. Source: http://arxiv.org/abs/2609.26591v1 (arXiv:2609.26591v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
On the span of the first NNN oscillator modes, Gauss--Hermite quadrature gives an exact change of basis between mode coefficients and NNN weighted position space samples. We implement this transform with O(Npolylog⁡(N,1/ε))O(N\operatorname{polylog}(N,1/\varepsilon))O(Npolylog(N,1/ε)) logical gates and polylogarithmic quantum width. The operator-error bound ε\varepsilonε holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound. Source: http://arxiv.org/abs/2609.20739v1 (arXiv:2609.20739v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
In this paper, we investigate the family of GHZ diagonal states, which are mixed multipartite quantum states that are diagonal in a GHZ type basis. We show that the class of GHZ diagonal states is highly symmetric and exhibits rich entanglement properties, making it relevant for applications in multipartite quantum key distribution. Source: http://arxiv.org/abs/2609.28351v1 (arXiv:2609.28351v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networks are inherently classical, as they can be implemented with only the Toffoli gate. Draper [D00] has proposed an inherently "quantum" network for addition based on the quantum Fourier transform. His approach has the advantage that it requires no carry qubits (the previous approaches required O(n) carry qubits). The network in [D00] uses quantum rotation gates, which must either be implemented with exponential precision, or else be approximated. In this paper I give a network of O(n^3) Toffoli gates for reversibly performing in-place addition with only a single ancillary bit, demonstrating that inherently quantum techniques are not required to achieve this goal (provided we are willing to sacrifice quadratic circuit depth). After posting the original version of this note it was pointed out to me by C. Zalka that essentially the same technique for addition was used in [BCD+96]. The scenario in that paper was different, but it is clear how the technique they described generalizes to that in this paper.