ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RX:Cm⊗Cm⟶Cm⊗CmR_X:\mathbb C^m\otimes\mathbb C^m\longrightarrow\mathbb C^m\otimes\mathbb C^m be a unitary (generalized) RR-matrix of finite order, used to define braid group representations by assigning

I⊗(i−1)⊗RX⊗I⊗(n−i−1)I^{\otimes(i-1)}\otimes R_X\otimes I^{\otimes(n-i-1)}

to the braid generator σi\sigma_i. Finite-order RR-matrix simulation conjecture. Braiding quantum circuits arising from RXR_X 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 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.