How much entanglement is needed for quantum error correction?
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911003790278656 |
|---|---|
| author | Bravyi, Sergey Lee, Dongjin Li, Zhi Yoshida, Beni |
| author_facet | Bravyi, Sergey Lee, Dongjin Li, Zhi Yoshida, Beni |
| contents | It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglement to encode a qubit. Here, we show that the validity of this belief depends on the specific code and the choice of entanglement measure. To this end, we characterize a tradeoff between the code distance $d$ quantifying the number of correctable errors, and the geometric entanglement measure of logical states quantifying their maximal overlap with product states or more general ``topologically trivial" states. The maximum overlap is shown to be exponentially small in $d$ for three families of codes: (1) low-density parity check codes with commuting check operators, (2) stabilizer codes, and (3) codes with a constant encoding rate. Equivalently, the geometric entanglement of any logical state of these codes grows at least linearly with $d$. On the opposite side, we also show that this distance-entanglement tradeoff does not hold in general. For any constant $d$ and $k$ (number of logical qubits), we show there exists a family of codes such that the geometric entanglement of some logical states approaches zero in the limit of large code length. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_01332 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | How much entanglement is needed for quantum error correction? Bravyi, Sergey Lee, Dongjin Li, Zhi Yoshida, Beni Quantum Physics Mathematical Physics It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled such that codes capable of correcting more errors require more entanglement to encode a qubit. Here, we show that the validity of this belief depends on the specific code and the choice of entanglement measure. To this end, we characterize a tradeoff between the code distance $d$ quantifying the number of correctable errors, and the geometric entanglement measure of logical states quantifying their maximal overlap with product states or more general ``topologically trivial" states. The maximum overlap is shown to be exponentially small in $d$ for three families of codes: (1) low-density parity check codes with commuting check operators, (2) stabilizer codes, and (3) codes with a constant encoding rate. Equivalently, the geometric entanglement of any logical state of these codes grows at least linearly with $d$. On the opposite side, we also show that this distance-entanglement tradeoff does not hold in general. For any constant $d$ and $k$ (number of logical qubits), we show there exists a family of codes such that the geometric entanglement of some logical states approaches zero in the limit of large code length. |
| title | How much entanglement is needed for quantum error correction? |
| topic | Quantum Physics Mathematical Physics |
| url | https://arxiv.org/abs/2405.01332 |