Cnrs Team Identifies Reductions Between Non-Local Computation Tasks for Complexity Analysis

Andreas Bluhm and colleagues at CNRS, in collaboration with Perimeter Institute for Theoretical Physics, University of Amsterdam, Sorbonne University, and Perimeter Institute, have investigated the fundamental relationships between different non-local quantum computation tasks, revealing insights into their relative complexity and security implications. Reductions demonstrate that seemingly distinct tasks share underlying connections, where solving one task enables efficient solutions to others. The research focuses on tasks relevant to quantum position-verification, specifically those with large classical inputs and small quantum inputs, and shows that protocols for simple quantum redirection can achieve the controlled application of complex unitaries. Consequently, numerous practical position-verification schemes exhibit similar entanglement costs and security levels,…