@informaq.bsky.socialEstablishes sharp upper bounds on quantum state purity for APPT states, determines exact minimum von Neumann entropy for qubit-qudit systems, and proves exponential decay rate ln(27/4) for spectral volumes. Disproves the Dũng–Khôi conjecture.
@informaq.bsky.socialResearchers show min-relative nonlocal magic can detect subtle reorganization of quantum entanglement during ergodic-to-localized phase transitions, revealing phenomena invisible to conventional entanglement entropy measures.
@informaq.bsky.socialStudy establishes bounds on equally antidistinguishable state sets and demonstrates that polygonal models can exceed quantum performance on exclusion tasks, with implications for probing nonclassicality beyond quantum mechanics.
@informaq.bsky.socialProves generalized quantum Stein's lemma holds when null hypothesis deviates from ideal i.i.d. regime using Wasserstein distance metric, establishing robust performance bounds for quantum hypothesis testing and resource manipulation.
@informaq.bsky.socialOptimal qubit state conversion rates determined by Fisher information eigenvalues. Both concentration & dilution protocols implementable using only SWAP tests—no additional gates required.
@informaq.bsky.socialOptimal bounds for k-learnable quantum states enable partial state identification without errors. Results include exact copy complexity for stabilizer states, SIC-POVMs, MUBs, and applications to quantum anomaly and changepoint detection.
@informaq.bsky.socialNovel framework for quantum uncertainty: introducing Hiai-Petz non-additive skew informations with sharp uncertainty bounds. Power-commutator families realized through Stolarsky operator means establish convexity and optimal coefficients.
@informaq.bsky.socialRestricting stabilizer learning to conditional-state information yields no asymptotic copy-rate discount: both tasks require one copy per qudit. This settles the quantum sample complexity threshold for partial state identification.
@informaq.bsky.socialNew subsystem product entropy unifies state distinguishability measures and reveals exact duality with SVD entanglement entropy. Verified analytically in 2D CFT and numerically on critical Ising chains, enabling efficient quantum state comparisons.
@informaq.bsky.socialProves no finite dimensional limit exists for squashed entanglement by constructing a counterexample with partially dephased Bell pairs, resolving a long-standing open question in quantum information theory.
@informaq.bsky.socialEstablishes log-convexity of trace-norm overlaps and characterizes equality conditions for quantum states. Proves the midpoint α=1/2 is the unique parameter enabling universal data-processing monotonicity under quantum channels.
@informaq.bsky.socialNew operator-theoretic invariant framework using Pauli decompositions for periodic and quasicrystalline graph structures, enabling quantum system comparison and graph classification via local neighborhood analysis.
@informaq.bsky.socialDemonstrates how pseudo entropy of non-orthogonal quantum states can be systematically derived from ordinary entanglement entropy using analytic continuation. Includes explicit formulas for CFT and Gaussian states.
#QuantumInformation #EntanglementEntropy #TheoreticalPhysics
@informaq.bsky.socialIntroduces a geometric quantifier using Majorana stellar representations to characterize entanglement in indistinguishable boson systems through property-attribution incompatibility, with applications to quantum metrology.
@informaq.bsky.socialConteXtuΛlity enables researchers to compute contextuality measures using linear programming without manually implementing complex optimization problems. Demonstrates practical applications to Bell-CHSH and KCBS scenarios with extensible framework.
@informaq.bsky.socialCompletely resolves the existence problem of linear constraint systems with quantum solutions but no classical solutions: such systems exist if and only if d≥3 and gcd(n,d)>1, providing explicit constructions beyond binary cases.
@informaq.bsky.socialProves polynomial fidelity decay O(1/n) for codes exceeding capacity on pure-loss bosonic channels, establishing fundamental limits on quantum communication without energy constraints using quantum hypothesis testing methods.
@informaq.bsky.socialNew efficiently computable converse bound significantly improves classical capacity estimates for generalized amplitude-damping channels, nearly matching achievable rates at non-zero temperatures.
@informaq.bsky.socialComplete determination of multiqubit unextendible product basis sizes using graph-theoretic methods resolves a decades-long challenge in quantum information theory, with systematic constructions for every dimension.
@informaq.bsky.socialResolves 25-year-old open problems by proving QIP(2), qq-QAM, QAM, and QMA achieve perfect completeness. Introduces endpoint-inward turn-halving transformation that halves message complexity while preserving completeness guarantees.