2012/05/01 by Jonas T. Anderson, Anderson, Jonas T.
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.1205.0289
4 pages, 6 figures Typos fixed and other clarifications
openalex publication_date 2012/05/01 · arxiv created 2012/05/22 · arxiv updated 2012/05/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we study reusable magic states. These states are a special subset of the standard magic states. Once distilled, reusable magic states can be used, repeatedly, to apply some unitary U. Given this property, reusable magic states have the potential to greatly lower qubit and gate overheads in fault-tolerant quantum computation. While these states are promising, we provide a strong argument for their limited computational power. Specifically, we show that if reusable magic states can be used to apply non-Clifford unitaries, then we can exploit them to efficiently simulate poly-sized quantum circuits on a classical computer.