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/ε)).
@informaq.bsky.social
@informaq.bsky.socialNew 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/ε)).
@informaq.bsky.socialQuantum 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.
@informaq.bsky.socialIntroducing 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.
@informaq.bsky.socialDevelops 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.
@informaq.bsky.socialDegree-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.
@informaq.bsky.socialNew quantum algorithm decomposes finite Abelian groups with substantially reduced quantum circuit gate counts and space requirements, advancing quantum computation for algebraic problems.
@informaq.bsky.socialBlock-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.
@informaq.bsky.socialExtends 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.
@informaq.bsky.socialResearchers develop universal quantum inductive inference framework extending classical Solomonoff induction to quantum systems, proving information-theoretic feasibility and establishing cryptographic hardness bounds.
@informaq.bsky.socialRelative 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.
@informaq.bsky.socialNovel 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.
@informaq.bsky.socialDeveloped 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.
@informaq.bsky.socialSettles quantum complexity of identifying hidden symmetries in quantum states, proving O(log|G/H|/√ε) query complexity with state-preparation access versus O(log|G/H|/ε) with copies—establishing quadratic separation and matching lower bounds.
@informaq.bsky.socialResearchers prove tight Θ(κ√d log(1/ϵ)) query bounds for quantum linear systems solvers, matching upper and lower bounds. This resolves complexity gaps and enables optimal black-box unitary implementation with O(√N) queries.
@informaq.bsky.socialTwo new quantum algorithms achieve tight query complexity bounds for ground-state preparation: one with optimal expected-case complexity O(α/γ∆ + α/∆·log(1/ε)) and another with optimal worst-case bounds. Matching lower bounds prove optimality.
@informaq.bsky.socialNew quantum circuit design enables garbage-free Gaussian elimination over any finite field, generalizing beyond GF(2). Achieves optimal Toffoli depth while maintaining minimal qubit overhead—advancing quantum algorithm implementation.
@informaq.bsky.socialAchieving optimal copy complexity for quantum spectrum estimation through Chebyshev moment matching. Algorithm matches recent lower bounds, advancing efficient quantum measurement and state learning strategies.
@informaq.bsky.socialNew variational method simulates stochastic quantum dynamics efficiently, capturing non-Gaussian correlations beyond semiclassical limits. Key finding: symmetry-breaking phase transitions survive in 2D but vanish in 1D lattices.
@informaq.bsky.socialResearchers at Huazhong University developed a quantum lattice Boltzmann method achieving sixfold accuracy improvement by replacing non-unitary collision operators with unitary rotations, enabling precise fluid dynamics simulations on quantum hardware.
@informaq.bsky.socialQ-CTRL executed a 100-qubit Quantum Fourier Transform on IBM Heron, resolving a key scaling bottleneck through a novel Convolutional compilation strategy that eliminates routing overhead on linear nearest-neighbor topologies.