Characterization of non-universal two-qubit Hamiltonians
暂无分享,去创建一个
[1] Mikhail N. Vyalyi,et al. Classical and Quantum Computation , 2002, Graduate studies in mathematics.
[2] Reck,et al. Experimental realization of any discrete unitary operator. , 1994, Physical review letters.
[3] V. Roychowdhury,et al. On Universal and Fault-Tolerant Quantum Computing , 1999, quant-ph/9906054.
[4] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .
[5] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.
[6] Peter W. Shor,et al. Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[7] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[8] D. Deutsch. Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[9] Lloyd,et al. Almost any quantum logic gate is universal. , 1995, Physical review letters.
[10] George Cybenko,et al. Reducing quantum computations to elementary unitary operations , 2001, Comput. Sci. Eng..
[11] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[12] A. Ekert,et al. Universality in quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[13] A. Kitaev. Quantum computations: algorithms and error correction , 1997 .
[14] DiVincenzo. Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.
[15] B. Recht,et al. Efficient discrete approximations of quantum gates , 2001, quant-ph/0111031.
[16] Tommaso Toffoli,et al. Reversible Computing , 1980, ICALP.
[17] Nik Weaver. On the universality of almost every quantum logic gate , 2000 .
[18] P. Benioff. Quantum mechanical hamiltonian models of turing machines , 1982 .
[19] Barenco,et al. Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.
[20] Raymond Laflamme,et al. An Introduction to Quantum Computing , 2007, Quantum Inf. Comput..
[21] D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[22] V. Varadarajan. Lie groups, Lie algebras, and their representations , 1974 .
[23] Max Neunhöffer,et al. LIE Λ-ALGEBRAS , 2009 .
[24] R. Feynman. Simulating physics with computers , 1999 .
[25] P. Benioff. Quantum Mechanical Models of Turing Machines That Dissipate No Energy , 1982 .
[26] A. Barenco. A universal two-bit gate for quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[27] Terry Rudolph,et al. A 2 rebit gate universal for quantum computing , 2002 .
[28] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[29] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.