Efficient discrete approximations of quantum gates
暂无分享,去创建一个
[1] Eleanor G. Rieffel,et al. J an 2 00 0 An Introduction to Quantum Computing for Non-Physicists , 2002 .
[2] Charles H. Bennett,et al. Quantum information and computation , 1995, Nature.
[3] P. Oscar Boykin,et al. On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[4] Peter W. Shor,et al. Quantum Information Theory , 1998, IEEE Trans. Inf. Theory.
[5] J. Preskill. Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[6] D. Gottesman. Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.
[7] A. Kitaev. Quantum computations: algorithms and error correction , 1997 .
[8] Lloyd,et al. Almost any quantum logic gate is universal. , 1995, Physical review letters.
[9] D. Deutsch,et al. Universality in quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[10] Dietrich Stauffer,et al. Anual Reviews of Computational Physics VII , 1994 .
[11] Umesh V. Vazirani,et al. Quantum complexity theory , 1993, STOC.
[12] A. Lubotzky,et al. Hecke operators and distributing points on S2. II , 1987 .
[13] G. Bodenhausen,et al. Principles of nuclear magnetic resonance in one and two dimensions , 1987 .
[14] A. Lubotzky,et al. Hecke operators and distributing points on the sphere I , 1986 .