7

In two places so far, I've heard statements of the sort "... and we need the Hamiltonian to be non-commuting. If not, the algorithm is classical, and we get no benefit from using a quantum computer."

For reference, here are two timestamped youtube links to my examples:

So why is this the case? Looking for any good answers, but for me 1 to 3 intuitive "ways of looking at it" works best, even if they aren't airtight explanations.

Alexander Soare
  • 656
  • 4
  • 16

2 Answers2

6

First, a minor point: it doesn't make any sense to say that "a Hamiltonian commutes". You mean that the different terms in the Hamilonian commute. When it comes to commutation, it takes two (or more) to tango.

It is indeed often said that if all the terms of a Hamiltonian commute, then the Hamiltonian is classical. But that isn't really true in my opinion. It's true that if all the terms in the Hamiltonian commute, then there exists a basis of the Hilbert space that simultaneous diagonalizes every term. After you've found this basis and rotated into it, the Hamiltonian does indeed become effectively classical, because each term in the Hamiltonian just contributes a value (that term's eigenvalue) to the total energy, without changing the state at all. Since the Hamiltonian doesn't modify these basis states, its "operator" nature effectively falls away and it basically just becomes a scalar energy function.

But the energy eigenstates are typically complicated superpositions of computational basis states, so they can be nontrivial to calculate (and certainly to engineer experimentally). So the "quantum-ness" only vanishes after you've finished the highly quantum step of finding the simultaneous eigenstates of each term in the Hamiltonian.

For example, the toric code Hamiltonian has every term commuting, and you do sometimes hear the toric code described as "classical", but I personally would say that it's highly quantum.

Finally, saying that "all terms in the Hamiltonian commute" is somewhat ambiguous anyway, because you can sometimes group smaller non-commuting terms together into larger terms that do commute. There's no unambiguous definition of what counts as "a single term" in the Hamiltonian.

tparker
  • 2,939
  • 13
  • 26
3

For all we know, it seems that fully-fledged quantum computations indeed require gates (and thus Hamiltonians generating those gates) which don't commute. (But this does not mean that we know this for sure!)

However, it is not true that otherwise, the system can be classically simulated (at least, again, there is strong evidence for that). That is, such a system might not constitute a fully-fledged quantum computer, yet it is more powerful than a classical device. A specific scheme is "instantaneous quantum computing", where all gates commute, yet where evidence has been given that it cannot be classically simulated.

Norbert Schuch
  • 8,142
  • 1
  • 19
  • 30