Browse

Quantum Physics

quant-ph — Quantum Physics

quant-ph RSS feed

Works in quant-ph

34 works

math.CA — Classical Analysis and ODEs

Even Asymptotic Expansions and Uniform Hard-Edge Approximations for Wigner 3j3j and 6j6j Symbols at Fixed Rank

Contributed by Antony Lewis

We study Wigner 3j3j symbols with two large and one small angular momentum, and the 6j6j symbols with one small entry (Edmonds' limit), both at fixed rank: the small labels stay fixed while the large ones grow. Their classical limits are Wigner rotation matrix elements. Combining a Regge symmetry with the Weyl shift j↦j+12j\mapsto j+\tfrac12 singles out midpoint variables: for 3j3j, the large scale N=j−+j++1N=j_-+j_++1 (j∓j_\mp the two large angular momenta) and x=2μ/Nx=2\mu/N (2μ2\mu the difference of the two large magnetic indices), and, for 6j6j, large lengths A,B,CA,B,C shifted by offsets that depend on the small labels. Among constant shifts of the large labels and magnetic coordinate, and up to rank-independent gauge factors, these are the only centerings that remove the generic first-order term of the exact recurrences. In these variables the normalized symbols are values of analytic functions of the inverse square of the large scale, for integer and half-integer small labels alike (including spin–orbit coefficients): the expansions contain only even powers and converge. The first correction is a closed formula in one Wigner dd function and its derivative, improving the error from second to fourth order in the inverse large scale; all higher corrections are constructed as local differential operators. The exact finite problems are Hahn and Racah spectral systems with undeformed Wigner spectra. Near the ends of the physical lattice (the hard edges), an explicit product of Pochhammer factors carries the difference between the discrete and continuum weights; extracting it gives expansions that are uniform on the whole lattice, including the 6j6j corner where two large lengths nearly coincide (A≈BA\approx B). We also show that centered Hahn and Racah polynomials are even deformations of Jacobi polynomials.

Author comments: 55 pages, 1 figure.

Primarily AI-generated textHuman understanding: no partsHahn polynomialsRacah polynomialsRegge symmetryWigner 3j symbolsWigner 6j symbols
Nov 16, 202655 pages
PDFView work

math.PR — Probability

Towards a conformal field theory of critical percolation. I. The bulk stress tensor and Ward identities.

Contributed by Alberto Gandolfi

We construct joint correlations of the bulk holomorphic stress tensor and the density field for critical site percolation on the triangular lattice, allowing any fixed finite numbers of insertions at separated points in the plane. Density correlations encode open-cluster connections; their two-point function is the renormalized probability that an open path joins two marked sites. Each stress insertion probes the directional response of these connections by closing and rotating a small ellipse and extracting the second angular component. To justify this construction, we extend Camia’s existence and conformal covariance results for density correlations from simply connected domains to the domains with finitely many analytic holes created by the ellipses, and prove uniform bounds for combining these correlations with the local ellipse responses. The main estimate controls the complete frontier record: the second angular coefficient has a comparable-scale defect of order (r/d)^(9/4), giving a Cauchy exponent 1/4 after quadratic normalization. The limits require no radius averaging, are distributions in the density coordinates, and are independent of the fixed ellipse shape parameters. They satisfy the conformal Ward identities with central charge zero and yield sequential stress-collision and contour identities.

A mix of human-written and AI-generated textHuman understanding: some parts
Nov 15, 2026105 pages
PDFView work

quant-ph — Quantum Physics

Equality cases and every-copy results for the Werner endpoint inequality

Contributed by Tejasvi Singh Tomar

Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is open. For the Werner states ρ(d,α)\rho(d,\alpha), a criterion of Costa Rico reduces kk-copy undistillability to an inequality for matrices of rank at most two: an alternating sum of the squared norms of their partial traces must be nonnegative. At α=−1/2\alpha=-1/2 we call it the endpoint inequality. It is known for two and three copies, and if it held for every kk in some dimension d≥3d\ge3, NPT bound entanglement would exist. For two copies we show that every equality case has rank two, with its range and that of its adjoint in products of two-dimensional subspaces. We also show that a first failure would produce, at some α>−1/2\alpha>-1/2, an equality case whose range has reduced states of rank at least three on every copy, unlike all known equality cases at α=−1/2\alpha=-1/2. For every kk we prove the endpoint inequality on an explicit class of matrices whose ranges generically have such reduced states. For four copies we give a computer-assisted proof of it in every dimension for all matrices CC such that the ranges of CC and of its adjoint lie in one two-dimensional subspace, as they do for all normal matrices of rank two.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23992370

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202626 pages
PDFView work

quant-ph — Quantum Physics

Undistillability of Werner states from three, four and five copies

Contributed by Tejasvi Singh Tomar

Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is a long-standing open problem of entanglement theory. It reduces to the Werner states ρ(d,α)\rho(d,\alpha), which for d≥3d\ge3 and −1/2≤α<−1/d-1/2\le\alpha<-1/d are NPT but cannot be distilled from one copy; if one of them stays undistillable from every number of copies, NPT bound entanglement exists. We prove that for every d≥3d\ge3 the state ρ(d,α)\rho(d,\alpha) is three-copy distillable if and only if α<−1/2\alpha<-1/2, the threshold known for one and two copies, so a third copy does not help. In every dimension we also prove four-copy undistillability for α≥−79/160\alpha\ge-79/160 and five-copy undistillability for α≥−9/20\alpha\ge-9/20, and improved bounds of order 1/k1/k for k≥6k\ge6 copies. The proofs use a criterion of Costa Rico and computer-verified certificates for quartic moment relaxations that hold for all large dimensions at once; for many copies they combine the resulting inequalities with known partial-trace inequalities. Whether −1/2-1/2 remains the threshold from four copies on is open.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23992387

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 15, 202615 pages
PDFView work

math.RT — Representation Theory

A law of large numbers for infinitesimal characters of real reductive Lie algebras

Contributed by Andrew Salmon

We prove a law of large numbers for the infinitesimal characters of real reductive Lie algebras. Let π\pi be a unitary representation of a connected Lie group with reductive Lie algebra. For product states on the tensor powers of π\pi whose sites have uniformly bounded moments, for instance identical sites, the infinitesimal character divided by the number of sites concentrates at the spectrum of the limiting mean moment, with probabilities of deviation O(n−m)O(n^{-m}) for every mm. The generators may be unbounded and the group non-compact. For compact groups this recovers the laws of large numbers of Keyl and Werner and of Botero, Christandl and Vrana, which enter the asymptotic analysis of linear programming bounds for binary codes; spherical designs require the non-compact case. We give concrete examples arising from Howe dual pairs on bosonic Fock space.

Author comments: Comments welcome

Primarily AI-generated textHuman understanding: all parts
Nov 13, 202616 pages
PDFView work

quant-ph — Quantum Physics

On the minimal dimension of range-criterion counterexamples to the PPT² conjecture

Contributed by Tejasvi Singh Tomar

The PPT2^2 conjecture asserts that the composition of two completely positive and completely copositive (PPT) maps is entanglement breaking. A recently announced counterexample, with PPT maps M10→M6→M10\mathrm{M}_{10}\to\mathrm{M}_6\to\mathrm{M}_{10}, is certified by the range criterion: the range of the composite Choi matrix contains no nonzero product vector. We ask how small a counterexample certified in this way can be. For PPT maps Φ ⁣:Mm→Mk\Phi\colon\mathrm{M}_m\to\mathrm{M}_k and Ψ ⁣:Mk→Mn\Psi\colon\mathrm{M}_k\to\mathrm{M}_n with Ψ∘Φ≠0\Psi\circ\Phi\neq0 and max⁡(m,k,n)≤6\max(m,k,n)\le6 we prove that the range of the Choi matrix of Ψ∘Φ\Psi\circ\Phi contains a nonzero product vector whenever k≤5k\le5 or min⁡(m,n)≤5\min(m,n)\le5. Hence the range criterion cannot certify a counterexample on M4\mathrm{M}_4 or M5\mathrm{M}_5, and among the types with all three dimensions at most six only (6,6,6)(6,6,6) remains open. Since the range is spanned by products of Kraus operators, the question is when such a span can avoid the matrices of rank one. The computer-assisted proof combines rank bounds for PPT maps with Chern class and excess intersection computations; its computed facts are checked in Lean 4, modulo classical, quoted or hand-proved inputs. The announced counterexample lifts through exterior powers a map on M4\mathrm{M}_4 built from a pencil of real matrices (a map of pencil type). When the map of pencil type loses rank transversally at finitely many points, its lifts through any Schur functor, exterior powers included, put product vectors into the kernel of the composite Choi matrix. When the composite is also nonzero, these product vectors form an unextendible product set only for exterior powers, and then one of the three dimensions is at least ten.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715651

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202638 pages
PDFView work

quant-ph — Quantum Physics

The PPT² conjecture holds for spin-factor maps

Contributed by Tejasvi Singh Tomar

The PPT2^2 conjecture asserts that the composition of two completely positive and completely copositive maps is entanglement breaking. A counterexample in dimension ten has recently been announced, and for maps on M4\mathrm{M}_4 the conjecture is open. Let S⊂M4\mathcal{S}\subset\mathrm{M}_4 be the real span of the identity γ0\gamma_0 and five pairwise anticommuting Hermitian unitaries γ1,…,γ5\gamma_1,\dots,\gamma_5. It is a spin factor whose positive cone is a Lorentz cone. We prove the conjecture for all compositions Ψ∘Φ\Psi\circ\Phi of completely positive maps Φ ⁣:M4→Mk\Phi\colon\mathrm{M}_4\to\mathrm{M}_k and Ψ ⁣:Mk→M4\Psi\colon\mathrm{M}_k\to\mathrm{M}_4, with kk arbitrary, such that the ranges of Ψ\Psi and of the adjoint Φ∗\Phi^{*} lie in invertible congruences of the complex span of S\mathcal{S}. Such maps are automatically completely copositive, and the class contains maps whose Choi matrices are entangled. A theorem of Hildebrand on separability for pairs of Lorentz cones reduces the claim to one trace inequality between the coefficient matrices of the two Choi matrices. We derive this inequality from the operator inequality ∑j=15FjF0−1Fj⪯F0\sum_{j=1}^{5}F_jF_0^{-1}F_j\preceq F_0, valid whenever ∑μ=05Fμ⊗γμ⪰0\sum_{\mu=0}^{5}F_\mu\otimes\gamma_\mu\succeq 0 and F0≻0F_0\succ 0, which in turn follows from the Kadison–Schwarz inequality. As a corollary, Ψ∘Φ\Psi\circ\Phi is entanglement breaking whenever Ψ\Psi is such a map and Φ\Phi is a completely positive map with Kraus operators of rank at most two.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23483252

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202610 pages
PDFView work

quant-ph — Quantum Physics

Certified lower bounds on the optimal-decoding threshold of the surface code

Contributed by Tejasvi Singh Tomar

Under independent bit flips, rigorous lower bounds on the threshold of the surface code from earlier work stay below 0.040.04, while numerical estimates place the optimal threshold near 0.1090.109. By counting labelled failure paths with exact transfer-matrix certificates, we prove without sampling that every minimum-weight decoder has threshold at least 0.04650.0465 on the planar and rotated codes. We then give statistical certificates that, with confidence 1−10−91-10^{-9} each, the optimal threshold of the planar code is at least 0.1030.103 under bit flips and at least 0.020.02 under phenomenological noise. Each statistical certificate bounds the failure probability of an auxiliary decoder that divides the code into blocks and corrects each block using a window around it; optimal decoding does at least as well, so the bound also holds for optimal decoding. A deterministic lemma shows that the auxiliary decoder fails only if bad blocks, in which the window corrections leave a defect or a long residual path, form a sparse hierarchy that joins the two rough boundaries. This gives an explicit bound once every block is bad with probability below a limit, about 4×10−44\times10^{-4} under bit flips, and a pre-registered Monte Carlo experiment bounds these probabilities. The confidence rests on a binomial model of the counts of bad blocks and on two tested properties of each decoding program. All these results are proved in the proof assistant Lean 4, the statistical ones with the binomial model and the two properties as hypotheses.

Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.24048739

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 12, 202642 pages
PDFView work

quant-ph — Quantum Physics

Entanglement from the Diósi–Penrose Model: An Exact Criterion, and Why It Stays Small at Any Distance

Contributed by Marc Sperzel

Trillo and Navascués showed that the Diósi–Penrose model, in the Tilloy–Diósi form with the same smearing length σ\sigma in force and noise, entangles two masses in superposition when they are closer than about 2.2 σ2.2\,\sigma, and asked whether gravitationally induced entanglement can be observed beyond that distance. We answer for two rigid bodies whose branches are position eigenstates on finite sets, without kinetic term, for noise strength CC. One kernel, the Coulomb energy of the smeared bodies, sets both the Newtonian coupling and the correlated noise, and the question becomes a single geometric comparison: a product state becomes entangled if and only if the largest canonical correlation between neutral charge patterns on the two branch sets exceeds C/1+C2C/\sqrt{1+C^2}. Below this threshold the evolution is a separable operation at all times. The published critical distances are two-branch cases of the criterion: for parallel two-branch superpositions the supremum is 2.21 σ2.21\,\sigma at C=1C=1, and a straddling geometry reaches 2.74 σ2.74\,\sigma. With many branches there is no critical distance. What limits the effect is the model's own dephasing, which sits in the same quadratic form. For bodies of effective size σeff\sigma_{\rm eff} (σ\sigma for point masses) separated by a slab of width d≫σd\gg\sigma, the entangling rate at C=1C=1 is at most 0.12 σeff/d0.12\,\sigma_{\rm eff}/d times the single-body dephasing rate. The entanglement is therefore transient and, for well-separated branches, a fraction of order σeff/d\sigma_{\rm eff}/d of what unitary Newtonian gravity gives. Entanglement of the size unitary gravity predicts still excludes the model; the inference from any detected entanglement beyond a fixed multiple of σ\sigma does not hold.

Author comments: Revised presentation: the idea is stated first, a contents page is added, and the numerical values are collected in an appendix. Results and title are unchanged.

Primarily AI-generated textHuman understanding: all parts
Nov 12, 202619 pages
PDFView work

quant-ph — Quantum Physics

Exact projector-rank thresholds for state-independent contextuality

Contributed by Sunay Venkat

For every integer r ≥ 1 we construct a finite exclusivity graph Fr with the following two properties. First, Fr has a projective representation by pairwise distinct projectors of rank r that exhibits state-independent contextuality. Second, no projective representation of Fr by projectors of any common rank s < r, in any finite dimension, exhibits state-independent contextuality; in every such representation the maximally mixed state is noncontextual. This establishes, for every r, the “rank efficient” scenarios sought by Hohn, Xu and Kleinmann, for which only numerical evidence at r = 2, 3 was available. The graph is the disjunctive product of an odd cycle C2r+1 with the orthogonality structure of a rank-one contextuality set whose fractional chromatic number exceeds its dimension by an arbitrarily small amount. Such sets are obtained from the infinite family of Kochen–Specker parity proofs in R^4 of Elford and Lisonek, together with a coning construction that raises the dimension by one.

Primarily AI-generated textHuman understanding: some partsprojector-rank thresholdsquantum contextualitystate-independent contextuality
Nov 12, 20266 pages
PDFView work

quant-ph — Quantum Physics

Genuinely multipartite bound entanglement of three qubits

Contributed by Antony Lewis

If a three-party state is positive under partial transposition (PPT) across each of its three bipartitions, no local protocol can distil any pure entanglement from it: neither singlets between any two parties nor GHZ states. All of its entanglement is bound. We show that such a state can nevertheless be genuinely multipartite entangled (GME), meaning that it cannot be prepared by mixing states in each of which some party is unentangled from the rest. This already happens for three qubits, the smallest system in which the question arises and a common experimental setting for multipartite entanglement; to our knowledge no three-qubit example was known. An explicit mixture of five orthogonal states (one GHZ-type, three WW-type and one product state) is PPT across every cut and GME throughout an exact parameter interval, and its rank, five, is the minimum possible. Genuine entanglement is proved by a witness acting only on the five-dimensional support, whose nonnegativity on the biseparable states in that support reduces to a sum of squares on its curves of product vectors. Such states are invisible to the PPT-mixture test, the standard semidefinite relaxation used to certify GME, yet they form a set with nonempty interior among density matrices: an explicit full-rank example remains GME under 2.33%2.33\% white noise, while 2.336%2.336\% makes it biseparable. We also construct extreme examples with the smallest possible partial-transpose ranks (5,5,5,5)(5,5,5,5). All our explicit states, including the full-rank one, lie in the mixed WW class: they are mixtures of pure states with vanishing three-tangle, so their genuine entanglement needs no GHZ-type component. Full PPT therefore does not imply biseparability, even for three qubits.

Primarily AI-generated textHuman understanding: no partsQuantum Informationentanglement
Nov 12, 202632 pages
PDFView work

math-ph — Mathematical Physics

Sharp Ionization Bounds for Helium and Lithium

Contributed by Alec Shelley, Charles Yang, Daniel Tartakovsky

How many electrons can a nucleus bind? In the non-relativistic Coulomb model, Lieb proved in 1984 that a nucleus of charge ZZ binds fewer than 2Z+12Z+1 electrons. While this bound has been improved, the sharp upper bound has remained unknown for any nucleus other than hydrogen. We solve this problem for Z=2Z=2 and Z=3Z=3 by proving that helium binds two or fewer electrons and lithium binds four or fewer. Both bounds are sharp. Our main tool is an adaptation of Lieb's argument with a quadratic weight, which reduces the nonbinding of doubly negative ions to finitely many inequalities that we verify in a computer-assisted proof.

A mix of human-written and AI-generated textHuman understanding: some partsanioncomputer-assisted proofexcess chargeheliuminterval arithmeticionization conjecturelithium
Nov 12, 202688 pages
PDFView work

quant-ph — Quantum Physics

Quantum-Information Probes of Collapse Dynamics in Causal Fermion Systems

Contributed by Benjamin Kaminsky

Finster, Kleiner, and Paganini derived from causal fermion systems (CFS) a nonrelativistic effective collapse model whose statistical operator obeys, to leading order, a Kossakowski--Lindblad equation. In the factorized regime of that derivation, the dissipator is built from purely spatial operators Nk,aN_{k,a} with positive rates fixed by microscopic time-nonlocal kernels. We translate this CFS-specific generator into quantities accessible to coherent quantum processors. The resulting CFS Dirichlet form obeys an exact purity-loss identity under arbitrary Hamiltonian control, and its null algebra is the commutant of the ∗*-algebra generated by the projected Nk,aN_{k,a}. For joint eigenbranches we obtain an exact distinguishability functional controlling exponential coherence loss and a lower bound on channel distance from ideal unitary evolution. In an nn-qubit dephasing sector, the projected kernels generate a positive-semidefinite covariance matrix CC, with GHZ visibility exp⁡[−2T1TC1]\exp[-2T\bm{1}^{\mathsf T}C\bm{1}]. We prove that uniformly summable finite-range correlations yield at most O(n)O(n) GHZ decay, whereas O(n2)O(n^2) scaling requires a collective non-summable component. Single- and two-qubit cat coherences reconstruct CC, giving a covariance-spectroscopy protocol, while Knill--Laflamme conditions characterize first-order correctability of the projected CFS error algebra. We also derive an explicit compatibility inequality between macroscopic state reduction and long coherent computation and show why absence of probe heating does not imply absence of coherence signatures. The results do not exclude CFS: its covariance strength, $\ellmin$, and hardware projection remain underdetermined. They instead identify the microscopic input required for a genuine no-go theorem and establish scalable quantum processors as direct probes of the CFS collapse sector.

Primarily AI-generated textHuman understanding: some partscausal fermion systemsdecoherencefault toleranceobjective collapsequantum compting
Nov 12, 202616 pages
PDFView work

math-ph — Mathematical Physics

Notes on Wasserstein distance and the JT gravitational ensemble

Contributed by Ville Samuli Keränen

This note completes the study of the Boltzmann–Wasserstein (BW) distance, an optimal-transport metric on quantum theories, begun in a companion paper (arXiv:2606.01296). There the distance was evaluated between macroscopically different theories; here we take the opposite limit, two independent draws of the JT-gravity ensemble, which are identical at the classical level. The distance is computable and is controlled by the connected spectral form factor: the ramp, the double-trumpet wormhole, regulated by the plateau, the spectral discreteness. The mean is exponentially small, ⟨W2⟩∼S0 e−S0\langle \mathcal{W}^2\rangle \sim S_0\, e^{-S_0}, whereas uncorrelated (Poisson) levels would give an unsuppressed O(1)O(1) distance: the self-distance is a sharp diagnostic of spectral chaos. As a metric, the BW distance renders the ensemble a point cloud: exponentially small, strongly anisotropic, its leading principal axis a coherent “breathing” deformation of the low-energy spectrum. Its effective dimension grows asymptotically as Deff≃0.42 S02D_{\mathrm{eff}} \simeq 0.42\, S_0^2, so the distance self-averages, its relative width shrinking as std/mean∼1/S0\mathrm{std}/\mathrm{mean} \sim 1/S_0. At low temperatures it localizes on the Airy edge, where a single Tracy–Widom mode dominates and self-averaging fails. We test the picture with exact-diagonalization GUE and SYK simulations: in GUE the effective dimension grows logarithmically at every temperature and is predicted at finite NN, with no free parameters, by the same covariance; unfolded SYK exhibits the predicted anisotropy and mode structure of the cloud. Together with the companion result, this fixes the resolution of the metric: the microstate rigidity computed here is the noise floor beneath a macroscopic difference between theories.

Primarily AI-generated textHuman understanding: some parts
Nov 11, 202637 pages
PDFView work

math-ph — Mathematical Physics

Holographic entropy inequalities without unscaled contraction proofs

Contributed by Antti Hippeläinen

We show that a valid holographic entropy inequality can lack a proof by contraction until all its coefficients are multiplied by a common integer, even when it is balanced, that is, every party has the same total coefficient on both sides, or superbalanced, that is, this remains true after any party is exchanged with the purifier. Every facet of the holographic entropy cone other than subadditivity is superbalanced. A proof by contraction is a map between Boolean cubes that respects the terms in which each party occurs and does not increase weighted Hamming distances. A balanced seven-party inequality and a superbalanced six-party inequality fail at a single point of the cube. Six of their right-hand side terms correspond to the edges of two disjoint triangles of parties, and at that point an unscaled map would have to choose three of these edges that together touch all six vertices, which is impossible. The seven-party one has a proof after doubling. Superbalanced eight- and seven-party inequalities have no unscaled proof even on their realizable domains, the subsets of the cube on which a map already proves validity, and they keep this property when instances of the monogamy of mutual information are subtracted in five successive steps. Splitting further into valid inequalities leads to a superbalanced facet F7F_7 of the seven-party cone that we did not find in the literature. It has unscaled maps on its realizable domain, all of which break its symmetry. For star inequalities, whose left-hand side contains only single-party entropies, the least scaling is the least kk for which an explicit polytope contains a point with coordinates in 1kZ\frac1k\mathbb{Z}. From the weighing matrices of Alon and V\~u we obtain valid NN-party star inequalities whose least scaling exceeds N(1/4−ε)NN^{(1/4-\varepsilon)N} for every ε>0\varepsilon>0 and large NN, while every finite least scaling of an NN-party star inequality is below NN/2N^{N/2}. Non-existence rests on DRAT proofs, validity on exact rational maps or identities, and the facet property on 126126 explicit graph models, except for the star inequalities of arbitrary size, whose results rest on written proofs.

Primarily AI-generated textHuman understanding: no partsRyu-Takayanagi formulabalancecontraction mapholographic entropy coneholographic entropy inequalityinteger scalingsuperbalance
Nov 10, 202637 pages
PDFView work

math.CO — Combinatorics

On Fourier and Hadamard matrices of prime order

Contributed by Teo Banica

We study how much of the Fourier matrix FpF_p is needed to recognize it among complex Hadamard matrices of prime order pp. For regular or Butson matrices, taking the ppth power of each entry gives either a Hadamard matrix or a matrix of rank one. For every odd prime, the block of FpF_p on the rows and columns indexed by the nonzero squares determines FpF_p up to equivalence in both classes. At level pp, a symmetry with cycle lengths 1,(p−1)/2,(p−1)/21,(p-1)/2,(p-1)/2 on each side also characterizes FpF_p at every odd prime through 109109.

Primarily AI-generated textHuman understanding: some partsFourier matrixHadamard matrix
Nov 10, 202642 pages
PDFView work

math.OA — Operator Algebras

Bures Geometry of Projection States

Contributed by Zhenyu Sun, Jilin Wang

We study the Bures metric on states obtained by conditioning a faithful normal state on nonzero projections of a von Neumann algebra. The metric determines the reference state, projection probabilities, orthogonality, and order. For algebras with no type I2I_2 direct summand, surjective isometries are exactly those induced by reference-state-preserving normal Jordan ∗^*-isomorphisms; the same conclusion holds for M2(C)M_2(\mathbb C). A semifinite tracial version determines the trace up to a single positive factor. In finite tracial algebras, we characterize optimal finite projective measurements and express their fidelity deficit as a sum of squared L2L^2 errors. Spectral measurements with at most n+1n+1 outcomes approximate fidelity with error O(n−2)O(n^{-2}); the interval grid is minimax optimal, and the order is sharp within spectral measurements. We compare the fidelity defect of a common commutative context with approximation by commuting projections, obtain sharp spectral rounding constants, and solve both optimization problems in the algebra generated by two projections. The space of normalized finite-trace projection states is complete; in a finite tracial algebra its rectifiable components are unitary orbits, and within each orbit the intrinsic Bures distance is the root mean square of the principal angles. Finally, a fidelity bound on local unitary orbits characterizes tracial reference states.

Author comments: 38 pages.

Primarily human-written textHuman understanding: all partsBures geometryintrinsic distanceoptimal measurementsprojection statesquantum fidelityvon Neumann algebras
Nov 06, 202638 pages
PDFView work

math.CO — Combinatorics

Regular complex Hadamard matrices of order 7,8

Contributed by Teo Banica

A complex Hadamard matrix H∈MN(C)H\in M_N(\mathbb C) is called regular when the scalar products between its rows ∑kHikHˉjk=0\sum_kH_{ik}\bar{H}_{jk}=0 decompose as trivially vanishing sums of roots of unity, rotated by scalars. We review the general theory of such matrices, including the known classification at N=6N=6, and then we work out classification results at N=7N=7 and N=8N=8.

Primarily AI-generated textHuman understanding: some partsButson matrixHadamard matrix
Nov 06, 202664 pages
PDFView work

quant-ph — Quantum Physics

Classical Extensions and Strongly Positive Realizations of Decoherent History Probabilities

Contributed by Zhenyu Sun

Probabilities on several decoherent families of histories may agree on shared events yet admit no classical extension to the Boolean algebra that the families generate. We characterize the strongly positive decoherence functionals that realize given local probabilities on a finite algebra. A covariance decomposition allows any signed extension to be prescribed at any attainable rank and gives the resulting increase in minimum trace. For two contexts, agreement on their intersection suffices for a strongly positive realization. On the bipartite graph of context atoms, the minimum negative mass of a signed extension is (W1−1)/2(W_1-1)/2, where W1W_1 is the transport cost for graph distance. A graph Laplacian formula gives the minimum trace. Its minimizers form an affine copy of a rectangular contraction ball whose extreme points have the smallest realization rank. For a pure-state implementation with one intermediate projective decomposition and a final postselection, the optimal success probability of a realization is the reciprocal of the least trace of a diagonal matrix dominating it. In a family of classical examples, this probability tends to zero for the unique trace minimizer even though another realization succeeds with probability one.

Primarily human-written textHuman understanding: all partsdecoherence functionalsdecoherent historiesoptimal transportquantum postselectionsigned measures
Nov 04, 202635 pages
PDFView work

quant-ph — Quantum Physics

Exact amplitudes of sparse quantum circuits in subexponential time, assuming the new #SAT algorithms

Contributed by Vaibhav Tulsyan

Classical simulation lower bounds for quantum circuits have been derived from the Exponential Time Hypothesis (ETH). However, in October 2026 OpenAI and Anthropic claimed deterministic subexponential algorithms for #k-SAT, refuting ETH, and neither manuscript mentions quantum circuits. We record the corollary. Assuming three internal results of the Anthropic manuscript, one deterministic Turing machine computes the amplitude ⟨y∣C∣x⟩\langle y|C|x\rangle of a Clifford+T circuit with GG two-qubit gates in arbitrary connectivity exactly, as an element of Z[ω]/2 k\mathbb{Z}[\omega]/\sqrt2^{\,k} with ω=eiπ/4\omega=e^{i\pi/4}, in time 2O(G/log⁡G)2^{O(G/\sqrt{\log G})} whenever the input length LL satisfies log⁡L≤G0.9\log L\le G^{0.9}. The proof reads the sum over paths, one bit per wire segment, as an Anthropic-type network, with a Kronecker map for Z[ω]\mathbb{Z}[\omega] and a Galois bound. We machine-check this theorem in Lean 4 (amplitude_TM_rate', amplitude_TM_rate, amplitude_TM; axioms propext, Classical.choice, Quot.sound) on top of Anthropic's Lean development (sources at https://github.com/xennygrimmato/eth-hamiltonicity). On paper only, the method gives exact marginals and exact sampling, depth-dd circuits in 2O(dn/log⁡n)2^{O(dn/\sqrt{\log n})}, and, through OpenAI's tensor-contraction theorem, polynomial space when the number of Hadamard-type gates is O(G)O(G). Conversely, constant-depth circuits with O(n)O(n) gates encode #3-SAT with O(n)O(n) clauses, so the rate matches that of the refutations. We check the fine-grained supremacy conjectures we found against their sources; a counting form of the Calabro-Impagliazzo-Paturi width reduction refutes the gap conjecture of Morimae and Tamaki's depth-scaling paper. Dense statements (cubic phases, permanents, random circuits) survive. Nothing here concerns approximate sampling, the constants are galactic, and everything is conditional on the claimed refutations, which are under review.

Primarily AI-generated textHuman understanding: some partsClifford+Tfine-grained complexityquantum circuit simulationquantum supremacystrong simulationtensor networks
Nov 04, 202615 pages
PDFView work

math.FA — Functional Analysis

Wigner–Yanase–Dyson Metrics Have Monotone Curvature

Contributed by Suvrit Sra

Gibilisco and Isola conjectured that the scalar curvature of the Wigner–Yanase–Dyson metric with parameter pp on the invertible density matrices increases under mixing for all pp in some interval (1,1+ε)(1,1+\varepsilon); the case p↓1p\downarrow1 is Petz's conjecture for the Kubo–Mori metric (resolved in a companion paper). We prove that for p∈(1−ε,1+ε)p\in(1-\varepsilon,1+\varepsilon), with ε>0\varepsilon>0 independent of the dimension, the scalar curvature is a concave function of the eigenvalues and hence increases under mixing. By Dittmann's formula it suffices to prove that one symmetric function HpH_p of three positive variables is concave, which we do by showing that −1/Hp-1/H_p is a Stieltjes transform along every line in the positive cone, uniformly in pp near 11. The value of ε\varepsilon is not explicit.

A mix of human-written and AI-generated textHuman understanding: some partsKubo-Mori metricStieltjes transformWigner-Yanase-Dyson metricdivided differencesmajorizationscalar curvature
Nov 02, 202620 pages
PDFView work

math.FA — Functional Analysis

Weak positivity of Schur forms under decomposable curvature

Contributed by Suvrit Sra

Griffiths's 1969 conjecture predicts positivity of Schur forms for Griffiths-positive vector bundles. Finski reduced its weak form to a sign question for the double mixed discriminant Φn(H)\Phi_n(H) of a positive linear map. Du's rank-nine counterexample shows that Φn(H)≥0\Phi_n(H)\ge0 fails in general. We prove Φn(H)≥0\Phi_n(H)\ge0 for every decomposable map HH, a sum of a completely positive and a completely copositive map, using a quaternionic Gaussian determinant representation. Combined with Finski's incidence formula, this inequality gives weak nonnegativity of every Schur form under decomposable curvature, without splitting assumptions. Beyond the decomposable cone, nonnegativity of Φk(HV,U)\Phi_k(H_{V,U}) on every square compression is equivalent to Φn(H+S)≥0\Phi_n(H+S)\ge0 for every entanglement-breaking map SS. This class contains explicit indecomposable maps, but is nonconvex in every size n≥9n\ge9. We prove the nonconvexity by expressing Du's map as an average of four members, and the obstruction persists when all compression inequalities are strict.

A mix of human-written and AI-generated textHuman understanding: some partsBreuer-Hall mapChern formGriffiths positivitySchur formdecomposable mapentanglement-breaking mapmixed discriminantpositive linear mapquantum permanent
Nov 02, 202637 pages
PDFView work

math.OC — Optimization and Control

Lower bounds for the quantum permanent

Contributed by Suvrit Sra

Griffiths's 1969 conjecture on the positivity of Schur forms reduces to the positivity of the quantum permanent Φn\Phi_n on positive bistochastic maps. This conjecture was refuted by Du with a map for which Φ9<0\Phi_9<0. Therefore, we ask: how negative can Φn\Phi_n be? We prove a lower bound Φn≥−3n/(3n2+20n+103)\Phi_n\ge-3n/(3n^2+20n+103) (for n≥8n\ge 8), and an asymptotically stronger bound Φn≥−1/n+(3e2−7−o(1))log⁡n/n2\Phi_n\ge-1/n+(3e^2-7-o(1))\log n/n^2. The key to our bounds is the orbital polynomial of the map, which turns Φn\Phi_n into a linear function of a distribution on partitions and positivity into linear constraints. We also construct explicit maps for n=8,9n=8, 9 that improve on Du's example. Finally, if d∗∈{4,…,8}d_*\in\{4,\ldots,8\} is the first dimension for which Φn<0\Phi_n<0, the minimum μn\mu_n of Φn\Phi_n over positive bistochastic maps satisfies −μn=Ω(n−d∗)-\mu_n=\Omega(n^{-d_*}); we conjecture the matching order −μn=O(n−d∗)-\mu_n=O(n^{-d_*}).

A mix of human-written and AI-generated textHuman understanding: some partsGriffiths positivitybistochasticlower boundspositive mapsquantum permanentsemidefinite programming
Nov 02, 202630 pages
PDFView work

math.FA — Functional Analysis

A Proof of Petz's Conjecture on the Scalar Curvature of the Kubo–Mori Metric

Contributed by Suvrit Sra

Petz (1994) conjectured that the scalar curvature of the Kubo–Mori metric on invertible density matrices increases as the state becomes more mixed. Dittmann (2000) reduced the conjecture to the concavity of an explicit symmetric function hh on (0,∞)3(0,\infty)^3. We prove that hh is strictly concave, and hence Petz's conjecture. The proof writes h=−1/(8M)h=-1/(8M) with MM positive and homogeneous of degree one, and its central idea is to show that t↦1/M(X+tY)t\mapsto 1/M(X+tY) is a Stieltjes function for all X,Y>0X,Y>0; Cauchy–Schwarz and homogeneity then give concavity of hh on (0,∞)3(0,\infty)^3.

A mix of human-written and AI-generated textHuman understanding: all partsKubo-Mori metricMorozova-Chentsov kernelPetz conjectureStieltjes functionlogarithmic meanscalar curvaturestrict concavity
Nov 02, 202617 pages
PDFView work

math-ph — Mathematical Physics

Density functionals for the Pauli-Fierz Hamiltonian

Contributed by Mihaly A. Csirik, Andre Laestadius, Markus Penz, Erik I. Tellgren

We develop a density-functional theory for the Pauli-Fierz Hamiltonian of nonrelativistic quantum electrodynamics in the spirit of the convex-analytic formulation of Lieb. We consider finitely many electrons, subject to external scalar and vector potentials, coupled to the full continuum of massless transverse photons with an ultraviolet cutoff. The natural basic variables are the standard electron density and a combined current density, the sum of the paramagnetic current density and a field-induced current density generated by the quantized vector potential. We prove representability results for these density-current pairs and show that the mixed-state constrained-search functional attains its infimum and coincides with the Lieb functional obtained by convex conjugation. Since arbitrarily soft photons purify mixed states at a negligible energy cost without changing their density and combined current density, the pure-state Levy-Lieb functional equals the Lieb functional and is therefore convex, even though its infimum need not be attained. In addition, we establish the zero-coupling limit, which recovers the mixed-state Vignale-Rasolt functional of current-density-functional theory. Finally, we consider the long-wavelength (dipole) limit and show that the limiting functional can be written as a constrained search for the well-known length-gauge dipole Hamiltonian.

Primarily AI-generated textHuman understanding: all parts
Nov 02, 2026121 pages
PDFView work

math.IT — Information Theory

The Shared Randomness Cost of Optimal One Use Loop Communication

Contributed by Daniel Adam Pyle

We determine the minimum support and Shannon entropy of a shared classical seed needed to attain optimal worst-message success in a specified one-use normalized-loop model. The loop contains a backward binary symmetric channel with crossover 0 < p < 1/2 and a fixed finite-dimensional forward quantum channel. Seed branches are mixed as unnormalized weights before one normalization for each message. For qubit output and interior forward trace-distance diameter, equality at the known unrestricted optimum forces every supported seed to activate exactly two message labels. The seed-cost problem becomes a fractional perfect matching problem: even message counts are optimally covered by disjoint pairs, while odd counts require a triangle and disjoint pairs. We give separate exact formulas at zero and unit diameter, prove a sufficient higher-dimensional extension of the interior result, and exhibit an erasure-channel counterexample to diameter-only seed costs in general dimension. Explicit near-optimal constructions show how the exact-attainment cost discontinuities can be avoided at finite tolerance. Compactness also gives a strict performance gap below the minimum seed support. A complete exact-certificate calculation determines the two-seed classical optimum for three messages at backward and forward crossover 1/10. These are resource-specific mathematical results, not a physical backward-communication protocol or an asymptotic capacity theorem.

Primarily AI-generated textHuman understanding: no partsShared randomness; normalized loop; postselection
Nov 02, 202613 pages
PDFView work

math.IT — Information Theory

Shared Randomness and Normalization in One-Use Loop Communication

Contributed by Daniel Adam Pyle

We study a finite-message communication model defined by contracting one backward binary symmetric channel with one fixed, finite-dimensional forward quantum channel and then normalizing the resulting weights. The devices may share a finite classical seed that is independent of the message before normalization. The seed branches are mixed at the level of unnormalized weights, followed by a single normalization for each message. For M ≥ 2 messages, backward crossover probability 0 < p < 1/2, and forward channel Φ, we derive the exact worst-message success probability S_raw(Φ,p,M) = 2(1−p)/[M−(M−2)(1−2p)δ(Φ)], where δ(Φ) = max over input states ρ, σ of ½‖Φ(ρ)−Φ(σ)‖₁. The quantity δ is the established trace-distance contraction coefficient, not a new channel invariant. A cyclic construction with M seed values attains the bound. Crucially, normalization can make the posterior seed distribution message-dependent: the theorem does not describe an average of separately normalized branches or require success for every seed. We give an exact example separating these conventions. Matched depolarizing-qubit and classical binary symmetric forward channels consequently have equal optima in this resource model. The result is a restricted one-use optimization, not a physical backward-communication protocol or a general asymptotic capacity theorem.

Primarily AI-generated textHuman understanding: no partsShared randomness; quantum channels; normalization; one-shot communication
Nov 02, 202610 pages
PDFView work

math.IT — Information Theory

Finite Alphabet Communication with Noisy Forward Memory in a Normalized Loop

Contributed by Daniel Adam Pyle

We study one-use communication of a finite classical message through a stipulated normalized loop containing a backward binary symmetric channel and one noisy forward memory carrier. The carrier is either a classical bit or a qubit; no shared random seed, retained side register, or entanglement is supplied. For every finite message count, we characterize the qubit optimum by a constructive scalar feasibility test. For rational noise parameters and a rational target success, the test uses O(M²) constant-size rational arithmetic checks. The proof combines an exact decoder reduction, minimum-trace allocation for constant encoders, and a concave geometric cap with a matching polygon construction. For three messages, the qubit and classical-bit optima coincide throughout the allowed noise range; an explicit Bernstein certificate proves the remaining polynomial inequality. For four messages, an exact rational qubit protocol exceeds a bound valid for every classical-bit protocol. These are conditional mathematical results for the declared resource model, not a construction of a physical backward channel. Independent human review and originality assessment remain pending.

Primarily AI-generated textHuman understanding: no partsinformation theory quantum information
Oct 31, 202617 pages
PDFView work

math-ph — Mathematical Physics

Equality of the Jellium and the Uniform Electron Gas Energies

Contributed by Mihaly A. Csirik

Jellium, a system of electrons in a uniform neutralizing background, and the uniform electron gas (UEG), a system of electrons with constant density and no background, are two standard models of the electron gas. We prove that the ground-state energy per unit volume of Jellium, as defined by Lieb and Narnhofer, coincides with the UEG energy defined by Lewin, Lieb and Seiringer, i.e. eJelℏ(ρ0)=eUEGℏ(ρ0)e^\hbar_{\rm Jel}(\rho_0)=e^\hbar_{\rm UEG}(\rho_0). This equality was previously established in the classical case by Lewin, Lieb and Seiringer and independently by Cotar and Petrache.

Primarily AI-generated textHuman understanding: all partselectron gasjellium
Oct 29, 202638 pages
PDFView work

math-ph — Mathematical Physics

Continuity, Testing Regions and Fragility of Quantum Channel Divergences

Contributed by Morgan Jones

Converse bounds on discriminating and estimating quantum channels are evaluated on a characterized model of the channels, which is only known approximately. This book studies when such bounds, and the operational exponents they bound, depend continuously on the channels, and whether their sensitivity to characterization error is a property of the task or only of the bound. The book opens with noisy quantum gates. The supports of the Choi matrices separate genuine fragility, where the operational exponent itself jumps, from spurious fragility, where only single-letter converses jump. Near a gate with an incoherent noise floor, the smallest eigenvalue of the normalized Choi matrix sets the sensitivity. At first order, under errors in the model, this sensitivity belongs to the task. At second order, under a coherent miscalibration, the converses can overshoot the adaptive Stein and Chernoff exponents by factors that grow without bound as the noise decreases, although for small miscalibrations of a depolarized qubit they stay within a factor 3/2. Certifying a converse from tomographic data costs a number of channel uses set by the same floor. The general theory follows. Divergences built from Kubo-Ando means, including the geometric fidelity, the geometric Renyi divergences and the Belavkin-Staszewski relative entropy, are functions of the Arveson-Radon-Nikodym derivative of one channel with respect to the sum of the pair, and in this coordinate they are continuous with dimension-free moduli. In the diamond norm they are continuous at a pair of completely positive maps exactly when the Choi matrix of the sum is invertible or the fidelity vanishes, so an ideal unitary gate paired with itself is a point of discontinuity. Divergences built from hypothesis tests, such as the Umegaki relative entropy and the hockey-stick f-divergences, are uniformly continuous in every dimension, and the adaptive

A mix of human-written and AI-generated textHuman understanding: some partsQuantum Information
Oct 29, 2026264 pages
PDFView work

math.FA — Functional Analysis

Tsallis Metrics on Density Matrices via the S-Divergence

Contributed by Suvrit Sra

We study symmetrized divergences induced by centroids of α\alpha-Tsallis relative entropies between density matrices σ\sigma and ρ\rho; up to scaling, the induced divergence equals ∣2−∥ρα+σα∥1/α∣|2-\|\rho^\alpha+\sigma^\alpha\|_{1/\alpha}|. Earlier work (S. Sra, "Metrics induced by Jensen–Shannon and related divergences on positive definite matrices," Linear Algebra Appl., 2021) studied such divergences and metrics induced by them. That paper allowed centroids to range over the positive definite cone, while we require that the centroid itself be a density matrix. This (more natural) choice makes the metricity in this paper considerably stronger than that of the aforementioned paper. Specifically, we prove that ∣2−∥ρα+σα∥1/α∣1/2|2-\|\rho^\alpha+\sigma^\alpha\|_{1/\alpha}|^{1/2} is a metric on density matrices for 1/2≤α≤21/2\le\alpha\le2, α≠1\alpha\ne1. For α<1\alpha<1, the proof uses a new four-point theorem for the S-divergence that might be of independent interest. For α>1\alpha>1, we first prove the endpoint α=2\alpha=2, and then transfer it to the other orders by a tensoring trick.

A mix of human-written and AI-generated textHuman understanding: all partsS-divergenceSchatten normSibson information radiusTsallis relative entropylog-determinant inequalitynegative typequantum Jensen-Shannon divergencequantum Renyi entropy
Oct 29, 202614 pages
PDFView work

quant-ph — Quantum Physics

A matching threshold of 2×10⁻³ for the rotated surface code under circuit-level noise

Contributed by Tejasvi Singh Tomar

We consider the rotated surface code of odd distance dd with its standard syndrome-extraction circuit, under circuit-level depolarizing noise in which every gate, idle step, preparation and measurement fails independently with probability pp, decoded by minimum-weight perfect matching with the log-likelihood weights of single faults. We prove that a memory experiment with TT rounds fails with probability at most 0.061 (T+1)(d+1) λd/(1−λ)0.061\,(T+1)(d+1)\,\lambda^{d}/(1-\lambda), where λ=0.999 (p/p∗∗)9/25\lambda=0.999\,(p/p_{\ast\ast})^{9/25}, for every p≤p∗∗=2×10−3p\le p_{\ast\ast}=2\times10^{-3}. Hence the logical error rate per round decays exponentially in dd for all p≤p∗∗p\le p_{\ast\ast}. Earlier rigorous thresholds for matching on surface-code circuits are 1.7×10−41.7\times10^{-4}, due to Dennis, Kitaev, Landahl and Preskill, and 7.4×10−47.4\times10^{-4}, due to Fowler. We keep their reduction of a failure to a weighted self-avoiding path in the decoding graph, but bound these paths by a local criterion for non-backtracking walks, which gives the threshold 1.04×10−31.04\times10^{-3} in closed form. To reach 2×10−32\times10^{-3} we use the minimality of the correction along the path, for a canonical choice among the minimum-weight corrections: labellings of short stretches of the path into error and correction edges that contradict this minimality are excluded, and the remaining labelled walks are counted with a potential function that is checked in exact arithmetic. For a leaner schedule with fused measure-and-reset steps the two arguments give 1.53×10−31.53\times10^{-3} and 3×10−33\times10^{-3}, respectively. With error rates that depend on the type of operation, they certify exponential decay for error models built from the published component error rates of Quantinuum's Helios and H2 and of IBM's Heron r3 processor ibm_boston, mapped onto this circuit. All theorems are also proved in the proof assistant Lean 4, with all computations checked by its kernel. Any argument that bounds the failure probability by the probability of an increasing event, ours included, is limited by the smallest such event that contains all failures, and Monte Carlo estimates place the threshold of this event near 4×10−34\times10^{-3} for this circuit.

A mix of human-written and AI-generated textHuman understanding: all parts
Oct 26, 202628 pages
PDFView work

math.OA — Operator Algebras

On the tightness of the Parthasarathy and Schmidt rank bounds for extremal tracial couplings

Contributed by Dipankar Dey, Somnath Jana, Soumyashant Nayak

Let 2≤a≤b2 \le a \le b, and let ρA,ρB\rho_A, \rho_B be density operators on $\C^a$ and $\C^b$, respectively. Let C(ρA,ρB)\mathcal{C}(\rho_A, \rho_B) denote the set of bipartite couplings on $\C^a \otimes \C^b$ with these marginals. Parthasarathy showed that every extreme coupling has rank at most $\KRP(a,b) := \lfloor\sqrt{a^2+b^2-1}\rfloor$. It is not known for which dimension pairs (a,b)(a, b) this bound is tight. We restrict attention to the tracial case ρA=Ia/a\rho_A = I_a/a, ρB=Ib/b\rho_B = I_b/b. For the Parthasarathy bound, we construct extreme couplings of rank rr from pairs of length-rr finite unit-norm tight frames (FUNTFs) in $\C^a$ and $\C^b$ satisfying a transversality condition. This yields an extreme coupling of rank bb for every 2≤a<b2 \le a < b, and hence tightness of $\KRP(a,b)$ whenever a<ba<b and b≥(a2−1)/2b\ge(a^2-1)/2; in particular, along the whole qubit-qudit line (2,b)(2,b), b≥3b\ge3. This recovers the two previously known tracial cases with a<ba<b, namely (2,3)(2,3) and (3,4)(3,4). The Schmidt decomposition and subadditivity of rank give the lower bound $\ES(a, b) := \lceil b/a\rceil$ for the rank of every tracial coupling, extreme or not. For the Schmidt bound, we use sparse Kraus operators built from weighted partial permutation matrices. Setting $r := \ES(a, b)$, we construct an extreme coupling of rank rr whenever b−(r−1)ab-(r-1)a divides aa, and show that for a<b≤2aa<b \le 2a, where this condition reads b−a=gcd⁡(a,b)b-a=\gcd(a,b), it is also necessary. For b>a(a−1)b>a(a-1), the divisibility condition is superfluous and the Schmidt bound is attained for every such bb. Thus, for each fixed aa, attainability of both bounds remains open for only finitely many b≥ab\ge a.

Primarily human-written textHuman understanding: all partsCompletely positive mapsExtremal tracial couplingFinite unit-norm tight frames (FUNTFs)Kraus operatorsQuantum marginal problem
Oct 23, 202631 pages
PDFView work

quant-ph — Quantum Physics

Pauli problem in dimension 4

Contributed by Dmitry Grinko

The finite-dimensional Pauli problem asks how many measurements in orthonormal bases determine every pure state of a dd-level quantum system up to a global phase. Four bases always suffice, and the answer is known to be three for d=2d=2 and four for d=3d=3 and d≥5d\geq5. Dimension four remained open because the embedding argument used in other dimensions fails there: the pure-state space CP3\mathbb{CP}^3 embeds in R9\R^9, the space of the nine independent probabilities of three bases. We show that three bases do not suffice in \(\C^4\), so exactly four are needed. The same argument shows that no ten vectors in \(\C^4\) do phase retrieval. Since eleven vectors are known to suffice, the smallest phase-retrieval frame and the smallest rank-one POVM distinguishing all pure states in \(\C^4\) both have eleven elements. All three lower bounds follow from one statement: every six-dimensional real space of traceless Hermitian 4×44\times4 matrices with a common isotropic vector, that is, a nonzero ee with e∗Te=0e^*Te=0 for all TT in the space, contains a nonzero matrix of rank at most two. We prove it with complex KK-theory: otherwise, an odd unitary map on the five-sphere would have a K1K^1-class that is nonzero by antipodal symmetry but vanishes because of the isotropic vector.

Primarily AI-generated textHuman understanding: some parts
Sep 29, 202613 pages
PDFView work