Related papers: On Perfect Completeness for QMA
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box.…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum entanglement between particles is expected to allow one to perform tasks that would otherwise be impossible. In quantum sensing and metrology, entanglement is often claimed to enable a precision that cannot be attained with the same…
We study quasi-exact quantum error correcting codes and quantum computation with them. A quasi-exact code is an approximate code such that it contains a finite number of scaling parameters, the tuning of which can flow it to corresponding…
Noise is often regarded as anathema to quantum computation, but in some settings it can be an unlikely ally. We consider the problem of learning the class of $n$-bit parity functions by making queries to a quantum example oracle. In the…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
Is quantum mechanics about 'states'? Or is it basically another kind of probability theory? It is argued that the elementary formalism of quantum mechanics operates as a well-justified alternative to 'classical' instantiations of a…
Although the foundations of quantum and classical physics are much different, it is often difficult to pinpoint which features of a particular system are intrinsically "quantum". Perhapse, the most clear-cut distinction between "classical"…
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…
Accurate uncertainty quantification (UQ) in Large Language Models (LLMs) is critical for trustworthy deployment. While real-world language is inherently ambiguous, reflecting aleatoric uncertainty, existing UQ methods are typically…
In automata theory, the quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to the QFAs augmented with counters or stacks. Moreover, to our…
It is a useful fact in classical computer science that many search problems are reducible to decision problems; this has led to decision problems being regarded as the $\textit{de facto}$ computational task to study in complexity theory. In…
The field of Quantum Computing has gathered significant popularity in recent years and a large number of papers have studied its effectiveness in tackling many tasks. We focus in particular on Quantum Annealing (QA), a meta-heuristic solver…
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…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
Quantum theory is a tremendously successful physical theory, but nevertheless suffers from two serious problems: the measurement problem and the problem of interpretational underdetermination. The latter, however, is largely overlooked as a…
The notion of quantum-mechanical completeness is adapted to situations where the only adequate description is in terms of quantum field theory in curved space-times. It is then shown that Schwarzschild black holes, although geodesically…
We tackle the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch 20 years ago. We show that this decision…
We begin by establishing structural results for several fundamental quantum complexity classes: p/mBQP, p/mQ(C)MA, $\text{p/mQSZK}_{\text{hv}}$, p/mQIP, p/mBQP/qpoly, p/mBQP/poly, and p/mPSPACE. This includes identifying complete problems,…