Quantum Advantage in Trading: A Game-Theoretic Approach

• URL: http://arxiv.org/abs/2501.17189v2
• Date: Wed, 12 Feb 2025 01:52:57 GMT
• Title: Quantum Advantage in Trading: A Game-Theoretic Approach
• Authors: Faisal Shah Khan, Norbert M. Linke, Anton Trong Than, Dror Baron,
• Abstract summary: This paper introduces quantum game-theoretic models applied to trading. Results showcase a quantum advantage, previously known only theoretically, realized as higher-paying market Nash equilibria.
• Score: 3.599866690398791
• License:
• Abstract: Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their implementation on an ion-trap quantum computer. The results showcase a quantum advantage, previously known only theoretically, realized as higher-paying market Nash equilibria. This advantage could help uncover alpha in trading strategies, defined as excess returns compared to established benchmarks. These findings suggest that quantum computing could significantly influence the development of financial strategies.

Related papers

• Determining Quantum Correlation through Nash Equilibria in Constant-Sum Games [0.0]
  Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine quantum correlation.
  arXiv  Detail & Related papers  (2024-10-20T14:27:01Z)
• Exploiting Finite Geometries for Better Quantum Advantages in Mermin-Like Games [0.0]
  Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality. In this paper we look at the geometric structure behind such classical strategies, and borrow ideas from the geometry of symplectic polar spaces to maximise this quantum advantage.
  arXiv  Detail & Related papers  (2024-03-14T15:56:43Z)
• Quantum Financial Modeling on Noisy Intermediate-Scale Quantum Hardware: Random Walks using Approximate Quantum Counting [0.054390204258189995]
  We introduce quantum approximate counting circuits that use far fewer 2-qubit entangling gates than traditional quantum counting. We compare the results to price change distributions from stock indices, and compare the behavior of quantum circuits with and without mid-measurement to trends in the housing market.
  arXiv  Detail & Related papers  (2023-10-17T16:54:31Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
  Quantum generative learning models (QGLMs) may surpass their classical counterparts. We review the current progress of QGLMs from the perspective of machine learning. We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
  arXiv  Detail & Related papers  (2022-06-07T07:32:57Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantization of Blackjack: Quantum Basic Strategy and Advantage [0.0]
  We devised a quantum circuit reproducing classical blackjack. We found possible quantum entanglement between strategies. This circuit can be realized in the near future when quantum computers are commonplace.
  arXiv  Detail & Related papers  (2020-11-24T19:50:28Z)
• Theory of Quantum Games and Quantum Economic Behavior [0.0]
  We analyze a quantum economy in which players produce and consume quantum goods. We find distinctive aspects of quantum games that cannot be explained by conventional classical games. Those novel properties imply that quantum games also shed new light on theories of mechanism design, auction and contract in the quantum era.
  arXiv  Detail & Related papers  (2020-10-27T06:45:06Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.