67 citations · 77 across the 3 of their papers we have counts for
5 papers · 1 filter
Assessing requirements to scale to practical quantum advantage
Michael E. Beverland, Prakash Murali, Matthias Troyer +7
While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require…
Counting unitaries of T-depth one
Vadym Kliuchnikov
We show that the number of T-depth one unitaries on qubits is where i…
Well-conditioned multiproduct Hamiltonian simulation
Guang Hao Low, Vadym Kliuchnikov, Nathan Wiebe
Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting co…
Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
Krysta M. Svore, Alan Geller, Matthias Troyer +7
Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the p…
A framework for exact synthesis
Vadym Kliuchnikov, Jon Yard
Exact synthesis is a tool used in algorithms for approximating an arbitrary qubit unitary with a sequence of quantum gates from some finite set. These approximation algorithms find…