Rieffel, E., & Polak, W. (2000). "An introduction to quantum computing for non-physicists." ACM Computing Surveys 32(3): 300-335. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Computing and Communication - Black, Kuhn, Williams (Correct)
....the cryptography community in particular became very interested in quantum computing. More precisely, it takes e r (lgr0264 9 steps. Shor s algorithm, like most factoring algorithms, uses a standard reduction of the factoring problem to the problem of finding the period of a function. [RP00] What is the period of, say, the function 3 n mod 147 Values of the function for increasing 31 3 2 33 exponents are = 3, 9, 27 or 13 mod 14, 3 4 = 11 mod 14, 35 = 5 mod 14, and 36 = 1 mod 14. Since the function has the value 1 when n=6, the period of 3 n mod 14 is 6. The algorithm has five ....
Eleanor Rieffel and Wolfgang Polak, An Introduction to Quantum Computing for Non-Physicists, ACM Computing Surveys, 32(3):300-335, September 2000 quantph /9809016.
Finding Solutions to NP Problems: Philosophical Differences.. - Greenwood (2001) (2 citations) (Correct)
....f jsi = x1 ; x n=0 U f n j=1 jx j i 1 j0i m=1 jy m jf( i where f( is the Boolean expression and y( are the garbage bits produced during the quantum computation. Specifically, these are bits used to support reversible computations performed by the reversible logic gates [15]. The quantum computation is performed by a unitary gate composed of primitive reversible logic gates: a Not gate, a Controlled Not, and a Controlled Controlled Not gate. These logic gate functions are described by the following unitary matrices: UNOT = j0i h1j j1i h0j UCN = j0i h0j ....
....has been the domain of primarily physicists. It is about time that computer engineers and scientists enter this arena and begin to drive its direction. Many computer professionals entering this field are quickly put off by the notational and conceptual barriers. Tutorials are available (e.g. see [15, 25, 26, 27]) but many readers will quickly find them incomprehensible they are written by physicists for physicists. Out of this lot, however, I believe [15] is the best. The sad truth is a computer professional who lacks a firm foundation i.e. formal training in quantum theory will most likely ....
[Article contains additional citation context not shown here]
E. Rieffel and W. Polak. An introduction to quantum computing for non-physicists. Los Alamos Physics preprint archive, http://xxx.lanl.gov/abs/quantph /9809016, 2000.
Reversible Arithmetic Coding for Quantum Data Compression - Chuang, Modha (2 citations) (Correct)
....et al. 5] and references therein. Such codes might provide the key technology needed to prevent decoherence of quantum states, and, hence, a way to realize large scale quantum computing devices. For excellent reviews of the field, see, for example, Bennett and Shor [6] Rieffel and Polak [7], and Steane [8] The problem of compression is central to storage and transmission of quantum data. In this paper, we investigate quantum algorithms for compressing a sequence of symbols emitted by a memoryless quantum Bernoulli source. The basis for compression of classical data is Shannon s ....
E. Rieffel and W. Polak, "An introduction to quantum computing for non-physicists." http://xxx.lanl.gov/abs/quant-ph/9809016, 1998.
What is Quantum Computation? - Patel (1999) (Correct)
....we should learn how to control them for practical use. The future is not foreseen yet, but it is definitely promising. Acknowledgements In this article, I have touched upon only the basic principles of quantum computation. More details can be found in many reviews and books on the subject [22, 23, 24, 25, 26]. This work was supported in part by the Rajiv Gandhi Institute of Contemporary Studies in cooperation with the Jawaharlal Nehru Centre for Advanced Scientific Research, Bangalore. I am grateful to the Abdus Salam ICTP, Trieste, for its hospitality during the preparation of this manuscript. 15 ....
E. Rieffel and W. Polak, An Introduction to Quantum Computing for Nonphysicists, quant-ph/9809016.
Multi-Agent Systems (MAS) organizations and control W.F.. - Th Street Augusta (Correct)
No context found.
Rieffel, E., & Polak, W. (2000). "An introduction to quantum computing for non-physicists." ACM Computing Surveys 32(3): 300-335.
Unconditionally Secure Quantum Bit Commitment Schemes - Dunkelman (2000) (Correct)
No context found.
E. Rieffel, W. Polak, An Introduction to Quantum Computing for NonPhysicists, Los Alamos preprint archive quant-ph/9809016, August 1998. 15
Beyond Bits: The Future of Quantum Information Processing - Steane, Rieffel (2000) (3 citations) (Correct)
No context found.
E. Rieffel and W. Polak, "An Introduction to Quantum Computing for Non-Physicists," to be published in ACM Computing Surveys, June 2000; http://xxx.lanl. gov/abs/quant-ph/9809016.
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