Parallelizing with Limited Number of Ancillae

  • Hideaki Abe
  • Shao Chin Sung
Conference paper
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)


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.


Quantum Computation Quantum Circuit Quantum Gate Total Depth Parallelization Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Barenco. A universal two-bit gate for quantum computation. preprint (1994).Google Scholar
  2. 2.
    A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Phys. Rev A (52),3457–3467, (1995).CrossRefGoogle Scholar
  3. 3.
    D. Deutsch. Quantum computational networks. Proc. Roy. Soc. London Ser. A 425 73–90 (1989).MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    D. Deutsch, A. Barenco, and A. Ekert. Universality in quantum computation. submitted to Proc. Roy. Soc. London Ser. (1995).Google Scholar
  5. 5.
    D.P. DiVincenzo. Two-bit gates are universal. Phys. Rev. A 501015 (1995).CrossRefGoogle Scholar
  6. 6.
    S. Lloyed. Almost any quantum logic gate is universal. preprint (1994).Google Scholar
  7. 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. 8.
    A. Yao. Quantum circuit complexity. in Proc. 34th Annual IEEE Symp. on Foundations of Computer Science 352–361 (1993).Google Scholar

Copyright information

© Springer-Verlag London 2001

Authors and Affiliations

  • Hideaki Abe
    • 1
  • Shao Chin Sung
    • 1
  1. 1.School of Information ScienceJapan Advanced Institute of Science and TechnologyIshikawaJapan

Personalised recommendations