Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 79 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 45 tok/s
GPT-5 High 43 tok/s Pro
GPT-4o 103 tok/s
GPT OSS 120B 475 tok/s Pro
Kimi K2 215 tok/s Pro
2000 character limit reached

Application of resource theory based on free Clifford+kT computation to early fault-tolerant quantum computing (2508.14546v1)

Published 20 Aug 2025 in quant-ph

Abstract: Recent advances in quantum hardware are bringing fault-tolerant quantum computing (FTQC) closer to reality. In the early stage of FTQC, however, the numbers of available logical qubits and high-fidelity $T$ gates remain limited, making it crucial to optimize the quantum resource usage. In this work, we aim to study the simulation cost of general quantum states under the constraint that only $k$ $T$ gates can be used, alongside an unlimited number of Clifford gates. Inspired by the notion of robustness of magic (RoM) which quantifies the cost of quantum-circuit simulation using stabilizer states ($k = 0$), we introduce its generalization, which we call Clifford+$kT$ robustness, treating Clifford+$kT$ states as free resources. We explore theoretical properties of Clifford$+kT$ robustness and in particular derive a lower bound that reveals the (in)efficiency of quantum-circuit simulation using Clifford$+kT$ states. Through numerical computations, we also evaluate Clifford+$kT$ robustness for key resource states for universal quantum computation, such as tensor products of the magic states. Our results allow to assess the sampling-cost reduction achieved by the use of Clifford+$kT$ states instead of stabilizer states, providing practical guidance for efficient resource usage in the early-FTQC era.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.