Searcharxiv⌕ Search

arXiv subjects

Wojciech Słomczyński

Publications and source records attributed to Wojciech Słomczyński.

16 recordsLinked to original sources

From minimal informationally complete measurements to orthocentric simplices and back again

The reconstruction of unknown quantum states via minimal informationally complete measurements (MICs) is a cornerstone of quantum tomography. Although the statistical properties of these measurements are well-understood, their geometric structure has remained elusive. In this work, we establish a correspondence between the class of minimal $s$-tight informationally complete measurements, encompassing, among others, tight IC and morphophoric measurements, and the classical geometry of orthocentric simplices. In particular, we prove a three-way equivalence: a MIC is $s$-tight if and only if its measurement vectors, upon suitable rescaling, form the vertices of an acute orthocentric simplex with the orthocentre at the origin, and such simplices are precisely the homothetically self-dual ones. This geometric manifestation of operational ''tightness'' provides a bridge between the physical world and Euclidean geometry. Furthermore, the $s$-tight class is fully characterised by its measurement directions: the angles between them must be obtuse and satisfy a cross-ratio condition. We determine the space of admissible direction configurations: modulo rotations, every such configuration is encoded by a single probability vector, the ''skeleton'' of the measurement, together with an orientation class, so that the moduli space of $s$-tight MIC directions is $Δ^{\circ}_{d+1}\times\{\pm 1\}$. Conversely, every acute orthocentric simplex with the orthocentre at the origin can be anchored in the state space, generating a class of minimal $s$-tight IC measurements that contains exactly one tight IC measurement up to overall rescaling.

quant-ph↗

Is Textual Similarity Invariant under Machine Translation? Evidence Based on the Political Manifesto Corpus

We investigate the extent to which cosine similarity between paragraph embeddings is invariant under machine translation, using the Manifesto Corpus of over 2,800 political party platforms in 28 languages translated to English via the EU eTranslation service. Rather than measuring translation-induced semantic shift directly we measure the stability of pairwise similarity relationships across embedding models, and use inter-model disagreement on original-language text as a calibrated invariance threshold. This yields a per-language non-inferiority test for four hypotheses about how translation interacts with embedding choice, with verdicts that distinguish languages where translation demonstrably preserves semantic structure from those where it demonstrably degrades it and from those where the available evidence does not resolve the question. The framework is corpus- and pipeline-agnostic and extends naturally to downstream tasks. Applied to our data, it identifies ten languages with translation invariance and four with detectable distortion.

cs.CL↗

Spoiler Susceptibility in Party Elections

An electoral spoiler is usually defined as a losing candidate whose removal would affect the outcome by changing the winner. So far, spoiler effects have been analyzed primarily for single-winner electoral systems. We consider this subject in the context of party elections, where there is no longer a sharp distinction between winners and losers. Hence, we propose a more general definition, under which a party is a spoiler if their elimination causes any other party's share in the outcome to decrease. We characterize spoiler-proof electoral allocation rules for zero-sum voting methods. In particular, we prove that for seats-votes functions only identity is spoiler-proof. However, even if spoilers are unavoidable under common electoral rules, their expected impact can vary depending on the rule. Hence, we introduce a measure of spoilership, which allows us to experimentally compare a number of multiwinner social choice rules according to their spoiler susceptibility. Since the probabilistic models used in COMSOC have been developed for nonparty elections, we extend them to generate multidistrict party elections.

cs.GT↗

Can QBism exist without Q? Morphophoric measurements in generalised probabilistic theories

In a Generalised Probabilistic Theory (GPT) equipped additionally with some extra geometric structure we define the morphophoric measurements as those for which the measurement map sending states to distributions of the measurement results is a similarity. In the quantum case, morphophoric measurements generalise the notion of a 2-design POVM, thus in particular that of a SIC-POVM. We show that the theory built on this class of measurements retains the chief features of the QBism approach to the basis of quantum mechanics. In particular, we demonstrate how to extend the primal equation ('Urgleichung') of QBism, designed for SIC-POVMs, to the morphophoric case of GPTs. In the latter setting, the equation takes a different, albeit more symmetric, form, but all the quantities that appear in it can be interpreted in probabilistic and operational terms, as in the original 'Urgleichung'.

quant-ph↗

