166 citations · 314 across the 20 of their papers we have counts for
4 papers · 2 filters
Reducing resources for verification of quantum computations
Samuele Ferracin, Theodoros Kapourniotis, Animesh Datta
We present two verification protocols where the correctness of a "target" computation is checked by means of "trap" computations that can be efficiently simulated on a classical co…
Verification of quantum computation: An overview of existing approaches
Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also cons…
Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation
Daniel Mills, Anna Pappa, Theodoros Kapourniotis +1
We propose a new composable and information-theoretically secure protocol to verify that a server has the power to sample from a sub-universal quantum machine implementing only com…
Nonadaptive fault-tolerant verification of quantum supremacy with noise
Theodoros Kapourniotis, Animesh Datta
Quantum samplers are believed capable of sampling efficiently from distributions that are classically hard to sample from. We consider a sampler inspired by the classical Ising mod…