Quantum Carry Lookahead Adders for NISQ and Quantum Image Processing
- URL: http://arxiv.org/abs/2106.04758v1
- Date: Wed, 9 Jun 2021 01:02:39 GMT
- Title: Quantum Carry Lookahead Adders for NISQ and Quantum Image Processing
- Authors: Himanshu Thapliyal, Edgard Mu\~noz-Coreas, Vladislav Khalus
- Abstract summary: Quantum circuits based on fault-tolerant gates and error-correcting codes should be used as they tolerant environmental noise.
Current machines called Noisy Intermediate Scale Quantum (NISQ) machines cannot support the overhead associated with faulttolerant design.
The risk for noise errors and decoherence increase as the number of gate layers (or depth) in the circuit increases.
- Score: 0.966840768820136
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Progress in quantum hardware design is progressing toward machines of
sufficient size to begin realizing quantum algorithms in disciplines such as
encryption and physics. Quantum circuits for addition are crucial to realize
many quantum algorithms on these machines. Ideally, quantum circuits based on
fault-tolerant gates and error-correcting codes should be used as they tolerant
environmental noise. However, current machines called Noisy Intermediate Scale
Quantum (NISQ) machines cannot support the overhead associated with
faulttolerant design. In response, low depth circuits such as quantum carry
lookahead adders (QCLA)s have caught the attention of researchers. The risk for
noise errors and decoherence increase as the number of gate layers (or depth)
in the circuit increases. This work presents an out-of-place QCLA based on
Clifford+T gates. The QCLAs optimized for T gate count and make use of a novel
uncomputation gate to save T gates. We base our QCLAs on Clifford+T gates
because they can eventually be made faulttolerant with error-correcting codes
once quantum hardware that can support fault-tolerant designs becomes
available. We focus on T gate cost as the T gate is significantly more costly
to make faulttolerant than the other Clifford+T gates. The proposed QCLAs are
compared and shown to be superior to existing works in terms of T-count and
therefore the total number of quantum gates. Finally, we illustrate the
application of the proposed QCLAs in quantum image processing by presenting
quantum circuits for bilinear interpolation.
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) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color
code [0.0]
We observe improved performance for encoded circuits implementing non-Clifford gates.
Our results illustrate the potential of using codes with quantum gates to implement non-trivial algorithms.
arXiv Detail & Related papers (2023-09-15T18:00:02Z) - High-fidelity parallel entangling gates on a neutral atom quantum
computer [41.74498230885008]
We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel.
These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
arXiv Detail & Related papers (2023-04-11T18:00:04Z) - Comparing planar quantum computing platforms at the quantum speed limit [0.0]
We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits.
We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
arXiv Detail & Related papers (2023-04-04T12:47:00Z) - A fault-tolerant variational quantum algorithm with limited T-depth [2.7648976108201815]
We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set.
VQE is suitable for implementation on a future error-corrected quantum computer.
arXiv Detail & Related papers (2023-03-08T10:31:12Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way.
In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented.
In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
arXiv Detail & Related papers (2023-01-10T19:00:01Z) - Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes.
We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code.
We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
arXiv Detail & Related papers (2020-12-07T23:22:40Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead
Adder [0.966840768820136]
Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware.
Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise.
The T-count performance measure has become important in quantum circuit design.
arXiv Detail & Related papers (2020-04-04T01:07:50Z)
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.