Programs in Physics & Physical Chemistry
|[Licence| Download | New Version Template] aeua_v1_0.tar.gz(480 Kbytes)|
|Manuscript Title: OptQC: An optimised parallel quantum compiler|
|Authors: T. Loke, J. B. Wang, Y.H. Chen|
|Program title: OptQC|
|Catalogue identifier: AEUA_v1_0|
Distribution format: tar.gz
|Journal reference: Comput. Phys. Commun. 185(2014)3307|
|Programming language: Fortran, MPI.|
|Computer: Any computer with Fortran compiler and MPI library.|
|Operating system: Linux.|
|Keywords: Quantum computation, Quantum gates, Quantum circuit, Quantum compiler, Optimisation, Simulated annealing.|
Nature of problem:
It aims to minimise the number of quantum gates required to implement a given unitary operation.
It utilises a threshold-based acceptance strategy for simulated annealing to select permutation matrices P and Q for a given unitary matrix U such that the number of gates in the quantum circuit of U = QTPTU′PQ is minimised, where U′ is equivalent to U up to a permutation. The decomposition of a unitary operator is performed by recursively applying the cosine-sine decomposition.
Running time increases with the size of the unitary matrix, as well as the prescribed maximum number of iterations for qubit permutation selection and the subsequent simulated annealing algorithm. Running time estimates are provided for each example in Section 4. All simulation results presented in this paper are obtained from running the program on the Fornax supercomputer managed by iVEC@UWA with Intel Xeon X5650 CPUs.
|Disclaimer | ScienceDirect | CPC Journal | CPC | QUB|