OptQC v1.3: An (updated) optimized parallel quantum compiler

Published: 1 October 2016| Version 1 | DOI: 10.17632/yjdmrmrj8d.1
T. Loke, J.B. Wang


Abstract We present a revised version of the OptQC program of Loke et al. (2014) [1]. We have removed the simulated annealing process in favour of a descending random walk. We have also introduced a new method for iteratively generating permutation matrices during the random walk process, providing a reduced total cost for implementing the quantum circuit. Lastly, we have also added a synchronization mechanism between threads, giving quicker convergence to more optimal solutions. New version program s... Title of program: OptQC v1.3 Catalogue Id: AEUA_v1_3 Nature of problem It aims to minimise the number of quantum gates required to implement a given unitary operation. Versions of this program held in the CPC repository in Mendeley Data AEUA_v1_0; <i>OptQC</i>; 10.1016/j.cpc.2014.07.022 AEUA_v1_3; OptQC v1.3; 10.1016/j.cpc.2016.05.028 This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)



Computational Physics, Computational Method