Quantum Computers Need More than “Magic”

The University of Cambridge is a special place. During term time, hordes of students gather, ready to attend formal, a candle-lit dinner in a five-century-old hall overlooked by paintings of academics past. The sight is like an overromanticized still of a bygone era. The men wear suits, the women long dresses, all wear gowns. The simplest gowns belong to the undergrads, with the complexity and length of the gowns growing as one climbs the academic ranks. 

Between the bringing of the bread and the serving of the soup, the conversation at my end of the table typically turns to my topic of research: quantum computers. These theoretical machines harness quantum physics to outperform their classical counterparts. Quantum computers hold great promise for the future, with applications ranging from drug discovery to cybersecurity. Yet, despite their promise, we still do not have a satisfying answer to the fundamental question: what makes quantum computers computationally stronger than classical computers?

To answer this question, imagine that tonight, instead of the soup, the cooks are brewing a happiness potion. This potion causes the drinker to be joyful and content for the rest of the evening. The cooks know how to brew the potion perfectly well; they discovered the list of ingredients in the nineties and have been successfully brewing ever since. But the cooks still cannot solve one mystery: what makes the potion different from the soup? What ingredient sets the potion apart from the soup?

The cooks come up with a simple approach. They leave out one ingredient in each serving, and then carefully observe the formal-goers. They find that almost every seat is filled by a happy student, chatting away to their neighbours, indicating a working potion. However, one student’s spirits have not been lifted, as they were solely served a simple soup. The cooks conclude that the ingredient they withheld for that student was essential. They name this ingredient magic.

In my research, the potion is a quantum computer, the soup is a classical computer, and magic is the actual technical term used for quantum states that promote certain classical computers to quantum computers. Without magic, these quantum computers are computationally no stronger than a normal laptop. 

So magic is necessary for quantum computational advantage, but is it enough? Over a decade ago, researchers found that, for quantum computers built on qutrits, the answer is no. To understand what a qutrit is, consider the regular bit: a switch that’s either zero or one. The qubit, the quantum generalization of the bit, can be both zero and one simultaneously. The qutrit is a roomier qubit that can be zero, one, two, or any of those simultaneously. 

It is possible to build quantum computers using qutrits. However, the vast majority of quantum computers are built on qubits, the quantum generalisation of the everyday bit. My colleagues and I have recently discovered that for qubit-based quantum computers, too, magic is not enough to gain an advantage over classical computers. Picture the cooks dumping jar after jar of magic into a soup, only to find that the soup never gains magical powers. Potions need more than magic. Potions also need Kirkwood-Dirac negativity.

What is Kirkwood-Dirac negativity? The idea developed by John Kirkwood and Paul Dirac builds on probabilities—for example, the odds of obtaining a heads upon flipping a coin. One can describe a quantum computer using numbers that behave similarly to probabilities but come with a twist: they may be negative. These negative “probabilities” mark where quantum departs from classical. The main result of our paper is that this negativity, too, is a necessary ingredient: without it, no amount of magic will turn the soup into a potion.

At this point in the conversation, I am typically cut off by the arrival of the soup. The conversation moves on from quantum computers to different subjects, and I usually look up at the paintings staring down at me. One of them is of Dirac, who spent many dinners discussing quantum theory in the same dining hall. The University of Cambridge is a special place.

3 thoughts on “Quantum Computers Need More than “Magic””

  1. The difficulty with this is that classical mechanics can be presented in Koopman’s Hilbert space formalism, within which noncommutativity and noncontextuality can be classically natural. If we take Koopman seriously enough that we include noncommutativity/noncontextuality (which includes all the algebraic structures that are usually mentioned, including magic), then we have to ask what else is characteristically different between classical and quantum, to which one answer is that if quantum noise must be different from thermal noise because otherwise the history of physics in the 20thC would have been completely different. That difference must be in terms of Lorentz invariance because that is the difference between them in QFT and we have to take an empirically grounded symmetry.
    There is a third difference, which can be loosely called analyticity because it is similar to the difference between the real signal and the analytic signal in signal analysis (which is an alternative classical starting point that is usefully different from classical mechanics because it is partway towards QFT and uses Hilbert spaces just because it uses Fourier transforms so intensively.)
    The details can become unruly, but as well as I can currently explain them can be found in the most recent video on my YouTube channel, “Explaining Quantum Field Theory as a Dataset&Signal Analysis Formalism #CORE1”, which was recently 1 of 5 prizewinners in a Competition for Outstanding Research Explanation on YouTube (hence the #CORE1 in the title) and which Google should easily find.
    I apologize that this is conceptually somewhat different from your post, but that goes with the territory.

    • My subconscious
      while sleeping
      noticed
      the copy-editing
      nightmare
      that a global replace
      is needed
      in the comment above
      noncontextuality ⟶ contextuality
      To wake at 4:30am to abject misery

  2. Hypothetically, let’s say quantum supremacy wins a Nobel Prize. That is what the prediction markets says is the investing public’s will. A major challenge is explaining why a quantum computer beats a classical computer at a fancy dinner with Swedish royalty.

    A universal Turing machine can take any input of bits and perform operations to create any output after a large number of operations. Each operation takes some small amount of time to compute. But the solution to hard problems may take longer than the lifetime of the universe to compute.

    If an output of n discrete bits can generate 2^n distinct possible answers, then we can see that the complexity and time of computations grow fast.

    In a quantum computer, qubits occupy both up and down states simultaneously; therefore, it only takes n qubits to be in a superposition of every possible answer at the same time. But it gets better because we can change the probabilities so some qubits are more likely to be a one or a zero. This means we can take different quantum inputs from different problems, interfere them, and instantly collapse the quantum states into a solution to the hard problem.

    Quantum superposition lets the computer exist in all possible answers simultaneously, and wavefunction collapse reduces computation to an instantaneous quantum measurement.

    Remember to bow to the king because he is the sunmbolic head of state and the Nobel Prize is an important Swedish death ritual to honor their most celebrated warlord. I suggest watching the movie Midsommar to understand the ritual’s importance in preventing Ragnarok.

    https://arresteddevelopment.fandom.com/wiki/The_Alliance_of_Magicians

Your thoughts here.