2026/07/31 by Jayashree Karmakar, Biswadeep Chatterjee, Rafiuddin Gazi +6
Physics and Astronomy · #quant-ph
10 pages, 2 figures
arxiv created 2026/07/31 · arxiv updated 2026/08/03
We investigate the task of identifying the parity (odd vs even) of an unknown permutation applied to n particles. Classically, using fewer than n distinct labels per particle limits the success probability to random guessing, whereas quantum mechanics, exploiting entanglement in both preparation and measurement, accomplishes the task perfectly with as few as \lceil √(n)\rceil levels per particle [\hrefhttps://doi.org/10.1103/yhyv-xnwqPRL \bf 135, 260603 (2025)]. We show that even without entangled preparation, quantum theory still offers a probabilistic advantage over classical strategies. Moreover, such product preparations yield perfect success in locally quantum theories, where elementary systems are quantum but their composition follows the minimal tensor product structure of generalized probabilistic theories (GPTs). We further identify GPT models that accomplish the task with certainty without requiring entanglement either at the preparation stage or at the measurement stage. Our central result establishes that the linear dimension of the elementary systems, rather than entanglement, is the fundamental resource governing the existence of probabilistic advantage in the permutation parity problem. In particular, below the required dimension threshold, no amount of entanglement can improve upon the random-guessing limit.