Chuang I L, Laflamme R, Shor P W and Zurek W H, Quantum computers, factoring, and decoherence, Science 270 1633--1635, 1995  Home/Search   Document Not in Database   Summary   Related Articles   Check

....whether and how quantum computers will be physically realizable, 49, 25, 18] but as any physical system, they in principle will be subjected to noise, such as decoherence[75, 71, 53] and inaccuracies. Without error corrections, the e ect of noise can accumulate and ruin the entire computation[71, 16], hence the computation must be protected. Even the simpler question of protecting quantum information is harder than the classical analog because one must also protect the quantum correlations between the quantum bits (qubits) However, it was shown [12, 67] that good quantum error correcting ....

Chuang I L, La amme R, Shor P W and Zurek W H, Quantum computers, factoring, and decoherence, Science 270 1633-1635, 1995

....of the elements, but quantum elements are much more fragile, and it is almost certain that quantum error corrections will be necessary in future quantum computers. It was shown that if the errors are not corrected during quantum computation, they soon accumulate and ruin the entire computation[57, 58, 17, 149]. Hence, a method to correct the effect of quantum noise is necessary. Physicists were pessimistic about the question of whether such a correction method exists[135, 189] The reason is that quantum information in general cannot be cloned[83, 200, 20] and so the information cannot be simply ....

....we understand some of the limitations and advantages of the quantum model, let us go on to the subject of quantum noise. 11 Worries about Decoherence, Precision and Inaccuracies Learning about the possibilities which lie in quantum computation gave rise to a lot of enthusiasm, but many physicist[135, 189, 57, 19] were at the same time very sceptic about the entire field. The reason was that all quantum algorithms achieve their advantage over classical algorithms when assuming that the gates and wires operate without any inaccuracies or errors. Unfortunately, in reality we cannot expect any system to be ....

[Article contains additional citation context not shown here]

Chuang I L, Laflamme R, Shor P W and Zurek W H, Quantum computers, factoring, and decoherence, Science 270 1633--1635, 1995

.... designs have been proposed for realizing quantum computers [17, 23, 31] A number of authors have argued that there are fundamental problems in building quantum computers, most notably the e#ects of the decoherence of quantum superpositions or the entanglement of the system with the environment [14, 18, 29, 35, 42]. Very recently, there has been a sequence of important results showing how to implement quantum error correcting codes and also how to use these codes to make quantum algorithms (quite) robust against the e#ects of decoherence [16, 38] Quantum computation touches upon the foundations of both ....

<F4.08e+05> I. Chuang, R. LaFlamme, P. Shor, and W.<F4.039e+05> Zurek,<F4.112e+05> Quantum computers, factoring and<F4.039e+05> decoherence, Science, Dec. 8, 1995, pp. 1633--1635.

....number of input and output ports. This could give rise to non polynomial space overhead. In the case of the product state model, in order to obtain a mixing between different particle states, xor gates are needed. The interferometric approach does not need xor gates explicitly. It has been claimed [87, 30] that certain supposedly NP hard problems such as factoring can be solved in polynomial time on quantum computers. However, it should be noted that this result faces difficulties. For, it might not be easy to keep the quantum computer in a coherent superposition state over sufficient time and ....

CHUANG, I., LAFLAMME, R., SHOR, P., AND ZUREK, W. Quantum computers, factoring, and decoherence. e-print http://xxx.lanl.gov/abs/quant-ph/9503007.

....is maintaining coherence of the superposition of states long enough to complete the computation. Environmental noise gradually couples to the state of the device, reducing the coherence and eventually limiting the time over which a superposition can perform useful computations (Unruh, 1995; Chuang, Laflamme, Shor, Zurek, 1995). In effect, the coupling to the environment can be viewed as performing a measurement on the quantum system, destroying the superposition of states. This problem is particularly severe for proposed universal quantum computers that need to maintain superpositions for arbitrarily long times. In the ....

Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995). Quantum computers, factoring and decoherence. Science, 270, 1633--1635.

....number of input and output ports. This could give rise to non polynomial space overhead. In the case of the product state model, in order to obtain a mixing between different particle states, xor gates are needed. The interferometric approach does not need xor gates explicitly. It has been claimed [87, 30] that certain supposedly NP hard problems such as factoring can be solved in polynomial time on quantum computers. However, it should be noted that this result faces difficulties. For, it might not be easy to keep the quantum computer in a coherent superposition state over sufficient time and ....

Chuang, I., Laflamme, R., Shor, P., and Zurek, W. Quantum computers, factoring, and decoherence. e-print http://xxx.lanl.gov/abs/quant-ph/9503007.

No context found.

Chuang I L, Laflamme R, Shor P W and Zurek W H, Quantum computers, factoring, and decoherence, Science 270 1633--1635, 1995

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC