Martin Roetteler

TL;DR: It is shown that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits, and suggested that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

TL;DR: An algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speedup over simple brute force algorithms is presented.

TL;DR: Q# is presented, a quantum-focused domain-specific language explicitly designed to correctly, clearly and completely express quantum algorithms that provides a type system; a tightly constrained environment to safely interleave classical and quantum computations; specialized syntax; symbolic code manipulation to automatically generate correct transformations of quantum operations.

TL;DR: In this paper, the authors identify scientific and community needs, opportunities, a sampling of a few use case studies, and significant challenges for the development of quantum computers for science over the next 2-10 years.

TL;DR: It is established that for all three variants of AES key size 128, 192, and 256i¾źbit that are standardized in FIPS-PUB 197, there are precise bounds for the number of qubits and thenumber of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.