qsharp-lang 1.16.3-dev → 1.16.5-dev

package/dist/openqasm-samples.generated.js

@@ -14,6 +14,11 @@ export default [
         "shots": 1000,
         "code": "// OpenQASM Bell Pair sample\n//\n// Bell pairs are specific quantum states of two qubits that represent\n// the simplest (and maximal) examples of quantum entanglement. This sample\n// prepares |Φ⁺⟩ = (|00⟩+|11⟩)/√2.\n//\n// See [Bell state](https://en.wikipedia.org/wiki/Bell_state)\n\nOPENQASM 3;\ninclude \"stdgates.inc\";\n\n// Declares use of qubits `q1` and `q2`.\nqubit q1;\nqubit q2;\n\n// Qubits are initially in an undefined state.\n// Reset is used here to initialize qubits to |0⟩ state.\nreset q1;\nreset q2;\n\n// Set qubit `q1` in superposition of |0⟩ and |1⟩ by applying a Hadamard gate.\nh q1;\n// Entangle the two qubits `q1` and `q2` using the `cx` gate.\ncx q1, q2;\n\n// Measure the two qubits and store results in classical variables `r1` and `r2`.\nbit r1 = measure q1;\nbit r2 = measure q2;\n\n// Note, that the reported result (r1, r2)\n// will always be either (Zero, Zero) or (One, One).\n"
     },
+    {
+        "title": "Teleportation (Simple)",
+        "shots": 1000,
+        "code": "// OpenQASM simple quantum teleportation sample\n//\n// This OpenQASM program demonstrates how to teleport quantum state\n// by communicating two classical bits and using previously entangled qubits.\n// This code teleports one specific state, but any state can be teleported.\n\nOPENQASM 3.0;\ninclude \"stdgates.inc\";\n\n// Allocate `qAlice`, `qBob` qubits\nqubit qAlice;\nqubit qBob;\n\n// Reset and entangle `qAlice`, `qBob` qubits\nreset qAlice;\nreset qBob;\nh qAlice;\ncx qAlice, qBob;\n\n// From now on qubits `qAlice` and `qBob` will not interact directly.\n\n// Allocate `qToTeleport` qubit and prepare it to be |𝜓⟩≈0.9394|0⟩−0.3429𝑖|1⟩\nqubit qToTeleport;\nreset qToTeleport;\nrx(0.7) qToTeleport;\n\n// Prepare the message by entangling `qToTeleport` and `qAlice` qubits\ncx qToTeleport, qAlice;\nh qToTeleport;\n\n// Obtain classical measurement results b1 and b2 at Alice's site.\nbit b1 = measure qToTeleport;\nbit b2 = measure qAlice;\n\n// At this point classical bits b1 and b2 are \"sent\" to the Bob's site.\n\n// Decode the message by applying adjustments based on classical data b1 and b2.\nif (b1) {\n    z qBob;\n}\nif (b2) {\n    x qBob;\n}\n\n// Obtained messages should be |𝜓⟩≈0.9394|0⟩−0.3429𝑖|1⟩\n// Rotate back to |0⟩ state and measure\nrx(-0.7) qBob;\noutput bit shouldBeZero;\nshouldBeZero = measure qBob;\n\n// Each execution of this program should result in Zero.\n"
+    },
     {
         "title": "Bernstein-Vazirani Algorithm",
         "shots": 10,
@@ -23,5 +28,10 @@ export default [
         "title": "Grover Search Algorithm",
         "shots": 10,
         "code": "// OpenQASM Grover's Search Algorithm\n//\n// Grover's search algorithm is a quantum algorithm that finds with high\n// probability the unique input to a black box function that produces a\n// particular output value.\n//\n// This program implements the Grover's algorithm for one specific function.\n\nOPENQASM 3;\ninclude \"stdgates.inc\";\n\n// Define the number of qubits. It must be 5 for this example.\nconst int nQubits = 5;\n// Optimal number of iterations for 5 qubits\nint iterations = 4;\n\n// Given a register in the all-zeros state, prepares a uniform\n// superposition over all basis states. This is a self-adjoint operation.\ndef PrepareUniform(qubit[nQubits] qs) {\n    for int i in [0:nQubits-1] {\n        h qs[i];\n    }\n}\n\n// Reflects about the basis state marked by alternating zeros and ones.\n// This operation defines what input we are trying to find in the search.\ndef ReflectAboutMarked(qubit[nQubits] qs, qubit aux) {\n    // We initialize the outputQubit to (|0⟩ - |1⟩) / √2, so that\n    // toggling it results in a (-1) phase.\n    x aux;\n    h aux;\n    // Flip the outputQubit for marked states.\n    // Here, we get the state with alternating 0s and 1s by using the X\n    // operation on every other qubit.\n    for int i in [0:2:nQubits-1] {\n        x qs[i];\n    }\n    // Controlled-X operation\n    ctrl(nQubits) @ x qs[0], qs[1], qs[2], qs[3], qs[4], aux;\n\n    // Undo the flips\n    for int i in [0:2:nQubits-1] {\n        x qs[i];\n    }\n    h aux;\n    x aux;\n}\n\n// Function to reflect about the uniform superposition\ndef ReflectAboutUniform(qubit[nQubits] qs) {\n    // Transform uniform superposition to all-zero\n    PrepareUniform(qs);\n\n    // Transform all-zero to all-ones\n    for int i in [0:nQubits-1] {\n        x qs[i];\n    }\n\n    // Reflect about all-ones\n    ctrl(nQubits-1) @ z qs[0], qs[1], qs[2], qs[3], qs[4];\n\n    // Undo transformations\n    for int i in [0:nQubits-1] {\n        x qs[i];\n    }\n\n    // Transform all-zero back to uniform superposition\n    PrepareUniform(qs);\n}\n\n// Main program\n\n// Allocate qubits\nqubit[nQubits] qs;\nqubit aux;\n// The state we are looking for is returned after execution.\noutput bit[nQubits] results;\n\n// Reset the qubits to the |0⟩ state before use.\nreset qs;\nreset aux;\n\n// Prepare uniform superposition\nPrepareUniform(qs);\n\nfor int i in [1:iterations] {\n    ReflectAboutMarked(qs, aux);\n    ReflectAboutUniform(qs);\n}\n\n// Measure the qubits\nresults = measure qs;\n"
+    },
+    {
+        "title": "Ising Model (Simple 1D)",
+        "shots": 1000,
+        "code": "// Simulation of a simple Ising model evolution\n// on a 1D grid with first-order Trotterization.\n//\n// This OpenQASM 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.\n\nOPENQASM 3;\ninclude \"stdgates.inc\";\n\n// The size of a 1D grid is N\nconst int N = 9;\n\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))ᴷ.\ndef IsingModel1DEvolution(\n    float J,\n    float g,\n    float evolutionTime,\n    int numberOfSteps,\n    qubit[N] qs\n) -> bit[N] {\n\n    float dt = evolutionTime / numberOfSteps;\n    \n    angle theta_x = -g * dt;\n    angle theta_zz = J * dt;\n\n    reset qs;\n\n    // Perform K steps\n    for int i in [1:numberOfSteps] {\n\n        // Single-qubit interaction with external field\n        for int j in [0:N-1] {\n            rx(theta_x * 2) qs[j];\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 int j in [0:2:N-2] {\n            rzz(theta_zz * 2) qs[j], qs[j + 1];\n        }\n\n        // Interactions between \"odd\" pairs\n        for int j in [1:2:N-2] {\n            rzz(theta_zz * 2) qs[j], qs[j + 1];\n        }\n    }\n\n    bit[N] result = measure qs;\n    return result;\n}\n\n// Main program\n\n// Allocate qubit grid\nqubit[N] qubits;\n\n// Total evolution time\nfloat evolutionTime = 4;\n// Number of steps\nint numberOfSteps = 7;\n\n// Coefficient for 2-qubit interactions between neighboring qubits\nfloat J = 1.0;\n// Coefficient for external field interaction for individual qubits\nfloat g = 0.7;\n\noutput bit[N] result;\nresult = IsingModel1DEvolution(J, g, evolutionTime, numberOfSteps, qubits);\n"
     }
 ];

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

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: export
 qsharp.package: __Std__
 qsharp.namespace: Microsoft.Quantum.Core

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

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: export
 qsharp.package: __Std__
 qsharp.namespace: Microsoft.Quantum.Core

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: 05/16/2025
+ms.date: 05/22/2025
 ms.topic: landing-page
 ---
 

