Enhancing Quantum State Discrimination with Indefinite Causal Order

• URL: http://arxiv.org/abs/2406.19373v1
• Date: Thu, 27 Jun 2024 17:51:46 GMT
• Title: Enhancing Quantum State Discrimination with Indefinite Causal Order
• Authors: Spiros Kechrimparis, James Moran, Athena Karsa, Changhyoup Lee, Hyukjoon Kwon,
• Abstract summary: We study a noisy discrimination scenario using a protocol based on indefinite causal order. We find that, for certain channels and ensembles, the guessing probability can be significantly improved.
• Score: 3.368751927358015
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The standard quantum state discrimination problem can be understood as a communication scenario involving a sender and a receiver following these three steps: (i) the sender encodes information in pre-agreed quantum states, (ii) sends them over a noiseless channel, and (iii) the receiver decodes the information by performing appropriate measurements on the received states. In a practical setting, however, the channel is not only noisy but often also unknown, thus altering the states and making optimal decoding generally not possible. In this work, we study this noisy discrimination scenario using a protocol based on indefinite causal order. To this end, we consider the quantum switch and define its higher-order generalisations, which we call superswitches. We find that, for certain channels and ensembles, the guessing probability can be significantly improved compared to both single- and multi-copy state discrimination.

Related papers

• Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
  In network communication, there is a hierarchy among receivers based on information they decode due. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
  arXiv  Detail & Related papers  (2024-06-14T09:07:53Z)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Training quantum measurement devices to discriminate unknown non-orthogonal quantum states [0.0]
  We study the problem of decoding information transmitted through unknown quantum states. We propose to train a measurement device to achieve the smallest possible error in the discrimination process. We demonstrate the training method in the case of minimum-error discrimination and show that it achieves error probabilities very close to the optimal one.
  arXiv  Detail & Related papers  (2021-11-26T16:07:02Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Quantum Discrimination of Two Noisy Displaced Number States [68.2727599930504]
  We first consider the quantum discrimination of two noiseless displaced number states. We then address the problem of discriminating between two noisy displaced number states.
  arXiv  Detail & Related papers  (2020-12-09T16:56:16Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.