Fixing Divergence in Carleman Linearization via Analytical Continuation

Nonlinear differential equations play a crucial role in modeling a wide range of phenomena, yet their solutions remain notoriously difficult to obtain.

#QuantumAlgorithms

Post-optimization subspace corrections reduce adaptive iterations by 6-fold and measurement costs by 40-fold in ADAPT-VQE quantum chemistry simulations on near-term quantum hardware.

#QuantumAlgorithms #QuantumChemistry #Research

Hybrid quantum-classical algorithms that continuously interpolate between classical random walks and fully coherent quantum searches, achieving smooth depth-query tradeoffs for spatial search on graphs.

#QuantumAlgorithms #QuantumWalks #Research

We prove tight query complexity bounds for unstructured search in multimode bosonic systems under energy constraints. Non-Gaussianity—not entanglement—enables optimal quantum speedup. Coherent-state protocols suffice under strong loss.

#QuantumAlgorithms #BosionicQuantum #Research

New quantum algorithms for high-dimensional integration achieve one convergence order improvement over deterministic classical methods using Faber-Schauder decomposition, with optimal lower bounds proven up to logarithmic factors.

#QuantumAlgorithms #NumericalAnalysis #Research

VIRAL, a classical algorithm, now provides stronger provable bounds for Max-Cut on high-girth regular graphs than the quantum approximate optimization algorithm (QAOA), challenging quantum advantage claims in this computational regime.

#QuantumAlgorithms #MaxCutOptimization #Research

Improves quantum sample complexity for learning Fourier-sparse Boolean functions from O(k^1.5 log²k) to Õ(k) via symmetric differences and multilinear majority polynomials, achieving near-optimal bounds and closing a decade-long theoretical gap.

#QuantumLearning #QuantumAlgorithms #Research

Combines deterministic graph reductions and QAOA sampling to enumerate all optimal solutions for phylogenetic reconstruction. Demonstrates 36% variable reduction on SARS-CoV-2 data while outperforming random sampling on 64-qubit hardware.

#QuantumAlgorithms #QuantumOptimization #Bioinformatics

Introduces scheduled trotterization achieving O(N^-2) error scaling for quantum simulation by varying pulse weights to coherently suppress accumulated Trotter errors, doubling convergence rate versus standard methods.

#QuantumAlgorithms #QuantumSimulation #QuantumControl

Researchers achieve O(N^8/7) T-gate count for quantum unitary synthesis—improving from O(N^5/4)—using block-sparse Hamiltonian simulation and random flattening. Establishes near-optimal bounds within sequential block-SELECT model.

#QuantumAlgorithms #FaultTolerance #QuantumComputing

Novel factorization algorithm for QSP eliminates Prony's method using logarithmic derivatives and Newton-Girard identities, achieving O(d log² d) complexity with 10⁻¹² accuracy on Hamiltonian simulation and matrix inversion problems.

#QuantumAlgorithms #QuantumComputing #Research

Establishes parity-dependent harmonic reductions revealing explicit 8D dynamical factor in odd dimensions; shows states with exponentially vanishing support maintain full Hamming diameter, proving persistent obstruction to uniform mixing.

#QuantumAlgorithms #QuantumWalks #Research

New Mirror Subspace Diagonalization algorithm reduces sampling costs for quantum Krylov algorithms by 10-10,000x through finite-difference time-evolution formulas, enabling efficient ground-state energy estimation for large electronic structure problems.

#QuantumAlgorithms #QuantumComputing #News

New ASPIRE algorithm efficiently prepares quantum states by exploiting entanglement geometry and hardware connectivity, achieving higher fidelity and shallower circuits than existing methods for long-range entanglement systems.

#QuantumAlgorithms #StatePreparation #Research

Quantum decoders enable Gibbs state preparation at lower temperatures than classical methods. QD-HDQI algorithm achieves quantum advantage for certain Hamiltonians using channel-coding perspective with symplectic codes.

#QuantumAlgorithms #GibbsSampling #Research

Extended classical Dobrushin-Shlosman mixing theory to noncommuting quantum systems. Achieves logarithmic mixing times for Gibbs state preparation at all finite temperatures with single-exponential temperature dependence and nearly-linear gate complexity.

#QuantumAlgorithms #ThermalStates #Research

Breakthrough: First polynomial-time algorithms for testing multipartite quantum separability and computing nuclear tensor norms. Novel approach combines spectral compression and multiprover game theory to overcome fundamental complexity barriers.

#QuantumAlgorithms #QuantumInformation #Research

Researchers achieved improved inverse-free quantum gate compilation with exponents ~2.138 (Pauli gates) and ~2.988 (general gates), surpassing information-theoretic bounds and advancing optimal polylogarithmic compilation.

#QuantumAlgorithms #QuantumCompilation #Research

Proven optimal kernel functions for LCHS quantum simulation achieve ~2.1× query-cost improvement over numerical methods, with spectrally convergent quadrature preserving the asymptotic improvement for practical implementation.

#QuantumAlgorithms #QuantumSimulation #Research

Novel quantum algorithms for simulating Schrödinger dynamics on curved configuration spaces, with explicit methods for tori, spheres, simplices, and general compact manifolds—enabling quantum simulation of field theories and geometric optimization.

#QuantumSimulation #QuantumAlgorithms #Research