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 ↗303 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
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…
- 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…
- arXiv · Published · First archived
New Methods for Constructing Classical and Quantum Codes from Graphs and Matroids ↗
In this paper, we present a method for constructing linear codes derived from book graphs. Applying such a method, we construct binary codes that have the greatest possible minimum distance for their length and dimension by means of the $2$-sum of two equal book graphs. We then utilize matroid and graph theory together to investigate some properties of the resulting linear codes. Furthermore, we show that, from the incidence matrix of any graph, we can obtain a linear code over any finite field maintaining the same parameters. Furthermore, we show how the condition for two linear codes to gene…
- arXiv · Published · First archived
Efficient Quantum State Identity Testing ↗
We study the following quantum state identity problem: given access to copies of $n$ unknown pure quantum states, the goal is to determine whether every pair has fidelity at least $1-\varepsilon$ or some pair has fidelity at most $\varepsilon$. This problem relaxes the identical-or-orthogonal promise considered in previous work. For any fixed overlap parameter $\varepsilon\in(0,1/4)$, we present two quantum algorithms with complementary guarantees on circuit depth and sample complexity. The first runs in constant depth using parallel swap tests and takes $O(\log(n/δ)\log(2/δ))$ copies of each…
- arXiv · Published · First archived
Variational Quantum Attention for Molecular Graph Learning ↗
Molecular property prediction is central to computational drug discovery, where graph neural networks learn to weight neighboring atomic environments during message passing. Yet it remains unclear how variational quantum circuits alter learned attention behavior in molecular graphs. We introduce an edge-aware variational quantum attention mechanism for molecular graph learning, in which the receiving atom, neighboring atom, and connecting bond jointly determine the quantum attention state. Across five molecular property and bioactivity prediction tasks, QGAT achieves competitive performance re…
- arXiv · Published · First archived
Decoy-state optical quantum information processing with coherent states ↗
Photonic qubits play an important role in quantum information processing. However, to date, efficient high-speed single photon sources and photon number resolving (PNR) detectors are still difficult to make. Here, we use phase-randomized coherent states and threshold detectors, combined with decoy-state post-processing, to simulate single photon sources and PNR detectors and perform various quantum information processing tasks. We propose a simple linear regression method to predict Fock state statistics based on observable statistics from coherent-state probes, combined with random/structured…
- arXiv · Published · First archived
Geometry-Controlled Squeezed-Waveguide Enabled Quantum Batteries ↗
Harnessed nonclassical resources to enhance the performance of quantum batteries is an important goal of quantum technology. In this work, we investigate multi-emitter batteries coupled to a one-dimensional waveguide driven by a broadband squeezed-vacuum reservoir, and determine how the waveguide geometry controls the battery performance and and their thermodynamic features. We show that for a single emitter, the squeezed reservoir deposits finite energy while the state remains passive, yielding zero ergotropy. For two emitters, however, phase-sensitive reservoir correlations generate coherenc…
- arXiv · Published · First archived
Quantum Submodular Maximization ↗
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constraint $k$ on an $n$-element ground set. In the exact reversible digital value-oracle model, our unconstrained algorithm achieves an expected $(1/2-\varepsilon)$-approximation using only $O_\varepsilon(\log n)$ queries. In contrast, any classical randomized algorithm that attains a fixed expected ratio above $1/4$ requires $Ω(n/\log n)$ queries (Li, Feldman, Kazemi, and Karbasi, 2022), establishing an exponential separ…
- arXiv · Published · First archived
Quantum Machine Learning Protection of Military Quantum Key Distribution Against Cryptographically Camouflaged Attacks ↗
Quantum key distribution proves its protocol secure and says nothing about the hardware beneath it, so military and government operators fielding it for command-and-control keys monitor the channel for implementation attacks, and that monitoring has a blind spot. An adversary with a kleptographic foothold in the generator of a public per-block value \(x=g^v \pmod p\) can hide attacked blocks in honest noise, gating them on a predicate of its discrete logarithm, making detection a discrete logarithm problem that defeats every efficient classical monitor yet yields to a quantum kernel recovering…
- arXiv · Published · First archived
Symmetry resolved entanglement in Schwinger pair production ↗
We study the charge resolved structure of the pairwise mode entanglement produced by the Schwinger effect. Using the $U(1)$ electric charge of quantum electrodynamics, we decompose the entanglement of the reduced density matrices of momentum modes into individual charge sectors, applying the symmetry resolved entanglement entropy to the pure bipartition reductions and the charge imbalance resolved negativity to the mixed particle-antiparticle pair. For a constant electric field we obtain closed form results for every mode pairing, with all field dependence controlled by the single pair product…
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.