Originally Posted by eshbach
anyone who thinks this is real has absolutely no understanding of quatum physics.
In any given quantum field there is an inherent decay from the original quantum state into an incoherent state as it interacts with the state of the environment. These interactions between the environment and qubits are unavoidable, and induce a breakdown of information and thus computational errors.
This stems from the problem of particle spin being affected by the environment in one of three linearly independant ways. The spin may flip over, the phase of the spin may change sign, or both a spin flip and a phase change may occur. Therefore, for a system of n qubits, the total number of possible independent ways for errors to afflict at most t qubits is given by the equation: E(n,t) = Summation(j=d(3^j)C(n,j)) within a Hilbert space that is orthagonal to the Hilbert space of the original state. Therefore, for any k number of qubits, the inequality 2^k * E(n,t) < 2^n MUST be satisfied.
Given rate R = k/n, the inequality can be expressed as a bound on R such that R = k/n < 1 -H(p) -plog2(3) where here H(p)= - p log2p - ( 1 - p ) log2( 1 - p ) is the entropy function and p=t/n is the error rate.
So, until you can prove to me that this inequality is satisified any quantum computing design will be severely errored.
i sight the following sources for reference:
a. Q. A. Turchette, C. J. Hood, W. Lange, H. Mabuchi, and H. J. Kimble, Phys. Rev. Lett. 75, 4710(1995).
b. S. Lloyd, Phys. Rev. Lett. 75, 346(1995).
c. S. Lloyd, "Quantum Analog Computers," submitted to Science (1996).
d. J. Preskill, "Can Quantum Errors Be Corrected?," unpublished notes (November, 1994).
e. A. Despain et al., JASON Report JSR-95-115, Mitre Corporation, McLean, VA.
f. D. Beckman, A. Chari, S. Devabhaktuni, and J. Preskill, Caltech Preprint CALT-68-2021 (1995).
g. H. Mabuchi and P. Zoller, Phys. Rev. Lett.(1996).
h. N. J. Cerf and C. Adami, "Negative Entropy and Information in Quantum Mechanics," Caltech Preprint (1995), quant-phy/9512022.
... and on a more fundamental level:
1. R. P. Feynman, Intl. J. Theoretical Physics 21, 467 (1982); D. Deutsch, Proc. R. Soc. Lond. A400, 97 (1985); P. Benioff, Phys. Rev. Lett. 48, 1581(1982).
2. P. W. Shor, in 35th Annual Symposium on Foundations of Computer Science: Proceedings, ed. S. Goldwasser, IEEE Computer Society Press (1994).
3. C. Monroe, D. M. Meekhof, B. E. King, W. M. Itano, and D. J. Wineland, Phys. Rev. Lett. 75, 4714(1995).
4. T. Pellizzari, S. A. Gardiner, J. I. Cirac, and P. Zoller, "Decoherence, Continuous Observation, and Quantum Computing: A Cavity QED Model," Phys. Rev. Lett. 75, 3788 (1995).
5. J. I. Cirac and P. Zoller, Phys. Rev. Lett. 74, 4091 (1995).
6. A. Barenco, D. Deutsch, A. Ekert, and R. Jozsa, Phys. Rev. Lett. 74, 4083 (1995); T. Sleator and H. Weinfurter, ibid., 4087; J. I. Cirac and P. Zoller, ibid., 4091.
7. C. W. Gardiner, Phys. Rev. Lett 70, 2269 (1993); H. J. Carmichael, ibid., 2273.
8. A. S. Parkins, P. Marte, P. Zoller, O. Carnal, and H. J. Kimble, Phys. Rev. A 51, 1578 (1995).
9. Z. Hu and H. J. Kimble, Optics Lett. 19,1888 (1994).
10. R. Hughes, et. al., "Quantum Computation and Factoring," Presentation from Los Alamos National Laboratory, (1995).
11. R. Landauer, "Is quantum mechanically coherent computation useful?," in Proceedings of the Drexel-4 Symposium on Quantum Nonintegrability -- Quantum-Classical Correspondence, edited by D. H. Feng and B.-L. Hu (International Press, to appear).
12. P. W. Shor, Phys. Rev. A 52, 2493 (1995); A. R. Calderbank and P. W. Shor, "Good quantum error-correcting codes exist," (1995, unpublished), quant-ph/9512032; A. Steane, "Multiple particle interference and quantum error correction," (1995, unpublished), quant-ph/9601029.
13. For an elementary review see C. H. Bennett, G. Brassard, and A. K. Ekert, Sci. Am. Oct. 1992, 50.
14. C. H. Bennett et al., "Purification of noisy entanglement and faithful teleportation via noisy channels," (1995, unpublished); D. Deutsch et al., "Entanglement-based quantum cryptography is unconditionally secure," (1995, unpublished).
15. V. Vedral, A. Barenco, and A. Ekert, "Quantum networks for elementary arithmetic operations," Oxford preprint (1995), quantu-ph/9511018.
16. C. Miquel, J. P. Paz, R. Perazzo, "Factoring in a dissipative quantum computer," Technical report 9601021 from Los Alamos National Laboratory repository, (1996).
17. C. H. Bennett et al., "Purification of noisy entanglement and faithful teleportation via noisy channels," (1995, unpublished).
18. D. Deutsch et al., "Entanglement-based quantum cryptography is unconditionally secure," (1995, unpublished).
19. H.-K. Lo and H. F. Chau, "Quantum cryptography in noisy channels," (1995, unpublished), quant-ph/9511025.