Fully tolerant product state testing and closest product state learning
The authors developed a time-efficient algorithm to determine if an unknown n-qudit state is close to or far from any product state. They achieved this with an n-independent number of copies, offering better sample and computational complexity than prior methods. This allows for fully tolerant testing and agnostic learning of product states.