(Potential sources especially for describing and contrasting quantum domain) |
m (Victor: add sources) |
||
| Line 25: | Line 25: | ||
von Neumann, J. (1955). ''Mathematical foundations of quantum mechanics''. (R. T. Beyer, Trans.). Princeton University Press. | von Neumann, J. (1955). ''Mathematical foundations of quantum mechanics''. (R. T. Beyer, Trans.). Princeton University Press. | ||
| + | |||
| + | - Victor: sources summary | ||
| + | ir.inflibnet.ac.in:8080/ir/bitstream/1944/212/3/03cali_43.pdf | ||
| + | https://www.geeksforgeeks.org/classical-cryptography-and-quantum-cryptography/amp/ | ||
| + | https://thetechbrook.com/quantum-ethics/ | ||
| + | |||
| + | |||
[[Category:MA279Fall2022Swanson]] | [[Category:MA279Fall2022Swanson]] | ||
Revision as of 11:43, 27 October 2022
Here are APA citations for several possible sources. We don't need to use all of them but any of them could be useful, especially for comparing the quantum situation with classical and post-quantum. Manin & Zilber includes discussion of both quantum logic as a broader topic, and the character of Shor's quantum algorithm for prime factorization and how it fundamentally changed the security situation for public-key systems that rely on factoring being inefficient. Aaronson has a lot of interesting and more intuitive discussions about both theory and practical problems like quantum computers and the potential dangers they pose, and separating hype from what could feasibly happen. Garey & Johnson has a long list of NP-complete problems across different areas of math and computer science that could be interesting for comparison across topics. Cormen et al, could be a good reference for parts of the classical domain, especially RSA and related public-key systems.
Aaronson, S. (2013). Quantum computing since Democritus. Cambridge University Press.
Bengtsson, I. & Życzkowski, K. (2017). Geometry of quantum states: An introduction to quantum entanglement (2nd ed.).
Cambridge University Press.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). MIT Press.
Garey, R. G. & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman
and Company.
Hughes, R. I. G. (1989). The structure and interpretation of quantum mechanics. Harvard University Press.
Jordan, T. F. (1986). Quantum mechanics in simple matrix form. Dover Publications.
Kitaev, A. Y., Shen, A. H., & Vyalyi, M. N. (2002). Classical and quantum computation. American Mathematical Society.
Manin, Y. I. & Zilber, B. (2010). A course in mathematical logic for mathematicians (2nd ed.). Springer.
Pierce, J. R. (1980). An introduction to information theory: Symbols, signals and noise (2nd ed.). Dover
Publications.
Sipser, M. (2013). Introduction to the theory of computation (3rd ed.). Cengage Learning.
von Neumann, J. (1955). Mathematical foundations of quantum mechanics. (R. T. Beyer, Trans.). Princeton University Press.
- Victor: sources summary ir.inflibnet.ac.in:8080/ir/bitstream/1944/212/3/03cali_43.pdf https://www.geeksforgeeks.org/classical-cryptography-and-quantum-cryptography/amp/ https://thetechbrook.com/quantum-ethics/
