Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures

DOI10.1007/978-3-642-38986-3_6MaRDI QIDQ2868437zbMATH OpenOpenAlexFDO

Authors Mehdi Saeedi, A. Shafaei, Massoud Pedram

Publication date 17 December 2013

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.0432

zbMATH Keywords

2D quantum architecturesnearest neighbor interactionquantum adders

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: Quantum arithmetic circuits have practical applications in various quantum algorithms. In this paper, we address quantum addition on 2-dimensional nearest-neighbor architectures based on the work presented by Choi and Van Meter (JETC 2012). To this end, we propose new circuit structures for some basic blocks in the adder, and reduce communication overhead by adding concurrency to consecutive blocks and also by parallel execution of expensive Toffoli gates. The proposed optimizations reduce total depth from $140sqrtn+k_1$ to $92sqrtn+k_2$ for constants $k_1,k_2$ and affect the computation fidelity considerably.

Recommendations

• Optimized quantum implementation of novel controlled adders/subtractors
• Constant-optimized quantum circuits for modular multiplication and exponentiation
• Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• A fast quantum circuit for addition with few qubits
• T-count optimized quantum circuit for floating point addition and multiplication
• 2D qubit layout optimization for topological quantum computation
• Optimized parity preserving quantum reversible full adder/subtractor
• Adder and Multiplier Design in Quantum-Dot Cellular Automata
• Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture

Cited in

(17)

• Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
• Quantum circuits for floating-point arithmetic
• Depth optimization for topological quantum circuits
• T-count optimized quantum circuit for floating point addition and multiplication
• Cost-efficient design of a quantum multiplier-accumulator unit
• A quantum multiply-accumulator
• An optimized quantum circuit for converting from sign-magnitude to two's complement
• Circuit design for a measurement-based quantum carry-lookahead adder
• Fast quantum modular exponentiation
• Constant-optimized quantum circuits for modular multiplication and exponentiation
• Efficient scheme for optimizing quantum Fourier circuits
• A logarithmic-depth quantum carry-lookahead adder
• ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
• A class of efficient quantum incrementer gates for quantum circuit synthesis
• Optimized quantum implementation of novel controlled adders/subtractors
• Robust quantum arithmetic operations with intermediate qutrits in the NISQ-era
• Quantum circuit optimization via graph partitioning by quantum annealing

This page was built for publication: Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868437)