Quantum Go Machine

• URL: http://arxiv.org/abs/2007.12186v1
• Date: Thu, 23 Jul 2020 18:00:01 GMT
• Title: Quantum Go Machine
• Authors: Lu-Feng Qiao, Jun Gao, Zhi-Qiang Jiao, Zhe-Yong Zhang, Zhu Cao, Ruo-Jing Ren, Chao-Ni Zhang, Cheng-Qiu Hu, Xiao-Yun Xu, Hao Tang, Zhi-Hao Ma, Xian-Min Jin
• Abstract summary: 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.
• Score: 15.33065067850941
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated photon pairs entangled in polarization degree of freedom. The total dimension of Hilbert space of the generated states grows exponentially as two players take turns to place the stones in time series. As nondeterministic and imperfect information games are more difficult to solve using nowadays technology, we excitedly find that the inherent randomness in quantum physics can bring the game nondeterministic trait, which does not exist in the classical counterpart. Some quantum resources, like coherence or entanglement, can also be encoded to represent the state of quantum stones. Adjusting the quantum resource may vary the average imperfect information (as comparison classical Go is a perfect information game) of a single game. We further verify its non-deterministic feature by showing the unpredictability of the time series data obtained from different classes of quantum state. Finally, by comparing quantum Go with a few typical games that are widely studied in artificial intelligence, we find that quantum Go can cover a wide range of game difficulties rather than a single point. Our results establish a paradigm of inventing new games with quantum-enabled difficulties by harnessing inherent quantum features and resources, and provide a versatile platform for the test of new algorithms to both classical and quantum machine learning.

Related papers

• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• 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)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Machine Learning: from physics to software engineering [58.720142291102135]
  We show how classical machine learning approach can help improve the facilities of quantum computers. We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
  arXiv  Detail & Related papers  (2023-01-04T23:37:45Z)
• 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)
• Quantum Go: Designing a Proof-of-Concept on Quantum Computer [0.0]
  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.
  arXiv  Detail & Related papers  (2022-06-10T17:48:09Z)
• Endless Fun in high dimensions -- A Quantum Card Game [0.0]
  We present a strategic card game in which the building blocks of a quantum computer can be experienced. While playing, participants start with the lowest quantum state, play cards to "program" a quantum computer, and aim to achieve the highest possible quantum state. By also including high-dimensional quantum states, i.e., systems that can take more than two possible values, the game can help the players to understand complex quantum state operations.
  arXiv  Detail & Related papers  (2021-07-26T07:52:13Z)
• 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 information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)

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.