相关论文: Impossibility of Succinct Quantum Proofs for Colli…

We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…

In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall,…

We consider a generalization of the standard oracle model in which the oracle acts on the target with a permutation selected according to internal random coins. We describe several problems that are impossible to solve classically but can…

In the Schroedinger formulation of non-Hermitian quantum theories a positive-definite metric operator $\eta\equiv e^{-Q}$ must be introduced in order to ensure their probabilistic interpretation. This operator also gives an equivalent…

We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot…

A long-standing open problem in quantum complexity theory is whether ${\sf QMA}$, the quantum analogue of ${\sf NP}$, is equal to ${\sf QMA}_1$, its one-sided error variant. We show that ${\sf QMA}={\sf QMA}^{\infty}= {\sf QMA}_1^{\infty}$,…

In a previous paper (arXiv:1008.3661v1[quant-ph] 21 Aug 2010), we have given a purely logical proof of the Conway and Kochen Free Will theorem in QM: the freedom of the observer implies the freedom of the observed particle. Here we show…

We consider the following problem: estimate the size of a nonempty set $S\subseteq\left[ N\right] $, given both quantum queries to a membership oracle for $S$, and a device that generates equal superpositions $\left\vert S\right\rangle $…

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order finding, which quantum mechanics lets us perform…

We derive lower bounds for tradeoffs between the communication C and space S for communicating circuits. The first such bound applies to quantum circuits. If for any function f with image Z the multicolor discrepancy of the communication…

Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum…

The ability of the Quantum Approximate Optimization Algorithm (QAOA) to deliver a quantum advantage on combinatorial optimization problems is still unclear. Recently, a scaling advantage over a classical solver was postulated to exist for…

This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with…

In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quantum algorithms in a practical manner. In this paper, we show…

We initiate the study of quantum Interactive Oracle Proofs (qIOPs), a generalization of both quantum Probabilistically Checkable Proofs and quantum Interactive Proofs, as well as a quantum analogue of classical Interactive Oracle Proofs. In…

We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Loschmidt echo, FD) in a classically chaotic system. It was thought that such evaluation would be intractable, but instead we show that a…

In the oracle identification problem, we are given oracle access to an unknown N-bit string x promised to belong to a known set C of size M and our task is to identify x. We present a quantum algorithm for the problem that is optimal in its…

We derive an expression that allows for the unambiguous evaluation of the overlap between two arbitrary quasiparticle vacua, including its sign. Our expression is based on the Pfaffian of a skew-symmetric matrix, extending the formula…

We define the problem identity check: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex…