Skip to main content

Matter Sciences

  1. arXiv

    Same WZW current algebra, two neural realizations, different errors: level–rank duality carries charged correlators across paired theories

    Neural network field theory writes field-theoretic correlators as expectations over network parameters, yet one continuum current algebra can be realized by different networks. This work builds positive-level WZW current algebras from bosonic Wakimoto fields and fermionic Fourier–Berezin fields, and uses level–rank duality to connect the charged sectors of paired theories. At fixed regulator and finite width, direct and coset constructions differ in error, spectral distribution and regulator choice shift accuracy, and source-sector measurements predict paired-sector responses without measuring the target preparation.

  2. arXiv

    SMEFT operator space without enumeration: a reinforcement-learning agent finds 26 low-overlap, high-quality solutions among 912 operators

    With 912 baryon-, lepton- and lepton-flavour-conserving SMEFT operators, enumerating multi-operator combinations becomes a combinatorial explosion. ReinforceSMEFT casts operator-by-operator assembly as sequential decision-making: an actor–critic policy with about 40K trainable parameters learns which operator to add in an environment of 132 observables, 24 of which deviate from the Standard Model by more than 3σ, and is rewarded for solutions that overlap little with those already found. Against random-subset and random-sequential searches, the policy builds multi-operator theories more efficiently; combining ten independent training runs yields 26 high-quality solutions with Jaccard indices below 0.1.

  3. arXiv

    Reaction models judged only by endpoints miss the point: UniRxnAxis splits the latent update, and its orthogonal residual carries most retrosynthesis utility

    Reaction-prediction models are usually judged by endpoint accuracy, which does not show how a model represents a chemical transformation. UniRxnAxis unifies forward prediction and retrosynthesis as direction-conditioned endpoint redistribution in a shared latent space, making source states, transformed states and encoded target endpoints directly comparable, and decomposes the learned displacement into an endpoint-parallel component and an endpoint-orthogonal residual. On USPTO-50K retrosynthesis, decoding only the parallel state gives top-1 0.0997, while decoding only the orthogonal residual reaches 0.6303, close to the full state's 0.6441.

  4. arXiv

    Quantum repeater protocols stop splitting the network into routes: reinforcement learning lifts end-to-end entanglement rate above routed swap-ASAP on intersecting networks

    On non-linear quantum networks, entanglement routing splits the network into disjoint paths and runs chain protocols on each in parallel, shrinking the search space. This work instead uses reinforcement learning to search the larger non-routing protocol space directly, and finds end-to-end logarithmic-negativity rates above routed swap-ASAP on an eight-station intersecting network and other small networks, even in the parameter regime where the latter is widely regarded as state of the art. The authors argue routing should be discarded in favor of non-routing methods, and give a network score tied to the size of the improvement.

  5. arXiv

    Quantum error correction decoding no longer has to choose speed over accuracy: TCBP-JOBS matches Tesseract's logical error rates on GPU, with serial speedups up to thousands of times

    Decoders for general quantum error-correcting codes have long traded speed against accuracy: fast decoders lose accuracy, while most-likely-error decoders are too slow for real-time correction. TCBP-JOBS uses a small multilayer perceptron to learn a calibrated probability for each fault from the full belief-propagation trajectory, then starts GPU-parallel searches over many orderings from those probabilities. Across 72 surface, color and bivariate-bicycle code circuits it reaches logical error rates comparable to or lower than Tesseract, by up to 4.5 times on the largest codes, with serial decoding 10 to 7,400 times faster than sparsified Tesseract.

  6. arXiv

    Rotation invariants can blur highly symmetric molecules: an extended HIP-HOP basis gives the lowest error among HIP-HOP variants on methane and still runs faster at inference

    Rotation-invariant representations can map geometrically distinct atomic environments onto the same descriptor in highly symmetric settings, limiting the accuracy of machine-learned interatomic potentials. A lightweight benchmark built around configurations with multiple-fold symmetry exposes degeneracies shared by invariant and equivariant architectures, and guides an extension of the invariant HIP-HOP basis to higher angular order. On a randomly displaced methane dataset of more than seven million configurations, the extended basis gives the lowest error among HIP-HOP variants and, at about 36K parameters, nearly matches EquiformerV3 while running faster at inference; both still fail on the (3/4) ring configuration.

  7. arXiv

    Carbon-nanotube sheets stop blurring into one blob: PLECTA reads only a binary axis mask and reaches mean F1 0.85 on synthetic scenes

    Carbon-nanotube sheets, collagen and paper are built from overlapping strands, and in a micrograph a crossing merges distinct strands while a signal gap splits one strand into fragments. PLECTA takes only a binary mask marking strand centrelines and, at each junction, treats the possible continuations jointly as an exact maximum-weight partial matching, allowing strands to end and crossing pixels to belong to several strands. Across 128 synthetic scenes it reached a mean common-fragment pairwise F1 of 0.85 (95% bootstrap CI [0.84, 0.86]), falling from 0.91 to 0.77 as areal coverage rose from 20% to 60%.

  8. Molecule-language models get a structure lesson: SAGA trains only, lifting retrieval R@1 by up to 7.82 points

    Molecule-language models learn from paired structure-text contrastive objectives, yet they treat a structurally related nonmatch and an unrelated molecule as the same negative class. SAGA uses Centered Kernel Alignment during training to align pairwise relationships among neural molecular embeddings with fingerprint Tanimoto similarity, adding no parameters and requiring no fingerprints at inference. On MolCA and Atomas, every reported molecule-text retrieval metric improves, with Atomas-L text-to-molecule R@1 rising from 43.15 to 50.97, and non-exact retrieval shifts toward closer structural analogues.

  9. arXiv

    Self-driving labs drop the Q-learning rate: heteroscedastic Gaussian processes set a noise level per target and near the best return in fewer episodes across five benchmarks

    Each campaign in a self-driving laboratory is a real reactor or culture run, and tens to hundreds of episodes leave no room to tune a learning rate as well. Heteroscedastic Gaussian Process Q-learning (HGPQ) places a Gaussian process directly on the Q-function, uses the Kalman gain as the learning rate, and estimates each Bellman target's noise variance with a second heteroscedastic Gaussian process so noisy targets move the estimate less. Pooled over five simulated benchmarks that include a chemical reactor and a bioprocess, HGPQ approaches the best return found by any method in fewer episodes than GP, kernel and deep RL baselines.

  10. arXiv

    Peer-to-peer energy market clearing gets a learned speedup: a graph-network correction adds no communication and keeps the baseline's convergence guarantee

    Clearing peer-to-peer energy markets usually relies on distributed iterations that seek a generalized Nash equilibrium, and the iteration count and communication rounds become a deployment obstacle as participants grow. A KTH team trains a graph-neural-network correction on historical clearing data and adds it to a distributed Douglas–Rachford baseline; the correction decays geometrically, so convergence is inherited from the baseline. On synthetic markets the correction cuts the iterations needed to clear and their spread, and the speedup persists when operating conditions shift to four times the training variability.