This question continues from the previous question where I mistakenly asked a question that is too general.
In quantum communication complexity, we always assume that Alice and Bob have unlimited computational power and are still prove lower bounds such as the Ω(n) lower bounds of parity.
What happens if we assume that Alice and Bob can do something that they cannot do due to the the law of physics? One particular ability that I'm interested in is when each party can send a qubit to the other party without losing their own qubit. In other words, before sending their qubits to the other party, they can make ONE copy of it. (Note that this is allowed only when they are about to send a qubit.) Do the known lower bounds hold in this case?
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.)