Bell inequality violation on small NISQ computers

• URL: http://arxiv.org/abs/2006.13794v2
• Date: Tue, 1 Sep 2020 15:02:53 GMT
• Title: Bell inequality violation on small NISQ computers
• Authors: H.W.L. Naus and H. Polinder (Quantum Technology, Netherlands Organization for Applied Scientific Research (TNO), Delft, The Netherlands)
• Abstract summary: Experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. Results of simulations on the QX simulator of Quantum Inspire are presented.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computational experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. They consist of running specified quantum algorithms on few-qubit computers. If such a device assures entanglement and performs single-shot measurements, the detection loophole is avoided. Four concise quantum circuits determining the expectation values of the relevant observables are used for a two-qubit system. It is possible to add an ancilla qubit to these circuits and eventually only measure the ancilla to obtain the relevant information. For a four-qubit NISQ computer, two algorithms yielding the same averages, however also guaranteeing a random choice of the observable, are developed. A freedom-of-choice loophole is therefore avoided. Including an additional ancilla reduces the number of measurements by one since in this case only the ancillas need to be measured. Note that these methods, using the NISQ device, are intrinsically quantum mechanical. Locality loopholes cannot be excluded on present NISQ systems. Results of simulations on the QX simulator of Quantum Inspire are presented. The Bell inequality is indeed found to be violated, even if some additional noise is included by means of the depolarizing channel error model. The algorithms have been implemented on the IBM Q Experience as well. The results of these quantum computations support a violation of the Bell inequality by various standard deviations.

Related papers

• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Non-adaptive measurement-based quantum computation on IBM Q [0.0]
  We generate generalised n-qubit GHZ states and measure Bell inequalities to investigate n-party entanglement of the GHZ states. The implemented Bell inequalities are derived from non-adaptive measurement-based quantum computation (NMQC) We find a violation for a maximum of seven qubits and compare our results to an existing implementation of NMQC using photons.
  arXiv  Detail & Related papers  (2023-06-06T18:03:06Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Automated error correction in superdense coding, with implementation on superconducting quantum computer [0.28675177318965034]
  We present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. We experimentally realize our automated error correction technique for three different types of superdense coding algorithm on a 7-qubit superconducting IBM quantum computer and also on a 27-qubit quantum simulator in the presence of noise.
  arXiv  Detail & Related papers  (2022-10-27T04:02:13Z)
• 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)
• An Efficient Quantum Readout Error Mitigation for Sparse Measurement Outcomes of Near-term Quantum Devices [7.9958720589619094]
  We propose two efficient quantum readout error mitigation methods for quantum devices with tens of qubits and more. The main targets of the proposed methods are the sparse probability distributions where only a few states are dominant. The proposed methods can be applied to mitigate GHZ states up to 65 qubits on IBM Quantum devices within a few seconds to confirm the existence of a 29-qubit GHZ state with fidelity larger than 0.5.
  arXiv  Detail & Related papers  (2022-01-26T16:42:03Z)
• Model-Independent Error Mitigation in Parametric Quantum Circuits and Depolarizing Projection of Quantum Noise [1.5162649964542718]
  Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the prospect to efficiently perform such computations. Current quantum devices still suffer from inherent quantum noise.
  arXiv  Detail & Related papers  (2021-11-30T16:08:01Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)
• A hybrid quantum-classical approach to mitigating measurement errors [3.8073142980733]
  We present a scheme to deal with unknown quantum noise and show that it can be used to mitigate errors in measurement readout with NISQ devices. The scheme is implemented in quantum algorithms with NISQ devices.
  arXiv  Detail & Related papers  (2020-03-27T10:30:52Z)

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.