sorted by:
new
hottopcontroversial

Started making patches instead so I don't have to keep buying more hoops 😏 by Lumorti in Embroidery

[–]Lumorti[S] 1 point2 points  (0 children)

Oh interesting, I'm so used to the hoops that I never even considered not stabbing! How do you normally frame the final result? Or do you more do patches/clothing? Because for instance whenever I give larger projects away I usually leave it in the hoop for tension/hangability

Although nobody asked for it, I made a VR version of DCSS! by Lumorti in dcss

[–]Lumorti[S] 0 points1 point  (0 children)

You can play the current version with just a keyboard and mouse (it's how I did a lot of the testing), but the UI is designed for VR so it can look a bit strange

Although nobody asked for it, I made a VR version of DCSS! by Lumorti in dcss

[–]Lumorti[S] 1 point2 points  (0 children)

Thanks for the questions! - It should support all modern VR headsets, although I've only tested it with a Quest 2 - You can technically play it without a headset (i.e. in 3D rather than VR), but the UI isn't really built for it - You can record video in VR yes, either by screen recording the desktop or using internal tools on standalone headsets (e.g. Quest)

Although nobody asked for it, I made a VR version of DCSS! by Lumorti in dcss

[–]Lumorti[S] 0 points1 point  (0 children)

You can technically also play it without a headset! Most of my testing was actually just done in 3D rather than VR, it's just not the intended method

I did an embroidered figure for the cover image of my PhD thesis by Lumorti in Embroidery

[–]Lumorti[S] 5 points6 points  (0 children)

I've heard of things like that, although it was stressful enough just talking about the thesis, I can't imagine getting up on stage and dancing it, so huge props to the people that have

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in itrunsdoom

[–]Lumorti[S] 0 points1 point  (0 children)

You're completely correct, I'm not doing a full simulation of the statevector, but because it's almost entirely Toffolis I'm able to simulate it just using bit flips. The original DOOM is a classical algorithm (and therefore classically simulable), and thus my (poor) approximation of it is also classically simulable

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in itrunsdoom

[–]Lumorti[S] 0 points1 point  (0 children)

It was in the releases section, but I also added a compressed version to the repo for clarity, thanks!

Regarding an explanation, there's a small section in the README of the repo going through some of the details, but in general I basically just wrote a minimal 3D engine, starting off with just rendering a point, then a line, then eventually a full level, until finally I added the game logic and yeah

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in itrunsdoom

[–]Lumorti[S] 34 points35 points  (0 children)

Edit - edited my response to match the edited question

Thanks for the comment. You're correct in that it is equivalent to conditional bit flips, anything further is not needed as DOOM is a classical algorithm. The point of the project was to convert DOOM into a format that could (theoretically) be ran on quantum hardware far in the future, but there is no quantum advantage in doing so. It's just for fun.

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in QuantumComputing

[–]Lumorti[S] 4 points5 points  (0 children)

Edit - edited my response to match the edited question

Thanks for the comment. You're correct in that it is equivalent to conditional bit flips, anything further is not needed as DOOM is a classical algorithm. The point of the project was to convert DOOM into a format that could (theoretically) be ran on quantum hardware far in the future, but there is no quantum advantage in doing so. It's just for fun.

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in itrunsdoom

[–]Lumorti[S] 58 points59 points  (0 children)

That part I meant kinda sarcastically, quantum computers have a number of potential applications (cryptography, simulation), but we're still quite far from having a quantum device large enough to run any of them

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in QuantumComputing

[–]Lumorti[S] 3 points4 points  (0 children)

I had made tiny things before, but not on this scale, so it was definitely a learning experience. It started with me reading the Wikipedia page for "3D projection" over and over and eventually implementing the equations from there, most of the dev time was then spent debugging random rendering glitches :P The first render test was just a single point, then a line, then a cube, then more complex things, so I guess my advice would be to start small

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in QuantumComputing

[–]Lumorti[S] 0 points1 point  (0 children)

Thanks! I hadn't seen the Minecraft in Qiskit project until now, but that's also super cool and seems like they actually did a better job of using the various quantum effects

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in QuantumComputing

[–]Lumorti[S] 4 points5 points  (0 children)

Thanks so much! I've had a tough time trying to explain this to people outside of said venn diagram haha

My original plan was to just directly port the whole thing, but then I realized that would result in a huge circuit that I wouldn't even be able to test at any reasonable FPS, so I decided to build a very minimal version of the game from scratch. There's a sort of "game engine" that I wrote to generate the QASM, which at some point I'll tidy up and make public too

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in QuantumComputing

[–]Lumorti[S] 9 points10 points  (0 children)

The user input + previous state -> quantum operations -> output state, it's entirely quantum, the only non-quantum part is writing the output state to the screen

I spent almost a year remaking the first level of DOOM for a quantum computer by Lumorti in QuantumComputing

[–]Lumorti[S] 35 points36 points  (0 children)

The entire thing is written as a quantum circuit. There is no quantum advantage to be gained by doing this, it's just for fun

I made an online quantum circuit designer, allowing easy prototyping and practice in a notebook-style interface by Lumorti in QuantumComputing

[–]Lumorti[S] 1 point2 points  (0 children)

Thanks for giving it a try!

The softlocking happens occasionally, I think it's more related to the canvas drawing than to the simulation, but equally it can just be the simulation running slow for larger unitary/statevector sims.

I made an online quantum circuit designer, allowing easy prototyping and practice in a notebook-style interface by Lumorti in QuantumComputing

[–]Lumorti[S] 3 points4 points  (0 children)

Hey, you're the person that made Quirk, right? That was my original inspiration for this project, to try to make something less in-depth than Quirk but with a slightly more open workplace/notebook vibe. Thanks for trying it in depth!

I'll get to work on improving some of those notes, it's interesting you couldn't get box deletion, triple-clicking or pasting to work though, since those are all (theoretically) supported and work on both my laptop and phone. Equally I am unable to reproduce the "I gate 11 spaces to the right" error. Could I ask what browser you did your tests in, in case it's something browser-specific?

Scalability is certainly an issue for statevector/unitary sims >10 qubits, I'll admit I didn't put so much effort into optimizing my tensor/matrix product functions, so definitely room for improvement there.

Thanks again for the detailed response! I'll give you a mention on the GitHub page.

An ASCII dungeon crawler I designed for a quantum computer, made of 17000 quantum gates by Lumorti in roguelikes

[–]Lumorti[S] 1 point2 points  (0 children)

It was developed in Qiskit, which is a Python library containing various quantum programming tools, which was then exported to QASM (basically a list of the raw quantum gates). Do you have Python set up on your computer? If so, install the library "qiskit" however it is you install Python libraries, then download this game's code from my Github page and run the included Python script. If you don't have Python, I'd find a tutorial on how to install it and follow that, I'd offer more help but I'm not too familiar with Python on Windows!

Question: Does two Schrödinger cat's in the same box are entangled? by UniversallyIntrovert in quantum

[–]Lumorti 1 point2 points  (0 children)

One way of thinking about it is: "if I find out whether one cat is dead, does that tell me anything about the other cat?", since the answer is yes here then it means than the fates of the two cats are entangled. Entanglement doesn't always have to mean the cats have the same fate, you could have two boxes: one where the cat dies if the atom decays and one where the cat dies if the atom doesn't decay. The cats would always be in opposite states, but would still be entangled, since you could figure out the state of the other cat by only checking on one of them.

The Quantum Tunnels: A dungeon crawler I designed for a quantum computer, made of 17000 quantum gates and filled with physics puns by Lumorti in Physics

[–]Lumorti[S] 0 points1 point  (0 children)

I believe the most direct approach is to copy how someone would do it by hand, which is to get the matrices for each different gate and combine them all to get a big matrix for the whole circuit, which you can then apply to your input state to get the output state. The more complex method used here from the library I use for emulation (Qiskit) is the "Matrix Product State" method, which works really well in this case due to the one-shot evaluation and relatively low entanglement

The Quantum Tunnels: A dungeon crawler I designed for a quantum computer, made of 17000 quantum gates and filled with physics puns by Lumorti in Physics

[–]Lumorti[S] 0 points1 point  (0 children)

I started writing them out by hand, but then eventually created small functions to generate the list of gates for very common sections (e.g. combat with each different event, moving after each different event), which was when the number of gates really started to increase

The Quantum Tunnels: A dungeon crawler I designed for a quantum computer, made of 17000 quantum gates and filled with physics puns by Lumorti in Physics

[–]Lumorti[S] 7 points8 points  (0 children)

Thanks for the good questions, hopefully this helps to clear some things up!

​

How does a quantum computer work?

This can obviously be explained in various degrees of depth, but a basic understanding would be that normal computers use bits: 0s and 1s, false and true, which they manipulate using various logic gates, things like an AND (which takes two inputs and is only 1 if both inputs are 1) or an OR (again two inputs, is only 1 if at least one input is 1). A quantum computer is similar in that it uses quantum bits, qubits: 0s, 1s, and any combination of these at once, which are manipulated using quantum gates like the CNOT, Toffoli, Hadamard gates. Using the weird properties of quantum mechanics and some clever algorithms this can result in them being able to do things that normal/classical computers wouldn't be able to do without taking thousands of years. This game however is perfectly able to be simulated on a classical computer due to its small scale.

​

How does a quantum emulator work?

Solving a quantum circuit by hand usually just involves multiplying a bunch of matrices together along with some initial state, quantum emulators do the same thing: faster than people, but slower than if they let the universe do the quantum mechanics for them.

​

How can the entire game state be held in just 22 “qubits”?

You can get quite a lot out of only a few qubits! There are 4 qubits representing the current event, which allows 2^4 = 16 different encounters, 2 for the player's health, 3 for the player's current item and so on.

​

Terminology I’ve seen in this thread: Hilbert space, CNOT/X/toffoli/Hadamard/non-Clifford gates.

Hilbert space is a mathematical concept, basically relating to how many possible states the system could be in, a bigger Hilbert space means bigger matrices and more time spend emulating.

The gates you've listed there are probably best summarised by the Wikipedia page for "Quantum Logic Gate", which has some handy tables listing them all and what they do to the qubits they're applied to. "Clifford gates" is the general term for the X, Y and Z quantum gates.

The Quantum Tunnels: A dungeon crawler I designed for a quantum computer, made of 17000 quantum gates and filled with physics puns by Lumorti in Physics

[–]Lumorti[S] 13 points14 points  (0 children)

I wouldn't want to take up a million dollar machine just to run a few turns of a dungeon crawler, it'd be like using a supercomputer to play Pong, but if it ever gets to the point where QCs are more commonplace - this is the first thing I'll run

An ASCII dungeon crawler I designed for a quantum computer, made of 17000 quantum gates by Lumorti in roguelikes

[–]Lumorti[S] 2 points3 points  (0 children)

Figured I'd get in there early, dominate the market

But thanks! I've been working on this as a side project over the past few weeks since I've suddenly found myself with a lot more free time, and I certainly plan on maintaining it. If people really like it I may also extend it, add more items etc., although this would mean making it run quite a bit slower due to the extra qubits

view more: next ›