Skip to main content
Search

# Quantum Computing

2 related articles

Subscribe to updates
  1. arXiv

    Matrix formulas compile straight into quantum block encodings: MARBLE matches or beats 37 of 39 published baselines

    Quantum algorithms need exponentially large matrices encoded efficiently into circuits, yet such circuits have mostly been built by hand or assumed sparse. MARBLE takes a formula for each matrix entry, uses static multiplicity to guarantee a fixed number of distinct entry expressions, and applies algebraic rewriting plus cost analysis to emit OpenQASM. Across 74 matrices from fluid dynamics, PDEs and physics Hamiltonians, it matches or surpasses 37 of 39 published baselines in subnormalization and compiles very large dimensions in under five seconds on a laptop.

  2. IBM Research

    A theoretical separation between quantum computers & LLMs

    The work proposes a theoretical separation between quantum computers and large language models, noting that recent research further demonstrates the theoretical abilities of quantum computing, but the loaded text contains only the title and a one-sentence summary without specific methods, proofs, or results.

You’re all caught up