算术深度、最小门字母表与单量子比特二元程序的精确程序-状态资源
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
AI总结:
该研究针对单量子比特二元程序,通过证明相对交律并结合算术闭包不变量,得出三类资源深度相等的结论,为量子程序提供精确静态资源效应及证书生成编译器。
摘要:
量子程序的资源分析通常给出量子比特、门或非Clifford操作的安全上界。我们研究单量子比特二元片段,其中最深的精确资源层可被精确推断。从归一化中点模糊态语法出发,我们定义二元程序态与分圆塔K_D=Q(2cos(π/2^D))。对投影单量子比特Clifford-分圆塔Ĝ_D⊆SO(3),我们证明相对交律:当d≤D时,Ĝ_D∩SO(3,K_d)=Ĝ_d。结合该下降定理与自适应稳定器处理的算术闭包不变量,可得Fdepth(U)=Adepth(U)=Rdepth(U):包含可精确合成信道的Bloch矩阵的最小实分圆域、实现该信道至整体相位的最浅二元门字母表、以及足以完成精确稳定器辅助实现的最浅二元程序态层,三者完全一致。在该公共最小值下,已知的固定字母表合成给出最小本原旋转计数。我们将该结果封装为精确静态资源效应,并概述生成证书的编译器。
英文摘要:
Resource analyses for quantum programs commonly provide safe upper bounds on qubits, gates, or non-Clifford operations. We study a single-qubit dyadic fragment in which the deepest exact resource layer can instead be inferred exactly. Starting from the normalized-midpoint misty-state syntax, we define dyadic program states and the real cyclotomic tower $K_D=\mathbb Q(2\cos(π/2^D))$. For the projective single-qubit Clifford-cyclotomic tower $\widehat G_D\subseteq SO(3)$, we prove the relative intersection law $\widehat G_D\cap SO(3,K_d)=\widehat G_d$ for $d\le D$. Combining this descent theorem with an arithmetic-closure invariant for adaptive stabilizer processing yields $\mathrm{Fdepth}(U)=\mathrm{Adepth}(U)=\mathrm{Rdepth}(U)$: the smallest real cyclotomic field containing the Bloch matrix of an exactly synthesizable channel, the shallowest dyadic gate alphabet realizing it up to global phase, and the shallowest dyadic program-state layer sufficient for exact stabilizer-assisted implementation coincide. At that common minimum, known fixed-alphabet synthesis gives minimum primitive-rotation count. We package the result as an exact static resource effect and outline a certificate-producing compiler.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。