暂无分享,去创建一个
[1] Subhash Kak. Teleportation Protocols Requiring Only One Classical Bit , 2003 .
[2] M. Horodecki,et al. BOUND ENTANGLEMENT CAN BE ACTIVATED , 1998, quant-ph/9806058.
[3] Subhash C. Kak. Rotating a qubit , 2000, Inf. Sci..
[4] R. Jozsa,et al. SEPARABILITY OF VERY NOISY MIXED STATES AND IMPLICATIONS FOR NMR QUANTUM COMPUTING , 1998, quant-ph/9811018.
[5] M. Plenio,et al. MINIMAL CONDITIONS FOR LOCAL PURE-STATE ENTANGLEMENT MANIPULATION , 1999, quant-ph/9903054.
[6] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[7] Subhash Kak. Statistical constraints on state preparation for a quantum computer , 2001 .
[8] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[9] E. Knill,et al. Theory of quantum error-correcting codes , 1997 .
[10] R. Feynman. Simulating physics with computers , 1999 .
[11] Jeroen van den Brink,et al. An intrinsic limit to quantum coherence due to spontaneous symmetry breaking. , 2004, Physical review letters.
[12] H. Zeh. On the interpretation of measurement in quantum theory , 1970 .
[13] Subhash Kak. Are Quantum Computing Models Realistic , 2001 .
[14] Charles H. Bennett,et al. The thermodynamics of computation—a review , 1982 .
[15] Subhash Kak. Quantum Information in a Distributed Apparatus , 1998 .
[16] Subhash Kak. Uncertainty In Quantum Computation , 2002 .
[17] Raymond Laflamme,et al. A Theory of Quantum Error-Correcting Codes , 1996 .
[18] Subhash Kak. Quantum key distribution using three basis states , 1999 .
[19] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.
[20] M. Schlosshauer. Decoherence, the measurement problem, and interpretations of quantum mechanics , 2003, quant-ph/0312059.
[21] Ben Reichardt,et al. Fault-Tolerant Quantum Computation , 2016, Encyclopedia of Algorithms.
[22] Subhash Kak. The Initialization Problem in Quantum Computing , 1998 .
[23] D. Deutsch. Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[24] G. Vidal. Entanglement of pure states for a single copy , 1999, quant-ph/9902033.
[25] Timothy F. Havel,et al. Ensemble quantum computing by NMR spectroscopy , 1997, Proc. Natl. Acad. Sci. USA.
[26] A. S. Holevo,et al. Capacity of a quantum communication channel , 1979 .
[27] J. Preskill. Fault-tolerant quantum computation , 1997, quant-ph/9712048.
[28] J. Bekenstein. Black Holes and Entropy , 1973, Jacob Bekenstein.
[29] David P. DiVincenzo,et al. Local fault-tolerant quantum computation , 2005 .
[30] S. Braunstein,et al. Quantum computation , 1996 .
[31] Subhash C. Kak. General qubit errors cannot be corrected , 2003, Inf. Sci..
[32] H. D. Zeh,et al. Where Has All the Information Gone? , 2005 .
[33] DiVincenzo. Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.
[34] Viola,et al. Theory of quantum error correction for general noise , 2000, Physical review letters.
[35] Andrew M. Steane. Efficient fault-tolerant quantum computing , 1999, Nature.
[36] D. DiVincenzo,et al. The Physical Implementation of Quantum Computation , 2000, quant-ph/0002077.
[37] W. Zurek. The Environment, Decoherence and the Transition from Quantum to Classical , 1991 .
[38] Subhash C. Kak. A Three-Stage Quantum Cryptography Protocol , 2005, ArXiv.
[39] R. Landauer,et al. Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..
[40] H. D. Zeh. Roots and Fruits of Decoherence , 2006 .
[41] Subhash Kak,et al. Information Complexity of Quantum Gates , 2005 .