THE INTERNET IS THINKING

Earlier sources: Science

Science investigates the natural world through observation, experiments, and mathematical models. Explore papers and developments in biology, medicine, materials, neuroscience, physics, climate, and mathematics; a reported finding is not necessarily established consensus.

SYMTRI organizes observations from public sources into a living map. Connections reflect shared subject matter; they do not establish causation or endorse a source.

Open in the map ↗
Share this page ↗

1411 classified signals in the fourteen-day window. Recent momentum: steady. These counts include signals awaiting readable evidence.

Earlier sources

Up to ten sources with readable evidence, ordered by their feed timestamp. These archive sources can be older than the live fourteen-day window. This list is a sample, not a measure of total activity. Dates distinguish paper publication, repository creation, model/dataset activity, Hacker News posts, and KEV catalog additions. “First archived” records when SYMTRI first stored the signal.

  1. arXiv · Published · First archived

    Majorana bilinears, compact modular seeds and the approach to the Tsirelson bound ↗

    In this work we study the Bell-CHSH inequality in the vacuum of the free massive Majorana field in $1+1$ dimensions, taking as the dichotomic observables of the two parties even bilinears of smeared fields localized in the right and in the left Rindler wedges. The test functions are generated from seeds in the modular-frequency variable through the Tomita-Takesaki operator of the right wedge and, on the side of the left wedge, through its adjoint multiplied by $i$, which accounts for twisted duality. For seeds supported at positive modular frequency the one-particle overlaps between the two pa…

  2. arXiv · Published · First archived

    Stabilizer codes over general phase spaces ↗

    We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to h…

  3. arXiv · Published · First archived

    Indistinguishability Lifting for Keyed Oracles, Compressed Ideal Cipher, and More Applications ↗

    Cryptographic security proofs often involve an adversary interacting with a larger, keyed oracle that consists of (potentially exponentially) many independent instances of a smaller, base oracle. However, showing quantum indistinguishability between two such keyed oracles can be tricky, since a single query made by an adversary may involve a superposition that covers all instances of the base oracles simultaneously. In this paper, we establish a generic indistinguishability lifting theorem of the following form: if the two base oracles are indistinguishable under quantum queries, then their co…

  4. arXiv · Published · First archived

    Quantum-State Oblivious Transfer over Quantum Erasure Channels ↗

    We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of…

  5. arXiv · Published · First archived

    Correlations decide a shallow-circuit advantage ↗

    Quantum computers are claimed to produce samples ordinary classical computers cannot reproduce. The sharpest such claim known pits constant-depth quantum circuits, given one entangled state per run, against shallow classical circuits of few-input gates and limited randomness. No efficient test was known that certifies such a claim from classical samples alone. Here we show that what such a test must read is decided by the classical class's pattern of single-bit and pair correlations, not by a distance. The test rests on one inequality: any machine producing the samples sits no further from the…

  6. arXiv · Published · First archived

    Xenia: A Table-Driven Code for Astrophysical Multi-Fluid Hydrodynamics ↗

    Models of escaping planetary atmospheres require neutral and ion species with distinct velocities and thermal pressures, coupled by photoionization, recombination, radiation, and collisions. Implementing and extending such coupled models is often hindered when species definitions and stiff interactions are embedded in solver-specific kernels. We present Xenia, a table-driven code for astrophysical multi-fluid hydrodynamics designed to lower this barrier. Species, coupling channels, chemistry, heating and cooling, and radiation channels are declared in Python, compiled to symbolic tapes, and pa…

  7. arXiv · Published · First archived

    Bounding Two-Way Average Communication Cost of Simulating Quantum Correlations ↗

    Bell nonlocal correlations cannot be reproduced by local hidden-variable models without communication, making classical communication cost a natural quantitative measure of nonlocality. Although finite communication always suffices to simulate any correlation in a fixed finite Bell scenario, determining the minimum amount needed to (exactly) simulate any given nonlocal correlation remains challenging, especially in the average-cost setting. Here, we derive lower bounds on input-average communication cost from nonlocal games, allowing variable-length, fully interactive two-way protocols. When a…

  8. arXiv · Published · First archived

    A Unified Unsupervised Framework for Genome-Wide Association Studies in Heterogeneous Populations ↗

    Genome-wide association studies (GWAS) have greatly advanced the discovery of genetic variants underlying complex traits and diseases. Yet in heterogeneous populations, existing GWAS strategies typically either pool all individuals under an assumption of population homogeneity or perform meta-analysis across predefined subgroups, both of which are limited when latent genetic heterogeneity attenuates subgroup-specific effects and masks true associations or subgroup labels are imprecise. Here we present UCALM, a unified unsupervised framework that infers genetically homogeneous subgroups directl…

  9. arXiv · Published · First archived

    Vector field dark matter search with Sagnac interferometer ↗

    We present the first calculation showing that a material-asymmetric Sagnac speed meter can improve quantum-noise-limited sensitivity to $B-L$ vector dark matter by nearly two orders of magnitude over a Fabry--Perot Michelson position meter at the low-mass end of the band. We introduce material contrast into a dual-ring interferometer to probe composition-dependent $B-L$ forces and compare the two configurations at equal incident power, input-mirror transmissivity, and cavity round-trip length. For sapphire mirrors and a one-week benchmark, the quantum-noise-only median expected $95\%$ CL upper…

  10. arXiv · Published · First archived

    Exact Clifford Optimality for Two-Sided Locally Randomized Classical Shadows ↗

    Entangling measurements can reduce the statistical cost of learning many-body correlations. We study Pauli strings with full support on a specified $k$-qubit region using classical shadows with two independent, uniformly random product single-qubit Clifford layers around a controllable unitary acting on that region, followed by computational-basis readout. In this architecture, we prove that a circuit $U_*$ of two collective Pauli rotations attains the exact minimum squared shadow norm over all Clifford choices of the controllable unitary for every $k\geq1$, namely $C_k^{\rm opt}=4\cdot 9^k/(3…

Live window recorded . This is the ingestion observation time, not the publication or discovery date of each source.

How to assess evidence about Science

Check each original source for its methods, release status, limitations, and supporting data. A repository announcement, a preprint, and a published study provide different kinds of evidence. SYMTRI’s subject classification helps discovery; it does not independently validate the source’s claims.

See the collection and counting methodology ↗ · Read the weekly synthesis ↗

Follow a thread

Explore related regions

These navigation suggestions are part of the map’s editorial structure, rather than measured evidence of a connection.