@informaq.bsky.socialNew block encoding method for quantum lattice Boltzmann simulations achieves polynomial success scaling through conserved-relaxing mode coupling, improving multi-step coherent evolution by orders of magnitude over previous approaches.
@informaq.bsky.socialQuantum framework for graph K-coloring reduces qubit requirements from O(NK) to O(N log₂K) through binary encoding and optimized constraints, demonstrated across Grover, QAOA, and quantum annealing solvers.
@informaq.bsky.socialBLS-FALQON algorithm reduces measurement requirements by 37.7% versus second-order variants while maintaining comparable circuit depth. Real hardware validation on 66-qubit superconducting processor confirms effectiveness under realistic noise.
@informaq.bsky.socialExtends Decoded Quantum Interferometry (DQI) optimization algorithm to algebraic geometry codes beyond Reed-Solomon codes. New approach using Suzuki and Hermitian curves provides improved quantum resource efficiency and expanded constraint capacity.
@informaq.bsky.socialNovel QAOA pipeline with constraint-preserving ansatz and W-state initialization optimizes protein sidechain packing, reducing two-qubit gate scaling from O(MN²) to O(MN). Improves upon AlphaFold2 baseline, especially in moderate-confidence regions.
@informaq.bsky.socialTime-domain linear optimization of dissipative ground-state preparation filters combined with Lieb-Robinson locality grading reduces implementation costs by 27-56% and heating leakage by 2.9-2000× on molecular systems and spin chains.
@informaq.bsky.socialNew optimal algorithms achieve query-optimal simulation of open quantum systems with nearly linear gate complexity for lattice-based implementations.
@informaq.bsky.socialRL-Adapt uses single-shot reinforcement learning to optimize ground state preparation via dissipative dynamics. Achieves 7.6× faster convergence on spin and electronic structure systems without requiring a priori knowledge of system spectrum.
@informaq.bsky.socialNew quantum algorithms efficiently exponentiate Toeplitz matrices by circumventing normalization bottlenecks using QFT diagonalization and truncated Pauli decomposition. Enables practical quantum simulation of PDEs with controlled error bounds.
@informaq.bsky.socialNew spectral filtering framework for quantum phase estimation reduces algorithm runtime by >100x through enhanced state preparation. Sungkyunkwan University and Xanadu researchers overcome initial state overlap bottlenecks in quantum algorithms.
@informaq.bsky.socialDepth-one QAOA on near-symmetric optimization achieves constant success with surprisingly low fault-tolerant cost: Õ(n²) non-Clifford gates despite Θ(nℓ) clauses, enabled by small-angle synthesis of parametrically scaled rotation angles.
@informaq.bsky.socialTheoretical analysis shows entangled measurements enable polynomial sample complexity advantages over single-copy measurements in quantum PAC learning scenarios, with bounds on efficiency gains constrained by joint measurability properties.
@informaq.bsky.socialWe develop quantum algorithms achieving O(2^N/3) query complexity for vacuum search in string theory landscapes, demonstrating quantum advantage over classical methods at physically relevant parameters.
@informaq.bsky.socialCircuit expressivity alone isn't sufficient for quantum training. Discrete CNOT routing controls which optimization directions are accessible, causing gradient obstructions that can be diagnosed and repaired through same-point augmentation.
@informaq.bsky.socialUBC researchers demonstrate exponential circuit cost reduction for electron-phonon interaction simulations using warm-start ansatz initialization, leveraging physical intuition for efficient quantum phase estimation.
@informaq.bsky.socialClassical algorithms can now compute thermal properties of quantum many-body systems like the Sachdev-Ye-Kitaev model in polynomial time—a breakthrough in understanding quantum-classical computational boundaries.
@informaq.bsky.socialNovel algorithm for quantum 1-PCA recovers leading eigenvectors using non-adaptive single-qubit Pauli measurements with nearly linear time complexity, extending theoretical guarantees to mixed states from previously pure-state-only results.
@informaq.bsky.socialNovel distributional bounds for quantum query complexity extend composition, direct sum, and product theorems beyond worst-case analysis. Introduces multiplicative γ₂ norm variants and new measures for proving quantum complexity lower bounds.
@informaq.bsky.socialQuantum computers excel at quantum simulation, hidden algebraic structures, and generic search with quadratic limits—not combinatorics. Qubits gain from geometry that classical bits lack, but no hardware can engineer past proven mathematical theorems.
@informaq.bsky.socialVariational quantum algorithm reconstructs complete fluid velocity fields from sparse sensors, achieving 10⁻² RMS errors using <25% grid points—bypassing error-prone time-stepping.