Related papers: Experimental realization of a quantum game on a on…
Gate-model quantum computers provide an experimentally implementable architecture for near term quantum computations. To design a reduced quantum circuit that can simulate a high complexity reference quantum circuit, an optimization should…
A Quantum Computer is a new type of computer which can efficiently solve complex problems such as prime factorization. A quantum computer threatens the security of public key encryption systems because these systems rely on the fact that…
We consider an application of the mathematical formalism of quantum mechanics (QM) outside physics, namely, to game theory. We present a simple game between macroscopic players, say Alice and Bob (or in a more complex form - Alice, Bob and…
Quantum computing is experiencing the transition from a scientific to an engineering field with the promise to revolutionize an extensive range of applications demanding high-performance computing. Many implementation approaches have been…
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…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
Over the last twenty years of research on quantum game theory have given us many ideas of how quantum games could be played. One of the most prominent ideas in the field is a model of quantum playing a 2x2 game introduced by J. Eisert, M.…
We show that quantum game theory offers solution to the famous Newcomb's paradox (free will problem). Divine foreknowledge is not necessary for successful completion of the game because quantum theory offers a way to discern human…
We introduce the "quantum circuit daemon" (QC-Daemon), a reinforcement learning agent for compiling quantum device operations aimed at efficient quantum hardware execution. We apply QC-Daemon to the move synthesis problem called the Atom…
Recently, it is shown that quantum computers can be used for obtaining certain information about the solution of a linear system Ax=b exponentially faster than what is possible with classical computation. Here we first review some key…
In this paper, we present the experimental realization of multi-qubit gates $% \Lambda_n(not) $ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the…
We present the first full experimental quantum tomographic characterization of a single-qubit device achieved with a single entangled input state. The entangled input state plays the role of all possible input states in quantum parallel on…
We report the first simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain in which selective excitations of spins is provided by the gradient of the external magnetic field…
Universal control of quantum systems is a major goal to be achieved for quantum information processing, which demands thorough understanding of fundamental quantum mechanics and promises applications of quantum technologies. So far, most…
Concepts on quantum physics are generally difficult for the general public to understand and grasp due to its counter-intuitive nature and requirement for higher level of mathematical literacy. With categorical quantum mechanics (CQM),…
Accurate simulation of dynamical processes in molecules and reactions is among the most challenging problems in quantum chemistry. Quantum computers promise efficient chemical simulation, but the existing quantum algorithms require many…
Quantum computers hold promise to enable efficient simulations of the properties of molecules and materials; however, at present they only permit ab initio calculations of a few atoms, due to a limited number of qubits. In order to harness…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
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,…
We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection of measurement operators such that (i) the probability of…