Related papers: Quantum Merlin-Arthur and proofs without relative …
A recent method of constructing quantum mechanics in noncommutative coordinates, alternative to implying noncommutativity by means of star product is discussed. Within this approach we study Hall effect as well as quantum phases in…
Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a…
We study the power of quantum witnesses under perfect completeness. We construct a classical oracle relative to which a language lies in $\mathsf{QMA}_1$ but not in $\mathsf{QCMA}$ when the $\mathsf{QCMA}$ verifier is only allowed…
Using the tool of concatenated stabilizer coding, we prove that the complexity class QMA remains unchanged even if every witness qubit is disturbed by constant noise. This result may not only be relevant for physical implementations of…
It is nowadays accepted that truly quantum correlations can exist even in the absence of entanglement. For the case of symmetric states, a physically trivial unitary transformation can alter a quantum state from entangled to separable and…
We investigate two resources whose effects on quantum interactive proofs remain poorly understood: the promise of unentanglement, and the verifier's ability to condition on an intermediate measurement, which we call post-measurement…
In this paper we explore the power of AM for the case that verifiers are {\em two-way finite automata with quantum and classical states} (2QCFA)--introduced by Ambainis and Watrous in 2002--and the communications are classical. It is of…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
Entanglement and interference are among the most fundamental properties of quantum mechanics. In this work, we investigate the role and power of interference in the context of detecting entanglement. We do so from a computational complexity…
It is shown that the ensemble $\{p (\alpha),|\alpha>|\alpha^*>\}$ where $p (\alpha)$ is a Gaussian distribution of finite variance and $| \alpha>$ is a coherent state can be better discriminated with an entangled measurement than with any…
Quantum physics, despite its observables being intrinsically of a probabilistic nature, does not have a quantum entropy assigned to them. We propose a quantum entropy that quantify the randomness of a pure quantum state via a conjugate pair…
We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation…
Quantum operations represented by completely positive maps encompass many of the physical processes and have been very powerful in describing quantum computation and information processing tasks. We introduce the notion of relative phase…
We develop a new lower bound method for analysing the complexity of the Equality function (EQ) in the Simultaneous Message Passing (SMP) model of communication complexity. The new technique gives tight lower bounds of $\Omega(\sqrt n)$ for…
Quantum phase transitions (QPTs), including symmetry breaking and topological types, always associated with gap closing and opening. We analyze the topological features of the quantum phase boundary of the XY model in a transverse magnetic…
The computational complexity conjecture of NP $\nsubseteq$ BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim to verify how this computation originated gapless point…
Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in the quantum context raises many open problems, as there are…
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other standard primitives, known based on the Learning with Errors…
The class MA consists of languages that can be efficiently verified by classical probabilistic verifiers using a single classical certificate, and the class QMA consists of languages that can be efficiently verified by quantum verifiers…
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum…