A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid generation of arbitrarily large graph states by heralding the entanglement in a lattice of atomic memories with single-photon detection. This approach greatly reduces the time required to produce large cluster states for quantum information processing including universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated coupling, collection, detection efficiencies, and coherence time are sufficient. The approach also dispenses the need for time-consuming feed-forward, high cooperativity interfaces and ancilla single photons, and can tolerate a high rate of site imperfections. We derive the minimum coherence time to scalably create large cluster states, as a function of photon-collection efficiency. We also propose a variant of the architecture with long-range connections, which is even more resilient to site yields. We analyze our architecture for nitrogen vacancy (NV) centers in diamond, but the approach applies to any atomic or atom-like systems.

许多量子技术面临的主要挑战是如何产生可单独寻址的量子存储器的大纠缠态。在这里，我们证明了渗滤理论通过用单光子检测来预示原子存储器晶格中的纠缠，从而可以快速生成任意大的图状态。这种方法极大地减少了产生包括通用单向量子计算在内的量子信息处理所需的大簇状态所需的时间。这种减少使我们的体系结构处于一种运行状态，在该运行状态下，已证明的耦合，收集，检测效率和相干时间就足够了。该方法还免除了耗时的前馈，高协同界面和辅助单光子的需求，并且可以忍受很高的位置缺陷率。我们根据光子收集效率得出最小相干时间以可缩放地创建大的簇状态。我们还提出了一种具有远程连接的体系结构变体，它对站点产量更具弹性。我们分析了钻石中氮空位（NV）中心的体系结构，但是该方法适用于任何原子或类原子系统。