Subadditivity of logarithm of violation of geometric Bell inequalities for qudits
Marcin Wie\'sniak, Palash Pandya

TL;DR
This paper extends geometrical Bell inequalities to systems of arbitrary dimension and number of observers, showing exponential growth of violations with system size and revealing a subadditivity property in the violation ratios.
Contribution
It formulates GBIs for multi-qudit systems and analyzes their violations, revealing subadditivity and growth patterns across different dimensions.
Findings
Violations grow exponentially with the number of observers.
Violation also increases with the dimension of the particles.
Logarithm of violation ratios exhibits subadditivity behavior.
Abstract
Geometrical Bell Inequalities (GBIs) are the strongest known Bell inequalities for collections of qubits. However, their generalizations to other systems is not yet fully understood. We formulate GBIs for an arbitrary number of observers, each of which possesses a particle of an arbitrary dimension . The whole -parameter family of local observables with eigenbases unbiased to the computational basis is used, but it is immediate to use a discrete subset of them. We argue analytically for qutrits and numerically for other systems that the violations grows exponenetially with . Within the studied range, the violation also grows with . Interestingly, we observe that the logarithm of the violation ratio for ququats grows with slower than the doubled logarithm of the violation ratio for qubits, which implies a kind of subadditivity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
