activity
20132024
most citedQuantum advantage of unitary Clifford circuits with magic state inputs

43 citations · 117 across the 7 of their papers we have counts for

collaborators

9 papers

quant-ph2024

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…

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★ 18 cited

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★ 41 cited

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★ 43 cited

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-ph2017★ 4 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

Quantum conditional query complexity

Imdad S. B. Sardharwalla, Sergii Strelchuk, Richard Jozsa

We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distri…

quant-ph2016★ 11 cited

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…

quant-ph2013

Jordan-Wigner formalism for arbitrary 2-input 2-output matchgates and their classical simulation

Richard Jozsa, Akimasa Miyake, Sergii Strelchuk

In Valiant's matchgate theory, 2-input 2-output matchgates are 4x4 matrices that satisfy ten so-called matchgate identities. We prove that the set of all such matchgates (including…