Luowen Qian

CDS 1043E
665 Commonwealth Ave
Boston, MA 02215

Email: <firstname>q@bu.edu or <firstname>@qcry.pt

I am a fifth-year Ph.D. student at Boston University. I am very fortunate to have Ran Canetti as my advisor. My research interest is mainly on quantum computation and cryptography.

News

Teaching

Publications

  1. An efficient quantum parallel repetition theorem and applications
    John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen
    To appear in STOC 2024 [arXiv] (contributed short plenary talk at QIP 2024)
  2. Quantum Cryptography in Algorithmica
    William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
    STOC 2023 [arXiv] (contributed talk at QIP 2023, invited talk at QCrypt 2023)
  3. On the computational hardness needed for quantum cryptography
    Zvika Brakerski, Ran Canetti, Luowen Qian
    ITCS 2023 [ePrint]
  4. Collusion-Resistant Functional Encryption for RAMs
    Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian
    ASIACRYPT 2022 [ePrint]
  5. Collusion Resistant Copy-Protection for Watermarkable Functionalities
    Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry
    TCC 2022 [ePrint] (contributed talk at QIP 2023)
  6. Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
    Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen
    TCC 2022 [arXiv] (contributed talk at QCrypt 2022, short plenary talk merged with AQY22 at QIP 2023)
  7. Cryptography from Pseudorandom Quantum States
    Prabhanjan Ananth, Luowen Qian, Henry Yuen
    CRYPTO 2022 [ePrint] (contributed short plenary talk merged with AGQY22 at QIP 2023)
  8. Beating Classical Impossibility of Position Verification
    Jiahui Liu, Qipeng Liu, Luowen Qian
    ITCS 2022 [arXiv]
  9. Tight Quantum Time-Space Tradeoffs for Function Inversion
    Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
    FOCS 2020 [arXiv] (invited keynote at TQC 2021)
  10. Lower Bounds for Function Inversion with Quantum Advice
    Kai-Min Chung, Tai-Ning Liao, Luowen Qian
    ITC 2020 [arXiv]
  11. Adaptively Secure Garbling Schemes for Parallel Computations
    Kai-Min Chung, Luowen Qian
    TCC 2019 [ePrint]

Selected talks

  1. Unconditionally secure quantum commitments with preprocessing
    MIT Cryptography and Information Security seminar (February 16, 2024) [Slides]
  2. An efficient quantum parallel repetition theorem and applications
    UCSD Theory Seminar (January 29, 2024) [Slides]
  3. Quantum Cryptography in Algorithmica
    STOC 2023 (June 23, 2023); A special crypto day in honor of Ran Canetti on the occasion of his 60th birthday (May 12, 2023)
  4. Quantum pseudorandomness in Algorithmica, and its implications to cryptography and complexity
    Minimal Complexity Assumptions for Cryptography workshop @ Simons Institute (May 5, 2023)
  5. Cryptography from Quantum Pseudorandomness
    IQC Math and Computer Science Seminar (March 9, 2023) [Slides]
  6. On the computational hardness needed for quantum cryptography
    ITCS 2023 (January 12, 2023); QCW 2022; Third Kyoto Workshop on Quantum Information, Computation, and Foundations (October 18, 2022) [Slides]; MIT Cryptography and Information Security seminar (September 30, 2022)
  7. Cryptography from Pseudorandom Quantum States
    QCrypt 2022 contributed talk (August 29, 2022) [Video, Slides]; CRYPTO 2022 (August 15, 2022) [Video abstract, Slides, Recording]; UC Berkeley Theory CS Seminar (January 11, 2022) [Slides]
  8. Beating Classical Impossibility of Position Verification
    QCW 2022; QIP 2022 contributed talk (March 10, 2022) [Recording]; Ottawa QUASAR seminar (March 4, 2022); ITCS 2022 (February 2, 2022) [Video, Recording]; Charles River Crypto Day (November 19, 2021); BUsec Seminar (September 29, 2021) [Slides]

Manuscripts

  1. Unconditionally secure quantum commitments with preprocessing
    Luowen Qian
    [arXiv]
  2. Unitary Complexity and the Uhlmann Transformation Problem
    John Bostanci, Yuval Efron, Tony Metger, Alexander Poremba, Luowen Qian, Henry Yuen
    [arXiv] (contributed long plenary talk at QIP 2024)
  3. Nonuniform Linear Depth Circuits Decide Everything
    Luowen Qian
    For April Fool's day, 2020 [viXra]

Misc

CVE-2021-0980

GitHub, CV

Perpetually under construction 🚧