{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/fault-tolerant-non-clifford-state-preparation","title":"Fault Tolerant Non-Clifford State Preparation for Arbitrary Rotations","arxiv_id":"2303.17380","date":"2023-03-30","proceeding":null,"authors":["Hyeongrak Choi","Frederic T. Chong","Dirk Englund","Yongshan Ding"],"abstract":"Quantum error correction is an essential component for practical quantum computing on noisy quantum hardware. However, logical operations on error-corrected qubits require a significant resource overhead, especially for high-precision and high-fidelity non-Clifford rotation gates. To address this issue, we propose a postselection-based algorithm to efficiently prepare resource states for gate teleportation. Our algorithm achieves fault tolerance, demonstrating the exponential suppression of logical errors with code distance, and it applies to any stabilizer codes. We provide analytical derivations and numerical simulations of the fidelity and success probability of the algorithm. We benchmark the method on surface code and show a factor of 100 to 10,000 reduction in space-time overhead compared to existing methods. Overall, our approach presents a promising path to reducing the resource requirement for quantum algorithms on error-corrected and noisy intermediate-scale quantum computers.","url_abs":"https://arxiv.org/abs/2303.17380v1","url_pdf":"https://arxiv.org/pdf/2303.17380v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"fault-tolerant-non-clifford-state-preparation","repo_url":"https://github.com/yale-qcs/non-clifford-state-prep","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2303.17380","atlas_url":"https://app.syntology.ai/?focus=2303.17380","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}