Quantum circuits with unbounded fan-out

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 234-246

  Høyer, Peter ^a   Špalek, Robert ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ARITHMETICAL OPERATIONS; FAN OUT; ONE-QUBIT GATES; PHASE ESTIMATION; POLYNOMIAL SIZE; QUANTUM CIRCUIT; QUANTUM FOURIER TRANSFORMS;

LOGIC CIRCUITS;

EID: 35248854553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_22     Document Type: Article

References (16)

1. L. M. Adleman, J. DeMarrais, and M. A. Huang. Quantum computability. SIAM Journal on Computing, 26(5):1524-1540, 1997.
2. A. Barenco, C. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Physical Review A, 52:3457-3467, 1995. quant-ph/9503016.
3. J. I. Cirac and P. Zoller. Quantum computations with cold trapped ions. Phys. Rev. Lett., 74:4091-4094, 1995.
4. R. Cleve and J. Watrous. Fast parallel circuits for the quantum Fourier transform. In Proc. of the 41st IEEE Symp. on Foundations of Computer Science, pages 526-536, 2000.
5. N. Gershenfeld and I. Chuang. Bulk spin resonance quantum computation. Science, 275:350-356, 1997. http://citeseer.nj.nec.com/gershenfeld97bulk.html.
6. F. Green, S. Homer, C. Moore, and C. Pollett. Counting, fanout, and the complexity of quantum ACC. Quantum Information and Computation, 2(1):35-65, 2002. quant-ph/0106017.
7. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58:13-30, 1963.
8. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
9. C. Moore. Quantum circuits: Fanout, parity, and counting, quant-ph/9903046, 1999.
10. C. Moore and M. Nilsson. Parallel quantum computation and quantum codes. SIAM Journal on Computing, 31(3):799-815, 2002. quant-ph/9808027.
11. A. A. Razborov. Lower bounds for the size of circuits of bounded depth with basis {&,⊕}. Math. Notes Acad. Sci. USSR, 41(4):333-338, 1987.
12. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proc. of the 35th Annual Symp. on FOCS, pages 124-134, Los Alamitos, CA, 1994. IEEE Press. http://citeseer.nj.nec.com/14533.html.
13. K.-Y. Siu, J. Bruck, T. Kailath, and T. Hofmeister. Depth efficient neural networks for division and related problems. IEEE Transactions on Information Theory, 39(3):946-956, 1993.
14. R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proc. 19th Annual A CM Symposium on Theory of Computing, pages 77-82, 1987.
15. R. Špalek. Quantum circuits with unbounded fan-out. Master's thesis, Faculty of Sciences, Vrije Universiteit, Amsterdam, 2002. http://www.ucw.cz/∼robert/qncwf/. Shorter version and improved results in quant-ph/0208043.
16. W. K. Wootters and W. H. Zurek. A single quantum cannot be clone. Nature, 299:802-803, 1982.