Entanglement constrained by superselection rules
Stephen D. Bartlett, H. M. Wiseman
Abstract
Bipartite entanglement may be reduced if there are restrictions on allowed local operations. We introduce the concept of a generalized superselection rule (SSR) to describe such restrictions, and quantify the entanglement constrained by it. We show that ensemble quantum information processing, where elements in the ensemble are not individually addressable, is subject to the SSR associated with the symmetric group (the group of permutations of elements). We prove that even for an ensemble comprising many pairs of qubits, each pair described by a pure Bell state, the entanglement per element constrained by this SSR goes to zero for a large number of elements.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado