Demonstrates QAOA solving pilot contamination in massive MIMO through constraint-aware quantum optimization. Achieves near-exhaustive search performance, validating quantum algorithms for wireless resource allocation.
@informaq.bsky.social
@informaq.bsky.socialDemonstrates QAOA solving pilot contamination in massive MIMO through constraint-aware quantum optimization. Achieves near-exhaustive search performance, validating quantum algorithms for wireless resource allocation.
@informaq.bsky.socialNovel quantum implementation of the Jacobi iterative method using QSVT that achieves constant ancilla overhead and linear circuit depth, demonstrated on Poisson problems including the pressure equation in computational fluid dynamics.
@informaq.bsky.socialFirst gate-based VQE solution of the homogeneous Bethe-Salpeter equation for relativistic scalar bound states demonstrates low entanglement and classical tractability—identifying extensions where genuine quantum advantage becomes plausible.
@informaq.bsky.socialResolves a key open problem by proving the conjectured lower bound Ω(κ√s log(1/ε)) for quantum linear system solvers in sparse-access models, establishing tight complexity dependence on condition number, sparsity, and target precision.
@informaq.bsky.socialThailand's Chulalongkorn University and South Korean Qunova Computing partner on hybrid quantum-classical algorithms for industrial applications in chemistry, materials science, and finance via cloud-based QPU access.
@informaq.bsky.socialUK-based quantum algorithms company Phasecraft is establishing U.S. headquarters in Arlington County with $113K investment and 19 new jobs, advancing quantum computing development in the U.S.
@informaq.bsky.socialResearchers achieved a 10x improvement in Macaulay system conditioning for Learning Parities with Structured Noise, reducing quantum circuit requirements for secure communication and machine learning applications.
@informaq.bsky.socialComplete characterization of isometry groups for right invariant Riemannian metrics on SU(2N), enabling rigorous geometric approaches to quantum complexity analysis with applications to holographic duality and circuit complexity bounds.
@informaq.bsky.socialWQSP extends QSP with weighted signal operators, achieving exponential reductions in circuit depth and trainable parameters for polynomial approximation while maintaining accuracy—enabling compact activation functions for quantum neural networks.
@informaq.bsky.socialA patent filing describes quantum algorithms for CT image reconstruction, using projection transformation quantization to simplify and reliably match computed tomography images to actual projection data.
@informaq.bsky.socialIndian Institute of Science demonstrates appending construction technique for CSS codes, enabling implementation of multiple logical Z-rotations through transversal operations without code switching.
@informaq.bsky.socialXinyu Tan's algorithm achieves 4n/3 T-gate count for arbitrary n-qubit unitaries, surpassing the previous 3n/2 limit—advancing quantum circuit optimization.
@informaq.bsky.socialNovel quantum algorithm for Gibbs state preparation reduces to classical sampling, enabling efficient computation in low-temperature and topological regimes (like Toric code) previously inaccessible to quantum computers.
@informaq.bsky.socialResearchers developed a diagrammatic method to calculate thermal properties of complex quantum systems using classical computing, validating for up to 24 fermions and bypassing expensive quantum simulations.
@informaq.bsky.socialEPFL researchers proved quantum interactive proof systems can verify solutions with perfect certainty using only 1-2 communication rounds instead of 3+. Uses block-encoded matrices and turn-halving transformations, resolving longstanding protocol limits.
@informaq.bsky.socialComprehensive review of Suzuki-Trotter methods for quantum time evolution, featuring state-of-the-art error bounds, efficient high-order schemes, and practical guidance for quantum simulations on classical and quantum hardware.
@informaq.bsky.socialNovel quantum algorithm solves linear systems Ax=b with optimal O(κ_A log(1/ε)) matrix-query complexity using ODE-based Schrödingerization, avoiding variable-time amplitude amplification through kernel construction and interval recovery techniques.
@informaq.bsky.socialResearchers demonstrate quantum circuit implementation of FIR filters using a composable state-space framework with potential for parallel processing speedups via quantum amplitude estimation and future fault-tolerant quantum computers.
@informaq.bsky.socialProves the ground state energy of quantum p-spin Hamiltonians achievable by product states converges to a limit expressed via Parisi-type variational formula. Establishes universality across non-Gaussian interaction distributions.
@informaq.bsky.socialProves quantum algorithms require exponential Ω(2^(n/24)) queries to find entrance-to-exit paths in welded trees, settling an open question about quantum speedup extent using compressed oracle analysis.