arXiv:1005.1425

Quantum Complexity: restrictions on algorithms and architectures

Dan J. Shepherd

Published May 9, 2010• 9 citations

Abstract

A dissertation submitted to the University of Bristol in accordance with the requirements of the degree of Doctor of Philosophy (PhD) in the Faculty of Engineering, Department of Computer Science, July 2009.

DOI: 10.48550/arxiv.1005.1425

Related papers

Analysis of quantum algorithms

Paresha Farastu, Rafiduzzaman Sonnet, Saddat Hasan +1 more

This thesis report is submitted in partial fulfilment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2017.

Jan 1, 20170 citations

Adiabatic quantum computing from an eigenvalue dynamics point of view

Richard D. Wilson

A Doctoral Thesis. Submitted in partial fulfillment of the requirements for the award of Doctor of Philosophy of Loughborough University.

Sep 6, 20110 citations

Quantum speedups in query complexity

Shalev Ben-David

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.

Jan 1, 20170 citations

The complexity of sampling from a weak quantum computer

Saeed Adel Mehraban

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019

Jan 1, 20190 citations

Security for correlated sources across wiretap network

Reevana Balmahoon

A thesis submitted in ful llment of the requirements for the degree of Doctor of Philosophy in the School of Electrical and Information Engineering Faculty of Engineering University of the Witwatersrand July 2015

Mar 17, 20160 citations

Quantum query complexity revisited

Daniel Preda

Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.

Jan 1, 20030 citations