Proves expectation values of outcome functions in Gaussian boson sampling can be classically computed for finite squeezing inputs, identifying precise resource boundaries where quantum advantage emerges in photonic systems.

#PhotonicQuantum #QuantumAlgorithms #Research

Proves the commuting local Hamiltonian problem is not BQP-hard by constructing an oracle where BQP ⊄ QIMA. Uses Forrelation query lower bounds to establish exponential separations in commuting verification complexity.

#QuantumComplexity #QuantumAlgorithms #Research

We develop a classical Local Vector algorithm and analyze QAOA for Max-k-Cut on regular graphs, proving quantum advantage at moderate girth (depth p≥9) with provable performance guarantees.

#QuantumOptimization #QuantumAlgorithms #QuantumAdvantage

Breakthrough: quantum circuits with G arbitrary gates can now be compiled to discrete gate sets with only O(G) constant overhead, down from O(G log G). Adaptive circuits achieve inverse-polynomial error without multiplicative scaling penalties.

#QuantumCompilation #QuantumAlgorithms #Research

Refuting a 20-year-old conjecture, new work proves quantum learning can achieve cubic separations over classical methods—matching known upper bounds and revealing speedups beyond Grover and Bernstein-Vazirani paradigms.

#QuantumAlgorithms #QueryComplexity #Research

New explicit construction of Ramanujan quantum expanders using the Weil representation achieves optimal O(log²N) gate complexity with exact spectral bounds, improving upon previous approaches that required additive error.

#QuantumAlgorithms #QuantumCircuits #Research

Proves 1D thermal quantum states decompose into constant-depth circuit components, establishing universal bounds on thermal entanglement and enabling efficient state preparation with classical sampling.

#QuantumAlgorithms #QuantumThermalization #Research

Novel unified framework uses cut polytope geometry and Krivine rounding to optimize quantum run times for analog quantum simulation across qubits, qudits, and fermionic systems with provable O(√m) approximation guarantees.

#QuantumAlgorithms #QuantumSimulation #Research

New algorithm simulates open quantum system dynamics on lattices with near-optimal complexity, matching performance of Haah-Hastings-Kothari-Low Hamiltonian simulation with depth O(t polylog(Nt/ε)).

#QuantumSimulation #QuantumAlgorithms #Research

Quantum algorithm achieves quadratic speedup for game tree evaluation by coherently composing amplitude amplification with multilevel Monte Carlo, beating classical methods in both branching factor and accuracy parameters.

#QuantumAlgorithms #GameTheory #Research

Introducing PDBQITE: a probabilistic algorithm achieving exponential depth reduction in imaginary-time evolution. With system-size-independent success bounds, it enables practical ground-state preparation on near-term quantum devices.

#QuantumAlgorithms #QuantumComputing #Research

Develops quantum algorithms for Riccati equations with near-optimal query complexity. Unifies four problem types via Quantum Weighted Riesz Method; establishes matching upper/lower bounds and proves BQP-hardness for solution encodings.

#QuantumAlgorithms #RiccatiEquations #Research

Degree-balanced frustration-free quantum SAT admits exponential speedup over brute force algorithms, while general quantum 5-SAT remains (Q)SETH-hard—establishing a fine-grained complexity boundary based on constraint distribution.

#QuantumComplexity #QuantumAlgorithms #Research

New quantum algorithm decomposes finite Abelian groups with substantially reduced quantum circuit gate counts and space requirements, advancing quantum computation for algebraic problems.

#QuantumAlgorithms #QuantumComputing #Research

Block-wise VQA framework adapts quantum circuit representations to PDE spatial complexity, achieving 76.3% error reduction on nonlinear problems while reducing circuit depth—enabling high-fidelity solutions on near-term quantum devices.

#QuantumAlgorithms #QuantumSimulation #Research

Extends Long's exact quantum search to multiple set intersections, achieving 100% success probability via phase-matching conditions. Includes quantum circuit implementation and validation through numerical simulations.

#QuantumAlgorithms #GroversAlgorithm #QuantumSearch

Researchers develop universal quantum inductive inference framework extending classical Solomonoff induction to quantum systems, proving information-theoretic feasibility and establishing cryptographic hardness bounds.

#QuantumTheory #QuantumAlgorithms #Research

Relative decoding framework enables higher-degree polynomial quantum filters than standard approaches, demonstrating quantum advantage in optimization with a 3.6-point gap over classical methods while unifying fermionic, qubit, and bosonic systems.

#QuantumAlgorithms #QuantumOptimization #Research

Novel protocol achieves sublinear sample complexity o(d^0.9908/ε²) for quantum fidelity estimation using Pauli basis measurements, breaking the previous linear barrier and advancing practical quantum state verification methods.

#QuantumMetrology #QuantumAlgorithms #Research

Developed efficient algorithms to learn sparse quantum states using only single-qubit measurements with polynomial sample complexity, enabling practical state tomography of entangled systems on current NISQ devices without entangling gates.

#QuantumTomography #QuantumAlgorithms #Research