An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid

DOI10.1007/978-3-030-21500-2_10MaRDI QIDQ5237221zbMATH OpenOpenAlexFDO

Authors Atsushi Matsuo, S. Yamasita

Publication date 17 October 2019

Published in Reversible Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-21500-2_10

zbMATH Keywords

nearest neighborquantum circuit placement problemSWAP gate

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Recommendations

• Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective
• A doubly stochastic matrices-based approach to optimal qubit routing
• Analyzing heuristic-based randomized search strategies for the quantum circuit compilation problem

Cites work

• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures

Cited in

(1)

• A doubly stochastic matrices-based approach to optimal qubit routing

This page was built for publication: An Efficient Method for Quantum Circuit Placement Problem on a 2-D Grid

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