@informaq.bsky.socialResearchers prove p-torsion detection in homology is NP-hard and develop a quantum algorithm achieving near-quadratic speedup. Extends quantum TDA beyond Betti numbers with direct applications to quantum rotor codes and gauge theory.
@informaq.bsky.socialResearchers develop exact, certified algorithms to compute quantum speedup exponents in key guessing attacks, revealing super-quadratic quantum advantages up to 3.97× in realistic cryptanalytic scenarios with product-distributed advice.
@informaq.bsky.socialNew quantum score matching framework extends classical learning technique to quantum states, achieving optimal sample complexity for high-temperature Gibbs states. NISQ-friendly implementation on IBM hardware reduces parameter error from 64% to 10%.
@informaq.bsky.socialResearchers derive how encoding choices shape frequency redundancy in quantum fourier models, proving they converge to Gaussian distributions—critical for designing unbiased quantum machine learning models.
@informaq.bsky.socialNew MEFPIA algorithm achieves faster convergence to equilibrium in quantum games compared to MMWU, with reduced computational costs through tensor-contraction optimization for multi-agent quantum system decision-making.
@informaq.bsky.socialNovel eigenphase engineering technique enables Heisenberg-limited learning of sparse k-local Hamiltonians with near-maximal step size—matching best known total evolution time while removing precision-dependent bottlenecks in quantum control.
@informaq.bsky.socialResearchers achieved strong matchgate k-designs with near-optimal circuit depth O(k²rt(G)logn log(n/ε)), enabling exponential speedup for fermionic algorithms on quantum computers with all-to-all connectivity compared to one-dimensional architectures.
@informaq.bsky.socialNew formulation of the multiplicative adversary method yields the strongest quantum query lower bounds yet, enabling first time-space tradeoffs for general quantum algorithms and proving list-decoding theorems extending classical results.
@informaq.bsky.socialNew algorithm efficiently simulates large open quantum systems through low-rank ensemble propagation, eliminating quadratic memory scaling and achieving near-linear complexity with 100x speedup over existing methods.
@informaq.bsky.socialGAMPS achieve near-maximal volume-law entanglement with modest bond dimensions, requiring exponentially smaller resource overhead than unaugmented matrix product states for quantum simulation.
#QuantumTensorNetworks #QuantumSimulation #QuantumAlgorithms
@informaq.bsky.socialNovel Schrödingerization algorithm achieves optimal O(κ_A log(1/ε)) query complexity for quantum linear systems, with linear condition-number scaling without VTAA via block preconditioning and interval recovery.
@informaq.bsky.socialKvantify's Koffee and Qrunch tools leverage the variational quantum eigensolver for quantum chemistry applications, enabling simulations of 60-80 qubits using Nvidia's DGX-Spark infrastructure for practical quantum advantage.
@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.