Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater
Network
- URL: http://arxiv.org/abs/2308.15815v1
- Date: Wed, 30 Aug 2023 07:39:11 GMT
- Title: Performance of Rotation-Symmetric Bosonic Codes in a Quantum Repeater
Network
- Authors: Pei-Zhe Li, Josephine Dias, William J. Munro, Peter van Loock, Kae
Nemoto, and Nicol\'o Lo Piparo
- Abstract summary: Quantum error correction codes based on continuous variables play an important role for the implementation of quantum communication systems.
A natural application of such codes occurs within quantum repeater systems which are used to combat severe channel losses and local gate errors.
Here we consider a cavity-QED based repeater scheme to address the losses in the quantum channel.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum error correction codes based on continuous variables play an
important role for the implementation of quantum communication systems. A
natural application of such codes occurs within quantum repeater systems which
are used to combat severe channel losses and local gate errors. In particular,
channel loss drastically reduces the distance of communication between remote
users. Here we consider a cavity-QED based repeater scheme to address the
losses in the quantum channel. This repeater scheme relies on the transmission
of a specific class of rotationally invariant error-correcting codes. We
compare several rotation-symmetric bosonic codes (RSBCs) being used to encode
the initial states of two remote users connected by a quantum repeater network
against the convention of the cat codes and we quantify the performance of the
system using the secret key rate. In particular, we determine the number of
stations required to exchange a secret key over a fixed distance and establish
the resource overhead.
Related papers
- Quantum repeaters based on stationary Gottesman-Kitaev-Preskill qubits [0.0]
We consider the bosonic Gottesman-Kitaev-Preskill (GKP) code as a natural choice for a loss-correction-based quantum repeater.
We analyze and assess the performance of such a GKP-based quantum repeater where, apart from the initial state generations and distributions, all operations can be performed via deterministic linear mode transformations.
arXiv Detail & Related papers (2024-06-11T11:04:49Z) - Quantum aggregation with temporal delay [0.0]
We explore the effects of a depolarization channel that occurs for the quantum Reed-Solomon code when quantum aggregation involving different channel lengths is used.
Our results will have a significant impact on the ways physical resources are distributed across a quantum network.
arXiv Detail & Related papers (2024-04-04T07:35:39Z) - Resource-efficient fault-tolerant one-way quantum repeater with code
concatenation [1.4162113230024156]
We propose a one-way quantum repeater that targets both the loss and operational error rates in a communication channel.
We show that intercontinental distances of up to 10,000 km can be bridged with a minimal resource overhead.
arXiv Detail & Related papers (2023-06-12T16:33:23Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - All-photonic one-way quantum repeaters [15.3862808585761]
We propose a general framework for all-photonic one-way quantum repeaters based on the measurement-based error correction.
We present a novel decoding scheme, where the error correction process is carried out at the destination based on the accumulated data from the measurements made across the network.
arXiv Detail & Related papers (2022-10-18T18:07:19Z) - Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
This paper studies the study of fault-tolerant channel coding for quantum channels.
We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario.
We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
arXiv Detail & Related papers (2022-10-06T14:09:16Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Simple efficient decoders for quantum key distribution over quantum
repeaters with encoding [1.218340575383456]
We study the implementation of quantum key distribution systems over quantum repeater infrastructures.
We propose two decoder structures for encoded repeaters that improve system performance.
We quantify the regimes of operation, where one class of repeater outperforms the other.
arXiv Detail & Related papers (2020-12-23T22:45:25Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.