,
Springer
Theory of Computing Systems
Quantum Information Processing
Algorithms and Complexity

Buhrman, H., Fortnow, L., Koucký, M., Rogers, J., & Vereshchagin, N. K. (2010). Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?. Theory of Computing Systems, 46(1), 143–156.