Synthesis of quantum circuits for linear nearest neighbor architectures
From MaRDI portal
(Redirected from Publication:544832)
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.
Recommendations
- Line ordering of reversible circuits for linear nearest neighbor realization
- Depth-optimized reversible circuit synthesis
- scientific article
- An efficient conversion of quantum circuits to a linear nearest neighbor architecture
- Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5320404 (Why is no real title available?)
- Efficient linear optics quantum computation
- Implementation of Shor's algorithm on a linear nearest neighbour qubit array
- LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS
- The cost of quantum gate primitives
Cited in
(34)- An efficient conversion of quantum circuits to a linear nearest neighbor architecture
- A dynamic programming approach to multi-objective logic synthesis of quantum circuits
- Quantum circuit physical design methodology with emphasis on physical synthesis
- Line ordering of reversible circuits for linear nearest neighbor realization
- Considering nearest neighbor constraints of quantum circuits at the reversible circuit level
- Optimal Quantum Circuits for Nearest-Neighbor Architectures
- Designing lattice structures with maximal nearest-neighbor entanglement
- Depth optimization for topological quantum circuits
- Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning
- Reversible and Quantum Circuit Optimization: A Functional Approach
- Cost optimization technique for quantum circuits
- Algorithmic theory of qubit routing
- Towards a cost metric for nearest neighbor constraints in reversible circuits
- Graph transformation meets reversible circuits: model transformation and optimization
- Physical synthesis of quantum circuits using templates
- Evaluating the Flexibility of A* for Mapping Quantum Circuits
- Synthesis of Quantum Circuits for Dedicated Physical Machine Descriptions
- Depth-optimized reversible circuit synthesis
- scientific article; zbMATH DE number 5320404 (Why is no real title available?)
- Mathematical formulation of quantum circuit design problems in networks of quantum computers
- Efficient quantum computing between remote qubits in linear nearest neighbor architectures
- Physical constraint-aware CNOT quantum circuit synthesis and optimization
- Impact of the malicious input data modification on the efficiency of quantum spatial search
- Implementing gate operations between uncoupled qubits in linear nearest neighbor arrays using a learning algorithm
- Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations
- Hierarchical system mapping for large-scale fault-tolerant quantum computing
- Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- scientific article; zbMATH DE number 5320330 (Why is no real title available?)
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
- Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
- Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit
- Using \(\pi\)DDs for nearest neighbor optimization of quantum circuits
- Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits
This page was built for publication: Synthesis of quantum circuits for linear nearest neighbor architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q544832)
