2004
DOI: 10.1142/s0219749904000304
|View full text |Cite
|
Sign up to set email alerts
|

Modeling Full Adder in Ising Spin Quantum Computer With 1000 Qubits Using Quantum Maps

Abstract: The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising-spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algo- This allows us to reduce the calculation time to a reasonable value.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2006
2006
2009
2009

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…We note that the number of the spin chains R max theoretically is not limited, so that the size of the whole system and the total number of spins can be increased by increasing R. If L ≪ L max the influence of environment is small and one can formulate quantum dynamics in terms of wave function instead of using density matrix. This allows one to consider quantum logic operations with many qubits [23,25,28] and to analytically estimate the influence of other sources of error which, as shown below, can cause a much more profound destructive effect on quantum computation.…”
Section: A Decoherencementioning
confidence: 99%
See 1 more Smart Citation
“…We note that the number of the spin chains R max theoretically is not limited, so that the size of the whole system and the total number of spins can be increased by increasing R. If L ≪ L max the influence of environment is small and one can formulate quantum dynamics in terms of wave function instead of using density matrix. This allows one to consider quantum logic operations with many qubits [23,25,28] and to analytically estimate the influence of other sources of error which, as shown below, can cause a much more profound destructive effect on quantum computation.…”
Section: A Decoherencementioning
confidence: 99%
“…Criterion (iv) is satisfied because our system allows implementations using qubits with long decoherence times. One possible implementation is based on nuclear spins, for example nuclear spins of 31 P [12], 29 Si [13], or Li [14] in 28 Si. Another implementation is based on endohedral fullerenes, 15 N@C 60 and 31 P@C 60 [15], where the fulleren cage provides a good isolation of electron or nuclear spin of the enclosed atom of nitrogen or phosphorus from the environment.…”
Section: Introductionmentioning
confidence: 99%