Novel Optimized Designs of Modulo $2n+1$ Adder for Quantum Computing

• URL: http://arxiv.org/abs/2406.07486v1
• Date: Tue, 11 Jun 2024 17:27:11 GMT
• Title: Novel Optimized Designs of Modulo $2n+1$ Adder for Quantum Computing
• Authors: Bhaskar Gaur, Himanshu Thapliyal,
• Abstract summary: There is no existing design of quantum modulo $ (2n+1)$ adder. We propose four quantum adders targeted specifically for modulo $ (2n+1)$ addition.
• Score: 0.4604003661048266
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum modular adders are one of the most fundamental yet versatile quantum computation operations. They help implement functions of higher complexity, such as subtraction and multiplication, which are used in applications such as quantum cryptanalysis, quantum image processing, and securing communication. To the best of our knowledge, there is no existing design of quantum modulo $(2n+1)$ adder. In this work, we propose four quantum adders targeted specifically for modulo $(2n+1)$ addition. These adders can provide both regular and modulo $(2n+1)$ sum concurrently, enhancing their application in residue number system based arithmetic. Our first design, QMA1, is a novel quantum modulo $(2n+1)$ adder. The second proposed adder, QMA2, optimizes the utilization of quantum gates within the QMA1, resulting in 37.5% reduced CNOT gate count, 46.15% reduced CNOT depth, and 26.5% decrease in both Toffoli gates and depth. We propose a third adder QMA3 that uses zero resets, a dynamic circuits based feature that reuses qubits, leading to 25% savings in qubit count. Our fourth design, QMA4, demonstrates the benefit of incorporating additional zero resets to achieve a purer zero state, reducing quantum state preparation errors. Notably, we conducted experiments using 5-qubit configurations of the proposed modulo $(2n+1)$ adders on the IBM Washington, a 127-qubit quantum computer based on the Eagle R1 architecture, to demonstrate a 28.8% reduction in QMA1's error of which: (i) 18.63% error reduction happens due to gate and depth reduction in QMA2, and (ii) 2.53% drop in error due to qubit reduction in QMA3, and (iii) 7.64% error decreased due to application of additional zero resets in QMA4.

Related papers

• A Logarithmic Depth Quantum Carry-Lookahead Modulo $(2^n-1)$ Adder [0.8192907805418581]
  Development of quantum arithmetic circuits for modulo addition is vital for implementing quantum algorithms. Current Noisy Intermediate Scale Quantum (NISQ) era quantum computers cannot handle the additional computational cost associated with fault-tolerant designs. This work presents quantum carry-lookahead modulo $(2n - 1)$ adder (QCLMA), which is designed to receive two n-bit numbers and perform their addition with an O(log n) depth.
  arXiv  Detail & Related papers  (2024-08-02T04:31:22Z)
• Noise-Resilient and Reduced Depth Approximate Adders for NISQ Quantum Computing [0.5188841610098435]
  We investigate how approximate computing can improve the noise resilience of quantum adder circuits in NISQ quantum computing. We propose five designs of approximate quantum adders to reduce depth while making them noise-resilient.
  arXiv  Detail & Related papers  (2024-08-01T21:34:02Z)
• Optimizing Gate Decomposition for High-Level Quantum Programming [0.0]
  Multi-controlled quantum gates naturally arise in high-level quantum programming. This paper presents novel methods for optimizing multi-controlled quantum gates. We demonstrate significant reductions in the number of CNOT gates.
  arXiv  Detail & Related papers  (2024-06-08T21:36:08Z)
• SpinQuant: LLM quantization with learned rotations [49.07335692298487]
  Post-training quantization (PTQ) techniques applied to weights, activations, and the KV cache greatly reduce memory usage, latency, and power consumption of Large Language Models (LLMs) We identify a collection of applicable rotation parameterizations that lead to identical outputs in full-precision Transformer architectures while enhancing quantization accuracy. We propose SpinQuant, a novel approach that incorporates learned rotation matrices for optimal quantized network accuracy.
  arXiv  Detail & Related papers  (2024-05-26T02:15:49Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Improving Quantum Simulation Efficiency of Final State Radiation with Dynamic Quantum Circuits [1.3375143521862154]
  We make use of a new quantum hardware capability called dynamical quantum computing to improve the scaling of the QPS algorithm. We modify the quantum parton shower circuit to incorporate mid-circuit qubit measurements, resets, and quantum operations conditioned on classical information.
  arXiv  Detail & Related papers  (2022-03-18T15:31:19Z)
• Quantum thermodynamic methods to purify a qubit on a quantum processing unit [68.8204255655161]
  We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits. Our starting point is a three qubit design that emulates the well known two qubit swap engine. We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
  arXiv  Detail & Related papers  (2022-01-31T16:13:57Z)
• Q-ASR: Integer-only Zero-shot Quantization for Efficient Speech Recognition [65.7040645560855]
  We propose Q-ASR, an integer-only, zero-shot quantization scheme for ASR models. We show negligible WER change as compared to the full-precision baseline models. Q-ASR exhibits a large compression rate of more than 4x with small WER degradation.
  arXiv  Detail & Related papers  (2021-03-31T06:05:40Z)
• HAWQV3: Dyadic Neural Network Quantization [73.11579145354801]
  Current low-precision quantization algorithms often have the hidden cost of conversion back and forth from floating point to quantized integer values. We present HAWQV3, a novel mixed-precision integer-only quantization framework.
  arXiv  Detail & Related papers  (2020-11-20T23:51:43Z)
• 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.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.