Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

(b) Write out the equations for the time dependence of ρ11, ρ22, ρ12 and ρ21 assuming that a light field interaction V = -μ12Ee iωt + c.c. couples only levels |1> and |2>, and that the excited levels exhibit spontaneous decay. (8 marks) (c) Under steady-state conditions, find the ratio of populations in states |2> and |3>. (3 marks) (d) Find the slowly varying amplitude ̃ ρ 12 of the polarization ρ12 = ̃ ρ 12e iωt . (6 marks) (e) In the limiting case that no decay is possible from intermediate level |3>, what is the ground state population ρ11(∞)? (2 marks) 2. (15 marks total) In a 2-level atom system subjected to a strong field, dressed states are created in the form |D1(n)> = sin θ |1,n> + cos θ |2,n-1> |D2(n)> = cos θ |1,n> sin θ |2,n-1>

The Quantum Theory of Light

Universal logic gates for two quantum bits (qubits) form an essential ingredient of quantum computation. Dynamical gates have been proposed in the context of trapped ions; however, geometric phase gates (which change only the phase of the physical qubits) offer potential practical advantages because they have higher intrinsic resistance to certain small errors and might enable faster gate implementation. Here we demonstrate a universal geometric pi-phase gate between two beryllium ion-qubits, based on coherent displacements induced by an optical dipole force. The displacements depend on the internal atomic states; the motional state of the ions is unimportant provided that they remain in the regime in which the force can be considered constant over the extent of each ion's wave packet. By combining the gate with single-qubit rotations, we have prepared ions in an entangled Bell state with 97% fidelity-about six times better than in a previous experiment demonstrating a universal gate between two ion-qubits. The particular properties of the gate make it attractive for a multiplexed trap architecture that would enable scaling to large numbers of ion-qubits.

Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate*

Adiabatic evolution along the instantaneous eigenstate of a time-dependent Hamiltonian is used for robust and high fidelity state transfer in atomic and molecular physics. Shortcuts to adiabaticity (STA) are systematic approaches to accomplish the same final state transfer in a faster manner. This article presents an introduction to STA and reviews different theoretical approaches and applications of STA to a range of scientific and engineering tasks in quantum physics and beyond.

/pdf/shortcuts-to-adiabaticity-concepts-methods-and-applications-24er71w4ai.pdf

Shortcuts to adiabaticity: Concepts, methods, and applications

Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

/pdf/digitized-adiabatic-quantum-computing-with-a-superconducting-2nhmfcnqj4.pdf

Digitized adiabatic quantum computing with a superconducting circuit, part I: Theory

Recently, a genuine four-qubit entangled state ${\ensuremath{\mid}{\ensuremath{\chi}}^{00}⟩}_{3214}$ has been proposed [Y. Yeo and W. K. Chua, Phys. Rev. Lett. 96, 060502 (2006)]. This state has many interesting entanglement properties and possible applications in quantum information processing and fundamental tests of quantum physics. Here we present a simple scheme for generating such a state in an ion-trap system. We also demonstrate how to discriminate between the 16 basis states ${{\ensuremath{\mid}{\ensuremath{\chi}}^{ij}⟩}_{3214}={\ensuremath{\sigma}}_{3}^{i}{\ensuremath{\sigma}}_{1}^{j}{\ensuremath{\mid}{\ensuremath{\chi}}^{00}⟩}_{3214},i,j=0,1,2,3}$.

Generation and discrimination of a type of four-partite entangled state

This study proposes the first high-capacity quantum secure direct communication (QSDC) with two-photon six-qubit hyper-entangled Bell states in two longitudinal momentum and polarization degrees of freedom (DOFs) of photon pairs, which can be generated using two 0.5 mm-thick type-I β barium borate crystal slabs aligned one behind the other and an eight-hole screen. The secret message can be independently encoded on the photon pairs with 64 unitary operations in all three DOFs. This protocol has a higher capacity than previous QSDC protocols because each photon pair can carry 6 bits of information, not just 2 or 4 bits. Our QSDC protocol decreases the influence of decoherence from environment noise by exploiting the decoy photons to check the security of the transmission of the first photon sequence. Compared with two-way QSDC protocols, our QSDC protocol is immune to an attack by an eavesdropper using Trojan horse attack strategies because it is a one-way quantum communication. The QSDC protocol has good applications in the future quantum communication because of all these features.

High-capacity quantum secure direct communication with two-photon six-qubit hyperentangled states

We propose a heralded quantum repeater protocol based on the general interface between the circularly polarized photon and the quantum dot embedded in a double-sided optical microcavity. Our effective time-bin encoding on photons results in the deterministic faithful entanglement distribution with one optical fiber for the transmission of each photon in our protocol, not two or more. Our efficient parity-check detector implemented with only one input-output process of a single photon as a result of cavity quantum electrodynamics makes the entanglement channel extension and entanglement purification in quantum repeater far more efficient than others, and it has the potential application in fault-tolerant quantum computation as well. Meanwhile, the deviation from a collective-noise channel leads to some phase-flip errors on the nonlocal electron spins shared by the parties and these errors can be depressed by our simplified entanglement purification process. Finally, we discuss the performance of our proposal, concluding that it is feasible with current technology.

Guo-Jian Yang

Papers

Generation and discrimination of a type of four-partite entangled state

High-capacity quantum secure direct communication with two-photon six-qubit hyperentangled states

Heralded quantum repeater for a quantum communication network based on quantum dots embedded in optical microcavities

Hybrid economical telecloning of equatorial qubits and generation of multipartite entanglement

Magnetoresistance effect in a both magnetically and electrically modulated nanostructure