Parallelization of Quantum Circuits with Ancillae

Hideaki ABE; Shao Chin SUNG

Parallelization of Quantum Circuits with Ancillae

Hideaki ABE, Shao Chin SUNG

Full Text Views

0

Share
Cite this

Summary :

In this paper, parallelization methods for quantum circuits are studied, where parallelization of quantum circuits means to reconstruct a given quantum circuit to one which realizes the same quantum computation with a smaller depth, and it is based on using additional bits, called ancillae, each of which is initialized to be in a certain state. We propose parallelization methods in terms of the number of available ancillae, for three types of quantum circuits. The proposed parallelization methods are more general than previous one in the sense that the methods are applicable when the number of available ancillae is fixed arbitrarily. As consequences, for the three types of n-bit quantum circuits, we show new upper bounds of the number of ancillae for parallelizing to logarithmic depth, which are 1/log n of previous upper bounds.

Publication: IEICE TRANSACTIONS on Information Vol.E86-D No.2 pp.255-262

Publication Date: 2003/02/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Selected Papers from LA Symposium)

Category: Quantum Computation

Cite this

Copy

Hideaki ABE, Shao Chin SUNG, "Parallelization of Quantum Circuits with Ancillae" in IEICE TRANSACTIONS on Information, vol. E86-D, no. 2, pp. 255-262, February 2003, doi: .
Abstract: In this paper, parallelization methods for quantum circuits are studied, where parallelization of quantum circuits means to reconstruct a given quantum circuit to one which realizes the same quantum computation with a smaller depth, and it is based on using additional bits, called ancillae, each of which is initialized to be in a certain state. We propose parallelization methods in terms of the number of available ancillae, for three types of quantum circuits. The proposed parallelization methods are more general than previous one in the sense that the methods are applicable when the number of available ancillae is fixed arbitrarily. As consequences, for the three types of n-bit quantum circuits, we show new upper bounds of the number of ancillae for parallelizing to logarithmic depth, which are 1/log n of previous upper bounds.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e86-d_2_255/_p

Copy

@ARTICLE{e86-d_2_255,
author={Hideaki ABE, Shao Chin SUNG, },
journal={IEICE TRANSACTIONS on Information},
title={Parallelization of Quantum Circuits with Ancillae},
year={2003},
volume={E86-D},
number={2},
pages={255-262},
abstract={In this paper, parallelization methods for quantum circuits are studied, where parallelization of quantum circuits means to reconstruct a given quantum circuit to one which realizes the same quantum computation with a smaller depth, and it is based on using additional bits, called ancillae, each of which is initialized to be in a certain state. We propose parallelization methods in terms of the number of available ancillae, for three types of quantum circuits. The proposed parallelization methods are more general than previous one in the sense that the methods are applicable when the number of available ancillae is fixed arbitrarily. As consequences, for the three types of n-bit quantum circuits, we show new upper bounds of the number of ancillae for parallelizing to logarithmic depth, which are 1/log n of previous upper bounds.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Parallelization of Quantum Circuits with Ancillae
T2 - IEICE TRANSACTIONS on Information
SP - 255
EP - 262
AU - Hideaki ABE
AU - Shao Chin SUNG
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2003
AB - In this paper, parallelization methods for quantum circuits are studied, where parallelization of quantum circuits means to reconstruct a given quantum circuit to one which realizes the same quantum computation with a smaller depth, and it is based on using additional bits, called ancillae, each of which is initialized to be in a certain state. We propose parallelization methods in terms of the number of available ancillae, for three types of quantum circuits. The proposed parallelization methods are more general than previous one in the sense that the methods are applicable when the number of available ancillae is fixed arbitrarily. As consequences, for the three types of n-bit quantum circuits, we show new upper bounds of the number of ancillae for parallelizing to logarithmic depth, which are 1/log n of previous upper bounds.
ER -