Decoding topological XYZ^(2) codes with reinforcement learning based on attention mechanisms

Quantum error correction, a technique that relies on the principle of redundancy to encode logical information into additional qubits to better protect the system from noise, is necessary to design a viable quantum computer. For this new topological stabilizer code-XYZ^(2) code defined on the cellular lattice, it is implemented on a hexagonal lattice of qubits and it encodes the logical qubits with the help of stabilizer measurements of weight six and weight two. However topological stabilizer codes in cellular lattice quantum systems suffer from the detrimental effects of noise due to interaction with the environment. Several decoding approaches have been proposed to address this problem. Here, we propose the use of a state-attention based reinforcement learning decoder to decode XYZ^(2) codes, which enables the decoder to more accurately focus on the information related to the current decoding position, and the error correction accuracy of our reinforcement learning decoder model under the optimisation conditions can reach 83.27% under the depolarizing noise model, and we have measured thresholds of 0.18856 and 0.19043 for XYZ^(2) codes at code spacing of 3–7 and 7–11, respectively. our study provides directions and ideas for applications of decoding schemes combining reinforcement learning attention mechanisms to other topological quantum error-correcting codes.

Scheme for implementing quantum dense coding with four-particle decoherence-free states in an ion trap

This paper proposes an experimentally feasible scheme for implementing quantum dense coding of trapped-ion system in decoherence-free states. As the phase changes due to time evolution of components with different eigenenergies of quantum superposition are completely frozen, quantum dense coding based on this model would be perfect. The scheme is insensitive to heating of vibrational mode and Bell states can be exactly distinguished via detecting the ionic state.

Scheme for implementing quantum dense coding with W-class state in cavity QED

An experimentally feasible protocol for realizing dense coding by using a class of W-state in cavity quantum electrodynamics （QED） is proposed in this paper. The prominent advantage of our scheme is that the successful probability of the dense coding with a W-class state can reach 1. In addition, the scheme can be implemented by the present cavity QED techniques.

Quantum dense coding using a peculiar tripartite entangled state

Following a recent proposal （Phys. Left. A 346 （2005） 330） about quantum dense coding using a tripartite entangled GHZ state and W state, this paper proposes an experimentally feasible scheme for dense coding in cavity QED by using another peculiar tripartite entangled state. In the scheme the atoms interact simultaneously with a highly detuned cavity mode with the assistance of a classical field, the successful probability of dense coding scheme with this peculiar tripartite entangled state equals 1.

Efficient scheme for realizing quantum dense coding with GHZ state in separated low-Q cavities

We propose an efficient scheme for realizing quantum dense coding with three-particle GHZ state in separated low-Q cavities. In this paper, the GHZ state is first prepared with three atoms trapped, respectively, in three spatial separated cavities. Meanwhile, with the assistance of a coherent optical pulse and X-quadrature homodyne measurement, we can im- plement quantum dense coding with three-particle GHZ state with a higher probability. Our scheme can also be generalized to realize N-particle quantum dense coding.

Quantum superdense coding based on hyperentanglement

We present a scheme for quantum superdense coding with hyperentanglement, in which the sender can transfer four bits of classical information by sending only one photon. The important device in the scheme is the hyperentangled Bell-state analyzer in both polarization and frequency degrees of freedom, which is also constructed in the paper by using a quantum nondemolition detector assisted by cross-Kerr nonlinearity. Our scheme can transfer more informationwith less resources than the existing schemes and is nearly deterministic and nondestructive.

Perfect quantum teleportation and dense coding protocols via the 2N-qubit W state

In this paper, we investigate perfect quantum teleportation and dense coding by using an 2N-qubit W state channel. In the quantum teleportation scheme, an unknown N-qubit entangled state can be perfectly teleported. One ebit of entanglement and two bits of classical communication are consumed in the teleportation process, just like when using the Bell state channel. While N ＋ 1 bits of classical information can be transmitted by only sending N particles in the dense coding protocol.

Continuous-Variable Quantum Network Coding Based on Quantum Discord

