Quantum computing and polynomial equations over the finite field Z 2

Quantum Information and Computation

Volumn 5, Issue 2, 2005, Pages 102-112

  Dawson, Christopher M ^a   Hines, Andrew P ^a   Mortimer, Duncan ^a   Haselgrove, Henry L ^a,b   Nielsen, Michael A ^a   Osborne, Tobias J ^c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Complexity; Computing; Polynomials; Quantum

Indexed keywords

QUANTUM COMPUTERS;

COMPLEXITY; COMPLEXITY CLASS; COMPUTATIONAL POWER; COMPUTING; FINITE FIELDS; POLYNOMIAL EQUATION; QUANTUM; QUANTUM COMPUTING;

POLYNOMIALS;

EID: 16244411647     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comp., 26(5): 1484-1509, 1997.
2. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings, 35th Annual Symposium on Fundamentals of Computer Science, Los Alamitos, 1994. IEEE Press.
3. M. A. Nielsen and I. L. Chuang. Quantum computation and quantum information. Cambridge University Press, Cambridge, 2000.
4. J. Preskill. Physics 229: Advanced mathematical methods of physics - Quantum computation and information. California Institute of Technology, Pasadena, CA, 1998. http://www.theory.caltech.edu/people/preskill/ph229/.
5. R. P. Feynman. Space-time approach to quantum electrodynamics. Physical Review, 76:769-789, 1949.
6. R. P. Feynman and A. R. Hibbs. Quantum mechanics and path integrals. McGraw-Hill, New York, 1965.
7. D. Cox, J. Little, and D. O'Shea. Ideals, varieties, and algorithms. Springer-Verlag, New York, 2nd edition, 1997.
8. R. Hartshorne. Algebraic Geometry, volume 52 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1977.
9. A. Weil. Numbers of solutions of equations in finite fields. Bull Am. Math. Soc., 55:497-508, 1949.
10. A. Ehrenfeucht and M. Karpinski. The computational complexity of (XOR, AND)-counting problems. Technical report, 1990. Available online at www.citeseer.com.
11. J. von zur Gathen, M. Karpinski, and I. Shparlinksi. Counting curves and their projections. Computational complexity, 6:64-99, 1997.
12. C. M. Papadimitriou. Computational complexity. Addison-Wesley, Reading, Massachusetts, 1994.
13. S. Aaronson. Complexity Zoo. Online website available at http://www.complexityzoo.com.
14. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comp., 26(5):1411-1473, 1997.
15. L. Adleman, J. Demarrais, and M. A. Huang. Quantum computability. SIAM J. Comp., 26(5):1524-1540, 1997.
16. L. Fortnow and J. Rogers. Complexity limitations on quantum computation. Journal of Computer and System Sciences, 59(2):240-252, 1999. arXiv:cs.CC/9811023.
17. E. Knill, R. Laflamme. Quantum Computation and Quadratically Signed Weight Enumerators. Inf. Process. Lett., 79(4):173-179, 2001. arXiv:quant-ph/9909094.
18. Y. Shi. Both Toffoli and Controlled-NOT need little help to do universal quantum computation. Quantum Information and Computation, 3(1):84-92, 2003. arXiv:quant-ph/0205115.
19. D. Aharonov. A simple proof that Toffoli and Hadamard are quantum universal. arXiv:quant-ph/0301040, 2003.
20. C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin. Capacities of quantum erasure channels. Phys. Rev. Lett., 78(16):3217-3220, 1997. arXiv:quant-ph/ 9701015.
21. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Comp., 26(5):1510-1523, 1997. arXiv:quant-ph/9701001.
22. S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48(1):116-148, 1994.
23. J. Gill. Computational complexity of probabilistic complexity classes. SIAM Journal on Computing, 6:675-695, 1977.
24. D. Gottesman. Fault-tolerant quantum computation with higher-dimensional systems. In C. P. Williams, editor, Quantum computing and quantum communications: First NASA International Conference, Berlin, 1999. Springer-Verlag. arXiv:quant-ph/9802007.
25. D. Gottesman. Stabilizer Codes and Quantum Error Correction. PhD thesis, California Institute of Technology, Pasadena, CA, 1997. arXiv:quant-ph/9705052.
26. A. Y. Vlasov. Towards Lagrangian approach to quantum computations. arXiv:quant-ph/0308017.