Related papers: Interactive proofs for BQP via self-tested graph s…
With the advent of delegated quantum computing as a service, verifying quantum computations is becoming a question of great importance. Existing information theoretically Secure Delegated Quantum Computing (SDQC) protocols require the…
In measurement-based quantum computing an algorithm is performed by measurements on highly-entangled resource states. To date, several implementations were demonstrated, all of them assuming perfect noise-free environments. Here we consider…
Interactive proofs (IP) model a world where a verifier delegates computation to an untrustworthy prover, verifying the prover's claims before accepting them. IP protocols have applications in areas such as verifiable computation…
We propose practical and efficient protocols for verifying bipartite pure states for any finite dimension, which can also be applied to fidelity estimation. Our protocols are based on adaptive local projective measurements with either…
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…
We show that quantum computation circuits with coherent states as the logical qubits can be constructed using very simple linear networks, conditional measurements and coherent superposition resource states.
Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in the light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal…
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify…
Quantum entanglement is the key resource for quantum information processing. Device-independent certification of entangled states is a long standing open question, which arouses the concept of self-testing. The central aim of self-testing…
Complexity class containments involving interactive proof classes are famously nonrelativizing: although $\mathsf{IP} = \mathsf{PSPACE}$, Fortnow and Sipser showed that that there exists an oracle relative to which $\mathsf{coNP}…
Graph states -- one of the most representative families of multipartite entangled states, are important resources for multiparty quantum communication, quantum error correction, and quantum computation. Device-independent certification of…
Quantum Information Processing, which is an exciting area of research at the intersection of physics and computer science, has great potential for influencing the future development of information processing systems. The building of…
We introduce a protocol between a classical polynomial-time verifier and a quantum polynomial-time prover that allows the verifier to securely delegate to the prover the preparation of certain single-qubit quantum states. The protocol…
With experimental quantum computing technologies now in their infancy, the search for efficient means of testing the correctness of these quantum computations is becoming more pressing. An approach to the verification of quantum computation…
Testing the symmetries of quantum states and channels provides a way to assess their usefulness for different physical, computational, and communication tasks. Here, we establish several complexity-theoretic results that classify the…
We propose to extend the Dafny system with an interactive proof mode. We present a motivating example, how the IPM works, including the main design choices we make, and a prototype implementation.
We introduce the notion of coherent graphs, and show how those can be used to define dynamic semantics for Multiplicative Linear Logic (MLL) extended with non-determinism. Thanks to the use of a coherence relation rather than mere formal…
Quantum state verification (QSV) is the task of relying on local measurements only to verify that a given quantum device does produce the desired target state. Up to now, certain types of entangled states can be verified efficiently or even…
Certifying quantum properties with minimal assumptions is a fundamental problem in quantum information science. Self-testing is a method to infer the underlying physics of a quantum experiment only from the measured statistics. While all…
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…