Optimization of deterministic photonic graph state generation via local operations
arXiv:2401.00635 · doi:10.1103/PhysRevA.110.052605
Abstract
Realizing photonic graph states, crucial in various quantum protocols, is challenging due to the absence of deterministic entangling gates in linear optics. To address this, emitter qubits have been leveraged to establish and transfer the entanglement to photons. We introduce an optimization method for such protocols based on the local Clifford equivalency of states and the graph theoretical correlations of the generation cost parameters. Employing this method, we achieve a 50% reduction in use of the 2-qubit gates for generation of the arbitrary large repeater graph states and similar significant reductions in the total gate count for generation of random dense graphs.
12 pages, 15 figures
References in corpus (30)
- Persistent entanglement in arrays of interacting particles
- Improved Simulation of Stabilizer Circuits
- Measurement-based quantum computation
- Multi-party entanglement in graph states
- Resource-efficient linear optical quantum computation
- Stabilizer Codes and Quantum Error Correction
- All photonic quantum repeaters
- Deterministic Generation of a Cluster State of Entangled Photons
- Sequential generation of entangled multi-qubit states
- A photonic cluster state machine gun
- Graphical description of the action of local Clifford transformations on graph states
- Optically generated 2-dimensional photonic cluster state from coupled quantum dots
- Rate-distance tradeoff and resource costs for all-optical quantum repeaters
- Measurement-based quantum repeaters
- Deterministic generation of all-photonic quantum repeaters from solid-state emitters
- Universal and optimal error thresholds for measurement-based entanglement purification
- Deterministic generation of large-scale entangled photonic cluster state from interacting solid state emitters
- An efficient algorithm to recognize local Clifford equivalence of graph states
- Sequential generation of multiphoton entanglement with a Rydberg superatom
- Measurement-based Quantum Communication
- Resource requirements for efficient quantum communication using all-photonic graph states generated from a few matter qubits
- Optimal preparation of graph states
- Generation of arbitrary all-photonic graph states from quantum emitters
- Photonic resource state generation from a minimal number of quantum emitters
- Mapping graph state orbits under local complementation
- Photonic graph state generation from quantum dots and color centers for quantum communications
- Hard limits on the postselectability of optical graph states
- Graph-theoretical optimization of fusion-based graph state generation
- Counting single-qubit Clifford equivalent graph states is #P-Complete
- GraphiQ: Quantum circuit design for photonic graph states
Cited by in corpus (5)
- Architecture and protocols for all-photonic quantum repeaters
- Generating graph states with a single quantum emitter and the minimum number of fusions
- Resource-efficient loss-aware photonic graph state preparation using atomic emitters
- Minimising the number of edges in LC-equivalent graph states
- Integrating Entanglement Purification into All-Photonic Quantum Repeaters