Robust Quantum Arithmetic Operations with Intermediate Qutrits in the NISQ-era

• URL: http://arxiv.org/abs/2212.11305v1
• Date: Wed, 21 Dec 2022 19:00:53 GMT
• Title: Robust Quantum Arithmetic Operations with Intermediate Qutrits in the NISQ-era
• Authors: Amit Saha, Anupam Chattopadhyay, Amlan Chakrabarti
• Abstract summary: 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.
• Score: 9.769081901589614
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Numerous scientific developments in this NISQ-era (Noisy Intermediate Scale Quantum) have raised the importance for quantum algorithms relative to their conventional counterparts due to its asymptotic advantage. For resource estimates in several quantum algorithms, arithmetic operations are crucial. With resources reported as a number of Toffoli gates or T gates with/without ancilla, several efficient implementations of arithmetic operations, such as addition/subtraction, multiplication/division, square root, etc., have been accomplished in binary quantum systems. More recently, it has been shown that intermediate qutrits may be employed in the ancilla-free frontier zone, enabling us to function effectively there. In order to achieve efficient implementation of all the above-mentioned quantum arithmetic operations with regard to gate count and circuit-depth without T gate and ancilla, we have included an intermediate qutrit method in this paper. Future research aiming at reducing costs while taking into account arithmetic operations for computing tasks might be guided by our resource estimations using intermediate qutrits. Therefore, the enhancements are examined in relation to the fundamental arithmetic circuits. The intermediate qutrit approach necessitates access to higher energy levels, making the design susceptible to errors. We nevertheless 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.

Related papers

• Reducing T-Count in quantum string matching algorithm using relative-phase Fredkin gate [0.0]
  This paper introduces the relative-phase Fredkin gate as a strategy to notably reduce the number of T gates (T-count) necessary for the QSM algorithm. We demonstrate our method is advantageous in terms of other circuit costs, such as the depth of T gates and the number of CNOT gates.
  arXiv  Detail & Related papers  (2024-11-02T15:27:18Z)
• Scalable quantum circuit design for QFT-based arithmetic [0.0]
  We create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity.
  arXiv  Detail & Related papers  (2024-10-31T23:34:06Z)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation [6.082536657383077]
  This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation.
  arXiv  Detail & Related papers  (2023-09-01T21:31:14Z)
• 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)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic [1.1140384738063092]
  We implement QFT-based integer addition and multiplications on quantum computers. These operations are fundamental to various quantum applications. We evaluate these implementations based on IBM's superconducting qubit architecture.
  arXiv  Detail & Related papers  (2021-12-17T06:51:18Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.