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

Physical Review A

Ballistic electron waveguide adder

Michael G. Snyder, L. E. Reichl

Published Nov 30, 2004• 16 citations
Publisher

Abstract

We analyze a quantum network, constructed with ballistic electron waveguides, which can add one-bit binary numbers. We consider two different adder networks, one constructed with Hadamard gates and the other constructed with $\sqrt{\mathrm{NOT}}$ gates. Reflection of electron probability at the gates causes a loss in fidelity of the overall calculation. A fidelity requirement for the implementation of individual rotation gates corresponding to a probability $p>1∕2$ of completing the addition successfully is found.

DOI
10.1103/physreva.70.052330

Related papers

Bell states in a resonant quantum waveguide network

Gürsoy B. Akgüç, L. E. Reichl, Anil Shaji +1 more

We show that a network of ballistic electron waveguides can generate entangled Bell-like states from separable states when it is resonant. The network we study is grouped into individual qudits $(d=4)$ made up of pairs of waveguides. Rotation gates in the network produce coherent superpositions of qudit states. A Coulomb gate entangles the qudits. We construct a unitary matrix which characterizes the network dynamics and allows a more systematic study of that dynamics.

Physical Review A•Apr 5, 2004•22 citations

MODELING FULL ADDER IN ISING SPIN QUANTUM COMPUTER WITH 1000 QUBITS USING QUANTUM MAPS

D. I. Kamenev, G. P. Berman, Richard B. Kassman +1 more

The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.

arXiv:quant-ph/0403085•International Journal of Quantum Information•Aug 30, 2004•3 citations

Quantum computation with ballistic electron waveguides

Michael G. Snyder

We present a study of ballistic electron waveguides as used to construct simple \nquantum computational networks. We begin with an introduction to ballistic \nelectron waveguides, some basic theory of quantum computers, and the \npossible role of electron waveguides in quantum computation. Following that, \nour study of various waveguide networks and the physics of the specific components \nof those networks. We continue with a discussion of shot noise in \nnetwork elements and its possible role in helping to build good computational \ngates. Finally we conclude with a summary of research and possible future \nprojects.

•Jan 1, 2006•0 citations

Ancilla-free optimal quantum adder

Junhong Nie, Jialiang Tang, Xiaoming Sun +1 more

We construct an exact $n$-bit quantum adder with $O(n)$ gates and $O(\log n)$ depth that requires no ancillary qubits. The circuit uses only $X$, CNOT, and Toffoli gates under all-to-all connectivity and is classically reversible. Our construction accelerates the controlled ladder underlying addition. Grouping the data into blocks and use existing control qubits as conditional workspace gives a recursive construction with $O(n\log\log n)$ gates and $O(\log n)$ depth. We then coordinate inter-block propagation via two short-path forest operations to cut the per-block workspace requirement, yielding a nonrecursive implementation with $O(n)$ gates. Both the gate count and circuit depth are asymptotically optimal.

quant-pharXiv:2610.34446•Oct 27, 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

QUANTUM ADDER OF CLASSICAL NUMBERS

Alina Cherkas, Sergey A. Chivilikhin

In this article we show the precise algorithm of functioning of quantum adder on the example of addition of two 2-bit numbers. It consists of the quantum Fourier transformer and conditional rotation gates that let us use the minimum number of qubits to get the addition realization of the sum. Despite the fact that the algorithm uses the minimum amount of operations this accelerates the process of the adder.

Journal of Physics Conference Series•Aug 1, 2016•3 citations
We analyze a quantum network, constructed with ballistic electron waveguides, which can add one-bit binary numbers. We consider two different adder networks, one constructed with Hadamard gates and the other constructed with NOT\sqrt{\mathrm{NOT}}NOT​ gates. Reflection of electron probability at the gates causes a loss in fidelity of the overall calculation. A fidelity requirement for the implementation of individual rotation gates corresponding to a probability p>1∕2p>1∕2p>1∕2 of completing the addition successfully is found.
We show that a network of ballistic electron waveguides can generate entangled Bell-like states from separable states when it is resonant. The network we study is grouped into individual qudits (d=4)(d=4)(d=4) made up of pairs of waveguides. Rotation gates in the network produce coherent superpositions of qudit states. A Coulomb gate entangles the qudits. We construct a unitary matrix which characterizes the network dynamics and allows a more systematic study of that dynamics.
The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.
We present a study of ballistic electron waveguides as used to construct simple \nquantum computational networks. We begin with an introduction to ballistic \nelectron waveguides, some basic theory of quantum computers, and the \npossible role of electron waveguides in quantum computation. Following that, \nour study of various waveguide networks and the physics of the specific components \nof those networks. We continue with a discussion of shot noise in \nnetwork elements and its possible role in helping to build good computational \ngates. Finally we conclude with a summary of research and possible future \nprojects.
We construct an exact nnn-bit quantum adder with O(n)O(n)O(n) gates and O(log⁡n)O(\log n)O(logn) depth that requires no ancillary qubits. The circuit uses only XXX, CNOT, and Toffoli gates under all-to-all connectivity and is classically reversible. Our construction accelerates the controlled ladder underlying addition. Grouping the data into blocks and use existing control qubits as conditional workspace gives a recursive construction with O(nlog⁡log⁡n)O(n\log\log n)O(nloglogn) gates and O(log⁡n)O(\log n)O(logn) depth. We then coordinate inter-block propagation via two short-path forest operations to cut the per-block workspace requirement, yielding a nonrecursive implementation with O(n)O(n)O(n) gates. Both the gate count and circuit depth are asymptotically optimal.
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.