Researchers developed algebraic methods to solve the Quantum Max d-Cut problem for higher-dimensional qudits, deriving exact solutions for key graph structures and bypassing exponential scaling common in quantum simulations.
@informaq.bsky.social
@informaq.bsky.socialResearchers developed algebraic methods to solve the Quantum Max d-Cut problem for higher-dimensional qudits, deriving exact solutions for key graph structures and bypassing exponential scaling common in quantum simulations.
@informaq.bsky.socialNovel quantum algorithm efficiently computes Lie algebra radicals—revealing conserved charges in quantum systems—with square-root complexity scaling and precise conditioning bounds via block-encoded kernels.
@informaq.bsky.socialResearchers achieve fully parallel quantum amplitude estimation using geometric depth schedules (ratio ~1.45) with 2.8–3.1/ε query complexity at 95% confidence, matching adaptive methods while requiring 13× lower sequential depth.
@informaq.bsky.socialNew pruning algorithms for quantum circuits reduce complexity by 88-92% while maintaining 95% fidelity for TFD state preparation on near-term quantum processors using the SYK model.