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 ↗1662 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
The Commuting Local Hamiltonian Problem: Relativized Evidence Against BQP-Hardness ↗
The commuting local-Hamiltonian (CLH) problem is a restriction of the local-Hamiltonian problem, in which the terms of the Hamiltonian are required to pairwise commute. A long line of work has shown that the problem lies in $\mathsf{NP}$ for certain families of commuting local Hamiltonians. Nevertheless, there has been no formal evidence against the possibility that the general CLH problem is $\mathsf{QMA}$-complete. CLH is complete for the complexity class $\mathsf{QIMA}$, defined through quantum verifiers whose local gates commute. Therefore, CLH is $\mathsf{QMA}$-complete if and only if $\m…
- arXiv · Published · First archived
Certified Randomness with Optimal Rate ↗
The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require nearly uniform randomness, whose rate (the ratio of min-entropy to bitlength) is ~ 1. However, existing protocols for certified randomness either produce weakly random strings with rate o(1), or they require a trusted random seed. We show how to certify randomness with the optimal rate ~ 1 without requiring any trusted randomness from the verifier. Our protocol is secure unconditionally in the quantum random oracle mod…
- arXiv · Published · First archived
Frequency comb generation in active optomechanical cavities ↗
We numerically investigate frequency-comb generation in an electrically pumped vertical-cavity surface-emitting laser coupled to two mechanical modes of a suspended mirror. Displacement-dependent cavity loss and radiation-pressure feedback couple the mechanical motion to the carrier and photon densities, producing harmonics and combination-frequency components in the photon-density spectrum. Mechanical quality factors primarily control the intensity of comb lines, whereas resonance frequencies determine their spectral distribution. The initial mechanical amplitudes influence the threshold curr…
- arXiv · Published · First archived
Quantum-echo Markov process for combinatorial optimization ↗
We introduce a quantum-echo Markov process for combinatorial optimization. Quantum dynamics based on quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA) is used to engineer the transition kernel. Increasing the annealing time in QA or the number of layers in QAOA enables transitions to explore distant configurations while suppressing large energy changes. The Hamming-space delocalization originates from operator spreading, whereas the energy-space localization arises from a dynamically generated correlation. For optimization, we propose quantum-echo local optimizati…
- arXiv · Published · First archived
Tight Parallel Repetition for Private-Coin Arguments ↗
We show that assuming the existence of homomorphic encryption, parallel repetition of all interactive arguments (after being run under homomorphic encryption) reduces the soundness error at a tight exponential rate even in the post-quantum setting. Moreover, we generalize this result to hold for threshold verifiers, where the parallel repeated verifier accepts if and only if at least $t$ of the executions are accepted (for some threshold $t$). Prior to this work, these results were known only when the cheating prover was assumed to be classical, and it was not known how to achieve tight bounds…
- arXiv · Published · First archived
Defect-Aware Parallel Atom Reloading Protocol for Neutral-Atom Quantum Computers ↗
In this work, we propose a defect-aware parallel atom reloading protocol that reloads atoms based on defect information to increase the atom filling rate. The proposed protocol is useful for neutral-atom quantum computers, where reloading atoms into the defects, or atom-loss positions, is mandatory for continuous operation against atom loss. Our protocol takes advantage of both parallelism and defect awareness to improve atom-reloading efficiency. The proposed protocol consists of the coherent atom reloading operation and the defect-aware planner. The former replenishes the defects with atoms…
- arXiv · Published · First archived
Boundary-rank obstructions and measurement-assisted recovery in dissipative flat-band preparation ↗
Number-conserving cooling can fail to prepare an interacting flat-band target when Pauli exclusion blocks its transfer destinations. We study this failure on vertex-edge decorated graphs at one particle per flat orbital. The rank of a cut block of the flat-orbital Gram matrix bounds the number of residual source directions that can remain flat. For sublinear-range cooling with no Hamiltonian term, separated spin domains on periodic decorated hypercubic lattices support exponentially many stationary states with a nonzero bright-particle density. For a chain with fixed finite cooling range, we c…
- arXiv · Published · First archived
Semi-Quantum Cryptography with Certified Deletion ↗
Certified deletion allows a client to upload encrypted data to a server as a quantum state, then later request that the server delete their data and detect whether the server complies. If verification passes, then the data on the server will remain hidden even if the decryption key is later leaked. In publicly verifiable certified deletion, the verification key is published so that anyone may check for deletion compliance. In this work, we give a general compiler to publicly verifiable certified deletion that allows the client to initially upload the *quantum* ciphertext using purely *classica…
- Hacker News · Posted on Hacker News · First archived
Spikes, wiring, and general principles: Neuroscience and spiking neural networks ↗
Hacker News discussion.
- arXiv · Published · First archived
Quantum Time-Lock Puzzles in the Quantum Random Oracle Model ↗
A time-lock puzzle allows a sender to hide a message in a puzzle such that recovering the message requires substantially more sequential computation than the time required to generate the puzzle, even when parallel computation is allowed. Applications of time-lock puzzles include timed-release encryption, sealed-bid auctions, electronic voting, fair contract signing, coin flipping, and Byzantine consensus. However, time-lock puzzles are known to be impossible in the classical random oracle model. To overcome the classical barrier, in this work we consider quantum time-lock puzzles, in which th…
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.