How Hard Is Quantum Advantage? A Cloud Microphysics Stress Test for Variational Quantum Models
@markeatherly.bsky.social
@markeatherly.bsky.socialHow Hard Is Quantum Advantage? A Cloud Microphysics Stress Test for Variational Quantum Models
@markeatherly.bsky.socialQoreChain Demonstrates End-to-End Post-Quantum Blockchain Transaction
@informaq.bsky.socialResolves a longstanding open question by constructing a total Boolean function achieving Q(f) = Õ(⁴√C(f)), proving the maximum gap between certificate complexity and quantum query complexity is quartic (up to logarithmic factors).
@informaq.bsky.socialIntroduces gradBEA algorithm for optimizing tensor network states in quantum simulations. Achieves order-of-magnitude faster convergence and lower ground state energies than previous methods on 2D lattice models and Fe4S4 clusters.
@informaq.bsky.socialResolving a 20-year-old conjecture: oracle separations proved between all consecutive levels of the Fourier hierarchy, establishing that each additional Hadamard layer strictly increases quantum computational power.
@informaq.bsky.socialProves three quantum complexity classes are equivalent using dimension-free stability bounds for symmetric tensor states, resolving open conjectures about pure-state quantum proof systems and their relationship to standard QMA.
@informaq.bsky.socialResearchers identified necessary and sufficient conditions for Arimoto-Blahut algorithms to achieve global optimality in quantum information problems using constraint normal space analysis, surpassing previous methods limited to numerical stability.
@informaq.bsky.socialResearchers proved one-way one-round quantum LOCAL algorithms cannot four-color directed cycles, even with unlimited resources. Study establishes fundamental computational boundaries for distributed quantum systems.
@informaq.bsky.socialResearchers at National Taiwan University developed an improved quantum simulation method reducing circuit complexity from O(n²) to O(n). They overcame limitations in modeling relativistic particles and validated results on IBM Quantum processors.
@informaq.bsky.socialSIM-GRAPH leverages quantum system symmetries to reduce calculations from months to seconds, enabling analysis of systems with up to 60 spins—a scale previously inaccessible due to computational constraints.
@informaq.bsky.socialResearchers develop unified framework using block-encoding, qubitization, and QSP to streamline quantum algorithm construction. Achieves 5x efficiency gain by systematically translating complex matrix functions to quantum circuits.
@informaq.bsky.socialImproved quantum state preparation algorithm reduces Toffoli gate overhead by ~log(s)/2 for sparse states. Critical for quantum simulation and linear-system solvers on near-term devices.
@informaq.bsky.socialResearchers proved optimal sample complexity for learning low-rank quantum states, demonstrating that jointly measuring t samples improves over single-sample tomography by factor √t, with matching algorithmic and information-theoretic bounds.
@informaq.bsky.socialIntroducing transport vectors that encode quantum walk asymptotic drift: two losing strategies create a winning one when their combined transport vector escapes the cone of individual ones. A geometric criterion explains minimal realizations.
@informaq.bsky.socialVariational quantum algorithm encodes spacetime solutions in single quantum state to reconstruct nonlinear fluid dynamics from sparse measurements. Demonstrates 10^-2 RMSE on Burgers & Kuramoto-Sivashinsky equations using ≤25% spatial sensor coverage.
@informaq.bsky.socialSpectral core-tail framework for quantum Gibbs state preparation: separates thermal populations from basis transforms, enables rigorous local error certification, and achieves quadratic residual reduction through structured Schrieffer-Wolff reduction.
@informaq.bsky.socialProves all 2-dimensional fermionic QCAs decompose into local automorphisms and primitive shifts, establishing they lack nontrivial dynamics and advancing understanding of higher-dimensional quantum systems.
@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.socialUnified framework connecting block-encoding, qubitization, QSP, QSVT & GQSP for quantum algorithms. Introduces systematic workflow for selecting optimal polynomial transformation approach with near-optimal query complexity.
@informaq.bsky.socialQuantum algorithm for wave propagation achieves polylogarithmic complexity by directly preparing states on resonant manifolds, eliminating exponential post-selection overhead and enabling simulations of km-scale domains.