Ran Raz

Professor Ran Raz specializes in complexity theory at Princeton University's Department of Computer Science. His research targets lower bounds in computational models, quantum communication, and derandomization. Current investigations include quantum logspace verifiability and memory-sample tradeoffs in learning algorithms.

Research pillars:

• Boolean/arithmetic circuit complexity
• Quantum computation and communication
• Probabilistically checkable proofs

Publications reflect a focus on quantum-classical hybrid systems and foundational limits of computation.

Lab affiliations: Quantum research group at Princeton CS.