Tight Parallel Repetition Theorem for Efficient Quantum Interactive Protocols

The authors prove a tight parallel repetition theorem for 3-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. They also show that the security of 4-message computationally secure protocols does not generally decrease under parallel repetition.