An efficient conversion of quantum circuits to a linear nearest neighbor architecture
From MaRDI portal
Publication:3171632
zbMATH Open1237.81050MaRDI QIDQ3171632FDOQ3171632
Yasuhiko Nakashima, S. Yamasita, Yuichi Hirata, Masaki Nakanishi
Publication date: 5 October 2011
Recommendations
- Changing the gate order for optimal LNN conversion
- Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
- Synthesis of quantum circuits for linear nearest neighbor architectures
- Efficient quantum computing between remote qubits in linear nearest neighbor architectures
- scientific article
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Mathematical problems of computer architecture (68M07)
Cited In (13)
- Line ordering of reversible circuits for linear nearest neighbor realization
- Optimal Quantum Circuits for Nearest-Neighbor Architectures
- Depth optimization for topological quantum circuits
- Cost optimization technique for quantum circuits
- Title not available (Why is that?)
- Depth-optimized reversible circuit synthesis
- Title not available (Why is that?)
- Reversible circuit synthesis by genetic programming using dynamic gate libraries
- Mathematical formulation of quantum circuit design problems in networks of quantum computers
- Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
- Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)
- A Fully Fault-Tolerant Representation of Quantum Circuits
- Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
This page was built for publication: An efficient conversion of quantum circuits to a linear nearest neighbor architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171632)
