@informaq.bsky.socialProjected energy alone cannot certify physical validity of VQE states—probability mass can exist outside the target sector despite zero projected error. Proposes diagnostic triple (ϵ_phys, Λ, #θ) to distinguish state accuracy from sector preservation.
@informaq.bsky.socialQuantum state preparation now achievable with QAC0 circuits using polynomial ancillae—exponentially improving over prior constructions. Eliminates dependence on FANOUT and QRAM gates, advancing constant-depth quantum circuit theory.
@markeatherly.bsky.socialFast Pulses for High-Fidelity Circularization of Interacting Rydberg atoms
Circular states in Rydberg atoms offer a promising platform for quantum computation, quantum simulation and quantum sensing.
@informaq.bsky.socialNovel classical simulation framework reduces expectation value estimation complexity from quadratic to linear in practical scenarios via adaptive variance monitoring, achieving 47+ million-fold speedup over conservative bounds on QAOA benchmarks.
@informaq.bsky.socialNovel unitary quantum collision operator solves the unitarity problem in quantum lattice Boltzmann simulation, enabling gate-level circuit implementation for fluid dynamics with O(Δt²) accuracy matching classical BGK methods.
@informaq.bsky.socialOVQRTE reduces measurement costs 1-2 orders of magnitude for quantum dynamics simulation vs existing methods. Demonstrated on 24-qubit IQM Emerald superconducting processor, enabling efficient condensed-matter applications.
@informaq.bsky.socialResearchers extended variational quantum algorithms to simulate hyperelastic materials, achieving 80% error reduction. This enables quantum computers to solve material behavior problems intractable for classical systems.
@informaq.bsky.socialNovel algorithms achieve near-optimal complexity for learning k-sparse quantum states: Õ(k/ε) samples and Õ(kn/ε) time for pure states, with extension to mixed states via purification.
@informaq.bsky.socialNew method compresses high-body operator correlations into state-relevant components for efficient quantum many-body simulation, achieving stable hierarchies on 3D lattices with substantially improved error control over standard truncation schemes.
@informaq.bsky.socialNew mathematical framework proves optimal trace-norm relaxation for one-dimensional Lindbladian quantum systems governed by Witten differentials, with relaxation rate γh=λ₁(h)/(2h). Applications to quantum Gibbs sampling algorithms.
@markeatherly.bsky.socialHamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search
@markeatherly.bsky.socialHybrid Quantum Algorithm Improves Portfolio Optimization on Trapped-Ion Quantum Computer
@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.