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 chan...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 secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to im...Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.展开更多
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 ...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.展开更多
Based on the techniques of the quantum remote state preparation via a deterministic way, this paper proposes a quantum communication scheme to distribute the secret messages in two phases, i.e., the carrier state chec...Based on the techniques of the quantum remote state preparation via a deterministic way, this paper proposes a quantum communication scheme to distribute the secret messages in two phases, i.e., the carrier state checking phase and the message state transmitting phase. In the first phase, the secret messages are encoded by the sender using a stabilizer quantum code and then transmitted to the receiver by implementing three CNOT gates. In the second phase, the communicators check the perfectness of the entanglement of the transmitted states. The messages can be distributed to the receiver even if some of the transmitted qubits are destroyed.展开更多
基金Project supported by the National Key R&D Program of China (Grant No.2022YFB3103802)the National Natural Science Foundation of China (Grant Nos.62371240 and 61802175)the Fundamental Research Funds for the Central Universities (Grant No.30923011014)。
文摘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.
基金Project supported by the National Natural Science Foundation of China (Grant No. 61072071)
文摘Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
基金supported by the National Basic Research Program of China (Grant No.2010CB328300)the National Natural Science Foundation of China (Grant Nos.60972046 and 60902030)+4 种基金the Program for Changjiang Scholars and Innovative Research Team in University (Grant No.IRT0852)the Natural Science Foundation of Shaanxi Province (Grant No.2010JQ8025)the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No.20100203120004)the 111 Program (Grant No.B08038)the China Scholarship Council (Grant No.[2008]3019)
文摘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.
基金Project supported by the National Natural Science Foundation of China （Grant Nos 604720181 60573127 and 10547125）, the Doctoral Programs Foundation of the Ministry of Education of China （Grant No 20020247063）.
文摘Based on the techniques of the quantum remote state preparation via a deterministic way, this paper proposes a quantum communication scheme to distribute the secret messages in two phases, i.e., the carrier state checking phase and the message state transmitting phase. In the first phase, the secret messages are encoded by the sender using a stabilizer quantum code and then transmitted to the receiver by implementing three CNOT gates. In the second phase, the communicators check the perfectness of the entanglement of the transmitted states. The messages can be distributed to the receiver even if some of the transmitted qubits are destroyed.
