Universal bound on the cardinality of local hidden variables in networks

Abstract

We present an algebraic description of the sets of local correlations in arbitrary networks, when the parties have finite inputs and outputs. We consider networks generalizing the usual Bell scenarios by the presence of multiple uncorrelated sources. We prove a finite upper bound on the cardinality of the value sets of the local hidden variables. Consequently, we find that the sets of local correlations are connected, closed and semialgebraic, and bounded by tight polynomial Bell-like inequalities.

arXiv comment5 pages + 6 pages appendix, 2 figures, comments welcome

References in corpus (14)

• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Experimental Quantum Computations on a Topologically Encoded Qubit
• Low-distance Surface Codes under Realistic Quantum Noise
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Quantum error correction with only two extra qubits
• Implementation of the Five Qubit Error Correction Benchmark
• Fault-tolerant quantum error detection
• Fault-tolerant quantum computation with few qubits
• Fault-tolerant quantum computation
• Quantum accuracy threshold for concatenated distance-3 codes
• Overhead analysis of universal concatenated quantum codes
• Thresholds for universal concatenated quantum codes
• Quantum fault tolerance in small experiments
• Error rates and resource overheads of encoded three-qubit gates

Cited by in corpus (19)

• Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits
• Genuine quantum nonlocality in the triangle network
• Resource Efficient Zero Noise Extrapolation with Identity Insertions
• Entanglement-Assisted Quantum Networks: Mechanics, Enabling Technologies, Challenges, and Research Directions
• Mitiq: A software package for error mitigation on noisy quantum computers
• Limits on correlations in networks for quantum and no-signaling resources
• Error detection on quantum computers improves accuracy of chemical calculations
• Active Readout Error Mitigation
• Readout Rebalancing for Near Term Quantum Computers
• Benchmarking near-term devices with quantum error correction
• Testing quantum fault tolerance on small systems
• Modeling low- and high-frequency noise in transmon qubits with resource-efficient measurement
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
• Towards a realistic GaAs-spin qubit device for a classical error-corrected quantum memory
• SymDPoly: symmetry-adapted moment relaxations for noncommutative polynomial optimization
• Analysing causal structures using Tsallis entropies
• Quantum error detection in qubit-resonator star architecture
• Exploring the Local Landscape in the Triangle Network
• Error detection without post-selection in adaptive quantum circuits