Related papers: A Game-Theoretic Quantum Algorithm for Solving Mag…
Variational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the…
Variational quantum eigensolvers (VQEs) combine classical optimization with efficient cost function evaluations on quantum computers. We propose a new approach to VQEs using the principles of measurement-based quantum computation. This…
The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues and eigenvalues of a Hamiltonian. VQE has been proposed as an alternative to fully quantum algorithms such…
Self-testing results allow us to infer the underlying quantum mechanical description of states and measurements from classical outputs produced by non-communicating parties. The standard definition of self-testing does not apply in…
Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial…
The centipede game is a two-player non-zero-sum game. Each turn, a player can choose whether they want to take or pass a growing reward. The classical, rational solution of this game shows defection in the first round, when in reality,…
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U. It is a crucial stage for the running of quantum algorithms on noisy…
Variational quantum algorithms (VQAs) constitute a prominent framework for exploring the capabilities of near-term quantum computers. As the effectiveness of VQAs depends heavily on the design of variational quantum circuits, Quantum…
The noncooperative Nash equilibrium solution of classical games corresponds to a rational expectations attitude on the part of the players. However, in many cases, games played by human players have outcomes very different from Nash…
Quantum Game Theory provides us with new tools for practising games and some other risk related enterprices like, for example, gambling. The two party gambling protocol presented by Goldenberg {\it et al} is one of the simplest yet still…
This paper presents a new mathematical formalism that describes the quantization of games. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999.…
Computer-aided engineering techniques are indispensable in modern engineering developments. In particular, partial differential equations are commonly used to simulate the dynamics of physical phenomena, but very large systems are often…
A quantum board game is a multi-round protocol between a single quantum player against the quantum board. Molina and Watrous discovered quantum hedging. They gave an example for perfect quantum hedging: a board game with winning probability…
Quantum algorithms offer a compelling new avenue for addressing difficult NP-complete optimization problems, such as the Generalized Assignment Problem (GAP). Given the operational constraints of contemporary Noisy Intermediate-Scale…
Nonlocal games with advantageous quantum strategies give arguably the most fundamental demonstration of the power of quantum resources over their classical counterparts. Recently, certain multiplayer generalizations of nonlocal games have…
Quantum games have attracted much attention in recent years due to their ability to solve decision-making dilemmas. The aim of this study is to extend previous work on quantum games by introducing a Mathematica package QEGS (Quantum…
We propose a new algorithm for a broad class of periodic time-varying Stochastic Game-Theoretic Riccati Differential Equations arising in Zero-Sum Linear-Quadratic Stochastic Differential Games. The algorithm is constructed via dual-layer…
This paper presents a quantum search approach to combinatorial constraint satisfaction problems, demonstrated through the generation of magic squares. We reformulate magic square construction as a quantum search problem in which a…
We investigate quantum strategy in moving frames by considering Prisoner's Dilemma and propose four thresholds of $\gamma$ for two players to determine their \textit{Nash Equilibria}. Specially, an interesting phenomenon appears in…
We introduce a two-player nonlocal game, called the $(G,H)$-isomorphism game, where classical players can win with certainty if and only if the graphs $G$ and $H$ are isomorphic. We then define the notions of quantum and non-signalling…