1 Introduction

1.1 General remark

Recent progress in quantum technologies has been stood us in good stead to acquire abilities to control quantum systems for various usages. It runs the gamut from quantum computing [1, 2] to communication with quantum network [3,4,5,6,7]. Those quantum technologies are bound to have a significant impact on economy in the literature. In particular the appearance of programmable quantum computers [8, 9] heralds potential growth in demand for goods or services available via the quantum internet [10], by interconnecting quantum computers with the quantum teleportation between nodes [11,12,13,14]. In addition, various quantum communication channels for realizing genuine quantum-mechanical communication are being explored and implemented [15,16,17,18]. With quantum communication devices and networks, economic activities will be buoyed in conformity with the laws of quantum physics. Consequently, they promise the rise of quantum economics, which is a branch of economics in the era of noisy intermediate-scale quantum (NISQ) technologies [19] and full-fledged quantum technologies in future [20, 21].

Quantum game theory is a theoretical study on efficient and rational ways of programming quantum devices. It will accrue to multifarious activities of human beings. In this article we aim at providing a theoretical study on the quantum economical behavior in a newly emerging quantum information and communication technology (QICT) market. To our best knowledge this is the first paper that expounds on economic activities from a viewpoint of quantum games. Indeed, mathematical or physical aspects of quantum games, such as the role of entanglement or quantum strategies for mathematical toy models, have been investigated in many works [22,23,24]. However, less is known from an economic perspective that leads to a meaningful analysis of a quantum market doctrine and of economical behavior in the market. Therefore, a critical milestone in quantum games that shows a significant difference from the traditional games has not been reached. This unfortunate lack of impact on economics casts doubt on the power of quantum computational protocols for games. The major criticisms toward the present situation of quantum games are summarized in [25, 26]. In this article we tackle this challenge and succeed in showing novel key differentiating features of a quantum game model. The classical game theory today [27] plays a crucial role in modern economics [28] and based on its history we can foresee prosperous days of quantum games as the foundation of quantum economics.

1.2 Quantum information as economic commodity

We study economies where quantum commodities that serve as media of exchange are determined endogenously. In the modern economy, almost all products are exchanged for money, which is defined as an object with functions of a medium of exchange, a unit of account and a store of value. In the long period of history of money, it was only as late as the second half of the twentieth century that the modern fiat money system set by command of the central bank was established. Precious metals had been widely used as a commodity money till the US government abandoned the convertibility of the dollar into gold. A physical form of money also keeps changing. The recent advances in technologies popularize the use of digital money as an official alternative of legal tender. More recently cryptoassets and cryptocurrencies [29] exude presence in various and sundry fields [30,31,32]. Therefore, it is meaningful to investigate the possibility of a system and a form of money in the era of quantum technologies. The concepts of quantum money are proposed multifariously [33,34,35,36]; however, whether quantum objects can be media of exchange is yet another question. Quantum money is a naive quantum extension of classical money, but there are no formal modelings that show the medium of exchange function as an equilibrium of a quantum game. To proceed our discussion, it is important to recall that people in the modern society indeed exchange, create and consume classical information in many situations of online activities in which they do not directly process macroscopic goods and all of those transactions are based on some bit strings of classical information. Therefore classical information is an economical commodity. In addition, people do not directly consume an electron when they enjoy online shopping, although their information should come from some electrical devices. The same things will be realized by means of quantum devices.

In this work we show how quantum information can become an economical commodity. In other words, if there is a certain number of people who want to exchange quantum information through a quantum network, and if there is a certain amount of supply and demand, quantum information itself will have value as an economic commodity. However, some people may feel uncomfortable with the idea of value being created from invisible quantum states. Our answer to this question is clear. First, even classical information is now stored and exchanged electronically and invisibly. The digitized information has the same amount of information as the original and is actually used in a variety of situations. In terms of cost, it is more convenient to hold information in electronic form. And for those who are accustomed to holding information as digital information, there should not be much resistance to holding information in quantized form. This is because information composed of bits can be embedded directly into qubits. As long as quantum information can be stored in quantum memory and quantum devices can be networked together, we can communicate in a quantum society in the same way that people have done in digital societies. In that case, what is the advantage of holding the system in a quantum state is the most important question. It is known that the use of quantum information increases the confidentiality of the information holder, and that the use of quantum networks significantly increases security. In other words, by quantizing information, it is possible to send and receive extremely important information safely and securely. The important point here is that such important information generally has a high monetary value. For example, a list of buyers of a certain product or personal information is generally bought and sold in a market, even if the possession of the information itself does not immediately lead to money. Therefore, even if the information held as quantum information does not immediately lead to money, it can have sufficient monetary value if it is in demand among certain people and can be traded. This is what is meant by quantum information being an economic commodity. Therefore, even if the information held as quantum information does not immediately lead to money, it can have sufficient monetary value if it is in demand among certain people and can be traded. This is what is meant by quantum information being an economic commodity. And as some of these economic commodities are distributed in the market, some of them will function as commodity money. The main interest of this paper is to analyze clearly and rigorously from a game theoretic point of view what kind of quantum states can become commodity quantum money.

1.3 Summary of our contribution

The main purpose of this article is to analyze a simple quantum model, where quantum objects which become media of exchange are pursed as a theory of non-cooperative repeated quantum game [37, 38]. The medium of exchange function is a crucial property of money. The historical evolution of money has long been studied by many authors. Karl Marx [39] listed the functions of money for hoarding and Adam Smith [40] described that the idea to overcome the double coincidence of wants [41] leads to the use of money as a medium of exchange. The formal modeling of equilibria with classical commodity money and classical fiat money is known as the Kiyotaki–Wright model [42], which explores the economic foundation of the emergence of money as a perishable medium of exchange. The model is tested numerically [43,44,45,46] and a mixed strategy case is also proposed [47]. Kiyotaki and Wright initially addressed infinitely durable goods and later their model was extended to goods with a different durability [48, 49]. In this article we purse the conditions and welfare properties of quantum objects in order to clarify how trade using quantum media of exchange can emerge in equilibrium. The main achievement in Sect. 2.4 is Theorem 2.2, which clarifies a mechanism of the emergence of money as a medium of exchange. We instantiate some strategies and equilibria in Sect. 2.3. In Sect. 2.5 we investigate more details of entangled quantum strategies. A type of quantum goods which can be a medium depends on strategies. Some concrete examples are summarized in Fig. 12. It is notable that quantum entanglement among strategies allow Bob to obtain his consuming good from Alice regardless of her inclination. This is a distinctive aspect of our quantum economy and not found in classical economy. In other words, those characteristic properties of quantum games incentivize us to investigate theories of mechanism design, auction and contract from a perspective of quantum information theory. We assume all quantum goods are infinitely durable by means of various quantum information processing technologies, such as quantum error correction [50,51,52,53], fault-tolerant quantum computation [54,55,56] and robust quantum memories [57, 58]. As a generic quantum state has finite lifetime, it will be also interesting to consider quantum goods with a different durability.

2 Quantum money as a medium of quantum exchange

2.1 Quantum commodity money

A quantum object is called a quantum commodity money if it is accepted in trade not to be consumed or used in production, but to be used to facilitate further trade. If a quantum object with no intrinsic value becomes a medium of exchange, it is called quantum fiat money. In this article we discuss how a quantum commodity can be a medium of exchange.

As a simple model, we consider a quantum information system in which there are three commodities called goods 1,2 and 3. Quantum agents in the community are classified into one of three types: type i quantum agent can produce a good \(j(\ne i)\) and receive positive utility only from consumption of a good i. In model A, type \(i = 1, 2, 3\) agents produce goods \(j = 2, 3, 1\), respectively, while in model B type \(i = 1, 2, 3\) produce a good \(j =3, 1, 2\), respectively. At every round, agents who are allowed to store one unit of any good need to decide whether they carry over their goods to the next round or exchange. In each period, agents are matched randomly (with the probability 1/3) in pairs and must decide whether or not to trade bilaterally. When type i gets a good i, he or she immediately consumes it, produces a new unit of a good and stores it until the next date. Storing a good is costly, and an agent incurs storage costs \(c_{j}\) for holding a good j at the end of every round. When an agent of type i successfully trades for a good i, then he immediately consumes that good and produces a new unit of his production good j without cost. All agents receive the same profit \(u(>c_k~\forall k)\) from consuming goods. Therefore, the total classical profit \(\pi _i\) of an agent of type i is given by

$$\begin{aligned} \pi _i(t)=\sum _{\tau =0}^t (f_i(\tau )u-p_{ij}(\tau )c_{ij}) \delta ^{\tau }, \end{aligned}$$
(1)

where \(\delta \in (0,1)\) is a discount factor, \(p_{ij}(t)\) is i’s probability to have a good \(\left| j\right\rangle \), \(f_i(t)\) is i’s probability to get and consume i at date t and \(c_{ij}\) is the cost to type i of storing a good j. Note that \(f_{i}(t)\) depends on strategies and \(p_{ij}(t-1)\).

Agents try to maximize their total profit. In both models, there are two equilibria: fundamental equilibrium and speculative equilibrium. One equilibrium is referred to as a fundamental equilibrium, which is dominant in model A, since agents always prefer a lower-storage-cost commodity to a higher-storage-cost commodity unless the latter is their own consumption good. On the other hand, in speculative equilibrium, which is dominant in model B, agents trade a lower for a higher-storage-cost commodity not because they wish to consume it, but because they rationally expect that this is the best way to ultimately trade for another good that they do want to consume, that is, because it is more marketable.

