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

Nearest Neighbor Architecture Circuit Synthesis and T-depth Reduction for Quantum Circuit Optimization

Zanhe Qi

Published Mar 31, 2026• 0 citations
Publisher
DOI
10.34382/0002005492

Related papers

Synthesis of quantum circuits for linear nearest neighbor architectures

Mehdi Saeedi, Robert Wille, Rolf Drechsler

arXiv:1110.6412•Quantum Information Processing•Oct 18, 2010•222 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

Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures

Wakaki Hattori, Shigeru Yamashita

Lecture notes in computer science•Jan 1, 2018•45 citations

A 2D-Based Synthesis Strategy for Nearest Neighbor Transformation of Quantum Circuits

Sourodeep Kundu, Shubham Kumar, Hafizur Rahaman +1 more

Lecture notes in networks and systems•Jan 1, 2024•1 citation

Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning

Amlan Chakrabarti, Susmita Sur‐Kolay, Ayan Chaudhury

Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As achieving optimal synthesis is a hard problem, heuristic methods have been proposed in recent literature. In this work we present a graph partitioning based approach for LNN synthesis with reduction in circuit cost. In particular, the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized. Our algorithm determines the reordering of indices of the qubit line(s) for both single control and multiple controlled gates. Experimental results for placing the target qubits of Multiple Controlled Toffoli (MCT) library of benchmark circuits show a significant reduction in gate count and quantum gate cost compared to those of related research works.

arXiv:1112.0564•Dec 2, 2011•58 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
Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As achieving optimal synthesis is a hard problem, heuristic methods have been proposed in recent literature. In this work we present a graph partitioning based approach for LNN synthesis with reduction in circuit cost. In particular, the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized. Our algorithm determines the reordering of indices of the qubit line(s) for both single control and multiple controlled gates. Experimental results for placing the target qubits of Multiple Controlled Toffoli (MCT) library of benchmark circuits show a significant reduction in gate count and quantum gate cost compared to those of related research works.