Luowen Qian

Ostracized and officeless (please send help)

Email: <firstname>q@bu.edu

I am a Ph.D. student at Boston University. I am very fortunate to have Ran Canetti as my advisor. My research interest includes quantum computation, cryptography, and other aspects of theoretical computer science in general.

Teaching

• CS 538: Fundamentals of Cryptography (Spring 2022), Teaching Fellow
• CS 332: Theory of Computation (Fall 2020), Teaching Fellow

Publications

1. On the computational hardness needed for quantum cryptography
   Zvika Brakerski, Ran Canetti, Luowen Qian
   ITCS 2023 (to appear) [ePrint]
2. Collusion-Resistant Functional Encryption for RAMs
   Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian
   ASIACRYPT 2022 (to appear) [ePrint]
3. Collusion Resistant Copy-Protection for Watermarkable Functionalities
   Jiahui Liu, Qipeng Liu, Luowen Qian, Mark Zhandry
   TCC 2022 (to appear) [ePrint]
4. Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications
   Prabhanjan Ananth, Aditya Gulati, Luowen Qian, Henry Yuen
   TCC 2022 (to appear) [arXiv]
5. Cryptography from Pseudorandom Quantum States
   Prabhanjan Ananth, Luowen Qian, Henry Yuen
   CRYPTO 2022 [ePrint]
6. Beating Classical Impossibility of Position Verification
   Jiahui Liu, Qipeng Liu, Luowen Qian
   ITCS 2022 [arXiv]
7. Tight Quantum Time-Space Tradeoffs for Function Inversion
   Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
   FOCS 2020 [ECCC]
8. Lower Bounds for Function Inversion with Quantum Advice
   Kai-Min Chung, Tai-Ning Liao, Luowen Qian
   ITC 2020 [arXiv]
9. Adaptively Secure Garbling Schemes for Parallel Computations
   Kai-Min Chung, Luowen Qian
   TCC 2019 [ePrint]

Talks & Posters

1. On the computational hardness needed for quantum cryptography
   QCW 2022; Third Kyoto Workshop on Quantum Information, Computation, and Foundations (October 18, 2022) [Slides]; MIT Cryptography and Information Security seminar (September 30, 2022); CRYPTO 2022 Rump Session (August 16, 2022)
2. Collusion Resistant Copy-Protection for Watermarkable Functionalities
   QCrypt 2022 (joint poster)
3. 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]
4. 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]
5. Tight Quantum Time-Space Tradeoffs for Function Inversion
   BU Algorithms and Theory Seminar (April 5, 2021)
6. Lower Bounds for Function Inversion with Quantum Advice
   ITC 2020 (June 17, 2020), QIP 2020 (poster)
7. Adaptively Secure Garbling Schemes for Parallel Computations
   TCC 2019 (December 4, 2019), NY CryptoDay (October 18, 2019)

Manuscripts

1. Quantum Cryptography in Algorithmica
   William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal
   [arXiv]
2. Nonuniform Linear Depth Circuits Decide Everything
   Luowen Qian
   For April Fool's day, 2020 [viXra]

Misc

CVE-2021-0980

GitHub, CV

Perpetually under construction 🚧