A Θ(Mathematical Equation Presented)-depth quantum adder on the 2D NTC quantum computer architecture

Byung Soo Choi, Rodney Van Meter

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

In this work, we propose an adder for the 2-Dimensional Nearest-Neighbor, Two-Qubit gate, Concurrent (2D NTC) architecture, designed to match the architectural constraints of many quantum computing technologies. The chosen architecture allows the layout of logical qubits in two dimensions with (Mathematical Equation Presented) columns where each column has (Mathematical Equation Presented) qubits and the concurrent execution of one- and two-qubit gates with nearest-neighbor interaction only. The proposed adder works in three phases. In the first phase, the first column generates the summation output and the other columns do the carry-lookahead operations. In the second phase, these intermediate values are propagated from column to column, preparing for computation of the final carry for each register position. In the last phase, each column, except the first one, generates the summation output using this column-level carry. The depth and the number of qubits of the proposed adder are Θ(Mathematical Equation Presented) and O(n), respectively. The proposed adder executes faster than the adders designed for the 1D NTC architecture when the length of the input registers n is larger than 51.

Original languageEnglish
Article number24
JournalACM Journal on Emerging Technologies in Computing Systems
Volume8
Issue number3
DOIs
Publication statusPublished - 2012 Aug 1

Keywords

  • 2D NTC quantum computer architecture
  • Quantum adder
  • Quantum arithmetic algorithms
  • Quantum circuit
  • Quantum computer

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Θ(Mathematical Equation Presented)-depth quantum adder on the 2D NTC quantum computer architecture'. Together they form a unique fingerprint.

  • Cite this