Search

We present a generalization of the tilted Bell inequality for quantum [[n,k,d]] error-correcting codes and explicitly utilize the simplest perfect code, the [[5,1,3]] code, the Steane [[7,1,3]] code, and Shor's [[9,1,3]] code, to demonstrate the self-testing property of their respective codespaces. Additionally, we establish a framework for the proof of self-testing, as detailed in \cite{baccari2020device}, which can be generalized to the codespace of CSS stabilizers. Our method provides a self-testing scheme for $\cos\theta \lvert \bar{0} \rangle + \sin\theta \lvert \bar{1} \rangle$, where $\theta \in [0, \frac{\pi}{2}]$, and also discusses its experimental application. We also investigate whether such property can be generalized to qudit and show one no-go theorem. We then define a computational problem called ISSELFTEST and describe how this problem formulation can be interpreted as a statement that maximal violation of a specific Bell-type inequality can self-test a particular entanglement subspace. We also discuss the computational complexity of ISSELFTEST in comparison to other classical complexity challenges and some related open problems.

Bell nonlocality and uncertainty relations are distinct features of quantum theory from classical physics. Bell nonlocality concerns the correlation strength among local observables on different quantum particles, whereas the uncertainty relations set the lower bound of the sum or product of the variance square of observables. Here we establish the statistical link between these two quantum characters using the Aharonov-Vaidman identity. Therein, the upper bounds of Bell-type inequalities are expressed in terms of the product of the local sum of the variance square. On the other hand, instead of evaluating local uncertainty relations, the uncertainty relations on two or more quantum systems are upper-bounded by the amount of Bell nonlocality therein., Comment: 13 pages

In the literature on $K$-locality ($K\geq2$) networks, the local hidden variables are strictly distributed in the specific observers rather than the whole ones. Regarding genuine Bell locality, all local hidden variables, as classical objects that allow for perfect cloning in classical physics, should be cloned and then spread throughout the networks. More correlators are involved in the proposed linear and non-linear Bell-type inequalities, where their upper bounds are specified by the pre-determined output probability distribution. As for the quantum version, the no-clone theorem limits the broadcast of quantum correlations. To explore genuine Bell nonlocality in variant particle distributions in the networks, the Pauli operators stabilizing the two-qubit Bell states or multi-qubit Greenberger--Horne--Zeilinger states (GHZ states) play an essential role in designing the proposed linear and non-linear Bell tests and assigning the local incompatible measurements for the spatially separated observers. We prove the maximal violations of the proposed Bell-type inequalities quantum networks. In the end, how entanglement swapping replaces the joint measurements in the Bell tests is demonstrated., Comment: 20 pages, titled changed and new results added in the revised version

In quantum state discrimination, the observers are given a quantum system and aim to verify its state from the two or more possible target states. In the local quantum state marking as an extension of quantum state discrimination, there are N composite quantum systems and N possible orthogonal target quantum states. Distant Alice and Bob are asked to correctly mark the states of the given quantum systems via local operations and classical communication. Here we investigate the local state marking with N 4 ${\otimes}$ 4 systems, N=4, 5, 6, and 7. Therein, Alice and Bob allow for three local operations: measuring the local observable either ${\sigma}_{z}$ or ${\sigma}_{x}$ simultaneously, and entanglement swapping. It shows that, given arbitrary four 4 ${\otimes}$ 4 systems, Alice and Bob can perform the perfect local quantum state marking. In the N=5, 6 cases, they can perform perfect local state marking with specific target states. We conjecture the impossibility of the local quantum state marking given any seven target states since Alice and Bob cannot fulfill the task in the simplest case., Comment: 20 pages

