On the mathematics of quantum computers
From MaRDI portal
Publication:2500800
DOI10.1007/S00591-005-0105-XzbMATH Open1104.68047OpenAlexW1988510471MaRDI QIDQ2500800FDOQ2500800
Authors: David Meintrup
Publication date: 18 August 2006
Published in: Mathematische Semesterberichte (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00591-005-0105-x
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Mathematical problems of computer architecture (68M07)
Cites Work
- Title not available (Why is that?)
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Title not available (Why is that?)
- Quantum algorithms revisited
- Rapid solution of problems by quantum computation
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: On the mathematics of quantum computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500800)