Surpassing the Classical Limit in Magic Square Game with Distant Quantum Dots Coupled to Optical Cavities

• URL: http://arxiv.org/abs/2011.01490v1
• Date: Tue, 3 Nov 2020 05:45:06 GMT
• Title: Surpassing the Classical Limit in Magic Square Game with Distant Quantum Dots Coupled to Optical Cavities
• Authors: Sinan Bugu, Fatih Ozaydin, Tetsuo Kodera
• Abstract summary: We propose an experimental setup for quantum computation with quantum dots inside optical cavities. Considering various physical imperfections of our setup, we first show that the MSG can be implemented with the current technology. We show that our work gives rise to a new version of the game. That is, if the referee has information on the physical realization and strategy of the players, he can bias the game through filtered randomness and increase his winning probability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The emergence of quantum technologies is heating up the debate on quantum supremacy, usually focusing on the feasibility of looking good on paper algorithms in realistic settings, due to the vulnerability of quantum systems to myriad sources of noise. In this vein, an interesting example of quantum pseudo-telepathy games that quantum mechanical resources can theoretically outperform classical resources is the Magic Square game (MSG), in which two players play against a referee. Due to noise, however, the unit winning probability of the players can drop well below the classical limit. Here, we propose a timely and unprecedented experimental setup for quantum computation with quantum dots inside optical cavities, along with ancillary photons for realizing interactions between distant dots to implement the MSG. Considering various physical imperfections of our setup, we first show that the MSG can be implemented with the current technology, outperforming the classical resources under realistic conditions. Next, we show that our work gives rise to a new version of the game. That is, if the referee has information on the physical realization and strategy of the players, he can bias the game through filtered randomness and increase his winning probability. We believe our work contributes to not only quantum game theory, but also quantum computing with quantum dots.

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)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Quantum Computing without Quantum Computers: Database Search and Data Processing Using Classical Wave Superposition [101.18253437732933]
  We present experimental data on magnetic database search using spin wave superposition. We argue that in some cases the classical wave-based approach may provide the same speedup in database search as quantum computers.
  arXiv  Detail & Related papers  (2020-12-15T16:21:53Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Quantum Go Machine [15.33065067850941]
  We experimentally demonstrate a quantum version of Go using correlated photon pairs entangled in polarization degree of freedom. Some quantum resources, like coherence or entanglement, can also be encoded to represent the state of quantum stones. Our results establish a paradigm of inventing new games with quantum-enabled difficulties.
  arXiv  Detail & Related papers  (2020-07-23T18:00:01Z)
• Quantum Delocalised-Interactions [3.6536977425574664]
  Entanglement breaks classical logic by enabling interactions without a specific location. We introduce quantum games to capture the effect and demonstrate a direct operational use for quantum concurrence. We find a connection with quantum teleportation, and demonstrate the games using an IBM quantum processor.
  arXiv  Detail & Related papers  (2020-04-30T09:40:20Z)

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.