Synthesis of Linear Nearest Neighbor Quantum Circuits

Abstract

This paper presents models for transforming standard reversible circuits into Linear Nearest Neighbor (LNN) architecture without inserting SWAP gates. Templates to optimize the transformed LNN circuits are proposed. All minimal LNN circuits for all 3-qubit functions have been generated to serve as benchmarks to evaluate heuristic optimization algorithms. The minimal results generated are compared with optimized LNN circuits obtained from the post synthesis algorithm --- template matching with LNN templates. Experiments show that the suggested synthesis flow significantly improves the quantum cost of circuits.

Presented at the 10th International Workshop on Boolean Problems (2012), Freiberg, Germany

References in corpus (1)

• Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures

Cited by in corpus (5)

• Optimization of Circuits for IBM's five-qubit Quantum Computers
• Exploiting Quantum Teleportation in Quantum Circuit Mapping
• Reducing the CNOT count for Clifford+T circuits on NISQ architectures
• Two-qubit entangling gates between distant atomic qubits in a lattice
• Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation