2 citations · 2 across the 1 of their papers we have counts for
4 papers
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
Chris Cade, Lana Mineh, Ashley Montanaro +1
The Fermi-Hubbard model is of fundamental importance in condensed-matter physics, yet is extremely challenging to solve numerically. Finding the ground state of the Hubbard model u…
The one clean qubit model without entanglement is classically simulable
Mithuna Yoganathan, Chris Cade
Entanglement has been shown to be necessary for pure state quantum computation to have an advantage over classical computation. However, it remains open whether entanglement is nec…
Post-selected Classical Query Complexity
Chris Cade
We study classical query algorithms with post-selection, and find that they are closely connected to rational functions with nonnegative coefficients. We show that the post-selecte…
The Quantum Complexity of Computing Schatten -norms
Chris Cade, Ashley Montanaro
We consider the quantum complexity of computing Schatten -norms and related quantities, and find that the problem of estimating these quantities is closely related to the one cl…