qsharp-lang 1.16.1-dev → 1.16.3-dev

package/dist/browser.d.ts

@@ -21,6 +21,7 @@ export { type CompilerState, type ProgramConfig } from "./compiler/compiler.js";
 export { QscEventTarget } from "./compiler/events.js";
 export type { LanguageServiceDiagnosticEvent, LanguageServiceEvent, LanguageServiceTestCallablesEvent, } from "./language-service/language-service.js";
 export { default as samples } from "./samples.generated.js";
+export { default as openqasm_samples } from "./openqasm-samples.generated.js";
 export { log, type LogLevel, type TargetProfile, type ProjectType };
 export type { ICompiler, ICompilerWorker, IDebugService, IDebugServiceWorker, ILanguageService, ILanguageServiceWorker, };
 export * as utils from "./utils.js";

package/dist/browser.js

@@ -110,5 +110,6 @@ export function getLanguageServiceWorker(worker) {
 export { StepResultId } from "../lib/web/qsc_wasm.js";
 export { QscEventTarget } from "./compiler/events.js";
 export { default as samples } from "./samples.generated.js";
+export { default as openqasm_samples } from "./openqasm-samples.generated.js";
 export { log };
 export * as utils from "./utils.js";

package/dist/compiler/compiler.js

@@ -26,7 +26,7 @@ export class Compiler {
             fetchGithub: async () => "",
             findManifestDirectory: async () => null,
         });
-        languageService.update_document("code", 1, code);
+        languageService.update_document("code", 1, code, "qsharp");
         // Yield to let the language service background worker handle the update
         await Promise.resolve();
         languageService.stop_background_work();

package/dist/language-service/language-service.d.ts