In this article, we address the type A model and assume there are only three persons Alice, Bob and Charlie who represent type 1,2 and 3 agents, respectively. So, Alice creates a type 2 quantum good \(\left| 2\right\rangle \) and consumes a type 1 quantum good \(\left| 1\right\rangle \). Bob creates a type 3 quantum good \(\left| 3\right\rangle \) and consumes a type 2 quantum good \(\left| 2\right\rangle \). Charlie creates a type 1 quantum good \(\left| 1\right\rangle \) and consumes a type 3 quantum good \(\left| 3\right\rangle \). For example, Alice gives Bob a type 2 or 3 quantum good to get a type 1 quantum good (Fig. 1).

Fig. 1
figure 1

The diagram of trades

2.2 Quantum circuit for consensus building

As the most fundamental case of consensus building, we first describe a trade between two persons. To clarify our idea, we exhibit a quantum circuit (Fig. 3) in which Alice and Bob exchange her \(\left| 0\right\rangle \) and his \(\left| 1\right\rangle \). They operate their unitary matrices to their ancilla \(\left| 0\right\rangle _A\) and \(\left| 0\right\rangle _B\) in such a way that

$$\begin{aligned} \begin{aligned} U_A\left| 0\right\rangle _A&=a_0\left| 0\right\rangle _A+a_1\left| 1\right\rangle _A=:\left| \tau _A (0, 1)\right\rangle \\ U_B\left| 0\right\rangle _B&=b_0\left| 0\right\rangle _B+b_1\left| 1\right\rangle _B=:\left| \tau _B (1, 0)\right\rangle , \end{aligned} \end{aligned}$$
(2)

where we interpret \(|a_1|^2~(|b_1|^2)\) as Alice’s (Bob’s) probability of willing to trade. Their deal can be made if and only if \(\left| 1\right\rangle _A\left| 1\right\rangle _B\) is observed in the ancilla state.

To draw a complete quantum circuit explicitly, we define the gate shown in Fig. 2 that performs U operation on the target qubit when the control qubit is \(\left| i\right\rangle \), otherwise the target qubit remains unchanged. Using this gate, we present a quantum circuit Fig. 3 by which Alice and Bob exchange her \(\left| 0\right\rangle \) and his \(\left| 1\right\rangle \).

Fig. 2
figure 2

Quantum gate for an exchange operation

Fig. 3
figure 3

Quantum circuit in which Alice and Bob exchange her \(\left| 0\right\rangle \) and his \(\left| 1\right\rangle \), when they have. \(\mathcal {K}\) creates entanglement between states \(\left| \psi _A\right\rangle \) and \(\left| \psi _B\right\rangle \), and \(\mathcal {J}\) yields entanglement between quantum strategies \(U_A\) and \(U_B\). \(\mathcal {J}^\dagger \) is operated so the game recovers classical results when \(U_A\) and \(U_B\) are classical strategies. The swap operator acts on the first two qubits if two agents agree to trade

We first consider the case where quantum strategies are not entangled (\(\mathcal {J}=\mathcal {J}^\dagger =I\)). Generic states which Alice and Bob have can be written as \(\left| \psi _A\right\rangle =A_0\left| 0\right\rangle +A_1\left| 1\right\rangle ,\left| \psi _B\right\rangle =B_0\left| 0\right\rangle +B_1\left| 1\right\rangle \). If a game starts with a general entangled state \(\left| \psi \right\rangle =\mathcal {K}\left| \psi _A\psi _B\right\rangle \in \mathcal {H}_A\otimes \mathcal {H}_B\) between Alice and Bob

$$\begin{aligned} \left| \psi \right\rangle =\sum _{i,j\in \{0,1\}}K_{ij}\left| ij\right\rangle , \end{aligned}$$
(3)

the initial state \(\left| \psi \right\rangle \left| 0\right\rangle _A\left| 0\right\rangle _B\) eventually becomes

$$\begin{aligned} K_{01}a_1b_1\left| 10\right\rangle \left| 1\right\rangle _A\left| 1\right\rangle _B+\cdots , \end{aligned}$$
(4)

where terms which do not contribute to trade are omitted. So the success probability of the trade is \(|K_{01}a_1b_1|^2\).

Now we consider a trade among the three persons. In a classical system, they have an indivisible quantum commodity called goods 1,2 or 3. Two of the three meet and decide whether to exchange their commodities. If both two persons want to trade, they exchange their commodities. We write each \(\left| i\right\rangle \) in the binary form

$$\begin{aligned} \left| 1\right\rangle =\left| 01\right\rangle , \left| 2\right\rangle =\left| 10\right\rangle , \left| 3\right\rangle =\left| 11\right\rangle . \end{aligned}$$
(5)

Suppose each of the three, Alice, Bob and Charlie has a quantum commodity \(\left| \psi _i\right\rangle =i_1\left| 1\right\rangle +i_2\left| 2\right\rangle +i_3\left| 3\right\rangle (i=A,B,C)\). Two of them meet and trade pure good states, as in the classical system. We assume a person meets another with the equal probability 1/3 and introduce \(\left| W\right\rangle =\frac{1}{\sqrt{3}}(\left| 110\right\rangle +\left| 101\right\rangle +\left| 011\right\rangle )\) to describe a person who someone meets. Here \(\left| 110\right\rangle \) means that Alice meets Bob, \(\left| 101\right\rangle \) says that Alice meets Charlie, and \(\left| 011\right\rangle \) indicates that Bob meets Charlie. We illustrate the quantum circuit for a three-person trade in Fig. 4. The introduction of \(\left| W\right\rangle \) is one of the most significant differences from the two-person trade diagram (Fig. 3). For example, Alice’s strategy is a sum of tensor products \(U_A=\left| 1\right\rangle \left\langle 1\right| \otimes I^{\otimes 4}+\left| 2\right\rangle \left\langle 2\right| \otimes U^2_A\otimes I^{\otimes 2}+ \left| 3\right\rangle \left\langle 3\right| \otimes I^{\otimes 2} \otimes U^3_A\), where \(U^i_A\) is her strategy for trading a good i when she has \(\left| i\right\rangle \).

Fig. 4
figure 4

Quantum circuit for exchanging quantum states among three persons. Alice, Bob and Charlie exchange \(\left| 1\right\rangle ,\left| 2\right\rangle \) and \(\left| 3\right\rangle \), when they have. \(\mathcal {K}\) creates entanglement among states \(\left| \psi _A\right\rangle \), \(\left| \psi _B\right\rangle \) and \(\left| \psi _C\right\rangle \). \(\mathcal {J}\) yields entanglement among quantum strategies \(U_A\), \(U_B\) and \(U_C\). \(P_{ij}\) is a gate for consuming \(\left| i\right\rangle \) and producing \(\left| j\right\rangle \)

2.3 Entangled quantum goods, strategies and quantum money as a medium of exchange

We first address the case where quantum goods are entangled (\(\mathcal {K}\ne I^{\otimes 3}\)) and strategies are not entangled (\(\mathcal {J}=I^{\otimes 12}\)). Figure 5 presents the diagram of exchange.

Fig. 5
figure 5

A sequence of numbers in a circle means a state: 231 means Alice, Bob and Charlie have \(\left| 2\right\rangle \),\(\left| 3\right\rangle \) and \(\left| 1\right\rangle \). A 3-tuple of numbers outside a circle indicates that of the number of persons who have the consuming quantum commodities. When 211 is shown in a circle, (2,1,0) expresses that two persons have Alice’s consuming commodity \(\left| 1\right\rangle \), only Alice has Bob’s consuming good 2, and no one has the state Charlie desires. \(231\xrightarrow {C} 211\) means that it is Charlie who gains a reward by an exchange. From the state \(\left| 231\right\rangle \) to \(\left| 211\right\rangle \), Charlie receives \(\left| 3\right\rangle \) from Bob, consumes it and produces \(\left| 1\right\rangle \)

It is convenient to consider a density matrix \(\rho \) that describes entangled goods, instead of \(\left| \psi _A\psi _B\psi _C\right\rangle \). With respect to a given initial state \(\left| \psi _A\psi _B\psi _C\right\rangle \), we define \(\rho \) by

$$\begin{aligned} \rho&=\mathcal {K}\left| \psi _A\psi _B\psi _C\right\rangle \left\langle \psi _A\psi _B\psi _C\right| \mathcal {K}^\dagger \in End(\mathcal {H}_\text {Commodity}) \end{aligned}$$
(6)
$$\begin{aligned}&=\sum _{abc,ijk}C_{abc,ijk}\left| abc\right\rangle \left\langle ijk\right| , \end{aligned}$$
(7)

where \(C_{abc,ijk}\) is a coefficient. In order to discuss an equilibrium of their business, we define an operator acting on the space of quantum commodities \(T:\text {End}(\mathcal {H}_\text {Commodity})\rightarrow \text {End}(\mathcal {H}_\text {Commodity})\)

$$\begin{aligned} T(\rho )&=\text {Tr}_{Ancilla} E\left( \rho \otimes \left| \text {Ancilla}\right\rangle \left\langle \text {Ancilla}\right| \right) E^\dagger \end{aligned}$$
(8)
$$\begin{aligned} \left| \text {Ancilla}\right\rangle&=\left| W\right\rangle \left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C\left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C \end{aligned}$$
(9)

where \(E:\mathcal {H}_\text {Commodity}\otimes \mathcal {H}_\text {Ancilla} \rightarrow \mathcal {H}_\text {Commodity}\otimes \mathcal {H}_\text {Ancilla} \) represents all single-round quantum gate operations in Fig. 4. We trace out ancilla qubits after all operations are made in a single round, in order to see a transition of quantum commodities.

We can make a mixed commodity state from a pure commodity state by the quantum circuit shown in Fig. 4. Using T in (8), then we find

$$\begin{aligned} \begin{aligned} \text {Tr} T(\rho )=&\text {Tr}_{Commodity} \left( \text {Tr}_{Ancila} E\left( \rho \otimes \left| \text {Ancilla}\right\rangle \left\langle \text {Ancilla}\right| \right) E^\dagger \right) \\ =&\text {Tr} E\left( \rho \otimes \left| \text {Ancilla}\right\rangle \left\langle \text {Ancilla}\right| \right) E^\dagger =1. \end{aligned} \end{aligned}$$
(10)

