Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more

Bell sampling is a simple yet powerful tool based on measuring two copies of a quantum state in the Bell basis, and has found applications in a plethora of problems related to stabiliser states and measures of magic. However, it was not known how to generalise the procedure from qubits to d-level systems -- qudits -- for all dimensions d > 2 in a useful way. Indeed, a prior work of the authors (arXiv'24) showed that the natural extension of Bell sampling to arbitrary dimensions fails to provide meaningful information about the quantum states being measured. In this paper, we overcome the difficulties encountered in previous works and develop a useful generalisation of Bell sampling to qudits of all d≥ 2. At the heart of our primitive is a new unitary, based on Lagrange's four-square theorem, that maps four copies of any stabiliser state |Srangle to four copies of its complex conjugate |S^astrangle (up to some Pauli operator), which may be of independent interest. We then demonstrate the utility of our new Bell sampling technique by lifting several known results from qubits to qudits for any d≥ 2: 1. Learning stabiliser states in O(n3) time with O(n) samples; 2. Solving the Hidden Stabiliser Group Problem in tildeO(n3/varepsilon) time with tildeO(n/varepsilon) samples; 3. Testing whether |psirangle has stabiliser size at least dt or is varepsilon-far from all such states in tildeO(n3/varepsilon) time with tildeO(n/varepsilon) samples; 4. Clifford circuits with at most n/2 single-qudit non-Clifford gates cannot prepare pseudorandom states; 5. Testing whether |psirangle has stabiliser fidelity at least 1-varepsilon1 or at most 1-varepsilon2 with O(d2varepsilon2/(varepsilon2-varepsilon1)2) samples if varepsilon1 = O(varepsilon2/d2).