What can quantum computers do?
From MaRDI portal
Publication:873912
DOI10.1007/S00591-006-0013-8zbMATH Open1110.81315OpenAlexW2074692488MaRDI QIDQ873912FDOQ873912
Authors: Erich Novak
Publication date: 20 March 2007
Published in: Mathematische Semesterberichte (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00591-006-0013-8
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum summation with an application to integration.
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Quantum complexity of integration
- Title not available (Why is that?)
- Verschränkte Systeme
- Sharp error bounds on quantum Boolean summation in various settings
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: What can quantum computers do?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q873912)