The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Quantum learning algorithms for quantum measurements
Abstract
Abstract We study quantum learning algorithms for quantum measurements. The optimal learning algorithm is derived for arbitrary von Neumann measurements in the case of training with one or two examples. The analysis of the case of three examples reveals that, differently from the learning of unitary gates, the optimal algorithm for learning of quantum measurements cannot be parallelized, and requires quantum memories for the storage of information.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Processing a huge dataset input, the quantum computer offers quadratic and even exponential acceleration against the conventional ML as proposed in [14–16].”
From Security intrusion detection using quantum machine learning techniques (2022) · cites this paper as [16]
Experimental — accuracy not yet measured
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
Cites
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Grover’s quantum searching algorithm is optimal
Zalka, C. (1999) · Physical Review A · doi:10.1103/physreva.60.2746 · Cited by 635
Theoretical framework for quantum networks
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2009) · Physical Review A · doi:10.1103/physreva.80.022339 · Cited by 517
Self-citationProbabilistic theories with purification
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2010) · Physical Review A · doi:10.1103/physreva.81.062348 · Cited by 442
Self-citationChiribella, G., D’Ariano, G. M., & Perinotti, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.060401 · Cited by 381
Self-citationProgrammable Quantum Gate Arrays
Nielsen, M. A., & Chuang, I. L. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.321 · Cited by 379
Memory Effects in Quantum Channel Discrimination
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.180501 · Cited by 160
Self-citationOptimal quantum learning of a unitary transformation
Bisio, A., Chiribella, G., D’Ariano, G. M., Facchini, S., & Perinotti, P. (2010) · Physical Review A · doi:10.1103/physreva.81.032324 · Cited by 148
Self-citationAdaptive versus nonadaptive strategies for quantum channel discrimination
Harrow, A. W., Hassidim, A., Leung, D., & Watrous, J. (2010) · Physical Review A · doi:10.1103/physreva.81.032339 · Cited by 120
Quantum learning and universal quantum matching machine
Sasaki, M., & Carlini, A. (2002) · Physical Review A · doi:10.1103/physreva.66.022303 · Cited by 103
Sasaki, M., Carlini, A., & Jozsa, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022317 · Cited by 60
de Mello, R. F., & Ponti, M. A. (2018) · Springer eBooks · doi:10.1007/978-3-319-94989-5_2 · Cited by 58
Quantum learning by measurement and feedback
Gammelmark, S., & Mølmer, K. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033017 · Cited by 30
Optimal two-copy discrimination of quantum measurements
Fiurášek, J., & Mičuda, M. (2009) · Physical Review A · doi:10.1103/physreva.80.042312 · Cited by 14
Research works printed but not linked: 1
- L.K. Grover, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996.
Cited by
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Security intrusion detection using quantum machine learning techniques
Kalinin, M., & Krundyshev, V. (2022) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-022-00435-0 · Cited by 118
Metadata
- Authors
- Bisio, A., DʼAriano, G. M., Perinotti, P., & Sedlák, M.
- Venue
- Physics Letters A
- Publisher
- Elsevier BV
- Published
- 2011-09
- Volume
- 375
- Issue
- 39
- Pages
- 3425-3434
- ISSN
- 0375-9601
- Cited by
- 20
- References
- 15
- Language
- en
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- Funders
- Ministero dell’Istruzione, dell’Università e della Ricerca
- Seventh Framework Programme
- European Commission
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.
