SECTION 5 · CHECK YOUR UNDERSTANDING

From a circuit to a distributed computation: quiz

Choose one answer for each of the 20 questions. You need at least 16 correct answers to pass.

← Revisit the lesson
You’re viewing a quiz preview.

Sign in to submit answers, receive explanations and save your progress.

0 of 20 answered
1. What does qubit placement specify?
2. Which situation requires a remote two-qubit operation?
3. In our round-trip strategy, what happens immediately after a is successfully teleported to B?
4. What are the teleportation resources for one outward-and-return transfer in the taught ideal strategy?
5. Why should the round-trip cost not be quoted as the cost of every remote gate?
6. After teleporting a's state, what happens to its circuit label?
7. a interacts six times with b and once with c. What is a reasonable first placement to investigate?
8. What is a scheduler's main task?
9. When may two independent operations run at the same time?
10. Why can a probabilistic entanglement link affect the schedule?
11. Why might generating every Bell pair far in advance be a poor plan?
12. Which belongs in communication overhead?
13. What can be inferred merely from doubling the number of modules?
14. Which service illustrates independent jobs rather than one networked quantum computation?
15. In the example, three gates each use a separate outward-and-return journey. How many Bell pairs are consumed?
16. In the example, a travels to B once, participates in three gates and returns once. How many correction bits are sent?
17. What condition makes keeping a at B across several gates valid?
18. What happens if the local gate at B entangles the states labelled a and b before a returns?
19. What comparison best supports a claim that one distributed plan is better?
20. Does a local gate automatically require no routing or extra work?
Sign in to take the quiz

Untimed · Unlimited retakes · Your best score counts toward completion