ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rz(θ):=exp⁡(−iθZ/2)R_z(\theta):=\exp(-i\theta Z/2) be a single-qubit ZZ rotation, and let ε\varepsilon 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 TT-count required to approximate Rz(θ)R_z(\theta) within error ε\varepsilon is

4log⁡2(1ε)4\log_2\left(\tfrac{1}{\varepsilon}\right)

if tan⁡θ2∈Q(2)\tan\frac{\theta}{2}\in\mathbb{Q}(\sqrt{2}) and Rz(θ)R_z(\theta) is not exactly synthesizable, while it is

3log⁡2(1ε)3\log_2\left(\tfrac{1}{\varepsilon}\right)

if tan⁡θ2∉Q(2)\tan\frac{\theta}{2}\notin\mathbb{Q}(\sqrt{2}) and Rz(θ)R_z(\theta) 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 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.