1 citations · 1 across the 2 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Quantum circuit compilation with constant overhead
Chenyi Zhang, Xinyu Tan, Robin Kothari +2
Compiling a continuous gate set to a discrete universal gate set generally incurs an overhead. A circuit composed of arbitrary one- and two-qubit gates can be -approximated…
quant-ph2025★ 1 cited
Multi-qubit Toffoli with exponentially fewer T gates
David Gosset, Robin Kothari, Chenyi Zhang
Prior work of Beverland et al. has shown that any exact Clifford+ implementation of the -qubit Toffoli gate must use at least gates. Here we show how to get away with…
quant-ph2024
Quantum state preparation with optimal T-count
David Gosset, Robin Kothari, Kewen Wu
How many T gates are needed to approximate an arbitrary -qubit quantum state to within error ? Improving prior work of Low, Kliuchnikov, and Schaeffer, we show that…