Related papers: Even quantum advice is unlikely to solve PP
There are three different types of nondeterminism in quantum communication: i) $\nqp$-communication, ii) $\qma$-communication, and iii) $\qcma$-communication. In this \redout{paper} we show that multiparty $\nqp$-communication can be…
The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers.…
As the finite Hall planes are Non-Desarguesian, the Pappus Theorem does not hold in them. In this paper we state and prove some weaker versions of Pappus's Theorem in Hall planes.
We prove existence and regularity results for weak solutions of non linear elliptic systems with non variational structure satisfying $(p,q)$-growth conditions. In particular we are able to prove higher differentiability results under a…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
We show that computational problem of testing the behaviour of quantum circuits is hard for the class of problems known as QMA that can be verified efficiently with a quantum computer. This result is a generalization of the techniques…
A logarithmic but divergent term usually appears in the computation of entanglement entropy circumferencing a black hole, while the leading quantum correction to the Bekenstein-Hawking entropy also takes the logarithmic form. A quench model…
We construct a weakly compact convex subset of $\ell^2$ with nonempty interior that has an isolated maximal element, with respect to the lattice order $\ell _+^2$. Moreover, the maximal point cannot be supported by any strictly positive…
A conjecture of Jozsa (arXiv:quant-ph/0508124) states that any polynomial-time quantum computation can be simulated by polylogarithmic-depth quantum computation interleaved with polynomial-depth classical computation. Separately, Aaronson…
Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove that if this protocol is zero knowledge with a black-box,…
We present a formulation of quantum circuits where the focus is set on whether a given circuit (made of unitary operators and projective measurements with definite outcomes) does reflect an actually realizable physical experiment. In order…
An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with…
We argue that one of the following statements must be true: (a) extensive violations of quantum information theory's additivity conjectures exist or (b) there exists a set of `disentangled' black hole microstates that can account for the…
We prove that QMA where the verifier may also make a single non-collapsing measurement is equal to NEXP, resolving an open question of Aaronson. We show this is a corollary to a modified proof of QMA+ = NEXP [arXiv:2306.13247]. At the core…
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…
Quantum theory makes the most accurate empirical predictions and yet it lacks simple, comprehensible physical principles from which the theory can be uniquely derived. A broad class of probabilistic theories exist which all share some…
Considering a complicated extension of a Wigner's friend scenario, Frauchiger and Renner (FR) allegedly showed that "quantum theory cannot consistently describe the use of itself". However, such a result has been under severe criticism, as…
We consider the task of verifying the correctness of quantum computation for a restricted class of circuits which contain at most two basis changes. This contains circuits giving rise to the second level of the Fourier Hierarchy, the lowest…