THE INTERNET IS THINKING
Earlier sources: Physics
This science thread follows physics through original research, public projects, and source reports. Read the evidence below to see which developments are represented in SYMTRI’s archive.
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 ↗318 classified signals in the fourteen-day window. 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.
- OpenAlex · Published · First archived
On the physics of higher condensation defects ↗
A bstract We study the structure of topological defects for finite Abelian symmetries in quantum field theories, and argue on physical grounds that they satisfy the definition of a higher fusion category proposed by Johnson-Freyd. Our primary focus is on the requirement of Karoubi completeness, i.e. the factorization conditions on higher condensation defects. We demonstrate this on a tree of such defects, constructed by successive higher gauging, explicitly using Lagrangian techniques in a concrete four-dimensional example, before turning to more general field theories. Along the way we also c…
- OpenAlex · Published · First archived
Improving entanglement resilience in quantum memories with error-detection-based distillation ↗
The degradation of entanglement in quantum memories due to decoherence is a critical challenge for scalable quantum networks. We present an entanglement distillation protocol based on the [[4, 2, 2]] quantum error-detecting code, deriving analytical expressions for its output fidelity and yield, and benchmarking it against the BBPSSW protocol. In addition to single-round performance, we further examine the iterative behavior of both protocols through multi-round fidelity and cumulative yield analysis. We then investigate a storage-stage recovery strategy in which the retained logical entangled…
- arXiv · Published · First archived
When Known Physics Helps Neural PDE Models: Residual Constraints Out-Regularize Generic Priors for Nonlinear Dynamics ↗
Neural PDE surrogates increasingly incorporate structural priors, yet it is often unclear whether their gains arise from physics-specific information or simply from regularization and training choices. We evaluate several such priors under a common protocol against a matched from-scratch neural operator baseline. Our central result is that a known-equation residual consistently outperforms the best generic regularizer at equal tuning budget. At fixed capacity this benefit appears across linear and nonlinear PDEs, but a capacity sweep reveals a sharp distinction: the advantage persists and grow…
- arXiv · Published · First archived
QBX: A Compiler for 2-local Qubit Hamiltonian Simulation on Quantum Chiplets ↗
2-local qubit Hamiltonian simulation, a fundamental task in quantum computing, is widely applied in various applications. This paper presents QBX, the first quantum compiler designed for 2-local qubit Hamiltonian simulation on quantum chiplet architectures. Existing general-purpose quantum compilers for chiplet architectures target quantum programs at the gate level and miss optimizations requiring high-level semantics of Hamiltonian simulation. Conversely, existing domain-specific compilers for Hamiltonian simulation are designed for monolithic architectures, and their limited scalability and…
- arXiv · Published · First archived
Swapping Quantum Annealing Errors into a Cavity ↗
Quantum annealing is a promising form of quantum computation, but it slows down at a small energy gap $Δ$ during the anneal, and the errors it makes there remain undetected. We introduce cavity quantum annealing, in which a cavity mode of frequency $O(1)\ggΔ$, coupled mid-schedule, swaps these errors into photons. In the $p$-spin model, this reduces the annealing time to nearly the square root of that required without the cavity. Moreover, counting the photons certifies the result: high-photon runs, with an $O(1)$ yield, reach a ground-state fidelity above $99.99\%$ orders of magnitude sooner,…
- arXiv · Published · First archived
Hardness of Approximating Quantum Code Distance Beyond $\sqrt{N}$ ↗
We study the computational complexity of approximating the minimum distance of a stabilizer code. Classically, the minimum distance problem is NP-hard to approximate even to within an additive gap linear in the block length. For quantum codes, however, the reductions of Kapshikar and Kundu and of Grigorescu, Jha and Samperton reach only an additive $O(\sqrt{N})$ gap in the block length $N$. We close this gap and, in a separate direction, initiate the fine-grained study of the problem. We show that no randomized algorithm approximates the distance to within an additive $αN$, for a constant $α>…
- arXiv · Published · First archived
Quantum-Computing Self-Consistent Kohn-Sham DFT: Plane-Wave-Orthonormalized Orbitals with a Dual-Basis Quantum Eigensolver ↗
We present a first-quantization, all-electron, full-potential Kohn-Sham density functional theory method for quantum computers, based on a classically optimized quantum-circuit eigensolver for the self-consistent field (SCF) eigenproblems in any orthonormal basis. The plane-wave-orthonormalized-orbital (PWOO) basis combines plane waves with atomic orbitals (AOs) orthonormalized against them and one another. The eigensolver has a dual-basis form: after full-basis bootstrap steps, it solves each SCF step in a contracted basis of $K$ functions ($\lceil\log_2 K\rceil$ qubits), updated in the full…
- arXiv · Published · First archived
Quantum data processing equality ↗
The quantum data processing inequality asserts that quantum relative entropy is monotonically non-increasing under quantum channels. Here, we promote this fundamental inequality to an exact equality via boundary and surface Poisson integral representations across a complex strip. The relative-entropy loss is resolved into two independent, nonnegative physical mechanisms: an operational Petz recovery component governing state reconstructibility, and a boundary term measuring the mismatch of relative modular dynamics. We further express the loss as the measured relative entropy between the origi…
- arXiv · Published · First archived
On Embedding Design in Quantum Physics-Informed Neural Networks ↗
Quantum physics-informed neural networks (QPINNs) solve partial differential equations (PDEs) by training parameterized quantum circuits against physics-based residuals, yet the role of the embedding that maps coordinates into quantum states remains insufficiently understood. In this research, we introduce a unified embedding framework that formulates embedding as a functional transformation shaping the feature representation available to the variational circuit, and we propose two embeddings within it. The Linear Quantum Neural Network Trainable Embedding QPINN (LQNN-TE-QPINN) generates data-…
- arXiv · Published · First archived
Simultaneously Query-Optimal Quantum Linear-System Algorithm ↗
Quantum linear-system algorithms access the coefficient matrix through a block-encoding oracle $U_A$ and the right-hand side through a state-preparation oracle $U_b$. The optimal query complexities of these two oracles are known separately: $O(κ\log(1/\varepsilon))$ queries to $U_A$ and $O(κ/s)$ queries to $U_b$, where $s=α\|A^{-1}b\|$. Whether a single algorithm can achieve both bounds simultaneously has remained open. We resolve this question affirmatively. Given a constant-factor estimate of $s$, we give a quantum linear-system algorithm that prepares the normalized solution to error $\vare…
Live window recorded . This is the ingestion observation time, not the publication or discovery date of each source.
How to assess evidence about Physics
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 ↗
Related threads
Explore related regions
These navigation suggestions are part of the map’s editorial structure, rather than measured evidence of a connection.