Multiple-copy state discrimination of noisy qubits

Abstract

Multiple-copy state discrimination is a fundamental task in quantum information processing. If there are two, pure, non-orthogonal states then both local and collective schemes are known to reach the Helstrom bound, the maximum probability of successful discrimination allowed by quantum theory. For mixed states, it is known that only collective schemes can perform optimally, so it might be expected that these schemes are more resilient to preparation noise. We calculate the probability of success for two schemes, one local and one collective, in the regime of imperfect preparation fidelity. We find two surprising results. Firstly, both schemes converge upon the same many-copy limit, which is less than unity. Secondly, the local scheme performs better in all cases. This highlights the point that one should take into account noise when designing state discrimination schemes.

References in corpus (7)

• Quantum state discrimination and its applications
• Decoherence benchmarking of superconducting qubits
• Correlating decoherence in transmon qubits: Low frequency noise by single fluctuators
• The Chernoff lower bound for symmetric quantum hypothesis testing
• The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
• Local discrimination of mixed states
• Difficulty of distinguishing product states locally

Cited by in corpus (7)

• Discriminating mixed qubit states with collective measurements
• Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes
• Quantum State Discrimination on Reconfigurable Noise-Robust Quantum Networks
• Quantum State Discrimination Circuits Inspired by Deutschian Closed Timelike Curves
• Quantum hypothesis testing via robust quantum control
• A Quantum Informational Approach to the Problem of Time
• Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing