ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree, let P2P_2 and P3P_3 denote the paths on two and three vertices, and say that TT has adjacency perfect state transfer if its adjacency-matrix continuous-time quantum walk transfers a state between two vertices with fidelity equal to 11. Adjacency perfect state transfer conjecture. No tree except for P2P_2 and P3P_3 admits adjacency perfect state transfer. The paper establishes this for trees with a perfect matching and reports computational verification for all trees up to ten vertices, but leaves the general case open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.