Quantum Go: Designing a Proof-of-Concept on Quantum Computer

• URL: http://arxiv.org/abs/2206.05250v1
• Date: Fri, 10 Jun 2022 17:48:09 GMT
• Title: Quantum Go: Designing a Proof-of-Concept on Quantum Computer
• Authors: Shibashankar Sahu, Biswaranjan Panda, Arnab Chowhan, Bikash K. Behera and Prasanta K. Panigrahi
• Abstract summary: The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we provide a new version of quantum Go in which the boxes are initially in a superposition of quantum states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in a superposition of quantum states |0> and |1> and the players have two kinds of moves (classical and quantum) to mark each box. The mark on each box depends on the state to which the qubit collapses after the measurement. All other rules remain the same, except for here, we capture only one stone and not chains. Due to the enormous power and exponential speed-up of quantum computers as compared to classical computers, we may think of quantum computing as the future. So, here we provide a tangible introduction to superposition, collapse, and entanglement via our version of quantum Go. Finally, we compare the classical complexity with the quantum complexity involved in playing the Go game.

Related papers

• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• 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)
• The History of Quantum Games [0.0]
  We collect over 260 quantum games ranging from commercial games, applied and serious games, and games that have been developed at quantum themed game jams and educational courses. We provide an overview of the journey of quantum games across three dimensions.
  arXiv  Detail & Related papers  (2023-09-04T11:10:58Z)
• 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)
• Quantum Extensive Form Games [0.0]
  We propose a concept of quantum extensive-form games, which is a quantum extension of classical extensive-form games. A quantum extensive-form game is also a generalization of quantum learning, including Quantum Generative Adrial Networks.
  arXiv  Detail & Related papers  (2022-07-12T09:58:21Z)
• 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)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• On quantum neural networks [91.3755431537592]
  We argue that the concept of a quantum neural network should be defined in terms of its most general function. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics.
  arXiv  Detail & Related papers  (2021-04-12T18:30:30Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Surpassing the Classical Limit in Magic Square Game with Distant Quantum Dots Coupled to Optical Cavities [0.0]
  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.
  arXiv  Detail & Related papers  (2020-11-03T05:45:06Z)
• 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)

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.