80 citations · 183 across the 25 of their papers we have counts for
26 papers
Zeno-effect Computation: Opportunities and Challenges
Jesse Berwald, Nicholas Chancellor, Raouf Dridi
Adiabatic quantum computing has demonstrated how quantum Zeno can be used to construct quantum optimisers. However, much less work has been done to understand how more general Zeno…
Grover Speedup from Many Forms of the Zeno Effect
Jesse Berwald, Nick Chancellor, Raouf Dridi
It has previously been established that adiabatic quantum computation, operating based on a continuous Zeno effect due to dynamical phases between eigenstates, is able to realise a…
Suppressing unwanted fluctuations in QAOA and approximate quantum annealing
Touheed Anwar Atif, Catherine Potts, David Haycraft +2
The quantum approximate optimisation algorithm (QAOA) was partially inspired by digitising quantum annealing. Based on this inspiration, we develop techniques to use the additional…
Quantum Natural Gradient with Efficient Backtracking Line Search
Touheed Anwar Atif, Uchenna Chukwu, Jesse Berwald +1
We consider the Quantum Natural Gradient Descent (QNGD) scheme which was recently proposed to train variational quantum algorithms. QNGD is Steepest Gradient Descent (SGD) operatin…
Understanding domain-wall encoding theoretically and experimentally
Jesse Berwald, Nicholas Chancellor, Raouf Dridi
We analyze the method of encoding pairwise interactions of higher-than-binary discrete variables (these models are sometimes referred to as discrete quadratic models) into binary v…
Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method
Uchenna Chukwu, Raouf Dridi, Jesse Berwald +5
Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the…