2 citations · 2 across the 2 of their papers we have counts for
4 papers
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…
A condition under which classical simulability implies efficient state learnability
Mithuna Yoganathan
In the task of quantum state learning, one receives some data about measurements performed on a state, and using that, must make predictions on the outcomes of unseen measurements.…
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…
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…