human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Quantum lower bounds for the collision and the element distinctness problems"
  Abstract: Given a function  f  as an oracle, the collision problem is to find two distinct indexes  i  and  j  such that  f ( i ) =  f ( j ), under the promise that such indexes exist. Since the security of many fundamental cryptographic primitives depends on the hardness of finding collisions, our lower bounds provide evidence for the existence of cryptographic primitives that are immune to quantum cryptanalysis. We prove that any quantum algorithm for finding a collision in an  r -to-one function must evaluate the function Ω(( n / r ) 1/3 ) times, where  n  is the size of the domain and  r | n . This matches an upper bound of Brassard, Hoyer, and Tapp. No lower bound better than constant was previously known. Our result also implies a quantum lower bound of Ω( n  2/3 ) queries for the element distinctness problem, which is to determine whether  n  integers are all distinct. The best previous lower bound was Ω(s n ) queries.

Connected through hyperedge HE-1 (induced by source paper "Quantum walk algorithm for element distinctness"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics