Related papers: Quantum Merlin-Arthur with noisy channel

We show that the class QAM does not change even if the verifier's ability is restricted to only single-qubit measurements. To show the result, we use the idea of the measurement-based quantum computing: the verifier, who can do only…

QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical…

We show that the class QMA does not change even if we restrict Arthur's computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called…

We give a test that can distinguish efficiently between product states of n quantum systems and states which are far from product. If applied to a state psi whose maximum overlap with a product state is 1-epsilon, the test passes with…

Quantum error correction assisted by entanglement helps to transmit the encoded qudits through quantum channels with some of them being noiseless. Here we consider a more realistic scheme for experiments what we called as partial-noisy…

BellQMA protocols are a subclass of multi-prover quantum Merlin-Arthur protocols in which the verifier is restricted to perform nonadaptive,unentangled measurements on the quantum states received from each Merlin. In this paper, we prove…

We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits. These codes arise from an original graph-theoretic representation of sets of quantum…

This paper introduces quantum ``multiple-Merlin''-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical…

Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately,…

We propose a quantum authentication and digital signature protocol whose security is founded on the Quantum Merlin Arthur~(QMA)-completeness of the consistency of local density matrices. The protocol functions as a true public-key…

In the context of measurement-based quantum computation a way of maintaining the coherence of a graph state is to measure its stabilizer operators. Aside from performing quantum error correction, it is possible to exploit the information…

We study a variant of QMA where quantum proofs have no relative phase (i.e. non-negative amplitudes, up to a global phase). If only completeness is modified, this class is equal to QMA [arXiv:1410.2882]; but if both completeness and…

Quantum Merlin-Arthur proof systems are believed to be stronger than both their classical counterparts and ``stand-alone'' quantum computers when Arthur is assumed to operate in $\Omega(\log n)$ space. No hint of such an advantage over…

Fragile quantum features such as entanglement are employed to improve the precision of parameter estimation and as a consequence the quantum gain becomes vulnerable to noise. As an established tool to subdue noise, quantum error correction…

Noise is the main obstacle for the realization of fault tolerant quantum information processing and secure communication over long distances. In this work, we propose a communication protocol relying on simple linear optics that optimally…

Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…

A generic qubit unitary operator affected by quantum noise is duplicated and inserted in a coherently superposed channel, superposing two paths offered to a probe qubit across the noisy unitary, and driven by a control qubit. A…

Classical verification of quantum learning allows classical clients to reliably leverage quantum computing advantages by interacting with untrusted quantum servers. Yet, current quantum devices available in practice suffers from a variety…

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…

We give a simpler proof of one of the results of Kobayashi, Le Gall, and Nishimura [arXiv:1210.1290v2], which shows that any QMA protocol can be converted to a one-sided error protocol, in which Arthur and Merlin initially share a constant…