Consider the number of steps needed by algorithms to locate the minimum of functions defined on the d-cube, where the functions are known to have no local minima except the global minimum. Regard this ...

Quantum walks, the quantum analogue of classical random walks, have emerged as a pivotal framework in the study of quantum dynamics and information processing. These systems exploit inherently quantum ...

Delayed-acceptance Metropolis–Hastings and delayed-acceptance pseudo-marginal Metropolis–Hastings algorithms can be applied when it is computationally expensive to calculate the true posterior or an ...