Faster Mixing of Higher-Dimensional Random Reversible Circuits
<|reference_start|>Faster Mixing of Higher-Dimensional Random Reversible Circuits: We continue the study of the approximate $k$-wise independence of random reversible circuits as permutations of $\{\pm1\}^n$. Our main result is the first construction of a natural class of random reversible circuits with a sublinear-in-$n$ dependence on depth. Our construction is motivated by considerations in practical cryptography and is somewhat inspired by the design of practical block ciphers, such as DES and AES. Previous constructions of He and O'Donnell [HO24], which were built with gate architectures on one-dimensional lattices, suffered from an inherent linear-in-$n$ dependence on depth. The main novelty of our circuit model is a gate architecture built on higher-dimensional lattices.<|reference_end|>
@article{gay2024faster,
    title={Faster Mixing of Higher-Dimensional Random Reversible Circuits},
    author={William Gay, William He, Nicholas Kocurek},
    journal={arXiv preprint arXiv:2409.14614},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.14614},
    primaryClass={cs.CC cs.CR}
}