Here it is important to note that \(T(\rho )\) is not always a density matrix of a pure state. Since we cannot multiply \(E=E_1\otimes E_2\) using an unitary operator \(E_1\) on \(\mathcal {H}_\text {Commodity}\) and \(E_2\) on \(\mathcal {H}_\text {Ancila}\), we obtain

$$\begin{aligned} \begin{aligned} \text {Tr} T(\rho )^2=&\text {Tr}_{Commodity} \left( \text {Tr}_{Ancila} E\left( \rho \otimes \left| \text {Ancilla}\right\rangle \left\langle \text {Ancilla}\right| \right) E^\dagger \right) ^2 \\ \ne&\text {Tr}_{Commodity} \text {Tr}_{Ancila} \left( E\left( \rho \otimes \left| \text {Ancilla}\right\rangle \left\langle \text {Ancilla}\right| \right) E^\dagger \right) ^2=1. \end{aligned} \end{aligned}$$
(11)

Therefore, in general, \(T(\rho )\) is a mixed state because \(\text {Tr} T(\rho )^2<1\).

Definition 2.1

We call \(\rho \) a steady state if it obeys

$$\begin{aligned} T\rho =\rho . \end{aligned}$$
(12)

If a steady state \(\rho \) is used for an initial state, the total profit \(\pi _i\) (1) converges into

$$\begin{aligned} \lim _{t\rightarrow \infty }\pi _i(t)=\frac{V_i(\rho )}{1-\delta }, \end{aligned}$$
(13)

where \(V_i\) is a certain function of \(\rho \). To give a concrete detail, we first derive Alice’s \(V_A\). Let \(\rho \) be a quantum state computed on the basis \(\{\left| 211\right\rangle , \left| 212\right\rangle , \left| 231\right\rangle , \left| 232\right\rangle , \left| 311\right\rangle ,\left| 312\right\rangle , \left| 331\right\rangle ,\left| 332\right\rangle \}\)Footnote 1. Let \(v_i\) be the storage cost that i should pay and \(w_i\) be the possibility that i receive i. Each \(v_i\) can be expressed as

$$\begin{aligned} v_A&=(c_2,c_2,c_2,c_2,c_3,c_3,c_3,c_3) \nonumber \\ v_B&=(c_1,c_1,c_3,c_3,c_1,c_1,c_3,c_3)\nonumber \\ v_C&=(c_1,c_2,c_1,c_2,c_1,c_2,c_1,c_2) \end{aligned}$$
(14)

and \(w_i\) depends on \(\mathcal {J}\) and \(U_i^j\). Using \(v_i\) and \(w_i\), we find \(f_i(t)\)(1) becomes

$$\begin{aligned} \begin{aligned} f_i(t)&=w_i \cdot T^{t-1} (\rho ) \\ \sum _j c_{ij}p_{ij}(t)&=v_i\cdot T^t (\rho ), \end{aligned} \end{aligned}$$
(15)

where we denote by \(\cdot \) the inner product of vectors. We may simply put \(T^{-1}(\rho )=0,T^0(\rho )=\rho \). Then the total profit of a player i is

$$\begin{aligned} \begin{aligned} \lim _{t\rightarrow \infty }\pi _i(t)&=\sum _{\tau =0}^\infty \left( uw_i \cdot T^{\tau -1} (\rho ) -v_\cdot T^\tau (\rho ) \right) \delta ^{\tau } \\&=\sum _{\tau =0}^\infty (-v_i + \delta u w_i)\cdot T^\tau (\rho )\delta ^\tau . \end{aligned} \end{aligned}$$
(16)

If \(\rho \) is a steady state \(T\rho =\rho \), we find \(V_i=(-v_i+\delta u w_i)\cdot \rho \) from the equation

$$\begin{aligned} \begin{aligned} \lim _{t\rightarrow \infty }\pi _i(t)&=\sum _{\tau =0}^\infty (-v_i + \delta u w_i)\cdot \rho \delta ^\tau \\&=\frac{(-v_i+\delta u w_i)\cdot \rho }{1-\delta } \end{aligned} \end{aligned}$$
(17)

Note that \(V_i\) does not explicitly depend on \(v_j\) and \(w_j\) \((j\ne i)\), but it is related with them via \(\rho \).

Before we describe a generic equilibrium and the flow of entangled quantum goods, let us start with an example which includes a review on the original Kiyotaki–Wright model [42, 47]. More general case is given in Sect.2.4, where Theorem 2.2 summarizes our main result here. In what follows we assume Alice,Bob and Charlie prefer the following strategies (18)

$$\begin{aligned} \begin{aligned} U_A^2&=Y\otimes \left( \sqrt{s_A}I+i\sqrt{1-s_A}Y\right)&U_A^3&=Y\otimes \left( \sqrt{1-s_A}I+i\sqrt{s_A}Y\right) \\ U_B^1&=Y\otimes \left( \sqrt{s_B}I+i\sqrt{1-s_B}Y\right)&U_B^3&=\left( \sqrt{1-s_B}I+i\sqrt{s_B} Y\right) \otimes Y\\ U_C^1&=\left( \sqrt{s_C}I+i\sqrt{1-s_C}Y\right) \otimes Y&U_C^2&=\left( \sqrt{1-s_C}I+i\sqrt{s_C}Y\right) \otimes Y \end{aligned} \end{aligned}$$
(18)

Indeed the classical results [42, 47] are reproduced when parameters \(s_i~(i=A,B,C)\) are chosen appropriately. As the quantum game must reproduce the classical results, we generally require

$$\begin{aligned}{}[\mathcal {J}, U^i_j]=0 \end{aligned}$$
(19)

when the strategies are restricted to classical strategies. For this purpose, we use \(\mathcal {J}=\exp \left[ i\theta Y^{\otimes 12}\right] \) throughout this article. It will be yet another interesting question to study our model when a different \(\mathcal {J}\) is used. The strategy is called fundamental when \(s_i\) is limited to 1 and speculative when \(s_i=0\) [47]. Then we identify the concrete form of \(w_i\) as follows

$$\begin{aligned} \begin{aligned} w_A&=\frac{1}{3}(2-s_C,1,1-s_C,0,2-s_B,1-s_B,1,0) \\ w_B&=\frac{1}{3}(1,1+s_C,1-s_A,2-s_A,0,s_C,0,1) \\ w_C&=\frac{1}{3}(0,0,s_B,1,1,s_A,1+s_B,1+s_A). \end{aligned} \end{aligned}$$
(20)

For example, the first component of \(w_A\) can be derived from \(\left| 211\right\rangle \) as follows. Alice and Bob exchange \(\left| 2\right\rangle \leftrightarrow \left| 1\right\rangle \) with the probability 1 when they meet and, Alice and Charlie exchange \(\left| 2\right\rangle \leftrightarrow \left| 1\right\rangle \) with the probability \(1-s_C\) when they meet. Therefore, Alice obtains \(\left| 1\right\rangle \) with the probability \(\frac{2-s_C}{3}\) on \(\left| 211\right\rangle \).

One can find that there is a unique steady state for each of \(s_A=s_B=s_C=1\) (the fundamental strategy) and \(s_A=0, s_B=s_C=1\) (the speculative strategy). Those results are perfectly consistent with the Kiyotaki–Wright case [42]. The steady state at \(s_A=s_B=s_C=1\) is

$$\begin{aligned} \rho = \frac{1}{2} \left| 211\right\rangle \left\langle 211\right| +\frac{1}{2} \left| 231\right\rangle \left\langle 231\right| , \end{aligned}$$
(21)

and the steady stateFootnote 2 at \(s_A=0, s_B=s_C=1\) is

$$\begin{aligned} \rho =\frac{3}{7} \left| 211\right\rangle \left\langle 211\right| +\frac{2}{7} \left| 231\right\rangle \left\langle 231\right| +\frac{1}{7} \left| 311\right\rangle \left\langle 311\right| +\frac{1}{7}\left| 331\right\rangle \left\langle 331\right| . \end{aligned}$$
(22)

Moreover, there is additional equilibrium at \(s_A=s_B=1,s_C=0\), in which \(\left| 1\right\rangle \) and \(\left| 2\right\rangle \) can be media of exchange. The corresponding steady state is

$$\begin{aligned} \rho =\frac{1}{7}\left| 211\right\rangle \left\langle 211\right| +\frac{1}{7}\left| 212\right\rangle \left\langle 212\right| +\frac{2}{7}\left| 231\right\rangle \left\langle 231\right| +\frac{3}{7}\left| 232\right\rangle \left\langle 232\right| . \end{aligned}$$
(23)

Those three equilibira are probabilistic mixture of pure states, which are mixed state without entanglement [61]. The flow of goods is exhibited in Fig. 6.

Fig. 6
figure 6

The flow of goods. a \(\left| 1\right\rangle \) is a medium of exchange in the fundamental equilibrium. b \(\left| 1\right\rangle \) and \(\left| 3\right\rangle \) are media of exchange in the speculative equilibrium. c \(\left| 1\right\rangle \) and \(\left| 2\right\rangle \) are media of exchange in the equilibrium of (23)

It is instructive to observe a transition process of an entangled density matrix \(\rho \) by T. As an example we address \(\rho =\left| 311\right\rangle \left\langle 211\right| \) to help readers follow the computation (35). By exchange, consumption and production, the state \(\left| 211\right\rangle \) becomes

