Changing the gate order for optimal LNN conversion

DOI10.1007/978-3-642-29517-1_8zbMATH Open1451.81147OpenAlexW1569024294MaRDI QIDQ2902503FDOQ2902503

Authors: Atsushi Matsuo, S. Yamasita 

Publication date: 20 August 2012

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29517-1_8

Recommendations

• An efficient conversion of quantum circuits to a linear nearest neighbor architecture
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
• Line ordering of reversible circuits for linear nearest neighbor realization
• Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective

zbMATH Keywords

quantum circuitlinear nearest neighboradjacent transposition graph

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

Cited In (5)

• Depth optimization for topological quantum circuits
• Automorphism groups of Cayley graphs generated by general transposition sets
• Mathematical formulation of quantum circuit design problems in networks of quantum computers
• Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
• An efficient conversion of quantum circuits to a linear nearest neighbor architecture

This page was built for publication: Changing the gate order for optimal LNN conversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2902503)