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 ↗317 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.
- arXiv · Published · First archived
Temporal trade-offs in high-dimensional entanglement: a comprehensive noise model for optimal time-bin QKD protocols ↗
High-dimensional time-bin entanglement is known for having high potential for quantum key distribution (QKD) applications, being easily implementable, robust and may offer better keyrates than simple qubit protocols. The temporal encoding, combined with limited clock resolution, however, implies a trade-off: Is it better to send more low-dimensionally encoded photons or few high-dimensional ones? Answering this question presents a hard challenge as it depends on the entire context of the protocol, including the production rates, losses, dark counts, timing jitters and many more. We answer this…
- arXiv · Published · First archived
Improving the Stability of the Hierarchical Equations of Motion for Open Quantum Systems with Strong Coupling to Structured Bosonic Baths ↗
The hierarchical equations of motion (HEOM) approach is one of the most powerful methods avail- able to simulate the dynamics of open quantum systems. Although the HEOM approach has been shown to be stable and efficient in many parameter regimes and physical scenarios, it is also well known that the unavoidable finite truncation of the hierarchy can lead to fundamental numeri- cal instabilities for bosonic environments. In this work, we apply recently developed techniques to analyze these issues. We use an auxiliary Fock-space picture of the hierarchy to first identify the unbalanced hierarchy…
- arXiv · Published · First archived
Zero Knowledge Proofs in Quantum Networks ↗
Zero-knowledge proofs (ZKPs) enable the verification of a statement without revealing any information beyond its validity and constitute a fundamental primitive in cryptography and information theory. However, existing constructions rely on computational assumptions and are predominantly confined to bipartite settings, leaving their information-theoretic realization in bipartite or network scenarios largely unexplored. Here we develop a framework for zero-knowledge verification based on the indistinguishability of quantum states under operational constraints. Exploiting the fundamental limitat…
- arXiv · Published · First archived
Deployment of Large IQP Circuit Born Machines on Qubit-Limited Hardware Using Noise Injection ↗
Quantum circuit Born machines (QCBMs) built with instantaneous quantum polynomial (IQP) circuits have loss functions that can be efficiently estimated classically, but require quantum computers during inference. Thus, classical computers can train large IQP QCBMs that exceed the qubit numbers of available quantum hardware. This motivates research into how qubit-limited quantum computers can be used to sample from larger IQP QCBMs. Leveraging insights from classical simulation of noisy IQP circuits, we propose a deployment protocol for IQP QCBMs that injects noise at the logical level to probab…
- arXiv · Published · First archived
The Overlap Gap Property: Separating Quantum and Quantum-Inspired Approximate Optimization Algorithms ↗
In this paper, we prove that the Mean-Field Approximate Optimization Algorithm (MF-AOA), a quantum-inspired classical algorithm of the Quantum Approximate Optimization Algorithm (QAOA), is unable to give arbitrary near optimal solution for problems exhibiting the Overlap Gap Property (OGP). We show this by relating the MF-AOA to finite-memory Approximate Message Passing (AMP) algorithms, which are known to be limited in performance by the OGP. Thus, our paper argues that problems exhibiting the OGP are one such instance where the QAOA can outperform the MF-AOA and AMP algorithms in general. We…
- arXiv · Published · First archived
Asymptotically Good Quantum Codes with Addressable Transversal T Gates ↗
Designing quantum codes with both transversal non-Clifford gates and good error-correcting parameters is an important goal in fault-tolerant quantum computation. Here, we construct an explicit family of binary CSS codes with constant rate and linear distance that admit fully addressable transversal $T$ gates. Specifically, any prescribed tensor product of logical powers of $T$ is implemented by a tensor product of physical powers of $T$, without any subsequent correction. Our construction combines algebraic-geometry codes with suitable binary embedding to obtain generalized divisibility of bin…
- arXiv · Published · First archived
Accurate and bounded approximation of quantum correlation functions ↗
The exact classical simulation of non-integrable quantum systems rapidly becomes intractable beyond small system sizes, yet its role is central to predicting many-body dynamics. Approximate methods alleviate this cost but typically lack rigorous guarantees on their deviation from the exact result. For the infinite-temperature correlation function, we derive a rigorous error bound for approximating the full dynamics within a computable finite-sized region. Applied to autocorrelations, this finite-region approach is especially accurate across one-dimensional systems and beyond, and can further p…
- arXiv · Published · First archived
From Quantum to Classical Dissipative Spin Dynamics ↗
The Landau-Lifshitz-Gilbert (LLG) equation provides the fundamental description of dissipative magnetization dynamics. A recently proposed quantum analog, the quantum Landau-Lifshitz-Gilbert (QLLG) equation, extends this framework to quantum spin systems. However, whether the QLLG equation recovers the LLG equation in the classical large-spin limit for interacting spin systems remains an open question. Here, we demonstrate this connection by deriving the LLG equation as the classical large-spin limit of the QLLG equation. We establish this correspondence analytically and verify it numerically…
- arXiv · Published · First archived
From Simple Sources to Quantum Advantage: Homomorphic Polynomial Transduction via Relative Decoding ↗
Decoded quantum interferometry (DQI) and its Hamiltonian extension (HDQI) prepare states whose amplitudes are low-degree polynomials of an objective, using Fourier transforms and coherent decoding. We recast this approach as quantum state transduction through algebra homomorphisms. We transfer an efficiently preparable operator state of a degree-$D$ polynomial in a source Hamiltonian $H_A$ to the corresponding polynomial state of a target Hamiltonian $H_B=π(H_A)$, where $π$ is a unital $*$-homomorphism between the finite-dimensional source and target $C^*$-algebras. The transduction uses opera…
- arXiv · Published · First archived
Classical Bound on the Fisher Information Rate of a Dephasing-Enhanced Quantum Neuron ↗
Dephasing can sharpen the activation of a dissipative quantum neuron, but a stationary response does not determine how much input information its output delivers per unit time. For a single qubit with partial-reset updates at rate $ν$, we derive the threshold response bandwidth and the exact local Fisher information rate of the complete record from repeated projective readouts, including their backaction. Near the activation threshold, the rate obeys $\mathcal R\leqν(1-s)(1+s)^2/2\leq16ν/27$, where $s$ is the retained amplitude of each update. For every fixed finite Markovian dephasing rate, o…
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.