Yeah, this is a really nice feature; on the couple of rare occasions where an update completely borked things I was able to go from unbootable to everything back up and running in half an hour.

I don’t know, I thought it was kind of fun that they mixed things up for a change and had the protagonist be the villain and the central plot be about his triumph over the antagonists who are the heroes; the movie ending with him relaxing and enjoying the sunset now that his great work was over and so he could retire and put down his burdens was a really nice touch.

I can’t speak for other distributions, but Pop!_OS has had a “Refresh Install” option for a while now that does exactly this. This hasn’t happened often, but there have been a couple of times when something borked my system to the point of making it no longer boot, and re-running the installer in “Refresh Install” mode got everything back and running within 30 minutes while preserving all of my non-system files; in particular this meant that I didn’t have to re-download my Steam and other locally installed games, which is significant because they are the largest apps on my system.

Is the main advantage of RISC-V’s that it is a free and open standard, or does it have other inherent advantages over other RISC architectures as well?

I don’t know much about Void Linux. What is it’s selling point that makes it unique?

There are lots of possible choices of universal gate sets. However, if you are starting with Clifford gates, then it turns out to be sufficient for you to add support for a T=sqrt(S) gate; essentially T and H have the property that these two gates by themselves are sufficient to efficiently approximate any 1-qubit gate arbitrarily well (by combining these discrete rotations about the two different angles in the Bloch sphere in specific ways via the Solovay-Kitaev Theorem), and being able to perform an arbitrary 1-qubit gate and having access to an entangling 2-qubit gate (CNOT) lets you extend this to an efficient arbitrarily good approximation of any gate on an any number of qubits.

The home page for it is here. It’s based on a result known as the Gottesman-Knill Theorem which shows (constructively, i.e. providing a concrete algorithm) that quantum circuits consisting solely of Clifford gates (that is, CNOT + Hadamard + Phase, hence CHP) can be simulated efficiently classically.

Or, alternatively, since they are already making the (reasonable) compromise of working with a restricted gate set, they could expand their gate set to the Clifford group and then use the CHP algorithm to scale to much larger systems.

Cute, but the set of quantum gates is so limited that simulating them is trivial, and in particular you don’t need to sample multiple iterations to estimate the probability distribution because you already know it exactly.

So, I know that this doesn’t quite have the same nostalgia feel of the original, but there is a group of fans who have been creating free remasters of the games in the King’s Quest and Quest for Glory series.

In what way do you think it would feature python development?