activity
20162021
most citedEfficient classical verification of quantum computations

4 citations · 4 across the 1 of their papers we have counts for

collaborators

6 papers

quant-ph2021

Measuring time with stationary quantum clocks

Sergii Strelchuk, Mischa P. Woods

Time plays a fundamental role in our ability to make sense of the physical laws in the world around us. The nature of time has puzzled people -- from the ancient Greeks to the pres…

quant-ph2020

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…

quant-ph2019

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…

quant-ph2018

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…

quant-ph20174 cited

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…

quant-ph2016

Optimal amount of entanglement to distinguish quantum states instantaneously

Berry Groisman, Sergii Strelchuk

We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence…