At qubits, with the gate set used in the counting argument, each gate position has…

PHYSICS · Subjective · Fermi University Physics · Quantum Information & Technology · The quantum circuit model and quantum algorithms · The quantum circuit model and quantum algorithms

Quantum Information and Technology, Ch The quantum circuit model

Problem

At n=20n=20 qubits, with the gate set {H,T,CNOT}\{H,T,\mathrm{CNOT}\} used in the counting argument, each gate position has n(n+1)n(n+1) choices (an HH or a TT on any of the nn wires, or a CNOT\mathrm{CNOT} on any ordered pair of the nn wires). Using the same reasoning as the n=10n=10 estimate already worked, estimate the smallest circuit size GG such that circuits of size GG could possibly reach even one per cent of the states of the 2020-qubit sphere to accuracy 0.10.1.

Browse the problem library