Quantum circuit
Builds on Quantum logic gateQubitTensor product of Hilbert spacesBoolean circuit
Definition
Let and let be a set of quantum logic gates, called the gate set. A quantum circuit on qubits over is a finite sequence with the following properties.
- Each is a -qubit gate in , with .
- Each is a -tuple of distinct indices in .
Let be the operator on obtained by applying to the qubits . The circuit implements the unitary operator . The number is the size of the circuit.
Remarks
Example: let and the circuit be , with the Hadamard gate. Then , a Bell state.
Non-example: the sequence is not a circuit, because the indices in are not distinct; a gate cannot act twice on the same qubit at once.
The depth is the least number of layers into which the sequence can be cut, in order, such that the gates in one layer act on disjoint qubits. Many authors also allow measurements and classical control inside a circuit; by the principle of deferred measurement, these can be moved to the end at small cost.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Boolean circuit concept
- Quantum logic gate concept
- Qubit concept
- Tensor product of Hilbert spaces concept
- Quantum circuit definition
Further reading
About this page
| Tag | CP0JWNNWXG |
|---|---|
| URI | m2://CP0JWNNWXG |
| Kind | definition |
| Writing | W0 stub |
| MSC | 81P68, 68Q12, 81P65 |
| Defines | Quantum circuit |
| Uses | Quantum logic gate, Qubit, Tensor product of Hilbert spaces, Boolean circuit |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.