See also D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill, "Efficient Networks for Quantum Factoring", report no. quant-ph/9602016 (1996). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
....language seems like a very tedious task Just like higher languages in ordinary computer programming, it is desirable that quantum operations which are commonly used can be treated as black boxes, without rewriting them from the beginning with elementary gates. Steps in this direction were made by [16, 15, 24, 155, 193]. 27 5 Quantum Algorithms The first and simplest quantum algorithm which achieves advantage over classical algorithms was presented by Deutsch and Jozsa[79] Deutsch and Jozsa s algorithm addresses a problem which we have encountered before, in the context of probabilistic algorithms. f is a ....
Beckman D, Chari A, Devabhaktuni S and Preskill J Efficient networks for quantum factoring, Phys. Rev. A 54, 1034--1063, 1996
A Parallel Quantum Computer Simulator - Obenland, Despain (1997) (6 citations) (Correct)
....the period because we perform it off line using a classical computer. The circuit to calculate f(A) represents the majority of the calculation in the quantum circuit. 2.2. 1 Factoring Implementation We use repeated squaring to perform the modulo exponentiation required by the f(A) circuit [Desp96][BeCh96]. Equation 1 shows that if we use the binary representation of A, the exponentiation consists of a sequence of multiplications. At each step we use a single bit of A and multiply a running product by the factor . Each of these multiplications requires time O(L 2 ) where L is the number of bits ....
D. Beckman, A. Chari, S. Devabhaktuni, and J. Preskill. "Efficient Networks for Quantum Factoring" Physical Review A, 54.
schums1.tex; submitted to Phys. Rev. A 3/7/96.. - As Quantum Computation (Correct)
No context found.
See also D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill, "Efficient Networks for Quantum Factoring", report no. quant-ph/9602016 (1996).
quant-ph/9603009 - Mar Schums Tex (Correct)
No context found.
See also D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill, "Efficient Networks for Quantum Factoring", report no. quant-ph/9602016 (1996).
Quantum Computation - Aharonov (1998) (1 citation) (Correct)
No context found.
Beckman D, Chari A, Devabhaktuni S and Preskill J Efficient networks for quantum factoring, Phys. Rev. A 54, 1034--1063, 1996 69
Quantum Computation: Theory and Implementation - Boyden, III (1999) (Correct)
No context found.
Beckman, D., Chari, A., Devabhaktuni, S., Preskill, J. "Efficient networks for quantum factoring," quant-ph/9602016. 21 Feb 96.
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