T-count optimized Wallace tree integer multiplier for quantum computing
From MaRDI portal
Publication:2239664
DOI10.1007/s10773-021-04864-3OpenAlexW3178298781MaRDI QIDQ2239664
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
Theory of computing (68Qxx) Circuits, networks (94Cxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum pattern matching fast on average
- Designing novel quaternary quantum reversible subtractor circuits
- Quantum circuits for floating-point arithmetic
- Quantum algorithms and circuits for linear equations with infinite or no solutions
- Cost-efficient design of a quantum multiplier-accumulator unit
- An efficient design for reversible Wallace unsigned multiplier
- Theory of quantum computation, communication, and cryptography. Third workshop, TQC 2008, Tokyo, Japan, January 30--February 1, 2008. Revised selected papers
- Mapping NCV Circuits to Optimized Clifford+T Circuits
- MINIMIZATION AND OPTIMIZATION OF REVERSIBLE BCD-FULL ADDER/SUBTRACTOR USING GENETIC ALGORITHM AND DON'T CARE CONCEPT
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Faster quantum chemistry simulation on fault-tolerant quantum computers
- Quantum arithmetic operations based on quantum fourier transform on signed integers
- Quantum Circuit Design of a T-count Optimized Integer Multiplier
- Logical Reversibility of Computation
- Majority Gate Networks
- Exponentially more precise quantum simulation of fermions in second quantization
This page was built for publication: T-count optimized Wallace tree integer multiplier for quantum computing
