An Editors' Pick via #OPG_OMEx: Noise-assisted ultracompact full-Stokes polarimetry https://bit.ly/4gSkZkL #RemoteSesnsing #QuantumInformation 💡⚛️
@opg.optica.org
@opg.optica.orgAn Editors' Pick via #OPG_OMEx: Noise-assisted ultracompact full-Stokes polarimetry https://bit.ly/4gSkZkL #RemoteSesnsing #QuantumInformation 💡⚛️
@informaq.bsky.socialResearchers construct PPT quantum states with Schmidt number asymptotically approaching the maximum possible value, breaking the n/2 barrier with a new bound of n−O(√n), using algebraic independence arguments.
@informaq.bsky.socialEstablishes optimal conversion rates for quantum states under Lie group symmetries using a continuous family of quantum Fisher information matrices, revealing irreversibility and activation mechanisms in asymmetry resource manipulation.
@informaq.bsky.socialClassifies when Born-rule probabilities compose across unitary steps; introduces Born-Chapman-Kolmogorov current measuring composition defects; proves quantum music transition prediction PromiseBQP-complete.
@informaq.bsky.socialNew theorem proves impossible to universally conjugate unknown quantum states via unitary operations. Extends fundamental quantum no-go theorems with implications for quantum cryptography and quantum circuit design.
@informaq.bsky.socialResearchers set a lower bound exceeding 100 units on quantum information capacity in two-photon states, constraining hidden variable theories and demonstrating commercial photonic systems can test fundamental quantum mechanics.
@informaq.bsky.socialResolves a longstanding quantum information puzzle: two channels with zero private capacity can jointly enable secure communication achieving >0.0001903 private bits per use through superactivation—impossible for classical channels.
@informaq.bsky.socialGlobal quantum snapshots enable distinguishing exponentially-many quantum states with only logarithmic measurements through Bayesian classification, with a phase transition at threshold x_c=1/(1-γ) determining decodability success.
@informaq.bsky.socialNovel sum-of-squares hierarchy achieves quadratic convergence for computing optimal success probability in quantum channel coding, improving over prior square-root convergence bounds. Uses polynomial optimization and state-discrimination duality.
@informaq.bsky.socialWe prove that generalized Bures-Wasserstein distance violates the data processing inequality for dimensions n≥3, while deriving sufficient conditions for qubit systems to satisfy it. This resolves an open problem in quantum information theory.
@informaq.bsky.socialNew multiplicative adversary derivation recovers fine-grained quantum query complexity bounds for approximate counting, providing direct analysis of Hamming-weight layer evolution and explicit query-level progress tracking.
@informaq.bsky.socialFirst-order λϕ⁴ interactions violate the area law for entanglement entropy on fuzzy spaces, revealing extensive bulk contributions rather than boundary-dominated behavior—connecting to UV/IR mixing in noncommutative field theories.
@informaq.bsky.socialResearchers rigorously prove quantum channels violate Rényi entropy additivity using computer-verifiable certificates. This fundamental finding challenges assumptions about how information combines in quantum systems.
@informaq.bsky.socialNew framework for convex optimization on moment polytopes yields first efficient algorithms for computing quantum functionals and tensor parameters with quantitative convergence rates.
@informaq.bsky.socialResearchers introduce 'contact order' to predict when new subsystems join multipartite entanglement. Using geometric analysis, they show entanglement can cascade through interaction steps even when direct channels are forbidden by symmetry.
@informaq.bsky.socialCollective local quantum processing enables significant copy-complexity improvements for distributed state discrimination of stabilizer bases (≤3 copies vs unbounded individual), with structure-dependent limits remaining.
@informaq.bsky.socialCurved quantum phase space invalidates Hudson's theorem: SU(1,1) systems host non-Gaussian pure states with non-negative Wigner functions beyond coherent states, fundamentally altering how we define classicality in quantum information theory.
@informaq.bsky.socialMargin-free dependence structures across all local measurement contexts can uniquely reconstruct two-qubit quantum states, revealing how information collectively persists despite being individually discarded context-by-context.
@informaq.bsky.socialFramework for distributed quantum inference establishes tight complexity bounds for state certification under communication constraints, showing shared randomness significantly reduces required quantum state copies.
@informaq.bsky.socialQuantitative lower bounds established on semidefinite program complexity for approximating separable quantum state properties, improving previous quasipolynomial bounds and providing insights into entanglement certification hardness.