A novel and efficient square root computation quantum circuit for floating-point standard
From MaRDI portal
Publication:2090056
DOI10.1007/s10773-022-05222-7OpenAlexW4297903210MaRDI QIDQ2090056
Publication date: 24 October 2022
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-022-05222-7
quantum computinginteger divisionBabylonian square rootfloating-point square rootquantum arithmetic circuitsT-countT-depth
Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) Lie groups (22Exx)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum key distribution protocol based on modified generalization of Deutsch-Jozsa algorithm in \(d\)-level quantum system
- Quantum circuits for floating-point arithmetic
- T-count optimized Wallace tree integer multiplier for quantum computing
- Uniqueness of twisted linear periods and twisted Shalika periods
- Mapping of Subtractor and Adder-Subtractor Circuits on Reversible Quantum Gates
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
- Quantum Circuit Design of a T-count Optimized Integer Multiplier
- Quantum image processing: A review of advances in its security technologies
- Logical Reversibility of Computation
- Exponentially more precise quantum simulation of fermions in second quantization
This page was built for publication: A novel and efficient square root computation quantum circuit for floating-point standard