Establishing entanglement is an essential task of quantum communication technology.Beyond entanglement,quantum discord,as a measure of quantum correlation,is a necessary prerequisite to the success of entanglement distribution.To realize efficient quantum communication based on quantum discord,in this paper,we consider the practical advantages of continuous variables and propose a feasible continuous-variable quantum network coding scheme based on quantum discord.By means of entanglement distribution by separable states,it can achieve quantum entanglement distribution from sources to targets in a butterfly network.Compared with the representative discrete-variable quantum network coding schemes,the proposed continuous-variable quantum network coding scheme has a higher probability of entanglement distribution and defends against eavesdropping and forgery attacks.Particularly,the deduced relationship indicates that the increase in entanglement is less than or equal to quantum discord.

Encoding entanglement-assisted quantum stabilizer codes

We address the problem of encoding entanglement-assisted （EA） quantum error-correcting codes （QECCs） and of the corresponding complexity. We present an iterative algorithm from which a quantum circuit composed of CNOT, H, and S gates can be derived directly with complexity O（n2） to encode the qubits being sent. Moreover, we derive the number of each gate consumed in our algorithm according to which we can design EA QECCs with low encoding complexity. Another advantage brought by our algorithm is the easiness and efficiency of programming on classical computers.

Controlled Quantum Network Coding Without Loss of Information

Quantum network coding is used to solve the congestion problem in quantum communication,which will promote the transmission efficiency of quantum information and the total throughput of quantum network.We propose a novel controlled quantum network coding without information loss.The effective transmission of quantum states on the butterfly network requires the consent form a third-party controller Charlie.Firstly,two pairs of threeparticle non-maximum entangled states are pre-shared between senders and controller.By adding auxiliary particles and local operations,the senders can predict whether a certain quantum state can be successfully transmitted within the butterfly network based on the Z-{10>,|1>}basis.Secondly,when trans-mission fails upon prediction,the quantum state will not be lost,and it will sill be held by the sender.Subsequently,the controller Charlie re-prepares another three-particle non-maximum entangled state to start a new round.When the predicted transmission is successful,the quantum state can be transmitted successfully within the butterfly network.If the receiver wants to receive the effective quantum state,the quantum measurements from Charlie are needed.Thirdly,when the transmission fails,Charlie does not need to integrate the X-{1+>,1->}basis to measure its own particles,by which quantum resources are saved.Charlie not only controls the effective transmission of quantum states,but also the usage of classical and quantum channels.Finally,the implementation of the quantum circuits,as well as a flow chart and safety analysis of our scheme,is proposed.

A Practical Quantum Network Coding Protocol Based on Non-Maximally Entangled State

In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However,in actual quantum networks,a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises.Therefore,we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states.In this paper,a practical quantum network coding protocol over grail network is proposed,in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted.The achievable rate region,security and practicability of the proposed protocol are discussed and analyzed.This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.

Quantum superdense coding via cavity-assisted interactions

Quantum superdense coding （QSC） is an example of how entanglement can be used to minimize the number of carriers of classical information. This paper proposes two schemes for implementing QSC by means of cavity assisted interactions with single-photon pulses. The schemes are insensitive to the cavity decay and the thermal field, thus it might be realizable based on the current cavity QED techniques.

Quantum Remote State Preparation Based on Quantum Network Coding

As an innovative theory and technology,quantum network coding has become the research hotspot in quantum network communications.In this paper,a quantum remote state preparation scheme based on quantum network coding is proposed.Comparing with the general quantum remote state preparation schemes,our proposed scheme brings an arbitrary unknown quantum state finally prepared remotely through the quantum network,by designing the appropriate encoding and decoding steps for quantum network coding.What is worth mentioning,from the network model,this scheme is built on the quantum k-pair network which is the expansion of the typical bottleneck network—butterfly network.Accordingly,it can be treated as an efficient quantum network preparation scheme due to the characteristics of network coding,and it also makes the proposed scheme more applicable to the large-scale quantum networks.In addition,the fact of an arbitrary unknown quantum state remotely prepared means that the senders do not need to know the desired quantum state.Thus,the security of the proposed scheme is higher.Moreover,this scheme can always achieve the success probability of 1 and 1-max flow of value k.Thus,the communication efficiency of the proposed scheme is higher.Therefore,the proposed scheme turns out to be practicable,secure and efficient,which helps to effectively enrich the theory of quantum remote state preparation.

A simple scheme for implementing four-atom quantum dense coding in cavity QED

