Ross–Selinger asymptotic T-count conjecture for single-qubit Z rotations
Statement
Let be a single-qubit rotation, and let be an approximation error. The rotation is exactly synthesizable when it can be represented exactly by the relevant elementary gate set; otherwise it is not exactly synthesizable.
Ross–Selinger conjecture. The asymptotic scaling of the -count required to approximate within error is
if and is not exactly synthesizable, while it is
if and is not exactly synthesizable.
This conjecture describes the asymptotic gate-count cost of approximating fixed single-qubit rotations, including the distinction between typical targets and arithmetic edge cases. Despite substantial work on exact and approximate synthesis, the conjecture 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.