Line ordering of reversible circuits for linear nearest neighbor realization

DOI10.1007/s11128-013-0601-1zbMath1286.81042OpenAlexW2055617519MaRDI QIDQ2443892

Laila AlTerkawi, Suha Hamdan, Imtiaz Ahmad, Mohammad AlFailakawi

Publication date: 8 April 2014

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-013-0601-1

zbMATH Keywords

greedyharmony searchreversible circuitslinear nearest neighborline ordering

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (3)

Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective ⋮ Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit ⋮ Depth optimization for topological quantum circuits

Uses Software

• METIS
• RevLib
• RCViewer+

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Novel derivative of harmony search algorithm for discrete design variables
• Synthesis and optimization of reversible circuits—a survey
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
• Optimal task assignment in linear array networks

This page was built for publication: Line ordering of reversible circuits for linear nearest neighbor realization