The final chapter details some methods for evaluating the performance of quantum computers. It begins by delineating the essential features of quantum benchmarks and organizes them into a three-tiered framework. Initially, it discusses early-stage benchmarks that provide a detailed analysis of basic operations on a few qubits, emphasizing fidelity tests and tomography. Then, it progresses to intermediate-stage benchmarks that provide a more generalized appraisal of gate quality, circuit depth, and length. Concluding the benchmarking spectrum, later-stage benchmarks are introduced, aimed at evaluating the overall reliability and efficiency of quantum computers operating with a large number of qubits (e.g. 1000 or more).

This chapter covers:

1. • The academic disciplines that come together in the field of human–robot interaction (HRI);

2. • The barriers created by the disciplines’ different paradigms and how to work around these;

3. • The history and evolution of HRI as a science;

4. • Landmark robots in HRI history.

This chapter covers:

1. • The role of nonverbal communication in interactions between people—how communication is enhanced by facial expressions, hand gestures, body posture, and sounds;

2. • The importance of interpreting, using, and responding to nonverbal cues in the appropriate way, both to successful human– robot interactions and to generate a positive perception of robots;

3. • Nonverbal communication channels that are unique to robots, as well as channels that replicate those commonly used by humans;

4. • How robotic sounds, lights, and colors or physical gestures with arms, legs, tails, ears, and other body parts can be effective for communicating with people.

In this chapter, we show that under AD^+, the derived model of certain hod pairs satisfies the LSA. We also prove results that are important elsewhere. In particular, we show the derived model of an active \omega.2 lsa Woodin mouse satisfies LSA. This result will be important in Chapter 12, where we obtain the consistency of LSA from PFA.

This chapter presents a proof $\square_{\kappa,2}$ holds in a lsa-small hod mouse $\mathcal{P}$ for all cardinals $\kappa$ of $\mathcal{P}$. The proof adapts a well-known construction of $\square$ in extender models by Schimmerling-Zeman. The main challenge to overcome in this situation is that the full condensation lemma, which holds for extender models, does not hold in hod mice. The main application of this result is in the proof of consistency of LSA in Chapter 12.

This chapter develops the theory of condensing sets. Condensing sets give rise to iteration strategies with nice condensation properties. We show the existence of condensing sets under various hypotheses: AD^+ and PFA. We will use the existence of condensing sets in AD^+ in the proof of generation of pointclasses in Chapter 10. We will use the existence of condensing sets in Chapter 12 to construct a model of LSA under PFA.

This chapter is devoted to proving a comparison theorem for hod pairs. We will have two comparison theorems: one is useful in determinacy context while the other is useful in Core Model Induction applications.

This chapter gives various applications of the theory developed in the previous chapters. The first application is a proof of generation of mouse full pointclasses assuming Strong Mouse Capturing. The second application is a proof that Strong Mouse Capturing holds in the minimal model of LSA; so the Mouse Set Conjecture is true in all models of AD^+ up to the minimal model of LSA. The third application is a proof of consistency of LSA from the existence of a Woodin limit of Woodin cardinals.

This chapter analyzes HOD up to $\Theta$ in the minimal model of LSA under the assumption that Strong Mouse Capturing (SMC) holds.

This chapter covers:

1. • How a well-designed robot can lift interactions to the next level (physical design);

2. • How people do not treat robots as an assembly of plastic, electronics, and code but rather as humanlike entities (anthropomorphism);

3. • How HRI research draws on psychological theories, such as anthropomorphism, to design and study people’s interactions with robots;

4. • Design methods and prototyping tools used in human–robot interaction.

About this book; Christoph Bartneck; Tony Belpaeme; Friederike Eyssel; Takayuki Kanda; Merel Keijsers; Selma Šabanović; Notes on second edition

This chapter covers:

1. • The diverse areas of robot applications where human–robot interaction (HRI) is an important component;

2. • Applications beyond robots that are studied in a research context;

3. • Possible future applications;

4. • Potential problems that would need to be solved when HRI has a larger role in our society.

The main purpose of this chapter is to isolate the definition of short tree strategy mice. The main problem with defining this concept is the fact that it is possible that maximal iteration trees (which should not have branches indexed in the strategy predicate) may core down to short iteration trees (which must have branches indexed in the strategy predicate), thus causing indexing issues. To resolve this issue we will design an authentication procedure which will carefully choose iteration trees and index their branches. Thus, if some iteration tree doesn’t have a branch indexed in the strategy predicate then it is because the authentication procedure hasn’t yet found an authenticated branch, and therefore, such iteration trees cannot core down to an iteration tree whose branch is authenticated.

This chapter introduces the main concepts and the problems to be investigated by the book. In particular, the chapter defines the Largest Suslin Axiom (LSA) and the minimal model of LSA. The chapter summarizes the main theorems to be proved in the book: HOD of the minimal model of LSA satisfies the Generalized Continuum Hypothesis, the Mouse Set Conjecture holds in the minimal model of LSA, the consistency of LSA from large cardinals, the consistency of LSA from strong forcing axioms like PFA.