@informaq.bsky.socialIdentifies geometric inflation of QGT null-space rotation as root cause of NQS accuracy failures in quantum dynamics. Proposes mean null-space rotation angle as diagnostic tool to predict and prevent inaccuracy in time evolution algorithms.
@informaq.bsky.socialNew quantum algorithm simulates quantum dynamics uniformly across semiclassical and quantum regimes, overcoming highly oscillatory solutions via Weyl variables and Hermite moments with polynomial complexity independent of wavelength.
@informaq.bsky.socialWe prove quantum algorithms achieve quadratic speedup for counting positive Bernoulli distributions, establishing near-matching bounds: Õ(√ρ/(Δϵ)) upper and Ω(√ρ/(Δϵ)) lower via novel Boolean-over-average-case composition theorem.
@markeatherly.bsky.socialIBM Quantum Credits Program Drives Advanced Algorithmic Breakthroughs Beyond Classical Limits
IBM Quantum has released a technical review detailing the initial research outcomes generated by its expanded IBM Quantum Credits program.
@informaq.bsky.socialComprehensive review of quantum data encoding techniques including state preparation, unitary synthesis, quantum RAM, and block encodings—critical for achieving practical quantum advantage with optimal circuit complexity.
@informaq.bsky.socialNovel quantum algorithm encodes PageRank vectors using multistep quantum resonant transitions with only one ancillary qubit, dramatically reducing circuit complexity compared to prior methods while maintaining polynomial efficiency.
@informaq.bsky.socialNovel RUS-POVM approach reduces quantum resources polynomially by introducing intermediate measurements on a single ancillary qubit, enabling efficient multi-step quantum computation with significantly fewer qubits and unitary operations.
@informaq.bsky.socialEstablishes near-linear quantum query lower bounds for high-accuracy convex optimization, resolving open problems. Introduces novel Fourier-rank methods with implications for determinant computation and eigenvalue estimation.
@informaq.bsky.socialNovel bosonic Hamiltonian designs implement discrete Fourier transforms in photonic circuits via single-stage evolution with O(N log log N) scaling—enabling 2500-dim QFT with 2,625 interferometers vs 3 million for conventional architectures.
@informaq.bsky.socialQuantum algorithm achieves first sublinear worst-case query complexity for constructive Ramsey problems, providing provable polynomial speedup over classical approaches on random graphs with improved lower bounds.
@informaq.bsky.socialEstablishes optimal quantum and classical query complexity bounds for estimating persistence statistics from temporal graph snapshots, with Grover-type advantage and matching lower bounds across dense and sparse regimes without spectral gap assumptions.
@informaq.bsky.socialEstablishes upper and lower bounds for sample complexity of the generalized hidden shift problem over arbitrary finite groups using quantum information theory and representation-theoretic techniques.
@informaq.bsky.socialProves vanishing block-error probability for quantum belief propagation decoders on LDPC codes over quantum channels, enabling efficient quantum algorithms for optimization and lattice-based cryptography applications.
@informaq.bsky.socialNew QLBM algorithm enables realistic boundary conditions for quantum fluid simulations using density-matrix encoding and bounce-back schemes. Validated on 2D flows with complex geometries, advancing practical quantum computing applications.
@informaq.bsky.socialResearchers develop efficient quantum circuits for electronic Hamiltonian simulation, reducing computational overhead from O(n²) to O(n) gates while eliminating Trotter errors—advancing practical quantum simulation capabilities.
@informaq.bsky.socialWiMi combines Quantum Haar Transform with quantum partial measurement for efficient high-dimensional data compression, achieving polynomial-level complexity reduction through quantum parallelism and variational quantum algorithms.
@informaq.bsky.socialResearchers proved quantum imaginary time evolution converges to global minima with linear scaling in system size, offering a practical solution to exponential resource scaling that limits quantum algorithms.
@informaq.bsky.socialClassiq provides a comprehensive collection of quantum algorithms. The scope suggests significant algorithmic depth, though specific applications and advantages require further details.
@informaq.bsky.socialStudy proves that exact uniform distribution of positive sojourn times in quantum walks is exclusive to Hadamard coins within rotation coin families—a rigidity phenomenon characterized through matrix-valued generating functions and algebraic analysis.
@informaq.bsky.socialResearchers developed a scalable technique to detect how multiple qubits entangle using weak Schur sampling, enabling analysis up to four-qubit systems and opening pathways for distributed quantum computing and secure networks.