Related papers: Game-theoretic discussion of quantum state estimat…
We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not…
We derive a tight upper bound for the fidelity of a universal N to M qubit cloner, valid for any M \geq N, where the output of the cloner is required to be supported on the symmetric subspace. Our proof is based on the concatenation of two…
Recently, a standardized framework was proposed for introducing quantum-inspired moves in mathematical games with perfect information and no chance. The beauty of quantum games-succinct in representation, rich in structures, explosive in…
This paper gives a survey about quantum estimation. We also describes the relation between the quantum central limit theorem and the asymptotic bound of mean square error in quantum state estimation.
The inherent limitations of physical processes prevent the copying of arbitrary quantum states. Furthermore, even if we only aim to clone two distinct quantum states, it remains impossible unless they are mutually orthogonal. To overcome…
Recently Marinatto and Weber introduced an interesting new scheme for quantizing games, and applied their scheme to the famous game 'Battle of the Sexes'. In this Comment we make two observations: (a) the overall quantization scheme is…
We review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum…
These lecture notes attempt a mathematical treatment of game theory akin to mathematical physics. A game instance is defined as a sequence of states of an underlying system. This viewpoint unifies classical mathematical models for 2-person…
In this research article, we survey existing quantum physics-related games and, based on this survey, propose a definition for the concept of quantum games. We define a quantum game as any type of rule-based game that either employs the…
A simple and general formulation of the quantum game theory is presented, accommodating all possible strategies in the Hilbert space for the first time. The theory is solvable for the two strategy quantum game, which is shown to be…
We compare two different ways of quantization a simple sequential game Cat's Dilemma in the context of the debate on intransitive and transitive preferences. This kind of analysis can have essential meaning for the research on the…
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum information with one or more other parties. In particular, we focus…
An interaction system has a finite set of agents that interact pairwise, depending on the current state of the system. Symmetric decomposition of the matrix of interaction coefficients yields the representation of states by self-adjoint…
We consider the problem of determining the state of a quantum system given one or more readings of the expectation value of an observable. The system is assumed to be a finite dimensional quantum control system for which we can influence…
An attempt is made to formulate quantum mechanics (QM) in physical rather than in mathematical terms. It is argued that the appropriate conceptual framework for QM is "contextual objectivity", which includes an objective definition of the…
The mu-calculus is a powerful tool for specifying and verifying transition systems, including those with both demonic and angelic choice; its quantitative generalisation qMu extends that to probabilistic choice. We show that for a…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
The task of reception of a copy of an arbitrary quantum state with use of a minimum quantity of quantum operations is considered.
While the no-cloning theorem forbids the perfect replication of quantum information, it is sometimes possible to produce large numbers of replicas with vanishingly small error. This phenomenon, known as quantum superreplication, can take…
Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…