Linear-graph connection optimality conjecture for approximate unitary designs
Statement
Let qudits be arranged according to a graph, and let an -approximate -design be formed by a random quantum circuit using two-qudit gates on the graph's edges. The connection count is the number of graph connections required to form the design.
Linear-graph connection optimality conjecture. No other graph on qudits requires more connections to form an -approximate -design than the linear graph, which requires
connections.
Numerical results indicate that the tested graph families require roughly comparable connection counts, with the linear graph appearing slowest among the tested architectures. The authors do not test every possible graph or values , so the conjecture remains speculative.
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.