update week 11

Author: mhjensen

doc/pub/week11/html/week11-bs.html

@@ -1024,7 +1024,7 @@ <h2 id="applying-to-all-qubits" class="anchor">Applying to all qubits </h2>
 
 <!-- !split -->
 <h2 id="qft-example-codes" class="anchor">QFT example codes </h2>
-
+<p>This code sets up the QFT for \( n \) qubits.</p>
 
 <!-- code=text (!bc pycode) typeset with pygments style "default" -->
 <div class="cell border-box-sizing code_cell rendered">
@@ -1034,39 +1034,22 @@ <h2 id="qft-example-codes" class="anchor">QFT example codes </h2>
         <div class="highlight" style="background: #f8f8f8">
   <pre style="line-height: 125%;">import numpy as np
 def qft(n):
-   Creates the Quantum Fourier Transform (QFT) matrix for n qubits.
-
-   Parameters:
-   - n: Number of qubits (QFT acts on 2^n dimensions)
 
-   Returns:
-   - QFT matrix of size (2^n, 2^n)
-   &quot;&quot;&quot;
+   # Inputs n qubits and returns QFT matrix of size (2^n, 2^n)
    dim = 2 ** n  # Dimension of the Hilbert space
    omega = np.exp(2j * np.pi / dim)  # Primitive root of unity
-
    # Initialize QFT matrix
    QFT = np.zeros((dim, dim), dtype=complex)
-
    # Construct the QFT matrix
    for i in range(dim):
        for j in range(dim):
            QFT[i, j] = omega ** (i * j) / np.sqrt(dim)
-
    return QFT
 
 def apply_qft(state):
-   &quot;&quot;&quot;
-   Applies QFT to a given quantum state vector.
-   Parameters:
-   - state: Input state vector (1D NumPy array)
-   Returns:
-   - Transformed state vector after QFT
-   &quot;&quot;&quot;
    n = int(np.log2(len(state)))  # Number of qubits
    qft_matrix = qft(n)
-   return np.dot(qft_matrix, state)
-
+   return qft_matrix @ state
 # Example: 3-qubit system
 n_qubits = 3  # QFT on 3 qubits (8 dimensions)
 dim = 2 ** n_qubits

doc/pub/week11/html/week11-reveal.html

@@ -1031,7 +1031,7 @@ <h2 id="applying-to-all-qubits">Applying to all qubits </h2>
 
 <section>
 <h2 id="qft-example-codes">QFT example codes </h2>
-
+<p>This code sets up the QFT for \( n \) qubits.</p>
 
 <!-- code=text (!bc pycode) typeset with pygments style "perldoc" -->
 <div class="cell border-box-sizing code_cell rendered">
@@ -1041,39 +1041,22 @@ <h2 id="qft-example-codes">QFT example codes </h2>
         <div class="highlight" style="background: #eeeedd">
   <pre style="font-size: 80%; line-height: 125%;">import numpy as np
 def qft(n):
-   Creates the Quantum Fourier Transform (QFT) matrix for n qubits.
-
-   Parameters:
-   - n: Number of qubits (QFT acts on 2^n dimensions)
 
-   Returns:
-   - QFT matrix of size (2^n, 2^n)
-   &quot;&quot;&quot;
+   # Inputs n qubits and returns QFT matrix of size (2^n, 2^n)
    dim = 2 ** n  # Dimension of the Hilbert space
    omega = np.exp(2j * np.pi / dim)  # Primitive root of unity
-
    # Initialize QFT matrix
    QFT = np.zeros((dim, dim), dtype=complex)
-
    # Construct the QFT matrix
    for i in range(dim):
        for j in range(dim):
            QFT[i, j] = omega ** (i * j) / np.sqrt(dim)
-
    return QFT
 
 def apply_qft(state):
-   &quot;&quot;&quot;
-   Applies QFT to a given quantum state vector.
-   Parameters:
-   - state: Input state vector (1D NumPy array)
-   Returns:
-   - Transformed state vector after QFT
-   &quot;&quot;&quot;
    n = int(np.log2(len(state)))  # Number of qubits
    qft_matrix = qft(n)
-   return np.dot(qft_matrix, state)
-
+   return qft_matrix @ state
 # Example: 3-qubit system
 n_qubits = 3  # QFT on 3 qubits (8 dimensions)
 dim = 2 ** n_qubits

