The Stack Overflow podcast is back! Listen to an interview with our new CEO.
3

Let me first answer the general question how to get a reasonably tight Lieb-Robinson (LR) speed when you are facing a generic locally interacting lattice model, and then I'll come back to the 1D XY model in your question, which is very special to be exactly solvable. General Method The method to obtain the tightest bound to date (for a generic short-range ...


2

You can't ignore the constant factors when comparing quantum computation to classical computation. They're too large. For example, here is an image from some slides I presented last year: The things along the bottom are magic state factories. They have a footprint of 150K physical qubits. Since the AND gate uses 150K qubits for 0.6 milliseconds, we surmise ...


1

Quantum computers are not just the "conventional computer killer" or a speedy replacement for the conventional computers as you might have assumed in your question. Firstly, some classical tasks that are well suited to quantum computers. They run them really well in a much lesser time. This is because they are able to crunch large numbers using a small ...


1

Easiest thing talk about the algorithms for each architecture and the difference between physical and logical qubits. As far as I know we do not know yet how to perform quantum error correction efficiently on an adiabatic machine. Most computations on these devices are just repeated lots and lots of times without much error correction. For the gate model ...


Only top voted, non community-wiki answers of a minimum length are eligible