By Topic

An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hirata, Y. ; Nara Inst. of Sci. & Technol., Ikoma ; Nakanishi, M. ; Yamashita, S. ; Nakashima, Y.

A variety of quantum circuits have been designed. Most of them assume that arbitrary pairs of qubits can interact. However, several promising implementations of quantum computation rely on a Linear Nearest Neighbor (LNN) architecture, which arranges quantum bits on a line, and allows neighbor interactions only. Therefore, several specific circuits have been designed on an LNN architecture. However, a general and efficient conversion technique for an arbitrary circuit has not been established. Therefore, this paper gives an efficient method that converts an arbitrary quantum circuit to one on an LNN architecture. Our method achieves small overhead and time complexity compared with naive techniques. To develop the method, we introduce two key theorems that may be interesting on their own. In addition, our method also achieves smaller overhead for some known circuits designed on an LNN architecture.

Published in:

Quantum, Nano and Micro Technologies, 2009. ICQNM '09. Third International Conference on

Date of Conference:

1-7 Feb. 2009