Angelos Pelecanos

Research Themes

Publications by Topic

A thematic view of my publications across quantum information, cryptography, and quantum complexity.

Chronological list Back to homepage

Quantum Learning Theory

  1. Mixed state tomography reduces to pure state tomography

    Angelos Pelecanos, Jack Spilecki, Ewin Tang, John Wright

    Manuscript 2025

    PDF

  2. The debiased Keyl's algorithm: a new unbiased estimator for full state tomography

    Angelos Pelecanos, Jack Spilecki, John Wright

    58th ACM Symposium on Theory of Computing (STOC 2026)

    29th Annual Quantum Information Processing Conference (QIP 2026)

    PDF

  3. Beating full state tomography for unentangled spectrum estimation

    Angelos Pelecanos, Xinyu Tan, Ewin Tang, John Wright

    37th ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)

    PDF

Theory for Practical Cryptography

  1. When Simple Permutations Mix Poorly: Limited Independence Does Not Imply Pseudorandomness

    Jesko Dujmovic, Angelos Pelecanos, Stefano Tessaro

    45th Annual International Conference on the Theory and Applications of Cryptographic Techniques (Eurocrypt 2026)

    PDF

  2. How Fast Does the Inverse Walk Approximate a Random Permutation?

    Vishesh Jain, Tianren Liu, Clayton Mizgerd, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan

    46th Annual International Cryptology Conference (CRYPTO 2026)

    PDF

  3. More Efficient Approximate k-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities

    Lucas Gretta, William He, Angelos Pelecanos

    36th ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)

    PDF

  4. Layout Graphs, Random Walks, and the t-wise Independence of SPN Block Ciphers

    Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan

    43rd International Cryptology Conference (CRYPTO 2023)

    PDF Code

  5. Non-Asymptotic t-wise Independence of Substitution-Permutation Networks

    MIT MEng Thesis

    PDF
    Erratum

    The main theorem of Section 4 (O(t)-round MiMC is t-wise independent) is not known to be true.

Quantum Complexity and Quantum Cryptography

  1. On the Computational Hardness of Quantum One-Wayness

    Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos

    Quantum 9 (2025)

    PDF

  2. Classical vs Quantum Advice under Classically-Accessible Oracle

    Xingjian Li, Qipeng Liu, Angelos Pelecanos, Takashi Yamakawa

    15th Innovations in Theoretical Computer Science Conference (ITCS 2024)

    PDF