tera.ai

Knowledge Graph

Graph explorer

Search resolved entities, walk their edges, and read the sentence behind every one.

Entities25 of 207,987

All entities

Entity

QMA(2)

technology1 mentionslast seen Oct 15, 2026

A complexity class that generalizes QMA to two unentangled proofs with only trivial NEXP upper bound.

Relationships 2

QMA(2)

Relationship

unentanglementapplies toQMA(2)

85% confidence1 supporting mentions

Either name opens that entity’s relationships.

Sources 1