2 papers
quant-ph2025
Asymptotic Gate Count Bounds for Ancilla-Free Single-Qubit Synthesis with Arithmetic Gates
Kaoru Sano, Hayata Morisaki, Seiseki Akibue
We study ancilla-free approximation of single-qubit unitaries by gate sequences over Clifford+, where or their generalization. Let denote th…
quant-ph2025
Optimal ancilla-free Clifford+T synthesis for general single-qubit unitaries
Hayata Morisaki, Kaoru Sano, Seiseki Akibue
We propose two Clifford+ synthesis algorithms that are optimal with respect to -count. The first algorithm, called deterministic synthesis, approximates any single-qubit unit…