I'm not familiar with what GUROBI does exactly, but continuous non-convex QCPs are solved using continuous branch-and-bound. This involves generating a linear relaxation of the problem which is solved at every node of the BnB tree, along with local optimisation of QCPs to get primal solutions (until we hit the global optimum).
The linear relaxations would typically be solved using Dual Simplex.
An interesting special case is if your QCP has complementarity constraints, which solvers typically (but not always) transform to MI linear constraints. Depending on the outcome, the problem can be fully linearised, in which case it's solved as an MILP, or partially linearised, in which case it's solved as an MIQCP.
From GUROBI's manual however, it's quite clear:
In the current release, the default Automatic (-1) setting will
typically choose non-deterministic concurrent (Method=3) for an LP,
barrier (Method=2) for a QP or QCP, and dual (Method=1) for the MIP
root node. Only the simplex and barrier algorithms are available for
continuous QP models. Only primal and dual simplex are available for
solving the root of an MIQP model. Only barrier is available for
continuous QCP models.
They specifically say that only barrier is available for continuous QCP, and that Automatic mode will select barrier (Method=2) for those problems.
Even though it doesn't say so, I would expect it to use Dual Simplex if the QCP problem has e.g. complementarity constraints and is transformed to an MILP.
Generally speaking, if you see that Dual Simplex was used in the output, it most likely means that it reformulated your problem to an MILP by exploiting special structure.