10 citations found. Retrieving documents...
I. Chuang and Y. Yamamoto, "A simple quantum computer", Phys. Rev. A 52, 3489 (1995).

 Home/Search   Document Not in Database   Summary   APS   Related Articles   Check  

This paper is cited in the following contexts:
Simulating Physics with Computers - Feynman (1982)   (114 citations)  (Correct)

.... made as to possible designs for such computers [Teich et al. 1988, Lloyd 1993, 1994a, Cirac and Zoller 1995, DiVincenzo 1995, Sleator and Weinfurter 1995, Barenco et al. 1995b, Chuang and Yamomoto 1995] but there will be substantial difficulty in building any of these [Landauer 1995, Unruh 1995, Chuang et al. 1995, Palma et al. 1995] The most difficult obstacles appear to involve the decoherence of quantum superpositions through the interaction of the computer with the environment, and the implementation of quantum state transformations with enough precision to give accurate results after many computation ....

I. L. Chuang and Y. Yamamoto (1995) "A simple quantum computer," preprint.


Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995)   (105 citations)  (Correct)

....as a consequence, several workers recognized that reversible computation could be executed within a quantum mechanical system. Quantum mechanical Turing machines [5, 6] gate arrays [7] and cellular automata [8] have been discussed, and physical realizations of Toffoli s[9, 10, 11] and Fredkin s[12, 13, 14] universal three bit gates within various quantum mechanical physical systems have been proposed. While reversible computation is contained within quantum mechanics, it is a small subset: the time evolution of a classical reversible computer is described by unitary operators whose matrix elements ....

I. Chuang and Y. Yamamoto, "A simple quantum computer", submitted to Phys. Rev. A (November 1994).


Schumacher's Quantum Data Compression as a Quantum Computation - Cleve, DiVincenzo (1996)   (8 citations)  (Correct)

....that certain variables will always end the program with a particular value if the program runs correctly. This designation will be an important one in constructing reversible code. It is also a reminder that physically, the finalization can serve as a useful check that no error has occurred [11]; a quantum measurement of this register at the end of the running of program should always find the register in the finalized value. One further comment about the program statement if X 0 = 1 then S S 1. If S were a one bit variable, this statement would just be a quantum XOR or controlled ....

I. Chuang and Y. Yamamoto, "A simple quantum computer", Phys. Rev. A 52, 3489 (1995).


Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995)   (105 citations)  (Correct)

....as a consequence, several workers recognized that reversible computation could be executed within a quantum mechanical system. Quantum mechanical Turing machines [5, 6] gate arrays [7] and cellular automata [8] have been discussed, and physical realizations of Toffoli s[9, 10, 11] and Fredkin s[12, 13, 14] universal three bit gates within various quantum mechanical physical systems have been proposed. While reversible computation is contained within quantum mechanics, it is a small subset: the time evolution of a classical reversible computer is described by unitary operators whose matrix elements ....

I. Chuang and Y. Yamamoto, "A simple quantum computer", submitted to Phys. Rev. A (November 1994).


Quantum Computers, Factoring and Decoherence - Chuang Laflamme Shor (1995)   (4 citations)  Self-citation (Chuang)   (Correct)

No context found.

I. L. Chuang and Y. Yamamoto. A Simple Quantum Computer. Submitted to Phys. Rev. A, 1994.


Reversible Arithmetic Coding for Quantum Data Compression - Chuang, Modha   (2 citations)  Self-citation (Chuang)   (Correct)

....[14] such comparisons can be implemented quantum mechanically in O(nq) elementary quantum gates. We have used a swap or operator in circuits for multiply and divide. A quantummechanical operator that swaps two quantum registers of length q can be implemented using O(q) quantum Fredkin gates [32, 33, 34]. For the index i, 1 i n, the overall circuit for M i can be implemented in O(i 2 q 2 ) elementary quantum gates. In conclusion, the overall circuit for the E 1 block can be implemented using O(n 3 q 2 ) elementary quantum gates. The blocks D 1 , E 2 , and D 2 have the same complexity ....

I. L. Chuang and Y. Yamamoto, "Simple quantum computer," Physical Review A, vol. 52, pp. 3489--3496, 1995.


schums1.tex; submitted to Phys. Rev. A 3/7/96.. - As Quantum Computation   (Correct)

No context found.

I. Chuang and Y. Yamamoto, "A simple quantum computer", Phys. Rev. A 52, 3489 (1995).


quant-ph/9603009 - Mar Schums Tex   (Correct)

No context found.

I. Chuang and Y. Yamamoto, "A simple quantum computer", Phys. Rev. A 52, 3489 (1995).


Efficient and Exact Quantum Compression and Molecular Scale O° K.. - Reif   (Correct)

No context found.

I. Chuang and Y. Yamamoto, A simple quantum computer, Phys. Rev. A 52, 3489 (1995). 13


A Quick Glance at Quantum Cryptography - Lomonaco, Jr. (1998)   (Correct)

No context found.

Chuang, Issac L. and Yoshihisa Yamamoto, Simple quantum computer, Phys. Rev. A, Vol. 52, No. 5, November 1995, pp 3489 - 3496.

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