Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Barenco. A universal two-bit gate for quantum computation. preprint (1994).
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).
D. Deutsch. Quantum computational networks. Proc. Roy. Soc. London Ser. A 425 73–90 (1989).
D. Deutsch, A. Barenco, and A. Ekert. Universality in quantum computation. submitted to Proc. Roy. Soc. London Ser. (1995).
D.P. DiVincenzo. Two-bit gates are universal. Phys. Rev. A 501015 (1995).
S. Lloyed. Almost any quantum logic gate is universal. preprint (1994).
C. Moore and M. Nilsson. Parallel quantum computation and quantum codes. SIAM J. Comput. (to appear) available at Ian! e-print quant-ph/9808027.
A. Yao. Quantum circuit complexity. in Proc. 34th Annual IEEE Symp. on Foundations of Computer Science 352–361 (1993).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this paper
Cite this paper
Abe, H., Sung, S.C. (2001). Parallelizing with Limited Number of Ancillae. In: Antoniou, I., Calude, C.S., Dinneen, M.J. (eds) Unconventional Models of Computation, UMC’2K. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0313-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0313-4_11
Publisher Name: Springer, London
Print ISBN: 978-1-85233-415-4
Online ISBN: 978-1-4471-0313-4
eBook Packages: Springer Book Archive