SPIN MODEL OF FULL SUMMATOR ON PERES GATES
DOI:
https://doi.org/10.47839/ijc.11.3.572Keywords:
Quantum bit, quantum computer, Peres logical gate, spin, Ising model, fidelity function, full single-digit summator.Abstract
Four-spin model of single-digit summator for solid state nuclear magnetic resonance (NMR) quantum computer is proposed. Correctness of summator’s operation is analyzed in dependence of system parameters. It is found that the summator on Peres gates works correctly in time of four π-pulses on pure numerical and superposition states. Optimal values for exchange in teractions and maximum distance between q- bits necessary for correct summator’s operation are obtained from the analysis of fidelity function.References
M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, NY, 2001, 676 p.
A. De Vos, Reversible Computing: Fundamentals, Quantum Computing, and Applications, Wiley-VCH, 2010, 252 p.
M. Saeedi, I. L. Markov, Synthesis and optimization of reversible circuits – a survey, ACM Computing Surveys, (44) 3 (2012), pp. A1-A34.
G. P. Gorskyi, V. G. Deibuk, Frequency noise influence on functioning of Fredkin quantum gate, Int. J. Computing, (9) 2 (2010), pp. 118-126. (in Ukrainian)
G. P. Gorskyi, V. G. Deibuk, Four spins model of universal quantum Fredkin gate, Informational Technologies and Computer Engineering, (21) 2 (2011), pp. 56-63. (in Ukrainian)
J. W. Bruce, M. A. Tornton et al., Efficient adder circuits based on the conservative reversible logic gates, Proc. IEEE Comp. Soc. Ann. Symp. on VLSI, Pittsburgh, PA (April 25-26, 2002), pp. 83-88.
G. V. Lopez, L. Lara, Numerical simulation of controlled-controlled-not (CCN) quantum gate in a chain of three interacting spins system, J. Phys. B: At. Opt. Mol. Phys., (39) 9 (2006), pp. 3897-3904.
B. Kane, A silicon-based nuclear spin quantum computer, Nature, (398) 5 (1998), pp. 133-137.
Downloads
Published
How to Cite
Issue
Section
License
International Journal of Computing is an open access journal. Authors who publish with this journal agree to the following terms:• Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
• Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
• Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.