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 ↗1659 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
Optimal testing of fermionic and bosonic Gaussian states ↗
We study the problem of property testing quantum states: given a pure state $|ψ\rangle$ that either (A) belongs to some class $C$ of pure states, or (B) is $\varepsilon$-far in trace distance from all states in $C$, determine which is the case with high probability. It is known that there exists classes $C$ for which the sample complexity of property testing necessarily scales with the size of the system. In this work, we identify classes for which testing only requires a size-independent number of samples. We prove a tight sample complexity of $Θ(1/\varepsilon^2)$ for the property testing of…
- arXiv · Published · First archived
Quantum circuit compilation with constant overhead ↗
Compiling a continuous gate set to a discrete universal gate set generally incurs an overhead. A circuit composed of $G$ arbitrary one- and two-qubit gates can be $ε$-approximated by a sequence of gates from $\{H,T,\mathrm{CNOT}\}$ by replacing each original gate by a sequence of $O(\log(G/ε))$ elementary gates. We show that this overhead can be avoided using adaptivity for polynomial-sized circuits with inverse-polynomial target error, which is optimal.
- arXiv · Published · First archived
Engineered Dissipation for Thermal-State Tracking Across Quantum Criticality ↗
Engineering dissipation has emerged as a powerful strategy for controlling quantum many-body dynamics, complementing purely coherent control for state preparation. However, finite-time driving across a quantum critical point generates nonadiabatic excitations and coherences, and existing dissipation-engineering approaches have largely characterized how a fixed environment modifies critical dynamics rather than actively steering a system toward a prescribed thermal trajectory. Here we develop a Markovian dissipative framework for finite-time thermal-state tracking based on engineered population…
- arXiv · Published · First archived
Fixed-Point Bifurcations and Path-Information Bounds in Nonlinear Exceptional-Point Sensing ↗
Nonlinear exceptional points (NEPs) were proposed to circumvent the noise--responsivity cancellation that limits linear exceptional-point sensors. At an NEP, the stationary frequency response can be singular while the Hamiltonian Petermann factor remains finite, suggesting a genuine signal-to-noise ratio (SNR) enhancement. Yet recent model-specific analyses of nonlinear fluctuations have reached conflicting conclusions. We prove that any singular stationary frequency response requires a fixed-point bifurcation of the nonlinear dynamics. In local fluctuation regimes, the singularities in respon…
- arXiv · Published · First archived
Provable Classical and Quantum Local Algorithms for Max-$k$-Cut and Quantum Advantage at Moderate Girth ↗
Broadening the study of quantum optimization algorithms from binary to $k$-element alphabets has been shown to open new avenues for potential quantum advantage. A quantum advantage claim for approximate optimization requires showing that, under the same assumptions, an efficient quantum algorithm provably achieves a better performance than can be proven for the best known efficient classical algorithms. We study local classical and quantum algorithms for Max-$k$-Cut on $d$-regular graphs of girth $g$. We advance classical algorithms for this problem by developing a local vector algorithm based…
- arXiv · Published · First archived
Entropy threshold: A simple proxy for performance of quantum error correction ↗
The rapidly growing landscape of quantum error-correction (QEC) protocols has produced a wealth of numerical data, but comparatively few heuristics for understanding and predicting their performance. Here, we develop a simple entropy-based proxy that predicts the thresholds of a variety of QEC protocols, ranging from the code-capacity setting of Clifford-deformed surface codes with biased Pauli or erasure noise to the circuit-level noise model of the surface or color codes with flag qubits. Our proxy estimates the threshold by locally comparing the noise entropy with the error information gain…
- Hacker News · Posted on Hacker News · First archived
Timeline of Mathematics ↗
Hacker News discussion.
- arXiv · Published · First archived
Constant Rate Codes with Fully Addressable Transversal T: Good Codes, Sparse Checks ↗
Recent work by Wills constructed codes with constant rate and transversal $T$. Extending this line of work, we construct asymptotically good CSS codes with \textbf{fully addressable} transversal $T$, permitting selective control over which logical qubits receive a $T$ gate. We also give Pauli-LDPC codes with transversal $T$ and growing distance at vanishing rate; and a protected-subsystem construction with fully addressable transversal $T$, constant protected rate, distance $Ω(\sqrt n)$, and sparse (non-Pauli) checks. More generally, we obtain asymptotically good binary codes with full transve…
- arXiv · Published · First archived
Quantum Pseudorandom Error-Correcting Codes ↗
Pseudorandom error-correcting codes (PRCs), introduced by Christ and Gunn [CRYPTO 2024], are classical error-correcting codes whose codewords are computationally indistinguishable from uniformly random strings. We initiate the study of quantum analogues of PRCs. We define quantum pseudorandom error-correcting codes (QPRCs). Assuming that Learning Parity with Noise (LPN) is hard for $2^{O(\sqrt{n})}$-time quantum algorithms, we construct QPRCs whose encodings are indistinguishable from Haar-random isometries. We call these pseudorandom isometric error-correcting codes (PRICs), and our construct…
- arXiv · Published · First archived
Eigenstate thermalization at the edge of the many-body spectrum ↗
It is well-known that thermalization breaks down in presence of an extensive number of symmetries or conservation laws that are mutually compatible or commuting with each other. We ask here how an extensive number of mutually incompatible local symmetries govern eigenstate thermalization (ETH). We will investigate this through models within the class of bond-dependent $\mathbb{Z}_2$-symmetric quantum spin-$\frac{1}{2}$ Hamiltonians that naturally admit this structure. This leads to exponentially large degeneracies in the spectrum governed by the incompatible symmetry structure. Here, using spe…
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.