1.3k citations · 7.2k across the 49 of their papers we have counts for
51 papers
IQP computations with intermediate measurements
Richard Jozsa, Soumik Ghosh, Sergii Strelchuk
We consider the computational model of IQP circuits (in which all computational steps are basis diagonal gates), supplemented by intermediate or basis measurements. We…
Computational power of matchgates with supplementary resources
Martin Hebenstreit, Richard Jozsa, Barbara Kraus +1
We study the classical simulation complexity in both the weak and strong senses, of matchgate (MG) computations supplemented with all combinations of settings involving inclusion o…
All pure fermionic non-Gaussian states are magic states for matchgate computations
Martin Hebenstreit, Richard Jozsa, Barbara Kraus +2
Magic states were introduced in the context of Clifford circuits as a resource that elevates classically simulatable computations to quantum universal capability, while maintaining…
Implementing smooth functions of a Hermitian matrix on a quantum computer
Sathyawageeswar Subramanian, Steve Brierley, Richard Jozsa
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which…
Quantum advantage of unitary Clifford circuits with magic state inputs
Mithuna Yoganathan, Richard Jozsa, Sergii Strelchuk
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuit…
Efficient classical verification of quantum computations
Richard Jozsa, Sergii Strelchuk
We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkab…