qsharp-lang 1.8.2-dev → 1.8.4-dev
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/samples.generated.js +16 -16
- package/docs/Microsoft.Quantum.Core/IsRangeEmpty.md +1 -1
- package/docs/Microsoft.Quantum.Core/Length.md +1 -1
- package/docs/Microsoft.Quantum.Core/RangeEnd.md +1 -1
- package/docs/Microsoft.Quantum.Core/RangeReverse.md +1 -1
- package/docs/Microsoft.Quantum.Core/RangeStart.md +1 -1
- package/docs/Microsoft.Quantum.Core/RangeStep.md +1 -1
- package/docs/Microsoft.Quantum.Core/Repeated.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/AddLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfEqualL.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfEqualLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfGreaterL.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfGreaterLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfGreaterOrEqualL.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfGreaterOrEqualLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfLessL.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfLessLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfLessOrEqualL.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ApplyIfLessOrEqualLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/FourierTDIncByLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/IncByI.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/IncByIUsingIncByLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/IncByL.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/IncByLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/IncByLEUsingAddLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/IncByLUsingIncByLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/LookAheadDKRSAddLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/MAJ.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/ReflectAboutInteger.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/RippleCarryCGAddLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/RippleCarryCGIncByLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.Arithmetic/RippleCarryTTKIncByLE.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.StatePreparation/ApproximatelyPreparePureStateCP.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.StatePreparation/PreparePureStateD.md +1 -1
- package/docs/Microsoft.Quantum.Unstable.TableLookup/Select.md +1 -1
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/All.md +4 -4
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Any.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Chunks.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/CircularlyShifted.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/ColumnAt.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Count.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Diagonal.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/DrawMany.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Enumerated.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Excluding.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Filtered.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/FlatMapped.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Flattened.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Fold.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/ForEach.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Head.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/HeadAndRest.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/IndexOf.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/IndexRange.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Interleaved.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/IsEmpty.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/IsRectangularArray.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/IsSorted.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/IsSquareArray.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Mapped.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/MappedByIndex.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/MappedOverRange.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Most.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/MostAndTail.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Padded.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Partitioned.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Rest.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Reversed.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/SequenceI.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/SequenceL.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Sorted.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Subarray.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Swapped.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Tail.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Transposed.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Unzipped.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Where.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Windows.md +5 -6
- package/docs/{Microsoft.Quantum.Arrays → Std.Arrays}/Zipped.md +5 -6
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyCNOTChain.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyControlledOnBitString.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyControlledOnInt.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyP.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyPauli.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyPauliFromBitString.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyPauliFromInt.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyQFT.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyToEach.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyToEachA.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyToEachC.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyToEachCA.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyXorInPlace.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/ApplyXorInPlaceL.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/CX.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/CY.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/CZ.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/Fst.md +4 -4
- package/docs/Std.Canon/Relabel.md +49 -0
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/Snd.md +4 -4
- package/docs/{Microsoft.Quantum.Canon → Std.Canon}/SwapReverseRegister.md +4 -4
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/BigIntAsBoolArray.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/BoolArrayAsBigInt.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/BoolArrayAsInt.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/BoolArrayAsResultArray.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/BoolAsResult.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/ComplexAsComplexPolar.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/ComplexPolarAsComplex.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/DoubleAsStringWithPrecision.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/IntAsBigInt.md +4 -5
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/IntAsBoolArray.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/IntAsDouble.md +4 -4
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/ResultArrayAsBoolArray.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/ResultArrayAsInt.md +5 -6
- package/docs/{Microsoft.Quantum.Convert → Std.Convert}/ResultAsBool.md +5 -6
- package/docs/{Microsoft.Quantum.Diagnostics → Std.Diagnostics}/DumpMachine.md +4 -4
- package/docs/{Microsoft.Quantum.Diagnostics → Std.Diagnostics}/DumpRegister.md +5 -6
- package/docs/{Microsoft.Quantum.Diagnostics → Std.Diagnostics}/Fact.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/AND.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/CCNOT.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/CNOT.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Exp.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/H.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/I.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/M.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Measure.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Message.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/R.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/R1.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/R1Frac.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/RFrac.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Reset.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/ResetAll.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Rx.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Rxx.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Ry.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Ryy.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Rz.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Rzz.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/S.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/SWAP.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/T.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/X.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Y.md +5 -6
- package/docs/{Microsoft.Quantum.Intrinsic → Std.Intrinsic}/Z.md +5 -6
- package/docs/{Microsoft.Quantum.Logical → Std.Logical}/Xor.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsComplex.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsComplexPolar.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsD.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsL.md +4 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsSquaredComplex.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/AbsSquaredComplexPolar.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ApproximateFactorial.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcCos.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcCosh.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcSin.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcSinh.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcTan.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcTan2.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArcTanh.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArgComplex.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ArgComplexPolar.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Binom.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/BitSizeI.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/BitSizeL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Ceiling.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Complex.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ComplexPolar.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ContinuedFractionConvergentI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ContinuedFractionConvergentL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Cos.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Cosh.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/DivRemI.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/DivRemL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/DividedByC.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/DividedByCP.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/E.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ExpModI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ExpModL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ExtendedGreatestCommonDivisorI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ExtendedGreatestCommonDivisorL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/FactorialI.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/FactorialL.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Floor.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/GreatestCommonDivisorI.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/GreatestCommonDivisorL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/HammingWeightI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/InverseModI.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/InverseModL.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/IsCoprimeI.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/IsCoprimeL.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/IsInfinite.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/IsNaN.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/LargestFixedPoint.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Lg.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Log.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Log10.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/LogFactorialD.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/LogGammaD.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/LogOf2.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Max.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MaxD.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MaxI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MaxL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Min.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MinD.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MinI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MinL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MinusC.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/MinusCP.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ModulusI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/ModulusL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/NegationC.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/NegationCP.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PI.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PNorm.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PNormalized.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PlusC.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PlusCP.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PowC.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/PowCP.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/RealMod.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Round.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/SignD.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/SignI.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/SignL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Sin.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Sinh.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/SmallestFixedPoint.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Sqrt.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/SquaredNorm.md +4 -4
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Tan.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Tanh.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/TimesC.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/TimesCP.md +5 -6
- package/docs/{Microsoft.Quantum.Math → Std.Math}/TrailingZeroCountI.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/TrailingZeroCountL.md +4 -5
- package/docs/{Microsoft.Quantum.Math → Std.Math}/Truncate.md +4 -4
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MResetEachZ.md +5 -6
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MResetX.md +5 -6
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MResetY.md +5 -6
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MResetZ.md +5 -6
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MeasureAllZ.md +4 -4
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MeasureEachZ.md +5 -6
- package/docs/{Microsoft.Quantum.Measurement → Std.Measurement}/MeasureInteger.md +5 -6
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/AccountForEstimates.md +5 -6
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/AuxQubitCount.md +4 -4
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/BeginEstimateCaching.md +5 -6
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/BeginRepeatEstimates.md +5 -6
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/CczCount.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/EndEstimateCaching.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/EndRepeatEstimates.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/MeasurementCount.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/PSSPCLayout.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/RepeatEstimates.md +5 -6
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/RotationCount.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/RotationDepth.md +4 -5
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/SingleVariant.md +4 -4
- package/docs/{Microsoft.Quantum.ResourceEstimation → Std.ResourceEstimation}/TCount.md +4 -5
- package/docs/toc.yml +252 -251
- package/lib/node/qsc_wasm.cjs +2 -2
- package/lib/node/qsc_wasm_bg.wasm +0 -0
- package/lib/web/qsc_wasm.js +2 -2
- package/lib/web/qsc_wasm_bg.wasm +0 -0
- package/package.json +1 -1
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Reversed
|
|
3
3
|
title: Reversed function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Reversed
|
|
9
|
-
qsharp.summary: "Create an array that contains the same elements as an input array but in reversed order."
|
|
9
|
+
qsharp.summary: "Create an array that contains the same elements as an input array but in reversed order. # Type Parameters ## 'T The type of the array elements. # Input ## array An array whose elements are to be copied in reversed order. # Output An array containing the elements `array[Length(array) - 1]` .. `array[0]`."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Reversed function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Reversed
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Reversed<'T>(array : 'T[]) : 'T[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Create an array that contains the same elements as an input array but in reversed
|
|
22
21
|
order.
|
|
23
22
|
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.SequenceI
|
|
3
3
|
title: SequenceI function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: SequenceI
|
|
9
|
-
qsharp.summary: "Get an array of integers in a given interval."
|
|
9
|
+
qsharp.summary: "Get an array of integers in a given interval. # Input ## from An inclusive start index of the interval. ## to An inclusive end index of the interval that is not smaller than `from`. # Output An array containing the sequence of numbers `from`, `from + 1`, ..., `to`. # Example ```qsharp let arr1 = SequenceI(0, 3); // [0, 1, 2, 3] let arr2 = SequenceI(23, 29); // [23, 24, 25, 26, 27, 28, 29] let arr3 = SequenceI(-5, -2); // [-5, -4, -3, -2] let numbers = SequenceI(0, _); // function to create sequence from 0 to `to` let naturals = SequenceI(1, _); // function to create sequence from 1 to `to` ```"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# SequenceI function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.SequenceI
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function SequenceI(from : Int, to : Int) : Int[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Get an array of integers in a given interval.
|
|
22
21
|
|
|
23
22
|
## Input
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.SequenceL
|
|
3
3
|
title: SequenceL function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: SequenceL
|
|
9
|
-
qsharp.summary: "Get an array of integers in a given interval."
|
|
9
|
+
qsharp.summary: "Get an array of integers in a given interval. # Input ## from An inclusive start index of the interval. ## to An inclusive end index of the interval that is not smaller than `from`. # Output An array containing the sequence of numbers `from`, `from + 1`, ..., `to`. # Remarks The difference between `from` and `to` must fit into an `Int` value. # Example ```qsharp let arr1 = SequenceL(0L, 3L); // [0L, 1L, 2L, 3L] let arr2 = SequenceL(23L, 29L); // [23L, 24L, 25L, 26L, 27L, 28L, 29L] let arr3 = SequenceL(-5L, -2L); // [-5L, -4L, -3L, -2L] ```"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# SequenceL function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.SequenceL
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function SequenceL(from : BigInt, to : BigInt) : BigInt[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Get an array of integers in a given interval.
|
|
22
21
|
|
|
23
22
|
## Input
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Sorted
|
|
3
3
|
title: Sorted function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Sorted
|
|
9
|
-
qsharp.summary: "Given an array, returns the elements of that array sorted by a given comparison function."
|
|
9
|
+
qsharp.summary: "Given an array, returns the elements of that array sorted by a given comparison function. # Type Parameters ## 'T The type of each element of `array`. # Input ## comparison A function that compares two elements such that `a` is considered to be less than or equal to `b` if `comparison(a, b)` is `true`. ## array The array to be sorted. # Output An array containing the same elements as `array`, such that for all elements `a` occurring earlier than elements `b`, `comparison(a, b)` is `true`. # Example The following snippet sorts an array of integers to occur in ascending order: ```qsharp let sortedArray = Sorted(LessThanOrEqualI, [3, 17, 11, -201, -11]); ``` # Remarks The function `comparison` is assumed to be transitive, such that if `comparison(a, b)` and `comparison(b, c)`, then `comparison(a, c)` is assumed. If this property does not hold, then the output of this function may be incorrect."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Sorted function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Sorted
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Sorted<'T>(comparison : (('T, 'T) -> Bool), array : 'T[]) : 'T[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Given an array, returns the elements of that array sorted by a given
|
|
22
21
|
comparison function.
|
|
23
22
|
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Subarray
|
|
3
3
|
title: Subarray function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Subarray
|
|
9
|
-
qsharp.summary: "Takes an array and a list of locations and produces a new array formed from the elements of the original array that match the given locations."
|
|
9
|
+
qsharp.summary: "Takes an array and a list of locations and produces a new array formed from the elements of the original array that match the given locations. # Remarks If `locations` contains repeated elements, the corresponding elements of `array` will likewise be repeated. # Type Parameters ## 'T The type of `array` elements. # Input ## locations A list of locations in the input array that is used to define the subarray. ## array An array from which a subarray will be generated. # Output An array `out` of elements whose locations correspond to the subarray, such that `out[index] == array[locations[index]]`. # Example ```qsharp let array = [1, 2, 3, 4]; let permutation = Subarray([3, 0, 2, 1], array); // [4, 1, 3, 2] let duplicates = Subarray([1, 2, 2], array); // [2, 3, 3] ```"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Subarray function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Subarray
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Subarray<'T>(locations : Int[], array : 'T[]) : 'T[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Takes an array and a list of locations and
|
|
22
21
|
produces a new array formed from the elements of the original
|
|
23
22
|
array that match the given locations.
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Swapped
|
|
3
3
|
title: Swapped function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Swapped
|
|
9
|
-
qsharp.summary: "Applies a swap of two elements in an array."
|
|
9
|
+
qsharp.summary: "Applies a swap of two elements in an array. # Input ## firstIndex Index of the first element to be swapped. ## secondIndex Index of the second element to be swapped. ## array Array with elements to be swapped. # Output The array with the in place swap applied. # Example ```qsharp // The following returns [0, 3, 2, 1, 4] Swapped(1, 3, [0, 1, 2, 3, 4]); ```"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Swapped function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Swapped
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Swapped<'T>(firstIndex : Int, secondIndex : Int, array : 'T[]) : 'T[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Applies a swap of two elements in an array.
|
|
22
21
|
|
|
23
22
|
## Input
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Tail
|
|
3
3
|
title: Tail function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Tail
|
|
9
|
-
qsharp.summary: "Returns the last element of the array."
|
|
9
|
+
qsharp.summary: "Returns the last element of the array. # Type Parameters ## 'A The type of the array elements. # Input ## array Array of which the last element is taken. Array must have at least 1 element. # Output The last element of the array."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Tail function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Tail
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Tail<'A>(array : 'A[]) : 'A
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Returns the last element of the array.
|
|
22
21
|
|
|
23
22
|
## Type Parameters
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Transposed
|
|
3
3
|
title: Transposed function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Transposed
|
|
9
|
-
qsharp.summary: "Returns the transpose of a matrix represented as an array of arrays."
|
|
9
|
+
qsharp.summary: "Returns the transpose of a matrix represented as an array of arrays. # Description Input as an r x c matrix with r rows and c columns. The matrix is row-based, i.e., `matrix[i][j]` accesses the element at row `i` and column `j`. This function returns the c x r matrix that is the transpose of the input matrix. # Type Parameters ## 'T The type of each element of `matrix`. # Input ## matrix Row-based r x c matrix. # Output Transposed c x r matrix. # Example ```qsharp // same as [[1, 4], [2, 5], [3, 6]] let transposed = Transposed([[1, 2, 3], [4, 5, 6]]); ```"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Transposed function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Transposed
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Transposed<'T>(matrix : 'T[][]) : 'T[][]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Returns the transpose of a matrix represented as an array
|
|
22
21
|
of arrays.
|
|
23
22
|
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Unzipped
|
|
3
3
|
title: Unzipped function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Unzipped
|
|
9
|
-
qsharp.summary: "Given an array of 2-tuples, returns a tuple of two arrays, each containing the elements of the tuples of the input array."
|
|
9
|
+
qsharp.summary: "Given an array of 2-tuples, returns a tuple of two arrays, each containing the elements of the tuples of the input array. # Type Parameters ## 'T The type of the first element in each tuple. ## 'U The type of the second element in each tuple. # Input ## array An array containing 2-tuples. # Output Two arrays, the first one containing all first elements of the input tuples, the second one containing all second elements of the input tuples. # Example ```qsharp // split is same as ([5, 4, 3, 2, 1], [true, false, true, true, false]) let split = Unzipped([(5, true), (4, false), (3, true), (2, true), (1, false)]); ``` # See Also - Microsoft.Quantum.Arrays.Zipped"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Unzipped function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Unzipped
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Unzipped<'T, 'U>(array : ('T, 'U)[]) : ('T[], 'U[])
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Given an array of 2-tuples, returns a tuple of two arrays, each containing
|
|
22
21
|
the elements of the tuples of the input array.
|
|
23
22
|
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Where
|
|
3
3
|
title: Where function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Where
|
|
9
|
-
qsharp.summary: "Given a predicate and an array, returns the indices of that array where the predicate is true."
|
|
9
|
+
qsharp.summary: "Given a predicate and an array, returns the indices of that array where the predicate is true. # Type Parameters ## 'T The type of `array` elements. # Input ## predicate A function from `'T` to Boolean that is used to filter elements. ## array An array of elements over `'T`. # Output An array of indices where `predicate` is true."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Where function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Where
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Where<'T>(predicate : ('T -> Bool), array : 'T[]) : Int[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Given a predicate and an array, returns the indices of that
|
|
22
21
|
array where the predicate is true.
|
|
23
22
|
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Windows
|
|
3
3
|
title: Windows function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Windows
|
|
9
|
-
qsharp.summary: "Returns all consecutive subarrays of length `size`."
|
|
9
|
+
qsharp.summary: "Returns all consecutive subarrays of length `size`. # Description This function returns all `n - size + 1` subarrays of length `size` in order, where `n` is the length of `array`. The first subarrays are `array[0..size - 1], array[1..size], array[2..size + 1]` until the last subarray `array[n - size..n - 1]`. # Type Parameters ## 'T The type of `array` elements. # Input ## size Length of the subarrays. ## array An array of elements. # Example ```qsharp // same as [[1, 2, 3], [2, 3, 4], [3, 4, 5]] let windows = Windows(3, [1, 2, 3, 4, 5]); ``` # Remarks The size of the window must be a positive integer no greater than the size of the array"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Windows function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Windows
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Windows<'T>(size : Int, array : 'T[]) : 'T[][]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Returns all consecutive subarrays of length `size`.
|
|
22
21
|
|
|
23
22
|
## Description
|
|
@@ -1,23 +1,22 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Arrays.Zipped
|
|
3
3
|
title: Zipped function
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: function
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Arrays
|
|
8
8
|
qsharp.name: Zipped
|
|
9
|
-
qsharp.summary: "Given two arrays, returns a new array of pairs such that each pair contains an element from each original array."
|
|
9
|
+
qsharp.summary: "Given two arrays, returns a new array of pairs such that each pair contains an element from each original array. # Type Parameters ## 'T The type of the left array elements. ## 'U The type of the right array elements. # Input ## left An array containing values for the first element of each tuple. ## right An array containing values for the second element of each tuple. # Output An array containing pairs of the form `(left[index], right[index])` for each `index`. If the two arrays are not of equal length, the output will be as long as the shorter of the inputs. # Example ```qsharp let left = [1, 3, 71]; let right = [false, true]; let pairs = Zipped(left, right); // [(1, false), (3, true)] ``` # See Also - Microsoft.Quantum.Arrays.Unzipped"
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# Zipped function
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Arrays.Zipped
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
function Zipped<'T, 'U>(left : 'T[], right : 'U[]) : ('T, 'U)[]
|
|
18
18
|
```
|
|
19
19
|
|
|
20
|
-
## Summary
|
|
21
20
|
Given two arrays, returns a new array of pairs such that each pair
|
|
22
21
|
contains an element from each original array.
|
|
23
22
|
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyCNOTChain
|
|
3
3
|
title: ApplyCNOTChain operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyCNOTChain
|
|
9
9
|
qsharp.summary: "Computes the parity of a register of qubits in-place."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyCNOTChain operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyCNOTChain
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyCNOTChain(qubits : Qubit[]) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyControlledOnBitString
|
|
3
3
|
title: ApplyControlledOnBitString operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyControlledOnBitString
|
|
9
9
|
qsharp.summary: "Applies `oracle` on `target` when `controlRegister` is in the state specified by `bits`."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyControlledOnBitString operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyControlledOnBitString
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyControlledOnBitString<'T>(bits : Bool[], oracle : ('T => Unit is Adj + Ctl), controlRegister : Qubit[], target : 'T) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyControlledOnInt
|
|
3
3
|
title: ApplyControlledOnInt operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyControlledOnInt
|
|
9
9
|
qsharp.summary: "Applies a unitary operation on the target if the control register state corresponds to a specified nonnegative integer."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyControlledOnInt operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyControlledOnInt
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyControlledOnInt<'T>(numberState : Int, oracle : ('T => Unit is Adj + Ctl), controlRegister : Qubit[], target : 'T) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyP
|
|
3
3
|
title: ApplyP operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyP
|
|
9
9
|
qsharp.summary: "Given a single-qubit Pauli operator, applies the corresponding operation to a single qubit."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyP operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyP
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyP(pauli : Pauli, target : Qubit) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyPauli
|
|
3
3
|
title: ApplyPauli operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyPauli
|
|
9
9
|
qsharp.summary: "Given a multi-qubit Pauli operator, applies the corresponding operation to a quantum register."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyPauli operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyPauli
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyPauli(pauli : Pauli[], target : Qubit[]) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyPauliFromBitString
|
|
3
3
|
title: ApplyPauliFromBitString operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyPauliFromBitString
|
|
9
9
|
qsharp.summary: "Applies a Pauli operator on each qubit in an array if the corresponding bit of a Boolean array matches a given input."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyPauliFromBitString operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyPauliFromBitString
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyPauliFromBitString(pauli : Pauli, bitApply : Bool, bits : Bool[], qubits : Qubit[]) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyPauliFromInt
|
|
3
3
|
title: ApplyPauliFromInt operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyPauliFromInt
|
|
9
9
|
qsharp.summary: "Applies a Pauli operator on each qubit in an array if the corresponding bit of a Little-endian integer matches a given input."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyPauliFromInt operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyPauliFromInt
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyPauliFromInt(pauli : Pauli, bitApply : Bool, numberState : Int, qubits : Qubit[]) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyQFT
|
|
3
3
|
title: ApplyQFT operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyQFT
|
|
9
9
|
qsharp.summary: "Applies the rotations of Quantum Fourier Transform (QFT) to a little-endian quantum register."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyQFT operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyQFT
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyQFT(qs : Qubit[]) : Unit is Adj + Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyToEach
|
|
3
3
|
title: ApplyToEach operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyToEach
|
|
9
9
|
qsharp.summary: "Applies an operation to each element in a register."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyToEach operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyToEach
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyToEach<'T>(singleElementOperation : ('T => Unit), register : 'T[]) : Unit
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyToEachA
|
|
3
3
|
title: ApplyToEachA operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyToEachA
|
|
9
9
|
qsharp.summary: "Applies an operation to each element in a register. The modifier `A` indicates that the single-element operation is adjointable."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyToEachA operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyToEachA
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyToEachA<'T>(singleElementOperation : ('T => Unit is Adj), register : 'T[]) : Unit is Adj
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyToEachC
|
|
3
3
|
title: ApplyToEachC operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyToEachC
|
|
9
9
|
qsharp.summary: "Applies an operation to each element in a register. The modifier `C` indicates that the single-element operation is controllable."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyToEachC operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyToEachC
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyToEachC<'T>(singleElementOperation : ('T => Unit is Ctl), register : 'T[]) : Unit is Ctl
|
|
@@ -1,17 +1,17 @@
|
|
|
1
1
|
---
|
|
2
|
-
uid: Qdk.
|
|
2
|
+
uid: Qdk.Std.Canon.ApplyToEachCA
|
|
3
3
|
title: ApplyToEachCA operation
|
|
4
|
-
ms.date: 09/
|
|
4
|
+
ms.date: 09/25/2024 12:00:00 AM
|
|
5
5
|
ms.topic: managed-reference
|
|
6
6
|
qsharp.kind: operation
|
|
7
|
-
qsharp.namespace:
|
|
7
|
+
qsharp.namespace: Std.Canon
|
|
8
8
|
qsharp.name: ApplyToEachCA
|
|
9
9
|
qsharp.summary: "Applies an operation to each element in a register. The modifier `CA` indicates that the single-element operation is controllable and adjointable."
|
|
10
10
|
---
|
|
11
11
|
|
|
12
12
|
# ApplyToEachCA operation
|
|
13
13
|
|
|
14
|
-
Fully qualified name:
|
|
14
|
+
Fully qualified name: Std.Canon.ApplyToEachCA
|
|
15
15
|
|
|
16
16
|
```qsharp
|
|
17
17
|
operation ApplyToEachCA<'T>(singleElementOperation : ('T => Unit is Adj + Ctl), register : 'T[]) : Unit is Adj + Ctl
|