量子分支程序与空间有界非均匀量子复杂性
Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity
摘要：
本文研究了非均匀量子计算的空间复杂性。为此选择的模型是量子分支程序，它提供了顺序量子算法的图形描述。在本文的第一部分中，量子分支程序和非均匀量子图灵机之间的模拟，允许转移两个模型之间的下限和上限的结果。在论文的第二部分，不同的变种量子OBDDs进行了比较，其确定性和随机的同行。在第三部分中，考虑量子分支程序，其中执行的幺正操作可能取决于先前测量的结果。对于这个模型的随机OBDD和指数下界的模拟。
英文摘要：
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic description of sequential quantum algorithms. In the first part of the paper, simulations between quantum branching programs and nonuniform quantum Turing machines are presented which allow to transfer lower and upper bound results between the two models. In the second part of the paper, different variants of quantum OBDDs are compared with their deterministic and randomized counterparts. In the third part, quantum branching programs are considered where the performed unitary operation may depend on the result of a previous measurement. For this model a simulation of randomized OBDDs and exponential lower bounds are presented.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
