Results 1  10
of
873
The Case for Quantum Key Distribution Douglas Stebila1,2, Michele Mosca1,2,3 1,3,4 ∗
, 2009
"... Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructures. It can provide longterm confidentiality for encrypted information without reliance on computational assumptions. Alt ..."
Abstract
 Add to MetaCart
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructures. It can provide longterm confidentiality for encrypted information without reliance on computational assumptions. Although QKD still requires authentication to prevent maninthemiddle attacks, it can make use of either informationtheoretically secure symmetric key authentication or computationally secure public key authentication: even when using public key authentication, we argue that QKD still offers stronger security than classical key agreement. 1
Classical Cryptosystems In A Quantum Setting
, 2004
"... I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by photocopying or by other means, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
not have been possible without much support and assistance. I would like to thank my supervisor, Michele Mosca, for sharing wisdom, experience, and guidance. Thank you to NSERC and the Department of Combinatorics and Optimisation at the University of Waterloo for their generous financial support. Thank
Collision Finding with Many Classical or Quantum Processors
"... I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii In this thesis, we investigate the cost of finding col ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, and lay the groundwork for studying the performance of classical and quantum algorithms in these models. iii Acknowledgements I am deeply indebted to my supervisor, Dr. Michele Mosca, for introducing me to the subject of quantum information processing, and for the years of support and encouragement
Robert Michels (18761936), Political Sociologist and Economist By
, 1991
"... A biographical sketch of Robert Michels (18761936), a po1Itical sociologist and economist who taught in Germany, ..."
Abstract
 Add to MetaCart
A biographical sketch of Robert Michels (18761936), a po1Itical sociologist and economist who taught in Germany,
Using Generalized Quantum Fourier Transforms in Quantum Phase Estimation Algorithms
"... I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by photocopying or by other means ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
of these algorithms as components of larger quantum algorithms. iv Acknowledgements I am indebted to the many people who have helped me during the process of writing this thesis, first and foremost to my supervisor, Michele Mosca, who first introduced me to the field to quantum computing. My thesis readers, Raymond
Quantum counting
 In Proceedings of the 25th International Colloquium on Automata, Languages and Programming
, 1998
"... Abstract. We study some extensions of Grover’s quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be ..."
Abstract

Cited by 119 (3 self)
 Add to MetaCart
Abstract. We study some extensions of Grover’s quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching algorithm over classical brute force can still be obtained for a large family of search problems for which good classical heuristics exist. Finally, as our main result, we combine ideas from Grover’s and Shor’s quantum algorithms to perform approximate counting, which can be seen as an amplitude estimation process. 1
Elite Theory in Political Sociology
"... Elite theory‟s origins lie most clearly in the writings of Gaetano Mosca (1858 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Elite theory‟s origins lie most clearly in the writings of Gaetano Mosca (1858
The hidden subgroup problem and eigenvalue estimation on a quantum computer
 Lecture Notes in Computer Science
, 1999
"... Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden or unknown subgroups of Abelian groups. It is already known how to phrase the first four problems as the estimation of e ..."
Abstract

Cited by 70 (2 self)
 Add to MetaCart
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden or unknown subgroups of Abelian groups. It is already known how to phrase the first four problems as the estimation of eigenvalues of certain unitary operators. Here we show how the solution to the more general Abelian hidden subgroup problem can also be described and analysed as such. We then point out how certain instances of these problems can be solved with only one control qubit, or flying qubits, instead of entire registers of control qubits. 1
Implementation of a quantum search algorithm on a quantum computer
 Nature
, 1998
"... The simulation of quantum mechanical systems with classical computers appears to be a computationally intractable problem. In 1982 Feynman 1 reversed this observation, suggesting that quantum mechanical systems have an information processing capability much greater than that of corresponding classic ..."
Abstract

Cited by 53 (4 self)
 Add to MetaCart
The simulation of quantum mechanical systems with classical computers appears to be a computationally intractable problem. In 1982 Feynman 1 reversed this observation, suggesting that quantum mechanical systems have an information processing capability much greater than that of corresponding classical systems, and thus could be used to implement a new type of powerful computer. In 1985 Deutsch 2 described a quantum mechanical Turing machine, showing that quantum computers could indeed be constructed. Since then there has been extensive research in this field, but while the theory is fairly well understood actually building a quantum computer has proved extremely difficult, and only two methods have been used to demonstrate quantum logic gates: ion traps, 3,4 and nuclear magnetic resonance (NMR). 5,6 NMR quantum computers have previously been used to demonstrate quantum algorithms to solve the two bit Deutsch problem. 7,8 Here we show how such a computer can be used to implement a fast quantum
Results 1  10
of
873