Robust quantum arithmetic operations with intermediate qutrits in the NISQ-era

DOI10.1007/S10773-023-05339-3MaRDI QIDQ6174263zbMATH OpenOpenAlexFDO

Authors Amit Saha, A. Chattopadhyay, Amlan Chakrabarti

Publication date 14 July 2023

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2212.11305

zbMATH Keywords

quantum errorintermediate qutritmulti-valued quantum systemsquantum arithmetic operations

Mathematics Subject Classification ID

Quantum computation (81P68) Other nonclassical models of computation (68Q09) Numerical algorithms for computer arithmetic, etc. (65Y04) Theory of questionnaires (94A50) Quantum gates (81P65) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

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.

Recommendations

• Intermediate qutrit-assisted Toffoli gate decomposition with quantum error correction
• An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit
• T-count optimized Wallace tree integer multiplier for quantum computing
• Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures
• A novel and efficient square root computation quantum circuit for floating-point standard

Cites work

• A logarithmic-depth quantum carry-lookahead adder
• Decompositions of n-qubit Toffoli gates with linear circuit complexity
• Quantum addition circuits and unbounded fan-out
• Quantum computation and quantum information. 10th anniversary edition

Cited in

(2)

• Intermediate qutrit-assisted Toffoli gate decomposition with quantum error correction
• An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit

This page was built for publication: Robust quantum arithmetic operations with intermediate qutrits in the NISQ-era

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174263)