Intermediate Qutrit-based Improved Quantum Arithmetic Operations with Application on Financial Derivative Pricing

• URL: http://arxiv.org/abs/2205.15822v1
• Date: Tue, 31 May 2022 14:25:51 GMT
• Title: Intermediate Qutrit-based Improved Quantum Arithmetic Operations with Application on Financial Derivative Pricing
• Authors: Amit Saha and Turbasu Chatterjee and Anupam Chattopadhyay and Amlan Chakrabarti
• Abstract summary: 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.
• Score: 8.69212898769542
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation. In binary quantum systems, some efficient implementation of arithmetic operations like, addition/subtraction, multiplication/division, square root, exponential and arcsine etc. have been realized, where resources are reported as a number of Toffoli gates or T gates with ancilla. Recently it has been demonstrated that intermediate qutrits can be used in place of ancilla, allowing us to operate efficiently in the ancilla-free frontier zone. In this article, we have incorporated intermediate qutrit approach to realize efficient implementation of all the quantum arithmetic operations mentioned above with respect to gate count and circuit-depth without T gate and ancilla. Our resource estimates with intermediate qutrits could guide future research aimed at lowering costs considering arithmetic operations for computational problems. As an application of computational problems, related to finance, are poised to reap the benefit of quantum computers, in which quantum arithmetic circuits are going to play an important role. In particular, quantum arithmetic circuits of arcsine and square root are necessary for path loading using the re-parameterization method, as well as the payoff calculation for derivative pricing. Hence, the improvements are studied in the context of the core arithmetic circuits as well as the complete application of derivative pricing. Since our intermediate qutrit approach requires to access higher energy levels, making the design prone to errors, nevertheless, 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.

Related papers

• 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)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• 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)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• A Threshold for Quantum Advantage in Derivative Pricing [4.930045279857117]
  We give the first complete resource estimates for useful quantum derivative pricing. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing. We find that the benchmark use cases we examine require 8k logical qubits and a T-depth of 54 million.
  arXiv  Detail & Related papers  (2020-12-07T16:07:00Z)
• Improved quantum circuits for elliptic curve discrete logarithms [6.058525641792685]
  We present improved quantum circuits for elliptic curve scalar multiplication. We optimize low-level components such as reversible integer and modular arithmetic. We provide a full implementation of point addition in the Q# quantum programming language.
  arXiv  Detail & Related papers  (2020-01-27T04:08:49Z)

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.