US officials push quantum manufacturing to hold lead over China
A quantum-primacy commission says China's factories and supply chains could erode US research and investment strengths.
Stories per day · 30 days
5 RSS
Relatedanthropic2acquisition1ai-agents1arxiv1barren-plateaus1china1circuit-design1circuit-optimization1ciso1classiq1claude1combinatorial-optimization1compressed-oracles1evolutionary-search1export-controls1fable1formal-verification1ghz-state1
34 stories, newest first · one card per story
Stories tagged #quantum-computing
PSI says Anthropic's Fable 5.2 solved a quantum conjecture
Scott Aaronson says he does not fully follow the proof but accepts it after Lean autoformalization.
Paper sets out information-flow security proofs for quantum programs
Noninterference and simulation-based definitions are proved equivalent, with verification via quantum Hoare logic and self-conjugation.
Tree-Ising repairs Qwen reasoning loops with sparse BF16 edits
On two layers it scores 54.6% on MATH-500 versus 51.7% for a GPT-6 Astra edit and 7.9% for the base model.
AI discovers formally verified quantum programs
LLM agents synthesize novel quantum programs in Lean and verify them, improving baselines by up to 290x.
Quantum PIR scheme for forest graphs achieves rate 3/N
The scheme uses GHZ state and achieves rate 3/N for forest graphs, more efficient than prior work, with capacity 4/6 for G=3K_2.
CISOs outline 2027 strategies with AI automation and passwordless systems
Equifax CISO Jeremy Koppen and others emphasize AI-driven operations, tailored risk ratings, and identity controls for enterprise AI agents in 2027.
Compressed Oracle Duality Framework for Quantum Adversaries
New isometry-based framework extends Compressed Oracle method for space-bounded quantum adversaries.
Barren plateaus analyzed for quantum linear combinations of unitaries
A single-pass LCU keeps a gradient-variance lower bound, while interleaved Haar sampling can concentrate exponentially.
Classical clients can privately use one untrusted quantum server
Assuming post-quantum LWE hardness, the protocol also yields classical verification of quantum sampling and remote state preparation.
Designing more efficient quantum circuits with Claude
Claude Mythos 5 autonomously designed quantum circuits that beat published designs, sometimes by an order of magnitude.
Learning angles for quantum approximate optimization
Learned models predict high-quality QAOA angles in one pass, matching slower per-instance solvers.
Discovering state-of-the-art quantum circuits with large language models
LLM-guided evolutionary search finds quantum circuits that cut Toffoli and qubit costs on seven of eight tasks.
Quantum computers could break today’s encryption. Washington needs to prepare now.
Lawmakers are urged to speed the U.S. post-quantum cryptography transition before quantum computers break current encryption.
2
Cisco quantum network controller lets apps order entanglement on demand
Cisco’s Quantum Network Controller prototype lets applications order entanglement on demand across a shared fabric.
2
Pareto-optimal quantum kernel selection for unsupervised anomaly detection on real malware beaconing data
Pareto quantum-kernel selection on real malware beaconing slightly beats a classical one-class SVM baseline.
Tight Query Lower Bounds for Quantum Sampling, with an Application to Certified Randomness
Tight quantum query bounds show high XEB scores certify near-ideal randomness from untrusted samplers.
Unitary complexity in polynomial space
Proving quantum commitments exist unconditionally requires solving either the unitary synthesis problem or the BPP vs NEXP question, linking cryptographic assumptions to classical complexity open problems.
Exponential quantum speedup for $\mathbb{F}_3^n$-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE
Quantum algorithms solve ternary vector subset-sum with fewer samples, backed by rigorous classical binary-error LWE methods.
Verifiable quantum advantage based on polynomials with planted structures
Researchers propose verifiable quantum advantage using planted cubic IQP polynomials and a faster classical cross-entropy check.
On quantum interactive proofs with a laconic prover
A complexity paper characterizes two-message quantum proofs with short prover messages via state distinguishability.
Repairability of Inexact Solvers in Recursive State Estimation with Machine Learning
A certified repair framework evaluates inexact and quantum linear solvers inside Kalman estimation, including a power-grid study.
Quantum ROP: Using Quantum Algorithms for ROP Chain Selection in Exploit Construction
Researchers apply QAOA on IBM Heron hardware to select ROP chains that escalate Linux privileges.
New lower bounds for CDS and $f$-routing
New lower bounds tie robust CDS randomness to communication complexity and inner-product routing entanglement to sign rank.