Datasets:
wesley7137
/
quantum

Dataset card Data Studio Files
xet
 Community
text
stringlengths
0
8.13M
sical and quantum aspects, Rev. Mod. Phys. 74 (2002) 347-
[4] ColinP.WilliamsandScottH.Clearwater,Explorations inQuantumCom-
puting Springer 1997.
[5] R. Landauer, Irreversibility and Heat Generation in the Computing Pro-
cess, IBM J. Res. Dev. 3 (1961) 183. Uncertainty Principle and Minimal
Energy Dissipation in the Computer, Int. J. Theo. Phys. 21 (1982) 283.
The Physical Nature of Information, Phys. Lett. A 217 (1996) 188.
[6] R. Gandy, The Confluence of Ideas in 1936, in ”The Universal Turing
Machine, A Half-Century Survey” ed. R. Herken, Springer-Verlag 1994.
[7] D. Deutsch, Quantum Theory, the Church-Turing Principle and the Uni-
versal Quantum Computer, Proc. Roy. Soc. London A 400 (1985) 97.
[8] R.Gandy,Church’s Thesis and Principles for Mechanisms, in: TheKleene
Symposium, eds. J. Barwise, H.J. Keisler and K. Kunen, pp. 123-148,
North-Holland Publ. Co. 1980.
[9] R.Feynman,SimulatingPhysics withComputers,1982,reprintedin: Feyn-
man and Computation, Perseus Books 1999.
[10] C. H. Bennet, Logical Reversibility of Computation, IBM J. Res. Dev. 17
(1973) 525.Se also: Notes on the History of Reversible Computation, IBM
J. Res. Dev. 32 (1988) 16, The Thermodynamics of Computation - a Re-
view, Int. J. Theo. Phys. 21 (1982) 905.
[11] E.FredkinandT.Toffoli,Conservative Logic,Int.J.Theo.Phys.21(1982)
119.
[12] B.J. Copeland, The Church-Turing Thesis, Stanford Encyclopedia of Phi-
losophy, http://plato.stanford.edu/contents.html,(2002).
150
[13] R. Herken (ed.) The Universal Turing Machine, A Half-Century Syrvey,
Springer-Verlag 1994.
[14] G. Peano, The Principles of Arithmetic Presented by a New Method,
Reprintedin”FromFregetoG¨odel;ASourceBookinMathematicalLogic,
1879-1931”,ed. J. van Heijenoort, iUniverse 1999.
[15] G.E. R´ev´esz, Introduction to Formal Languages, Dover Publications 1991.
[16] M. Davis, Computability and Unsolvability, (1958), Dover Publications
1982.
[17] A. M. Turing, On Computable Numbers, with an Application to the
Entscheidungsproblem, Lond. Math. Soc. (2) 42, (1936-37), 230, a correc-
tion: ibid. 43, (1937), 544. Reprinted in M. Davis (ed.), The Undecidable
Hewlett, NY: Raven Press 1965.
[18] M. Sipser, Introduction to the Theory of Computation, PWS Publishing
Company 1997.
[19] M. D. Davis, R. Sigal and E. J. Weyuker Computability, Complexity, and
Languages, Morgan Kaufmann Publishers 1994, 2:nd ed.
[20] C. H. Papadimitriou, Computationsl Complexity, Addison-Wesley 1994.
[21] H.H. Goldstine, The Computer from Pascal to von Neumann, (1972),
Princeton Univ. Press 1993.
[22] P. van Emde Boas, Machine Models and Simulations, in: Handbook of
TheoreticalComputer Science volApp. 1-66,edJ.vanLeeuwen, Elsevier,
Amsterdam 1990.
[23] G. S. Boolos and R. C. Jeffrey, Computability and Logic, Cambridge Uni-
vesrity Press, 1974.
[24] M. Agarwal, N. Saxena and N. Kayal, PRIMES is in P, preprint
http://www.cse.iitk.ac.in/
[25] D. Deutsch, Quantum Computational networks, Proc.Roy.Soc.LondonA
425 (1989) 73.
[26] N. D. Mermin, From Cbits to Qbits: Teaching Computer Scientists Quan-
tum Mechanics, arXiv:quant-ph/0207118v1,19 Jul 2002.
[27] L. I. Schiff, Quantum Mechanics, McGraw Hill 1968.
[28] L. D. Landau and E. M. Lifschitz, Quantum Mechanics (Non-relativistic
theory), 3d ed. PergamonPress 1977.
[29] A. Aspect, J. Dalibard and G. Roger, Phys. Rev. Lett. 49 (1982) 1804
151
[30] P.A.M Dirac, The Principles of Quantum Mechanics, fourth ed. Oxford
University Press 1958, (first published 1930).
[31] R.P.N. Feynman, Space-Time Approach to Non-Relativistic Quantum Me-
chanics, Rev. Mod. Phys. 20, (1948) 267.
[32] E. Schr¨odinger,Ann. Physik 79, (1926) 361, 489, 734.
[33] H. Goldstein, Classical Mechanics (1950), Addison Wesley 1978
[34] A.PaisInwardBound,OfMatterandForcesinthePhysicalWorld,Claren-
don Press, 1986.
[35] P.M.Morse,H.Feshbach,MethodsofTheoreticalPhysics,vol1,2,McGraw-
Hill New York 1953.
[36] A.Peres,QuantumTheory: ConceptsandMethods,KluwerAcademicPub-
lishers 1993, Fundamental Theories of Physics.
[37] C.J.Isham,LecturesonGroupandVectorSpaces,WorldScientific,Lecture
notes in physics Vol 31, 1989.
[38] G. F. Simmons, Introduction to Topology and Modern Analysis, McGraw-
Hill Book Company 1963.
[39] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum
Information, Cambridge University Press, 2000.
[40] C. H. Bennet, E. Bernstein, G. Brassard and U. Vazirani, Strenghts and
weaknesses of Quantum Computing, SIAM J. Comp. 26(5) (1997) 1510-
1523.
[41] A. C. Yao, Quantum Circuit Complexity, Proc. 34th Ann. IEEE Symp on
Foundations of Computer Science, (1993) 352-361.
[42] E. Bernsteinand U. Vazirani, Quantum Complexity Theory, Siam J. Com-
puting 26(5) (199X) (1997) 1411-1473,arXiv: quant-ph/9701001.
[43] J. M. Myers, xxx, Phys. Rev. Lett. 78 (1997) 1823, M. Ozawa, xxx, Phys.
Rev. Lett. 80 (1998) 631, Theoret. Informatics and Appl. 34 (2000) 379,
Y. Shi, XXX, Phys. Lett. A293 (2002) 379, N. Linden and S. Popescu,
The Halting Problem for Quantum Computers, arXiv: quant-ph/9806054,
T Miyadera and O Masanori, On the Halting Process of Quantum Turing
Machine, quant-ph/0302051.
[44] M. Reck, A. Zeilinger, H. J. Bernstein and P. Bertani Experimental Real-
ization of any Discrete Unitary Operator, Phys. Rev. Lett. 73(1), (1994),
58-61.
[45] D. P. DiVencenzo, Quantum Gates and Circuits, Proc. Roy. Soc. London
A454 (1992) 261, (quant-ph/9705009).
152
[46] A. Galindo and M. A. Martin-Delgado, Information and computation:
Classical and quantum aspects, Rev. Mod. Phys. 74 (2002) 347.
[47] A. Barenco, A Universal Two-Bit Gate for Quantum Computation, Proc.