Number theory in quantum computing
dc.bibliographicCitation.seriesTitle | Snapshots of Modern Mathematics from Oberwolfach | eng |
dc.bibliographicCitation.volume | 12/2018 | |
dc.contributor.author | Schönnenbeck, Sebastian | |
dc.date.accessioned | 2022-08-05T08:00:54Z | |
dc.date.available | 2022-08-05T08:00:54Z | |
dc.date.issued | 2018 | |
dc.description.abstract | Algorithms are mathematical procedures developed to solve a problem. When encoded on a computer, algorithms must be "translated" to a series of simple steps, each of which the computer knows how to do. This task is relatively easy to do on a classical computer and we witness the benefits of this success in our everyday life. Quantum mechanics, the physical theory of the very small, promises to enable completely novel architectures of our machines, which will provide specific tasks with higher computing power. Translating and implementing algorithms on quantum computers is hard. However, we will show that solutions to this problem can be found and yield surprising applications to number theory. | eng |
dc.description.version | publishedVersion | eng |
dc.identifier.uri | https://oa.tib.eu/renate/handle/123456789/9900 | |
dc.identifier.uri | http://dx.doi.org/10.34657/8938 | |
dc.language.iso | eng | |
dc.publisher | Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach gGmbH | |
dc.relation.doi | https://doi.org/10.14760/SNAP-2018-012-EN | |
dc.relation.essn | 2626-1995 | |
dc.rights.license | CC BY-SA 4.0 Unported | eng |
dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | eng |
dc.subject.ddc | 510 | |
dc.subject.other | Algebra and Number Theory | eng |
dc.title | Number theory in quantum computing | eng |
dc.type | Report | eng |
dc.type | Text | eng |
dcterms.extent | 14 S. | |
tib.accessRights | openAccess | |
wgl.contributor | MFO | |
wgl.subject | Mathematik | |
wgl.type | Report / Forschungsbericht / Arbeitspapier |
Files
Original bundle
1 - 1 of 1