Universal programmable unambiguous discrimination of two unknown states with two copies
Source abstract
Abstract
We investigate the universal programmable unambiguous discrimination of two unknown quantum states with two copies. We first present the optimal positive-operator valued measure (POVM) elements that determine the individual success probabilities. In terms of the positivity of an inconclusive operator, we derive the average success probability, which is higher than the average success probability of discriminating two unknown states with one copy given in the reference [Bergou and Hillery, Phys. Rev. Lett. 94, 160501 (2005)].
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Electronic Engineering, Huainan Normal University 1 , Huainan 232038,
Institute of Photoelectron Computation and Detection of Huainan Normal University 2 , Huainan 232038,
Funding
Natural Science Foundation of the Education Department of Anhui Province of China · Huainan Science and Technology Plan Projects Technology of China
References (48)
Show source-provided references
1. Noisy quantum phase communication channels10.1088/0031-8949/90/7/074027 ↗
2. Quantum phase communication channels in the presence of static and dynamical phase diffusion10.1103/physreva.92.012317 ↗
3. Quantum phase communication channels assisted by non-deterministic noiseless amplifiers10.1364/josab.36.002938 ↗
4. Quantum state discrimination10.1080/00107510010002599 ↗
5. Quantum state discrimination10.1364/aop.1.000238 ↗
6. Discrimination of quantum states10.1080/09500340903477756 ↗
7. 1976
8. Efficient optimal minimum error discrimination of symmetric quantum states10.1103/physreva.81.012315 ↗
9. Minimum-error discrimination of qubit states: Methods, solutions, and properties10.1103/physreva.87.012334 ↗
10. Minimum-error discrimination among three pure linearly independent symmetric qutrit states10.1007/s11128-012-0466-8 ↗
11. Minimum-error discrimination between two sets of similarity-transformed quantum states10.1007/s11128-013-0527-7 ↗
12. Finding optimal measurements with inconclusive results using the problem of minimum error discrimination10.1103/physreva.91.022331 ↗
13. How to differentiate between non-orthogonal states10.1016/0375-9601(87)90222-2 ↗
14. Overlap and distinguishability of quantum states10.1016/0375-9601(88)90840-7 ↗
15. How to differentiate between non-orthogonal states10.1016/0375-9601(88)91034-1 ↗
16. Optimal distinction between non-orthogonal quantum states10.1016/0375-9601(94)00919-G ↗
17. Optimal unambiguous discrimination of pure quantum states10.1103/physrevlett.108.250502 ↗
18. Optimal unambiguous discrimination of pure qudits10.1007/s11128-013-0666-x ↗
19. Analysis of optimal unambiguous discrimination of three pure quantum states10.1103/physreva.91.062312 ↗
20. Optimal discrimination of mixed quantum states involving inconclusive results10.1103/physreva.67.012321 ↗
21. Mixed-quantum-state detection with inconclusive results10.1103/physreva.67.042309 ↗
22. An optimal discrimination of two mixed qubit states with a fixed rate of inconclusive results10.1007/s11128-017-1722-8 ↗
23. Discriminating single-photon states unambiguously in high dimensions10.1103/physrevlett.113.020501 ↗
24. Experimental multiparty sequential state discrimination10.1103/physreva.94.042309 ↗
25. Experimental minimum-error quantum-state discrimination in high dimensions10.1103/physrevlett.118.100501 ↗
26. Coherent-state discrimination via nonheralded probabilistic amplification10.1103/physreva.93.062315 ↗
27. 1995
28. Universal measurement apparatus controlled by quantum software10.1103/physrevlett.89.190401 ↗
29. Probabilistic quantum multimeters10.1103/physreva.69.032302 ↗
30. Quantum-controlled measurement device for quantum-state discrimination10.1103/physreva.66.022112 ↗
31. Quantum learning and universal quantum matching machine10.1103/physreva.66.022303 ↗
32. Quantum template matching10.1103/physreva.64.022317 ↗
33. Implementation of quantum maps by programmable quantum processors10.1103/physreva.66.042302 ↗
34. Storing quantum dynamics in quantum states: A stochastic programmable gate10.1103/physrevlett.88.047905 ↗
35. Direct estimations of linear and nonlinear functionals of a quantum state10.1103/physrevlett.88.217901 ↗
36. Quantum gate arrays can be programmed to evaluate the expectation value of any operator10.1103/physreva.68.052316 ↗
37. Unambiguous discrimination between two unknown qudit states10.1007/s11128-011-0327-x ↗
38. Success probabilities for universal unambiguous discriminators between unknown pure states10.1103/PhysRevA.89.014301 ↗
39. Designing an optimal, universal, programmable, and unambiguous discriminator for N unknown qubits10.1103/physreva.96.052111 ↗
40. Universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states10.1103/physrevlett.94.160501 ↗
41. Unambiguous discriminator for unknown quantum states: An implementation10.1103/physreva.75.052116 ↗
42. Optical realization of the unambiguous discriminator for unknown quantum states10.1103/physreva.78.042315 ↗
43. The universal unambiguous discriminator between two unknown qudit states10.1209/0295-5075/ac18fa ↗
44. Quantum cryptography using any two nonorthogonal states10.1103/physrevlett.68.3121 ↗
45. Quantum cloning10.1103/revmodphys.77.1225 ↗
46. Optimal cloning of two known nonorthogonal quantum states10.1103/physreva.86.022322 ↗
47. Quantum copying: Beyond the no-cloning theorem10.1103/physreva.54.1844 ↗
48. Optimal quantum cloning machines10.1103/PhysRevLett.79.2153 ↗