Pith. Sign in

RECORD

Long-distance quantum communication over noisy networks without long-time quantum memory

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Pawe{l} Mazurek, Andrzej Grudka, Micha{l} Horodecki, Pawe{l} Horodecki, Justyna {L}odyga, {L}ukasz Pankowski, Anna Przysiężna

Quantum Physics · Submitted 5 Feb 2012

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error.

how it is stated · asserted 0.76 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1202.1016 (version 5)
Pith IDGIZIVYHR, Pith's permanent record of this paper and its review
CitationAndrzej Grudka, Anna Przysi\k{e}\.zna, Justyna {\L}odyga, {\L}ukasz Pankowski, Micha{\l} Horodecki, Pawe{\l} Horodecki, Pawe{\l} Mazurek. "Long-distance quantum communication over noisy networks without long-time quantum memory." arXiv:1202.1016 (2012). https://pith.science/paper/GIZIVYHR
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,432 input tokens, $0.0003 reported.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.44 · human participants 0.02 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.79 · compares with prior results 0.66 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v5. Results and the main claim are underlined; .

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension $D$ and transmission of quantum information in a $D+1$-dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. background 1.00 0.05 0.03 asserted 1.00
s1 A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. background 0.98 0.07 0.04 hedged possibility 0.99
s2 In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension $D$ and transmission of quantum information in a $D+1$-dimensional network. background 1.00 0.03 0.04 asserted 1.00
s3 We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. result 0.83 0.92 0.60 asserted 0.76
s4 For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. method 0.71 0.85 0.12 hedged possibility 0.56
s5 Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. interpretation 0.65 0.78 0.13 asserted 0.81
s6 It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. interpretation 0.80 0.82 0.14 asserted 1.00
s7 We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices. result 0.44 0.95 0.13 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.52 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v5
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension $D$ and transmission of quantum information in a $D+1$-dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

9 arXiv papers cite this in 27 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 21 sentences without a confident label

Compares with it 1 paper
  • Then, since every pair of the 1st-leaf (candidate) qubits in the state $|G_c^m⟩$ is already entangled, in contrast to conventional repeater protocols [ref] , we are not required to perform the (possibly probabilistic) Bell measurement on the qubits $DE$, let alone to specify the qubits $DE$ in advance.

    All photonic quantum repeaters · Time-Reversed All-Photonic Quantum Repeaters · 0.88

Cites it as support 1 paper
  • In fact, some [ref] of them have already been shown to work even with finite-coherence-time matter qubits.

    All photonic quantum repeaters · Introduction · 0.98

Cites it as background 4 papers

What it cites · 9 sentences without a confident label

Uses the method or tool of 1 paper
Compares with 1 paper
Cites as background 5 papers
  • This scenario put forward in [ref] , an alternative to quantum repeaters [ref] is closely related to entanglement percolation [ref] , and may be crucial to increase the distance of quantum communication beyond the present capabilities which are now of order of hundred kilometers.

    One-shot entanglement generation over long distances in noisy quantum networks · Introduction · 0.87

  • This scenario put forward in [ref] , an alternative to quantum repeaters [ref] is closely related to entanglement percolation [ref] , and may be crucial to increase the distance of quantum communication beyond the present capabilities which are now of order of hundred kilometers.

    Entanglement Percolation in Quantum Networks · Introduction · 0.87

  • This scenario put forward in [ref] , an alternative to quantum repeaters [ref] is closely related to entanglement percolation [ref] , and may be crucial to increase the distance of quantum communication beyond the present capabilities which are now of order of hundred kilometers.

    Long-distance quantum communication with atomic ensembles and linear optics · Introduction · 0.87

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.