@@ -19,13 +19,13 @@ export type LanguageServiceTestCallablesEvent = {
 export type LanguageServiceEvent = LanguageServiceDiagnosticEvent | LanguageServiceTestCallablesEvent;
 export interface ILanguageService {
     updateConfiguration(config: IWorkspaceConfiguration): Promise<void>;
-    updateDocument(uri: string, version: number, code: string): Promise<void>;
+    updateDocument(uri: string, version: number, code: string, languageId?: string): Promise<void>;
     updateNotebookDocument(notebookUri: string, version: number, metadata: INotebookMetadata, cells: {
         uri: string;
         version: number;
         code: string;
     }[]): Promise<void>;
-    closeDocument(uri: string): Promise<void>;
+    closeDocument(uri: string, languageId?: string): Promise<void>;
     closeNotebookDocument(notebookUri: string): Promise<void>;
     getCodeActions(documentUri: string, range: IRange): Promise<ICodeAction[]>;
     getCompletions(documentUri: string, position: IPosition): Promise<ICompletionList>;
@@ -55,13 +55,13 @@ export declare class QSharpLanguageService implements ILanguageService {
     private backgroundWork;
     constructor(wasm: QscWasm, host?: IProjectHost);
     updateConfiguration(config: IWorkspaceConfiguration): Promise<void>;
-    updateDocument(documentUri: string, version: number, code: string): Promise<void>;
+    updateDocument(documentUri: string, version: number, code: string, languageId?: string): Promise<void>;
     updateNotebookDocument(notebookUri: string, version: number, metadata: INotebookMetadata, cells: {
         uri: string;
         version: number;
         code: string;
     }[]): Promise<void>;
-    closeDocument(documentUri: string): Promise<void>;
+    closeDocument(documentUri: string, languageId?: string): Promise<void>;
     closeNotebookDocument(documentUri: string): Promise<void>;
     getCodeActions(documentUri: string, range: IRange): Promise<ICodeAction[]>;
     getCompletions(documentUri: string, position: IPosition): Promise<ICompletionList>;

package/dist/language-service/language-service.js

@@ -20,14 +20,14 @@ export class QSharpLanguageService {
     async updateConfiguration(config) {
         this.languageService.update_configuration(config);
     }
-    async updateDocument(documentUri, version, code) {
-        this.languageService.update_document(documentUri, version, code);
+    async updateDocument(documentUri, version, code, languageId) {
+        this.languageService.update_document(documentUri, version, code, languageId || "qsharp");
     }
     async updateNotebookDocument(notebookUri, version, metadata, cells) {
         this.languageService.update_notebook_document(notebookUri, metadata, cells);
     }
-    async closeDocument(documentUri) {
-        this.languageService.close_document(documentUri);
+    async closeDocument(documentUri, languageId) {
+        this.languageService.close_document(documentUri, languageId || "qsharp");
     }
     async closeNotebookDocument(documentUri) {
         this.languageService.close_notebook_document(documentUri);

package/dist/openqasm-samples.generated.d.ts

@@ -0,0 +1,6 @@
+declare const _default: {
+    title: string;
+    shots: number;
+    code: string;
+}[];
+export default _default;

package/dist/openqasm-samples.generated.js

@@ -0,0 +1,27 @@
+export default [
+    {
+        "title": "Hello World in OpenQASM",
+        "shots": 100,
+        "code": "// OpenQASM Hello World sample\n//\n// This is one of the simplest OpenQASM programs that contains quantum part.\n// It uses one qubit, resets it and and immediately measures it.\n// Since the qubit is in |0〉 state after reset\n// such measurement will always yield `Zero`.\n\n// OpenQASM version identifier.\nOPENQASM 3;\n\n// Declares use of a single qubit and names it `q`.\n// All qubits must be declared in a global scope.\nqubit q;\n\n// Qubits are initially in an undefined state.\n// Reset is used here to initialize qubit to a |0〉 state.\nreset q;\n\n// Measures qubit and stores the result in a classical bit.\n// The qubit is in |0〉 state after reset, so the `b` will be 0.\nbit b = measure q;\n\n// Note, that the content of all classical variables\n// are reported to the user at the end of the program\n// unless explicit output declarations exist.\n"
+    },
+    {
+        "title": "Random Number Generator",
+        "shots": 1000,
+        "code": "// OpenQASM Quantum Random Number Generator\n//\n// This program implements a quantum random number generator by setting qubits\n// in superposition and then using the measurement results as random bits.\n\nOPENQASM 3;\ninclude \"stdgates.inc\";\n\n// Generates one random bit using a qubit `q`.\ndef GenerateRandomBit(qubit q) -> bit {\n  // Resets qubit `q` to |0〉 state\n  reset q;\n  // Sets the qubit into superposition of 0 and 1 using the Hadamard gate.\n  h q;\n\n  // At this point qubit `q` has 50% chance of being measured in the |0〉 state\n  // and 50% chance of being measured in the |1〉 state.\n  bit b = measure q;\n\n  // Return the measurement result - a random bit.\n  return b;\n}\n\n// Generates a random integer with `nBit` bits using qubit `q`\ndef GenerateRandomNumber(qubit q, int nBits) -> int {\n  int number = 0;\n\n  // Loop `nBits` times to generate `nBits` random bits.\n  for int k in [1:nBits] {\n      // Shift the number left by 1 to make space for the next bit.\n      number <<= 1;\n      // Set the least significant bit of the number to a random bit.\n      number |= GenerateRandomBit(q);\n  }\n\n  // Return the random number.\n  return number;\n}\n\n// User one qubit `q`.\nqubit q;\n\n// Generate a 5-bit random number using the qubit `q`.\nint random = GenerateRandomNumber(q, 5);\n"
+    },
+    {
+        "title": "Bell Pair Creation",
+        "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": "Bernstein-Vazirani Algorithm",
+        "shots": 10,
+        "code": "// OpenQASM Bernstein-Vazirani sample\n//\n// This sample demonstrates the Bernstein-Vazirani algorithm,\n// which determines the value of a bit string encoded in a function.\n\nOPENQASM 3;\ninclude \"stdgates.inc\";\n\n// Define the number of qubits.\nconst int nQubits = 5;\n// The secret bit string to be determined.\nconst bit[nQubits] secretBitString = \"10101\";\n\n// Given bit string 𝑟⃗ = (r₀, …, rₙ₋₁), represented as an array of bits,\n// this operation applies a unitary 𝑈 that acts on 𝑛 + 1 qubits as:\n//     𝑈 |𝑥〉|𝑦〉 = |𝑥〉|𝑦 ⊕ 𝑓(𝑥)〉\n// where 𝑓(𝑥) = Σᵢ 𝑥ᵢ 𝑟ᵢ mod 2.\ndef ApplyParityOperation(\n    bit[nQubits] bitStringAsBoolArray,\n    qubit[nQubits] xRegister,\n    qubit yQubit ) {\n\n    // Apply the quantum operations that encode the secret bit string.\n    for int i in [0:nQubits-1] {\n        if (bitStringAsBoolArray[i]) {\n            cx xRegister[i], yQubit;\n        }\n    }\n}\n\n// Applies parity operation for a particular secret bit string.\ndef ParityOperationForSecretBitstring(qubit[nQubits] xRegister, qubit yQubit) {\n    ApplyParityOperation(secretBitString, xRegister, yQubit);\n}\n\n// Given a register in the all-zeros state, prepares a uniform\n// superposition over all basis states.\ndef PrepareUniform(qubit[nQubits] q) {\n    for int i in [0:nQubits-1] {\n        h q[i];\n    }\n}\n\n// This operation implements the Bernstein-Vazirani quantum algorithm.\n// This algorithm computes for a given Boolean function that is promised to\n// be a parity 𝑓(𝑥₀, …, 𝑥ₙ₋₁) = Σᵢ 𝑟ᵢ 𝑥ᵢ a result in the form of a bit\n// vector (𝑟₀, …, 𝑟ₙ₋₁) corresponding to the parity function.\n// Note that it is promised that the function is actually a parity\n// function.\ndef BernsteinVazirani(qubit[nQubits] queryRegister, qubit target) -> bit[nQubits] {\n    bit[nQubits] results;\n\n    // The target qubit needs to be flipped so that a relative phase is\n    // introduced when we apply a Hadamard gate and we can use\n    // phase kickback when parity operation is applied.\n    x target;\n    h target;\n\n    // Prepare the query register in a uniform superposition.\n    PrepareUniform(queryRegister);\n\n    // Apply the parity operation.\n    ParityOperationForSecretBitstring(queryRegister, target);\n\n    // Uncompute the preparation of the uniform superposition.\n    PrepareUniform(queryRegister);\n\n    // Measure the qubits\n    results = measure queryRegister;\n\n    // The string we are looking for is returned after execution.\n    return results;\n}\n\n// Main program\n\n// Initialize the qubits\nqubit[nQubits] queryRegister;\nqubit target;\n\nreset queryRegister;\nreset target;\n\n// This register will hold and return the bit string found by the algorithm.\noutput bit[nQubits] results;\n\n// Call the Bernstein-Vazirani algorithm to find the secret bit string.\nresults = BernsteinVazirani(queryRegister, target);\n"
+    },
+    {
+        "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"
+    }
+];

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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/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: 05/12/2025
+ms.date: 05/16/2025
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.package: __Std__

package/docs/Std.Arrays/Interleaved.md

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