$$\begin{aligned} \begin{aligned}&\left| 211\right\rangle \left| W\right\rangle \left| 0000\right\rangle _A\otimes \left| 0000\right\rangle _B\otimes \left| 0000\right\rangle _C \otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\ \rightarrow&-\left| 231\right\rangle \frac{1}{\sqrt{3}}\left| 110\right\rangle \left| 1\right\rangle _A(\sqrt{s_A}\left| 0\right\rangle _A-\sqrt{1-s_A}\left| 1\right\rangle _A)\left| 00\right\rangle _A\otimes \left| 1\right\rangle _B(\sqrt{s_B}\left| 0\right\rangle _B\\ {}&-\sqrt{1-s_B}\left| 1\right\rangle _B)\left| 00\right\rangle _B \otimes \left| 0000\right\rangle _C \left| 1\right\rangle _A\left| 1\right\rangle _B\left| 0\right\rangle _C \\&-\left| 211\right\rangle \frac{1}{\sqrt{3}}\left| 101\right\rangle \left| 1\right\rangle _A(\sqrt{s_A}\left| 0\right\rangle _A-\sqrt{1-s_A}\left| 1\right\rangle _A)\left| 00\right\rangle _A\otimes \left| 0000\right\rangle _B \\ {}&\otimes \sqrt{s_C}\left| 0\right\rangle _C\left| 100\right\rangle _C \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C \\&+\left| 212\right\rangle \frac{1}{\sqrt{3}}\left| 101\right\rangle \left| 1\right\rangle _A(\sqrt{s_A}\left| 0\right\rangle _A-\sqrt{1-s_A}\left| 1\right\rangle _A)\left| 00\right\rangle _A \otimes \left| 0000\right\rangle _B\\ {}&\otimes \sqrt{1-s_C}\left| 1\right\rangle _C\left| 100\right\rangle _C \left| 1\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C \\&-\left| 211\right\rangle \frac{1}{\sqrt{3}}\left| 011\right\rangle \left| 0000\right\rangle _A \otimes \left| 1\right\rangle _B(\sqrt{s_B}\left| 0\right\rangle _B-\sqrt{1-s_B}\left| 1\right\rangle _B)\left| 00\right\rangle _B\\ {}&\otimes (\sqrt{s_C}\left| 0\right\rangle _C-\sqrt{1-s_C}\left| 1\right\rangle _C)\left| 100\right\rangle _C \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C \end{aligned} \end{aligned}$$
(24)

Similarly, the state \(\left| 311\right\rangle \) is mapped to

$$\begin{aligned}&\left| 311\right\rangle \left| W\right\rangle \left| 0000\right\rangle _A\otimes \left| 0000\right\rangle _B\otimes \left| 0000\right\rangle _C\left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C \nonumber \\ \rightarrow&-\left| 311\right\rangle \frac{1}{\sqrt{3}}\left| 110\right\rangle \left| 001\right\rangle _A(\sqrt{1-s_A}\left| 0\right\rangle _A-\sqrt{s_A}\left| 1\right\rangle _A) \otimes \sqrt{s_B}\left| 1000\right\rangle _B\nonumber \\ {}&\otimes \left| 0000\right\rangle _C \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\nonumber \\&+\left| 231\right\rangle \frac{1}{\sqrt{3}}\left| 110\right\rangle \left| 001\right\rangle _A(\sqrt{1-s_A}\left| 0\right\rangle _A-\sqrt{s_A}\left| 1\right\rangle _A) \otimes \sqrt{1-s_B}\left| 1100\right\rangle _B\nonumber \\ {}&\otimes \left| 0000\right\rangle _C \otimes \left| 1\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\nonumber \\&-\left| 211\right\rangle \frac{1}{\sqrt{3}}\left| 101\right\rangle \left| 001\right\rangle _A(\sqrt{1-s_A}\left| 0\right\rangle _A-\sqrt{s_A}\left| 1\right\rangle _A) \otimes \left| 0000\right\rangle _B\nonumber \\ {}&\otimes (\sqrt{s_C}\left| 0\right\rangle -\sqrt{1-s_C}\left| 1\right\rangle )\left| 100\right\rangle _C \left| 1\right\rangle _A\left| 0\right\rangle _B\left| 1\right\rangle _C \nonumber \\&-\left| 311\right\rangle \frac{1}{\sqrt{3}}\left| 011\right\rangle \left| 0000\right\rangle _A \otimes \left| 1\right\rangle _B(\sqrt{s_B}\left| 0\right\rangle _B-\sqrt{1-s_B}\left| 1\right\rangle _B)\left| 00\right\rangle _B\nonumber \\ {}&\otimes (\sqrt{s_C}\left| 0\right\rangle _C-\sqrt{1-s_C}\left| 1\right\rangle _C)\left| 100\right\rangle _C \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C \end{aligned}$$
(25)

By tracing out the ancilla qubits, we obtain

$$\begin{aligned} T(\left| 311\right\rangle \left\langle 211\right| )=\frac{1}{3} \left| 311\right\rangle \left\langle 211\right| \end{aligned}$$
(26)

and

$$\begin{aligned} \lim _{t\rightarrow \infty }T^t (\left| 311\right\rangle \left\langle 211\right| )=0. \end{aligned}$$
(27)

By repeating the same calculation, one can find (27) is true for any entangled state \(\left| abc\right\rangle \left\langle ijk\right| \) \((\left| abc\right\rangle \ne \left| ijk\right\rangle )\). Therefore, it is sufficient to consider the \(\left| abc\right\rangle =\left| ijk\right\rangle \) cases. Then the main components of the transition matrix T can be represented with basis \(\{\left| 211\right\rangle , \left| 212\right\rangle , \left| 231\right\rangle , \left| 232\right\rangle , \left| 311\right\rangle ,\left| 312\right\rangle , \left| 331\right\rangle ,\left| 332\right\rangle \}\) in such a way that

$$\begin{aligned} T= \begin{pmatrix} \frac{1+s_C}{3}&{}0&{}\frac{s_B}{3}&{}0&{}\frac{1}{3}&{}\frac{s_A}{3}&{}0&{}0\\ \frac{1-s_C}{3}&{}\frac{2-s_C}{3}&{}0&{}0&{}0&{}0&{}0&{}0\\ \frac{1}{3}&{}\frac{s_C}{3}&{}\frac{s_A+1-s_B+s_C}{3}&{}\frac{1}{3}&{}\frac{1-s_B}{3}&{}0&{}\frac{1}{3}&{}\frac{s_A}{3}\\ 0&{}\frac{1}{3}&{}\frac{1-s_C}{3}&{}\frac{s_A+1}{3}&{}0&{}\frac{1-s_B}{3}&{}0&{}0\\ 0&{}0&{}0&{}0&{}\frac{1+s_B}{3}&{}0&{}\frac{s_B}{3}&{}0\\ 0&{}0&{}0&{}0&{}0&{}\frac{2-s_A+s_B-s_C}{3}&{}0&{}0\\ 0&{}0&{}\frac{1-s_A}{3}&{}0&{}0&{}\frac{s_C}{3}&{}\frac{2-s_B}{3}&{}\frac{1}{3}\\ 0&{}0&{}0&{}\frac{1-s_A}{3}&{}0&{}0&{}0&{}\frac{2-s_A}{3} \end{pmatrix}. \end{aligned}$$
(28)

For example, \(\left| 211\right\rangle \) is mapped into \(\left| 212\right\rangle \) and \(\left| 231\right\rangle \) with the probability \(\frac{1-s_C}{3}\) and \(\frac{1}{3}\), respectively. \(\left| 312\right\rangle \) is mapped to itself by the T operation, so \(T_{6i}= 0\) unless \(i=6\). From the Perron–Frobenius theorem, the maximal eigenvalue of the nonnegative matrix T is 1 and the components of the corresponding eigenvector, which may not be uniquely determined, is nonnegative.

Now let us discuss equilibria of quantum strategies. We assume \(s_B=1\) because of the inequality \(V_B(s_A,0,s_C)<V_B(s_A,1,s_C)\) for all \(s_A,s_C \in [0,1]\). Let \(\rho _0,\rho _1\) be steady states at \(s_B=0,1\), respectively. Bob keeps \(\left| 3\right\rangle \) if \(s_B=0\). Therefore we obtain

$$\begin{aligned} v_B\cdot \rho _0=c_3 \ge v_B\cdot \rho _1 \end{aligned}$$
(29)

and

$$\begin{aligned} V_B(s_A,1,s_C)-V_B(s_A,0,s_C)&=-v_B\cdot (\rho _1-\rho _0)+\delta u w_B\cdot (\rho _1-\rho _0) \end{aligned}$$
(30)
$$\begin{aligned}&=(c_3-v_B\cdot \rho _1)+\delta u w_B\cdot (\rho _1-\rho _0). \end{aligned}$$
(31)

\(c_3-v_B\cdot \rho \ge 0\) and the second term is grater than 0 for \(s_A,s_C\in [0,1]\) as Fig. 7 shows. Therefore \(V_B(s_A,1,s_C)>V_B(s_A,0,s_C)\) is satisfied.

Fig. 7
figure 7

The \((s_A,s_C)\)-dependence of \(w_B\cdot (\rho _1-\rho _0)\), which is larger than 0 for any pair of \(s_A,s_C\in [0,1]\)

An optimal pair of \(s_A,s_C\) depends on \(c_2-c_1, c_3-c_2\) and \(\delta u\). Equilibrium strategies of Alice and Charlie are shown in Fig. 8. \((s_A,s_C)=(1,1), (0,1), (1,0)\) are the equilibria in the red, orange and blue domains, respectively. In the white region, at least one of Alice and Charlie uses a mixed strategy \(s_i\ne 0,1\) for an equilibrium. Note that there might be multiple equilibria near a boundary. For example, as illustrated in Fig. 9, there are three equilibria at a point \(\frac{c_2-c_1}{u\delta }=0.19,\frac{c_3-c_2}{u\delta }=0.23\) near the boundary between orange and white.