In practical quantum networks, a variety of multi-qubit stabilized states emitted from independent sources are distributed among the agents, and the correlations across the entire network can be derived from each agent's local measurements on the shared composite quantum systems. To reveal the Bell non-locality in such cases as a quantum feature, minimal knowledge of the emitted stabilizer state is required. Here, we demonstrate that knowing the stabilizing and logical operators indeed provides a new way of exploring Bell non-locality in quantum networks. For the qubit distribution in quantum networks, the associated nonlinear Bell inequalities are derived. On the other hand, to violate these inequalities, one can design local incompatible observables using minimal knowledge of the emitted states. The tilted nonlinear Bell inequalities tailored for specific non-maximal entangled stabilizer states and a way of achieving the maximal violation are also explored., Comment: 21 pages, 2 figures

Theoretically speaking, a photon can travel arbitrarily long before it enters into a detector, resulting a click. How much information can a photon carry? We study a bipartite asymmetric "two-way signaling" protocol as an extension of that proposed by Del Santo and Daki\'{c}. Suppose that Alice and Bob are distant from each other and each of them has an $n$-bit string. They are tasked to exchange the information of their local n-bit strings with each other, using only a single photon during the communication. It has been shown that the superposition of different spatial locations in a Mach-Zehnder (MZ) interferometer enables bipartite local encodings. We show that, after the travel of a photon through a cascade of $n$-level MZ interferometers in our protocol, the one of Alice or Bob whose detector clicks can access the other's full information of $n$-bit string, while the other can gain one-bit of information. That is, the wave-particle duality makes two-way signaling possible, and a single photon can carry arbitrarily large (but finite) information., Comment: 6 pages, 6 figures

We explore the modification of the entropic formulation of uncertainty principle in quantum mechanics which measures the incompatibility of measurements in terms of Shannon entropy. The deformation in question is the type so called generalized uncertainty principle that is motivated by thought experiments in quantum gravity and string theory and is characterized by a parameter of Planck scale. The corrections are evaluated for small deformation parameters by use of the Gaussian wave function and numerical calculation. As the generalized uncertainty principle has proven to be useful in the study of the quantum nature of black holes, this study would be a step toward introducing an information theory viewpoint to black hole physics., Comment: 14 pages, 9 figures; Ver 2, references and a new discussion based on an auxiliary momentum are added; Ver. 3, references updated. Final version to appear in Mod. Phys. Lett. A

In 1927, Heisenberg heuristically disclosed the tradeoff between the error in the measurement and the caused disturbance on another complementary observable. In the quantum theory, most of uncertainty relations are proposed to reveal the amount of unavoidable uncertainty in the measuring process. In this paper, we study the error-disturbance relation from the information viewpoint. We ask how much information, rather than how much uncertainty, can be obtained during the two sequential measurements. To achieve optimal information gain, we argue that the strategy for the "intelligent" prior apparatus is to clone the unknown state, and for the posterior one is to perform the swapping operation. We propose the coarse-grained random access code, and therein information causality as a physical principle can be exploited for deriving the upper-bound of information gain. Finally, we conjecture the information gain of measuring the position and momentum of a quantum object in the coarse-grained way.

We consider the information causality in the multi-receiver random access codes. Therein, no receiver can gain any information only from classical communication. We claim the following statement. Information causality still holds even with the help of the multi-partite physical non-local resource. That is, the summation of all revivers' information gain cannot be greater than the amount of classical communication. The distributive multi-party physical nonlocal resource can be exploited only for information splitting. It is proved that such trade-off leads to the monogamy of entanglement. Finally the connection between information causality and spin-glass Bethe lattice is discussed., Comment: 10 pages

We reformulate the information causality in a more general framework by adopting the results of signal propagation and computation in a noisy circuit. In our framework, the information causality leads to a broad class of Tsirelson inequalities. This fact allows us to subject information causality to experimental scrutiny. A no-go theorem for reliable nonlocal computation is also derived. Information causality prevents any physical circuit from performing reliable computations., Comment: 4+epsilon pages, 1 figure; v2. Correct typos and add email addresses. Comments are welcome. v3. A supplemental to check Tsirelson bound with SDP is added. v4 minor correction & polishing text

