In quantum communication complexity, we always assume that Alice and Bob have unlimited computational power and are still prove lower bounds such as the $\Omega(n)$ lower bounds of parity.
What happens if we assume that Alice and Bob can do something a quantum algorithm cannot do? One particular ability that I'm interested in is when they can copy qubits, i.e., Alice can send Bob a copy of her qubits and also keep a copy of that qubit sent to Bob. Do the lower bounds still hold in this model?
A particular result that I'm interested in is the lower bound in Razborov's paper "Quantum communication complexity of symmetric predicates".
Also, is this ability already included in the formal definition, e.g., as defined in Razborov's paper?
(As you can guess, my understanding in quantum algorithm is very limited. So, besides the full answers, I would appreciate any pointer to anything in the literature as well.)
Update: I realized after reading Artem Kaznatcheev's answer that the model I ask is too general so I asked a new question here