Publication | Closed Access
Upper bound for the success probability of unambiguous discrimination among quantum states
55
Citations
9
References
2001
Year
EngineeringVerificationLawComputational ComplexityProbabilistic ComputationMeasurement ProblemQuantum ComputingQuantum Optimization AlgorithmQuantum StatesSuccess ProbabilityQuantum EntanglementStatisticsQuantum ScienceQuantum InformationDisparate ImpactProbability TheoryComputer ScienceMaximal Success ProbabilityUpper BoundAlgorithmic Information TheoryDiscrimination ProblemImprecise ProbabilityAlgorithmic FairnessIdp LimitQuantum CommunicationQuantum System
One strategy to the discrimination problem is to identify the state with certainty, leaving a possibility of undecidability. This paper gives an upper bound for the maximal success probability of unambiguous discrimination among n states. This bound coincides with the known IDP limit when two states are considered.
| Year | Citations | |
|---|---|---|
Page 1
Page 1