Adjacency perfect state transfer conjecture for trees
Statement
Let be a tree, let and denote the paths on two and three vertices, and say that has adjacency perfect state transfer if its adjacency-matrix continuous-time quantum walk transfers a state between two vertices with fidelity equal to . Adjacency perfect state transfer conjecture. No tree except for and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.