Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
From MaRDI portal
Publication:4637981
DOI10.4230/LIPIcs.TQC.2017.7zbMath1427.81020arXiv1706.03419OpenAlexW2964173768MaRDI QIDQ4637981
Martin Roetteler, Alex Parent, Michele Mosca
Publication date: 3 May 2018
Full work available at URL: https://arxiv.org/abs/1706.03419
quantum algorithmsinteger multiplicationreversible circuitsquantum circuitspebble gamesKaratsuba's method
Related Items (2)
Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication ⋮ An improved quantum principal component analysis algorithm based on the quantum singular threshold method
Cites Work
- Unnamed Item
- Unnamed Item
- Reversible space equals deterministic space
- REVS: a tool for space-optimized reversible circuit synthesis
- Pebbling meets coloring: reversible pebble game on trees
- Synthesis and optimization of reversible circuits—a survey
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- Time/Space Trade-Offs for Reversible Computation
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- A quantum algorithm for computing the unit group of an arbitrary degree number field
- Logical Reversibility of Computation
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
This page was built for publication: Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
