Robustness of Bell Violation of Graph States to Qubit Loss

Abstract

Graph states are special entangled states advantageous for many quantum technologies, including quantum error correction, multiparty quantum communication and measurement-based quantum computation. Yet, their fidelity is often disrupted by various errors, most notably qubit loss. In general, given an entangled state, Bell inequalities can be used to certify whether quantum entanglement remains despite errors. Here we study the robustness of graph states to loss in terms of their Bell violation. Treating the recently proposed linearly scalable Bell operators by Baccari $\text{et al.}$, we use the stabilizer formalism to derive a formula for the extent by which the Bell violation of a given graph state is decreased with qubit loss. Our analysis allows to determine which graph topologies are tolerable to qubit loss as well as pinpointing the Achilles' heel of each graph, namely the sets of qubits whose loss jeopardizes the Bell violation. These results can serve as an analytical tool for optimizing experiments and protocols involving graph states in real-life systems.

References in corpus (35)

• Bell nonlocality
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Scalable photonic quantum computation through cavity-assisted interaction
• Measurement device independent quantum key distribution over 404 km optical fibre
• Stabilizer Codes and Quantum Error Correction
• Experimental entanglement of six photons in graph states
• All photonic quantum repeaters
• Quantum error-correcting codes associated with graphs
• A Quantum Gate between a Flying Optical Photon and a Single Trapped Atom
• Sending-or-Not-Sending with Independent Lasers: Secure Twin-Field Quantum Key Distribution Over 509 km
• A photonic cluster state machine gun
• Bell Inequalities for Graph States
• Nonlocality of cluster states of qubits
• Experimental demonstration of graph-state quantum secret sharing
• Thresholds for topological codes in the presence of loss
• Sequential generation of linear cluster states from a single photon emitter
• Experimental demonstration of a graph state quantum error-correction code
• Programmable four-photon graph states on a silicon chip
• Quantum Error Correcting Codes Using Qudit Graph States
• Entanglement in a 20-Qubit Superconducting Quantum Computer
• Self-testing multipartite entangled states through projections onto two systems
• Error Correction and Degeneracy in Surface Codes Suffering Loss
• Scalable Bell inequalities for qubit graph states and robust self-testing
• Experimental Construction of Optical Multi-qubit Cluster States From Bell States
• Two-setting Bell Inequalities for Graph States
• Photonic resource state generation from a minimal number of quantum emitters
• Graph State Preparation and Cluster Computation with Global Addressing of Optical Lattices
• Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics
• Persistency of entanglement and nonlocality in multipartite quantum systems
• Topological graph states and quantum error correction codes
• Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality
• Generation of optical Fock and W states with single-atom-based bright quantum scissors
• Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing
• Boosting photonic quantum computation with moderate nonlinearity