2013/07/26 by Victor Veitch, Seyed Ali Hamed Mousavian, S A Hamed Mousavian +2 · 1 voice · 511 citations
Computer Science · Physics and Astronomy · #Algorithm #Computation #Computer science #MAGIC (telescope) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum entanglement #Quantum mechanics #Resource dependence theory #Scalability #Statistical physics #Theoretical computer science #Theoretical physics #quant-ph
paper · pdf · doi:10.1088/1367-2630/16/1/013009
published in New Journal of Physics 16(1), 013009 (IOP Publishing)
arxiv created 2013/07/26 · arxiv published 2013/07/26 · arxiv updated 2013/07/26 · openalex publication_date 2014/01/09 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/08
Recent results on the non-universality of fault-tolerant gate sets underline the critical role of resource states, such as magic states, to power scalable, universal quantum computation. Here we develop a resource theory, analogous to the theory of entanglement, that is relevant for fault-tolerant stabilizer computation. We introduce two quantitative measures—monotones—for the amount of non-stabilizer resource. As an application we give absolute bounds on the efficiency of magic state distillation. One of these monotones is the sum of the negative entries of the discrete Wigner representation of a quantum state, thereby resolving a long-standing open question of whether the degree of negativity in a quasi-probability representation is an operationally meaningful indicator of quantum behavior.