Strathweb. A free flowing tech monologue.

It is a common scenario to use Azure DevOps to build, sign and release iOS applications.

As you may know from the announcement on this blog (or from the image in the sidebar…), I wrote a quantum computing book titled “Introduction to Quantum Computing with Q# and QDK” which was published by Springer in May 2022.

In the last post of this series we set up a demo .NET client application that was able to call and utilize a GPT model hosted in Azure OpenAI Service, which in turn was integrated with our own custom data via Azure AI Search.

For the last few years (2022, 2021 and 2020), around this time of the year, I published a special festive Q# blog post as part of the Q# Holiday Calendar, organized by Mariia Mykhailova from Microsoft Quantum .

The Q# standard library is equipped with an extensive collection of array functions, meeting a wide array of algorithmic requirements.

In the previous part of this series, we have successfully set up Azure AI Search, to have it ready for integration with Azure OpenAI Service.

This morning, we released version 1.5 of dotnet-script.

There is no question that the emergence of generative AI is going to significantly alter various aspects of our daily lives.

One of the cool new features coming in .NET 8.0 is the ability to take advantage of a zero-overhead approach to access private members, via the UnsafeAccessorAttribute.

At the end of last year I blogged about using .NET 7 and the prototype dotnet WASI SDK from Steve Sanderson to build WASM-WASI applications.

I recently blogged about building GPT-powered applications with Azure OpenAI Service.

Earlier this year I blogged about post-quantum cryptography in .NET using Dilithium and Kyber.

In the last post we covered how UniFFI can be used to elegantly create C bindings and generate bridge C# code that allows for calling native code written in Rust from a C# program.

There are plenty of reasons to be excited about Rust.

In January I blogged about using the QIR Runner as an alternative (or even preferred!)

In this post we will have a look at how we can utilize Azure OpenAI Service to build applications using various OpenAI models.

On March 12th, a new IETF draft JOSE and COSE Encoding for Dilithium was published.

The other day I was involved in setting up a new project based on ASP.NET Core Identity, when I noticed something related to the default configuration that I thought would be worth sharing here.

I have written extensively about quantum computing on this blog before.

Mathematica 13.2 was released last month, and among the wide array of new exciting features, there is a wide set of brand new experimental astronomical computation and visualization functionalities.

I recently blogged about the rather unfortunate series of steps that are needed to make the Q# simulator work on arm64 Mac computers, since that platform is sadly not supported out of the box.

Some time ago I blogged about using the experimental dotnet WASI SDK on ARM Macs.

🎄 This post is part of the Q# Holiday Calendar 2022. 🎅🏻 In 1993, Avshalom Elitzur and Lev Vaidman from Tel-Aviv University wrote a paper in which they proposed a fascinating thought experiment.

This week we released version 1.4 of dotnet-script.

Being involved in the OmniSharp project, I had the pleasure of working a lot with VS Code extension development over the past several years.

There is a new proposal for an extension to OpenID Connect Authentication Framework, called Initiating User Registration via OpenID Connect.

The Problem Details for HTTP APIs RFC provides a unified, machine-readable and standardized recipe for exposing error information out of your HTTP APIs - which is of course beneficial both for the API authors, as well as the integrating parties.

Due to a combination of issues, the current Microsoft.Quantum.Sdk (at the time of writing, version 0.25.222597) does not support arm64 Macs, which of course are the flagship Apple silicon processors from the M1 and M2 family.

During the upgrade process of one of our applications from .NET Core 3.1 to .NET 6.0, I stumbled across a very subtle breaking changing when using the AddDbContextPool() feature of EF Core.

I have recently started a new Q# community repo, aimed at bringing a holistic and structured approach for building up Q# TextMate grammar.

I am extremely happy to announce that on 7 May 2022, my new book, “Introduction to Quantum Computing with Q# and QDK” has been published by Springer, as part of the excellent Quantum Science and Technology series.

WASI stands for WebAssembly System Interface, and allows to run WebAssembly code independently of the browsers, as it provides access to operating system features such as file system access or networking.

With the .NET Core 2.1 having reached end of life, and the looming end of life dates for .NET 5 (this spring) and .NET Core 3.1 (this fall), a lot of developers are facing migrating their services to .NET 6.0.

On December 15, 2021 we released version 1.38.0 of OmniSharp which, for the first time, included .NET 6.0 builds of the OmniSharp server.

Recently, as part of Q# Advent Calendar 2021, I published a special quest post on Q# Community blog.

In this post we will have a look at the subtle difference between two single qubit rotation gates - Rz and R1.

Last week we released version 1.3 of dotnet-script.

Last month we released version 1.2 of dotnet-script.

Back in 2012, when the Roslyn compiler was still closes source and its early CTP stages, I blogged about using its C# scripting capabilities to wire up an ASP.NET Web API server in just a few lines of code, with minimal ceremony.

Some time ago I blogged about introducing a new library, called AsyncExpiringLazy, which can be used for managing lazy-resolved values that expire and must be refreshed - such as for example access tokens to web APIs.

One of the common approaches to testing ASP.NET Core applications is to use the integration testing available via the Microsoft.AspNetCore.TestHost package.

Last time we discussed the Quantum Fourier Transform - one of the important building blocks for more complex quantum algorithms.

In today’s post we will explore one of the important algorithm building blocks in quantum computing theory, called the Quantum Fourier Transform.

Last time we looked at the basic theory behind quantum search based on the Grover’s algorithm.

In this post we will start exploring the topic of quantum search - the ability to locate a specific qubit state in an unsorted data set represented in a qubit register.

Last time, we discussed a problem originally stated by David Deutsch, focusing on determining whether a function is constant or balanced.

Over the course of this series, we have developed a solid foundational understanding of quantum computing, as we learned about the basic paradigms, mathematics and various computational concepts that characterize this unique disciple.

Last time we had an in-depth look at the original Bell’s inequality, and we wrote some Q# code that allowed us to quickly empirically test the predictions of quantum mechanics in that area.

After a short multi-part detour into the world of quantum cryptography, in this part 12 of the series, we are going to return to some of the foundational concepts of quantum mechanics, and look at the programmatic verification of Bell’s inequality.

On this day 120 years ago, December 14 1900, Max Planck presented to the German Physical Society his work on spectral density of black body radiation, and postulated that electromagnetic energy could only be emitted in quantized packets.