Related papers: Halving the width of Toffoli based constant modular addition to n+3 qubits

Halving the width of Toffoli based constant modular addition to n+3 qubits

URL: http://arxiv.org/abs/2102.03615v1
Date: Sat, 6 Feb 2021 17:07:48 GMT
Title: Halving the width of Toffoli based constant modular addition to n+3 qubits
Authors: Oumarou Oumarou, Alexandru Paler, Robert Basmadjian
Abstract summary: We present an arithmetic circuit performing constant modular addition having $mathcalO(n)$ depth of Toffoli gates. This is an improvement by a factor of two compared to the width of the state-of-the-art Toffoli-based constant modular adder.
Score: 69.43216268165402
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We present an arithmetic circuit performing constant modular addition having $\mathcal{O}(n)$ depth of Toffoli gates and using a total of $n+3$ qubits. This is an improvement by a factor of two compared to the width of the state-of-the-art Toffoli-based constant modular adder. The advantage of our adder, compared to the ones operating in the Fourier-basis, is that it does not require small angle rotations and their Clifford+T decomposition. Our circuit uses a recursive adder combined with the modular addition scheme proposed by Vedral et. al. The circuit is implemented and verified exhaustively with QUANTIFY, an open-sourced framework. We also report on the Clifford+T cost of the circuit.

Related papers

Quantum schoolbook multiplication with fewer Toffoli gates [0.0]
Controlled n-qubit add-subtract circuits perform an addition when the control qubit is one and a subtraction when it is zero. Schoolbook multiplication yields the lowest Toffoli counts for small register sizes.
arXiv Detail & Related papers (2024-10-01T17:39:24Z)
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem [53.446980306786095]
Smooth boosters generate distributions that do not place too much weight on any given example. Originally introduced for their noise-tolerant properties, such boosters have also found applications in differential privacy, mildly, and quantum learning theory.
arXiv Detail & Related papers (2024-09-17T23:09:25Z)
Measurement-based uncomputation of quantum circuits for modular arithmetic [42.70026220176376]
Measurement-based uncomputation is a technique used to perform probabilistic uncomputation of quantum circuits. We show applications to modular arithmetic, using different kinds of plain adders and combinations thereof. Our results have the potential to improve other circuits for modular arithmetic, such as modular multiplication and modular exponentiation.
arXiv Detail & Related papers (2024-07-29T16:56:42Z)
Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries [0.0]
We study the Clifford+Toffoli universal fault-tolerant gate set. We develop Toffoli-count optimal synthesis algorithms for both approximately and exactly implementable multi-qubit unitaries.
arXiv Detail & Related papers (2024-01-17T03:53:37Z)
Improved Synthesis of Toffoli-Hadamard Circuits [1.7205106391379026]
We show that a technique introduced by Kliuchnikov in 2013 for Clifford+$T$ circuits can be straightforwardly adapted to Toffoli-Hadamard circuits. We also present an alternative synthesis method of similarly improved cost, but whose application is restricted to circuits on no more than three qubits.
arXiv Detail & Related papers (2023-05-18T21:02:20Z)
Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
arXiv Detail & Related papers (2023-04-04T23:06:22Z)
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback [98.29086113546045]
We investigate the problem of unconstrained multi-armed bandits with full-bandit feedback and rewards for submodularity. We show that RGL empirically outperforms other full-bandit variants in submodular and non-submodular settings.
arXiv Detail & Related papers (2023-02-02T18:52:14Z)
Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
arXiv Detail & Related papers (2022-09-30T02:36:42Z)
On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
arXiv Detail & Related papers (2021-01-12T21:36:16Z)
Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates [0.9697877942346909]
We construct an efficient control modular adder with small KQ by using relative-phase Toffoli gates in two major types of quantum computers. In FTQ, $T$ gates incur heavy cost due to distillation, which fabricates ancilla for running $T$ gates with high accuracy but consumes a lot of specially prepared ancilla qubits. We propose a new control modular adder that uses only 20% of the number of $T$ gates of the original.
arXiv Detail & Related papers (2020-10-01T08:55:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.