Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/utils.jl
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@ Supposing that `A` is the adjacency matrix of a graph representing a quantum spi
nonzero diagonal would indicate couplings between qubits and themselves, which is physically
nonsensical. On the other hand, symmetry (or rather Hermicity in the general case, but we
only consider here real-valued adjacency matrices) is required for the walk Hamiltonian
``eᶦᵗᴬ`` to be unitary.
``eⁱᵗᴬ`` to be unitary.

# Arguments
- `A::AbstractMatrix{<:Real}`: The matrix to check.
Expand All @@ -39,7 +39,7 @@ Check whether a graph `g` is simple (i.e., undirected with no self-loops).

Supposing that `g` represents a quantum spin network, self-loops would indicate couplings
between qubits and themselves, which is physically nonsensical. On the other hand,
undirectedness is required for the walk Hamiltonian ``eᶦᵗᴬ`` to be unitary, where `A` is the
undirectedness is required for the walk Hamiltonian ``eⁱᵗᴬ`` to be unitary, where `A` is the
adjacency matrix of `g`.

# Arguments
Expand Down
Loading