OptQC: an optimized parallel quantum compiler

T. Loke; J. B. Wang; Y. H. Chen

doi:10.1016/j.cpc.2014.07.022

OptQC: an optimized parallel quantum compiler

T. Loke, J. B. Wang^*, Y. H. Chen

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

The software package Qcompiler (Chen and Wang 2013) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software OptQC, which finds permutation matrices P and Q for a given unitary matrix U such that the number of gates in the quantum circuit of U = Q^T P^TU'PQ is significantly reduced, where U' is equivalent to U up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.

Original language	English
Pages (from-to)	3307-3316
Number of pages	10
Journal	Computer Physics Communications
Volume	185
Issue number	12
DOIs	https://doi.org/10.1016/j.cpc.2014.07.022
Publication status	Published - 1 Dec 2014
Externally published	Yes

Keywords

Optimization
Quantum circuit
Quantum compiler
Quantum computation
Quantum gates
Stimulated annealing

Access to Document

10.1016/j.cpc.2014.07.022

Cite this

@article{7e839c56c51645e48430ef1221e6e6c5,

title = "OptQC: an optimized parallel quantum compiler",

abstract = "The software package Qcompiler (Chen and Wang 2013) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software OptQC, which finds permutation matrices P and Q for a given unitary matrix U such that the number of gates in the quantum circuit of U = QT PTU'PQ is significantly reduced, where U' is equivalent to U up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.",

keywords = "Optimization, Quantum circuit, Quantum compiler, Quantum computation, Quantum gates, Stimulated annealing",

author = "T. Loke and Wang, {J. B.} and Chen, {Y. H.}",

year = "2014",

month = dec,

day = "1",

doi = "10.1016/j.cpc.2014.07.022",

language = "English",

volume = "185",

pages = "3307--3316",

journal = "Computer Physics Communications",

issn = "0010-4655",

publisher = "Elsevier",

number = "12",

}

TY - JOUR

T1 - OptQC

T2 - an optimized parallel quantum compiler

AU - Loke, T.

AU - Wang, J. B.

AU - Chen, Y. H.

PY - 2014/12/1

Y1 - 2014/12/1

N2 - The software package Qcompiler (Chen and Wang 2013) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software OptQC, which finds permutation matrices P and Q for a given unitary matrix U such that the number of gates in the quantum circuit of U = QT PTU'PQ is significantly reduced, where U' is equivalent to U up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.

AB - The software package Qcompiler (Chen and Wang 2013) provides a general quantum compilation framework, which maps any given unitary operation into a quantum circuit consisting of a sequential set of elementary quantum gates. In this paper, we present an extended software OptQC, which finds permutation matrices P and Q for a given unitary matrix U such that the number of gates in the quantum circuit of U = QT PTU'PQ is significantly reduced, where U' is equivalent to U up to a permutation and the quantum circuit implementation of each matrix component is considered separately. We extend further this software package to make use of high-performance computers with a multiprocessor architecture using MPI. We demonstrate its effectiveness in reducing the total number of quantum gates required for various unitary operators.

KW - Optimization

KW - Quantum circuit

KW - Quantum compiler

KW - Quantum computation

KW - Quantum gates

KW - Stimulated annealing

UR - http://www.scopus.com/inward/record.url?scp=85027940538&partnerID=8YFLogxK

U2 - 10.1016/j.cpc.2014.07.022

DO - 10.1016/j.cpc.2014.07.022

M3 - Article

AN - SCOPUS:85027940538

SN - 0010-4655

VL - 185

SP - 3307

EP - 3316

JO - Computer Physics Communications

JF - Computer Physics Communications

IS - 12

ER -

OptQC: an optimized parallel quantum compiler

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this