Fig. 8
figure 8

Equilibrium strategies of Alice and Charlie when \(s_B=1\)

Fig. 9
figure 9

Equilibrium strategies of Alice and Charlie at a point \(\frac{c_2-c_1}{u\delta }=0.19,\frac{c_3-c_2}{u\delta }=0.23\) near the boundary between the red and the white domains in Fig. 8. The blue line in the right figure corresponds to the optimal \(s_A\) against \(s_C\) and the red line indicates the optimal \(s_C\) against \(s_A\). There are three crossing points. Charlie desires his best situation \((s_A,s_C)=(0,1)\), which is not best for Alice. The right figure also suggests that \(s_A=1\) is Alice’s optimal strategy if \(s_C\in [0,0.9]\)

2.4 Emergence of commodity money from quantum exchange

In this section we generalized our discussion in Sect. 2.3. In addition to entangled quantum goods, we also consider quantum strategies that do not always commute \(\mathcal {J}=\exp \left[ i\theta Y^{\otimes 12}\right] \); hence, strategies of Alice, Bob and Charlie are generally entangled. For strategies in Fig. 4, we impose \(\left\langle 00\right| U_i^j\left| 00\right\rangle =\left\langle 11\right| U_i^j\left| 11\right\rangle =0~(i=\text {A,B,C},j\in \{1,2,3\})\) in order to secure the independence of strategies for different goods. The strategies consist of

$$\begin{aligned} \begin{aligned} \bar{U}_A^2&=U_A^2\otimes I^{\otimes 2},~\bar{U}_A^3=I^{\otimes 2} \otimes U_A^3\\ \bar{U}_B^1&=U_B^1\otimes I^{\otimes 2},~\bar{U}_B^3=I^{\otimes 2} \otimes U_B^3\\ \bar{U}_C^1&=U_C^1\otimes I^{\otimes 2},~\bar{U}_C^2=I^{\otimes 2} \otimes U_C^2 \end{aligned} \end{aligned}$$
(32)

We first consider \(\mathcal {J}= I^{\otimes 12}\). With respect to a state \(\left| abc\right\rangle \) of quantum goods, the strategies act on the ancillary term as

$$\begin{aligned} \begin{aligned} \left| W\right\rangle \left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \rightarrow&\frac{1}{\sqrt{3}}\left| 110\right\rangle (\bar{U}_A^a\otimes \bar{U}_B^b\otimes I^{\otimes 4})\left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \\&+ \frac{1}{\sqrt{3}}\left| 101\right\rangle (\bar{U}_A^a\otimes I^{\otimes 4}\otimes \bar{U}_C^c)\left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \\&+ \frac{1}{\sqrt{3}}\left| 011\right\rangle (I^{\otimes 4}\otimes \bar{U}_B^b \otimes \bar{U}_C^c)\left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \end{aligned} \end{aligned}$$
(33)

By definition, each player has 4 qubits. If two persons meet, at least one of the first half two qubits or the second half two qubits becomes \(\left| 1\right\rangle \). If a person meets no one, all of his/her 4 qubits are \(\left| 0\right\rangle \). For example, if Alice \(\left| 2\right\rangle \) meet someone, one of her first two qubits is \(\left| 1\right\rangle \). Similarly if she has \(\left| 3\right\rangle \) and meet someone, one of her second half two qubits becomes \(\left| 1\right\rangle \). Therefore, \(T(\left| abc\right\rangle \left\langle ijk\right| )\ne 0\) obeys if and only if one of the following conditions satisfies

$$\begin{aligned} \begin{aligned} \left| b\right\rangle =\left| j\right\rangle ,\left| c\right\rangle =\left| k\right\rangle \\ \left| a\right\rangle =\left| i\right\rangle ,\left| c\right\rangle =\left| k\right\rangle \\ \left| a\right\rangle =\left| i\right\rangle ,\left| b\right\rangle =\left| j\right\rangle \end{aligned} \end{aligned}$$
(34)

In addition, if only one player has a different good, say \(\left| a\right\rangle \ne \left| i\right\rangle ,\left| b\right\rangle =\left| j\right\rangle ,\left| c\right\rangle =\left| k\right\rangle \), non-zero terms are given when Bob and Charlie meet

(35)

where means the state after the exchange \(\left| b\right\rangle \leftrightarrow \left| c\right\rangle \) and \(\alpha \in [0,1]\) is the success probability of the exchange. As a general result, any entangled term becomes smaller with the factor \(\frac{1}{3}\); hence, \(\lim _{t\rightarrow \infty }T^t(\left| abc\right\rangle \left\langle ibc\right| )=0\) holds.

Now let us consider the case \(\mathcal {J}=\exp {\left[ i \theta Y^{\otimes 12}\right] }\). The ancillary term is mapped to

$$\begin{aligned} \begin{aligned} \left| W\right\rangle \left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \rightarrow&\frac{1}{\sqrt{3}}\left| 110\right\rangle \mathcal {J}^\dagger (\bar{U}_A^a\otimes \bar{U}_B^b\otimes I^{\otimes 4})\mathcal {J}\left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \\&+ \frac{1}{\sqrt{3}}\left| 101\right\rangle \mathcal {J}^\dagger (\bar{U}_A^a\otimes I^{\otimes 4}\otimes \bar{U}_C^c)\mathcal {J}\left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \\&+ \frac{1}{\sqrt{3}}\left| 011\right\rangle \mathcal {J}^\dagger (I^{\otimes 4}\otimes \bar{U}_B^b \otimes \bar{U}_C^c)\mathcal {J}\left| 0000\right\rangle _A\left| 0000\right\rangle _B\left| 0000\right\rangle _C \end{aligned} \end{aligned}$$
(36)

The terms sandwiched by \(\mathcal {J}^\dagger ,\mathcal {J}\) can be decomposed into a sum of terms which commute or anti-commute with \(\mathcal {J}\)

$$\begin{aligned} \mathcal {J}^\dagger ((\text {commutative})+(\text {anti-commutative}) )\mathcal {J} =(\text {commutative})-(\text {anti-commutative})\mathcal {J}^2. \end{aligned}$$
(37)

The “(commutative)” part produces the same states of \(\mathcal {J}=I^{\otimes 12}\) and the “(anti-commutative)” part gives different states which consist of the following terms: if a player meets someone, at least one of the first or second half two qubits is \(\left| 0\right\rangle \) and, if a player does not meet anyone, all of his/her 4 qubits are \(\left| 1\right\rangle \). Therefore, \(T(\left| abc\right\rangle \left\langle ijk\right| )\ne 0\) if and only if one of the conditions (34) is satisfied. Transition of states before tracing out the corresponding ancilla qubits is summarized in Table 1.

Table 1 Correspondence between quantum goods and the terms associated with \(\left| 110\right\rangle , \left| 101\right\rangle \) and \(\left| 011\right\rangle \) after exchange, consumption and creation

We give a more general argument which assures quantum states can be a medium of exchange. We find entangled states and classical states have a different durability. Our main goal in this section is to show the following statement.

Theorem 2.2

Suppose \(\mathcal {J}=\exp \left[ i\theta Y^{\otimes 12}\right] \) and \(\left\langle 00\right| U_i^j\left| 00\right\rangle =\left\langle 11\right| U_i^j\left| 11\right\rangle =0\). For any \(\theta \in [0,2\pi ]\) and any quantum commodity state \(\rho \), there is a classical mixed state \(\rho _c\) such that

$$\begin{aligned} \lim _{t\rightarrow \infty } T^{t}\rho =\rho _c. \end{aligned}$$
(38)

Proof

We consider transition of a state \(\left| abc\right\rangle \left\langle ijk\right| \) by T. Consulting Table 1, one can verify the following formula one-by-one for any \(\left| abc\right\rangle \ne \left| ijk\right\rangle \)

