Optimal conversion of Kochen-Specker sets into bipartite perfect quantum strategies

• URL: http://arxiv.org/abs/2410.17470v1
• Date: Tue, 22 Oct 2024 23:00:24 GMT
• Title: Optimal conversion of Kochen-Specker sets into bipartite perfect quantum strategies
• Authors: Stefan Trandafir, Adán Cabello,
• Abstract summary: We show that every BPQS has an associated Kochen-Specker (KS) set. We introduce an algorithm that identifies the BPQS with the minimum number of settings for any given KS set. In each dimension, the algorithm either obtains the best BPQS known or find one with fewer inputs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bipartite perfect quantum strategies (BPQSs) allow two players isolated from each other to win every trial of a nonlocal game. BPQSs have crucial roles in recent developments in quantum information and quantum computation. However, only few BPQSs with a small number of inputs are known and only one of them has been experimentally tested. It has recently been shown that every BPQS has an associated Kochen-Specker (KS) set. Here, we first prove that any BPQS of minimum input cardinality that can be obtained from a generalized KS set can also be obtained from a KS set of pure states. Then, we address the problem of finding BPQSs of small input cardinality starting from KS sets. We introduce an algorithm that identifies the BPQS with the minimum number of settings for any given KS set. We apply it to many well-known KS sets of small input cardinality in dimensions $3$, $4$, $5$, $6$, $7$, and $8$. In each dimension, the algorithm either obtains the best BPQS known or find one with fewer inputs.

Related papers

• Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy [3.34301287453961]
  We show the first quantitative quantum soundness bounds for every bipartite compiled Bell game.<n>More generally, for all bipartite games we show that the compiled score cannot significantly exceed the bounds given by a newly formalized sequential Navascu'es-Pironio-Ac'in hierarchy.
  arXiv  Detail & Related papers  (2025-07-22T20:31:41Z)
• QuCOOP: A Versatile Framework for Solving Composite and Binary-Parametrised Problems on Quantum Annealers [25.711225064444296]
  QuCOOP is an optimisation framework extending the scope of AQC to composite and binary-parametrised, possibly non-quadratic problems. We experiment with quadratic assignment problems, shape matching and point set registration without knowing the correspondences in advance.
  arXiv  Detail & Related papers  (2025-03-25T14:45:19Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Revisiting BQP with Non-Collapsing Measurements [0.0]
  We show that when equipped with the ability to perform non-collapsing measurements, BQP contains both BQP and SZK. By formulating an alternative equivalent model of PDQP, we prove the positive weighted adversary method. We also explore related settings, obtaining tight bounds in BQP with the ability to copy arbitrary states.
  arXiv  Detail & Related papers  (2024-11-06T18:06:10Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
  We propose a decoder for QLDPC codes based on BP guided decimation (BPGD) BPGD significantly reduces the BP failure rate due to non-convergence.
  arXiv  Detail & Related papers  (2023-12-18T05:58:07Z)
• Simplest bipartite perfect quantum strategies [0.0]
  A bipartite perfect quantum strategy (BPQS) allows two players who cannot communicate with each other to always win a nonlocal game. A more than 40-year old open problem is how many inputs (measurement settings) a BPQS requires. A related problem is how many inputs are needed if, in addition to the quantum system has minimum dimension.
  arXiv  Detail & Related papers  (2023-11-29T15:38:38Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• A Generalized Quantum Branching Program [0.5584060970507505]
  We propose a quantum branching program model, referred to as GQBP, with the ability to query different variables in superposition. We show several equivalences, namely, between GQBP and AQBP, GQBP and NQBP, and GQBP and query complexities.
  arXiv  Detail & Related papers  (2023-07-21T07:27:51Z)
• Distribution-Flexible Subset Quantization for Post-Quantizing Super-Resolution Networks [68.83451203841624]
  This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks. DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ) It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
  arXiv  Detail & Related papers  (2023-05-10T04:19:11Z)
• Variational Quantum Eigensolver for Classification in Credit Sales Risk [0.5524804393257919]
  We take into consideration a quantum circuit which is based on the Variational Quantum Eigensolver (VQE) and so-called SWAP-Test. In the utilized data set, two classes may be observed -- cases with low and high credit risk. The solution is compact and requires only logarithmically increasing number of qubits.
  arXiv  Detail & Related papers  (2023-03-05T23:08:39Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Quantum Support Vector Machine without Iteration [17.384061512750158]
  This paper proposes a quantum support vector machine (LS-QSVM) based on the generalized quantum amplitude estimation (AE-QSVM) Experiments demonstrate that AE-QSVM is advantageous in terms of training matrix, the number of iterations, space complexity, and time complexity.
  arXiv  Detail & Related papers  (2022-06-02T07:57:39Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Characterisation of quantum betting tasks in terms of Arimoto mutual information [0.0]
  We introduce the operational tasks of quantum state betting (QSB), noisy quantum state betting (nQSB), and quantum channel betting (QCB) We prove that the advantage that informative measurements provide in QSB (nQSB) is exactly characterised by Arimoto's $alpha$-mutual information. We also introduce new quantum R'enyi divergences for measurements, and derive a new family of resource monotones for the QRT of measurement informativeness.
  arXiv  Detail & Related papers  (2021-06-24T01:16:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.