Parallelizing with Limited Number of Ancillae
In this paper, parallelization methods on a condition are proposed for three types of quantum circuits, where the condition is that the number of available ancillae is limited and parallelization means that a given quantum circuit is reconstructed as one with smaller depth. As a by-product, for the three types of n-input quantum circuits, upper bounds on the number of ancillae for parallelizing to logarithmic depth are reduced to 1/ log n of the previous upper bounds.
KeywordsQuantum Computation Quantum Circuit Quantum Gate Total Depth Parallelization Method
Unable to display preview. Download preview PDF.
- 1.A. Barenco. A universal two-bit gate for quantum computation. preprint (1994).Google Scholar
- 4.D. Deutsch, A. Barenco, and A. Ekert. Universality in quantum computation. submitted to Proc. Roy. Soc. London Ser. (1995).Google Scholar
- 6.S. Lloyed. Almost any quantum logic gate is universal. preprint (1994).Google Scholar
- 7.C. Moore and M. Nilsson. Parallel quantum computation and quantum codes. SIAM J. Comput. (to appear) available at Ian! e-print quant-ph/9808027.Google Scholar
- 8.A. Yao. Quantum circuit complexity. in Proc. 34th Annual IEEE Symp. on Foundations of Computer Science 352–361 (1993).Google Scholar