ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn qudits be arranged according to a graph, and let an ϵ\epsilon-approximate tt-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 nn qudits requires more connections to form an ϵ\epsilon-approximate tt-design than the linear graph, which requires

Θ(log⁡n)\Theta(\log n)

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 t>2t>2, 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 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.