T-count optimized Wallace tree integer multiplier for quantum computing
From MaRDI portal
Publication:2239664
DOI10.1007/S10773-021-04864-3OpenAlexW3178298781MaRDI QIDQ2239664FDOQ2239664
Authors: Yanyan Li 
Publication date: 5 November 2021
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-021-04864-3
Recommendations
- T-count optimized quantum circuit for floating point addition and multiplication
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication
- Constant-optimized quantum circuits for modular multiplication and exponentiation
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- Optimised Trotter decompositions for classical and quantum computing
- Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication
- Efficient quantum circuit of Proth number modular multiplication
- Quantum computing and quadratically signed weight enumerators
- Optimized quantum implementation of elliptic curve arithmetic over binary fields
Theory of computing (68Qxx) Circuits, networks (94Cxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Cites Work
- Title not available (Why is that?)
- Logical Reversibility of Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Minimization and optimization of reversible bcd-full adder/subtractor using genetic algorithm and don't care concept
- Majority Gate Networks
- Quantum addition circuits and unbounded fan-out
- Quantum pattern matching fast on average
- Cost-efficient design of a quantum multiplier-accumulator unit
- Quantum arithmetic operations based on quantum Fourier transform on signed integers
- Designing novel quaternary quantum reversible subtractor circuits
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- Quantum circuits for floating-point arithmetic
- Exponentially more precise quantum simulation of fermions in second quantization
- An efficient design for reversible Wallace unsigned multiplier
- Quantum Circuit Design of a T-count Optimized Integer Multiplier
- Mapping NCV Circuits to Optimized Clifford+T Circuits
- Quantum algorithms and circuits for linear equations with infinite or no solutions
- Theory of quantum computation, communication, and cryptography. Third workshop, TQC 2008, Tokyo, Japan, January 30--February 1, 2008. Revised selected papers
Cited In (4)
- An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit
- Robust quantum arithmetic operations with intermediate qutrits in the NISQ-era
- A novel and efficient square root computation quantum circuit for floating-point standard
- Optimized quantum implementation of novel controlled adders/subtractors
This page was built for publication: T-count optimized Wallace tree integer multiplier for quantum computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239664)