package/docs/Std.Arithmetic/AddLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfEqualL.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfEqualLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfGreaterL.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfGreaterLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfGreaterOrEqualL.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfGreaterOrEqualLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfLessL.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfLessLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfLessOrEqualL.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ApplyIfLessOrEqualLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/FourierTDIncByLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/IncByI.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/IncByIUsingIncByLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/IncByL.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/IncByLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/IncByLEUsingAddLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/IncByLUsingIncByLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/LookAheadDKRSAddLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/MAJ.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/ReflectAboutInteger.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/RippleCarryCGAddLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/RippleCarryCGIncByLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

package/docs/Std.Arithmetic/RippleCarryTTKIncByLE.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arithmetic

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: 05/16/2025
+ms.date: 05/22/2025
 ms.topic: landing-page
 ---
 

package/docs/Std.Arrays/All.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Any.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Chunks.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/CircularlyShifted.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/ColumnAt.md

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

package/docs/Std.Arrays/Count.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Diagonal.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/DrawMany.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Enumerated.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Excluding.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Filtered.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/FlatMapped.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Flattened.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Fold.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/ForEach.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: operation
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Head.md

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

package/docs/Std.Arrays/HeadAndRest.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/IndexOf.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/IndexRange.md

@@ -2,8 +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: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Interleaved.md

@@ -2,8 +2,7 @@
 uid: Qdk.Std.Arrays.Interleaved
 title: Interleaved function
 description: "Q# Interleaved function: Interleaves two arrays of (almost) same size."
-ms.date: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/IsEmpty.md

@@ -2,8 +2,7 @@
 uid: Qdk.Std.Arrays.IsEmpty
 title: IsEmpty function
 description: "Q# IsEmpty function: Returns true if and only if an array is empty."
-ms.date: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/IsRectangularArray.md

@@ -2,8 +2,7 @@
 uid: Qdk.Std.Arrays.IsRectangularArray
 title: IsRectangularArray function
 description: "Q# IsRectangularArray function: Returns whether a 2-dimensional array has a rectangular shape"
-ms.date: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/IsSorted.md

@@ -2,8 +2,7 @@
 uid: Qdk.Std.Arrays.IsSorted
 title: IsSorted function
 description: "Q# IsSorted function: Given an array, returns whether that array is sorted as defined by a given comparison function."
-ms.date: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/IsSquareArray.md

@@ -2,8 +2,7 @@
 uid: Qdk.Std.Arrays.IsSquareArray
 title: IsSquareArray function
 description: "Q# IsSquareArray function: Returns whether a 2-dimensional array has a square shape"
-ms.date: 05/16/2025
-ms.topic: managed-reference
+ms.date: 05/22/2025
 qsharp.kind: function
 qsharp.package: __Std__
 qsharp.namespace: Std.Arrays

package/docs/Std.Arrays/Mapped.md

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