Related papers: The Entangled Quantum Polynomial Hierarchy Collaps…
By fully exploiting the existence of the unitarily inequivalent representations of quantum fields, we exhibit the entanglement between inner and outer particles, with respect to the event horizon of a black hole. We compute the entanglement…
We establish a characterization of multi-qubit entanglement constraints in terms of non-negative power of entanglement measures based on unified-$(q,s)$ entropy. Using the Hamming weight of the binary vector related with the distribution of…
Recent experimental tests of Bell inequalities confirm that entangled quantum systems cannot be described by local classical theories but still do not answer the question whether or not quantum systems could in principle be modelled by…
Previous studies in quantum information have recognized that specific types of noise can encode information in certain applications. However, the role of noise in Quantum Hypothesis Testing (QHT), traditionally assumed to undermine…
Quantum theory imposes fundamental limitations to the amount of information that can be carried by any quantum system. On the one hand, Holevo bound rules out the possibility to encode more information in a quantum system than in its…
Quantum bits can be isolated to perform useful information-theoretic tasks, even though physical systems are fundamentally described by very high-dimensional operator algebras. This is because qubits can be consistently embedded into…
The boundary of the lemon billiards is defined by the intersection of two circles of equal unit radius with the distance 2B between their centers, as introduced by Heller and Tomsovic in Phys. Today 46 38 (1993). We study two classical and…
Quantum correlation includes quantum entanglement and quantum discord. Both entanglement and discord have a common necessary condition--------quantum coherence or quantum superposition. In this paper, we attempt to give an alternative…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…
We study the distribution of quantum correlations characterized by monogamy relations in multipartite systems. By using the Hamming weight of the binary vectors associated with the subsystems, we establish a class of monogamy inequalities…
Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a…
We prove a direct product theorem for the one-way entanglement-assisted quantum communication complexity of a general relation $f\subseteq\mathcal{X}\times\mathcal{Y}\times\mathcal{Z}$. For any $\varepsilon, \zeta > 0$ and any $k\geq1$, we…
Recent oracle separations [Kretschmer, TQC'21, Kretschmer et. al., STOC'23] have raised the tantalizing possibility of building quantum cryptography from sources of hardness that persist even if the polynomial hierarchy collapses. We…
We propose a quantum transmission based on bi-photons which are doubly-entangled both in polarisation and phase. This scheme finds a natural application in quantum cryptography, where we show that an eventual eavesdropper is bound to…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
In all well-studied $\mathsf{TFNP}$ subclasses (e.g. $\mathsf{PPA}, \mathsf{PPP}$ etc.), the canonical complete problem takes as input a polynomial-size circuit $C: \{ 0, 1\}^n \rightarrow \{ 0, 1\}^m$ whose input-output behavior implicitly…
A long-standing problem in the foundations of quantum mechanics is to identify a physical principle that explains why algebraically maximal violations of Bell inequalities can generally not be achieved in Nature. One recently proposed…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…