协调计算的精确高效模拟
Exact and Efficient Simulation of Concordant Computation
摘要：
和谐计算是一种基于电路的混合态量子计算模型，它假设寄存器中的所有相关性在计算的每一步都是无和谐的（即相关性本质上是经典的）。B首先考虑了一致计算是否总是允许经典计算机进行有效模拟的问题。Eastin在quant-ph/1006.4402v1中，其中对于仅由一个和两个量子比特门组成的电路给出了肯定的答案。在此基础上，我们发展了和谐计算的经典模拟理论。我们提出了一个新的框架来理解这样的计算，认为一个更大的类的和谐的计算承认有效的模拟，并提供替代证明的主要结果quant-ph/1006.4402v1的模拟的准确性，这是至关重要的，这个模型的重点。我们包括详细分析的算法复杂性求解方程的模拟，以及扩展到更大的门和qudits。我们探讨了我们的方法的局限性，并讨论了所面临的挑战，在开发高效的经典模拟算法的所有一致的计算。
英文摘要：
Concordant computation is a circuit-based model of quantum computation for mixed states, that assumes that all correlations within the register are discord-free (i.e. the correlations are essentially classical) at every step of the computation. The question of whether concordant computation always admits efficient simulation by a classical computer was first considered by B. Eastin in quant-ph/1006.4402v1, where an answer in the affirmative was given for circuits consisting only of one- and two-qubit gates. Building on this work, we develop the theory of classical simulation of concordant computation. We present a new framework for understanding such computations, argue that a larger class of concordant computations admit efficient simulation, and provide alternative proofs for the main results of quant-ph/1006.4402v1 with an emphasis on the exactness of simulation which is crucial for this model. We include detailed analysis of the arithmetic complexity for solving equations in the simulation, as well as extensions to larger gates and qudits. We explore the limitations of our approach, and discuss the challenges faced in developing efficient classical simulation algorithms for all concordant computations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
