Д.А. Кронберг, Ю.И. Ожигов, А.Ю. Чернявский - Квантовая информатика и квантовый компьютер (1156791), страница 9
Текст из файла (страница 9)
Ïîýòîìó57ñîñòîÿíèå ýëåêòðîíà âî âòîðîé ïàðå îïðåäåëÿåò âðåìÿñîâåðøåíèÿNOTâïåðâîéÿìå,÷òîïîçâîëÿåòñíîâàâûáðàòü íóæíóþ äëèòåëüíîñòü âðåìåíè äëÿ ïðîèçâîäñòâàîïåðàöèè CNOT.Ýòà ñõåìà î÷åíü ïðèáëèçèòåëüíàÿ è èäåàëèçèðîâàíà;ðåàëüíûå ñõåìû ñëîæíåå è èõ ðåàëèçàöèÿ ïðåäñòàâëÿåòâûçîâ ýêñïåðèìåíòàëüíîé ôèçèêå.58Ëèòåðàòóðà[1] G. Adenier, A. Yu. Khrennikov. Is the Fair Sampling Assumption supported by EPR Experiments?, J. Phys. B40 No 1 (2007) 131-141[2] V.Akulin et al, Description of quantum entanglementwith nilpotent polynimials: extensive characterization ofentanglement and canonical forms, Proceedings of SPIE,2006, vol.
6264, pp. 02-1 - 02-11.[3] V.Akulin et al, Quantum computers and computing,2006, vol. 6 N1, pp. 107-125.[4] V. Aho, J. E. Hopcroft, and J. D. Ullman. The Designand Analysis of. Computer Algorithms. Addison-Wesley,1974.[5] K.Arakelov,molecules.Y.Ozhigov,SimulationviaAssociationoftwo-atomQuantumstateselection,accepted for publication on Vestnik of MGU, Computational mathematics and cybernetics, issue 2009.[6] Experimental Realization of Einstein-Podolsky-RosenBohm Gedankenexperiment: A New Violation of Bell'sInequalities, A.
Aspect, P. Grangier, and G. Roger, Physical Review Letters, Vol. 49, Iss. 2, pp.91-94 (1982)doi:10.1103/PhysRevLett.49.9159[7] P.Benio, Quantum mechanical hamiltonian models ofTuring machines, J. Stat. Phys. 29, 1982, 515-546.[8] C.H.
Bennett, E. Bernstein, G. Brassard and U.V. Vazirani, Strengths and weaknesses of quantum computingSIAM J. on Computing, Vol. 26, No. 5, pp. 15101523,1997.[9] G. Birkho, J. von Neumann, The Logic of Quantum Mechanics, ¾Annals of Mathematics¿, 37 (1936), p.823843.[10] C.H.Bennett, G.Brassard, C.Crepeau, U.M.Maurer, Generalized privacy amplication, IEEE Trans. Inform. Teory, 41, 1915, 1995.[11] R.Blatt et al, Ion trap quantum computing with Ca+ions, Quantum Information Processing, vol.3, 1-5, pp.
6173, 2004.[12] D.V.Blohintsev,Principaltopicsofquantumtheory,1977, Moscow, Nauka (Phys-math. lit.).[13] M. Boyer, M., G. Brassard, P. Hyer, and A. Tapp, Tightbounds on quantum searching, Proc. 4th Workshop onPhysics and Computation, pp. 3643, 1996.[14] Bravyi S.B., Kitaev A.Yu.
Fermionic Quantum Computation, Ann. Phys. - 2002.- v.298, N.1. - p.210-226[15] L. E. J. Brouer. Intuitionism and formalism. Amer. Math.Soc. Bull., 20:8196, 1913.[16] Durr, C., Hoyer, P., A Quantum Algorithm for nding theMinimum, Proc.Roy.Soc.Lond. A455 (1999) 2165-2172[17] R.Feynman, The theory of fundamental processes, Caltex, W.A.Benjamin, Inc., NY, 1961.60[18] R.Feynman, Simulating physics with computers, J. Theoret. hys., 1982, 21, pp. 467-488.[19] R.Feynman, D.Hibbs, Quantum mechanics and path integrals, 1984, Moscow, Nauka (Phys-math.
lit.).[20] M.Genovese, Research on hidden variable theories: Areview of recent progress, Physics Reports, 413, 2005,pp.319-396[21] L.Grover, A fast quantum mechanical algorithm fordatabase search, Proceedings, 28th Annual ACM Symposium on the Theory of Computing (STOC), May 1996,pages 212-219. Proceedings, Melville, NY, 2006, vol. 810,electronic version: xxx.lanl.gov, quant-ph/0610052.[22] M.A.Horne, A.Zeilinger, Speakable and Unspeakable inQuantum Mechanics, Invited book review, Amer.J.Phys.,42,630 (1989).[23] A.Khrennikov, Prequantum Classical Statistical FieldTheory: Complex Representation, Hamilton-Schr?dingerEquation, and Interpretation of Stationary States, Foundations of Physics letters, vol. 19, N4, pp. 299-319[24] Kleene, S.
C. and Vesley, R. E., 1965, The Foundationsof Intuitionistic Mathematics, Especially in Relation toRecursive Functions, North-Holland, Amsterdam.[25] D.E.Knuth, The art of computer programming, AddisonWesley, 1997[26] P.Kurakin, G.Malinetskii, H.Bloom, Dialogue model ofquantum dynamics, Proccedings of SPIE, vol. 6264, 2005,Quantum Informatics - 2005 (ed. Y.Ozhigov)61[27] A.A.Markov, About the continuity of constructive functions, Uspehi Mat. Nauk (rus), 1954, 9, N 3 (61), pp.226-229.[28] Yu.I.Ozhigov, A.Yu.Ozhigov, Algorithmic container forphysics, AIP Conference Proceedings, vol.
962 (QuantumTheory, Reconsideration of Foundations) pp. 168-174[29] Y.Ozhigov, Amplitude quanta in multi particle systemsimulation, Russian Microelectronics, 2006, vol. 35, 1, 5365.[30] Y.Ozhigov, Lower bounds of a quantum search for an extreme point, Proc.Roy.Soc.Lond. A455 (1999) 2165-2172[31] Y.I.Ozhigov.Quantum Computers Speed Up Classicalwith Probability Zero, Chaos Solitons Fractals 10 (1999)1707-1714[32] Y.Ozhigov, How behavior of systems with sparse spectrum can be predicted on a quantum computer, Pis'mav JETP, vol.
76, 11, pp. 799-804.[33] Y.Ozhigov, Dynamical diusion as the approximationof one quantum particle dynamics, lanl e-print, quantph/0702237[34] Y.Ozhigov, Quantum recognition of eigenvalues, structure of devices and thermodynamic properties. ZhETF,2003, vol. 123, iss. 2, pp. 384-398.[35] Y.I.Ozhigov, Easy control on fermionic quantum computations, NATO Science Series, 2005, vol.
189, pp. 27-32.[36] A.Ozhigov, K.Arakelov, Y.Ozhigov, Principles of the numerical simulation of many body quantum dynamics,Quantum computers and computing, 2006, vol. 6 N1, pp.137-148.62[37] Y.Ozhigov, L.Fedichkin, Quantum Computer with FixedInteraction is Universal, JETP Lett. 77, 328-330 (2003)[38] R. Penrose, The road to the reality, NY 2006.[39] J. Sheneld, Mathematical Logic, Nauka, Moscow (1975).[40] P.Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM J.Sci.Statist.Comput.
26 (1997) 1484-1512[41] J.L. Andrade E Silva, J. Loshak, Fields, Particles, Quanta. Moscow, Science, 1972.[42] G.S.Tseitin, Algorithmic operators in the constructivemetric spaces, Doklady Academii Nauk USSR (rus),1959, 128, N 1, pp.49-52.[43] J.A. Wheeler and W.H. Zurek, Quantum Theory andMeasurement, Princeton UP, 1983[44] Wolfram, S.
Twenty Problems in the Theory of CellularAutomata. Physica Scripta T9, 170-183, 1985.[45] C. Zalka: Grover's quantum searching algorithm is optimal. Phys. Rev. A 60 (1999) 27462751.[46] V.ZarnitsynaD.Leckband,,J.HuangC.Zhu,,F.ZhangMemoryin,Y.Chienreceptor,ligand-mediated cell adhesion, Proc Natl Acad Sci U S A. 2007Nov 8.[47] W.Zurek, Probabilities from entanglement, Born's rulefrom invariance, Phys.
Rev. A 71, 052105 (2005)[48] Í.Áîãîëþáîâ,Á.Øèðêîâ,Ââåäåíèåêâàíòîâàííûõ ïîëåé, Ì.,Íàóêà, 1974.63âòåîðèþ[49] ÂàëèåâÊ.À.,Êâàíòîâûåêîìïüþòåðû:ñìåíàïàðàäèãìû âû÷èñëåíèé, Âåñòí. ÌÃÓ,ñåð.15:Âû÷.ìàò.èêèáåðí. 2005, N.2. còð .3-16.[50] Âàëèåâ Ê.À., Êâàíòîâûå êîìïüþòåðû è êâàíòîâûåâû÷èñëåíèÿ, ÓÔÍ, 175 1 (2005), ñòð. 3-39[51] Âàëèåâ Ê.À., Êîêèí À.À. Êâàíòîâûå êîìïüþòåðû:íàäåæäû è ðåàëüíîñòü, Ìîñêâà-Èæåâñê, ÐÕÄ, 2000.[52] Ï.Âèòàíüè,Ì.Ëè,Êîëìîãîðîâñêàÿñëîæíîñòü:äâàäöàòü ëåò ñïóñòÿ, ÓÌÍ, 1988, 43:6(264), 129166[53] Âëàäèìèðîâ Â.Ñ. Óðàâíåíèÿ ìàòåìàòè÷åñêîé ôèçèêè.Ì.: Íàóêà, 1981.[54] Ï.Äèðàê,Ìàòåìàòè÷åñêèåîñíîâûòåîðèèîòíîñèòåëüíîñòè, Ì., Ìèð, 1982.[55] Â.Ì.Äóáîâèê, ÷àñòíîå ñîîáùåíèå[56] Â.Ï.Êóäðÿ, ÷àñòíîå ñîîáùåíèå.[57] Á.À.Êóøíåð.Ëåêöèèïîêîíñòðóêòèâíîìóìàòåìàòè÷åñêîìó àíàëèçó. Ì.: Íàóêà, 1973.[58] Ë.Ä.Ëàíäàó,Å.Ì.Ëèôøèö,Êâàíòîâàÿìåõàíèêà.Íåðåëÿòèâèñòñêàÿ òåîðèÿ, Ìîñêâà, Íàóêà, 1974.[59] Ë.Ä.Ëàíäàó, Å.Ì.Ëèôøèö, Ãèäðîäèíàìèêà, Ì.Íàóêà,1988.[60] À.Í.Ìàëüöåâ, Àëãîðèòìû è ðåêóðñèâíûå ôóíêöèè,Ì., Íàóêà, 1986.[61] ÌåíñêèéÌ.Á.Êîíöåïöèÿñîçíàíèÿâêâàíòîâîé ìåõàíèêè, ÓÔÍ 175 413 (2005)64êîíòåêñòå[62] Ñ.Í.Ìîëîòêîâ, Êâàíòîâàÿ êðèïòîãðàôèÿ è òåîðåìûÂ.À.Êîòåëüíèêîâàîáîäíîðàçîâûõêëþ÷àõèîáîòñ÷åòàõ, ÓÔÍ, 2006, ò.
176, 7, ñòð. 777-788[63] ÍîâèêîâÏ.Ñ.Êîíñòðóêòèâíàÿìàòåìàòè÷åñêàÿëîãèêà ñ òî÷êè çðåíèÿ êëàññè÷åñêîé. Ì.: Íàóêà. 1977[64] ÍîâîñàäîâêâàíòîâîéÁ.Ê.Ìåòîäûõèìèè:Îñíîâûðåøåíèÿòåîðèèóðàâíåíèéìîëåêóëÿðíûõîðáèòàëåé. Íàóêà, Ìîñêâà, 1988, 184 ñ.[65] Þ.È.Îæèãîâ,Êâàíòîâûåâû÷èñëåíèÿ,ó÷åáíîåïîñîáèå, Èçä-âî ÂÌÊ ÌÃÓ, 2003.[66] Ä.Ðîäæåðñ, Àëãîðèòìû è ðåêóðñèâíûå ôóíêöèè, Ì.,Ìèð, 1970.[67] À.Í.Òèõîíîâ, Ìåòîäû ðåøåíèÿ íåêîððåêòíûõ çàäà÷,1986, Ì.Íàóêà, ñì. òàêæå ÄÀÍ ÑÑÑÐ, 1963, ò. 151, N3,ñòð. 501-504.[68] Ð.Òåìàì,ÓðàâíåíèåÍàâüå-Ñòîêñà.Òåîðèÿè÷èñëåííûé àíàëèç, Ì.Ìèð, 1981.[69] Óñïåíñêèé Â.À., ×òî òàêîå íåñòàíäàðòíûé àíàëèç?Ì.Íàóêà, 1987.[70] Óñïåíñêèé Â.À. Ëåêöèè î âû÷èñëèìûõ ôóíêöèÿõ,Ìîñêâà, Íàóêà, 1960[71] À.Þ.Õðåííèêîâ, Êâàíòîâàÿ òåîðèÿ èíôîðìàöèè, Ì.,Ôèçìàòëèò, 2008.65.
![](https://s.studizba.com/z.php?f=/templates/si/i/noavatar.png&w=100&h=100&t=1"){kind=avatar}
