SEARCH · Search NASA

Results for “Turing machines”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

2 records

All sources NASA NTRS DOE OSTI

DOE OSTI2024

On the hardness of learning ground state entanglement of geometrically local Hamiltonians

Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In this work we study the computational complexity of this problem, given the Hamiltonian as input. Our main result is that to show it is cryptographically hard to determine if the ground state of a geometrically local, polynomially gapped Hamiltonian on qudits (d=O(1)) has near-area law vs near-volume law entanglement. This improves prior work of Bouland et al. (arXiv:2311.12017) showing this for non-geometrically local Hamiltonians. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our proof works by constructing a novel form of public-key pseudo-entanglement which is highly space-efficient, and combining this with a modification of Gottesman and Irani's quantum Turing machine to Hamiltonian construction. Our work suggests that the problem of learning so-called "gapless" quantum phases of matter might be intractable.

Computational Complexity (cs.CC)↗

DOE OSTI2024

SCIMON: Scientific Inspiration Machines Optimized for Novelty

We explore and enhance the ability of neu- ral language models to generate novel scien- tific directions grounded in literature. Work on literature-based hypothesis generation has traditionally focused on binary link prediction— severely limiting the expressivity of hypothe- ses. This line of work also does not focus on optimizing novelty. We take a dramatic depar- ture with a novel setting in which models use as input background contexts (e.g., problems, experimental settings, goals), and output natu- ral language ideas grounded in literature. We present SCIMON, a modeling framework that uses retrieval of “inspirations” from past scien- tific papers, and explicitly optimizes for novelty by iteratively comparing to prior papers and up- dating idea suggestions until sufficient novelty is achieved. Comprehensive evaluations reveal that GPT-4 tends to generate ideas with over- all low technical depth and novelty, while our methods partially mitigate this issue. Our work represents a first step toward evaluating and developing language models that generate new ideas derived from the scientific literature.

Ji, Heng↗