Abstract

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.

Highlights

  • The past years have seen rapid advances in controlling small groups of qubits encoded in atomic or atom-like quantum memories

  • We focus on nitrogen vacancy (NV) centers in diamond[14] and propose the control sequence to map the physical properties to cluster state quantum computation

  • The computational power of the cluster state corresponding to the graph is related to the size of the largest connected component (LCC)

Read more

Summary

Introduction

The past years have seen rapid advances in controlling small groups of qubits encoded in atomic or atom-like quantum memories. For a lattice with N nodes, the size of the LCC is OðlogðNÞÞ.[25] Single-qubit measurements on such a cluster state can be efficiently simulated on classical computers.

Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.