$$\begin{aligned} T(\left| abc\right\rangle \left\langle ijk\right| )= {\left\{ \begin{array}{ll} \frac{1}{3}\left| abc\right\rangle ^\star \left\langle ijk\right| ^\star &{}(a=i,b=j,c\ne k), ~(a=i,b\ne j, c=k),~\\ {} &{}\text {or}~(a\ne i,b=j,c=k)\\ 0&{}\text {otherwise} \end{array}\right. } \end{aligned}$$
(39)

where \(\left| abc\right\rangle ^*\left\langle ijk\right| ^*\) is a certain normalized state. Important fact is that operating T to any entanglement term makes it smaller with the factor \(\frac{1}{3}\) at most. Therefore, we conclude \(\lim _{t\rightarrow \infty }T^t(\left| abc\right\rangle \left\langle ijk\right| )=0\) for any \(\left| abc\right\rangle \ne \left| ijk\right\rangle \).

When we restrict ourselves to the cases of \(\left| abc\right\rangle =\left| ijk\right\rangle \), then \(T(\left| ijk\right\rangle \left\langle ijk\right| )\) is a nonnegative matrix. Note that T is a stochastic matrix. If two persons have the same goods, which corresponds to a vertex state of the hexagon in Fig. 5, the state is mapped to itself with the probability 1/3. Suppose all three persons have different goods. Based on their strategies, it turns out \(\left| 312\right\rangle \) is mapped to itself with the probability 1, in which case \(\left| 312\right\rangle \) is a fixed point, or it is mapped to another vertex state. If \(\left| 312\right\rangle \) is mapped to another state, then it never returns to \(\left| 312\right\rangle \). Therefore, we find it vanishes \(\lim _{t\rightarrow \infty }T^t (\left| 312\right\rangle \left\langle 312\right| )= 0\). Regarding \(\left| 231\right\rangle \), it can be mapped to itself and other states can be mapped to \(\left| 231\right\rangle \). Based on strategies, the 7 states or the 6 vertex states in the hexagon in Fig. 5 form a closed, ergodic and reducible Markov chain. For such a Markov chain, we can find a family of closed, ergodic and irreducible subchains as follows. Up to similarity transformations, our transition matrix for a given Markov chain can be written as

(40)

where \(T_{i_j}\) are transition matrices of an irreducible Markov subchain in a given reducible Markov chain and the block matrices in boxes are transition matrices of closed Markov subchains. In particular, \(T_{i_1}~(i=1,\cdots ,N)\) are transition matrices of closed irreducible and ergodic Markov subchains. According to the convergence theorem for Markov chains, each \(T_{i_1}\) has a stationary distribution \(\rho _i\). By repeating the deals, the initial state \(\rho \) converges into a sum of the stationary distributions

$$\begin{aligned} \rho= & {} a_1 \rho |_{T_{1_1},\cdots , T_{1_k}}+ a_2\rho |_{T_{2_1},\cdots ,T_{2_l}}+ \cdots +a_N\rho |_{T_{N_1},\cdots ,T_{N_m}} \end{aligned}$$
(41)
$$\begin{aligned}\rightarrow & {} \sum _{i=1}^{N}a_i\rho _i =\rho _c \end{aligned}$$
(42)

where \(\{a_i\}_{i=1}^N\) is a certain family of nonnegative numbers that obey \(\sum _{i=1}^N a_i=1\) and \(\rho |_{T_{i_1},\cdots ,T_{i_n}}\) is a projection state of \(\rho \) onto a state transited by the corresponding ith block matrix consisting of \(T_{i_1},\cdots ,T_{i_n}\) (Figs. 10, 11).

Therefore, for any \(\rho \), one can find a fixed state \(\rho _c\) such that \(\lim _{t\rightarrow \infty }T^t\rho =\rho _c\). Note that such a fixed point is probabilistic mixture of pure states, thereby classical state. Therefore, in general, repetitions of an exchange of quantum commodities make entangled states gradually disappear and, thereby only a classical mixed state \(\rho _c\) survives. This completes the proof of Theorem 2.2. \(\square \)

2.5 Emergence of coalition and quantum effects on deals

Morgenstern and Neumann assert that a three-person decision making should be completely different from a two-person decision making [27]. In a three-person game, a reciprocal relationship among agents could emerge and a coalition for which they take cooperative behavior helps them pursuit their own benefit. This leads to the concept of a cooperative game, in which players act in deference to an agreement. In our previous discussion in Sect. 2.3, when quantum strategies are not entangled, all players have a chance to increase their own profits by themselves, by exchanging quantum states appropriately. So the game is completely written in terms of a non-cooperative quantum game theory. In this section, we investigate an economy where quantum strategies are generally entangled. Our main interest here can be stated in a twofold way: (1) Can a quantum state become a medium of exchange? (2) Can a player find an optimal quantum strategy when strategies are entangled? In the previous section, we showed that a quantum state can be a medium of exchange in the sense that the associated classical term becomes a steady state. Again, readers will find the first question can be affirmatively solved (see Fig. 12, for example). A remarkable result in this section is the existence of an optimal quantum strategy that allows Bob to obtain his consuming good \(\left| 2\right\rangle \) from Alice regardless of her inclination (44). Alice has no way to decline this trade with Bob and may be forced to have a state that she does not desire; hence, she may suffer a loss. To compensate her loss, Alice responds to Bob’s attack by counter-attacking, but it turns out that her action may cause damage not only to Bob but also to Charlie due to entanglement. So Bob and Charlie share a mutual interest and they have a motivation to form a coalition. Indeed Bob and Charlie can find an amicable solution that does not decrease their profits (Fig. 13). This novel property only becomes evident after quantum goods and entangled strategies are introduced and cannot be explained by conventional classical games or the corresponding quantum variants [22,23,24]. Those salient features of our quantum extension of the Kiyotaki–Wright model strongly suggests that general quantum extensions of conventional games, including the contract theory and mechanism design, offers novel and various possibilities that cannot be discussed in the framework of the traditional economics. In other words, economics in the quantum era will become very different from economics today. This provides incentives to study quantum economics.

In the previous section, we consider a trade of entangled quantum goods, and we see the quantum entanglement gradually disappears through repetitions of a trade. Now we discuss the case of unentangled quantum goods and entangled quantum strategies. Following our previous discussions, we again employ \(\mathcal {J}=\exp {\left[ i \theta Y^{\otimes 12}\right] }\) for entanglement among strategies. Quantum strategies are maximally entangled when \(\theta =\frac{\pi }{4}\), which we use throughout this section. We are interested in a game where a quantum strategy that do not commute \(\mathcal {J}\) is used for a deal. Suppose Alice, Bob and Charlie choose the following strategies when \(\frac{c_3-c_2}{\delta u}\) and \(\frac{c_2-c_1}{\delta u}\) are in the red region of Fig. 8

$$\begin{aligned} \begin{aligned} U_A^2&=Y \otimes I&U_A^3&=\sqrt{1-q_A}Y\otimes Y+\sqrt{q_A}Y\otimes X \\ U_B^1&=Y \otimes I&U_B^3&=\sqrt{1-q_B}Y\otimes Y+\sqrt{q_B}Z\otimes Y \\ U_C^1&=I\otimes Y&U_C^2&=\sqrt{1-q_C}Y\otimes Y+\sqrt{q_C}Z\otimes Y \end{aligned} \end{aligned}$$
(43)

By choosing \(q_B=0\) Bob can reproduce his classical strategy (\(s_B=1\) at (18)). An important difference from Sect. 2.3 is that Bob may use quantum strategy Z when Bob has \(\left| 3\right\rangle \). If there is no entanglement, Bob’s state does not change from \(\left| 3\right\rangle \) to \(\left| 1\right\rangle \). In this case, however, the strategy has other implications. Bob desires to exchange his state \(\left| 3\right\rangle \) for Alice’s \(\left| 2\right\rangle \), by which Alice may suffers a loss. If Alice, Bob and Charlie have \(\left| 2\right\rangle ,\left| 3\right\rangle \) and \(\left| 1\right\rangle \), then their initial state \(\left| 231\right\rangle \) is mapped to

$$\begin{aligned} \begin{aligned} \left| 231\right\rangle&\left| W\right\rangle \left| 0000\right\rangle _A\otimes \left| 0000\right\rangle _B\otimes \left| 0000\right\rangle _C \otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\ \rightarrow&\frac{i\sqrt{q_B}}{\sqrt{3}}\left| 331\right\rangle \left| 110\right\rangle \left| 0111\right\rangle _A\otimes \left| 1110\right\rangle _B\otimes \left| 1111\right\rangle _C\otimes \left| 0\right\rangle _A\left| 1\right\rangle _B\left| 0\right\rangle _C\\&-\frac{i\sqrt{1-q_B}}{\sqrt{3}}\left| 231\right\rangle \left| 110\right\rangle \left| 1000\right\rangle _A\otimes \left| 0011\right\rangle _B\otimes \left| 0000\right\rangle _C\otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\&-\frac{1}{\sqrt{3}}\left| 231\right\rangle \left| 101\right\rangle \left| 1000\right\rangle _A\otimes \left| 0000\right\rangle _B\otimes \left| 0100\right\rangle _C\otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\&+\frac{i\sqrt{q_B}}{\sqrt{3}}\left| 211\right\rangle \left| 011\right\rangle \left| 1111\right\rangle _A\otimes \left| 1110\right\rangle _B\otimes \left| 1011\right\rangle _C\otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 1\right\rangle _C \\&-\frac{i\sqrt{1-q_B}}{\sqrt{3}}\left| 211\right\rangle \left| 011\right\rangle \left| 0000\right\rangle _A\otimes \left| 0011\right\rangle _B\otimes \left| 0100\right\rangle _C\otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 1\right\rangle _C . \end{aligned} \end{aligned}$$
(44)

It is important to note that \(\left| 231\right\rangle \) is mapped on to \(\left| 311\right\rangle \) if Alice and Bob meet. This implies that, regardless of Alice’s strategy \(q_A\), Bob creates a new \(\left| 3\right\rangle \) by exchanging his \(\left| 3\right\rangle \) for Alice’s \(\left| 2\right\rangle \). This happens since Bob uses a quantum strategy that does not commute with \(\mathcal {J}\) and Alice and Bob are entangled. This is a key characteristic of our quantum game in the following two senses: 1) classical games does not allow those solutions 2) this occurs even for a single stage game. The first property is clearly important since it distinguishes a quantum game from a classical one. Alice receives \(\left| 3\right\rangle \) in a different logic that she accepts it in the classical speculative equilibrium. Apart from that, here we would like to emphasize the second characteristic. As explained in [25, 26], the EWL types of single stage quantum games [22] are entirely non-quantum mechanical and there are no radical solutions created thus far. Therefore, to our best knowledge, our work is the first model that reaches a milestone for this problem. Note that the basic part of our quantum circuit (Fig. 3) is the EWL protocol for the prisoner’s dilemma [22]. References [26, 62] are standard reviews of the WEL protocol. Quantum properties of the infinitely repeated quantum prisoner’s dilemma are reported in [37, 38]

Similarly we find \(\left| 311\right\rangle \) is mapped on to \(\left| 231\right\rangle \) if Alice and Bob meet (45). This implies that, regardless of Bob’s strategy \(q_B\), Alice creates a new \(\left| 1\right\rangle \) by exchanging her \(\left| 3\right\rangle \) for Bob’s \(\left| 1\right\rangle \).

