The sum-of-squares (SOS) decomposition of Bell operators is a crucial tool for analyzing quantum correlations and verifying nonclassical behaviors. Building upon Gell-Mann’s generalization of Pauli matrices, we derive explicit forms for SOS decompositions of general Bell operators. We establish the minimal subsystem dimension required to represent Bell operators in specific tensor product spaces and obtain concrete decomposition expressions. Furthermore, we construct corresponding quantum states and measurement settings that exhibit quantum violations of classical bounds, with our approach extending naturally to isotropic states.
The complete learning of an $n$-qubit quantum state requires samples exponentially in $n$. Several works consider subclasses of quantum states that can be learned in polynomial sample complexity such as stabilizer states or high-temperature Gibbs states. Other works consider a weaker sense of learning, such as PAC learning and shadow tomography. In this work, we consider learning states that are close to neural network quantum states, which can efficiently be represented by a graphical model called restricted Boltzmann machines (RBMs). To this end, we exhibit robustness results for efficient provable two-hop neighborhood learning algorithms for ferromagnetic and locally consistent RBMs. We consider the $L_p$-norm as a measure of closeness, including both total variation distance and max-norm distance in the limit. Our results allow certain quantum states to be learned with a sample complexity \textit{exponentially} better than naive tomography. We hence provide new classes of efficiently learnable quantum states and apply new strategies to learn them.
Restricted Boltzmann Machines (RBMs) are widely used probabilistic undirected graphical models with visible and latent nodes, playing an important role in statistics and machine learning. The task of structure learning for RBMs involves inferring the underlying graph by using samples from the visible nodes. Specifically, learning the two-hop neighbors of each visible node allows for the inference of the graph structure. Prior research has addressed the structure learning problem for specific classes of RBMs, namely ferromagnetic and locally consistent RBMs. In this paper, we extend the scope to the quantum computing domain and propose corresponding quantum algorithms for this problem. Our study demonstrates that the proposed quantum algorithms yield a polynomial speedup compared to the classical algorithms for learning the structure of these two classes of RBMs.
We demonstrate a complete and experimentally validated self-testing protocol for two-qubit partially entangled states, which avoids the need for full tomographic reconstruction. Using a room-temperature type-II PPKTP polarization-entangled source and a free-space optical setup, we implement both quantum state tomography and optimal generalized Bell measurements within a single system. Our approach achieves high-fidelity self-testing of non-maximally entangled states under black-box assumptions, establishing a solid foundation for device-independent quantum information processing applications.
This work presents an extension of the Svetlichny inequality to star-topology quantum networks, enabling the verification of network nonlocality in distributed architectures. The proposed framework uses joint measurements at a central node to certify the entanglement properties between peripheral nodes after their local measurement collapse. We further generalize this methodology to composite quantum networks, constructed from multiple EPR pairs and featuring hybrid star-chain structures, thereby demonstrating its applicability to complex entanglement configurations.