Related papers: Interactive proofs for BQP via self-tested graph s…
Measurement-based quantum computation (MBQC) offers a promising paradigm for photonic quantum computing, but its implementation requires the generation of specific non-Gaussian resource states. While continuous-variable encodings such as…
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…
Consider the task of verifying that a given quantum device, designed to produce a particular entangled state, does indeed produce that state. One natural approach would be to characterise the output state by quantum state tomography; or…
We show that if a language $L$ admits a public-coin unambiguous interactive proof (UIP) with round complexity $\ell$, where $a$ bits are communicated per round, then the batch language $L^{\otimes k}$, i.e. the set of $k$-tuples of…
Distributed quantum communication and quantum computing offer many new opportunities for quantum information processing. Here networks based on highly nonlocal quantum resources with complex entanglement structures have been proposed for…
Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit…
Quantum discord and quantum entanglement are resources in some quantum information processing (QIP) models. However, in recent years, the evidence that separable states or classically correlated states can also accomplish QIP is…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly MQA (also…
Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation. Any such…
We introduce a framework for graphical security proofs in device-independent quantum cryptography using the methods of categorical quantum mechanics. We are optimistic that this approach will make some of the highly complex proofs in…
The accurate and reliable description of measurement devices is a central problem in both observing uniquely non-classical behaviors and realizing quantum technologies from powerful computing to precision metrology. To date quantum…
In this paper we consider what can be computed by a user interacting with a potentially malicious server, when the server performs polynomial-time quantum computation but the user can only perform polynomial-time classical (i.e.,…
We use a single trapped-ion qutrit to demonstrate the violation of an input-state-independent non-contextuality inequality using a sequence of randomly chosen quantum non-demolition projective measurements. We concatenate 54 million…
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we show that "for most practical purposes" one can learn a…
As quantum technologies mature, the development of tools for benchmarking their ability to prepare and manipulate complex quantum states becomes increasingly necessary. A key concept, the state overlap between two quantum states, offers a…
One of the main subjects of this paper is to study quantum property testing with local measurement. In particular, we establish a novel $\ell_2$ norm connection between quantum property testing problems and the corresponding distribution…
We demonstrate that weighted graph states (WGS) generated via variable-range interacting Ising spin systems where the interaction strength decays with distance as a power law, characterized by the fall-off rate, can successfully implement…
Although quantum entanglement has already been verified experimentally and applied in quantum computing, quantum sensing and quantum networks, most of the existing measures cannot characterize the entanglement faithfully. In this work, by…