Derives universal generalization bounds for learning quantum unitaries across different input distributions, showing real-state training controls complex-state performance exponentially well.

#QuantumLearning #QuantumAlgorithms #Research

Analyzes complexity of redundancy-free quantum Hamiltonians, showing they become tractable at lower inverse temperatures (β∼1/√d vs 1/d) than general Hamiltonians, with NP/QMA-hardness results at higher temperatures.

#QuantumAlgorithms #QuantumComplexity #Research

Rigorous mathematical framework for fermionic quantum computing combines premonoidal categories with scalable diagrammatic languages, enabling circuit compilation and normal forms for practical optimization.

#FermionicQuantum #QuantumAlgorithms #QuantumSoftware

Develops optimal tomography protocols for covariant quantum states and channels with polynomial sample complexity. Resolves the open problem of efficiently implementing the Hayashi measurement via heterodyne detection and quantum Hermite transform.

#QuantumTomography #QuantumAlgorithms #Research

New mathematical bounds improve adiabatic quantum evolution scaling from power laws to logarithmic growth by characterizing how narrowly concentrated the energy gap minimum is, advancing state preparation algorithms.

#AdiabaticQuantum #QuantumAlgorithms #Research

Novel quantum framework enables tunable trade-offs between circuit depth, qubit overhead, and normalization for implementing nonlinear transformations—achieving logarithmic depth with applications to quantum machine learning and image processing.

#QuantumAlgorithms #QuantumML #Research

Algorithm for learning non-Gaussian fermionic states transformed by unknown unitary evolutions using reduced density matrices with polynomial sample and computational complexity, establishing when RDM order suffices for reconstruction.

#QuantumStateLearning #FermionicSystems #QuantumAlgorithms

First quantum algorithm achieving asymptotic speedup over classical algorithms for maximum-weight perfect matching in general graphs. Achieves Õ(nm²/³log W) time, improving on classical Õ(m√n log W) in dense regimes.

#QuantumAlgorithms #GraphAlgorithms #Research

Novel decoding algorithm using rank-decomposition dynamic programming achieves polynomial-time exact maximum-likelihood decoding for quantum error correction on specific code families, outperforming tensor-network methods.

#QuantumErrorCorrection #QuantumAlgorithms #Research

Novel quantum amplitude amplification using weak measurements achieves 18% oracle savings for known target probability and maintains Θ(1/√p) speedup for unknown targets with explicit asymptotic constant analysis.

#QuantumAlgorithms #QuantumSearch #Research

New quantum algorithm solves linear problems in Õ(n⁴/³) time by exploiting amplitude amplification to avoid expensive subspace recovery—improving previous Õ(n³/²) bounds for fast quantum oracles.

#QuantumAlgorithms #QuantumComputing #Research

Extends Hamiltonian learning protocols to handle stochastic parameter evolution via SDEs. Develops quantum sensing and Hamiltonian simulation algorithms retaining Heisenberg-limited scaling under specific noise regimes.

#QuantumSensing #QuantumAlgorithms #Research

New 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.

#QuantumSimulation #QuantumAlgorithms #Research

Quantum 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.

#QuantumAlgorithms #GraphTheory #Research

BLS-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.

#QuantumOptimization #QuantumAlgorithms #Research

Extends 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.

#QuantumAlgorithms #QuantumOptimization #Research

Novel 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.

#QuantumAlgorithms #ProteinFolding #DrugDiscovery

Time-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.

#QuantumAlgorithms #QuantumControl #Research

New optimal algorithms achieve query-optimal simulation of open quantum systems with nearly linear gate complexity for lattice-based implementations.

#QuantumSimulation #QuantumAlgorithms #Research

RL-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.

#QuantumAlgorithms #GroundStatePrep #Research