Quantum hardness separation extends Bennett-Gill question
Conditional oracle separation shows structured quantum hardness can arise from unstructured assumptions.
Stories per day · 30 days
3 RSS
Relatedcomplexity2nemotron2nvidia2aes-1281communication-complexity1cosmos1cryptography1dns1dnssec1error-correction1evaluation1generative-flow-networks1grover1gtld1hardness1healthcare1icann1investment1
31 stories, newest first · one card per story
Stories tagged #quantum
GFlowQEC generative flow networks sample quantum LDPC codes more effectively
GFlowQEC finds more than twice as many top-scoring codes as parallel tempering when ranking ten draws per paid evaluation.
Oracle separations show proofs of quantumness coexist with P=NP
Oracle relative to which P^O = NP^O, BQP^O = PSPACE^O and IP^O subset BQP^O is hard on average against P^O/poly.
Quantum MPC from random oracle requires Omega of circuit size communication
New lower bounds show random oracle cannot reduce online communication in information-theoretic MPC and that quantum-accessible oracles with classical communication yield no savings.
ICANN speeds quantum-safe DNSSEC work as larger keys strain DNS
Crain now puts readiness at three to five years, not ten, while Category 1 domains show 45 percent higher abuse odds.
NVIDIA announces open models for language, robotics, biology and quantum
The portfolio adds Nemotron 3.5, Kumo, Cosmos 3.5, Alpamayo 2 Edge, BioNeMo RFD4-Proteina and Ising.
Quantum-Aware Key Rank for Side-Channel Attacks evaluation
Researchers define a quantum-aware key rank for side-channel labs facing a quantum search adversary.
NVIDIA Announces New Investments in the UK Startup Ecosystem
NVIDIA plans new UK startup investments and a $250 million compute commitment for agentic safety research.
IonQ to buy zero-trust security firm Elisity in deal valued at up to $1.3 billion
IonQ will acquire zero-trust firm Elisity for up to $1.3 billion to pair access control with post-quantum security.
Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial Intersection
New bounds break Shamir secret sharing's one-half local-leakage barrier and improve optimal polynomial intersection.
Certifying Hidden Paths: Scalable Topology Assurance for QKD Networks
A zero-knowledge scheme lets QKD providers certify policy-compliant routes without revealing network topology.
Adaptive-Shot Hybrid Quantum Anomaly Detection for Tactile Internet Security: Reliability-Aware Measurement Allocation Under Resource Constraints
Adaptive-shot quantum anomaly detection cuts Tactile Internet measurement cost with under 1% decision disagreement.
Quantum Advantage for Two-Party Differential Privacy
A quantum protocol estimates two-party Hamming distance with constant information-theoretic differential-privacy error, beating classical square-root limits.
On the pseudorandomness of simple quantum processes
Simple local quantum processes can match unitary designs yet remain efficiently distinguishable from truly random unitaries.
Trapdoored Clifford Operators and Applications
Authors construct trapdoored Clifford operators that look random but implement much faster with a secret trapdoor.
Learnt Attacks on Quantum Key Distribution under Channel Noise and Device Drift
Reinforcement learning finds compact eavesdropping circuits that nearly match upper bounds on noisy, drifting QKD links.
QUFIG: GNN-Based Prediction of Quantum Fault Injection Vulnerabilities with Gate-Level Precision
QUFIG uses a circuit-DAG GNN to rank quantum gates by fault-injection impact under limited fidelity budgets.
Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering
New non-malleable codes reach rate nearly 1/5 against entangled quantum split-state tampering.
Succinct Arguments for QMA in the Quantum Random Oracle Model
Researchers give the first succinct argument for QMA in the quantum random oracle model from unstructured hardness.
Four Cyber Threats Harboring Big Plans for the Future
SecurityWeek outlines AI, supply-chain, quantum, and geopolitical cyber risks and urges continuous resilience.
Quantum Leakage Resilience of Shamir Secret Sharing
Shamir secret sharing stays quantum-leakage resilient above a threshold rate near 0.73, unless entanglement is unbounded.
Succinct Arguments for QMA from Collapsing Hash Functions
Researchers prove succinct arguments for QMA from collapsing hash functions, without public-key assumptions.
Quantum random numbers can pass the tests and still leak clues to attackers
ETSI guidance warns quantum RNGs can pass statistical tests yet still leak predictable clues.
Computational Cryptography from Pseudoentanglement
Researchers show efficient pseudoentanglement implies EFI pairs, tying it to minimal quantum-crypto assumptions.