Synthesis of Linear Nearest Neighbor Quantum Circuits

TL;DR

This paper introduces methods for converting reversible circuits into linear nearest neighbor quantum circuits without SWAP gates, optimizing them with templates, and benchmarking minimal circuits to improve quantum cost efficiency.

Contribution

It proposes a novel synthesis flow for LNN circuits, including models, templates, and benchmark generation, enhancing quantum circuit optimization.

Findings

Significant reduction in quantum cost using the proposed synthesis flow

Generated all minimal 3-qubit LNN circuits for benchmarking

Template matching improves optimized LNN circuit performance

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.