4 papers
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…
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…
Explicit quantum surrogates for quantum kernel models
Akimoto Nakayama, Hayata Morisaki, Kosuke Mitarai +2
Quantum machine learning (QML) leverages quantum states for data encoding, with key approaches being explicit models that use parameterized quantum circuits and implicit models tha…
Error Crafting in Mixed Quantum Gate Synthesis
Nobuyuki Yoshioka, Seiseki Akibue, Hayata Morisaki +2
In fault-tolerant quantum computing, errors in unitary gate synthesis is comparable with noise inherent in the gates themselves. While mixed synthesis can suppress such coherent er…