3
$\begingroup$

In classical computing, we correct errors by copying bits and comparing them. However, in quantum computing cloning is impossible. How do entangled states encode redundancy without literally duplicating the qubits, and what physical quantity is actually being “protected”?

$\endgroup$
2
  • $\begingroup$ maybe look into the "quantum singleton bound" - this is a bound on the parameters of a quantum error correcting code derived using the no-cloning theorem. $\endgroup$ Commented Oct 4 at 18:06
  • $\begingroup$ @forky40 Thank you! I’ll definitely look into the quantum singleton bound. I’m also curious about the bigger picture: how entangled states provide redundancy without cloning, and which physical quantities (like logical qubits or stabilizers) are actually being protected in these codes. $\endgroup$ Commented Oct 4 at 18:22

1 Answer 1

6
$\begingroup$

TL;DR: There are many ways of thinking intuitively about classical error correction. We can think of it as a form of data duplication. We can also think of it as the imposition of constraints to curve out a subset of states for the purpose of information encoding. The former is a wrong way of thinking about error correction that, unsurprisingly, leads to the wrong conclusion about the feasibility of quantum error correction. By contrast, the latter provides a natural route to understanding how quantum error correction works.

Wrong way of thinking about classical error correction

On the intuitive level one can think of redundant encoding of classical information realized in classical error correction as exploiting data duplication. This view suggests that quantum error correction should be impossible. However, this turns out to be a weakness of that particular way of looking at error correction.

Better way of thinking about classical error correction

A better way is to regard redundant encoding of classical information as relying on the introduction of constraints, often referred to as checks. A check is a constraint on the set of states of a physical system. States that satisfy all checks are considered valid and are used to represent encoded information. States that fail one or more checks are considered invalid and do not represent any information. Instead, the invalid states are meant to form "buffers" around valid states that absorb errors. The set of violated constraints is the syndrome which, for good codes and sufficiently small error rates, enables one to diagnose errors, i.e. to infer which valid state had been originally encoded.

The constraints inevitably lead to classical correlations in the encoded states.

Examples

Consider a parity bit added to the eight bits of data in an RS-232 link. The extra bit is not really a copy of any of the eight data bits. It is better to think of this situation as involving a constraint that selects an 8-dimensional linear subspace from the 9-dimensional linear space of bit strings.

Consider a credit card number with a check digit appended. The extra digit is not really a copy of any particular digit. Once again, it is better to imagine that we employ a constraint to curve out a subset of valid strings of digits from a large set of all strings of digits of a particular length.

Extension to quantum information

This way of thinking about redundant encoding of information extends naturally to quantum mechanics. Each check is a pair consisting of a quantum observable and an expected eigenvalue. Jointly, all the checks of a quantum error correcting code select a subspace of a quantum processor's Hilbert space. Quantum states within the subspace are considered valid and are used to represent quantum information. Quantum states outside the subspace are considered invalid and don't represent encoded quantum information. Instead, they form a "buffer" that can absorb errors. Measurement outcomes of observables associated with the checks are the syndrome which, for good codes and sufficiently small error rates, enables one to diagnose errors.

Similarly to the classical setting, the constraints inevitably lead to quantum correlations, i.e. entanglement, in the encoded states.

$\endgroup$
1
  • 2
    $\begingroup$ This is such a clear and elegant explanation, I really appreciate how you reframed the problem from duplication to constraints and connected that to stabilizers in quantum codes. I finally understood why entanglement makes error correction possible without violating no-cloning. Thank you for such a thoughtful answer! $\endgroup$ Commented Oct 4 at 23:23

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.