The DOI matches its Crossref record.
Designing optimal quantum detectors via semidefinite programming
Open accessAbstract
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing among a collection of quantum states, represented by a set of density operators. We show that the design of the optimal detector can be formulated as a semidefinite programming problem. Based on this formulation, we derive a set of necessary and sufficient conditions for an optimal quantum measurement. We then show that the optimal measurement can be found by solving a standard (convex) semidefinite program. By exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum, the optimal measurement can be computed very efficiently in polynomial time within any desired accuracy. Using the semidefinite programming formulation, we also show that the rank of each optimal measurement operator is no larger than the rank of the corresponding density operator. In particular, if the quantum state ensemble is a pure-state ensemble consisting of (not necessarily independent) rank-one density operators, then we show that the optimal measurement is a pure-state measurement consisting of rank-one measurement operators.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
CVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
Barnett, S. M., & Croke, S. (2009) · Advances in Optics and Photonics · doi:10.1364/aop.1.000238 · Cited by 463
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
Asymptotic Teleportation Scheme as a Universal Programmable Quantum Processor
Ishizaka, S., & Hiroshima, T. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.240501 · Cited by 130
Universal discriminative quantum neural networks
Chen, H., Wossnig, L., Severini, S., Neven, H., & Mohseni, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00025-7 · Cited by 89
“to allow for some small but non-zero errors to happen. We rely here on the formulation of the QSD problem as numerical optimization problem, where one attempts to optimize one of the figures of merit [37,38]. However, rather than performing solely the optimisation, we use a machine learning approach to build a hybrid o…”
MethodUniversal discriminative quantum neural networks
Chen, H., Wossnig, L., Severini, S., Neven, H., & Mohseni, M. (2018) · arXiv · doi:10.48550/arxiv.1805.08654 · Cited by 89
A Hybrid Quantum-Classical Approach to Mitigating Measurement Errors in Quantum Algorithms
Kwon, H., & Bae, J. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3009664 · Cited by 54
Metadata
- Authors
- Eldar, Y. C., Megretski, A., & Verghese, G. C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2003-04
- Volume
- 49
- Issue
- 4
- Pages
- 1007-1012
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2142521644
- Cited by
- 167
- References
- 0
- FWCI
- 10.60
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.