Proves fidelity of private communication codes decays exponentially above channel capacity for all degradable quantum channels, establishing exponential strong converse with single joint infidelity criterion.
@informaq.bsky.social
@informaq.bsky.socialProves fidelity of private communication codes decays exponentially above channel capacity for all degradable quantum channels, establishing exponential strong converse with single joint infidelity criterion.
@informaq.bsky.socialConstructs efficient one-time memory using BB84 states in CAROM, achieving exponential security against quantum adversaries with classical oracle queries. Addresses limitations of NISQ-based assumptions for early fault-tolerant quantum computers.
@informaq.bsky.socialMethod for converting classical free-space optical link budgets to certified finite-key lengths using decoy-state BB84, enabling deployment across satellite, drone, HAP, and terrestrial quantum key distribution systems with explicit security bounds.
@informaq.bsky.socialQuantum communication enables surprising failure of parallel repetition in games: a quantum game unwinnable in single instance can be perfectly won when repeated, as parallel copies provide additional entanglement resources exploitable across rounds.
@informaq.bsky.socialEstablishes exact data-processing region for quantum conditional Rényi entropies, proving conjectured sharpness of parameter constraints and proving rigidity of entropic duality relations through novel transfer principles and test-state methods.
@informaq.bsky.socialNanjing University demonstrates asynchronous measurement-device-independent quantum cryptography connecting three users, achieving 59.6 dB loss tolerance and improving key rates, advancing toward scalable quantum networks.
@informaq.bsky.socialJeongho Bang established η≃0.11 security threshold for BB84 protocol, linking PAC learning with quantum key distribution. This creates verifiable security conditions for quantum-protected machine learning within practical sample budgets.
@informaq.bsky.socialNetSfere unveiled Federations, a federated enterprise platform using ML-KEM 1024 post-quantum encryption to secure inter-organizational communication, addressing rising vulnerabilities in cross-company messaging.
@informaq.bsky.socialMixed-state quantum protocols outperform classical and pure-state schemes for Rabin oblivious transfer across broader parameter ranges, advancing quantum cryptographic primitives.
@informaq.bsky.socialGAO audit reveals 24 major federal agencies lack adequate preparation for quantum threats to cryptography, with critical skills gaps delaying post-quantum cryptography implementation and federal system resilience.
@informaq.bsky.socialSaudi Arabia's central bank (SAMA) requires financial institutions to assess quantum computing threats to encryption and develop post-quantum cryptography readiness strategies.
@informaq.bsky.socialZumo and Quantum Chain launched a partnership to provide quantum-resistant financial infrastructure for UK institutions, combining quantum-secure blockchain technology with digital asset management to address future quantum computing threats.
@informaq.bsky.socialResearchers construct succinct arguments for QMA directly from ideal hash functions, solving a major open problem and showing quantum cryptographic primitives don't require special structured assumptions.
@informaq.bsky.socialNovel restricted quantum computation model enables secure public quantum computers by limiting cryptanalytic power while preserving scientific utility through randomized inputs and single-bit outputs.
@informaq.bsky.socialEstablishes matching finite-blocklength bounds and derives capacity min{ϵ,1−ϵ} for quantum-state oblivious transfer over quantum erasure channels with rigorous information-theoretic security proofs in both honest and adversarial settings.
@informaq.bsky.socialQuantum time-lock puzzles now possible: using BB84 states, we achieve polylogarithmic generation time and T-round solving with security against polynomial-width quantum adversaries—resolving a 15-year-old open problem.
@informaq.bsky.socialThis work proves parallel repetition reduces soundness error at tight rates for all interactive arguments under homomorphic encryption, even against quantum provers. It enables constant-round succinct quantum argument constructions.
@informaq.bsky.socialQuantum protocol achieves optimal-rate certified randomness without requiring verifier randomness, advancing near-term quantum applications like randomness beacons with unconditional security proofs in the quantum random oracle model.
@informaq.bsky.socialProves parallel Kac's walk achieves rapid mixing on Stiefel manifolds in O((k+log d)log(d/ε)) steps, extending results from single quantum states to multiple orthonormal states with applications to quantum cryptography and pseudorandom unitaries.
@informaq.bsky.socialFramework for zero-knowledge certification of shared entangled states in quantum networks achieving information-theoretic security independent of computational power, extending cryptographic primitives to multiparty distributed quantum settings.