Playing quantum nonlocal games with six noisy qubits on the cloud
- URL: http://arxiv.org/abs/2105.05266v3
- Date: Thu, 17 Feb 2022 19:25:46 GMT
- Title: Playing quantum nonlocal games with six noisy qubits on the cloud
- Authors: Meron Sheffer, Daniel Azses, Emanuele G. Dalla Torre
- Abstract summary: Nonlocal games are extensions of Bell inequalities, aimed at demonstrating quantum advantage.
We consider the minimal implementation of the nonlocal game proposed in Science 362, 308.
We test this game by preparing a 6-qubit cluster state using quantum computers on the cloud by IBM, Ionq, and Honeywell.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Nonlocal games are extensions of Bell inequalities, aimed at demonstrating
quantum advantage. These games are well suited for noisy quantum computers
because they only require the preparation of a shallow circuit, followed by the
measurement of non-commuting observable. Here, we consider the minimal
implementation of the nonlocal game proposed in Science 362, 308 (2018). We
test this game by preparing a 6-qubit cluster state using quantum computers on
the cloud by IBM, Ionq, and Honeywell. Our approach includes several levels of
optimization, such as circuit identities and error mitigation and allows us to
cross the classical threshold and demonstrate quantum advantage in one quantum
computer. We conclude by introducing a different inequality that allows us to
observe quantum advantage in less accurate quantum computers, at the expense of
probing a larger number of circuits.
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) - Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case.
We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game.
We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z) - Implementing 2-qubit pseudo-telepathy games on noisy intermediate scale
quantum computers [0.0]
Mermin-Peres like proofs of quantum contextuality can furnish non-local games with a guaranteed quantum strategy.
We show that the quantumness of these games are almost revealed when we play them on the IBM Quantum Experience.
arXiv Detail & Related papers (2023-10-11T12:47:12Z) - Quantum advantage beyond entanglement in Bayesian game theory [0.0]
Quantum discord has been utilised in order to find quantum advantage in an extension of the Clauser, Horne, Shimony, and Holt (CHSH) game.
arXiv Detail & Related papers (2023-06-08T10:49:40Z) - 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) - 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) - Quantum Proof of Work with Parametrized Quantum Circuits [0.0]
There is still a dearth of practical applications for quantum computers with a small number of noisy qubits.
We proposed a scheme for quantum-computer compatible proof of work (cryptographic mechanism used in Bitcoin mining) and verified it on a 4-qubit superconducting quantum node.
arXiv Detail & Related papers (2022-04-22T11:26:16Z) - Playing with a Quantum Computer [0.0]
We show a direct and straightforward way to use quantum computers in an introductory course on quantum physics.
We use an algorithm that solves a simple and easily understandable problem while providing a quantum advantage.
arXiv Detail & Related papers (2021-08-13T14:33:45Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - 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.