Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information and Computation

The quantum fourier transform on a linear nearest neighbor architecture

TakahashiYasuhiro, KunihiroNoboru, OhtaKazuo

Published May 1, 2007• 6 citations
Publisher

Abstract

We show how to construct an efficient quantum circuit for computing a good approximation of the quantum Fourier transform on a linear nearest neighbor architecture. The constructed circuit uses no ...
DOI
10.5555/2011725.2011732

Related papers

An efficient conversion of quantum circuits to a linear nearest neighbor architecture

HirataYuichi, NakanishiMasaki, YamashitaShigeru +1 more

Several promising implementations of quantum computation rely on a Linear NearestNeighbor (LNN) architecture, which arranges quantum bits on a line, and allows neighborinteractions only. Therefore,...

Quantum Information and Computation•Jan 1, 2011•48 citations

Synthesis of quantum circuits for linear nearest neighbor architectures

Mehdi Saeedi, Robert Wille, Rolf Drechsler

arXiv:1110.6412•Quantum Information Processing•Oct 18, 2010•213 citations

Design of Efficient Quantum Circuits Using Nearest Neighbor Constraint in 2D Architecture

Leniency Marbaniang, Abhoy Kole, Kamalika Datta +1 more

Lecture notes in computer science•Jan 1, 2017•8 citations

Synthesis Algorithm based on the Pre-evaluation of Quantum Circuits for Linear Nearest Neighbor Architectures

Dejun Wang, Zhijin Guan, Ying-Ying Tan +1 more

Advances in intelligent systems and computing•Oct 31, 2017•0 citations

Efficient quantum computing between remote qubits in linear nearest neighbor architectures

Preethika Kumar

Quantum Information Processing•Sep 21, 2012•10 citations

An efficient conversion of quantum circuits to a linear nearest neighbor architecture

Yuichi Hirata, Masaki Nakanishi, Shigeru Yamashita +1 more

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 method for an arbitrary circuit has not been established. Therefore, this paper gives an efficient conversion technique to convert quantum circuits to an LNN architecture. When a quantum circuit is converted to an LNN architecture, the objective is to reduce the size of the additional circuit added by the conversion and the time complexity of the conversion. The proposed method requires less additional circuitry 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, the proposed method also achieves less overhead than some known circuits designed from scratch on an LNN architecture.

Quantum Information and Computation•Jan 1, 2011•61 citations
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 method for an arbitrary circuit has not been established. Therefore, this paper gives an efficient conversion technique to convert quantum circuits to an LNN architecture. When a quantum circuit is converted to an LNN architecture, the objective is to reduce the size of the additional circuit added by the conversion and the time complexity of the conversion. The proposed method requires less additional circuitry 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, the proposed method also achieves less overhead than some known circuits designed from scratch on an LNN architecture.