Luowen Qian

MCS 138C
111 Cummington Mall
Boston, MA 02215

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. Cryptography from Pseudorandom Quantum States
   Prabhanjan Ananth, Luowen Qian, Henry Yuen
   CRYPTO 2022 (to appear) [ePrint]
2. Beating Classical Impossibility of Position Verification
   Jiahui Liu, Qipeng Liu, Luowen Qian
   ITCS 2022 [arXiv]
3. Tight Quantum Time-Space Tradeoffs for Function Inversion
   Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
   FOCS 2020 [ECCC]
4. Lower Bounds for Function Inversion with Quantum Advice
   Kai-Min Chung, Tai-Ning Liao, Luowen Qian
   ITC 2020 [arXiv]
5. Adaptively Secure Garbling Schemes for Parallel Computations
   Kai-Min Chung, Luowen Qian
   TCC 2019 [ePrint]

Talks & Posters

1. Cryptography from Pseudorandom Quantum States
   UC Berkeley Theory CS Seminar (January 11, 2022) [Slides]
2. Beating Classical Impossibility of Position Verification
   QIP 2022 contributed talk (March 10, 2022) [Video]; Ottawa QUASAR seminar (March 4, 2022); ITCS 2022 (February 2, 2022) [Video]; Charles River Crypto Day (November 19, 2021); BUsec Seminar (September 29, 2021) [Slides]
3. Tight Quantum Time-Space Tradeoffs for Function Inversion
   BU Algorithms and Theory Seminar (April 5, 2021)
4. Lower Bounds for Function Inversion with Quantum Advice
   ITC 2020 (June 17, 2020), QIP 2020 (poster)
5. Adaptively Secure Garbling Schemes for Parallel Computations
   TCC 2019 (December 4, 2019), NY CryptoDay (October 18, 2019)

Manuscripts

1. Nonuniform Linear Depth Circuits Decide Everything
   Luowen Qian
   For April Fool's day, 2020 [viXra]

Misc

GitHub, CV

Perpetually under construction 🚧