Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
From MaRDI portal
Publication:2684302
Recommendations
- Quantum circuits for floating-point arithmetic
- A novel and efficient square root computation quantum circuit for floating-point standard
- Quantum arithmetic with the quantum Fourier transform
- QUANTUM SOFTWARE REUSABILITY
- Quantum fast Poisson solver: the algorithm and complete and modular circuit design
Cites work
- 50 Years of CORDIC: Algorithms, Architectures, and Applications
- A logarithmic-depth quantum carry-lookahead adder
- A quantum multiply-accumulator
- Addition Theorems and Binary Expansions
- Quantum addition circuits and unbounded fan-out
- Quantum algorithm and circuit design solving the Poisson equation
- Quantum Circuit Design of a T-count Optimized Integer Multiplier
- Quantum fast Poisson solver: the algorithm and complete and modular circuit design
Cited in
(3)
This page was built for publication: Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2684302)