qsharp-lang 1.3.6-dev → 1.4.1-dev

package/dist/samples.generated.js

@@ -17,12 +17,12 @@ export default [
     {
         "title": "Bell States",
         "shots": 100,
-        "code": "/// # Sample\n/// Bell States\n///\n/// # Description\n/// Bell states or EPR pairs are specific quantum states of two qubits\n/// that represent the simplest (and maximal) examples of quantum entanglement.\n///\n/// This Q# program implements the four different Bell states.\nnamespace Sample {\n    open Microsoft.Quantum.Diagnostics;\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation BellStates() : (Result, Result)[] {\n        // Allocate the two qubits that will be used to create a Bell state.\n        use register = Qubit[2];\n\n        // This array contains a label and a preparation operation for each one\n        // of the four Bell states.\n        let bellStateTuples = [\n            (\"|Φ+〉\", PreparePhiPlus),\n            (\"|Φ-〉\", PreparePhiMinus),\n            (\"|Ψ+〉\", PreparePsiPlus),\n            (\"|Ψ-〉\", PreparePsiMinus)\n        ];\n\n        // Prepare all Bell states, show them using the `DumpMachine` operation\n        // and measure the Bell state qubits.\n        mutable measurements = [];\n        for (label, prepare) in bellStateTuples {\n            prepare(register);\n            Message($\"Bell state {label}:\");\n            DumpMachine();\n            set measurements += [(MResetZ(register[0]), MResetZ(register[1]))];\n        }\n        return measurements;\n    }\n\n    operation PreparePhiPlus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 + |11〉)\n    }\n\n    operation PreparePhiMinus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 - |11〉)\n    }\n\n    operation PreparePsiPlus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        X(register[1]);                 // |+1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 + |10〉)\n    }\n\n    operation PreparePsiMinus(register : Qubit[]) : Unit {\n        ResetAll(register);             // |00〉\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        X(register[1]);                 // |-1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 - |10〉)\n    }\n}\n"
+        "code": "/// # Sample\n/// Bell States\n///\n/// # Description\n/// Bell states or EPR pairs are specific quantum states of two qubits\n/// that represent the simplest (and maximal) examples of quantum entanglement.\n///\n/// This Q# program implements the four different Bell states.\nnamespace Sample {\n    open Microsoft.Quantum.Diagnostics;\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation BellStates() : (Result, Result)[] {\n        // This array contains a label and a preparation operation for each one\n        // of the four Bell states.\n        let bellStateTuples = [\n            (\"|Φ+〉\", PreparePhiPlus),\n            (\"|Φ-〉\", PreparePhiMinus),\n            (\"|Ψ+〉\", PreparePsiPlus),\n            (\"|Ψ-〉\", PreparePsiMinus)\n        ];\n\n        // Prepare all Bell states, show them using the `DumpMachine` operation\n        // and measure the Bell state qubits.\n        mutable measurements = [];\n        for (label, prepare) in bellStateTuples {\n            // Allocate the two qubits that will be used to create a Bell state.\n            use register = Qubit[2];\n            prepare(register);\n            Message($\"Bell state {label}:\");\n            DumpMachine();\n            set measurements += [(MResetZ(register[0]), MResetZ(register[1]))];\n        }\n        return measurements;\n    }\n\n    operation PreparePhiPlus(register : Qubit[]) : Unit {\n        H(register[0]);                 // |+0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 + |11〉)\n    }\n\n    operation PreparePhiMinus(register : Qubit[]) : Unit {\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|00〉 - |11〉)\n    }\n\n    operation PreparePsiPlus(register : Qubit[]) : Unit {\n        H(register[0]);                 // |+0〉\n        X(register[1]);                 // |+1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 + |10〉)\n    }\n\n    operation PreparePsiMinus(register : Qubit[]) : Unit {\n        H(register[0]);                 // |+0〉\n        Z(register[0]);                 // |-0〉\n        X(register[1]);                 // |-1〉\n        CNOT(register[0], register[1]); // 1/sqrt(2)(|01〉 - |10〉)\n    }\n}\n"
     },
     {
         "title": "Teleportation",
         "shots": 1,
-        "code": "/// # Sample\n/// Quantum Teleportation\n///\n/// # Description\n/// Quantum teleportation provides a way of moving a quantum state from one\n/// location to another without having to move physical particle(s) along with\n/// it. This is done with the help of previously shared quantum entanglement\n/// between the sending and the receiving locations, and classical\n/// communication.\n///\n/// This Q# program implements quantum teleportation.\nnamespace Sample {\n    open Microsoft.Quantum.Diagnostics;\n    open Microsoft.Quantum.Intrinsic;\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation Main() : Result[] {\n        // Allocate the message and target qubits.\n        use (message, target) = (Qubit(), Qubit());\n\n        // Use the `Teleport` operation to send different quantum states.\n        let stateInitializerBasisTuples = [\n            (\"|0〉\", I, PauliZ),\n            (\"|1〉\", X, PauliZ),\n            (\"|+〉\", SetToPlus, PauliX),\n            (\"|-〉\", SetToMinus, PauliX)\n        ];\n\n        mutable results = [];\n        for (state, initializer, basis) in stateInitializerBasisTuples {\n            // Initialize the message and show its state using the `DumpMachine`\n            // function.\n            initializer(message);\n            Message($\"Teleporting state {state}\");\n            DumpMachine();\n\n            // Teleport the message and show the quantum state after\n            // teleportation.\n            Teleport(message, target);\n            Message($\"Received state {state}\");\n            DumpMachine();\n\n            // Measure target in the corresponding basis and reset the qubits to\n            // continue teleporting more messages.\n            let result = Measure([basis], [target]);\n            set results += [result];\n            ResetAll([message, target]);\n        }\n\n        return results;\n    }\n\n    /// # Summary\n    /// Sends the state of one qubit to a target qubit by using teleportation.\n    ///\n    /// Notice that after calling Teleport, the state of `message` is collapsed.\n    ///\n    /// # Input\n    /// ## message\n    /// A qubit whose state we wish to send.\n    /// ## target\n    /// A qubit initially in the |0〉 state that we want to send\n    /// the state of message to.\n    operation Teleport(message : Qubit, target : Qubit) : Unit {\n        // Allocate an auxiliary qubit.\n        use auxiliary = Qubit();\n\n        // Create some entanglement that we can use to send our message.\n        H(auxiliary);\n        CNOT(auxiliary, target);\n\n        // Encode the message into the entangled pair.\n        CNOT(message, auxiliary);\n        H(message);\n\n        // Measure the qubits to extract the classical data we need to decode\n        // the message by applying the corrections on the target qubit\n        // accordingly.\n        if M(message) == One {\n            Z(target);\n        }\n        if M(auxiliary) == One {\n            X(target);\n        }\n\n        // Reset auxiliary qubit before releasing.\n        Reset(auxiliary);\n    }\n\n    /// # Summary\n    /// Sets a qubit in state |0⟩ to |+⟩.\n    operation SetToPlus(q : Qubit) : Unit is Adj + Ctl {\n        H(q);\n    }\n\n    /// # Summary\n    /// Sets a qubit in state |0⟩ to |−⟩.\n    operation SetToMinus(q : Qubit) : Unit is Adj + Ctl {\n        X(q);\n        H(q);\n    }\n}\n"
+        "code": "/// # Sample\n/// Quantum Teleportation\n///\n/// # Description\n/// Quantum teleportation provides a way of moving a quantum state from one\n/// location to another without having to move physical particle(s) along with\n/// it. This is done with the help of previously shared quantum entanglement\n/// between the sending and the receiving locations, and classical\n/// communication.\n///\n/// This Q# program implements quantum teleportation.\nnamespace Sample {\n    open Microsoft.Quantum.Diagnostics;\n    open Microsoft.Quantum.Intrinsic;\n    open Microsoft.Quantum.Measurement;\n\n    @EntryPoint()\n    operation Main() : Result[] {\n        // Use the `Teleport` operation to send different quantum states.\n        let stateInitializerBasisTuples = [\n            (\"|0〉\", I, PauliZ),\n            (\"|1〉\", X, PauliZ),\n            (\"|+〉\", SetToPlus, PauliX),\n            (\"|-〉\", SetToMinus, PauliX)\n        ];\n\n        mutable results = [];\n        for (state, initializer, basis) in stateInitializerBasisTuples {\n            // Allocate the message and target qubits.\n            use (message, target) = (Qubit(), Qubit());\n\n            // Initialize the message and show its state using the `DumpMachine`\n            // function.\n            initializer(message);\n            Message($\"Teleporting state {state}\");\n            DumpRegister([message]);\n\n            // Teleport the message and show the quantum state after\n            // teleportation.\n            Teleport(message, target);\n            Message($\"Received state {state}\");\n            DumpRegister([target]);\n\n            // Measure target in the corresponding basis and reset the qubits to\n            // continue teleporting more messages.\n            let result = Measure([basis], [target]);\n            set results += [result];\n            ResetAll([message, target]);\n        }\n\n        return results;\n    }\n\n    /// # Summary\n    /// Sends the state of one qubit to a target qubit by using teleportation.\n    ///\n    /// Notice that after calling Teleport, the state of `message` is collapsed.\n    ///\n    /// # Input\n    /// ## message\n    /// A qubit whose state we wish to send.\n    /// ## target\n    /// A qubit initially in the |0〉 state that we want to send\n    /// the state of message to.\n    operation Teleport(message : Qubit, target : Qubit) : Unit {\n        // Allocate an auxiliary qubit.\n        use auxiliary = Qubit();\n\n        // Create some entanglement that we can use to send our message.\n        H(auxiliary);\n        CNOT(auxiliary, target);\n\n        // Encode the message into the entangled pair.\n        CNOT(message, auxiliary);\n        H(message);\n\n        // Measure the qubits to extract the classical data we need to decode\n        // the message by applying the corrections on the target qubit\n        // accordingly.\n        if M(auxiliary) == One {\n            X(target);\n        }\n\n        if M(message) == One {\n            Z(target);\n        }\n\n        // Reset auxiliary qubit before releasing.\n        Reset(auxiliary);\n    }\n\n    /// # Summary\n    /// Sets a qubit in state |0⟩ to |+⟩.\n    operation SetToPlus(q : Qubit) : Unit is Adj + Ctl {\n        H(q);\n    }\n\n    /// # Summary\n    /// Sets a qubit in state |0⟩ to |−⟩.\n    operation SetToMinus(q : Qubit) : Unit is Adj + Ctl {\n        X(q);\n        H(q);\n    }\n}\n"
     },
     {
         "title": "Random Bit",
@@ -62,7 +62,7 @@ export default [
     {
         "title": "Grover's search",
         "shots": 100,
-        "code": "/// # Sample\n/// Grover's search algorithm\n///\n/// # Description\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 Q# program implements the Grover's search algorithm.\nnamespace Sample {\n    open Microsoft.Quantum.Convert;\n    open Microsoft.Quantum.Math;\n    open Microsoft.Quantum.Arrays;\n    open Microsoft.Quantum.Measurement;\n    open Microsoft.Quantum.Diagnostics;\n\n    @EntryPoint()\n    operation Main() : Result[] {\n        let nQubits = 5;\n\n        // Grover's algorithm relies on performing a \"Grover iteration\" an\n        // optimal number of times to maximize the probability of finding the\n        // value we are searching for.\n        // You can set the number iterations to a value lower than optimal to\n        // intentionally reduce precision.\n        let iterations = CalculateOptimalIterations(nQubits);\n        Message($\"Number of iterations: {iterations}\");\n\n        // Use Grover's algorithm to find a particular marked state.\n        let results = GroverSearch(nQubits, iterations, ReflectAboutMarked);\n        return results;\n    }\n\n    /// # Summary\n    /// Implements Grover's algorithm, which searches all possible inputs to an\n    /// operation to find a particular marked state.\n    operation GroverSearch(\n        nQubits : Int,\n        iterations : Int,\n        phaseOracle : Qubit[] => Unit\n    ) : Result[] {\n\n        use qubits = Qubit[nQubits];\n\n        // Initialize a uniform superposition over all possible inputs.\n        PrepareUniform(qubits);\n\n        // The search itself consists of repeatedly reflecting about the marked\n        // state and our start state, which we can write out in Q# as a for loop.\n        for _ in 1..iterations {\n            phaseOracle(qubits);\n            ReflectAboutUniform(qubits);\n        }\n\n        // Measure and return the answer.\n        return MResetEachZ(qubits);\n    }\n\n    /// # Summary\n    /// Returns the optimal number of Grover iterations needed to find a marked\n    /// item, given the number of qubits in a register.\n    function CalculateOptimalIterations(nQubits : Int) : Int {\n        if nQubits > 63 {\n            fail \"This sample supports at most 63 qubits.\";\n        }\n        let nItems = 1 <<< nQubits; // 2^nQubits\n        let angle = ArcSin(1. / Sqrt(IntAsDouble(nItems)));\n        let iterations = Round(0.25 * PI() / angle - 0.5);\n        return iterations;\n    }\n\n    /// # Summary\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.\n    operation ReflectAboutMarked(inputQubits : Qubit[]) : Unit {\n        Message(\"Reflecting about marked state...\");\n        use outputQubit = Qubit();\n        within {\n            // We initialize the outputQubit to (|0⟩ - |1⟩) / √2, so that\n            // toggling it results in a (-1) phase.\n            X(outputQubit);\n            H(outputQubit);\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 q in inputQubits[...2...] {\n                X(q);\n            }\n        } apply {\n            Controlled X(inputQubits, outputQubit);\n        }\n    }\n\n    /// # Summary\n    /// Given a register in the all-zeros state, prepares a uniform\n    /// superposition over all basis states.\n    operation PrepareUniform(inputQubits : Qubit[]) : Unit is Adj + Ctl {\n        for q in inputQubits {\n            H(q);\n        }\n    }\n\n    /// # Summary\n    /// Reflects about the all-ones state.\n    operation ReflectAboutAllOnes(inputQubits : Qubit[]) : Unit {\n        Controlled Z(Most(inputQubits), Tail(inputQubits));\n    }\n\n    /// # Summary\n    /// Reflects about the uniform superposition state.\n    operation ReflectAboutUniform(inputQubits : Qubit[]) : Unit {\n        within {\n            // Transform the uniform superposition to all-zero.\n            Adjoint PrepareUniform(inputQubits);\n            // Transform the all-zero state to all-ones\n            for q in inputQubits {\n                X(q);\n            }\n        } apply {\n            // Now that we've transformed the uniform superposition to the\n            // all-ones state, reflect about the all-ones state, then let the\n            // within/apply block transform us back.\n            ReflectAboutAllOnes(inputQubits);\n        }\n    }\n}\n"
+        "code": "/// # Sample\n/// Grover's search algorithm\n///\n/// # Description\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 Q# program implements the Grover's search algorithm.\nnamespace Sample {\n    open Microsoft.Quantum.Convert;\n    open Microsoft.Quantum.Math;\n    open Microsoft.Quantum.Arrays;\n    open Microsoft.Quantum.Measurement;\n    open Microsoft.Quantum.Diagnostics;\n\n    @EntryPoint()\n    operation Main() : Result[] {\n        let nQubits = 5;\n\n        // Grover's algorithm relies on performing a \"Grover iteration\" an\n        // optimal number of times to maximize the probability of finding the\n        // value we are searching for.\n        // You can set the number iterations to a value lower than optimal to\n        // intentionally reduce precision.\n        let iterations = CalculateOptimalIterations(nQubits);\n        Message($\"Number of iterations: {iterations}\");\n\n        // Use Grover's algorithm to find a particular marked state.\n        let results = GroverSearch(nQubits, iterations, ReflectAboutMarked);\n        return results;\n    }\n\n    /// # Summary\n    /// Implements Grover's algorithm, which searches all possible inputs to an\n    /// operation to find a particular marked state.\n    operation GroverSearch(\n        nQubits : Int,\n        iterations : Int,\n        phaseOracle : Qubit[] => Unit\n    ) : Result[] {\n\n        use qubits = Qubit[nQubits];\n\n        // Initialize a uniform superposition over all possible inputs.\n        PrepareUniform(qubits);\n\n        // The search itself consists of repeatedly reflecting about the marked\n        // state and our start state, which we can write out in Q# as a for loop.\n        for _ in 1..iterations {\n            phaseOracle(qubits);\n            ReflectAboutUniform(qubits);\n        }\n\n        // Measure and return the answer.\n        return MResetEachZ(qubits);\n    }\n\n    /// # Summary\n    /// Returns the optimal number of Grover iterations needed to find a marked\n    /// item, given the number of qubits in a register.\n    function CalculateOptimalIterations(nQubits : Int) : Int {\n        if nQubits > 126 {\n            fail \"This sample supports at most 126 qubits.\";\n        }\n\n        let nItems = 2.0^IntAsDouble(nQubits);\n        let angle = ArcSin(1. / Sqrt(nItems));\n        let iterations = Round(0.25 * PI() / angle - 0.5);\n        iterations\n    }\n\n    /// # Summary\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.\n    operation ReflectAboutMarked(inputQubits : Qubit[]) : Unit {\n        Message(\"Reflecting about marked state...\");\n        use outputQubit = Qubit();\n        within {\n            // We initialize the outputQubit to (|0⟩ - |1⟩) / √2, so that\n            // toggling it results in a (-1) phase.\n            X(outputQubit);\n            H(outputQubit);\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 q in inputQubits[...2...] {\n                X(q);\n            }\n        } apply {\n            Controlled X(inputQubits, outputQubit);\n        }\n    }\n\n    /// # Summary\n    /// Given a register in the all-zeros state, prepares a uniform\n    /// superposition over all basis states.\n    operation PrepareUniform(inputQubits : Qubit[]) : Unit is Adj + Ctl {\n        for q in inputQubits {\n            H(q);\n        }\n    }\n\n    /// # Summary\n    /// Reflects about the all-ones state.\n    operation ReflectAboutAllOnes(inputQubits : Qubit[]) : Unit {\n        Controlled Z(Most(inputQubits), Tail(inputQubits));\n    }\n\n    /// # Summary\n    /// Reflects about the uniform superposition state.\n    operation ReflectAboutUniform(inputQubits : Qubit[]) : Unit {\n        within {\n            // Transform the uniform superposition to all-zero.\n            Adjoint PrepareUniform(inputQubits);\n            // Transform the all-zero state to all-ones\n            for q in inputQubits {\n                X(q);\n            }\n        } apply {\n            // Now that we've transformed the uniform superposition to the\n            // all-ones state, reflect about the all-ones state, then let the\n            // within/apply block transform us back.\n            ReflectAboutAllOnes(inputQubits);\n        }\n    }\n}\n"
     },
     {
         "title": "Hidden Shift",

package/docs/Microsoft.Quantum.Arrays/All.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.All
 title: All function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Any.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Any
 title: Any function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Chunks.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Chunks
 title: Chunks function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/CircularlyShifted.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.CircularlyShifted
 title: CircularlyShifted function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/ColumnAt.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.ColumnAt
 title: ColumnAt function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Count.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Count
 title: Count function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays
@@ -37,6 +37,6 @@ The number of elements in `array` that satisfy the predicate.
 
 ## Example
 ```qsharp
- let evensCount = Count(x -> x % 2 == 0, [1, 3, 6, 7, 9]);
+let evensCount = Count(x -> x % 2 == 0, [1, 3, 6, 7, 9]);
 // evensCount is 1.
 ```

package/docs/Microsoft.Quantum.Arrays/Diagonal.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Diagonal
 title: Diagonal function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/DrawMany.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.DrawMany
 title: DrawMany operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Enumerated.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Enumerated
 title: Enumerated function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Excluding.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Excluding
 title: Excluding function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Filtered.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Filtered
 title: Filtered function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/FlatMapped.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.FlatMapped
 title: FlatMapped function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Flattened.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Flattened
 title: Flattened function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Fold.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Fold
 title: Fold function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/ForEach.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.ForEach
 title: ForEach operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Head.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Head
 title: Head function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/HeadAndRest.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.HeadAndRest
 title: HeadAndRest function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/IndexOf.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.IndexOf
 title: IndexOf function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/IndexRange.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.IndexRange
 title: IndexRange function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Interleaved.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Interleaved
 title: Interleaved function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/IsEmpty.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.IsEmpty
 title: IsEmpty function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/IsRectangularArray.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.IsRectangularArray
 title: IsRectangularArray function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/IsSorted.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.IsSorted
 title: IsSorted function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/IsSquareArray.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.IsSquareArray
 title: IsSquareArray function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Mapped.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Mapped
 title: Mapped function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/MappedByIndex.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.MappedByIndex
 title: MappedByIndex function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/MappedOverRange.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.MappedOverRange
 title: MappedOverRange function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Most.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Most
 title: Most function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/MostAndTail.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.MostAndTail
 title: MostAndTail function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Padded.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Padded
 title: Padded function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Partitioned.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Partitioned
 title: Partitioned function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Rest.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Rest
 title: Rest function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Reversed.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Reversed
 title: Reversed function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/SequenceI.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.SequenceI
 title: SequenceI function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/SequenceL.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.SequenceL
 title: SequenceL function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Sorted.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Sorted
 title: Sorted function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Subarray.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Subarray
 title: Subarray function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Swapped.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Swapped
 title: Swapped function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Tail.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Tail
 title: Tail function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Transposed.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Transposed
 title: Transposed function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Unzipped.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Unzipped
 title: Unzipped function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Where.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Where
 title: Where function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Windows.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Windows
 title: Windows function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Arrays/Zipped.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Arrays.Zipped
 title: Zipped function
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: function
 qsharp.namespace: Microsoft.Quantum.Arrays

package/docs/Microsoft.Quantum.Canon/ApplyCNOTChain.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Canon.ApplyCNOTChain
 title: ApplyCNOTChain operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Canon

package/docs/Microsoft.Quantum.Canon/ApplyControlledOnBitString.md

@@ -1,12 +1,12 @@
 ---
 uid: Qdk.Microsoft.Quantum.Canon.ApplyControlledOnBitString
 title: ApplyControlledOnBitString operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Canon
 qsharp.name: ApplyControlledOnBitString
-qsharp.summary: "Applies a unitary operation on the target, controlled on a state specified by a given bit mask."
+qsharp.summary: "Applies `oracle` on `target` when `controlRegister` is in the state specified by `bits`."
 ---
 
 # ApplyControlledOnBitString operation
@@ -18,8 +18,17 @@ operation ApplyControlledOnBitString<'T>(bits : Bool[], oracle : ('T => Unit is
 ```
 
 ## Summary
-Applies a unitary operation on the target,
-controlled on a state specified by a given bit mask.
+Applies `oracle` on `target` when `controlRegister`
+is in the state specified by `bits`.
+
+## Description
+Applies a unitary operation `oracle` on the `target`, controlled
+on a state specified by a given bit mask `bits`.
+The bit at `bits[i]` corresponds to qubit at `controlRegister[i]`.
+The pattern given by `bits` may be shorter than `controlRegister`,
+in which case additional control qubits are ignored (that is, neither
+controlled on |0⟩ nor |1⟩).
+If `bits` is longer than `controlRegister`, an error is raised.
 
 ## Input
 ### bits
@@ -31,11 +40,13 @@ The target to be passed to `oracle` as an input.
 ### controlRegister
 A quantum register that controls application of `oracle`.
 
-## Remarks
-The pattern given by `bits` may be shorter than `controlRegister`,
-in which case additional control qubits are ignored (that is, neither
-controlled on $\ket{0}$ nor $\ket{1}$).
-If `bits` is longer than `controlRegister`, an error is raised.
-
-For example, `bits = [0,1,0,0,1]` means that `oracle` is applied if and only if `controlRegister`
-is in the state $\ket{0}\ket{1}\ket{0}\ket{0}\ket{1}$.
+## Example
+```qsharp
+// When bits = [1,0,0] oracle is applied if and only if controlRegister
+// is in the state |100⟩.
+use t = Qubit();
+use c = Qubit[3];
+X(c[0]);
+ApplyControlledOnBitString([true, false, false], X, c, t);
+Message($"{M(t)}"); // Prints `One` since oracle `X` was applied.
+```

package/docs/Microsoft.Quantum.Canon/ApplyControlledOnInt.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Canon.ApplyControlledOnInt
 title: ApplyControlledOnInt operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Canon

package/docs/Microsoft.Quantum.Canon/ApplyP.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Canon.ApplyP
 title: ApplyP operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Canon

package/docs/Microsoft.Quantum.Canon/ApplyPauli.md

@@ -1,7 +1,7 @@
 ---
 uid: Qdk.Microsoft.Quantum.Canon.ApplyPauli
 title: ApplyPauli operation
-ms.date: 04/17/2024 12:00:00 AM
+ms.date: 05/06/2024 12:00:00 AM
 ms.topic: managed-reference
 qsharp.kind: operation
 qsharp.namespace: Microsoft.Quantum.Canon