Is information causality a new physical principle? To answer this question, we first analytically derive the criteria of emergence of quantum correlations from information causality. Then it is shown that, as emergence criteria of quantum correlations, information causality and uselessness of coupler-based non-locality swapping can be regarded equivalent. Therefore, incapability of non-locality swapping using a coupler is as powerful as information causality in the single-out of quantum physics from generalized non-signalling models., Comment: Title changed; abstract, introduction and discussions revised

Though the entanglement-assisted formalism provides a universal connection between a classical linear code and an entanglement-assisted quantum error-correcting code (EAQECC), the issue of maintaining large amount of pure maximally entangled states in constructing EAQECCs is a practical obstacle to its use. It is also conjectured that the power of entanglement-assisted formalism to convert those good classical codes comes from massive consumption of maximally entangled states. We show that the above conjecture is wrong by providing families of EAQECCs with an entanglement consumption rate that diminishes linearly as a function of the code length. Notably, two families of EAQECCs constructed in the paper require only one copy of maximally entangled state no matter how large the code length is. These families of EAQECCs that are constructed from classical finite geometric LDPC codes perform very well according to our numerical simulations. Our work indicates that EAQECCs are not only theoretically interesting, but also physically implementable. Finally, these high performance entanglement-assisted LDPC codes with low entanglement consumption rates allow one to construct high-performance standard QECCs with very similar parameters., Comment: 8 pages, 5 figures. Published version

In this paper, we investigate the optimal nonadditive quantum error-detecting codes with distance two. The the numerical simulation shows that, with n being can be 5, 6, 7, 8, 10 and 12, such the n-qubit quantum error-detecting codes with maximal number of codewords can be found. Therein, except the n=7 case, the n-vertex loop graphs help find the optimal quantum codes., Comment: 6 pages, 22 figures

We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are proposed. One is to establish the relation between codewords of the stabilizer quantum error correction codes (SQECCs) and the undetermined states. The other is to study the local complementation rules of the graph states. As an application, the undetermined states can be exploited in the quantum secret sharing scheme. The security is guaranteed by their undetermineness., Comment: 6 pages, no figure

We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible., Comment: 10 pages, 1 figure;v2. discussions improved

We develop a novel necessary condition of quantum correlation. It is utilized to construct $d$-level bipartite Bell-type inequality which is strongly resistant to noise and requires only analyses of $O(d)$ measurement outcomes compared to the previous result $O(d^{2})$. Remarkably, a connection between the arbitrary high-dimensional bipartite Bell-type inequality and entanglement witnesses is found. Through the necessary condition of quantum correlation, we propose that the witness operators to detect truly multipartite entanglement for a generalized Greenberger-Horne-Zeilinger (GHZ) state with two local measurement settings and a four-qubit singlet state with three settings. Moreover, we also propose the first robust entanglement witness to detect four-level tripartite GHZ state with only two local measurement settings.

We provide a novel criterion for identifying quantum correlation, which allows us to find connections between Bell type inequalities, entanglement detection, and correlation. We utilize the criterion to construct witness operators that can detect genuine multi-qubit entanglement with fewer local measurements. The connection between identifications of quantum correlation and Mermin's inequality is discussed. Detection of genuine four-level tripartite entanglement with two local measurement settings is shown in the same manner. Further, through the criterion of quantum correlation, we derive a new Bell inequality for arbitrary high-dimensional bipartite systems, which requires fewer analyses of the measured outcomes., Comment: 4 pages

We provide a solution of finding optimal measurement strategy for distinguishing between symmetric mixed quantum states. It is assumed that the matrix elements of at least one of the symmetric quantum states are all real and nonnegative in the basis of the eigenstates of the symmetry operator., Comment: 10 pages

Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice's card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob's best strategy for guessing Alice's card is to measure his two cards collectively., Comment: 1 table

The paper has been withdrawn