166 citations · 314 across the 20 of their papers we have counts for
21 papers
Quantum Accreditation with Non-Clifford Two-qubit Gates
Andrew Jackson, Theodoros Kapourniotis, Animesh Datta
We develop a family of quantum accreditation protocols for quantum circuits with non-Clifford two-qubit gates. The latter includes families of gates such as the fSim and XY familie…
Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization
Vincent Graves, Manqoba Q. Hlatshwayo, Theodoros Kapourniotis +1
Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithm…
Plugging Leaks in Fault-Tolerant Quantum Computation and Verification
Theodoros Kapourniotis, Dominik Leichtle, Luka Music +1
With the advent of quantum cloud computing, the security of delegated quantum computation has become of utmost importance. While multiple statistically secure blind verification sc…
Cross-Platform Benchmarking of Near-Term Quantum Optimisation Algorithms
Kieran McDowall, Theodoros Kapourniotis, Christopher Oliver +2
Quantum computers show potential for achieving computational advantage over classical computers, with many candidate applications in combinatorial optimisation. We present an appli…
A Review and Collection of Metrics and Benchmarks for Quantum Computers: definitions, methodologies and software
Deep Lall, Abhishek Agarwal, Weixi Zhang +15
Quantum computers have the potential to provide an advantage over classical computers in a number of areas. Numerous metrics to benchmark the performance of quantum computers, rang…
Accreditation of Analogue Quantum Simulators
Andrew Jackson, Theodoros Kapourniotis, Animesh Datta
We present an accreditation protocol for analogue, i.e., continuous-time, quantum simulators. For a given simulation task, it provides an upper bound on the variation distance betw…
Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority
Theodoros Kapourniotis, Elham Kashefi, Dominik Leichtle +2
Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a pro…
Partition Function Estimation: Quantum and Quantum-Inspired Algorithms
Andrew Jackson, Theodoros Kapourniotis, Animesh Datta
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation w…
Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
Theodoros Kapourniotis, Elham Kashefi, Dominik Leichtle +2
With the advent of cloud-based quantum computing, it has become vital to provide strong guarantees that computations delegated by clients to quantum service providers have been exe…
Randomized Benchmarking with Stabilizer Verification and Gate Synthesis
Ellen Derbyshire, Rawad Mezher, Theodoros Kapourniotis +1
Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine l…
Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds
Theodoros Kapourniotis, Elham Kashefi, Luka Music +1
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks through it's ability to preserve privacy and integrity of the…
Accrediting outputs of noisy intermediate-scale quantum computing devices
Samuele Ferracin, Theodoros Kapourniotis, Animesh Datta
We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protoco…
Fault-tolerant quantum metrology
Theodoros Kapourniotis, Animesh Datta
We introduce the notion of fault-tolerant quantum metrology to overcome noise beyond our control -- associated with sensing the parameter, by reducing the noise in operations under…
Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
Daniel Mills, Anna Pappa, Theodoros Kapourniotis +1
The efficient certification of classically intractable quantum devices has been a central research question for some time. However, to observe a "quantum advantage", it is believed…
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…
On optimising quantum communication in verifiable quantum computing
Theodoros Kapourniotis, Vedran Dunjko, Elham Kashefi
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highl…
Quantum-enhanced Secure Delegated Classical Computing
Vedran Dunjko, Theodoros Kapourniotis, Elham Kashefi
We present a quantumly-enhanced protocol to achieve unconditionally secure delegated classical computation where the client and the server have both limited classical and quantum c…
Verified Delegated Quantum Computing with One Pure Qubit
Theodoros Kapourniotis, Elham Kashefi, Animesh Datta
While building a universal quantum computer remains challenging, devices of restricted power such as the so-called one pure qubit model have attracted considerable attention. An im…