CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 22, 2025

Complexity of deciding whether a subcomponent of a pure state is unentangled

Quantum Computing SE Archived Jun 02, 2026 ! Full text unavailable

Suppose I have an $n$ -qubit pure state $|\psi\rangle$ that I can prepare using a unitary $U$ s.t. $U|0\rangle = |\psi\rangle$ . I would like to determine whether the first qubit in the system is unentangled from the rest. The other registers may have some nontrivial entanglement with each other, but I'm not interested in that. I was wondering if there are any references that have looked at this problem (or perhaps a weaker formulation of it, though I'm not sure how a weaker formulation would be

Full text unavailable — view original
✦ AI Summary · Claude Sonnet


    Full text unavailable.
    Open original ↗
    💬 Team Notes
    Article Info
    Source
    Quantum Computing SE
    Category
    ◌ Quantum Computing
    Published
    Apr 22, 2025
    Archived
    Jun 02, 2026
    Full Text
    ✗ Not available
    Open Original ↗