Training quantum measurement devices to discriminate unknown non-orthogonal quantum states

• URL: http://arxiv.org/abs/2111.13568v2
• Date: Tue, 26 Apr 2022 08:53:35 GMT
• Title: Training quantum measurement devices to discriminate unknown non-orthogonal quantum states
• Authors: D. Concha, L. Pereira, L. Zambrano, A. Delgado
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel that mediates the transmission maps the orthogonal states into non-orthogonal states, possibly mixed. If an accurate model of the channel is unavailable, then the states received by Bob are unknown. In order to decode the transmitted information we propose to train a measurement device to achieve the smallest possible error in the discrimination process. This is achieved by supplementing the quantum channel with a classical one, which allows the transmission of information required for the training, and resorting to a noise-tolerant optimization algorithm. 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. In particular, in the case of two unknown pure states our proposal approaches the Helstrom bound. A similar result holds for a larger number of states in higher dimensions. We also show that a reduction of the search space, which is used in the training process, leads to a considerable reduction in the required resources. Finally, we apply our proposal to the case of the dephasing channel reaching an accurate value of the optimal error probability.

Related papers

• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates [37.94431794242543]
  Quantum Error Correction (QEC) allows us to use systems with a large number of physical qubits and a favourable logical error rate. Transversal Injection is a new method of preparing logical non-Pauliigen estates that can be used as resource states for quantum computation.
  arXiv  Detail & Related papers  (2023-12-27T03:32:03Z)
• Efficient information recovery from Pauli noise via classical shadow [6.689075863602204]
  We introduce an efficient algorithm that can recover information from quantum states under Pauli noise. For a local and bounded-degree observable, only partial knowledge of the channel is required to recover the ideal information. As a notable application, our method can be severed as a sample-efficient error mitigation scheme for Clifford circuits.
  arXiv  Detail & Related papers  (2023-05-06T23:34:13Z)
• Enhanced discrimination of high-dimensional quantum states by concatenated optimal measurement strategies [0.0]
  The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory. We experimentally demonstrate the discrimination of nonorthogonal states from both conclusive and inconclusive results in the unambiguous optimal strategy. We achieve significant increases of up to a factor of 2.07 and 3.73, respectively, in the overall probabilities of correct retrodictions.
  arXiv  Detail & Related papers  (2021-12-18T22:19:05Z)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• 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)
• Error mitigation for variational quantum algorithms through mid-circuit measurements [0.0]
  Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. We present mid-circuit post-selection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. We demonstrate the effectiveness of the approach for the Quantum Alternating Operator Ansatz algorithm.
  arXiv  Detail & Related papers  (2021-08-24T19:34:03Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Quantum data hiding with continuous variable systems [8.37609145576126]
  We investigate data hiding in the context of continuous variable quantum systems. We look at the case where $mathcalM=mathrmLOCC$, the set of measurements implementable with local operations and classical communication. We perform a rigorous quantitative analysis of the error introduced by the non-ideal Braunstein-Kimble quantum teleportation protocol.
  arXiv  Detail & Related papers  (2021-02-01T19:00:14Z)
• 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)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)

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.