Finite-order generalized R-matrix simulation conjecture
Statement
Let be a unitary (generalized) -matrix of finite order, used to define braid group representations by assigning
to the braid generator . Finite-order -matrix simulation conjecture. Braiding quantum circuits arising from can always be simulated classically. This claim concerns efficient classical simulation of braid-based quantum circuits and extends the motivation of the Knill–Gottesman theorem from Clifford circuits to generalized anyonic settings. The supplied text does not indicate whether the assertion has been proved or remains 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.