@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.
@informaq.bsky.socialDevelops quantum algorithms for simulating damped oscillator networks with memory effects, proving BQP-completeness and demonstrating quartic speedups for 3D lattices—with rigorous analysis of when quantum advantages persist under dissipation.
@informaq.bsky.socialNovel quantum algorithm achieves near-linear O(N polylog(N)) gate complexity for the Hermite transform using adaptive averaging windows, improving previous quadratic bounds while maintaining polylogarithmic width.
@informaq.bsky.socialPolynomial-time algorithm recovers algebraic structure in sets with small doubling constants via entropic Ruzsa distance, enabling applications to quantum state tomography and quadratic Fourier analysis.
@informaq.bsky.socialDeveloped a parameter-free diagrammatic framework enabling polynomial-time classical computation of thermal observables in single disorder realizations of the SYK model, with numerical validation against exact diagonalization up to N=24.
@informaq.bsky.socialDeveloped an exact reduction algorithm reducing TCL6 generator evaluation complexity from O(N³_t) to O(N_t log² N_t) operations, enabling practical long-time simulations of non-Markovian quantum systems via dyadic recursion and temporal contractions.
@informaq.bsky.socialIntroduced exact block encodings for 2D elasticity & two-phase Poisson operators via shift decomposition, achieving resolution-independent term counts (17-57 LCU terms) with closed-form subnormalizations—exponentially fewer than generic Pauli expansions.
@informaq.bsky.socialFramework based on higher-order quantum operations enables optimal benchmarking of indirect control strategies via semidefinite programming, identifying when standard unitary approaches are insufficient.
@informaq.bsky.socialNew graph rewrite rules streamline continuous-time quantum walk sequences while preserving quantum gates. Enables more efficient quantum circuit compilation with applications in state preparation and Hamiltonian simulation.