@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.
@markeatherly.bsky.socialOptimal Stabilizer Testing and Learning with Limited Quantum Memory
We study stabilizer state testing and learning with limited coherent quantum memory.
@markeatherly.bsky.socialLow-ancilla block encodings via Hamiltonian simulation
Block encodings are a central primitive in quantum algorithms, but standard constructions typically require logarithmic ancilla overhead and complicated controlled operations.
@markeatherly.bsky.socialRecovery Algorithm for Correlated Errors in Permutation-Invariant Quantum Codes
Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps.
@informaq.bsky.socialQuantum X Labs develops new geometric encoding method to efficiently simulate complex particle transport in nuclear environments, advancing quantum algorithms for realistic physical systems.
@informaq.bsky.socialResearchers developed an algebraic approach using qudits to solve complex optimization problems more efficiently, bypassing exponential scaling challenges through representation theory and deriving exact solutions for quantum network Hamiltonians.
@informaq.bsky.socialNew randomized algorithms for simulating open quantum systems demonstrate gate complexity advantages over traditional methods, enabling faster and more accurate modeling of quantum phenomena.
@informaq.bsky.socialNovel randomised Trotter-Suzuki formulas and QDRIFT channel maintain physical validity while dramatically reducing quantum gate operations for open system simulation—enabling faster, more scalable quantum simulations.
@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.