Thiago Bergamaschi

Orcid: 0009-0006-5579-8090

According to our database1, Thiago Bergamaschi authored at least 14 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations.
CoRR, March, 2026

Fast Mixing of Quantum Spin Chains at All Temperatures.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Rapid mixing for Gibbs states within a logical sector: a dynamical view of self-correcting quantum memories.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Derandomised tensor product gap amplification for quantum Hamiltonians.
CoRR, October, 2025

On Fault Tolerant Single-Shot Logical State Preparation and Robust Long-Range Entanglement.
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

On Split-State Quantum Tamper Detection.
Proceedings of the Advances in Cryptology - ASIACRYPT 2025, 2025

2024
List Decodable Quantum LDPC Codes.
CoRR, 2024

When can classical neural networks represent quantum states?
CoRR, 2024

Approaching the Quantum Singleton Bound with Approximate Error Correction.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

On the Communication Complexity of Secure Multi-Party Computation With Aborts.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Quantum Computational Advantage with Constant-Temperature Gibbs Sampling.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Pauli Manipulation Detection Codes and Applications to Quantum Communication over Adversarial Channels.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Improved Product-State Approximation Algorithms for Quantum Local Hamiltonians.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2021
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021


  Loading...