Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Percolation based architecture for cluster state quantum computation using photon-mediated entanglement between atomic memories

Mihir Pant, Hyeongrak Choi, Saikat Guha, Dirk Englund

Published Apr 24, 2017• 1 citation
OpenAlex

Related papers

Percolation-based architecture for cluster state creation using photon-mediated entanglement between atomic memories

Hyeongrak Choi, Mihir Pant, Saikat Guha +1 more

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.

arXiv:1704.07292•npj Quantum Information•Nov 22, 2019•63 citations

Resource-efficient photonic quantum computation with high-dimensional cluster states

Ohad Lib, Yaron Bromberg

arXiv:2309.10464•Nature Photonics•Sep 16, 2024•37 citations

Cluster State-based Quantum Computing

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2021•4 citations

Percolation Based Cluster State Generation by Photon-Mediated Entanglement

Mihir Pant, Hyeongrak Choi, Saikat Guha +1 more

We present an architecture for creating large entangled cluster states for quantum computing and simulation with nitrogen vacancy centers in diamond within the experimentally demonstrated coherence time using percolation theory.

Conference on Lasers and Electro-Optics•Jan 1, 2018•3 citations

Cluster-state quantum computation

Michael A. Nielsen

arXiv:quant-ph/0504097•Reports on Mathematical Physics•Feb 1, 2006•404 citations

Loss-tolerant architecture for quantum computing with quantum emitters

Matthias C. Löbl, Stefano Paesani, Anders Søndberg Sørensen

We develop an architecture for measurement-based quantum computing using photonic quantum emitters. The architecture exploits spin-photon entanglement as resource states and standard Bell measurements of photons for fusing them into a large spin-qubit cluster state. The scheme is tailored to emitters with limited memory capabilities since it only uses an initial non-adaptive (ballistic) fusion process to construct a fully percolated graph state of multiple emitters. By exploring various geometrical constructions for fusing entangled photons from deterministic emitters, we improve the photon loss tolerance significantly compared to similar all-photonic schemes.

arXiv:2304.03796•Quantum•Mar 28, 2024•11 citations
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.
We develop an architecture for measurement-based quantum computing using photonic quantum emitters. The architecture exploits spin-photon entanglement as resource states and standard Bell measurements of photons for fusing them into a large spin-qubit cluster state. The scheme is tailored to emitters with limited memory capabilities since it only uses an initial non-adaptive (ballistic) fusion process to construct a fully percolated graph state of multiple emitters. By exploring various geometrical constructions for fusing entangled photons from deterministic emitters, we improve the photon loss tolerance significantly compared to similar all-photonic schemes.