论文标题
量子寄存器中正常分布的有效制备
The Efficient Preparation of Normal Distributions in Quantum Registers
论文作者
论文摘要
输入分布的有效制备是在广泛域中获得量子优势的重要问题。我们提出了一种新型的量子算法，用于有效制备量子寄存器中的任意正常分布。据我们所知，我们的工作是第一个利用中路测量和再利用（MCMR）的力量的工作，这种方式广泛适用于一系列国家准备问题。具体而言，我们的算法采用重复启用成功方案，并且只需要在预期中持续数量的重复数。在提出的实验中，MCMR的使用最多可减少所需量子位的862.6倍。此外，该算法可证明对相移和位叉误差具有抵抗力，从而导致对实际量子硬件，MCMR启用的Honeywell System Models H0和H1-2的首次实现经验演示。
The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the experiments presented, the use of MCMR enables up to a 862.6x reduction in required qubits. Furthermore, the algorithm is provably resistant to both phase-flip and bit-flip errors, leading to a first-of-its-kind empirical demonstration on real quantum hardware, the MCMR-enabled Honeywell System Models H0 and H1-2.
