qsharp-lang 1.15.3-dev → 1.16.0

package/dist/katas-content.generated.js

@@ -2948,7 +2948,7 @@ export default {
                         "KatasLibrary.qs",
                         "preparing_states__Common.qs"
                     ],
-                    "placeholderCode": "namespace Kata {\n    operation ThreeStates_TwoQubits (qs : Qubit[]) : Unit is Adj + Ctl {\n        // Implement your solution here...\n\n    }  \n}\n\n",
+                    "placeholderCode": "namespace Kata {\n    operation ThreeStates_TwoQubits (qs : Qubit[]) : Unit {\n        // Implement your solution here...\n\n    }  \n}\n\n",
                     "explainedSolution": {
                         "type": "explained-solution",
                         "items": [
@@ -2968,7 +2968,7 @@ export default {
                             {
                                 "type": "solution",
                                 "id": "preparing_states__three_states_two_qubits_solution_b",
-                                "code": "namespace Kata {\n    import Std.Math.*;\n\n    operation ThreeStates_TwoQubits(qs : Qubit[]) : Unit is Adj + Ctl {\n        let theta = ArcSin(1.0 / Sqrt(3.0));\n        Ry(2.0 * theta, qs[0]);\n        ApplyControlledOnInt(0, H, [qs[0]], qs[1]);\n    }\n}\n"
+                                "code": "namespace Kata {\n    import Std.Math.*;\n\n    operation ThreeStates_TwoQubits(qs : Qubit[]) : Unit {\n        let theta = ArcSin(1.0 / Sqrt(3.0));\n        Ry(2.0 * theta, qs[0]);\n        ApplyControlledOnInt(0, H, [qs[0]], qs[1]);\n    }\n}\n"
                             }
                         ]
                     }
@@ -3044,7 +3044,7 @@ export default {
                         "KatasLibrary.qs",
                         "preparing_states__Common.qs"
                     ],
-                    "placeholderCode": "namespace Kata {\n    operation WState_PowerOfTwo (qs : Qubit[]) : Unit {\n        // Implement your solution here...\n\n    }\n}\n",
+                    "placeholderCode": "namespace Kata {\n    operation WState_PowerOfTwo (qs : Qubit[]) : Unit is Adj + Ctl {\n        // Implement your solution here...\n\n    }\n}\n",
                     "explainedSolution": {
                         "type": "explained-solution",
                         "items": [
@@ -5151,7 +5151,7 @@ export default {
                         "items": [
                             {
                                 "type": "text-content",
-                                "content": "<p>Bob's qubit now contains the information about the amplitudes of the teleported state, but it needs correction based on the classical message received for his qubit to match the teleported state precisely. As we've seen in the solution for the previous task, there are four possible measurement outcomes:</p>\n<ul>\n<li>For 00, Bob's qubit ends up in the state $\\alpha \\ket{0} + \\beta \\ket{1}$, so no change is required.</li>\n<li>For 01, Bob's qubit ends up in the state $\\alpha \\ket{0} - \\beta \\ket{1}$, so we need to apply a $Z$ correction.</li>\n<li>For 10, Bob's qubit ends up in the state $\\alpha \\ket{1} + \\beta \\ket{0}$, so we need to apply an $X$ correction.</li>\n<li>For 11, Bob's qubit ends up in the state $\\alpha \\ket{1} - \\beta \\ket{0}$, se we need to apply both $Z$ and $X$ corrections.</li>\n</ul>\n"
+                                "content": "<p>Bob's qubit now contains the information about the amplitudes of the teleported state, but it needs correction based on the classical message received for his qubit to match the teleported state precisely. As we've seen in the solution for the previous task, there are four possible measurement outcomes encoded as a tuple (b1, b2):</p>\n<ul>\n<li>For (0,0), Bob's qubit ends up in the state $\\alpha \\ket{0} + \\beta \\ket{1}$, so no change is required.</li>\n<li>For (0,1), Bob's qubit ends up in the state $\\alpha \\ket{1} + \\beta \\ket{0}$, so we need to apply an $X$ correction.</li>\n<li>For (1,0), Bob's qubit ends up in the state $\\alpha \\ket{0} - \\beta \\ket{1}$, so we need to apply a $Z$ correction.</li>\n<li>For (1,1), Bob's qubit ends up in the state $\\alpha \\ket{1} - \\beta \\ket{0}$, se we need to apply both $Z$ and $X$ corrections.</li>\n</ul>\n"
                             },
                             {
                                 "type": "solution",
@@ -5310,7 +5310,7 @@ export default {
                     "title": "Reconstruct Message with |Ψ⁺⟩",
                     "description": {
                         "type": "text-content",
-                        "content": "<p><strong>Goal:</strong>\nTransform Bob's qubit <code>qBob</code> into the state in which the message qubit had been originally. It is given that <code>qAlice</code> and <code>qBob</code> were initially entangled in $\\ket{\\Psi ^{+}} = \\frac{1}{\\sqrt{2}}(\\ket{00}+\\ket{11})$ state.</p>\n"
+                        "content": "<p><strong>Goal:</strong>\nTransform Bob's qubit <code>qBob</code> into the state in which the message qubit had been originally. It is given that <code>qAlice</code> and <code>qBob</code> were initially entangled in $\\ket{\\Psi ^{+}} = \\frac{1}{\\sqrt{2}}(\\ket{01}+\\ket{10})$ state.</p>\n"
                     },
                     "sourceIds": [
                         "teleportation__reconstruct_message_psi_plus__Verification.qs",

package/dist/katas-content.generated.md.js

@@ -2948,7 +2948,7 @@ export default {
                         "KatasLibrary.qs",
                         "preparing_states__Common.qs"
                     ],
-                    "placeholderCode": "namespace Kata {\n    operation ThreeStates_TwoQubits (qs : Qubit[]) : Unit is Adj + Ctl {\n        // Implement your solution here...\n\n    }  \n}\n\n",
+                    "placeholderCode": "namespace Kata {\n    operation ThreeStates_TwoQubits (qs : Qubit[]) : Unit {\n        // Implement your solution here...\n\n    }  \n}\n\n",
                     "explainedSolution": {
                         "type": "explained-solution",
                         "items": [
@@ -2968,7 +2968,7 @@ export default {
                             {
                                 "type": "solution",
                                 "id": "preparing_states__three_states_two_qubits_solution_b",
-                                "code": "namespace Kata {\n    import Std.Math.*;\n\n    operation ThreeStates_TwoQubits(qs : Qubit[]) : Unit is Adj + Ctl {\n        let theta = ArcSin(1.0 / Sqrt(3.0));\n        Ry(2.0 * theta, qs[0]);\n        ApplyControlledOnInt(0, H, [qs[0]], qs[1]);\n    }\n}\n"
+                                "code": "namespace Kata {\n    import Std.Math.*;\n\n    operation ThreeStates_TwoQubits(qs : Qubit[]) : Unit {\n        let theta = ArcSin(1.0 / Sqrt(3.0));\n        Ry(2.0 * theta, qs[0]);\n        ApplyControlledOnInt(0, H, [qs[0]], qs[1]);\n    }\n}\n"
                             }
                         ]
                     }
@@ -3044,7 +3044,7 @@ export default {
                         "KatasLibrary.qs",
                         "preparing_states__Common.qs"
                     ],
-                    "placeholderCode": "namespace Kata {\n    operation WState_PowerOfTwo (qs : Qubit[]) : Unit {\n        // Implement your solution here...\n\n    }\n}\n",
+                    "placeholderCode": "namespace Kata {\n    operation WState_PowerOfTwo (qs : Qubit[]) : Unit is Adj + Ctl {\n        // Implement your solution here...\n\n    }\n}\n",
                     "explainedSolution": {
                         "type": "explained-solution",
                         "items": [
@@ -5151,7 +5151,7 @@ export default {
                         "items": [
                             {
                                 "type": "text-content",
-                                "content": "\nBob's qubit now contains the information about the amplitudes of the teleported state, but it needs correction based on the classical message received for his qubit to match the teleported state precisely. As we've seen in the solution for the previous task, there are four possible measurement outcomes:\n\n- For 00, Bob's qubit ends up in the state $\\alpha \\ket{0} + \\beta \\ket{1}$, so no change is required.\n- For 01, Bob's qubit ends up in the state $\\alpha \\ket{0} - \\beta \\ket{1}$, so we need to apply a $Z$ correction.\n- For 10, Bob's qubit ends up in the state $\\alpha \\ket{1} + \\beta \\ket{0}$, so we need to apply an $X$ correction.\n- For 11, Bob's qubit ends up in the state $\\alpha \\ket{1} - \\beta \\ket{0}$, se we need to apply both $Z$ and $X$ corrections."
+                                "content": "\nBob's qubit now contains the information about the amplitudes of the teleported state, but it needs correction based on the classical message received for his qubit to match the teleported state precisely. As we've seen in the solution for the previous task, there are four possible measurement outcomes encoded as a tuple (b1, b2):\n\n- For (0,0), Bob's qubit ends up in the state $\\alpha \\ket{0} + \\beta \\ket{1}$, so no change is required.\n- For (0,1), Bob's qubit ends up in the state $\\alpha \\ket{1} + \\beta \\ket{0}$, so we need to apply an $X$ correction.\n- For (1,0), Bob's qubit ends up in the state $\\alpha \\ket{0} - \\beta \\ket{1}$, so we need to apply a $Z$ correction.\n- For (1,1), Bob's qubit ends up in the state $\\alpha \\ket{1} - \\beta \\ket{0}$, se we need to apply both $Z$ and $X$ corrections."
                             },
                             {
                                 "type": "solution",
@@ -5310,7 +5310,7 @@ export default {
                     "title": "Reconstruct Message with |Ψ⁺⟩",
                     "description": {
                         "type": "text-content",
-                        "content": "**Goal:** \nTransform Bob's qubit `qBob` into the state in which the message qubit had been originally. It is given that `qAlice` and `qBob` were initially entangled in $\\ket{\\Psi ^{+}} = \\frac{1}{\\sqrt{2}}(\\ket{00}+\\ket{11})$ state."
+                        "content": "**Goal:** \nTransform Bob's qubit `qBob` into the state in which the message qubit had been originally. It is given that `qAlice` and `qBob` were initially entangled in $\\ket{\\Psi ^{+}} = \\frac{1}{\\sqrt{2}}(\\ket{01}+\\ket{10})$ state."
                     },
                     "sourceIds": [
                         "teleportation__reconstruct_message_psi_plus__Verification.qs",

package/dist/samples.generated.js

@@ -104,6 +104,12 @@ export default [
         "shots": 1,
         "code": "/// # Sample\n/// Hidden Shift\n///\n/// # Description\n/// There is a family of problems known as hidden shift problems, in which it\n/// is given that two Boolean functions 𝑓 and 𝑔 satisfy the relation\n///     𝑔(𝑥) = 𝑓(𝑥 ⊕ 𝑠) for all 𝑥\n/// where 𝑠 is a hidden bit string that we would like to find.\n///\n/// This Q# program implements an algorithm to solve the hidden shift problem.\nimport Std.Arrays.*;\nimport Std.Convert.*;\nimport Std.Diagnostics.*;\nimport Std.Measurement.*;\n\noperation Main() : Int[] {\n    let nQubits = 10;\n\n    // Consider the case of finding a hidden shift 𝑠 between two Boolean\n    // functions 𝑓(𝑥) and 𝑔(𝑥) = 𝑓(𝑥 ⊕ 𝑠).\n    // This problem can be solved on a quantum computer with one call to\n    // each of 𝑓 and 𝑔 in the special case that both functions are bent;\n    // that is, that they are as far from linear as possible.\n\n    // Here, we find the hidden shift for various pairs of bent functions.\n    let shifts = [170, 512, 999];\n    mutable hiddenShifts = [];\n    for shift in shifts {\n        let hiddenShiftBitString = FindHiddenShift(\n            BentFunction,\n            register => ShiftedBentFunction(shift, register),\n            nQubits\n        );\n        let hiddenShift = ResultArrayAsInt(hiddenShiftBitString);\n        Message($\"Found {shift} successfully!\");\n        hiddenShifts += [hiddenShift];\n    }\n\n    // Note: returned array should match shifts array\n    return hiddenShifts;\n}\n\n/// # Summary\n/// Implements a correlation-based algorithm to solve the hidden shift\n/// problem for bent functions.\n///\n/// # Description\n/// Implements a solution for the hidden shift problem, which is to identify\n/// an unknown shift 𝑠 of the arguments of two Boolean functions 𝑓 and 𝑔\n/// that are promised to satisfy the relation 𝑔(𝑥) = 𝑓(𝑥 ⊕ 𝑠) for all 𝑥.\n///\n/// 𝑓 and 𝑔 are assumed to be bent functions. A Boolean function is bent if\n/// it is as far from linear as possible. In particular, bent functions have\n/// flat Fourier (Walsh–Hadamard) spectra.\n///\n/// In this case, the Roetteler algorithm (see References, below) uses\n/// black-box oracles for 𝑓^* and 𝑔, where 𝑓^* is the dual bent function to\n/// 𝑓, and computes the hidden shift 𝑠 between 𝑓 and 𝑔.\n///\n/// # Input\n/// ## Ufstar\n/// A quantum operation that implements\n/// $U_f^*: |𝑥〉 ↦ (-1)^{f^*(x)} |𝑥〉$,\n/// where $f^*$ is a Boolean function, 𝑥 is an $n$ bit register\n/// ## Ug\n/// A quantum operation that implements\n/// $U_g:|𝑥〉 ↦ (-1)^{g(x)} |𝑥〉$,\n/// where 𝑔 is a Boolean function that is shifted by unknown\n/// 𝑠 from 𝑓, and 𝑥 is an $n$ bit register.\n/// ## n\n/// The number of bits of the input register |𝑥〉.\n///\n/// # Output\n/// An array of type `Result[]` which encodes the bit representation\n/// of the hidden shift.\n///\n/// # References\n/// - [*Martin Roetteler*,\n///    Proc. SODA 2010, ACM, pp. 448-457, 2010]\n///   (https://doi.org/10.1137/1.9781611973075.37)\noperation FindHiddenShift(\n    Ufstar : (Qubit[] => Unit),\n    Ug : (Qubit[] => Unit),\n    n : Int\n) : Result[] {\n    // We allocate n clean qubits. Note that the function Ufstar and Ug are\n    // unitary operations on n qubits defined via phase encoding.\n    use qubits = Qubit[n];\n\n    // First, a Hadamard transform is applied to each of the qubits.\n    ApplyToEach(H, qubits);\n\n    // We now apply the shifted function Ug to the n qubits, computing\n    // |x〉 -> (-1)^{g(x)} |x〉.\n    Ug(qubits);\n\n    within {\n        // A Hadamard transform is applied to each of the n qubits.\n        ApplyToEachA(H, qubits);\n    } apply {\n        // we now apply the dual function of the unshifted function, i.e.,\n        // Ufstar, to the n qubits, computing |x〉 -> (-1)^{fstar(x)} |x〉.\n        Ufstar(qubits);\n    }\n\n    // Measure the n qubits and reset them to zero so that they can be\n    // safely deallocated at the end of the block.\n    return MResetEachZ(qubits);\n}\n\n/// # Summary\n/// Implements an oracle for a bent function constructed from the inner\n/// product of Boolean functions.\n///\n/// # Description\n/// This operation defines the Boolean function IP(x_0, ..., x_{n-1}) which\n/// is computed into the phase, i.e., a diagonal operator that maps\n/// |x〉 -> (-1)^{IP(x)} |x〉, where x stands for x=(x_0, ..., x_{n-1}) and all\n/// the x_i are binary. The IP function is defined as\n/// IP(y, z) = y_0 z_0 + y_1 z_1 + ... y_{u-1} z_{u-1} where\n/// y = (y_0, ..., y_{u-1}) and z =  (z_0, ..., z_{u-1}) are two bit vectors\n/// of length u. Notice that the function IP is a Boolean function on n = 2u\n/// bits. IP is a special case of bent function. These are functions for\n/// which the Walsh-Hadamard transform is perfectly flat (in absolute\n/// value).\n/// Because of this flatness, the Walsh-Hadamard spectrum of any bent\n/// function defines a +1/-1 function, i.e., gives rise to another Boolean\n/// function, called the dual bent function. Moreover, for the case of the\n/// IP function it can be shown that IP is equal to its own dual bent\n/// function.\n///\n/// # Remarks\n/// Notice that a diagonal operator implementing IP between 2 variables y_0\n/// and z_0 is nothing but the AND function between those variables, i.e.,\n/// in phase encoding it is computed by a Controlled-Z gate.\n/// Extending this to an XOR of the AND of more variables, as required in\n/// the definition of the IP function can then be accomplished by applying\n/// several Controlled-Z gates between the respective inputs.\noperation BentFunction(register : Qubit[]) : Unit {\n    Fact(Length(register) % 2 == 0, \"Length of register must be even.\");\n    let u = Length(register) / 2;\n    let xs = register[0..u - 1];\n    let ys = register[u...];\n    for index in 0..u - 1 {\n        CZ(xs[index], ys[index]);\n    }\n}\n\n/// # Summary\n/// Implements a shifted bend function 𝑔(𝑥) = 𝑓(𝑥 ⊕ 𝑠).\n///\n/// # Description\n/// For the hidden shift problem we need another function g which is related\n/// to IP via g(x) = IP(x + s), i.e., we have to shift the argument of the\n/// IP function by a given shift. Notice that the '+' operation here is the\n/// Boolean addition, i.e., a bit-wise operation. Notice further, that in\n/// general a diagonal operation |x〉 -> (-1)^{f(x)} can be turned into a\n/// shifted version by applying a bit flip to the |x〉 register first, then\n/// applying the diagonal operation, and then undoing the bit flips to the\n/// |x〉 register. We use this principle to define shifted versions of the IP\n/// operation.\noperation ShiftedBentFunction(shift : Int, register : Qubit[]) : Unit {\n    Fact(Length(register) % 2 == 0, \"Length of register must be even.\");\n    let u = Length(register) / 2;\n    within {\n        // Flips the bits in shift.\n        ApplyXorInPlace(shift, register);\n    } apply {\n        // Compute the IP function into the phase.\n        BentFunction(register);\n    }\n}\n"
     },
+    {
+        "title": "Ising Model (Simple 1D)",
+        "shots": 1000,
+        "code": "/// # Sample\n/// Simulation of a simple Ising model evolution\n/// on a 1D grid with first-order Trotterization.\n///\n/// # Description\n/// This sample demonstrates simulation of an Ising model Hamiltonian\n/// on 1D grid of size N using a first-order Trotter-Suzuki approximation.\n/// This sample can be easily simulated classically with the grid of size 9\n/// and 1000 shots. This sample is suitable for Base Profile.\n/// For the purpose of simplicity this sample intentionally doesn't\n/// post-process results or perform eigenvalue estimation.\noperation Main() : Result[] {\n    // The size of a 1D grid is N\n    let N : Int = 9;\n\n    // Total evolution time\n    let evolutionTime : Double = 4.0;\n    // Number of steps\n    let numberOfSteps : Int = 7;\n\n    // Coefficient for 2-qubit interactions between neighboring qubits\n    let J : Double = 1.0;\n    // Coefficient for external field interaction for individual qubits\n    let g : Double = 0.7;\n\n    IsingModel1DEvolution(N, J, g, evolutionTime, numberOfSteps)\n}\n\n/// # Summary\n/// Simulate simple Ising model evolution\n///\n/// # Description\n/// Simulates state |𝜓⟩ evolution to find |𝜓(t)⟩=U(t)|𝜓(0)⟩.\n/// |𝜓(0)⟩ is taken to be |0...0⟩.\n/// U(t)=e⁻ⁱᴴᵗ, where H is an Ising model Hamiltonian H = -J·Σ'ᵢⱼZᵢZⱼ + g·ΣᵢXᵢ\n/// Here Σ' is taken over all pairs of neighboring qubits <i,j>.\n/// Simulation is done by performing K steps assuming U(t)≈(U(t/K))ᴷ.\noperation IsingModel1DEvolution(\n    N : Int,\n    J : Double,\n    g : Double,\n    evolutionTime : Double,\n    numberOfSteps : Int\n) : Result[] {\n\n    // Allocate qubit grid\n    use qubits = Qubit[N];\n\n    // Compute the time step\n    let dt : Double = evolutionTime / Std.Convert.IntAsDouble(numberOfSteps);\n\n    let theta_x = - g * dt;\n    let theta_zz = J * dt;\n\n    // Perform K steps\n    for i in 1..numberOfSteps {\n\n        // Single-qubit interaction with external field\n        for q in qubits {\n            Rx(2.0 * theta_x, q);\n        }\n\n        // All of the following Rzz gates commute. So we apply them between \"even\"\n        // pairs first and then between \"odd\" pairs to reduce the algorithm depth.\n\n        // Interactions between \"even\" pairs\n        for j in 0..2..N-2 {\n            Rzz(2.0 * theta_zz, qubits[j], qubits[j + 1]);\n        }\n\n        // Interactions between \"odd\" pairs\n        for j in 1..2..N-2 {\n            Rzz(2.0 * theta_zz, qubits[j], qubits[j + 1]);\n        }\n\n    }\n\n    MResetEachZ(qubits)\n}\n",
+        "omitFromTests": true
+    },
     {
         "title": "Shor",
         "shots": 1,

package/docs/Microsoft.Quantum.Core/Length.md

@@ -2,7 +2,7 @@
 uid: Qdk.Microsoft.Quantum.Core.Length
 title: Length exported item
 description: "Q# Length exported item: This is an exported item. The actual definition is found here: [Std.Core.Length](xref:Qdk.Std.Core.Length)"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: export
 qsharp.package: __Std__

package/docs/Microsoft.Quantum.Core/Repeated.md

@@ -2,7 +2,7 @@
 uid: Qdk.Microsoft.Quantum.Core.Repeated
 title: Repeated exported item
 description: "Q# Repeated exported item: This is an exported item. The actual definition is found here: [Std.Core.Repeated](xref:Qdk.Std.Core.Repeated)"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: export
 qsharp.package: __Std__

package/docs/Microsoft.Quantum.Core/index.md

@@ -4,7 +4,7 @@ title: Microsoft.Quantum.Core namespace
 description: Table of contents for the Q# Microsoft.Quantum.Core namespace
 author: {AUTHOR}
 ms.author: {MS_AUTHOR}
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: landing-page
 ---
 

package/docs/Std.Arithmetic/AddLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.AddLE
 title: AddLE operation
 description: "Q# AddLE operation: Sets a zero-initialized little-endian register zs to the sum of little-endian registers xs and ys"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfEqualL.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfEqualL
 title: ApplyIfEqualL operation
 description: "Q# ApplyIfEqualL operation: Computes `if (c == x) { action(target) }`, that is, applies `action` to `target` if a BigInt value `c` is equal to the little-endian qubit register `x`"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfEqualLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfEqualLE
 title: ApplyIfEqualLE operation
 description: "Q# ApplyIfEqualLE operation: Computes `if x == y { action(target) }`, that is, applies `action` to `target` if register `x` is equal to the register `y`. Both qubit registers should be in a little-endian format."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfGreaterL.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfGreaterL
 title: ApplyIfGreaterL operation
 description: "Q# ApplyIfGreaterL operation: Computes `if (c > x) { action(target) }`, that is, applies `action` to `target` if a BigInt value `c` is greater than the little-endian qubit register `x`"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfGreaterLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfGreaterLE
 title: ApplyIfGreaterLE operation
 description: "Q# ApplyIfGreaterLE operation: Computes `if x > y { action(target) }`, that is, applies `action` to `target` if register `x` is greater than the register `y`. Both qubit registers should be in a little-endian format."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfGreaterOrEqualL.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfGreaterOrEqualL
 title: ApplyIfGreaterOrEqualL operation
 description: "Q# ApplyIfGreaterOrEqualL operation: Computes `if (c >= x) { action(target) }`, that is, applies `action` to `target` if a BigInt value `c` is greater or equal to the little-endian qubit register `x`"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfGreaterOrEqualLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfGreaterOrEqualLE
 title: ApplyIfGreaterOrEqualLE operation
 description: "Q# ApplyIfGreaterOrEqualLE operation: Computes `if x >= y { action(target) }`, that is, applies `action` to `target` if register `x` is greater or equal to the register `y`. Both qubit registers should be in a little-endian format."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfLessL.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfLessL
 title: ApplyIfLessL operation
 description: "Q# ApplyIfLessL operation: Computes `if (c < x) { action(target) }`, that is, applies `action` to `target` if a BigInt value `c` is less than the little-endian qubit register `x`"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfLessLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfLessLE
 title: ApplyIfLessLE operation
 description: "Q# ApplyIfLessLE operation: Computes `if x < y { action(target) }`, that is, applies `action` to `target` if register `x` is less than the register `y`. Both qubit registers should be in a little-endian format."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfLessOrEqualL.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfLessOrEqualL
 title: ApplyIfLessOrEqualL operation
 description: "Q# ApplyIfLessOrEqualL operation: Computes `if (c <= x) { action(target) }`, that is, applies `action` to `target` if a BigInt value `c` is less or equal to the little-endian qubit register `x`"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ApplyIfLessOrEqualLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ApplyIfLessOrEqualLE
 title: ApplyIfLessOrEqualLE operation
 description: "Q# ApplyIfLessOrEqualLE operation: Computes `if x <= y { action(target) }`, that is, applies `action` to `target` if register `x` is less or equal to the register `y`. Both qubit registers should be in a little-endian format."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/FourierTDIncByLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.FourierTDIncByLE
 title: FourierTDIncByLE operation
 description: "Q# FourierTDIncByLE operation: Increments a little-endian register ys by a little-endian register xs using Quantum Fourier Transform."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/IncByI.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.IncByI
 title: IncByI operation
 description: "Q# IncByI operation: Increments a little-endian register ys by an integer number c"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/IncByIUsingIncByLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.IncByIUsingIncByLE
 title: IncByIUsingIncByLE operation
 description: "Q# IncByIUsingIncByLE operation: Increments a little-endian register ys by an Int number c using provided adder."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/IncByL.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.IncByL
 title: IncByL operation
 description: "Q# IncByL operation: Increments a little-endian register ys by a BigInt number c"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/IncByLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.IncByLE
 title: IncByLE operation
 description: "Q# IncByLE operation: Increments a little-endian register ys by a little-endian register xs"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/IncByLEUsingAddLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.IncByLEUsingAddLE
 title: IncByLEUsingAddLE operation
 description: "Q# IncByLEUsingAddLE operation: Generic operation to turn two out-place adders into one in-place adder"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/IncByLUsingIncByLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.IncByLUsingIncByLE
 title: IncByLUsingIncByLE operation
 description: "Q# IncByLUsingIncByLE operation: Increments a little-endian register ys by a BigInt number c using provided adder."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/LookAheadDKRSAddLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.LookAheadDKRSAddLE
 title: LookAheadDKRSAddLE operation
 description: "Q# LookAheadDKRSAddLE operation: Sets a zero-initialized little-endian register zs to the sum of little-endian registers xs and ys using the carry-lookahead algorithm."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/MAJ.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.MAJ
 title: MAJ operation
 description: "Q# MAJ operation: This applies the in-place majority operation to 3 qubits."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/ReflectAboutInteger.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.ReflectAboutInteger
 title: ReflectAboutInteger operation
 description: "Q# ReflectAboutInteger operation: Reflects a quantum register about a given classical integer."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/RippleCarryCGAddLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.RippleCarryCGAddLE
 title: RippleCarryCGAddLE operation
 description: "Q# RippleCarryCGAddLE operation: Sets a zero-initialized little-endian register zs to the sum of little-endian registers xs and ys using the ripple-carry algorithm."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/RippleCarryCGIncByLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.RippleCarryCGIncByLE
 title: RippleCarryCGIncByLE operation
 description: "Q# RippleCarryCGIncByLE operation: Increments a little-endian register ys by a little-endian register xs using the ripple-carry algorithm."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/RippleCarryTTKIncByLE.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arithmetic.RippleCarryTTKIncByLE
 title: RippleCarryTTKIncByLE operation
 description: "Q# RippleCarryTTKIncByLE operation: Reversible, in-place ripple-carry addition of two integers."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arithmetic/index.md

@@ -4,7 +4,7 @@ title: Std.Arithmetic namespace
 description: Table of contents for the Q# Arithmetic namespace
 author: {AUTHOR}
 ms.author: {MS_AUTHOR}
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: landing-page
 ---
 

package/docs/Std.Arrays/All.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.All
 title: All function
 description: "Q# All function: Given an array and a predicate that is defined for the elements of the array, and checks if all elements of the array satisfy the predicate."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Any.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Any
 title: Any function
 description: "Q# Any function: Given an array and a predicate that is defined for the elements of the array, checks if at least one element of the array satisfies the predicate."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Chunks.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Chunks
 title: Chunks function
 description: "Q# Chunks function: Splits an array into multiple parts of equal length."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/CircularlyShifted.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.CircularlyShifted
 title: CircularlyShifted function
 description: "Q# CircularlyShifted function: Shift an array circularly left or right by a specific step size."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/ColumnAt.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.ColumnAt
 title: ColumnAt function
 description: "Q# ColumnAt function: Extracts a column from a matrix."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Count.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Count
 title: Count function
 description: "Q# Count function: Given an array and a predicate that is defined for the elements of the array, returns the number of elements an array that consists of those elements that satisfy the predicate."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Diagonal.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Diagonal
 title: Diagonal function
 description: "Q# Diagonal function: Returns an array of diagonal elements of a 2-dimensional array"
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/DrawMany.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.DrawMany
 title: DrawMany operation
 description: "Q# DrawMany operation: Repeats an operation for a given number of samples, collecting its outputs in an array."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arrays/Enumerated.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Enumerated
 title: Enumerated function
 description: "Q# Enumerated function: Given an array, returns a new array containing elements of the original array along with the indices of each element."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Excluding.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Excluding
 title: Excluding function
 description: "Q# Excluding function: Returns an array containing the elements of another array, excluding elements at a given list of indices."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Filtered.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Filtered
 title: Filtered function
 description: "Q# Filtered function: Given an array and a predicate that is defined for the elements of the array, returns an array that consists of those elements that satisfy the predicate."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/FlatMapped.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.FlatMapped
 title: FlatMapped function
 description: "Q# FlatMapped function: Given an array and a function that maps an array element to some output array, returns the concatenated output arrays for each array element."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Flattened.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Flattened
 title: Flattened function
 description: "Q# Flattened function: Given an array of arrays, returns the concatenation of all arrays."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Fold.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Fold
 title: Fold function
 description: "Q# Fold function: Iterates a function `f` through an array `array`, returning `f(...f(f(initialState, array[0]), array[1]), ...)`."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/ForEach.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.ForEach
 title: ForEach operation
 description: "Q# ForEach operation: Given an array and an operation that is defined for the elements of the array, returns a new array that consists of the images of the original array under the operation."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.package: __Std__

package/docs/Std.Arrays/Head.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.Head
 title: Head function
 description: "Q# Head function: Returns the first element of the array."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/HeadAndRest.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.HeadAndRest
 title: HeadAndRest function
 description: "Q# HeadAndRest function: Returns a tuple of first and all remaining elements of the array."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/IndexOf.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.IndexOf
 title: IndexOf function
 description: "Q# IndexOf function: Returns the first index of the first element in an array that satisfies a given predicate. If no such element exists, returns -1."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/IndexRange.md

@@ -2,7 +2,7 @@
 uid: Qdk.Std.Arrays.IndexRange
 title: IndexRange function
 description: "Q# IndexRange function: Given an array, returns a range over the indices of that array, suitable for use in a for loop."
-ms.date: 04/24/2025
+ms.date: 05/01/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__