Quantum Circuit Model
The quantum circuit model describes computation as a sequence of unitary gates on qubit wires, starting from an initial state and ending with measurements; its cost is gate count and depth.
In the Circuit Model, each qubit is a horizontal wire read from left to right, gates are boxes on the wires, multi-qubit gates connect more than one wire, and measurement is drawn as a meter that passes the result to a classical bit. The default initialisation is $|0\rangle^{\otimes n}$. Deutsch (1985) proposed the model of the universal quantum computer, and the circuit model is today the standard framework; it is equivalent in computational power to other models such as adiabatic computation.
Cost measures: the gate count; the Depth, i.e. the longest chain of consecutive gates that cannot be executed in parallel; and the number of two-qubit gates, since these are the most error-prone on hardware. Mathematically, a circuit that applies $U_1$ and then $U_2$ is represented by $U_2U_1$.
Circuits are written in languages such as OpenQASM 2.0 and 3.0, and with libraries such as Qiskit. The lab exports a circuit to OpenQASM 2.0 and 3.0 and to Qiskit code. On real hardware the circuit goes through Transpilation, which maps it to the native gates and the qubit connectivity, and this usually increases the depth.
Mathematical formula
Worked example
A Bell-state circuit in OpenQASM 2.0:
```
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
creg c[2];
h q[0];
cx q[0],q[1];
measure q[0] -> c[0];
measure q[1] -> c[1];
```
Gate count 2, depth before measurement 2, and one two-qubit gate. The overall matrix is $\mathrm{CX}_{0\to1}(I\otimes H)$ in Qiskit ordering.
Test your understanding
The quiz needs JavaScript.
Related topics
References
- Michael A. Nielsen; Isaac L. Chuang (2010). Quantum Computation and Quantum Information (10th Anniversary Edition). Cambridge University Press doi:10.1017/CBO9780511976667The standard reference for quantum computing; the Crossref record gives 2012 for the Cambridge Core online edition.
- Andrew W. Cross; Lev S. Bishop; John A. Smolin; Jay M. Gambetta (2017). Open Quantum Assembly Language. arXiv:1707.03429 doi:10.48550/arXiv.1707.03429
- David Deutsch (1985). Quantum theory, the Church–Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400(1818):97–117 doi:10.1098/rspa.1985.0070
