Renyi entropies as a measure of the complexity of counting problems - Claudio Chamon; Eduardo R. Mucciolo (CoRR, 2013)

Quantum Vertex Model for Reversible Classical Computing. - Claudio Chamon; Eduardo R. Mucciolo; Andrei E. Ruckenstein; Zhi-Cheng Yang (CoRR, 2016)

Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle. - Zhi-Cheng Yang; Armin Rahmani; Alireza Shabani; Hartmut Neven; Claudio Chamon (CoRR, 2016)

Iterative Compression-Decimation Scheme for Tensor Network Optimization. - Zhi-Cheng Yang; Stefanos Kourtis; Claudio Chamon; Eduardo R. Mucciolo; Andrei E. Ruckenstein (CoRR, 2017)

Fast counting with tensor networks. - Stefanos Kourtis; Claudio Chamon; Eduardo R. Mucciolo; Andrei E. Ruckenstein (CoRR, 2018)

Reaching the speed limit of classical block ciphers via quantum-like operator spreading. - Claudio Chamon; Eduardo R. Mucciolo; Andrei E. Ruckenstein (CoRR, 2020)

Encrypted Operator Computing: an alternative to Fully Homomorphic Encryption. - Claudio Chamon; Jonathan Jakes-Schauer; Eduardo R. Mucciolo; Andrei E. Ruckenstein (CoRR, 2022)

Circuit complexity and functionality: a thermodynamic perspective. - Claudio Chamon; Andrei E. Ruckenstein; Eduardo R. Mucciolo; Ran Canetti (CoRR, 2023)

Towards general-purpose program obfuscation via local mixing. - Ran Canetti; Claudio Chamon; Eduardo R. Mucciolo; Andrei E. Ruckenstein (IACR Cryptol. ePrint Arch., 2024)

A Matrix Product State Representation of Boolean Functions. - Umut Eren Usturali; Claudio Chamon; Andrei E. Ruckenstein; Eduardo R. Mucciolo (CoRR, 2025)