1k citations · 4.2k across the 56 of their papers we have counts for
7 papers · 2 filters
Factoring using 2n+2 qubits with Toffoli based modular multiplication
Thomas Häner, Martin Roetteler, Krysta M. Svore
We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a…
Optimal Circuit-Level Decoding for Surface Codes
Bettina Heim, Krysta M. Svore, Matthew B. Hastings
Surface codes exploit topological protection to increase error resilience in quantum computing devices and can in principle be implemented in existing hardware. They are one of the…
Quantum Speed-ups for Semidefinite Programming
Fernando G. S. L. Brandao, Krysta Svore
We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time ,…
Elucidating Reaction Mechanisms on Quantum Computers
Markus Reiher, Nathan Wiebe, Krysta M Svore +2
We show how a quantum computer can be employed to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase a…
Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
Alex Bocharov, Martin Roetteler, Krysta M. Svore
We determine the cost of performing Shor's algorithm for integer factorization on a ternary quantum computer, using two natural models of universal fault-tolerant computing: (i) a…
Verified compilation of space-efficient reversible circuits
Matthew Amy, Martin Roetteler, Krysta Svore
The generation of reversible circuits from high-level code is an important problem in several application domains, including low-power electronics and quantum computing. Existing t…