1 citations · 1 across the 2 of their papers we have counts for
3 papers
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…
cs.DC2024
A Fast Confirmation Rule for the Ethereum Consensus Protocol
Roberto Saltini, Mikhail Kalinin, Luca Zanolini +3
A Confirmation Rule is an algorithm run by network nodes to determine whether a block will remain permanently in the canonical chain. The only Confirmation Rule currently available…