Quantum error-correcting codes can protect multipartite quantum states from errors on some limited number of their subsystems (usually qubits). We construct a family of Bell inequalities which inherit this property from the underlying code and exhibit the violation of local realism, without any quantum information processing (except for the creation of an entangled state). This family shows no reduction in the size of the violation of local realism for arbitrary errors on a limited number of qubits. Our minimal construction requires preparing an 11-qubit entangled state.
Quantum error-correcting codes can protect multipartite quantum states from errors on some limited number of their subsystems (usually qubits). We construct a family of Bell inequalities which inherit this property from the underlying code and exhibit the violation of local realism, without any quantum information processing (except for the creation of an entangled state). This family shows no reduction in the size of the violation of local realism for arbitrary errors on a limited number of qubits. Our minimal construction requires preparing an 11-qubit entangled state.
A family of Bell-type inequalities is present, which are constructed directly from the "standard" Bell inequalities involving two dichotomic observables per site. It is shown that the inequalities are violated by all the generalized Greenberger-Horne-Zeilinger states of multiqubits. Remarkably, our new inequalities can provide stronger non-locality tests in a sense that the local reality inequalities are exponentially stronger than the corresponding multipartite separability inequalities. This reveals that the exponential violation of local realism by separable states is an interesting consequence of quantum fluctuation of multipartite systems.
Quantum nonlocality based on the violation of Bell-like inequalities constitutes a fundamental feature of quantum physics and drives the development of device-independent (DI) quantum information technologies. Existing studies of Bell nonlocality have mainly focused on physical qubit systems, where the observed nonlocal correlations are directly encoded in physical degrees of freedom. The decoherence sensitivity of Bell nonlocality largely limits the performance and security of its DI applications. Here, we investigate the robust logical Bell nonlocality based on quantum error correction codes. We construct the general logical Bell inequality in the stabilizer coding subspace and prove its violation indicates the global nonlocal feature of the logical system. Then, we indicate that the logical Bell nonlocality is robust against decoherence. Comparing with the physical qubit system, the fidelity thresholds for the logical Bell inequality violation based on the [[3,1,1]] and [[7,1,1]] repetition codes under the bit-flip error model can be reduced from 82.8% to 73.10% and 66.35%, increasing DI QKD's bit-flip noise threshold from 10.64% to 14.42% and 23.36%, respectively. Such stabilizer-based framework can be also used to characterize the multipartite logical Bell nonlocality in principle. Finally, a logical Bell test implementation circuit based on the [[3,1,1]] repetition code is presented. This work provides a feasible avenue for unlocking robust Bell nonlocality in scalable logical quantum systems and facilitates its applications in future scalable quantum network.
We investigate the Bell inequalities derived from the graph states with violations detectable even with the presence of noises, which generalizes the idea of error-correcting Bell inequalities [Phys. Rev. Lett. 101, 080501 (2008)]. Firstly we construct a family of valid Bell inequalities tolerating arbitrary t-qubit errors involving 3(t+1) qubits, e.g., 6 qubits suffice to tolerate single qubit errors. Secondly we construct also a single-error-tolerating Bell inequality with a violation that increases exponentially with the number of qubits. Exhaustive computer search for optimal error-tolerating Bell inequalities based on graph states on no more than 10 qubits shows that our constructions are optimal for single- and double-error tolerance.
Local measurements acting on entangled quantum states give rise to a rich correlation structure in the multipartite scenario. We introduce a versatile technique to build families of Bell inequalities witnessing different notions of multipartite nonlocality for any number of parties. The idea behind our method is simple: a known Bell inequality satisfying certain constraints, for example the Clauser–Horne–Shimony–Holt inequality, serves as the seed to build new families of inequalities for more parties. The constructed inequalities have a clear operational meaning, capturing an essential feature of multipartite correlations: their violation implies that numerous subgroups of parties violate the inequality chosen as seed. The more multipartite nonlocal the correlations, the more subgroups can violate the seed. We illustrate our construction using different seeds and designing Bell inequalities to detect k -way nonlocal multipartite correlations, in particular, genuine multipartite nonlocal correlations—the strongest notion of multipartite nonlocality. For one of our inequalities we prove analytically that a large class of pure states that are genuine multipartite entangled (GME) exhibit genuine multipartite nonlocality for any number of parties, even for some states that are almost product. We also provide numerical evidence that this family is violated by all GME pure states of three and four qubits. Our results make us conjecture that this family of Bell inequalities can be used to prove the equivalence between genuine multipartite pure-state entanglement and nonlocality for any number of parties.
This work provides quantitative tests of the extent of violation of two inequalities applicable to qubits coupled into Bell states, using IBM's publicly accessible quantum computers. Violations of the inequalities are well established. Our purpose is not to test the inequalities, but rather to determine how well quantum mechanical predictions can be reproduced on quantum computers, given their current fault rates. We present results for the spin projections of two entangled qubits, along three axes A, B, and C, with a fixed angle θ between A and B and a range of angles θ' between B and C. For any classical object that can be characterized by three observables with two possible values, inequalities govern relationships among the probabilities of outcomes for the observables, taken pairwise. From set theory, these inequalities must be satisfied by all such classical objects; but quantum systems may violate the inequalities. We have detected clear-cut violations of one inequality in runs on IBM's publicly accessible quantum computers. The Clauser-Horne-Shimony-Holt (CHSH) inequality governs a linear combination S of expectation values of products of spin projections, taken pairwise. Finding S > 2 rules out local, hidden variable theories for entangled quantum systems. We obtained values of S greater than 2 in our runs prior to error mitigation. To reduce the quantitative errors, we used a modification of the error-mitigation procedure in the IBM documentation. We prepared a pair of qubits in the state |00〉, found the probabilities to observe the states |00〉, |01〉, |10〉, and |11〉 in multiple runs, and used that information to construct the first column of an error matrix M. We repeated this procedure for states prepared as |01〉, |10〉, and |11〉 to construct the full matrix M, whose inverse is the filtering matrix. After applying filtering matrices to our averaged outcomes, we have found good quantitative agreement between the quantum computer output and the quantum mechanical predictions for the extent of violation of both inequalities as functions of θ'.
Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.