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

Develops 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.
Novel 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.
Polynomial-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.
Developed 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.
Developed 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.
Introduced 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.
Framework based on higher-order quantum operations enables optimal benchmarking of indirect control strategies via semidefinite programming, identifying when standard unitary approaches are insufficient.
New 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.
Projected energy alone cannot certify physical validity of VQE states—probability mass can exist outside the target sector despite zero projected error. Proposes diagnostic triple (ϵ_phys, Λ, #θ) to distinguish state accuracy from sector preservation.
Quantum state preparation now achievable with QAC0 circuits using polynomial ancillae—exponentially improving over prior constructions. Eliminates dependence on FANOUT and QRAM gates, advancing constant-depth quantum circuit theory.
Fast Pulses for High-Fidelity Circularization of Interacting Rydberg atoms
Circular states in Rydberg atoms offer a promising platform for quantum computation, quantum simulation and quantum sensing.
Novel classical simulation framework reduces expectation value estimation complexity from quadratic to linear in practical scenarios via adaptive variance monitoring, achieving 47+ million-fold speedup over conservative bounds on QAOA benchmarks.
Novel unitary quantum collision operator solves the unitarity problem in quantum lattice Boltzmann simulation, enabling gate-level circuit implementation for fluid dynamics with O(Δt²) accuracy matching classical BGK methods.
OVQRTE reduces measurement costs 1-2 orders of magnitude for quantum dynamics simulation vs existing methods. Demonstrated on 24-qubit IQM Emerald superconducting processor, enabling efficient condensed-matter applications.
Researchers extended variational quantum algorithms to simulate hyperelastic materials, achieving 80% error reduction. This enables quantum computers to solve material behavior problems intractable for classical systems.
Novel algorithms achieve near-optimal complexity for learning k-sparse quantum states: Õ(k/ε) samples and Õ(kn/ε) time for pure states, with extension to mixed states via purification.
New method compresses high-body operator correlations into state-relevant components for efficient quantum many-body simulation, achieving stable hierarchies on 3D lattices with substantially improved error control over standard truncation schemes.
New mathematical framework proves optimal trace-norm relaxation for one-dimensional Lindbladian quantum systems governed by Witten differentials, with relaxation rate γh=λ₁(h)/(2h). Applications to quantum Gibbs sampling algorithms.
HamQASBench: A Hamiltonian-Informed Diagnostic Benchmark for Evaluating Quantum Architecture Search
Hybrid Quantum Algorithm Improves Portfolio Optimization on Trapped-Ion Quantum Computer