Quantum fan-out is powerful

Theory of Computing

Volumn 1, Issue , 2005, Pages 81-103

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

^a UNIVERSITY OF CALGARY   (Canada)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Constant depth circuits; Fan out; Quantum circuits; Quantum computing; Quantum Fourier transform; Threshold circuits

Indexed keywords

QUANTUM COMPUTERS;

CONSTANT-DEPTH CIRCUITS; FAN OUT; QUANTUM CIRCUIT; QUANTUM COMPUTING; QUANTUM FOURIER TRANSFORMS; THRESHOLD CIRCUITS;

COMPUTER CIRCUITS;

EID: 77953166506     PISSN: None     EISSN: 15572862     Source Type: Journal    
DOI: 10.4086/toc.2005.v001a005     Document Type: Article

References (24)

1. L. M. ADLEMAN, J. DEMARRAIS, and M. A. HUANG: Quantum computability. SIAM Journal on Computing, 26(5):1524-1540, 1997. [SICOMP:29363]
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. [PRA:10.1103/PhysRevA.52.3457, arXiv: quant-ph/9503016]
3. R. BEIGEL: The polynomial method in circuit complexity. In Proc. of 8th IEEE Structure in Complexity Theory Conf., pp. 82-95, 1993. [1993.336538].
4. J. I. CIRAC and P. ZOLLER: Quantum computations with cold trapped ions. Phys. Rev. Lett., 74:4091-4094, 1995. [PRL:10.1103/PhysRevLett.74.4091]
5. R. CLEVE and J. WATROUS: Fast parallel circuits for the quantum Fourier transform. In Proc. of 41st IEEE FOCS, pp. 526-536, 2000. [FOCS:10.1109/SFCS.2000.892140]
6. D. COPPERSMITH: An approximate Fourier transform useful in quantum factoring. IBM technical report RC19642, quant-ph/0201067, 1994. [arXiv:quant-ph/0201067]
7. M. FANG, S. FENNER, F. GREEN, S. HOMER, and Y. ZHANG: Quantum lower bounds for fanout. 2003. [arXiv:quant-ph/0312208].
8. S. A. FENNER: Implementing the fanout gate by a Hamiltonian. 2003. [arXiv: quantph/0309163]
9. N. GERSHENFELD and I. CHUANG: Bulk spin resonance quantum computation. Science, 275:350-356, 1997. [doi:10.1126/science.275.5298.350].
10. 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. [arXiv:quantph/0106017].
11. L. HALES and S. HALLGREN: Quantum Fourier sampling simplified. In Proc. of 31st ACM STOC, pp. 330-338, 1999. [STOC:301250.301336].
12. W. HOEFFDING: Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58:13-30, 1963
13. R. A. HORN and C. R. JOHNSON: Matrix Analysis. Cambridge University Press, 1985
14. P. HØYER and R. ŠPALEK: Quantum circuits with unbounded fan-out. In Proc. of 20th STACS, pp. 234-246, 2003. LNCS 2607. [STACS:80j4ju67n25kcf06].
15. K. MØLMER and A. SØRENSEN: Multiparticle entanglement of hot trapped ions. Phys. Rev. Lett., 82:1835-1838, 1999. [PRL:10.1103/PhysRevLett.82.1835].
16. C. MOORE: Quantum circuits: Fanout, parity, and counting. 1999. [arXiv:quant-ph/9903046].
17. C. MOORE and M. NILSSON: Parallel quantum computation and quantum codes. SIAM Journal on Computing, 31(3):799-815, 2002. [SICOMP:35505, arXiv: quant-ph/9808027].
18. 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.
19. P. W. SHOR: Algorithms for quantum computation: discrete logarithms and factoring. In Proc. of 35th IEEE FOCS, pp. 124-134, 1994. [FOCS:10.1109/SFCS.1994.365700].
20. 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. [TIT:10.1109/18.256501]
21. R. SMOLENSKY: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proc. of 19th ACM STOC, pp. 77-82, 1987. [STOC:28395.28404].
22. R. ŠPALEK: Quantum circuits with unbounded fan-out. Master’s thesis, Faculty of Sciences, Vrije Universiteit, Amsterdam, 2002. Shorter version and improved results in quant-ph/0208043. [arXiv:quant-ph/0208043].
23. W. K. WOOTTERS and W. H. ZUREK: A single quantum cannot be cloned. Nature, 299:802-803, 1982. [doi:10.1038/299802a0].
24. A. C-C. YAO: Probabilistic computations: Toward a unified measure of complexity. In Proc. Of 18th IEEE FOCS, pp. 222-227, 1977.