Related papers: Subgame perfect implementation: A new result
The breaking of supersymmetry due to singular potentials in supersymmetric quantum mechanics is critically analyzed. It is shown that, when properly regularized, these potentials respect supersymmetry, even when the regularization parameter…
Quantum key distribution is among the foremost applications of quantum mechanics, both in terms of fundamental physics and as a technology on the brink of commercial deployment. Starting from principal schemes and initial proofs of…
There are many striking phenomena which are attributed to ``quantum coherence''. It is natural to wonder if there are new quantum coherence effects waiting to be discovered which could lead to interesting results and perhaps even practical…
A systematic theory is introduced that describes stochastic effects in game theory. In a biological context, such effects are relevant for the evolution of finite populations with frequency-dependent selection. They are characterized by…
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper is devoted to the analysis of interference of quantum strategies in quantum market games.
Recent advancements in quantum computing are leading to an era of practical utility, enabling the tackling of increasingly complex problems. The goal of this era is to leverage quantum computing to solve real-world problems in fields such…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier…
We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, yielding an outcome of either 'win' or 'lose'. Molina and…
We provide a complete structural characterization of perfect quantum strategies for arbitrary quantum magic rectangle games. We derive necessary and sufficient conditions that jointly constrain the shared state and measurement operators,…
The unavoidable finite time intervals between the sequential operations needed for performing practical quantum computing can degrade the performance of quantum computers. During these delays, unwanted relative dynamical phases are produced…
We present a detailed account of quantum state estimation by joint maximization of the likelihood and the entropy. After establishing the algorithms for both perfect and imperfect measurements, we apply the procedure to data from simulated…
We consider the problem of a state determination for a two-level quantum system which can be in one of two nonorthogonal mixed states. It is proved that for the two independent identical systems the optimal combined measurement (which…
A key issue of current quantum advantage experiments is that their verification requires a full classical simulation of the ideal computation. This limits the regime in which the experiments can be verified to precisely the regime in which…
Effects of quantum and classical correlations on game theory are studied to clarify the new aspects brought into game theory by the quantum mechanical toolbox. In this study, we compare quantum correlation represented by a maximally…
In this paper, we have considered the problem of general conclusive quantum state classification; the necessary and sufficient conditions for the existence of conclusive classification strategies have also been presented. Moreover, we have…
The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is…
We suggest an interpretation of quantum mechanics, inspired by the ideas of Aharonov et al. of a time-symmetric description of quantum theory. We show that a special final boundary condition for the Universe, may be consistently defined as…
We consider a constructive modification of quantum-mechanical formalism. Replacement of a general unitary group by unitary representations of finite groups makes it possible to reproduce quantum formalism without loss of its empirical…