Show simple item record

dc.contributor.advisorHarrow, Aramen_US
dc.contributor.authorPham, Paulen_US
dc.date.accessioned2014-02-24T18:24:59Z
dc.date.available2014-02-24T18:24:59Z
dc.date.issued2014-02-24
dc.date.submitted2013en_US
dc.identifier.otherPham_washington_0250E_11404.pdfen_US
dc.identifier.urihttp://hdl.handle.net/1773/25071
dc.descriptionThesis (Ph.D.)--University of Washington, 2013en_US
dc.description.abstractQuantum computing is a new field which combines computer science and quantum physics. Its most famous result, Shor's factoring algorithm, would enable us to one day compromise the widely-used RSA cryptosystem if we are able to design efficient quantum architectures. Studying the depth of these architectures would allow us to solve this human problem within a human lifetime. Toward that end, we contribute two hybrid factoring architectures in poly-logarithmic and sub-logarithmic depths, which are both exponential improvements over previous known works. We also present an improved procedure for generating quantum Fourier states useful for quantum compiling. Finally, we invent a new circuit resource called coherence which upper bounds the error-correcting effort needed in a future quantum computer. We use this to characterize a better time-space tradeoff for factoring as well as to provide configurable-depth factoring architectures.en_US
dc.format.mimetypeapplication/pdfen_US
dc.language.isoen_USen_US
dc.rightsCopyright is held by the individual authors.en_US
dc.subjectfactoring; low depth; quantum architecture; quantum circuit; quantum computing; Shor's algorithmen_US
dc.subject.otherComputer scienceen_US
dc.subject.othercomputer science and engineeringen_US
dc.titleLow-depth quantum architectures for factoringen_US
dc.typeThesisen_US
dc.embargo.termsNo embargoen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record