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 ↗1612 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.
- arXiv · Published · First archived
Rapid Mixing of Parallel Kac's Walk: From Spheres to Stiefel Manifolds ↗
Kac's walk is a classical local random walk whose action on a single real unit vector in dimension $d$ mixes in total variation in $Θ(d\log d)$ sequential steps~\cite{PS17}. Lu, Qin, Song, Yao, and Zhao introduced a parallel version of Kac's walk that mixes a single quantum state in $O(\log d)$ rounds~\cite{LQSY+26}. After discretizing the randomness and replacing it by suitable pseudorandom primitives, this parallel walk gives rise to pseudorandom state scramblers, and was subsequently shown to yield pseudorandom unitaries~\cite{LQSY+25}. We study what happens when the parallel Kac's walk act…
- arXiv · Published · First archived
Strong-to-Weak Spontaneous Symmetry Breaking of Dephased Fermions ↗
Strong-to-weak spontaneous symmetry breaking (SWSSB) is a novel phase transition in mixed states associated with the loss of global charge information. In this work we study fermions with $U(1)$ symmetry under infinite density dephasing and derive the SWSSB properties of the resulting mixed states. Our central observation is that at infinite dephasing every Renyi correlator is exactly the spin-spin correlator of a compact XY model, whose Boltzmann weight is the squared full-counting-statistics generating function of a classical ensemble built from the parent state. For the Renyi-2 correlator i…
- arXiv · Published · First archived
Optimal Quantum Junta Testing without Inverse Queries ↗
We study the query complexity of testing quantum juntas. Given an unknown $n$-qubit unitary or quantum channel, the goal is to decide whether it acts nontrivially on at most $k$ qubits or is $\varepsilon$-far from every such operation. For unitaries, we consider the forward-only model, where the tester has access to $U$, but not to $U^\dagger$ or controlled-$U$. We give tight bounds for both unitary and channel junta testing. For sufficiently large $k$, $n \ge 2k$, and a broad range of $\varepsilon$, both problems have query complexity $Θ\left(k/(\varepsilon^2\log k)\right)$. Our upper bounds…
- arXiv · Published · First archived
A Neutral Atom-Based Hybrid Classical-Quantum Approach for the Entanglement Routing Problem ↗
Efficient end-to-end entanglement distribution in quantum information networks requires routing under limited resources and fidelity constraints. We study entanglement routing as a fidelity-constrained unsplittable multicommodity flow problem that maximizes the number of admitted requests. As a proof of concept, we integrate neutral-atom quantum optimization into a hybrid classical--quantum column-generation framework. A classical restricted master problem selects routes, while a pricing problem generates fidelity-feasible paths. We formulate this NP-hard constrained shortest-path pricing prob…
- arXiv · Published · First archived
Towards verifiable quantum advantage with random circuits: Observables that survive concentration ↗
Demonstrating quantum advantage on current quantum hardware is a central goal of quantum computing, and random quantum circuits underpin many leading proposals. Yet sampling-based demonstrations are often difficult to verify, while observable-based approaches face a different challenge: concentration can suppress differences between circuit instances. Recent experiments have put forward the estimation of out-of-time-order correlators (OTOCs) in random circuits as a promising task for verifiable quantum advantage, yet whether their circuit-to-circuit fluctuations survive concentration as system…
- arXiv · Published · First archived
Attosecond correlation interferometry ↗
Correlations between optical modes, ranging from classical fluctuations to quantum entanglement, are a cornerstone of modern optics and emerging quantum technologies. However, probing these correlations on the natural timescale of electronic motion - the attosecond regime - remains a major challenge. Here, we generate and characterize correlated attosecond extreme-ultraviolet (XUV) emission by perturbing gas-phase high-harmonic generation with two-mode bright squeezed vacuum. The signal and idler fields imprint their correlated amplitude and phase fluctuations onto two families of harmonics, t…
- arXiv · Published · First archived
Measuring the spin of a spin-1/2 and getting a result of 7 ↗
The weak value of an operator is the average result of measuring that operator on a quantum system given specified initial and final states. The overlap between these states appears in the denominator of the weak value, and thus if that overlap is small, the weak value can be arbitrarily large. In 1988, Albert, Aharonov, and Vaidman proposed a weak Stern-Gerlach experiment which would be able to measure a so-called anomalous weak value, a measurement result which lies out- side of the eigenvalue spectrum of the operator being measured. Though anomalous weak values have been measured in numerou…
- arXiv · Published · First archived
Succinct Arguments for QMA in the Quantum Random Oracle Model ↗
Succinct arguments are a fundamental cryptographic primitive for verifying computational claims with small communication. In the classical setting, succinct arguments for NP can be constructed from unstructured hardness alone (e.g., hash functions) by compiling probabilistically checkable proofs (PCPs) or interactive oracle proofs (IOPs) for NP via the commit-and-open paradigm. In contrast, known succinct arguments for QMA rely on ``structured'' cryptographic primitives, or on the quantum PCP conjecture. We construct the first succinct argument for QMA in the quantum random oracle model (QROM)…
- Hacker News · Posted on Hacker News · First archived
Quantum Computer Completes in 19 Secs What Could Take a Supercomputer a Century ↗
Hacker News discussion.
- arXiv · Published · First archived
Scalable Diffusion SBI for Compositional Inference under Simulator Misspecification ↗
Simulation-based inference is challenging when many heterogeneous observations must be composed, hierarchical latent structure must be preserved, and the simulator is misspecified relative to observed data. We develop sampling and fine-tuning methods for diffusion-based inference in design-conditional settings, where the same simulator is queried across different experimental conditions $ξ$. We extend compositional score-based inference with a continuous-time diffusion coefficient that accounts for the number of observations, avoiding Jacobian and auxiliary-covariance corrections. We introduce…
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.