522 citations · 2.3k across the 64 of their papers we have counts for
Showing 2019 · quant-phShow all
3 papers · 2 filters
quant-ph2019
The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits
Giulia Meuli, Mathias Soeken, Earl Campbell +2
We present a constructive method to create quantum circuits that implement oracles for -variabl…
quant-ph2019
Reversible Pebbling Game for Quantum Memory Management
Giulia Meuli, Mathias Soeken, Martin Roetteler +2
Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automati…
quant-ph2019★ 20 cited
Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum Computers
Guang Hao Low, Nicholas P. Bauman, Christopher E. Granade +9
Fault-tolerant quantum computation promises to solve outstanding problems in quantum chemistry within the next decade. Realizing this promise requires scalable tools that allow use…