Bayesian deep learning on a quantum computer
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Bayesian methods in machine learning, such as Gaussian processes, have great advantages compared to other techniques. In particular, they provide estimates of the uncertainty associated with a prediction. Extending the Bayesian approach to deep architectures has remained a major challenge. Recent results connected deep feedforward neural networks with Gaussian processes, allowing training without backpropagation. This connection enables us to leverage a quantum algorithm designed for Gaussian processes and develop a new algorithm for Bayesian deep learning on quantum computers. The properties of the kernel matrix in the Gaussian process ensure the efficient execution of the core component of the protocol, quantum matrix inversion, providing at least a polynomial speedup over classical algorithms. Furthermore, we demonstrate the execution of the algorithm on contemporary quantum computers and analyze its robustness with respect to realistic noise models.
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
Cites
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Self-citationQuantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“The simulation of sparse Hamiltonians is more efficient when using quantum computers (Lloyd 1996; Childs 2010; Berry and Childs 2012).”
MethodProbabilistic machine learning and artificial intelligence
Ghahramani, Z. (2015) · Nature · doi:10.1038/nature14541 · Cited by 1,995 · cited 1×
“…M5S 3E6 Toronto, Canada 7 Vector Institute for Artificial Intelligence, M5G 1M1 Toronto, Canada 8 Perimeter Institute for Theoretical Physics, N2L 2Y5 Waterloo, Canada a principled foundation (Ghahramani 2015), and robustness to adversarial attacks (Bradshaw et al. 2017; Grosse et al. 2017).”
BackgroundQuantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Self-citationExponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 2×
“[45] Andrew M Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A Spielman, “Exponential algorithmic speedup by a quantum walk,” in Proceedings of STOC-03, 35th Annual ACM Symposium on Theory of computing (2003) pp.”
BackgroundMethodThe quest for a Quantum Neural Network
Schuld, M., Sinayskiy, I., & Petruccione, F. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0809-8 · Cited by 671
Classification with Quantum Neural Networks on Near Term Processors
Farhi, E., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1802.06002 · Cited by 598
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 1×
“The simulation of sparse Hamiltonians is more efficient when using quantum computers (Lloyd 1996; Childs 2010; Berry and Childs 2012).”
MethodHamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372
Cited by
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
The prospects of quantum computing in computational molecular biology
Outeiral, C., Strahm, M., Shi, J., Morris, G. M., Benjamin, S. C., & Deane, C. M. (2021) · WIREs Computational Molecular Science · doi:10.1002/wcms.1481 · Cited by 232
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Pal, S., Bhattacharya, M., Lee, S.-S., & Chakraborty, C. (2024) · Molecular Biotechnology · doi:10.1007/s12033-023-00765-4 · Cited by 103
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
Self-citation
Metadata
- Authors
- Zhao, Z., Pozas-Kerstjens, A., Rebentrost, P., & Wittek, P.
- Venue
- Quantum Machine Intelligence
- Published
- 2019-05-15
- Volume
- 1
- Issue
- 1-2
- Pages
- 41-51
- ISSN
- 2524-4906 (ISSN-L)
- 2524-4914
- OpenAlex
- W2810504233
- Cited by
- 63
- References
- 17
- FWCI
- 2.88
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bayesian deep learning on a quantum computer. https://app.cochat.ai/papers/10.1007/s42484-019-00004-7
- The paper
- Zhao, Z., Pozas-Kerstjens, A., Rebentrost, P., & Wittek, P. (2019). Bayesian deep learning on a quantum computer. Quantum Machine Intelligence. https://doi.org/10.1007/s42484-019-00004-7
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.