Seat Allocation and Seat Bias under the Jefferson--D'Hondt Method

We prove that under the Jefferson--D'Hondt method of apportionment, given certain distributional assumptions regarding mean rounding residuals, as well as absence of correlations between party vote shares, district sizes (in votes), and multipliers, the seat share of each relevant party is an affine function of the aggregate vote share, the number of relevant parties, and the mean district magnitude. We further show that the first of those assumptions follows approximately from more general ones regarding smoothness, vanishing at the extremes, and total variation of the density of the distribution of vote shares. We also discuss how our main result differs from the simple generalization of the single-district asymptotic seat bias formulae, and how it can be used to derive an estimate of the natural threshold and certain properties thereof.

physics.soc-ph↗

Machine Learning and Statistical Approaches to Measuring Similarity of Political Parties

Mapping political party systems to metric policy spaces is one of the major methodological problems in political science. At present, in most political science project this task is performed by domain experts relying on purely qualitative assessments, with all the attendant problems of subjectivity and labor intensiveness. We consider how advances in natural language processing, including large transformer-based language models, can be applied to solve that issue. We apply a number of texts similarity measures to party political programs, analyze how they correlate with each other, and -- in the absence of a satisfactory benchmark -- evaluate them against other measures, including those based on expert surveys, voting records, electoral patterns, and candidate networks. Finally, we consider the prospects of relying on those methods to correct, supplement, and eventually replace expert judgments.

cs.CL↗

Nonparametric Detection of Gerrymandering in Multiparty Elections

Partisan gerrymandering, i.e., manipulation of electoral district boundaries for political advantage, is one of the major challenges to election integrity in modern day democracies. Yet most of the existing methods for detecting partisan gerrymandering are narrowly tailored toward fully contested two-party elections, and fail if there are more parties or if the number of candidates per district varies (as is the case in many plurality-based electoral systems outside the United States). We propose two methods, based on nonparametric statistical learning, that are able to deal with such cases. The use of multiple methods makes the proposed solution robust against violation of their respective assumptions. We then test the proposed methods against real-life data from national and subnational elections in 17 countries employing the FPTP system.

stat.AP↗

Orthogonal Projections on Hyperplanes Intertwined With Unitaries

Fix a point in a finite-dimensional complex vector space and consider the sequence of iterates of this point under the composition of a unitary map with the orthogonal projection on the hyperplane orthogonal to the starting point. We prove that, generically, the series of the squared norms of these iterates sums to the dimension of the underlying space. This leads us to construct a (device-dependent) dimension witness for quantum systems which involves the probabilities of obtaining certain strings of outcomes in a sequential yes-no measurement. The exact formula for this series in non-generic cases is provided as well as its analogue in the real case.

quant-ph↗

Morphophoric POVMs, generalised qplexes, and 2-designs

We study the class of quantum measurements with the property that the image of the set of quantum states under the measurement map transforming states into probability distributions is similar to this set and call such measurements morphophoric. This leads to the generalisation of the notion of a qplex, where SIC-POVMs are replaced by the elements of the much larger class of morphophoric POVMs, containing in particular 2-design (rank-1 and equal-trace) POVMs. The intrinsic geometry of a generalised qplex is the same as that of the set of quantum states, so we explore its external geometry, investigating, inter alia, the algebraic and geometric form of the inner (basis) and the outer (primal) polytopes between which the generalised qplex is sandwiched. In particular, we examine generalised qplexes generated by MUB-like 2-design POVMs utilising their graph-theoretical properties. Moreover, we show how to extend the primal equation of QBism designed for SIC-POVMs to the morphophoric case.

quant-ph↗

Average Weights and Power in Weighted Voting Games

We investigate a class of weighted voting games for which weights are randomly distributed over the standard probability simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th largest player under the uniform distribution. We analyze the average voting power of the $k$-th largest player and its dependence on the quota, obtaining analytical and numerical results for small values of $n$ and a general theorem about the functional form of the relation between the average Penrose--Banzhaf power index and the quota for the uniform measure on the simplex. We also analyze the power of a collectivity to act (Coleman efficiency index) of random weighted voting games, obtaining analytical upper bounds therefor.

cs.GT↗

A Formal Model of the Relationship between the Number of Parties and the District Magnitude

