We propose and analyze deterministic protocols to generate qudit photonic graph states from quantum emitters. We show that our approach can be applied to generate any qudit graph state and we exemplify it by constructing protocols to generate one- and two-dimensional qudit cluster states, absolutely maximally entangled states, and logical states of quantum error-correcting codes. Some of these protocols make use of time-delayed feedback, while others do not. The only additional resource requirement compared to the qubit case is the ability to control multilevel emitters. These results significantly broaden the range of multiphoton entangled states that can be produced deterministically from quantum emitters.
Generation of arbitrary all-photonic graph states from quantum emitters
We present protocols to generate arbitrary photonic graph states from quantum emitters that are in principle deterministic. We focus primarily on two-dimensional cluster states of arbitrary size due to their importance for measurement-based quantum computing. Our protocols for these and many other types of two-dimensional graph states require a linear array of emitters in which each emitter can be controllably pumped, rotated about certain axes, and entangled with its nearest neighbors. We show that an error on one emitter produces a localized region of errors in the resulting graph state, where the size of the region is determined by the coordination number of the graph. We describe how these protocols can be implemented for different types of emitters, including trapped ions, quantum dots, and nitrogen-vacancy centers in diamond.
more » « less- Award ID(s):
- 1741656
- PAR ID:
- 10308415
- Publisher / Repository:
- IOP Publishing
- Date Published:
- Journal Name:
- New Journal of Physics
- Volume:
- 21
- Issue:
- 5
- ISSN:
- 1367-2630
- Page Range / eLocation ID:
- Article No. 055002
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Published by the American Physical Society 2024 -
By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph states requires a formidable resource overhead using traditional approaches based on linear optics. Overcoming this challenge, a number of new schemes have been proposed that employ quantum emitters to deterministically generate photonic graph states. Although these schemes have the potential to significantly reduce the resource cost, a systematic comparison of the repeater performance among different encodings and different generation schemes is lacking. Here, we quantitatively analyze the performance of quantum repeaters based on two different graph states, i.e. the tree graph states and the repeater graph states. For both states, we compare the performance between two generation schemes, one based on a single quantum emitter coupled to ancillary matter qubits, and one based on a single quantum emitter coupled to a delayed feedback. We identify the numerically optimal scheme at different system parameters. Our analysis provides a clear guideline on the selection of the generation scheme for graph-state-based quantum repeaters, and lays out the parameter requirements for future experimental realizations of different schemes.more » « less
-
more » « less
We examine the dissipative dynamics of N00N states with an arbitrary photon number
in two architectures of fiber-coupled optical ring resonators (RRs) interacting with two-level quantum emitters (QEs). One architecture consists of a two-way cascaded array of emitter–cavity systems, while in the other architecture, we consider two fiber-coupled RRs, each coupled to multiple dipole–dipole interacting (DDI) QEs. Our focus in this paper is to study how an initially prepared multiple excitation atomic N00N state transfers to the RRs and then how rapidly it decays in these open cavity quantum electrodynamics setups while varying the emitter–cavity coupling strengths, emitter–cavity detuning, and backscattering from cavity modes. We present a general theoretical formalism valid for any arbitrary numbers of QEs, RRs, and numbers in the N00N state for both schemes. As examples, we discuss the cases of single- and two-excitation N00N states and report the comparison of our findings in both schemes. As one of the main results, we conclude that the array scheme tends to store N00N for longer times, while the DDI scheme supports higher fidelity values. The results of this study may find applications in designing new multiparty entanglement-based protocols in quantum metrology and quantum lithography. -
Quantum repeaters are nodes in a quantum communication network that allow reliable transmission of entanglement over large distances. It was recently shown that highly entangled photons in so-called graph states can be used for all-photonic quantum repeaters, which require substantially fewer resources compared to atomic-memory-based repeaters. However, standard approaches to building multiphoton entangled states through pairwise probabilistic entanglement generation severely limit the size of the state that can be created. Here, we present a protocol for the deterministic generation of large photonic repeater states using quantum emitters such as semiconductor quantum dots and defect centers in solids. We show that arbitrarily large repeater states can be generated using only one emitter coupled to a single qubit, potentially reducing the necessary number of photon sources by many orders of magnitude. Our protocol includes a built-in redundancy, which makes it resilient to photon loss.more » « less
-
Abstract Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.more » « less
