activity
20142023
most citedEfficient synthesis of universal Repeat-Until-Success circuits

144 citations · 237 across the 8 of their papers we have counts for

collaborators
Showing quant-phShow all

9 papers · 1 filter

quant-ph20241 cited

Capturing many-body correlation effects with quantum and classical computing

Karol Kowalski, Nicholas P. Bauman, Guang Hao Low +3

Theoretical descriptions of excited states of molecular systems in high-energy regimes are crucial for supporting and driving many experimental efforts at light source facilities.…

quant-ph20234 cited

Advances in compilation for quantum hardware -- A demonstration of magic state distillation and repeat-until-success protocols

Natalie C. Brown, John Peter Campora, Cassandra Granade +8

Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a feed-forward processing of data, enabled by a hybrid of quantum and classical lo…

quant-ph202113 cited

Quantum Algorithms for Reinforcement Learning with a Generative Model

Daochen Wang, Aarthi Sundaram, Robin Kothari +2

Reinforcement learning studies how an agent should interact with an environment to maximize its cumulative reward. A standard way to study this question abstractly is to ask how ma…

quant-ph2020

Towards quantum computing for high-energy excited states in molecular systems: quantum phase estimations of core-level states

Nicholas P. Bauman, Hongbin Liu, Eric J. Bylaska +9

This paper explores the utility of the quantum phase estimation (QPE) in calculating high-energy excited states characterized by promotions of electrons occupying inner energy shel…

quant-ph201713 cited

Improved reversible and quantum circuits for Karatsuba-based integer multiplication

Alex Parent, Martin Roetteler, Michele Mosca

Integer arithmetic is the underpinning of many quantum algorithms, with applications ranging from Shor's algorithm over HHL for matrix inversion to Hamiltonian simulation algorithm…

quant-ph20161 cited

Design Automation and Design Space Exploration for Quantum Computers

Mathias Soeken, Martin Roetteler, Nathan Wiebe +1

A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for ar…