Show simple item record

AuthorDörn, Sebastiandc.contributor.author
Date of accession2016-03-14T15:19:29Zdc.date.accessioned
Available in OPARU since2016-03-14T15:19:29Zdc.date.available
Year of creation2007dc.date.created
AbstractIn this thesis we present new quantum algorithms for graph and algebra problems. Our quantum algorithms for these problems use a combination of Grover search, amplitude amplification and quantum walk search. The quantum algorithms are faster than the best known classical algorithms for the corresponding problems.dc.description.abstract
Languageendc.language.iso
PublisherUniversität Ulmdc.publisher
LicenseStandard (Fassung vom 03.05.2003)dc.rights
Link to license texthttps://oparu.uni-ulm.de/xmlui/license_v1dc.rights.uri
KeywordQuantenalgorithmendc.subject
KeywordQuantum computingdc.subject
Dewey Decimal GroupDDC 004 / Data processing & computer sciencedc.subject.ddc
LCSHComputational complexitydc.subject.lcsh
LCSHGraph theory. Data processingdc.subject.lcsh
LCSHQuantum computersdc.subject.lcsh
TitleQuantum complexity of graph and algebraic problemsdc.title
Resource typeDissertationdc.type
DOIhttp://dx.doi.org/10.18725/OPARU-976dc.identifier.doi
URNhttp://nbn-resolving.de/urn:nbn:de:bsz:289-vts-63034dc.identifier.urn
GNDGraphentheoriedc.subject.gnd
GNDKomplexitätstheoriedc.subject.gnd
GNDQuantencomputerdc.subject.gnd
FacultyFakultät für Ingenieurwissenschaften und Informatikuulm.affiliationGeneral
Date of activation2008-02-19T18:10:08Zuulm.freischaltungVTS
Peer reviewneinuulm.peerReview
Shelfmark print versionZ: J-H 11.759; W: W-H 9.958uulm.shelfmark
DCMI TypeTextuulm.typeDCMI
VTS-ID6303uulm.vtsID
CategoryPublikationenuulm.category
University Bibliographyjauulm.unibibliographie


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record