4 ms·

You don't need to need understand bra and kets. That's physicist notation. There's nothing stopping you from coding up everything in plain numpy matrix operatio

You don't need to need understand bra and kets. That's physicist notation. There's nothing stopping you from coding up everything in plain numpy matrix operations like in ML. Here are the list of gates, go build your algorithm https://en.m.wikipedia.org/wiki/Quantum_logic_gate https://en.m.wikipedia.org/wiki/Quantum_logic_gate (Hint, the hardest part is hardware, not the math)

pclmulqdq 4y ago
I don't think you understand me. The gates and the math are tied together very simply - the bras and kets are just a simple way to represent the matrix math. Quantum computing will probably advance a lot if it can free itself from the gates (which are tied directly to the equations), and move itself much further towards algorithms. I don't want my quantum computer to constrain me to building up circuits with matrix math operations. Most algorithms you do today are very poorly represented as matrix math that way. As a toy example, write up a sorting algorithm as matrix math using classical gates for me, and come back. Then I will start treating logic gates as a serious way to write algorithms.
- sudosysgen 4y ago
  Many quantum algorithms aren't actually written as matrix math using gates - you can use something ZX as an alternate representation, and if your algorithm is composed of other algorithms you can abstract them and use recursions just fine (and that is in fact done fairly often). There are also other models of writing down quantum computation that don't use logic gates. Pretty often you'll find that papers on the higher-order applicability of quantum computing, which tweak in simple ways or glue together existing basic algorithms, won't use the circuit model for their algorithms at all. The reason the matrix math persists is twofold. Firstly, we don't have good quantum computers, and gate depth is severely limited, plus it can quickly became intractable to simulate inefficient circuits without using tricks, even if they are doing something simple. So we are at a state in quantum computing where writing the basic algorithms requires absolutely extreme optimization, down to the level of logic gates, because it's not feasible to implement or even rigorously prove much any other way. The other issue is that quantum computing offers you an infinite degree of freedom on the operations you can do. While in classical computing there are only two operations you can do on 1 bit, there is an infinite number of operations you can do on 1 qubit. These operations are easily described by a set of orthogonal normalized vectors (as a change of basis), so of course a matrix is the most natural way to describe them. The infinity of basic operations really is the problem here, unfortunately, so simpler ways of describing basic operations aren't really possible. Of course, that doesn't excuse the circuit based approach - that is however due to a limitation in technology.
  - pclmulqdq 4y ago
    This is a really interesting idea, that the use of the "crutch" of the gates and other similar representations is because of how expressive you can (theoretically) be. By the way, I have been a professional FPGA developer for a while, and every few years, vendors think "this will be the time that FPGAs get broad adoption." AI inference is (right now) a perfect problem for FPGA use (literally 100-1000x more efficient than GPUs), but almost nobody cares, despite how powerful the computers are. The reason nobody cares is that FPGA programming is about constructing classical circuits - thinking about algorithms that way is REALLY hard. For example, hash tables were invented in the 60's, but they came to FPGAs in the 2010's. Sure, you can kind of do recursion and other similar ideas, but it's generally really annoying to cram an algorithm into a representation that is FPGA-friendly. I don't want quantum computing to wedge itself into the same trap, particularly when it doesn't look like it needs to on any fundamental level. Maybe I'm wrong that quantum computers will eventually overcome the limitations on depth, etc.
    - melony 4y ago
      There was a company called reconfigure.io with a great solution where channel based concurrency was automatically compiled to parallel FPGA programs but they no long seem to be around
      - pclmulqdq 4y ago
        They are likely in the large graveyard of similar FPGA companies. I can name about 30 of them. All of these programming models hit a wall at a certain point because of the impedance mismatch with the underlying technology.
        KRAKRISMOTT 4y ago
        Actually, would you mind posting some of their names? It's been a while since I looked into this.
- deleted 4y ago
  [deleted]
- macrolocal 4y ago
  The point of quantum computing is that you get much of that matrix math for free.

pclmulqdq 4y ago

I don't think you understand me. The gates and the math are tied together very simply - the bras and kets are just a simple way to represent the matrix math. Quantum computing will probably advance a lot if it can free itself from the gates (which are tied directly to the equations), and move itself much further towards algorithms. I don't want my quantum computer to constrain me to building up circuits with matrix math operations. Most algorithms you do today are very poorly represented as matrix math that way. As a toy example, write up a sorting algorithm as matrix math using classical gates for me, and come back. Then I will start treating logic gates as a serious way to write algorithms.

sudosysgen 4y ago
Many quantum algorithms aren't actually written as matrix math using gates - you can use something ZX as an alternate representation, and if your algorithm is composed of other algorithms you can abstract them and use recursions just fine (and that is in fact done fairly often). There are also other models of writing down quantum computation that don't use logic gates. Pretty often you'll find that papers on the higher-order applicability of quantum computing, which tweak in simple ways or glue together existing basic algorithms, won't use the circuit model for their algorithms at all. The reason the matrix math persists is twofold. Firstly, we don't have good quantum computers, and gate depth is severely limited, plus it can quickly became intractable to simulate inefficient circuits without using tricks, even if they are doing something simple. So we are at a state in quantum computing where writing the basic algorithms requires absolutely extreme optimization, down to the level of logic gates, because it's not feasible to implement or even rigorously prove much any other way. The other issue is that quantum computing offers you an infinite degree of freedom on the operations you can do. While in classical computing there are only two operations you can do on 1 bit, there is an infinite number of operations you can do on 1 qubit. These operations are easily described by a set of orthogonal normalized vectors (as a change of basis), so of course a matrix is the most natural way to describe them. The infinity of basic operations really is the problem here, unfortunately, so simpler ways of describing basic operations aren't really possible. Of course, that doesn't excuse the circuit based approach - that is however due to a limitation in technology.
- pclmulqdq 4y ago
  This is a really interesting idea, that the use of the "crutch" of the gates and other similar representations is because of how expressive you can (theoretically) be. By the way, I have been a professional FPGA developer for a while, and every few years, vendors think "this will be the time that FPGAs get broad adoption." AI inference is (right now) a perfect problem for FPGA use (literally 100-1000x more efficient than GPUs), but almost nobody cares, despite how powerful the computers are. The reason nobody cares is that FPGA programming is about constructing classical circuits - thinking about algorithms that way is REALLY hard. For example, hash tables were invented in the 60's, but they came to FPGAs in the 2010's. Sure, you can kind of do recursion and other similar ideas, but it's generally really annoying to cram an algorithm into a representation that is FPGA-friendly. I don't want quantum computing to wedge itself into the same trap, particularly when it doesn't look like it needs to on any fundamental level. Maybe I'm wrong that quantum computers will eventually overcome the limitations on depth, etc.
  - melony 4y ago
    There was a company called reconfigure.io with a great solution where channel based concurrency was automatically compiled to parallel FPGA programs but they no long seem to be around
    - pclmulqdq 4y ago
      They are likely in the large graveyard of similar FPGA companies. I can name about 30 of them. All of these programming models hit a wall at a certain point because of the impedance mismatch with the underlying technology.
      - KRAKRISMOTT 4y ago
        Actually, would you mind posting some of their names? It's been a while since I looked into this.
deleted 4y ago
[deleted]
macrolocal 4y ago
The point of quantum computing is that you get much of that matrix math for free.