48 citations · 63 across the 3 of their papers we have counts for
3 papers
quant-ph2022★ 15 cited
Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity
Arthur G. Rattew, Bálint Koczor
Quantum computers will be able solve important problems with significant polynomial and exponential speedups over their classical counterparts, for instance in option pricing in fi…
quant-ph2021
On the Exponential Sample Complexity of the Quantum State Sign Estimation Problem
Arthur G. Rattew, Marco Pistoia
We demonstrate that the ability to estimate the relative sign of an arbitrary -qubit quantum state (with real amplitudes), given only copies of that state, would yield a $kn…
quant-ph2019★ 48 cited
A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
Arthur G. Rattew, Shaohan Hu, Marco Pistoia +2
Variational quantum algorithms have shown promise in numerous fields due to their versatility in solving problems of scientific and commercial interest. However, leading algorithms…