Related papers: The Entangled Quantum Polynomial Hierarchy Collaps…
We show that bipartite entanglement distribution (or entanglement of assistance) in multipartite quantum systems is by nature polygamous. We first provide an analytic upper bound for the concurrence of assistance in bipartite quantum…
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…
We show that the polygamous nature of multi-party quantum correlations can be characterized in a {\em stronger} form based on Tsallis $q$-entropy and $q$-expectation value. By considering the amount of entanglement that can be distributed…
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…
Correlations in Einstein-Podolsky-Rosen (EPR) scenarios, captured by \textit{assemblages} of unnormalised quantum states, have recently caught the attention of the community, both from a foundational and an information-theoretic…
In this paper, we argue that quantum coherence in a bipartite system can be contained either locally or in the correlations between the subsystems. The portion of quantum coherence contained within correlations can be viewed as a kind…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication…
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the…
We investigate the evolution of complexity and entanglement following a quench in a one-dimensional topological system, namely the Su-Schrieffer-Heeger model. We demonstrate that complexity can detect quantum phase transitions and shows…
Quantum entanglement is a key resource, which grants quantum systems the ability to accomplish tasks that are classically impossible. Here, we apply Feynman's sum-over-histories formalism to interacting bipartite quantum systems and…
Quantum coherence profoundly alters classical thermodynamic expectations by modifying the structure and accessibility of probability distributions. Classically, transitions to lower-entropy states (local second-law violations) are…
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…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close…
We generalize quantum-classical PCPs, first introduced by Weggemans, Folkertsma and Cade (TQC 2024), to allow for $q$ quantum queries to a polynomially-sized classical proof ($\mathsf{QCPCP}_{Q,c,s}[q]$). Exploiting a connection with the…
We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection of measurement operators such that (i) the probability of…
We introduce two models of space-bounded quantum interactive proof systems, ${\sf QIPL}$ and ${\sf QIP_{\rm U}L}$. The ${\sf QIP_{\rm U}L}$ model, a space-bounded variant of quantum interactive proofs (${\sf QIP}$) introduced by Watrous (CC…
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky and Rosen [18]. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation,…