Is the closest product state to a symmetric entangled multiparticle state also symmetric? This question has appeared in the recent literature concerning the geometric measure of entanglement. First, we show that a positive answer can be derived from results concerning symmetric multilinear forms and homogeneous polynomials, implying that the closest product state can be chosen to be symmetric. We then prove the stronger result that the closest product state to any symmetric multiparticle quantum state is necessarily symmetric. Moreover, we discuss generalizations of our result and the case of translationally invariant states, which can occur in spin models.
We show that two different tensors defining the same translational invariant injective Projected Entangled Pair State (PEPS) in a square lattice must be the same up to a trivial gauge freedom. This allows us to characterize the existence of any local or spatial symmetry in the state. As an application of these results we prove that a SU(2) invariant PEPS with half-integer spin cannot be injective, which can be seen as a Lieb-Shultz-Mattis theorem in this context. We also give the natural generalization for U(1) symmetry in the spirit of Oshikawa-Yamanaka-Affleck, and show that a PEPS with Wilson loops cannot be injective.
11 May 2013 in Communications in Mathematical Physics
Feature selection is one of the most relevant processes in any methodology for creating a statistical learning model. Usually, existing algorithms establish some criterion to select the most influential variables, discarding those that do not contribute to the model with any relevant information. This methodology makes sense in a static situation where the joint distribution of the data does not vary over time. However, when dealing with real data, it is common to encounter the problem of the dataset shift and, specifically, changes in the relationships between variables (concept shift). In this case, the influence of a variable cannot be the only indicator of its quality as a regressor of the model, since the relationship learned in the training phase may not correspond to the current situation. In tackling this problem, our approach establishes a direct relationship between the Shapley values and prediction errors, operating at a more local level to effectively detect the individual biases introduced by each variable. The proposed methodology is evaluated through various examples, including synthetic scenarios mimicking sudden and incremental shift situations, as well as two real-world cases characterized by concept shifts. Additionally, we perform three analyses of standard situations to assess the algorithm’s robustness in the absence of shifts. The results demonstrate that our proposed algorithm significantly outperforms state-of-the-art feature selection methods in concept shift scenarios, while matching the performance of existing methodologies in static situations.
How much do local and time-periodic dynamics resemble a random unitary? In the present work, we address this question by using the Clifford formalism from quantum computation. We analyze a Floquet model with disorder, characterized by a family of local, time-periodic, and random quantum circuits in one spatial dimension. We observe that the evolution operator enjoys an extra symmetry at times that are a half-integer multiple of the period. With this, we prove that after the scrambling time, namely, when any initial perturbation has propagated throughout the system, the evolution operator cannot be distinguished from a (Haar) random unitary when all qubits are measured with Pauli operators. This indistinguishability decreases as time goes on, which is in high contrast to the more studied case of (time-dependent) random circuits. We also prove that the evolution of Pauli operators displays a form of mixing. These results require the dimension of the local subsystem to be large. In the opposite regime, our system displays a novel form of localization, produced by the appearance of effective one-sided walls, which prevent perturbations from crossing the wall in one direction but not the other.
Identification schemes are interactive cryptographic protocols typically involving two parties, a prover, who wants to provide evidence of their identity and a verifier, who checks the provided evidence and decides whether or not it comes from the intended prover. Given the growing interest in quantum computation, it is indeed desirable to have explicit designs for achieving user identification through quantum resources. In this paper, we comment on a recent proposal for quantum identity authentication from Zawadzki. We discuss the applicability of the theoretical impossibility results from Lo, Colbeck and Buhrman et al. and formally prove that the protocol must necessarily be insecure. Moreover, to better illustrate our insecurity claim, we present an attack on Zawadzki’s protocol and show that by using a simple strategy an adversary may indeed obtain relevant information on the shared identification secret. Specifically, through the use of the principal of conclusive exclusion on quantum measurements, our attack geometrically reduces the key space resulting in the claimed logarithmic security being reduced effectively by a factor of two after only three verification attempts.