



01088nas a2200145   4500008004100000245006400041210006300105260001500168520063800183100002400821700001900845700002000864700002100884856003700905       2014                        eng d00aQuipper: Concrete Resource Estimation in Quantum Algorithms0 aQuipper Concrete Resource Estimation in Quantum Algorithms  c2014/12/013 a<p>Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is done at the level of complexity analysis, but actual concrete numbers (of quantum gates, qubits, etc.) can differ by orders of magnitude. The line of work we present here is a formal framework to write, and reason about, quantum algorithms. Specifically, we designed a language, Quipper, with scalability in mind, and we are able to report actual resource counts for seven non-trivial algorithms found in the quantum computer science literature.</p>1 aSmith, Jonathan, M.1 aRoss, Neil, J.1 aSelinger, Peter1 aValiron, Benoît  uhttp://arxiv.org/abs/1412.0625v1