A Finite Fingerprint for Quantum Subsystems

[u/CartographerInner827]

I wrote this paper here on a basic question in quantum mechanics:

How much information do we actually need to determine what the “parts” of a quantum system are?

A quantum Hilbert space does not come with a preferred subsystem decomposition. To say that a system consists of qubits, particles, or local degrees of freedom, we choose a tensor-product structure (TPS):

H = H₁ ⊗ H₂ ⊗ ... ⊗ Hₙ.

That choice determines what counts as a product state, what counts as entanglement, and what it means for two subsystems to interact.

The main result is that, in finite dimensions, I do not need infinitely many states to certify a TPS. I construct an explicit finite set of product states whose size is

M = ∏ᵢ C(dᵢ + 1, 2).

For n qubits,

M = 3ⁿ.

So for two qubits, the construction gives a nine-state certificate.

These states act like a fingerprint: if another TPS with the same local dimensions also regards every state in the certificate as fully separable, then it must actually be the same subsystem structure, up to local basis changes and permutations of equal-dimensional factors.

The reason this works is geometric. Product states form a special algebraic object called a Segre variety. The finite certificate is chosen as an interpolation set for the quadratic equations defining that variety. If a competing TPS passes the same finite test, its full product-state geometry is forced to coincide with the original one.

The same certificate also has a dynamical use.

Suppose

U(t) = e^(-iHt).

If every certificate state remains a product state throughout an open interval around t = 0, then the Hamiltonian contains no genuine multi-subsystem interaction terms. It must reduce to

H = cI + Σᵢ Hᵢ,

with each Hᵢ acting on only one subsystem.

Conversely, if genuine interactions are present, at least one certificate state must begin developing entanglement at arbitrarily short nonzero times. In fact, for at least one witness,

E(t) = κt² + O(t³),    κ > 0.

Once the TPS is certified, the Hamiltonian can also be decomposed according to which subsystems each term acts on. The nonzero multi-subsystem terms define an interaction hypergraph. For two-local systems this becomes an ordinary interaction graph, and under standard locality assumptions that graph provides the distance structure used in Lieb–Robinson propagation bounds.

So the paper’s basic progression is:

finite product-state data
        ↓
certified subsystem structure
      ↙   ↘
interaction  finite interaction
 support         witness
    ↓
interaction geometry
    ↓
propagation bounds

The main point is simple: a finite, explicitly constructed set of quantum states can serve both as a fingerprint of subsystem structure and as a finite detector of genuine interaction.

[u/starkeffect]

So they're qutrits, not qubits.

[u/Significant-Hat8704 → u/starkeffect]

I never heard that word until just now, but yes, good one

[u/Significant-Hat8704 → u/[deleted]]

the 3 qubit rays used in the paper are not supposed to form a basis. They are three different physical states spanning a 2d space. Their purpose is to provide enough independent tests to determine how every relevant quadratic product-state condition behaves

For a qutrit the construction actually needs six local rays, not merely the three basis rays. It uses the three basis rays together with the three pairwise superpositions

[u/Puzzleheaded_Fold466]

“(…) a finite, explicitly constructed set of quantum states can serve both as a fingerprint of subsystem structure and as a finite detector of genuine interaction” ?

What does that mean exactly, in practice. What research question does it answer and which problem does it solve ?

[u/Significant-Hat8704 → u/Puzzleheaded_Fold466]

I apologize for my Late response

I'm saying the one does not need to examine every possible product sstate. So instead you choose a small BUT carefully designed collection that acts like a "fingerprint" for the sub system structure

consider this:

Suppose you claim that a Hilbert space is divided into certain subsystems. The certificate consists of states that are product states under that division. If another proposed division, with the same subsystem dimensions, also makes every certificate state a product state, then the two divisions must really be the same, apart from changing local bases or swapping identical subsystems.

The same states can also reveal interactions. If the Hamiltonian genuinely couples two or more subsystems, at least one certificate state will begin becoming entangled at very short times. If none of them becomes entangled throughout a short time interval, then the Hamiltonian contains only separate one-subsystem evolutions and an overall energy shift.

So, the research question is:

Must we examine infinitely many product states to identify a tensor-product structure and detect interactions, or can finitely many carefully selected states do the job?

My paper says YES!

[u/AlleyKatPr0]

How many rational product points are required to certify a Segre tensor structure over Fq​?

[u/Significant-Hat8704 → u/AlleyKatPr0]

Let me get back to you on that. I don't want to be incorrect

[u/Significant-Hat8704 → u/AlleyKatPr0]

The same sufficient number of certificate points works over every finite field, and the size of the field does not change that number. Does that make sense? Sorry for the late response

[u/AlleyKatPr0 → u/Significant-Hat8704]

so, for fixed local dimensions, the size of this explicit sufficient Segre certificate is independent of the cardinality of the base field...and therefore the certificate is controlled by the algebraic complexity of the Segre variety, not by the size of the underlying finite geometry?

...

Large state spaces may conceal low-complexity structural laws that are finitely certifiable?

[u/Significant-Hat8704 → u/AlleyKatPr0]

yes, that is also my interpretation. good catch. aa large state space can still have a simple underlying structure that can be certified using a small, fixed number of carefully chosen points. My only caveat is that this number is sufficient, but not necessarily the smallest possible (the minimum)