$$\begin{aligned} \begin{aligned} \left| 311\right\rangle&\left| W\right\rangle \left| 0000\right\rangle _A\otimes \left| 0000\right\rangle _B\otimes \left| 0000\right\rangle _C \otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\ \rightarrow&-\frac{i\sqrt{q_A}}{\sqrt{3}}\left| 231\right\rangle \left| 110\right\rangle \left| 1100\right\rangle _A\otimes \left| 0111\right\rangle _B\otimes \left| 1111\right\rangle _C\otimes \left| 1\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\&-\frac{i\sqrt{1-q_A}}{\sqrt{3}}\left| 311\right\rangle \left| 110\right\rangle \left| 0011\right\rangle _A\otimes \left| 1000\right\rangle _B\otimes \left| 0000\right\rangle _C\otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\&-\frac{1}{\sqrt{3}}\left| 311\right\rangle \left| 011\right\rangle \left| 0000\right\rangle _A\otimes \left| 1000\right\rangle _B\otimes \left| 0100\right\rangle _C\otimes \left| 0\right\rangle _A\left| 0\right\rangle _B\left| 0\right\rangle _C\\&-\frac{i\sqrt{q_A}}{\sqrt{3}}\left| 211\right\rangle \left| 101\right\rangle \left| 1100\right\rangle _A\otimes \left| 1111\right\rangle _B\otimes \left| 1011\right\rangle _C\otimes \left| 1\right\rangle _A\left| 0\right\rangle _B\left| 1\right\rangle _C \\&-\frac{i\sqrt{1-q_A}}{\sqrt{3}}\left| 211\right\rangle \left| 101\right\rangle \left| 0011\right\rangle _A\otimes \left| 0000\right\rangle _B\otimes \left| 0100\right\rangle _C\otimes \left| 1\right\rangle _A\left| 0\right\rangle _B\left| 1\right\rangle _C \end{aligned} \end{aligned}$$
(45)

The transition matrix T corresponding to the strategies (43) is

$$\begin{aligned} T= \begin{pmatrix} \frac{2}{3} &{}\quad 0 &{}\quad \frac{1}{3} &{}\quad 0 &{}\quad \frac{1}{3} &{}\quad \frac{1}{3} &{}\quad 0 &{}\quad 0 \\ 0 &{}\quad \frac{1}{3} &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 \\ \frac{1}{3} &{}\quad \frac{1}{3} &{}\quad \frac{2-q_B}{3} &{}\quad \frac{1}{3} &{}\quad \frac{q_A}{3} &{}\quad 0 &{}\quad \frac{1}{3} &{}\quad \frac{1}{3} \\ 0 &{}\quad \frac{1}{3} &{}\quad 0 &{}\quad \frac{2-q_B}{3} &{}\quad 0 &{}\quad \frac{1}{3} &{}\quad 0 &{}\quad 0 \\ 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad \frac{2-q_A}{3} &{}\quad 0 &{}\quad \frac{1}{3} &{}\quad 0 \\ 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad 0 \\ 0 &{}\quad 0 &{}\quad \frac{q_B}{3} &{}\quad 0 &{}\quad 0 &{}\quad \frac{1}{3} &{}\quad \frac{1}{3} &{}\quad \frac{1}{3} \\ 0 &{}\quad 0 &{}\quad 0 &{}\quad \frac{q_B}{3} &{}\quad 0 &{}\quad 0 &{}\quad 0 &{}\quad \frac{1}{3} \\ \end{pmatrix}. \end{aligned}$$
(46)

Even if Charlie has a quantum good \(\left| 2\right\rangle \) initially, he loses it in the next step and never receives \(\left| 2\right\rangle \) again. He eventually gets \(\left| 1\right\rangle \). So we do assume Charlie has the good \(\left| 2\right\rangle \). Therefore, the corresponding fixed point is

$$\begin{aligned} \rho =\frac{ (2+2q_A+2q_B)\left| 211\right\rangle \left\langle 211\right| + (2q_A+2)\left| 231\right\rangle \left\langle 231\right| +q_B \left| 311\right\rangle \left\langle 311\right| +q_B(1+q_A)\left| 331\right\rangle \left\langle 331\right| }{4(1+q_A)+q_B(3+q_A)}. \end{aligned}$$
(47)

So the state \(\left| 211\right\rangle \) seems most likely to appear. Let us discuss equilibrium strategies. The expected total profit \(V_i(i=A,B,C)\) (13) of Alice, Bob and Charlie can be expressed as

$$\begin{aligned} \begin{aligned} V_A&=\left[ -(c_2,c_2,c_3,c_3)+\frac{u\delta }{3}(1,0,1+q_A,1) \right] \frac{1}{4(1+q_A)+q_B(3+q_A)} \begin{pmatrix} 2+2q_A+q_B \\ 2+2q_A \\ q_B \\ q_B(1+q_A) \\ \end{pmatrix} \\ V_B&=\left[ -(c_1,c_3,c_1,c_3)+\frac{u\delta }{3}(1,q_B,0,0) \right] \frac{1}{4(1+q_A)+q_B(3+q_A)} \begin{pmatrix} 2+2q_A+q_B \\ 2+2q_A \\ q_B \\ q_B(1+q_A) \\ \end{pmatrix} \\ V_C&=\left[ -(c_1,c_1,c_1,c_1)+\frac{u\delta }{3}(0,1,1,2) \right] \frac{1}{4(1+q_A)+q_B(3+q_A)} \begin{pmatrix} 2+2q_A+q_B \\ 2+2q_A \\ q_B \\ q_B(1+q_A) \\ \end{pmatrix}, \end{aligned} \end{aligned}$$
(48)

where each vector is represented with the basis \(\{\left| 211\right\rangle , \left| 231\right\rangle ,\left| 311\right\rangle ,\left| 331\right\rangle \}\), that constitute (47). Consulting (17), we find

$$\begin{aligned} \begin{aligned} v_A&=(c_2,c_2,c_3,c_3) ,&w_A&=\frac{1}{3}(1,0,1+q_A,1) \\ v_B&=(c_1,c_3,c_1,c_3),&w_B&=\frac{1}{3}(1,q_B,0,0) \\ v_C&=(c_1,c_1,c_1,c_1),&w_C&=\frac{1}{3}(0,1,1,2) \end{aligned} \end{aligned}$$
(49)
Fig. 10
figure 10

Total expected profit of Alice, Bob and Charlie when \(\frac{c_2-c_1}{u\delta }=0.4,\frac{c_3-c_2}{u\delta }=0.4\)

For any \(q_B\in (0,1]\), Alice’s optimal strategy which maximizes \(V_A\) is \(q_A=1\) since

$$\begin{aligned} \frac{\partial V_A}{\partial q_A} =\frac{(c_3-c_2)q_B(4-q_B)+\delta u q_B^2}{(4(1+q_A)+q_B(3+q_A))^2} \ge 0. \end{aligned}$$
(50)

The inequality saturates if and only if \(q_B=0\). So any \(q_A\) can be her optimal strategy when \(q_B=0\). Similarly, for any \(q_A\in [0,1]\), Bob’s optimal strategy is also \(q_B=1\) since

$$\begin{aligned} \frac{\partial V_B}{\partial q_B} =\frac{(c_3-c_1)2(1-q_A)(1+q_A)+\delta u2(1+q_A)^2}{(4(1+q_A)+q_B(3+q_A))^2} >0 \end{aligned}$$
(51)

Therefore, \(q_A=q_B=1\) is an equilibrium. Alice gains more rewards compared with the case when she chooses the fundamental strategy (\(q_A=0\)). Bob and Charlie succeed in increasing their rewards. By substituting \(q_A=q_B=1\) into (47), we find the corresponding steady state

$$\begin{aligned} \rho =\frac{5}{12} \left| 211\right\rangle \left\langle 211\right| +\frac{4}{12} \left| 231\right\rangle \left\langle 231\right| +\frac{1}{12} \left| 311\right\rangle \left\langle 311\right| +\frac{2}{12}\left| 331\right\rangle \left\langle 331\right| . \end{aligned}$$
(52)
Fig. 11
figure 11

The flow of goods associated with the steady state (52). The difference from the classical case is that \(\left| 3\right\rangle \) is communicated between Alice and Bob, which happens when the game is in a state \(\left| 231\right\rangle \) or \(\left| 311\right\rangle \)

Bob’s strategy \(U_B^3=Z \otimes Y\) decreases Alice’s profit. As her counter strategy, she may use \(U_A^2=X\otimes I\) when she has \(\left| 2\right\rangle \), in order to prevent Bob from exchanging his \(\left| 3\right\rangle \) for her \(\left| 2\right\rangle \). In addition, if Charlie plays \(U_C^1=I\otimes Y\), then Alice can receive \(\left| 1\right\rangle \) and increase her profit by exchanging her \(\left| 2\right\rangle \) for \(\left| 1\right\rangle \). Quantum strategies and the flow of quantum goods are summarized in Fig. 12. It is important that there are several strategies that make \(\left| 1\right\rangle \), \(\left| 2\right\rangle \) or \(\left| 3\right\rangle \) media of exchange.

Fig. 12
figure 12

Quantum strategies and the flow of quantum goods when \(\left| 231\right\rangle \) is an initial state of Alice, Bob and Charlie who are allowed to decide \(U^2_A\), \(U^3_B\) and \(U^1_C\) independently. If Alice uses \(X\otimes I\), she and Charlie can exchange \(\left| 2\right\rangle \leftrightarrow \left| 1\right\rangle \) and she prevents Bob from using his previous strategy \(Z\otimes Y\) for exchanging \(\left| 2\right\rangle \leftrightarrow \left| 3\right\rangle \). However, if Bob uses \(Y\otimes Y\), the trade \(\left| 2\right\rangle \leftrightarrow \left| 3\right\rangle \) can be realized. Nothing is mediated in the bottom right case

