Quantum Computing Hardware

A rotated surface code of code distance d uses, for one logical qubit, d² physical data qubits and d² − 1 physical measurement qubits that check for errors. For d = 15, how many physical qubits does one logical qubit need?

  1. A29
  2. B225
  3. C449
Show answer and explanation

Answer: C. 449

There are 15² = 225 data qubits and 225 − 1 = 224 measurement qubits, a total of 2d² − 1 = 449. A code of distance d can correct up to (d − 1)/2 errors, so d = 15 can handle up to 7 errors. Estimates suggest that with physical error rates of about 0.1%, reaching the logical error rates needed for practical computations requires d of roughly 15 to 25, which means several hundred to about 1,500 physical qubits per logical qubit. Because the surface code works with operations only between neighboring qubits on a two-dimensional grid, it suits superconducting qubit chips well.

  • A. This is 2d − 1. The number of qubits in a surface code grows in proportion to the square of d.
  • B. This counts only the d² data qubits and leaves out the measurement qubits.
  • C. Correct. 225 + 224 = 449.
Practice this topic Back to topic

Books on Quantum Computing Hardware Ad

As an Amazon Associate I earn from qualifying purchases.

More Quantum Computing Hardware questions

  1. Suppose the logical error rate p_L of a surface code can be approximated as p_L ∝ (p/p_th)^((d+1)/2), using the physical error rate p, the threshold p_th and the code distance d. With p = 0.1% and p_th = 1%, which is closest to the ratio of logical error rates when d is increased from 5 to 9 (the value at d = 5 divided by the value at d = 9)?
  2. Which correctly describes the kind of quantum computer called NISQ?
  3. When searching 1 million items in no particular order for the one item that meets a condition, which is closest to the order of the number of queries (oracle calls) needed by Grover's algorithm?
  4. Once large fault-tolerant quantum computers are built, which ciphers are expected to have their security seriously undermined by Shor's algorithm?
  5. Which is the most appropriate main reason why quantum computers as of the mid-2020s cannot break RSA-2048 with Shor's algorithm?