量子决策树中的量子优势：加权图与L1范数方法
Quantum Advantage in Decision Trees: A Weighted Graph and $L_1$ Norm Approach
AI总结：
本文提出利用加权图与L1范数方法分析单次查询量子决策树，以揭示量子优势的必要条件并实现指数级优势。
摘要：
单次查询量子算法的计算能力分析至关重要，因为它们必须从一次 oracle 调用中提取最大信息，揭示量子优势的根本限制，并实现最优、资源高效的量子计算。本文提出将单次查询量子决策树作为加权图进行建模。这种建模方法的优势在于它能够方便地分析算法输出的L1谱范数。这种优势基于一个事实：量子决策树输出的高L1谱范数是超越其经典对应物的必要条件。我们提出了最大化L1谱范数的启发式方法，展示了如何将加权图组合以生成具有严格递增范数的序列，并呈现表现出指数级量子优势的函数。最后，我们建立了将单次查询量子优势与测量投影维度的渐近增长联系起来的必要条件。
英文摘要：
The analysis of the computational power of single-query quantum algorithms is important because they must extract maximal information from one oracle call, revealing fundamental limits of quantum advantage and enabling optimal, resource-efficient quantum computation. This paper proposes a formulation of single-query quantum decision trees as weighted graphs. This formulation has the advantage that it facilitates the analysis of the $L_1$ spectral norm of the algorithm output. This advantage is based on the fact that a high $L_1$ spectral norm of the output of a quantum decision tree is a necessary condition to outperform its classical counterpart. We propose heuristics for maximizing the $L_{1}$ spectral norm, show how to combine weighted graphs to generate sequences with strictly increasing norm, and present functions exhibiting exponential quantum advantage. Finally, we establish a necessary condition linking single-query quantum advantage to the asymptotic growth of measurement projector dimensions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