On the basis of a formula for calculating seat shares and natural thresholds in multidistrict elections under the Jefferson-D'Hondt system and a probabilistic model of electoral behavior based on Pólya's urn model, we propose a new model of the relationship between the district magnitude and the number / effective number of relevant parties. We test that model on both electoral results from multiple countries employing the D'Hondt method (relatively small number of elections, but wide diversity of political configurations) and data based on hundreds of Polish local elections (large number of elections, but much higher degree of parameter uniformity). We also explore some applications of the proposed model, demonstrating how it can be used to estimate the potential effects of electoral engineering.

physics.soc-ph↗

Double Majority and Generalized Brexit: Explaining Counterintuitive Results

A mathematical analysis of the distribution of voting power in the Council of the European Union operating according to the Treaty of Lisbon is presented. We study the effects of Brexit on the voting power of the remaining members, measured by the Penrose--Banzhaf Index. We note that the effects in question are non-monotonic with respect to voting weights, and that some member states will lose power after Brexit. We use the normal approximation of the Penrose--Banzhaf Index in double-majority games to show that such non-monotonicity is in most cases inherent in the double-majority system, but is strongly exacerbated by the peculiarities of the EU population vector. Furthermore, we investigate consequences of a hypothetical "generalized Brexit", i.e., NN-exit of another member state (from a 28-member Union), noting that the effects on voting power are non-monotonic in most cases, but strongly depend on the size of the country leaving the Union.

physics.soc-ph↗

Quantum dynamical entropy, chaotic unitaries and complex Hadamard matrices

We introduce two information-theoretical invariants for the projective unitary group acting on a finite-dimensional complex Hilbert space: PVM- and POVM-dynamical (quantum) entropies. They quantify the randomness of the successive quantum measurement results in the case where the evolution of the system between each two consecutive measurements is described by a given unitary operator. We study the class of chaotic unitaries, i.e., the ones of maximal entropy or, equivalently, such that they can be represented by suitably rescaled complex Hadamard matrices in some orthonormal bases. We provide necessary conditions for a unitary operator to be chaotic, which become also sufficient for qubits and qutrits. These conditions are expressed in terms of the relation between the trace and the determinant of the operator. We also compute the volume of the set of chaotic unitaries in dimensions two and three, and the average PVM-dynamical entropy over the unitary group in dimension two. We prove that this mean value behaves as the logarithm of the dimension of the Hilbert space, which implies that the probability that the dynamical entropy of a unitary is almost as large as possible approaches unity as the dimension tends to infinity.

quant-ph↗

Informational power of the Hoggar SIC-POVM

We compute the informational power for the Hoggar SIC-POVM in dimension 8, i.e. the classical capacity of a quantum-classical channel generated by this measurement. We show that the states constituting a maximally informative ensemble form a twin Hoggar SIC-POVM being the image of the original one under a conjugation.

quant-ph↗

Highly symmetric POVMs and their informational power

We discuss the dependence of the Shannon entropy of normalized finite rank-1 POVMs on the choice of the input state, looking for the states that minimize this quantity. To distinguish the class of measurements where the problem can be solved analytically, we introduce the notion of highly symmetric POVMs and classify them in dimension two (for qubits). In this case we prove that the entropy is minimal, and hence the relative entropy (informational power) is maximal, if and only if the input state is orthogonal to one of the states constituting a POVM. The method used in the proof, employing the Michel theory of critical points for group action, the Hermite interpolation and the structure of invariant polynomials for unitary-antiunitary groups, can also be applied in higher dimensions and for other entropy-like functions. The links between entropy minimization and entropic uncertainty relations, the Wehrl entropy and the quantum dynamical entropy are described.

quant-ph↗

Relative and Discrete Utility Maximising Entropy

The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability spaces is defined. Then, specialising to discrete probability spaces, we also introduce the absolute u-entropy of a probability measure. Both notions are based on the idea, borrowed from mathematical finance, of maximising the expected utility of the terminal wealth of an investor. Moreover, u-entropy is also relevant in thermodynamics, as it can replace the standard Boltzmann-Shannon entropy in the Second Law. If the utility function is logarithmic or isoelastic (a power function), then the well-known notions of the Boltzmann-Shannon and Renyi relative entropy are recovered. We establish the principal properties of relative and discrete u-entropy and discuss the links with several related approaches in the literature.

math.PR↗