A survey on quantum computing
Xiaoming Sun · Scientia Sinica Informationis · 2016
On the basis of its unrivalled potential to solve factorization problems and further application in cryptography, quantum computing is considered as one of the most promising computational models for the future. It provides a new angle for thinking of computation and a new approach for attack various computationally difficult problems. In this article, we give a comprehensive survey of developments in the last twenty years on quantum algorithms, quantum complexity, quantum programming theory, quantum circuits, and quantum cryptography that we hope will serve as references for researchers in related fields. We also outline various research directions and open problems in this area, with the hope of prompting further progress or even solutions.