Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices

• URL: http://arxiv.org/abs/2101.10307v1
• Date: Mon, 25 Jan 2021 18:46:19 GMT
• Title: Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
• Authors: Bo Yang, Rudy Raymond, Hiroshi Imai, Hyungseok Chang, and Hidefumi Hiraishi
• Abstract summary: Bell inequalities are useful for testing and verifying the quality of the quantum devices from their nonlocal quantum states and local measurements. We report violations of Bell inequalities on IBM Quantum devices based on the scalable and robust inequalities maximally violated by graph states.
• Score: 6.070269792417041
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Testing and verifying imperfect multi-qubit quantum devices are important as such noisy quantum devices are widely available today. Bell inequalities are known useful for testing and verifying the quality of the quantum devices from their nonlocal quantum states and local measurements. There have been many experiments demonstrating the violations of Bell inequalities but they are limited in the number of qubits and the types of quantum states. We report violations of Bell inequalities on IBM Quantum devices based on the scalable and robust inequalities maximally violated by graph states as proposed by Baccari et al. (Ref.[1]). The violations are obtained from the quantum states of path graphs up to 57 and 21 qubits on the 65-qubit and 27-qubit IBM Quantum devices, respectively, and from those of star graphs up to 8 and 7 qubits with error mitigation on the same devices. We are able to show violations of the inequalities on various graph states by constructing low-depth quantum circuits producing them, and by applying the readout error mitigation technique. We also point out that quantum circuits for star graph states of size N can be realized with circuits of depth $O(\sqrt n)$ on subdivided honeycomb lattices which are the topology of the 65-qubit IBM Quantum device. Our experiments show encouraging results on the ability of existing quantum devices to prepare entangled quantum states, and provide experimental evidences on the benefit of scalable Bell inequalities for testing them.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Characterization of entanglement on superconducting quantum computers of up to 414 qubits [0.0]
  We study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. A GHZ fidelity of $0.519 pm 0.014$ is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME)
  arXiv  Detail & Related papers  (2023-12-23T05:31:16Z)
• Observation of quantum nonlocality in Greenberger-Horne-Zeilinger entanglement on a silicon chip [4.895323415185291]
  Greenberger-Horne-Zeilinger (GHZ) state allows one to observe the striking conflict of quantum physics to local realism. integrated photonic chip capable of generating and manipulating the four-photon GHZ state. Our work paves the way to perform fundamental tests of quantum physics with complex integrated quantum devices.
  arXiv  Detail & Related papers  (2023-11-28T12:43:46Z)
• 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)
• Scalable Bell inequalities for graph states of arbitrary prime local dimension and self-testing [0.0]
  Bell nonlocality -- the existence of quantum correlations that cannot be explained by classical means -- is one of the most striking features of quantum mechanics. This work provides a general construction of Bell inequalities maximally violated by graph states of any prime local dimension. We analytically determine their maximal quantum violation, a number of high relevance for device-independent applications of Bell inequalities.
  arXiv  Detail & Related papers  (2022-12-14T09:46:27Z)
• 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)
• The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
  Entanglement distillation allows to convert noisy quantum states into singlets. We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
  arXiv  Detail & Related papers  (2022-10-25T17:39:29Z)
• 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)
• Characterizing quantum instruments: from non-demolition measurements to quantum error correction [48.43720700248091]
  In quantum information processing quantum operations are often processed alongside measurements which result in classical data. Non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution. Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states.
  arXiv  Detail & Related papers  (2021-10-13T18:00:13Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Demonstrating the power of quantum computers, certification of highly entangled measurements and scalable quantum nonlocality [0.0]
  We demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements.
  arXiv  Detail & Related papers  (2020-09-29T13:59:49Z)

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.