GNSS & Machine Learning Engineer

Tag: Quantum

Google demonstrates that logical Qubits actually reduce Quantum Error Rates

In an announcement from Feb 22, 2023, and in a corresponding Nature paper, Google demonstrates for the first time that logical qubits can actually reduce the error rates in a quantum computer.

Physical qubits have a 1-to-1 relation between a qubit in a quantum algorithm and its physical realization in a quantum system. The problem with physical qubits is that due to thermal noise, they can decohere so they no longer build such a quantum system with a superposition of the bit states 0 and 1. How often this decoherence happens is formalized by the quantum error rate. This error rate influences a quantum algorithm in two ways. First, the more qubits are involved in a quantum algorithm, the higher the probability of an error. Second, the longer a qubit is used in a quantum algorithm and the more gates act on it, i.e. the deeper the algorithm is, also the higher the probability of an error.

It is surprising that it is possible to correct (via quantum error correction algorithms) physical qubit errors without actually measuring the qubits (which would always destroy them). Such error correction codes are at least already known since 1996. The information of a physical qubit that is distributed over a bunch of physical qubits in a way so that certain quantum errors are automatically corrected, builds a logical qubit. However, the physical qubits involved in the logical qubit are also subjected to the quantum error rate. Thus there is an obvious trade-off between involving more physical qubits for a longer time, which could increase the error rate, and having a mechanism to reduce the error rate. Which effect prevails depends on the used error correction code as well as on the error rate of the used physical qubits. Google has now demonstrated for the first time that in their system there is actually an advantage of using a so-called surface code logical qubit.

Scientists from Google AI, Caltech, Harvard, MIT, and Fermilab simulate a traversable wormhole with a quantum computer

Researchers from Google AI, Caltech, Harvard, MIT, and Fermilab simulated a quantum theory on the Google Sycamore quantum processor to probe the dynamics of a quantum system equivalent to a wormhole in a gravity model.

The quantum experiment is based on the ER=EPR conjecture that states that wormholes are equivalent to quantum entanglement. ER stands for Einstein and Rosen who proposed the concept of wormholes (a term coined by Wheeler and Misner in a 1957 paper) in 1935, EPR stands for Einstein, Podolsky, and Rosen who proposed the concept of entanglement in May 1935, one month before the ER paper (see historical context). These concepts were completely unrelated until Susskind and Maldacena conjectured in 2013 that any pair of entangled quantum systems are connected by an Einstein-Rosen bridge (= non-traversable wormhole). In 2017 Jafferis, Gao, and Wall extended the ER=EPR idea to traversable wormholes. They showed that a traversable wormhole is equivalent to quantum teleportation [1][2].

The endeavor was published on Nov 30, 2022 in a Nature article. There is also a nice video on youtube explaining the experiment. Tim Andersen discusses in an interesting article whether or not a wormhole was created in the lab.

© 2023 Stephan Seeger

Theme by Anders NorenUp ↑