pith. sign in

arxiv: 2303.12979 · v1 · pith:WEA6EFTFnew · submitted 2023-03-23 · 🪐 quant-ph

Optimal Synthesis of Multi-Controlled Qudit Gates

classification 🪐 quant-ph
keywords synthesisquditgatesmulti-controlledquditsancillalinear-sizeone-clean-ancilla
0
0 comments X
read the original abstract

We propose a linear-size synthesis of the multi-controlled Toffoli gate on qudits with at most one borrowed ancilla. This one ancilla can even be saved when the qudit dimension is odd. Our synthesis leads to improvements in various quantum algorithms implemented on qudits. In particular, we obtain (i) a linear-size and one-clean-ancilla synthesis of multi-controlled qudit gates; (ii) an optimal-size and one-clean-ancilla synthesis of unitaries on qudits; (iii) a near-optimal-size and ancilla-free/one-borrowed-ancilla implementation of classical reversible functions as qudit gates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Preparing multi-qudit states in a definite-weight subspace

    quant-ph 2026-06 unverdicted novelty 6.0

    A deterministic algorithm prepares arbitrary multi-qudit states in definite-weight subspaces via Gray codes for multiset permutations and applies it to SU(3) Bethe states and SU(d) Dicke states.

  2. Preparing multi-qudit states in a definite-weight subspace

    quant-ph 2026-06 unverdicted novelty 6.0

    A deterministic algorithm prepares arbitrary multi-qudit states in a definite-weight subspace via Gray-code ordering of multiset permutations, reducing preparation to controlled 2-qudit Gray rotations, and is demonstr...