Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures

Abstract

While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable circuits. Limited interaction distance between gate qubits is one of the most common limitations. In this paper, we suggest extensions of the existing synthesis flow aimed to realize circuits for quantum architectures with linear nearest neighbor (LNN) interaction. To this end, a template matching optimization, an exact synthesis approach, and two reordering strategies are introduced. The proposed methods are combined as an integrated synthesis flow. Experiments show that by using the suggested flow, quantum cost can be improved by more than 50% on average.

arXiv comment14 pages, 11 figures, 3 tables

References in corpus (15)

• Elementary gates for quantum computation
• Scalable multi-particle entanglement of trapped ions
• Synthesis of Quantum Logic Circuits
• Quantum Circuit Simplification and Level Compaction
• Techniques for the Synthesis of Reversible Toffoli Networks
• Approximate Quantum Fourier Transform and Decoherence
• Reversible Circuit Synthesis Using a Cycle-Based Approach
• Decompositions of general quantum gates
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• A Library-Based Synthesis Methodology for Reversible Logic
• Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
• Shor's algorithm on a nearest-neighbor machine
• A Novel Synthesis Algorithm for Reversible Circuits
• Using error correction to determine the noise model
• Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost

Cited by in corpus (49)

• Synthesis and Optimization of Reversible Circuits - A Survey
• A Verified Optimizer for Quantum Circuits
• Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Optimized Surface Code Communication in Superconducting Quantum Computers
• Impact of qubit connectivity on quantum algorithm performance
• Qubit Mapping Based on Subgraph Isomorphism and Filtered Depth-Limited Search
• Circuit Transformations for Quantum Architectures
• Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning
• An $\Theta (\sqrt{n})$-depth Quantum Adder on a 2D NTC Quantum Computer Architecture
• Exploiting Quantum Teleportation in Quantum Circuit Mapping
• On Optimal Subarchitectures for Quantum Circuit Mapping
• Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies
• Reducing the CNOT count for Clifford+T circuits on NISQ architectures
• Advantages and limitations of quantum routing
• Quantum circuit optimization by topological compaction in the surface code
• Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
• Depth-Optimized Reversible Circuit Synthesis
• Synthesis of Linear Nearest Neighbor Quantum Circuits
• Topological-Graph Dependencies and Scaling Properties of a Heuristic Qubit-Assignment Algorithm
• Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
• Co-Design quantum simulation of nanoscale NMR
• Quantum routing with fast reversals
• Two-qubit entangling gates between distant atomic qubits in a lattice
• Quantum Circuits for Stabilizer Error Correcting Codes: A Tutorial
• QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis
• A Case for Synthesis of Recursive Quantum Unitary Programs
• A Representative Framework for Implementing Quantum Finite Automata on Real Devices
• Controlling Frequency-Domain Hong-Ou-Mandel Interference via Electromagnetically Induced Transparency
• Verified Optimization in a Quantum Intermediate Representation
• Quantum circuit compilation with quantum computers
• Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation
• Advantages of a modular high-level quantum programming framework
• Software Pauli Tracking for Quantum Computation
• Implementation of Quantum Fourier Transform and Quantum Hashing for a Quantum Device with Arbitrary Qubits Connection Graphs
• Resource optimization for fault-tolerant quantum computing
• SWAP-less Implementation of Quantum Algorithms
• Quantum Circuit Transformation: A Monte Carlo Tree Search Framework
• TILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing Architecture
• Realizing Quantum Algorithms on Real Quantum Computing Devices
• Context-Sensitive and Duration-Aware Qubit Mapping for Various NISQ Devices
• Impact of the malicious input data modification on the efficiency of quantum spatial search
• An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code
• Minimization of Quantum Circuits using Quantum Operator Forms
• 2D Qubit Placement of Quantum Circuits using LONGPATH
• A Quantum Cellular Automata architecture with nearest neighbor interactions using one quantum gate type
• Zero-Noise Extrapolation via Cyclic Permutations of Quantum Circuit Layouts