Skip to content

Commit

Permalink
Typos flagged by the IBM Quantum Platform automatic spellchecker (Qis…
Browse files Browse the repository at this point in the history
…kit#10711)

* typo

* typos

* typos

* typo

* typo

* typo

* typo

* typos

* typos

* typo

* typo

* typos

* typos

* typo

* typo

* typo

* typo

* typo

* typo

* typo

* typo

* typo

* typo

* typo

* typos

* typo

* typo

* typo

* typo

* typo

* typo

* rst!!!!!

Co-authored-by: Jake Lishman <[email protected]>

---------

Co-authored-by: Jake Lishman <[email protected]>
  • Loading branch information
abbycross and jakelishman authored Aug 26, 2023
1 parent 021b0ff commit cb4da68
Show file tree
Hide file tree
Showing 36 changed files with 55 additions and 55 deletions.
6 changes: 3 additions & 3 deletions docs/configuration.rst
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ For example:
num_processes = 15
By default this file lives in ``~/.qiskit/settings.conf`` but the path used
can be overriden with the ``QISKIT_SETTINGS`` environment variable. If
can be overridden with the ``QISKIT_SETTINGS`` environment variable. If
``QISKIT_SETTINGS`` is set its value will used as the path to the user config
file.

Expand Down Expand Up @@ -61,12 +61,12 @@ Available options:
`Python multiprocessing <https://docs.python.org/3/library/multiprocessing.html>`__
is enabled for operations that support running in parallel (for example
transpilation of multiple :class:`~qiskit.circuit.QuantumCircuit` objects).
The default setting in the user config file can be overriden by
The default setting in the user config file can be overridden by
the ``QISKIT_PARALLEL`` environment variable.
* ``num_processes``: This option takes an integer value (> 0) that is used
to specify the maximum number of parallel processes to launch for parallel
operations if parallel execution is enabled. The default setting in the
user config file can be overriden by the ``QISKIT_NUM_PROCS`` environment
user config file can be overridden by the ``QISKIT_NUM_PROCS`` environment
variable.

Environment Variables
Expand Down
2 changes: 1 addition & 1 deletion docs/release_notes.rst
Original file line number Diff line number Diff line change
Expand Up @@ -28253,7 +28253,7 @@ New Features
for users who are only running qiskit-terra (or just not qiskit-aer and/or
qiskit-ibmq-provider) and the warnings are not an indication of a potential
packaging problem. If the user config file is set to disable the warnings
this can be overriden by setting the ``QISKIT_SUPPRESS_PACKAGING_WARNINGS``
this can be overridden by setting the ``QISKIT_SUPPRESS_PACKAGING_WARNINGS``
to ``N`` or ``n``

- :func:`qiskit.compiler.transpile()` has two new kwargs, ``layout_method``
Expand Down
2 changes: 1 addition & 1 deletion qiskit/circuit/controlflow/if_else.py
Original file line number Diff line number Diff line change
Expand Up @@ -148,7 +148,7 @@ def replace_blocks(self, blocks: Iterable[QuantumCircuit]) -> "IfElseOp":
Args:
blocks: Iterable of circuits for "if" and "else" condition. If there is no "else"
circuit it may be set to None or ommited.
circuit it may be set to None or omitted.
Returns:
New IfElseOp with replaced blocks.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -160,7 +160,7 @@ def __init__(
def _parameter_generator(
self, rep: int, block: int, indices: List[int]
) -> Optional[List[Parameter]]:
"""If certain blocks should use certain parameters this method can be overriden."""
"""If certain blocks should use certain parameters this method can be overridden."""
params = [self.ordered_parameters[i] for i in indices]
return params

Expand Down
2 changes: 1 addition & 1 deletion qiskit/circuit/library/n_local/n_local.py
Original file line number Diff line number Diff line change
Expand Up @@ -961,7 +961,7 @@ def _build(self) -> None:

# pylint: disable=unused-argument
def _parameter_generator(self, rep: int, block: int, indices: list[int]) -> Parameter | None:
"""If certain blocks should use certain parameters this method can be overriden."""
"""If certain blocks should use certain parameters this method can be overridden."""
return None


Expand Down
2 changes: 1 addition & 1 deletion qiskit/circuit/parametertable.py
Original file line number Diff line number Diff line change
Expand Up @@ -18,7 +18,7 @@
class ParameterReferences(MutableSet):
"""A set of instruction parameter slot references.
Items are expected in the form ``(instruction, param_index)``. Membership
testing is overriden such that items that are otherwise value-wise equal
testing is overridden such that items that are otherwise value-wise equal
are still considered distinct if their ``instruction``\\ s are referentially
distinct.
"""
Expand Down
4 changes: 2 additions & 2 deletions qiskit/circuit/quantumcircuit.py
Original file line number Diff line number Diff line change
Expand Up @@ -352,7 +352,7 @@ def from_instructions(

@property
def layout(self) -> Optional[TranspileLayout]:
r"""Return any associated layout information anout the circuit
r"""Return any associated layout information about the circuit
This attribute contains an optional :class:`~.TranspileLayout`
object. This is typically set on the output from :func:`~.transpile`
Expand Down Expand Up @@ -2591,7 +2591,7 @@ def parameters(self) -> ParameterView:
>>> circuit.parameters # sorted alphabetically!
ParameterView([Parameter(a), Parameter(b), Parameter(elephant)])
Bear in mind that alphabetical sorting might be unituitive when it comes to numbers.
Bear in mind that alphabetical sorting might be unintuitive when it comes to numbers.
The literal "10" comes before "2" in strict alphabetical sorting.
.. code-block:: python
Expand Down
2 changes: 1 addition & 1 deletion qiskit/dagcircuit/dagcircuit.py
Original file line number Diff line number Diff line change
Expand Up @@ -914,7 +914,7 @@ def size(self, *, recurse: bool = False):

def depth(self, *, recurse: bool = False):
"""Return the circuit depth. If there is control flow present, this count may only be an
estimate, as the complete control-flow path cannot be staticly known.
estimate, as the complete control-flow path cannot be statically known.
Args:
recurse: if ``True``, then recurse into control-flow operations. For loops
Expand Down
2 changes: 1 addition & 1 deletion qiskit/primitives/backend_estimator.py
Original file line number Diff line number Diff line change
Expand Up @@ -108,7 +108,7 @@ def __init__(
bound_pass_manager: PassManager | None = None,
skip_transpilation: bool = False,
):
"""Initalize a new BackendEstimator instance
"""Initialize a new BackendEstimator instance
Args:
backend: Required: the backend to run the primitive on
Expand Down
2 changes: 1 addition & 1 deletion qiskit/providers/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -626,7 +626,7 @@ def status(self):
the :mod:`qiskit.primitives` module is to explicitly enable this as the
primitive objects are higher level abstractions to produce processed higher
level outputs (such as probability distributions and expectation values)
that abstract away the mechanics of getting the best result efficienctly, to
that abstract away the mechanics of getting the best result efficiently, to
concentrate on higher level applications using these outputs.
For example, if your backends were well suited to leverage
Expand Down
4 changes: 2 additions & 2 deletions qiskit/providers/options.py
Original file line number Diff line number Diff line change
Expand Up @@ -48,7 +48,7 @@ class Options(Mapping):
Runtime validators can be registered. See `set_validator`.
Updates through `update_options` and indexing (`__setitem__`) validate
the new value before peforming the update and raise `ValueError` if
the new value before performing the update and raise `ValueError` if
the new value is invalid.
>>> options.set_validator("opt1", (1, 5))
Expand Down Expand Up @@ -191,7 +191,7 @@ def set_validator(self, field, validator_value):
In this case whenever the ``"shots"`` option is updated by the user
it will enforce that the value is >=1 and <=4096. A ``ValueError`` will
be raised if it's outside those bounds. If a validator is already present
for the specified field it will be silently overriden.
for the specified field it will be silently overridden.
Args:
field (str): The field name to set the validator on
Expand Down
8 changes: 4 additions & 4 deletions qiskit/qasm2/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -280,10 +280,10 @@ def from_qasm_str(qasm_str: str):
The four-parameter version of a controlled-:math:`U`, corresponding to :class:`.CUGate`.
``rxx(theta) a, b``
Two-qubit rotation arond the :math:`XX` axis, corresponding to :class:`.RXXGate`.
Two-qubit rotation around the :math:`XX` axis, corresponding to :class:`.RXXGate`.
``rzz(theta) a, b``
Two-qubit rotation arond the :math:`ZZ` axis, corresponding to :class:`.RZZGate`.
Two-qubit rotation around the :math:`ZZ` axis, corresponding to :class:`.RZZGate`.
``rccx a, b, c``
The double-controlled :math:`X` gate, but with relative phase differences over the standard
Expand Down Expand Up @@ -442,7 +442,7 @@ def loads(
Args:
string: The OpenQASM 2 program in a string.
include_path: order of directories to search when evluating ``include`` statements.
include_path: order of directories to search when evaluating ``include`` statements.
custom_instructions: any custom constructors that should be used for specific gates or
opaque instructions during circuit construction. See :ref:`qasm2-custom-instructions`
for more.
Expand Down Expand Up @@ -483,7 +483,7 @@ def load(
Args:
filename: The OpenQASM 2 program in a string.
include_path: order of directories to search when evluating ``include`` statements.
include_path: order of directories to search when evaluating ``include`` statements.
include_input_directory: Whether to add the directory of the input file to the
``include_path``, and if so, whether to *append* it to search last, or *prepend* it to
search first. Pass ``None`` to suppress adding this directory entirely.
Expand Down
12 changes: 6 additions & 6 deletions qiskit/qpy/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -134,7 +134,7 @@
Version 9
=========
Version 9 addds support for classical :class:`~.expr.Expr` nodes and their associated
Version 9 adds support for classical :class:`~.expr.Expr` nodes and their associated
:class:`~.types.Type`\\ s.
Expand Down Expand Up @@ -321,7 +321,7 @@
bytes for a ``utf8`` encoded string for the register name.
Following the initial layout there is ``input_mapping_size`` array of
``uint32_t`` integers representing the positions of the phyiscal bit from the
``uint32_t`` integers representing the positions of the physical bit from the
initial layout. This enables constructing a list of virtual bits where the
array index is its input mapping position.
Expand Down Expand Up @@ -497,7 +497,7 @@
- ``s``: :class:`~.AlignSequential`
- ``e``: :class:`~.AlignEquispaced`
Note that :class:`~.AlignFunc` context is not supported becasue of the callback function
Note that :class:`~.AlignFunc` context is not supported because of the callback function
stored in the context parameters.
.. _qpy_schedule_instructions:
Expand All @@ -511,7 +511,7 @@
followed by the :ref:`qpy_sequence` block representing the instruction
:attr:`~qiskit.pulse.instructions.Instruction.operands`.
Note that the data structure of pulse :class:`~qiskit.pulse.instructions.Instruction`
is unified so that instance can be uniquely determied by the class and a tuple of operands.
is unified so that instance can be uniquely determined by the class and a tuple of operands.
The mapping of type char to the instruction subclass is defined as follows:
- ``a``: :class:`~qiskit.pulse.instructions.Acquire` instruction
Expand Down Expand Up @@ -667,7 +667,7 @@
the gate name, ``num_qubits`` length of integers representing a sequence of qubits,
and ``num_params`` length of INSTRUCTION_PARAM payload for parameters
associated to the custom instruction.
The ``type`` indicates the class of pulse program which is either, in pricinple,
The ``type`` indicates the class of pulse program which is either, in principle,
:class:`~.ScheduleBlock` or :class:`~.Schedule`. As of QPY Version 5,
only :class:`~.ScheduleBlock` payload is supported.
Finally, :ref:`qpy_schedule_block` payload is packed for each CALIBRATION_DEF entry.
Expand Down Expand Up @@ -791,7 +791,7 @@
SEQUENCE
--------
A SEQUENCE is a reprentation of a arbitrary sequence object. As sequence are just fixed length
A SEQUENCE is a representation of an arbitrary sequence object. As sequence are just fixed length
containers of arbitrary python objects their QPY can't fully represent any sequence,
but as long as the contents in a sequence are other QPY serializable types for
the INSTRUCTION_PARAM payload the ``sequence`` object can be serialized.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/quantum_info/operators/custom_iterator.py
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ def __init__(self, obj):
@abstractmethod
def __getitem__(self, key):
"""Get next item"""
# This method should be overriden for lazy conversion of
# This method should be overridden for lazy conversion of
# iterator only at a given key value
pass

Expand Down
8 changes: 4 additions & 4 deletions qiskit/quantum_info/operators/symplectic/clifford.py
Original file line number Diff line number Diff line change
Expand Up @@ -385,7 +385,7 @@ def destab_z(self, value):

@property
def destab_phase(self):
"""Return phase of destaibilizer with boolean representation."""
"""Return phase of destabilizer with boolean representation."""
return self.tableau[: self.num_qubits, -1]

@destab_phase.setter
Expand Down Expand Up @@ -421,7 +421,7 @@ def stab_z(self, value):

@property
def stab_phase(self):
"""Return phase of stablizer with boolean representation."""
"""Return phase of stabilizer with boolean representation."""
return self.tableau[self.num_qubits :, -1]

@stab_phase.setter
Expand Down Expand Up @@ -874,8 +874,8 @@ def to_labels(self, array: bool = False, mode: Literal["S", "D", "B"] = "B"):
Args:
array (bool): return a Numpy array if True, otherwise
return a list (Default: False).
mode (Literal["S", "D", "B"]): return both stabilizer and destablizer if "B",
return only stabilizer if "S" and return only destablizer if "D".
mode (Literal["S", "D", "B"]): return both stabilizer and destabilizer if "B",
return only stabilizer if "S" and return only destabilizer if "D".
Returns:
list or array: The rows of the StabilizerTable in label form.
Expand Down
4 changes: 2 additions & 2 deletions qiskit/quantum_info/states/stabilizerstate.py
Original file line number Diff line number Diff line change
Expand Up @@ -151,7 +151,7 @@ def conjugate(self):
return ret

def tensor(self, other: StabilizerState) -> StabilizerState:
"""Return the tensor product stabilzier state self ⊗ other.
"""Return the tensor product stabilizer state self ⊗ other.
Args:
other (StabilizerState): a stabilizer state object.
Expand All @@ -169,7 +169,7 @@ def tensor(self, other: StabilizerState) -> StabilizerState:
return ret

def expand(self, other: StabilizerState) -> StabilizerState:
"""Return the tensor product stabilzier state other ⊗ self.
"""Return the tensor product stabilizer state other ⊗ self.
Args:
other (StabilizerState): a stabilizer state object.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/quantum_info/synthesis/two_qubit_decompose.py
Original file line number Diff line number Diff line change
Expand Up @@ -393,7 +393,7 @@ def circuit(
def _weyl_gate(self, simplify, circ: QuantumCircuit, atol):
"""Appends Ud(a, b, c) to the circuit.
Can be overriden in subclasses for special cases"""
Can be overridden in subclasses for special cases"""
if not simplify or abs(self.a) > atol:
circ.rxx(-self.a * 2, 0, 1)
if not simplify or abs(self.b) > atol:
Expand Down
2 changes: 1 addition & 1 deletion qiskit/result/mitigation/base_readout_mitigator.py
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,7 @@ def quasi_probabilities(
be calculated as the sum of all counts.
Returns:
QuasiDistibution: A dictionary containing pairs of [output, mean] where "output"
QuasiDistribution: A dictionary containing pairs of [output, mean] where "output"
is the key in the dictionaries,
which is the length-N bitstring of a measured standard basis state,
and "mean" is the mean of non-zero quasi-probability estimates.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/result/mitigation/correlated_readout_mitigator.py
Original file line number Diff line number Diff line change
Expand Up @@ -145,7 +145,7 @@ def quasi_probabilities(
be calculated as the sum of all counts.
Returns:
QuasiDistibution: A dictionary containing pairs of [output, mean] where "output"
QuasiDistribution: A dictionary containing pairs of [output, mean] where "output"
is the key in the dictionaries,
which is the length-N bitstring of a measured standard basis state,
and "mean" is the mean of non-zero quasi-probability estimates.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/result/mitigation/local_readout_mitigator.py
Original file line number Diff line number Diff line change
Expand Up @@ -181,7 +181,7 @@ def quasi_probabilities(
be calculated as the sum of all counts.
Returns:
QuasiDistibution: A dictionary containing pairs of [output, mean] where "output"
QuasiDistribution: A dictionary containing pairs of [output, mean] where "output"
is the key in the dictionaries,
which is the length-N bitstring of a measured standard basis state,
and "mean" is the mean of non-zero quasi-probability estimates.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/synthesis/clifford/clifford_decompose_greedy.py
Original file line number Diff line number Diff line change
Expand Up @@ -36,7 +36,7 @@ def synth_clifford_greedy(clifford):
greedy Clifford compiler that is described in Appendix A of
Bravyi, Hu, Maslov and Shaydulin.
This method typically yields better CX cost compared to the Aaronson-Gottesma method.
This method typically yields better CX cost compared to the Aaronson-Gottesman method.
Args:
clifford (Clifford): a clifford operator.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/synthesis/evolution/lie_trotter.py
Original file line number Diff line number Diff line change
Expand Up @@ -64,7 +64,7 @@ def __init__(
"chain", where next neighbor connections are used, or "fountain", where all
qubits are connected to one.
atomic_evolution: A function to construct the circuit for the evolution of single
Pauli string. Per default, a single Pauli evolution is decomopsed in a CX chain
Pauli string. Per default, a single Pauli evolution is decomposed in a CX chain
and a single qubit Z rotation.
"""
super().__init__(1, reps, insert_barriers, cx_structure, atomic_evolution)
Expand Down
2 changes: 1 addition & 1 deletion qiskit/synthesis/evolution/product_formula.py
Original file line number Diff line number Diff line change
Expand Up @@ -47,7 +47,7 @@ def __init__(
"chain", where next neighbor connections are used, or "fountain", where all
qubits are connected to one.
atomic_evolution: A function to construct the circuit for the evolution of single
Pauli string. Per default, a single Pauli evolution is decomopsed in a CX chain
Pauli string. Per default, a single Pauli evolution is decomposed in a CX chain
and a single qubit Z rotation.
"""
super().__init__()
Expand Down
2 changes: 1 addition & 1 deletion qiskit/synthesis/evolution/qdrift.py
Original file line number Diff line number Diff line change
Expand Up @@ -49,7 +49,7 @@ def __init__(
"chain", where next neighbor connections are used, or "fountain", where all
qubits are connected to one.
atomic_evolution: A function to construct the circuit for the evolution of single
Pauli string. Per default, a single Pauli evolution is decomopsed in a CX chain
Pauli string. Per default, a single Pauli evolution is decomposed in a CX chain
and a single qubit Z rotation.
"""
super().__init__(1, reps, insert_barriers, cx_structure, atomic_evolution)
Expand Down
2 changes: 1 addition & 1 deletion qiskit/synthesis/evolution/suzuki_trotter.py
Original file line number Diff line number Diff line change
Expand Up @@ -81,7 +81,7 @@ def __init__(
where next neighbor connections are used, or "fountain", where all qubits are
connected to one.
atomic_evolution: A function to construct the circuit for the evolution of single
Pauli string. Per default, a single Pauli evolution is decomopsed in a CX chain
Pauli string. Per default, a single Pauli evolution is decomposed in a CX chain
and a single qubit Z rotation.
"""
# TODO replace deprecation warning by the following error and add unit test for odd
Expand Down
2 changes: 1 addition & 1 deletion qiskit/transpiler/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -658,7 +658,7 @@
For the first stage there are 2 passes typically used for this:
- :class:`~.VF2Layout`: Models layout selection as a subgraph isomorphism problem and tries
to find a subgraph of the connectivity graph that is isomporphic to the
to find a subgraph of the connectivity graph that is isomorphic to the
graph of 2 qubit interactions in the circuit. If more than one isomorphic mapping is found a
scoring heuristic is run to select the mapping which would result in the lowest average error
when executing the circuit.
Expand Down
2 changes: 1 addition & 1 deletion qiskit/transpiler/passes/basis/unroll_3q_or_more.py
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ def __init__(self, target=None, basis_gates=None):
"""Initialize the Unroll3qOrMore pass
Args:
target (Target): The target object reprsenting the compilation
target (Target): The target object representing the compilation
target. If specified any multiqubit instructions in the
circuit when the pass is run that are supported by the target
device will be left in place. If both this and ``basis_gates``
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,7 @@ class CollectMultiQBlocks(AnalysisPass):
Some gates may not be present in any block (e.g. if the number
of operands is greater than max_block_size)
A Disjont Set Union data structure (DSU) is used to maintain blocks as
A Disjoint Set Union data structure (DSU) is used to maintain blocks as
gates are processed. This data structure points each qubit to a set at all
times and the sets correspond to current blocks. These change over time
and the data structure allows these changes to be done quickly.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -224,7 +224,7 @@ def extract_dag_overlap_sets(self, dag):
"""
Gate A, B are overlapping if
A is neither a descendant nor an ancestor of B.
Currenty overlaps (A,B) are considered when A is a 2q gate and
Currently overlaps (A,B) are considered when A is a 2q gate and
B is either 2q or 1q gate.
"""
for gate in dag.two_qubit_ops():
Expand Down
Loading

0 comments on commit cb4da68

Please sign in to comment.