<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    tel
   </journal-id>
   <journal-title-group>
    <journal-title>
     Theoretical Economics Letters
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2162-2078
   </issn>
   <issn publication-format="print">
    2162-2086
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/tel.2025.154049
   </article-id>
   <article-id pub-id-type="publisher-id">
    tel-144562
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Business 
     </subject>
     <subject>
       Economics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Is the Market Truly in a Random Walk? Searching for the Efficient Market Hypothesis with an AI Assistant Economist
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Lizhi
      </surname>
      <given-names>
       Xin
      </given-names>
     </name>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Kevin
      </surname>
      <given-names>
       Xin
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aXINVISIONQ, INC., Chicago, USA
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     02
    </day> 
    <month>
     07
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    15
   </volume> 
   <issue>
    04
   </issue>
   <fpage>
    895
   </fpage>
   <lpage>
    903
   </lpage>
   <history>
    <date date-type="received">
     <day>
      5,
     </day>
     <month>
      February
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      1,
     </day>
     <month>
      February
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      1,
     </day>
     <month>
      August
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    The equity market is known for its uncertainty and randomness. While the market and the participating traders may seem like independent entities in their own right, but it is the foray of traders that makes the market in a random walk, as the market’s volatility influences the traders’ judgement on which action to take; the market and traders are “entangled together” in this way. This paper presents a methodology to model both the market’s volatility and traders’ actions by drawing on the concept of quantum superposition to illustrate that it is indeed the “interactions” of both the market and traders that result in the random walk, fully conforming to the efficient market hypothesis. We’ve also developed an AI assistant economist that’s powered by a quantum-like evolutionary algorithm to produce short-horizon predictions of the future trend of the market based on Darwinian natural selection.
   </abstract>
   <kwd-group> 
    <kwd>
     Random Walk
    </kwd> 
    <kwd>
      Efficient Market Hypothesis
    </kwd> 
    <kwd>
      Genetic Programming
    </kwd> 
    <kwd>
      Machine Learning
    </kwd> 
    <kwd>
      Quantum-Like Evolutionary Algorithm
    </kwd> 
    <kwd>
      AI Assistant Economist
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>The stock market has been known to be a volatile place (<xref ref-type="bibr" rid="scirp.144562-16">
     Shiller, 1991
    </xref>; <xref ref-type="bibr" rid="scirp.144562-13">
     Knight, 1921
    </xref>; <xref ref-type="bibr" rid="scirp.144562-1">
     Baaquie, 2007
    </xref>; <xref ref-type="bibr" rid="scirp.144562-9">
     Fox, 2009
    </xref>). In 1900, Louis Bachelier wrote his Ph.D. thesis, The Theory of Speculation, which formulated the first mathematical theory of the stochastic processes of the market (<xref ref-type="bibr" rid="scirp.144562-2">
     Bachelier et al., 2006
    </xref>). In 1965, Eugene Fama developed the Efficient Market Hypothesis (EMH), which states that financial markets are “informatively efficient” and that no one can accurately predict the market’s future by any means possible (<xref ref-type="bibr" rid="scirp.144562-7">
     Fama, 1970
    </xref>). EMH complements the fact that the market is indeed on a random walk, and that the current price of stocks reflects all the available information. In 1973, Fisher Black and Myron Scholes developed the BSM model that describes the market’s behavior in pure mathematical terms (<xref ref-type="bibr" rid="scirp.144562-3">
     Black &amp; Scholes, 1973
    </xref>), which provides a theoretical framework to derive a price estimate of European call and put options. Their log-normal distribution of the returns is based on Brownian motion (<xref ref-type="bibr" rid="scirp.144562-4">
     Broadbent et al., 1928
    </xref>).</p>
   <p>The mainstream ways of describing the market have been to model the state of the market and the traders’ actions separately, with the market being treated as a physical particle or mathematical entity, and the traders are seen as a completely separate external factor that should be left alone when attempting to describe the market.</p>
   <p>To model the behavior of traders, Amos Tversky and Daniel Kahneman formulated prospect theory (<xref ref-type="bibr" rid="scirp.144562-12">
     Kahneman &amp; Tversky, 1979
    </xref>; <xref ref-type="bibr" rid="scirp.144562-11">
     Kahneman, 2013
    </xref>), which attempts to factor in the “humanity” aspect of trading; arguing that traders value gains and losses differently that’s known as loss aversion theory. They proposed that losses will always carry a greater emotional impact on an individual, thus gains are generally perceived as greater probability wise.</p>
   <p>When studying the market, it is crucial to factor in both the market itself and the participating traders involved and not separately, because it is together, both the market and traders’ overall is what makes up the movement of the market; it is the market’s volatility that hampers the participating traders’ decisive decision-making ability (traders are initially hesitant whether to buy or sell) and in turn it is the “collective effort” of all the traders (some will buy while others will sell) that eventually determine the market’s trend direction (increase or decrease). Thus, the market and traders are intertwined or “entangled” with each other, the market’s volatility affects the traders and the traders’ actions in turn determine the trend of the market and vice versa, in this continuous looping cycle, which fully reflects that the market is truly in a random walk.</p>
   <p>We present a methodology to model both the market’s volatile movement (increase or decrease) and the participating trader’s actions (buy or sell) by utilizing the concept of the quantum principle of superposition and illustrate that it is the two “entangled” that causes the market to be in a random walk which fully conforms to the observed market movement as stated by the efficient market hypothesis (<xref ref-type="bibr" rid="scirp.144562-18">
     Xin &amp; Xin, 2021
    </xref>).</p>
   <p>Again, established agent-based and stochastic models tend to treat the market and traders separately, however, when modeling market behavior, we have to keep in mind that the market’s “behavior” emerges from the interactions between the market and traders together as a collective whole of a complex system, essentially 1 + 1 &gt; 2. Our quantum-like framework is a unified framework that models both the market and participating traders together as a collective whole all under complex Hilbert Space. Our framework establishes that the market’s random walk arises from the complex interactions between the traders and the external environment rather than from the simple random fluctuations that are commonly described by stochastic models.</p>
   <p>Building off our methodology, we’ve developed an AI assistant economist (one that can aid human economists to analyze and forecast the financial market) powered by our quantum-like evolutionary algorithm that can produce a short horizon prediction (one week) of the market’s future movement by studying one month of data from the Dow Jones Index (<xref ref-type="bibr" rid="scirp.144562-19">
     Xin &amp; Xin, 2024
    </xref>).</p>
   <p>The rest of the paper is structured as follows: Section 2 details the methodology. Section 3 is the results. Section 4 is the conclusion.</p>
  </sec><sec id="s2">
   <title>
    <xref ref-type="bibr" rid="scirp.144562-"></xref>2. Methods</title>
   <p>The volatility of the market and the hesitation of the traders’ actions are essentially intertwined; the uncertain nature of the market hampers traders’ decision-making ability of when to buy and sell, and in turn it is the “collective” actions of all the participating traders that determines the markets’ closing price in this ever-changing cycle between the market and traders.</p>
   <p>To effectively model both the volatility of the market and the traders’ actions of buy and sell, the concept of quantum superposition principle (<xref ref-type="bibr" rid="scirp.144562-17">
     Silverman, 2008
    </xref>; <xref ref-type="bibr" rid="scirp.144562-8">
     Feynman, 2015
    </xref>; <xref ref-type="bibr" rid="scirp.144562-6">
     Dirac, 1958
    </xref>) can be utilized; by “superposing” both the market’s states and the traders’ actions. This can be modeled as in (1) and (2).</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mi>
         Q 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (1)</p>
   <p>where 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> denotes the market increases; 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> denotes the market decreases. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             c 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math> is the objective frequency that the market increases; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             c 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math> is the objective frequency that the market decreases.</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mi>
         A 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         μ 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         μ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (2)</p>
   <p>where 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> denotes the trader believes that the market increases; 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
     </mrow> 
    </math> denotes the trader believes that the market decreases. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             μ 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math> is the trader’s degree of belief that the market increases; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             μ 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
       </mrow> 
       <mn>
         2 
       </mn> 
      </msup> 
     </mrow> 
    </math> is the trader’s degree of belief that the market decreases.</p>
   <p>The market and all the participating traders can be described as a complex system, as (3).</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mi>
         ψ 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mo> 
      </mo> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        ⊗ 
      </mo> 
      <mstyle displaystyle="true"> 
       <munderover> 
        <mo>
          ∏ 
        </mo> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          N 
        </mi> 
       </munderover> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             a 
           </mi> 
           <mn>
             1 
           </mn> 
           <mi>
             i 
           </mi> 
          </msubsup> 
         </mrow> 
         <mo>
           〉 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         c 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        ⊗ 
      </mo> 
      <mstyle displaystyle="true"> 
       <munderover> 
        <mo>
          ∏ 
        </mo> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          N 
        </mi> 
       </munderover> 
       <mrow> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             a 
           </mi> 
           <mn>
             2 
           </mn> 
           <mi>
             i 
           </mi> 
          </msubsup> 
         </mrow> 
         <mo>
           〉 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> (3)</p>
   <p>where N is the number of traders in the group. The density operator of the complex system can be described as (4).</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           ρ 
         </mi> 
         <mrow> 
          <mtext>
            market 
          </mtext> 
          <mo>
            + 
          </mo> 
          <mtext>
            traders 
          </mtext> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mi>
           ψ 
         </mi> 
         <mo>
           〉 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           〈 
         </mo> 
         <mi>
           ψ 
         </mi> 
         <mo>
           | 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           ω 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           〉 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           〈 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           ω 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           〉 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           〈 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             q 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           | 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           [ 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             c 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msubsup> 
           <mi>
             c 
           </mi> 
           <mn>
             2 
           </mn> 
           <mo>
             * 
           </mo> 
          </msubsup> 
          <mrow> 
           <mo>
             | 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
           </mrow> 
           <mo>
             〉 
           </mo> 
          </mrow> 
          <mrow> 
           <mo>
             〈 
           </mo> 
           <mrow> 
            <msub> 
             <mi>
               q 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
           </mrow> 
           <mo>
             | 
           </mo> 
          </mrow> 
          <mo>
            ⊗ 
          </mo> 
          <mstyle displaystyle="true"> 
           <munderover> 
            <mo>
              ∏ 
            </mo> 
            <mrow> 
             <mi>
               i 
             </mi> 
             <mo>
               = 
             </mo> 
             <mn>
               1 
             </mn> 
            </mrow> 
            <mi>
              N 
            </mi> 
           </munderover> 
           <mrow> 
            <mrow> 
             <mo>
               〈 
             </mo> 
             <mrow> 
              <msubsup> 
               <mi>
                 a 
               </mi> 
               <mn>
                 1 
               </mn> 
               <mi>
                 i 
               </mi> 
              </msubsup> 
             </mrow> 
             <mo>
               | 
             </mo> 
             <mrow> 
              <msubsup> 
               <mi>
                 a 
               </mi> 
               <mn>
                 2 
               </mn> 
               <mi>
                 i 
               </mi> 
              </msubsup> 
             </mrow> 
             <mo>
               〉 
             </mo> 
            </mrow> 
           </mrow> 
          </mstyle> 
          <mo>
            + 
          </mo> 
          <mtext>
            H 
          </mtext> 
          <mtext>
            .C 
          </mtext> 
          <mo>
            . 
          </mo> 
         </mrow> 
         <mo>
           ] 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math> (4)</p>
   <p>where the third term is a non-diagonalization term that represents the superposition of the market either increasing or decreasing as well as the traders’ being unable to deduce whether the market will increase or decrease. Traders will tend to randomly “guess” that the market is increasing or decreasing; the traders’ believing whether the market is increasing or decreasing is “orthogonal”, and when the number of participating traders is very large then the expectations of all the traders for whether the market will increase or decrease are then zero as (5).</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mstyle displaystyle="true"> 
       <munderover> 
        <mo>
          ∏ 
        </mo> 
        <mrow> 
         <mi>
           i 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          N 
        </mi> 
       </munderover> 
       <mrow> 
        <mrow> 
         <mo>
           〈 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             a 
           </mi> 
           <mn>
             1 
           </mn> 
           <mi>
             i 
           </mi> 
          </msubsup> 
         </mrow> 
         <mo>
           | 
         </mo> 
         <mrow> 
          <msubsup> 
           <mi>
             a 
           </mi> 
           <mn>
             2 
           </mn> 
           <mi>
             i 
           </mi> 
          </msubsup> 
         </mrow> 
         <mo>
           〉 
         </mo> 
        </mrow> 
       </mrow> 
      </mstyle> 
      <mover> 
       <mo>
         → 
       </mo> 
       <mrow> 
        <mi>
          N 
        </mi> 
        <mo>
          → 
        </mo> 
        <mi>
          ∞ 
        </mi> 
       </mrow> 
      </mover> 
      <mn>
        0 
      </mn> 
     </mrow> 
    </math> (5)</p>
   <p>(4) then becomes (6).</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          market 
        </mtext> 
        <mo>
          + 
        </mo> 
        <mtext>
          traders 
        </mtext> 
       </mrow> 
      </msub> 
      <mover> 
       <mo>
         → 
       </mo> 
       <mrow> 
        <mi>
          N 
        </mi> 
        <mo>
          → 
        </mo> 
        <mi>
          ∞ 
        </mi> 
       </mrow> 
      </mover> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (6)</p>
   <p>When there is a vast number of participating traders involved ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        N 
      </mi> 
      <mo>
        → 
      </mo> 
      <mi>
        ∞ 
      </mi> 
     </mrow> 
    </math>), the market and all the participating traders as a whole tends to be in a random walk ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          market 
        </mtext> 
        <mo>
          + 
        </mo> 
        <mtext>
          traders 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        ≈ 
      </mo> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          market 
        </mtext> 
       </mrow> 
      </msub> 
     </mrow> 
    </math>) as outlined by the efficient market hypothesis. 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          market 
        </mtext> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> as (7) is the actual observed density operator of the market; where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> is the observed objective frequency that the market will increase and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> is the observed objective frequency that the market will decrease ( 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        ≈ 
      </mo> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mn>
        0.5 
      </mn> 
     </mrow> 
    </math>).</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          market 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         ω 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           q 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (7)</p>
   <p>We have shown above that it is the market and the participating traders as a collective whole that make the market become a random walk. It is widely acknowledged that nobody can accurately predict the future trend of the market in the long run. Now the question becomes: is it possible to produce a short-horizon forecast of the market’s future trend?</p>
   <p>To answer this question, we’ve developed a quantum-like evolutionary algorithm to power the AI assistant economist that utilizes both the quantum superposition principle and Genetic Programming (GP) (<xref ref-type="bibr" rid="scirp.144562-10">
     Holland, 1975
    </xref>; <xref ref-type="bibr" rid="scirp.144562-14">
     Koza, 1992,
    </xref> <xref ref-type="bibr" rid="scirp.144562-15">
     1994
    </xref>) to produce possible short-horizon predictions of the market’s future trend by machine learning historical trading data.</p>
   <p>For the AI assistant economist (AI agent), we can hypothesize that before the AI agent makes its decision, “believes” whether the market will increase or decrease, are “superposed simultaneously” in its “mind”, which can be described by the density operator as in (8).</p>
   <p>
    <xref ref-type="bibr" rid="scirp.144562-"></xref> 
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mi>
         A 
       </mi> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mi>
         A 
       </mi> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         μ 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <msubsup> 
       <mi>
         μ 
       </mi> 
       <mn>
         2 
       </mn> 
       <mo>
         * 
       </mo> 
      </msubsup> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msubsup> 
       <mi>
         μ 
       </mi> 
       <mn>
         1 
       </mn> 
       <mo>
         * 
       </mo> 
      </msubsup> 
      <msub> 
       <mi>
         μ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (8)</p>
   <p>where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> is the AI agent’s degree of belief that the market increases, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> is the AI agent’s degree of belief that the market decreases. The third and fourth terms in (8) are the “quantum interference” terms that indicate the AI agent’s “mind” is undecided on whether the market will increase or decrease, where the AI agent can “think” that the market is both increasing and decreasing.</p>
   <p>When an AI agent actually “decides” on whether the market increases or decreases, a projection of pure state to mixed state happens in the AI agent’s “mind” as (9), which describes the decision-making process of an AI agent.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
      <mover> 
       <mo>
         → 
       </mo> 
       <mrow> 
        <mtext>
          Decide 
        </mtext> 
       </mrow> 
      </mover> 
      <msub> 
       <msup> 
        <mi>
          ρ 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (9)</p>
   <p>The decision-making process is essentially just a projection from pure state to mixed state, where GP, an algorithm based on Darwinian natural selection (<xref ref-type="bibr" rid="scirp.144562-5">
     Darwin, 1859
    </xref>), is utilized to evolve a satisfactory pure state. The pure state is essentially just a 2 × 2 matrix, where (9) can be described by the matrix form represented in (10).</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               ρ 
             </mi> 
             <mrow> 
              <mn>
                11 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               ρ 
             </mi> 
             <mrow> 
              <mn>
                12 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               ρ 
             </mi> 
             <mrow> 
              <mn>
                21 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               ρ 
             </mi> 
             <mrow> 
              <mn>
                22 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mover> 
       <mo>
         → 
       </mo> 
       <mrow> 
        <mtext>
          projection 
        </mtext> 
       </mrow> 
      </mover> 
      <msub> 
       <msup> 
        <mi>
          ρ 
        </mi> 
        <mo>
          ′ 
        </mo> 
       </msup> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mn>
               1 
             </mn> 
            </msub> 
           </mrow> 
          </mtd> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
          <mtd> 
           <mrow> 
            <msub> 
             <mi>
               p 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         p 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (10a)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mn>
             1 
           </mn> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        , 
      </mo> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mn>
             1 
           </mn> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        ; 
      </mo> 
      <mtext>
          
      </mtext> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mn>
             1 
           </mn> 
          </mtd> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
      <mo>
        , 
      </mo> 
      <mrow> 
       <mo>
         | 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         〉 
       </mo> 
      </mrow> 
      <mrow> 
       <mo>
         〈 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           a 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         | 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mn>
             0 
           </mn> 
          </mtd> 
          <mtd> 
           <mn>
             1 
           </mn> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (10b)</p>
   <p>Because the pure density operator 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> is just an arbitrary 2 × 2 matrix, we can then approximately construct this density operator with the 8 most basic quantum gates as (11), leading it to become a “matrix tree” (<xref ref-type="bibr" rid="scirp.144562-20">
     Xin et al., 2023
    </xref>).</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <mtable> 
         <mtr> 
          <mtd> 
           <mrow> 
            <mi>
              H 
            </mi> 
            <mo>
              = 
            </mo> 
            <mfrac> 
             <mn>
               1 
             </mn> 
             <mrow> 
              <msqrt> 
               <mn>
                 2 
               </mn> 
              </msqrt> 
             </mrow> 
            </mfrac> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mrow> 
                  <mo>
                    − 
                  </mo> 
                  <mn>
                    1 
                  </mn> 
                 </mrow> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              X 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              Y 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mrow> 
                  <mo>
                    − 
                  </mo> 
                  <mtext>
                    i 
                  </mtext> 
                 </mrow> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mtext>
                   i 
                 </mtext> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              Z 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mrow> 
                  <mo>
                    − 
                  </mo> 
                  <mn>
                    1 
                  </mn> 
                 </mrow> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
           </mrow> 
          </mtd> 
         </mtr> 
         <mtr> 
          <mtd> 
           <mrow> 
            <mi>
              S 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mtext>
                   i 
                 </mtext> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              D 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mrow> 
                  <mo>
                    − 
                  </mo> 
                  <mn>
                    1 
                  </mn> 
                 </mrow> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              T 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mrow> 
                  <msup> 
                   <mtext>
                     e 
                   </mtext> 
                   <mrow> 
                    <mrow> 
                     <mrow> 
                      <mtext>
                        i 
                      </mtext> 
                      <mi>
                        π 
                      </mi> 
                     </mrow> 
                     <mo>
                       / 
                     </mo> 
                     <mn>
                       4 
                     </mn> 
                    </mrow> 
                   </mrow> 
                  </msup> 
                 </mrow> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
            <mtext>
                
            </mtext> 
            <mtext>
                
            </mtext> 
            <mi>
              I 
            </mi> 
            <mo>
              = 
            </mo> 
            <mrow> 
             <mo>
               [ 
             </mo> 
             <mrow> 
              <mtable> 
               <mtr> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
               </mtr> 
               <mtr> 
                <mtd> 
                 <mn>
                   0 
                 </mn> 
                </mtd> 
                <mtd> 
                 <mn>
                   1 
                 </mn> 
                </mtd> 
               </mtr> 
              </mtable> 
             </mrow> 
             <mo>
               ] 
             </mo> 
            </mrow> 
           </mrow> 
          </mtd> 
         </mtr> 
        </mtable> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (11)</p>
   <p>This “matrix tree” is the tree that’s constructed from the 8 basic quantum gates in (11) by the 3 operators’ addition (+), multiplication (×), and or (//); the final form that the matrix tree takes is a 2 × 2 matrix, hence the name matrix tree. After constructing an individual “matrix tree”, we can then construct a population of “matrix trees”, and then by using the fitness function as the evaluation criteria, the most satisfactory density matrix 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> from the population is evolved through generations of natural selection. The “matrix tree” is essentially a decision tree that guides the AI agent which strategies to “take” with corresponding actions. At any given time, the expected value under the current environment (the market is increasing or decreasing) and the corresponding actions (the AI agent “thinks” that the market is increasing or decreasing) can be represented as (12).</p>
   <p>
    <xref ref-type="bibr" rid="scirp.144562-"></xref> 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable columnalign="left"> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           ρ 
         </mi> 
         <mrow> 
          <mtext>
            market 
          </mtext> 
         </mrow> 
        </msub> 
        <mo>
          ⊗ 
        </mo> 
        <msub> 
         <mi>
           ρ 
         </mi> 
         <mrow> 
          <mtext>
            agent 
          </mtext> 
         </mrow> 
        </msub> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <msub> 
         <mi>
           ω 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msup> 
         <mrow> 
          <mo>
            | 
          </mo> 
          <mrow> 
           <mrow> 
            <mo>
              〈 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                q 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              〉 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            | 
          </mo> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           ω 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msup> 
         <mrow> 
          <mo>
            | 
          </mo> 
          <mrow> 
           <mrow> 
            <mo>
              〈 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                q 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mn>
                2 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              〉 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            | 
          </mo> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           ω 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <msup> 
         <mrow> 
          <mo>
            | 
          </mo> 
          <mrow> 
           <mrow> 
            <mo>
              〈 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                q 
              </mi> 
              <mn>
                2 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mn>
                1 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              〉 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            | 
          </mo> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mo>
          + 
        </mo> 
        <msub> 
         <mi>
           ω 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msub> 
         <mi>
           p 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <msup> 
         <mrow> 
          <mo>
            | 
          </mo> 
          <mrow> 
           <mrow> 
            <mo>
              〈 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                q 
              </mi> 
              <mn>
                2 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              | 
            </mo> 
           </mrow> 
           <mrow> 
            <mo>
              | 
            </mo> 
            <mrow> 
             <msub> 
              <mi>
                a 
              </mi> 
              <mn>
                2 
              </mn> 
             </msub> 
            </mrow> 
            <mo>
              〉 
            </mo> 
           </mrow> 
          </mrow> 
          <mo>
            | 
          </mo> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math> (12)</p>
   <p>where (12) is the composite system of the market and the AI agent. Essentially, (12) describes the four possible outcomes of every “decision” made by the AI agent; if the market is increasing or decreasing and the AI agent “thinks” or “doesn’t think so” and vice versa; when the AI agent “thinks” correctly in line with the corresponding motion of the market it’s “rewarded”, if not it’s “punished”. The expected value for the AI agent is the possible scenarios of what the outcome could be paired with the state of the market that’s being observed, as in (13). If the training data has N number of values, then the fitness function for the “matrix tree” is defined as (14), and it is the total sum of all the expected values of each “decision made” by the AI agent.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        E 
      </mi> 
      <msub> 
       <mi>
         V 
       </mi> 
       <mi>
         t 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             ω 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mtext>
            market increases and AI agent 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
            thinks 
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
            so with probaility 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             ω 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mtext>
            market increases and AI agent doesn 
           <msup>
             n 
            <mo>
              ′ 
            </mo> 
           </msup> t 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
            think 
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
            so with probability 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             ω 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mtext>
            market decreases and AI agent does 
           <msup>
             n 
            <mo>
              ′ 
            </mo> 
           </msup> t 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
            think 
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
            so with probability 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <msub> 
           <mi>
             ω 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <mtext>
            market decreaes and AI agent 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
            thinks 
          </mtext> 
          <mo>
            " 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
            so with probability 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             p 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mtd> 
        </mtr> 
       </mtable> 
      </mrow> 
     </mrow> 
    </math>(13)</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mrow> 
        <mtext>
          fitness 
        </mtext> 
       </mrow> 
       <mrow> 
        <mtext>
          matrixTree 
        </mtext> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <munderover> 
        <mo>
          ∑ 
        </mo> 
        <mrow> 
         <mi>
           t 
         </mi> 
         <mo>
           = 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mi>
          N 
        </mi> 
       </munderover> 
       <mrow> 
        <mi>
          E 
        </mi> 
        <msub> 
         <mi>
           V 
         </mi> 
         <mi>
           t 
         </mi> 
        </msub> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math> (14)</p>
   <p>If there are M number of individuals in a population of “matrix trees”, the most satisfactory “matrix tree” is the one that possesses the maximum fitness function that can be described as in (15).</p>
   <p>
    <xref ref-type="bibr" rid="scirp.144562-"></xref> 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         ρ 
       </mi> 
       <mrow> 
        <mtext>
          agent 
        </mtext> 
       </mrow> 
       <mrow> 
        <mtext>
          output 
        </mtext> 
       </mrow> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <mi>
        arg 
      </mi> 
      <munder> 
       <mrow> 
        <mi>
          max 
        </mi> 
       </mrow> 
       <mi>
         a 
       </mi> 
      </munder> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mrow> 
        <msub> 
         <mrow> 
          <mtext>
            fitness 
          </mtext> 
         </mrow> 
         <mrow> 
          <mtext>
            matrixTree 
          </mtext> 
         </mrow> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          = 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <mi>
          M 
        </mi> 
       </mrow> 
       <mo>
         } 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (15)</p>
   <p>By learning historical data, the more rewards that are reaped, then the more accurate chance, there is of predicting the next outcome of whether the market will increase or decrease.</p>
  </sec><sec id="s3">
   <title>3. Results</title>
   <p>In this paper, we produced short-horizon forecast outcomes by studying a small sample of data. Data from October 4th, 2024 to November 1st, 2024 of the Dow Jones Industrial Average Index was used as training data; the following week of November 4th, 2024 to November 8th, 2024 was forecasted. The data was trained twice consecutively, with 6 possible forecast outcomes produced each session by 3 AI agents. From the 12 total possible forecast outcomes produced by means of majority rules, a final trend sequence of whether the market will increase or decrease is produced to analyze the future trend of the market. The fitting results of the two training sessions are shown in <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref> and <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>. The trend sequence produced by means of majority rules from the 12 individual possible forecast outcomes is shown in <xref ref-type="table" rid="table1">
     Table 1
    </xref>.</p>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.144562-"></xref>Table 1. Final action sequence produced by logic tree.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="33.33%"><p style="text-align:center">Date</p></td> 
      <td class="custom-bottom-td acenter" width="33.33%"><p style="text-align:center">DJIA Trend</p></td> 
      <td class="custom-bottom-td acenter" width="33.34%"><p style="text-align:center">Trend Sequence</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="33.33%"><p style="text-align:center">11/04/2024</p></td> 
      <td class="custom-top-td acenter" width="33.33%"><p style="text-align:center">Decreased</p></td> 
      <td class="custom-top-td acenter" width="33.34%"><p style="text-align:center">0</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="33.33%"><p style="text-align:center">11/05/2024</p></td> 
      <td class="acenter" width="33.33%"><p style="text-align:center">Increased</p></td> 
      <td class="acenter" width="33.34%"><p style="text-align:center">0</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="33.33%"><p style="text-align:center">11/06/2024</p></td> 
      <td class="acenter" width="33.33%"><p style="text-align:center">Increased</p></td> 
      <td class="acenter" width="33.34%"><p style="text-align:center">0</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="33.33%"><p style="text-align:center">11/07/2024</p></td> 
      <td class="acenter" width="33.33%"><p style="text-align:center">Decreased</p></td> 
      <td class="acenter" width="33.34%"><p style="text-align:center">1</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="33.33%"><p style="text-align:center">11/08/2024</p></td> 
      <td class="acenter" width="33.33%"><p style="text-align:center">Increased</p></td> 
      <td class="acenter" width="33.34%"><p style="text-align:center">0</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. The fitting results of the first training session.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1503216-rId79.jpeg?20250804013655" />
   </fig>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. The fitting results of the second training session.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1503216-rId80.jpeg?20250804013655" />
   </fig>
   <p>Using this action sequence produced, the future trend of the market and the market’s volatility can be analyzed. The actual recorded trend of the Dow Jones for the following week is listed in the DJIA Trend column, while the trend sequence that’s produced is listed in the trend sequence column, where 0 represents the AI agent “believes” that the market will increase and 1 represents the AI agent “believes” that the market will decrease.</p>
   <p>For this action sequence produced, the predicted trend of the market will be {Increase, Increase, Increase, Decrease, Increase}, in which only the first value predicted was wrong, thus resulting in odds of 80% accuracy. The main emphasis of the 80% accuracy in this case only applies to the short forecast horizon, i.e. the next trading week of 5 data points; for a longer period of time, for example if the forecast horizon was extended to 3 months (60 data points), then it would not be possible for our algorithm to obtain odds of 80%. Essentially, for a longer forecast, the odds would still be closer to 50-50.</p>
  </sec><sec id="s4">
   <title>
    <xref ref-type="bibr" rid="scirp.144562-"></xref>4. Conclusion</title>
   <p>
    <xref ref-type="bibr" rid="scirp.144562-"></xref>In this paper, we presented a methodology to describe both the volatility of the market and the participating traders’ actions together in an intertwined model. By utilizing the concept of quantum superposition principle to model both the state of the market and all the participating traders’ possible actions as a whole, we show that the market is indeed in a random walk as stated by the efficient market hypothesis. Unlike traditional methods that don’t factor in the participating traders, which treat the market as a mathematical or physical entity (particle) where calculus is needed to describe it; we are able to subtly model both the market without a statistical approach.</p>
   <p>Since the future is inherently unpredictable, no matter what we do, there is no universal omnipotent method that can find the crystal ball to peer into and see the future, therefore, if a black swan suddenly landed, there is really nothing we can do to foresee it. Thus, in this paper and our methodology’s approach in general, we have deliberately chosen a small sample of historical data of about 20 data points to produce a short horizon forecast of 5 future points, assuming that the market will “keep” its “relative” trend of the recent past in the near future, and even in this case, our method is not 100% fail-proof—odds may not always reach 80%. However, if a black swan really does alight, our AI assistant economist won’t be able to predict this either, in which we will just have to “trust our instincts” to “throw” the dice back and hope for the best outcome.</p>
  </sec><sec id="s5">
   <title>
    <xref ref-type="bibr" rid="scirp.144562-"></xref>Acknowledgements</title>
   <p>Sincere thanks to the managing editor Joy Deng for a rare attitude of high quality. This work received no funding.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.144562-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Baaquie, B. E. (2007). Quantum Finance: Path Integrals and Hamiltonians for Options and Interest Rates. Cambridge University Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bachelier, L., Davis, M. H. A.,&amp;Etheridge, A. (2006). Theory of Speculation: The Origins of Modern Finance. Princeton University Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Black, F.,&amp;Scholes, M. (1973). The Pricing of Options and Corporate Liabilities. Journal of Political Economy, 81, 637-654. &gt;https://doi.org/10.1086/260062
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Broadbent, T. A., Einstein, A. B., Hertz, H., Dryden, H. L., Murnaghan, F. P.,&amp;Bateman, H. (1928). Investigations on the Theory of the Brownian Movement. The Mathematical Gazette, 41, 231.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Darwin, C. (1859). On the Origin of Species by Means of Natural Selection, or, the Preservation of Favoured Races in the Struggle for Life. John Murray. &gt;https://doi.org/10.5962/bhl.title.68064
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dirac, P. A. M. (1958). The Principles of Quantum Mechanics. Oxford University Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fama, E. F. (1970). Efficient Capital Markets: A Review of Theory and Empirical Work. The Journal of Finance, 25, 383-417.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Feynman, R. P. (2015). The Feynman Lectures on Physics. Volume III, Quantum Mechanics. Basic Books.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fox, J. (2009). The Myth of the Rational Market a History of Risk, Reward, and Delusion on Wall Street. HarperCollins.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Holland, J. (1975). Adaptation in Natural and Artificial System. University of Michigan Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kahneman, D. (2013). Thinking, Fast and Slow. Farrar, Straus and Giroux Macmillan.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kahneman, D.,&amp;Tversky, A. (1979). Prospect Theory: An Analysis of Decision under Risk. Econometrica, 47, 263-291. &gt;https://doi.org/10.2307/1914185
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Knight, F. (1921). Risk, Uncertainty, and Profit. Houghton Mifflin Company.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Koza, J. R. (1992). Genetic Programming, on the Programming of Computers by Means of Natural Selection. MIT Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Koza, J. R. (1994). Genetic Programming II, Automatic Discovery of Reusable Programs. MIT Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Shiller, R. J. (1991). Market Volatility. MIT Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Silverman, M. P. (2008). Quantum Superposition: Counterintuitive Consequences of Coherence, Entanglement, and Interference. Springer.
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xin, H. W., Xin, L. Z. (2021). Quantum Finance: Principle, Mechanism and Algorithm of Uncertain Market. University of Science and Technology of China Press. 
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xin, K.,&amp;Xin, L. Z. (2024). QxEAI: Assisting Equity Trading with Quantum-Like Evolutionary Algorithm. &gt;https://doi.org/10.51094/jxiv.1011 
    </mixed-citation>
   </ref>
   <ref id="scirp.144562-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Xin, L., Xin, K.,&amp;Xin, H. (2023). On Laws of Thought—A Quantum-Like Machine Learning Approach. Entropy, 25, Article 1213. &gt;https://doi.org/10.3390/e25081213
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>