HackerPapers

arXiv:1708.03684cs.DM

An Introduction to Quantum Computing, Without the Physics

Giacomo Nannicini

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

This paper is a gentle but rigorous introduction to quantum computing intended for discrete mathematicians. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics, stressing the differences with classical computers, and finally describe two well-known algorithms (Simon's algorithm and Grover's algorithm) using the formalism developed in previous sections. This paper does not touch on the physics of the devices, and therefore does not require any notion of quantum mechanics. Numerical examples on an implementation of Grover's algorithm using open-source software are provided.

arXiv comments
v5 simplifies a proof
Journal reference
DOI
Subjects
cs.DMDiscrete Mathematics cs.DSData Structures and Algorithms quant-phQuantum Physics

On Hacker News

Linked by 1 identifiable commenter in 2 comments across 2 threads, from Apr 2020 to Jul 2020. Found in 1 HN submission from Aug 2017 to Aug 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

    • Quantum Country is a nice resource. Also Aaronson. But for me what really helped was Quantum Computing Without the Physics by Nannicini. Aaronson is not formal enough or really a textbook to teach and explain quantum algos like Simons (a good first algo) or Grover. It is an…

      ruggeriView on HNParent context

    • I found Quantum Computing Without The Physics epicly helpful. https://arxiv.org/abs/1708.03684 It explains in terms a computer scientist can understand. As in: it sets out a computational model and explores it, regardless whether we can physically realize that machine. Hope this…

      ruggeriView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.