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

DOI10.1007/978-3-030-21500-2_10OpenAlexW2949747156MaRDI QIDQ5237221

Shigeru Yamashita, Atsushi Matsuo

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 neighborSWAP gatequantum circuit placement problem

Mathematics Subject Classification ID

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

Cites Work

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

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