5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Communication Complexity of One-Shot Remote State Preparation

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire classical description of the state to be sent. (This may also be viewed as the task of non-oblivious compression of a single sample from an ensemble of quantum states.) We study the communication complexity of approximate remote state preparation, in which the goal is to prepare an approximation of the desired quantum state. Jain [Quant. Inf. & Comp., 2006] showed that the worst-case communication complexity of approximate RSP can be bounded from above in terms of the maximum possible information in an encoding. He also showed that this quantity is a lower bound for communication complexity of (exact) remote state preparation. In this work, we tightly characterize the worst-case and average-case communication complexity of remote state preparation in terms of non-asymptotic information-theoretic quantities. We also show that the average-case communication complexity of RSP can be much smaller than the worst-case one. In the process, we show that n bits cannot be communicated with less than n transmitted bits in LOCC protocols. This strengthens a result due to Nayak and Salzman [J. ACM, 2006] and may be of independent interest.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          The proper formula for relative entropy and its asymptotics in quantum probability

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Distance measures to compare real and ideal quantum processes

            With growing success in experimental implementations it is critical to identify a "gold standard" for quantum information processing, a single measure of distance that can be used to compare and contrast different experiments. We enumerate a set of criteria such a distance measure must satisfy to be both experimentally and theoretically meaningful. We then assess a wide range of possible measures against these criteria, before making a recommendation as to the best measures to use in characterizing quantum information processing.
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Guest Column: NP-complete problems and physical reality

                Bookmark

                Author and article information

                Journal
                21 February 2018
                Article
                1802.07795
                850fa104-85b4-4e56-867e-636bd9a14596

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                36 pages
                quant-ph cs.CC

                Comments

                Comment on this article