Skip to content

Commit 6901e12

Browse files
authored
Typo in clifford simulation demo (#1547)
This pull request contains a typo fix for the Clifford circuit simulation tutorial. **Fix:** * Fixed a typo in the description of the Clifford + T gate set in `demo.py` by changing "S,`" to "S``,", ensuring consistent punctuation and improved readability. **Metadata update:** * Updated the `dateOfLastModification` field in `metadata.json` to reflect the most recent change. From original PR here #1359
1 parent ef2b15b commit 6901e12

2 files changed

Lines changed: 2 additions & 2 deletions

File tree

demonstrations_v2/tutorial_clifford_circuit_simulations/demo.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@
2222
``{AND, NOT, OR}`` that can be used to perform any boolean function. A similar analogue
2323
in quantum computation is to have a set of quantum gates that can approximate any unitary
2424
transformation up to the desired accuracy. One such universal quantum gate set is the
25-
:math:`\textrm{Clifford + T}` set, ``{H, S, CNOT, T}``, where the gates ``H``, ``S`,` and
25+
:math:`\textrm{Clifford + T}` set, ``{H, S, CNOT, T}``, where the gates ``H``, ``S``, and
2626
``CNOT`` are the generators of the *Clifford group*. The elements of this group are
2727
called *Clifford gates*, which transform *Pauli* words to *Pauli* words under
2828
`conjugation <https://mathworld.wolfram.com/Conjugation.html>`__. This means an

demonstrations_v2/tutorial_clifford_circuit_simulations/metadata.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
"executable_stable": true,
99
"executable_latest": true,
1010
"dateOfPublication": "2024-04-12T00:00:00+00:00",
11-
"dateOfLastModification": "2025-09-09T17:41:50+00:00",
11+
"dateOfLastModification": "2025-09-16T17:41:50+00:00",
1212
"categories": [
1313
"Devices and Performance"
1414
],

0 commit comments

Comments
 (0)