doc/pub/week11/html/week11-solarized.html

@@ -959,7 +959,7 @@ <h2 id="applying-to-all-qubits">Applying to all qubits </h2>
 
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>
 <h2 id="qft-example-codes">QFT example codes </h2>
-
+<p>This code sets up the QFT for \( n \) qubits.</p>
 
 <!-- code=text (!bc pycode) typeset with pygments style "perldoc" -->
 <div class="cell border-box-sizing code_cell rendered">
@@ -969,39 +969,22 @@ <h2 id="qft-example-codes">QFT example codes </h2>
         <div class="highlight" style="background: #eeeedd">
   <pre style="line-height: 125%;">import numpy as np
 def qft(n):
-   Creates the Quantum Fourier Transform (QFT) matrix for n qubits.
-
-   Parameters:
-   - n: Number of qubits (QFT acts on 2^n dimensions)
 
-   Returns:
-   - QFT matrix of size (2^n, 2^n)
-   &quot;&quot;&quot;
+   # Inputs n qubits and returns QFT matrix of size (2^n, 2^n)
    dim = 2 ** n  # Dimension of the Hilbert space
    omega = np.exp(2j * np.pi / dim)  # Primitive root of unity
-
    # Initialize QFT matrix
    QFT = np.zeros((dim, dim), dtype=complex)
-
    # Construct the QFT matrix
    for i in range(dim):
        for j in range(dim):
            QFT[i, j] = omega ** (i * j) / np.sqrt(dim)
-
    return QFT
 
 def apply_qft(state):
-   &quot;&quot;&quot;
-   Applies QFT to a given quantum state vector.
-   Parameters:
-   - state: Input state vector (1D NumPy array)
-   Returns:
-   - Transformed state vector after QFT
-   &quot;&quot;&quot;
    n = int(np.log2(len(state)))  # Number of qubits
    qft_matrix = qft(n)
-   return np.dot(qft_matrix, state)
-
+   return qft_matrix @ state
 # Example: 3-qubit system
 n_qubits = 3  # QFT on 3 qubits (8 dimensions)
 dim = 2 ** n_qubits

doc/pub/week11/html/week11.html

@@ -1036,7 +1036,7 @@ <h2 id="applying-to-all-qubits">Applying to all qubits </h2>
 
 <!-- !split --><br><br><br><br><br><br><br><br><br><br>
 <h2 id="qft-example-codes">QFT example codes </h2>
-
+<p>This code sets up the QFT for \( n \) qubits.</p>
 
 <!-- code=text (!bc pycode) typeset with pygments style "default" -->
 <div class="cell border-box-sizing code_cell rendered">
@@ -1046,39 +1046,22 @@ <h2 id="qft-example-codes">QFT example codes </h2>
         <div class="highlight" style="background: #f8f8f8">
   <pre style="line-height: 125%;">import numpy as np
 def qft(n):
-   Creates the Quantum Fourier Transform (QFT) matrix for n qubits.
-
-   Parameters:
-   - n: Number of qubits (QFT acts on 2^n dimensions)
 
-   Returns:
-   - QFT matrix of size (2^n, 2^n)
-   &quot;&quot;&quot;
+   # Inputs n qubits and returns QFT matrix of size (2^n, 2^n)
    dim = 2 ** n  # Dimension of the Hilbert space
    omega = np.exp(2j * np.pi / dim)  # Primitive root of unity
-
    # Initialize QFT matrix
    QFT = np.zeros((dim, dim), dtype=complex)
-
    # Construct the QFT matrix
    for i in range(dim):
        for j in range(dim):
            QFT[i, j] = omega ** (i * j) / np.sqrt(dim)
-
    return QFT
 
 def apply_qft(state):
-   &quot;&quot;&quot;
-   Applies QFT to a given quantum state vector.
-   Parameters:
-   - state: Input state vector (1D NumPy array)
-   Returns:
-   - Transformed state vector after QFT
-   &quot;&quot;&quot;
    n = int(np.log2(len(state)))  # Number of qubits
    qft_matrix = qft(n)
-   return np.dot(qft_matrix, state)
-
+   return qft_matrix @ state
 # Example: 3-qubit system
 n_qubits = 3  # QFT on 3 qubits (8 dimensions)
 dim = 2 ** n_qubits