As Charlie gets his consuming good, a trade \(\left| 1\right\rangle \leftrightarrow \left| 3\right\rangle \) between Bob and Charlie is the best trade for Charlie and, as Bob reduces his storage cost, it is also a good trade for Bob. So they may want to trade. However, if Bob and Charlie use \(Z\otimes Y\) and \(Z\otimes Y\), respectively, they do not reach a mutually acceptable agreement on the trade \(\left| 1\right\rangle \leftrightarrow \left| 3\right\rangle \). To solve the problem, they cooperate and try to increase their profits by means of the following strategy. Suppose both of Bob and Charlie choose the strategy (53) with the probability p and choose the strategy (54) with the probability \(1-p\).

$$\begin{aligned}&\left\{ \begin{array}{l} U_B^1=Y\otimes I \\ U_C^1=I\otimes Y \end{array} \right.&\begin{array}{l} U_B^3=\sqrt{1-q_B}Y\otimes Y+\sqrt{q_B}Z\otimes Y \\ U_C^2=Y\otimes Y \end{array}\end{aligned}$$
(53)
$$\begin{aligned}&\left\{ \begin{array}{l} U_B^1=Y\otimes I \\ U_C^1=\sqrt{1-q^\prime _C}I\otimes Y+\sqrt{q^\prime _C}Z\otimes Y \end{array} \right.&\begin{array}{l} U_B^3=Y\otimes Y \\ U_C^2=Y\otimes Y \end{array} \end{aligned}$$
(54)

Bob and Charlie make an arrangement and decide a single \(p\in [0,1]\). Alice may want to use

$$\begin{aligned} U_A^2&=\sqrt{1-q^\prime _A} Y\otimes I+\sqrt{q^\prime _A}X\otimes I&U_A^3&=Y\otimes X \end{aligned}$$
(55)

If Alice uses \(q_A^\prime =0\), Bob and Charlie can maximize their profits by choosing \(p=1, q_B=1\). Similarly, if she uses \(q_A^\prime =1\), they can maximize their profits by choosing \(p=0,q_C=1\). Let \(T_1\) and \(T_2\) be the transition matrices associated with strategies (53) and (54). The total transition matrix is \(T=pT_1+(1-p)T_2\). Their explicit matrix representations are

$$\begin{aligned} T_1= \begin{pmatrix} \frac{2-q_A^\prime }{3} &{} 0 &{} \frac{1}{3} &{} 0 &{} \frac{1}{3} &{} \frac{1}{3} &{} 0 &{} 0 \\ \frac{q_A^\prime }{3} &{} \frac{1}{3} &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 \\ \frac{1}{3} &{} \frac{1}{3} &{} \frac{2-q_B(1-q_A^\prime )-(1-q_B)q_A^\prime -q_A^\prime }{3} &{} \frac{1}{3} &{} \frac{1}{3} &{} 0 &{} \frac{1}{3} &{} \frac{1}{3} \\ 0 &{} \frac{1}{3} &{} \frac{q_A^\prime }{3} &{} \frac{2-q_B(1-q_A^\prime )-(1-q_B)q_A^\prime }{3} &{} 0 &{} \frac{1}{3} &{} 0 &{} 0 \\ 0 &{} 0 &{} 0 &{} 0 &{} \frac{1}{3} &{} 0 &{} \frac{1}{3} &{} 0 \\ 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 \\ 0 &{} 0 &{} \frac{q_B(1-q_A^\prime )+(1-q_B)q_A^\prime }{3} &{} 0 &{} 0 &{} \frac{1}{3} &{} \frac{1}{3} &{} \frac{1}{3} \\ 0 &{} 0 &{} 0 &{} \frac{q_B(1-q_A^\prime )+(1-q_B)q_A ^\prime }{3} &{} 0 &{} 0 &{} 0 &{} \frac{1}{3} \\ \end{pmatrix} \end{aligned}$$
(56)
$$\begin{aligned} T_2= \begin{pmatrix} \frac{2-q_A^\prime (1-q_C^\prime )-(1-q_A^\prime )q_C^\prime }{3} &{} 0 &{} \frac{1}{3} &{} 0 &{} \frac{1}{3} &{} \frac{1}{3} &{} 0 &{} 0 \\ \frac{q_A^\prime (1-q_C^\prime )+(1-q_A^\prime )q_C^\prime }{3} &{} \frac{1}{3} &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 \\ \frac{1}{3} &{} \frac{1}{3} &{} \frac{2-q_A^\prime -q_A^\prime (1-q_C^\prime )-(1-q_A^\prime )q_C^\prime }{3} &{} \frac{1}{3} &{} \frac{1}{3} &{} 0 &{} \frac{1}{3} &{} \frac{1}{3} \\ 0 &{} \frac{1}{3} &{} \frac{q_A^\prime (1-q_C^\prime )+(1-q_A^\prime )q_C^\prime }{3} &{} \frac{2-q_A^\prime }{3} &{} 0 &{} \frac{1}{3} &{} 0 &{} 0 \\ 0 &{} 0 &{} 0 &{} 0 &{} \frac{1}{3} &{} 0 &{} \frac{1}{3} &{} 0 \\ 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 &{} 0 \\ 0 &{} 0 &{} \frac{q_A^\prime }{3} &{} 0 &{} 0 &{} \frac{1}{3} &{} \frac{1}{3} &{} \frac{1}{3} \\ 0 &{} 0 &{} 0 &{} \frac{q_A^\prime }{3} &{} 0 &{} 0 &{} 0 &{} \frac{1}{3} \\ \end{pmatrix} \end{aligned}$$
(57)

It is only the pair of Bob and Charlie who can establish the coalition as described. Both of them can increase their profit without loss. This is not true for Alice and Bob, or for Alice and Charlie. If Alice and Bob exchange \(\left| 2\right\rangle \leftrightarrow \left| 3\right\rangle \), then Bob gains but Alice suffers a loss. Similarly if Alice and Charlie trade \(\left| 2\right\rangle \leftrightarrow \left| 1\right\rangle \), then Alice benefits but Charlie incurs a loss. The emergence of such a coalition is based on a typical quantum phenomena that has not been reported in the past studies on the Kiyotaki-Wright model. The flow of quantum commodities under those strategies are summarized in Fig. 13.

Fig. 13
figure 13

The flow of goods. The difference from the classical case is that 3, 2, 1 are communicated between Alice and Bob, Bob and Charlie, and Charlie and Alice, respectively. Bob and Charlie can cooperate that does not decrease their profits. This does not happen in a classical situation

3 Conclusion and discussion

The main contributions of our article are summarized as follows. In Sect. 2.1, we introduced our quantum game model which describes the emergence of quantum commodity money as an equilibrium strategy of quantum exchange. In Sect. 2.2 we presented quantum circuits for consensus building and exchanging quantum states. In Sect. 2.3 we addressed generic entangled states and clarified the mechanism of the quantum economy leading a quantum state to a medium of exchange. In Sect. 2.5 we studied some equilibria of entangled quantum strategies and demonstrated how a coalition can emerge from a non-cooperative game.

We propose several research directions for readers interested in quantum games and quantum economics. First of all, it is straightforward but important to explore an economy that allows quantum fiat money to be a medium of exchange. For this purpose one should simply add \(\left| 4\right\rangle :=\left| 00\right\rangle \) as a quantum object with no intrinsic value. Moreover, it will be a good exercise to implement our algorithms (Figs. 3 and 4) with a quantum computer or a quantum simulator to study a quantum algorithm of consensus building and verify our results numerically. In addition, it is also interesting to study the quantum model of the type B economy, where Alice, Bob and Charlie produce \(\left| 3\right\rangle \), \(\left| 1\right\rangle \) and \(\left| 2\right\rangle \), respectively. As shown in the original Kiyotaki–Wright model [42], the dominant equilibrium strategy depends on models and it will be also true for our quantum extension. Indeed, as discussed in Sect. 2.5, a choice of initial states is crucial for the optimal strategies. Moreover, it is exciting to address generic entangled strategies. In our analysis we focused on the simplest case \(\mathcal {J}=\exp \left[ i \theta Y^{\otimes 12}\right] \). Our three-person quantum game with generic entangled strategies is very complicated and there are many open questions left. Furthermore, it is also possible to analyze equilibrium strategies of our economy where quantum walkers [63,64,65] enjoy business. In this article, we used \(\left| W\right\rangle \) to decrease complexity, but it is yet another important question whether a quantum state can be a medium of exchange even if players encounter in a different way. For this purpose, it may be helpful to use the following matrices to introduce quantum walk

$$\begin{aligned} \begin{pmatrix} a_{11}&{}a_{12}&{}a_{13}\\ 0&{}0&{}0\\ 0&{}0&{}0 \end{pmatrix},~ \begin{pmatrix} 0&{}0&{}0\\ a_{21}&{}a_{22}&{}a_{23}\\ 0&{}0&{}0 \end{pmatrix},~ \begin{pmatrix} 0&{}0&{}0\\ 0&{}0&{}0\\ a_{31}&{}a_{32}&{}a_{33} \end{pmatrix} \end{aligned}$$
(58)

where \(|a_{i1}|^2+|a_{i2}|^2+|a_{i3}|^2=1\) for \(i=1,2,3\).

For advanced readers, it is meaningful to investigate a general quantum theory of economics, including market design and contracts [66], so that we can provide efficient quantum information and communication markets in the upcoming era of quantum technology. For example, one can refer to our algorithm to consider many-to-many matching. Moreover, our study suggests that entangled strategies case a situation that is not predetermined in an agreement, thereby it will be complex and costly for the parties to make their contract complete. That means quantum theory also sheds new light on incomplete contracts [67,68,69]. Quantum theory of economics will also shed new light on macroeconomics. In particular, we guess different countries will start using different quantum currencies. It is an open problem to study how quantum currencies circulate in the global economy. A formal model for a classical setup is provided in [70]. The more quantum technologies develop, the more important quantum economical perspectives will become. In addition, it will contribute to development of legal systems in the quantum era, since economics are inextricable from jurisprudence.