On the realistic worst case analysis of quantum arithmetic circuits
- URL: http://arxiv.org/abs/2101.04764v1
- Date: Tue, 12 Jan 2021 21:36:16 GMT
- Title: On the realistic worst case analysis of quantum arithmetic circuits
- Authors: Alexandru Paler, Oumarou Oumarou, Robert Basmadjian
- Abstract summary: 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.
- Score: 69.43216268165402
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We provide evidence that commonly held intuitions when designing quantum
circuits can be misleading. In particular we show that: a) reducing the T-count
can increase the total depth; b) it may be beneficial to trade CNOTs for
measurements in NISQ circuits; c) measurement-based uncomputation of relative
phase Toffoli ancillae can make up to 30\% of a circuit's depth; d) area and
volume cost metrics can misreport the resource analysis. Our findings assume
that qubits are and will remain a very scarce resource. The results are
applicable for both NISQ and QECC protected circuits. Our method uses multiple
ways of decomposing Toffoli gates into Clifford+T gates. We illustrate our
method on addition and multiplication circuits using ripple-carry. As a
byproduct result we show systematically that for a practically significant
range of circuit widths, ripple-carry addition circuits are more resource
efficient than the carry-lookahead addition ones. The methods and circuits were
implemented in the open-source QUANTIFY software.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Robust Quantum Arithmetic Operations with Intermediate Qutrits in the
NISQ-era [9.769081901589614]
NISQ-era (Noisy Intermediate Scale Quantum) developments have raised the importance for quantum algorithms.
In this paper, we introduce an intermediate qutrit method for efficient implementation of gate count and circuit-depth without T gate and ancilla.
We demonstrate that the percentage decrease in the probability of error is significant due to the fact that we achieve circuit efficiency by reducing circuit-depth in comparison to qubit-only works.
arXiv Detail & Related papers (2022-12-21T19:00:53Z) - 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) - Intermediate Qutrit-based Improved Quantum Arithmetic Operations with
Application on Financial Derivative Pricing [8.69212898769542]
In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation.
In this article, we have incorporated intermediate qutrit approach to realize efficient implementation of all the quantum arithmetic operations.
We show that the percentage decrease in the probability of error is significant owing to the fact that we achieve circuit robustness compared to qubit-only works.
arXiv Detail & Related papers (2022-05-31T14:25:51Z) - CircuitQ: An open-source toolbox for superconducting circuits [0.0]
CircuitQ is an open-source toolbox for the analysis of superconducting circuits implemented in Python.
It features the automated construction of a symbolic Hamiltonian of the input circuit and a numerical representation of the Hamiltonian with a variable basis choice.
arXiv Detail & Related papers (2021-06-09T19:08:33Z) - Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP.
The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth.
We present empiric evidence for the feasibility of learning the layout method using approximation.
arXiv Detail & Related papers (2020-07-29T05:26:19Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Quantum Circuit Cutting with Maximum Likelihood Tomography [0.22940141855172036]
We introduce maximum likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices.
In addition to minimizing the classical computing overhead of circuit cutting methods, MLFT finds the most likely probability distribution for the output of a quantum circuit.
arXiv Detail & Related papers (2020-05-22T18:00:36Z) - On estimating the entropy of shallow circuit outputs [49.1574468325115]
Estimating the entropy of probability distributions and quantum states is a fundamental task in information processing.
We show that entropy estimation for distributions or states produced by either log-depth circuits or constant-depth circuits with gates of bounded fan-in and unbounded fan-out is at least as hard as the Learning with Errors problem.
arXiv Detail & Related papers (2020-02-27T15:32:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.