Home // ICQNM 2015, The Ninth International Conference on Quantum, Nano/Bio, and Micro Technologies // View article

An Improved Hirata Algorithm for Quantum Circuit LNN Conversion.

Authors:
Angel Amarilla
Joaquin Lima
Benjamín Barán

Keywords: Quantum Computation; Quantum Circuit Conversion; Linear Nearest Neighbor; Dynamic Programming; Branch & Bound

Abstract:
Hirata et al. proposed an efficient technique for converting general quantum circuits to Linear Nearest Neighbor architecture where an optimal transformed circuit is calculated from the original circuit. However, for some circuits, this algorithm still requires a considerable amount of running time for the conversion. Therefore, in this paper, additional techniques based on Dynamic Programming and Branch & Bound are proposed in order to improve the running time. Several test circuits from the state of the art have been tested. Experimental results demonstrate the effectiveness of the proposed improvements to reduce the original running time without any loss in solution quality measured as the number of SWAP gates that have been added.

Pages: 45 to 50

Copyright: Copyright (c) IARIA, 2015

Publication date: August 23, 2015

Published in: conference

ISSN: 2308-3530

ISBN: 978-1-61208-431-2

Location: Venice, Italy

Dates: from August 23, 2015 to August 28, 2015