The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexity
We consider the quantum complexity of computing Schatten p-norms and related quantities, and find th...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
We study quantum algorithms that are given access to trusted and untrusted quantum witnesses. We est...
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computer...
Thesis (Ph.D.)--University of Washington, 2013Computational complexity is the field that studies the...
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. Whil...
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. Whil...
Computational complexity theory is usually phrased in terms of decision problems and Boolean functio...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2015.Cataloged from PD...
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a ...
Abstract: Is there a general theorem that tells us when we can hope for exponential speedups from qu...
The continuous-time query model is a variant of the dis-crete query model in which queries can be in...
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algo...
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algo...
We consider the quantum complexity of computing Schatten p-norms and related quantities, and find th...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
We study quantum algorithms that are given access to trusted and untrusted quantum witnesses. We est...
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computer...
Thesis (Ph.D.)--University of Washington, 2013Computational complexity is the field that studies the...
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. Whil...
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. Whil...
Computational complexity theory is usually phrased in terms of decision problems and Boolean functio...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2015.Cataloged from PD...
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a ...
Abstract: Is there a general theorem that tells us when we can hope for exponential speedups from qu...
The continuous-time query model is a variant of the dis-crete query model in which queries can be in...
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algo...
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algo...
We consider the quantum complexity of computing Schatten p-norms and related quantities, and find th...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
We study quantum algorithms that are given access to trusted and untrusted quantum witnesses. We est...