@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.
@informaq.bsky.socialResearchers reduced quantum state classification complexity by connecting complete orthogonal product bases to graph theory, lowering variable bounds from 2^n to 2^(n-1) and revealing doubly exponential growth.
@informaq.bsky.socialKean Chen and Qisheng Wang developed improved estimators for Rényi and Tsallis entropies achieving near-optimal sample complexity, significantly reducing data requirements and enabling more practical characterization of quantum states.
@informaq.bsky.socialProves the diagonal-lines test cannot be removed from quantum soundness analysis without breaking global compatibility. Constructs explicit counterexample showing axis-parallel consistency alone cannot enforce required measurement commutativity.
@informaq.bsky.socialSharp Lipschitz continuity bounds derived for von Neumann entropy and Entanglement of Formation using log-Sobolev inequalities on complete graphs, establishing optimal constants for both finite and infinite-dimensional quantum systems.
@informaq.bsky.socialDevelops analytical framework proving computational-basis optimality of nonlocal stabilizer entropy for specific state families; provides universal bounds constraining magic resources in many-body quantum systems.
@jaceblog.bsky.socialQUANTUM COMPUTING BEYOND BINARY
Quantum computers already exist. Google, IBM, and others run them today.
What if a hidden lab pushed past qubits entirely, building a machine that never had to collapse into a single answer?
#HiddenLabSeries #QuantumComputing #QuantumInformation #QuantumMechanics
