Say Alice has a (complex) vector $a\in\mathbb{C}^d$, and interacts with Bob in a quantum communication protocol (sending qubits back and forth). At the end of the protocol, Bob produces a guess $b\in\mathbb{C}^d$ for Alice's vector. Do we know of upper bounds on $\langle a|b\rangle$ in terms of the quantum communication complexity (e.g. number of qubits communicated)?

  • $\begingroup$ What is the presentation of the complex vector that Alice has? $\endgroup$ Apr 18, 2022 at 8:31
  • $\begingroup$ @VladimirLysikov Alice has each entry of the complex vector (up to some finite precision). $\endgroup$
    – Yang
    Apr 19, 2022 at 15:10


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.