An experimentally feasible scheme for implementing four-atom quantum dense coding of an atom-cavity system is proposed. The cavity is only virtually excited and no quantum information will be transferred from the atoms to the cavity. Thus the scheme is insensitive to cavity decay and the thermal field. In the scheme, Alice can send faithfully 4 bits of classical information to Bob by sending two qubits. Generalized Bell states can be exactly distinguished by detecting the atomic state, and quantum dense coding can be realized in a simple way.

Anti-Noise Quantum Network Coding Protocol Based on Bell States and Butterfly Network Model

How to establish a secure and efficient quantum network coding algorithm isone of important research topics of quantum secure communications. Based on thebutterfly network model and the characteristics of easy preparation of Bell states, a novelanti-noise quantum network coding protocol is proposed in this paper. The new protocolencodes and transmits classical information by virtue of Bell states. It can guarantee thetransparency of the intermediate nodes during information, so that the eavesdropper Evedisables to get any information even if he intercepts the transmitted quantum states. Inview of the inevitability of quantum noise in quantum channel used, this paper analyzesthe influence of four kinds of noises on the new protocol in detail further, and verifies theefficiency of the protocol under different noise by mathematical calculation and analysis.In addition, based on the detailed mathematical analysis, the protocol has functioned wellnot only on improving the efficiency of information transmission, throughput and linkutilization in the quantum network, but also on enhancing reliability and antieavesdroppingattacks.

Effects of intrinsic decoherence on various correlations and quantum dense coding in a two superconducting charge qubit system

The influence of intrinsic decoherence on various correlations and dense coding in a model which consists of two identical superconducting charge qubits coupled by a fixed capacitor is investigated. The results show that, despite the intrinsic decoherence, the correlations as well as the dense coding channel capacity can be effectively increased via the combination of system parameters, i.e., the mutual coupling energy between the two charge qubits is larger than the Josephson energy of the qubit. The bigger the difference between them is, the better the effect is.

On the complete weight distributions of quantum error-correcting codes

In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.

Performance of entanglement-assisted quantum codes with noisy ebits over asymmetric and memory channels

Entanglement-assisted quantum error correction codes(EAQECCs)play an important role in quantum communications with noise.Such a scheme can use arbitrary classical linear code to transmit qubits over noisy quantum channels by consuming some ebits between the sender(Alice)and the receiver(Bob).It is usually assumed that the preshared ebits of Bob are error free.However,noise on these ebits is unavoidable in many cases.In this work,we evaluate the performance of EAQECCs with noisy ebits over asymmetric quantum channels and quantum channels with memory by computing the exact entanglement fidelity of several EAQECCs.We consider asymmetric errors in both qubits and ebits and show that the performance of EAQECCs in entanglement fidelity gets improved for qubits and ebits over asymmetric channels.In quantum memory channels,we compute the entanglement fidelity of several EAQECCs over Markovian quantum memory channels and show that the performance of EAQECCs is lowered down by the channel memory.Furthermore,we show that the performance of EAQECCs is diverse when the error probabilities of qubits and ebits are different.In both asymmetric and memory quantum channels,we show that the performance of EAQECCs is improved largely when the error probability of ebits is reasonably smaller than that of qubits.

Quantum Codes Do Not Increase Fidelity against Isotropic Errors

In this article, we study the ability of error-correcting quantum codes to increase the fidelity of quantum states throughout a quantum computation. We analyze arbitrary quantum codes that encode all qubits involved in the computation, and we study the evolution of n-qubit fidelity from the end of one application of the correcting circuit to the end of the next application. We assume that the correcting circuit does not introduce new errors, that it does not increase the execution time (i.e. its application takes zero seconds) and that quantum errors are isotropic. We show that the quantum code increases the fidelity of the states perturbed by quantum errors but that this improvement is not enough to justify the use of quantum codes. Namely, we prove that, taking into account that the time interval between the application of the two corrections is multiplied (at least) by the number of qubits n (due to the coding), the best option is not to use quantum codes, since the fidelity of the uncoded state over a time interval n times smaller is greater than that of the state resulting from the quantum code correction.

Quantum dense coding with gravitational cat states

A protocol of quantum dense coding with gravitational cat states is proposed.We explore the effects of temperature and system parameters on dense coding capacity and provide an efficient strategy to preserve the quantum advantage of dense coding for these states.Our results may open new opportunities for secure communication and insights into the fundamental nature of gravity in the context of quantum information processing.