The Temple of Quantum Computing
by Riley T. Perry
Number of pages: 250
In quantum computers we exploit quantum effects to compute in ways that are faster or more efficient than, or even impossible, on conventional computers. Quantum computers use a specific physical implementation to gain a computational advantage over conventional computers. Properties called superposition and entanglement may, in some cases, allow an exponential amount of parallelism. Also, special purpose machines like quantum cryptographic devices use entanglement and other peculiarities like quantum uncertainty.
Download or read it online for free here:
by S. Gharibian, Y. Huang, Z. Landau, S. W. Shin - arXiv
We survey the growing field of Quantum Hamiltonian Complexity. Our aim is to provide a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field.
by Eleanor G. Rieffel, Wolfgang Polak - arXiv
This paper will guide computer scientists and other non-physicists through the barriers that separate quantum computing from conventional computing. We introduce basics of quantum mechanics to explain where the power of quantum computers comes from.
by Scott Aaronson - University of Waterloo
We'll start out with various scientific problems that predate quantum computing: for example, the measurement problem, P versus NP, the existence of secure cryptography, the Humean problem of induction, or the possibility of closed timelike curves.
by Samuel J. Lomonaco, jr - arXiv
These notes provide readers, who have some mathematical background but little exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory.