The DOI matches its OpenAlex record; 2 of the 2 references it cites were found in a registry or an index.
Quantum Recommendation Systems
Open accessOverview
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
Cites
Lessons from the Netflix prize challenge
Bell, R. M., & Koren, Y. (2007) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1345448.1345465 · Cited by 727
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
Cited by
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
“thm is probably just too expensive to be executed successfully by a quantum computer which doesn’t use error correction. 6.7 Quantum recommendation systems Another recently proposed quantum algorithm [39] provides an exponential speedup over the best currently known classical algorithm for a useful task: making high-v…”
BackgroundInfluentialBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Circuit-centric quantum classifiers
Schuld, M., Bocharov, A., Svore, K. M., & Wiebe, N. (2020) · Physical Review A · doi:10.1103/physreva.101.032308 · Cited by 1,057
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
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383
A generative modeling approach for benchmarking and training shallow quantum circuits
Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0157-8 · Cited by 379
Potential of quantum computing for drug discovery
Cao, Y., Romero, J., & Aspuru-Guzik, A. (2018) · IBM Journal of Research and Development · doi:10.1147/jrd.2018.2888987 · Cited by 357
Robust data encodings for quantum classifiers
LaRose, R., & Coyle, B. (2020) · Physical Review A · doi:10.1103/physreva.102.032420 · Cited by 326
Quantum-inspired support vector machine
Ding, C., Bao, T.-Y., & Huang, H.-L. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3084467 · Cited by 186
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3550488 · Cited by 183
The Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
Tang, E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060503 · Cited by 140
Quantum Algorithms for Deep Convolutional Neural Networks
Kerenidis, I., Landman, J., & Prakash, A. (2019) · arXiv · doi:10.48550/arxiv.1911.01117 · Cited by 102
Self-citationBiology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
Classification with Quantum Machine Learning: A Survey
Abohashima, Z., Elhosen, M., Houssein, E. H., & Mohamed, W. M. (2020) · arXiv · doi:10.48550/arxiv.2006.12270 · Cited by 68
Prospects and challenges of quantum finance
Bouland, A., van Dam, W., Joorati, H., Kerenidis, I., & Prakash, A. (2020) · arXiv · doi:10.48550/arxiv.2011.06492 · Cited by 46
Self-citationQTRL: Toward Practical Quantum Reinforcement Learning via Quantum-Train
Liu, C.-Y., Lin, C.-H. A., Yang, C.-H. H., Chen, K.-C., & Hsieh, M.-H. (2024) · 2024 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10299 · Cited by 28
Quantum algorithms for training Gaussian processes
Zhao, Z., Fitzsimons, J. K., Osborne, M. A., Roberts, S. J., & Fitzsimons, J. F. (2019) · Physical Review A · doi:10.1103/physreva.100.012304 · Cited by 19
Metadata
- Authors
- Kerenidis, I., & Prakash, A.
- Venue
- DR-NTU (Nanyang Technological University)
- Publisher
- Nanyang Technological University
- Published
- 2016-03-29
- OpenAlex
- W2964039664
- Cited by
- 250
- References
- 2
- FWCI
- 12.45
- 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.