Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
1,175
result(s) for
"Yang, Yi Xian"
Sort by:
Asymmetric controlled bidirectional remote preparation of two- and three-qubit equatorial state
In this paper, a novel asymmetric controlled bidirectional remote preparation scheme is proposed. In our scheme, Alice and Bob are not only the senders but also the receivers with the control of Charlie. By using the eleven-qubit entangled state as the quantum channel, Alice prepares an arbitrary two-qubit equatorial state for Bob and Bob prepares an arbitrary three-qubit equatorial state for Alice simultaneously. Firstly, we give the construction process of the quantum channel. Secondly, the whole recovery operations are given. Alice and Bob can recover the prepared state determinately. Thirdly, we consider the effect of the noisy environment (amplitude-damping and phase-damping) in our scheme and calculate the fidelities of the output states. Finally, since our scheme does not need additional operations and auxiliary qubits, the efficiency of our scheme is higher than that of the previous schemes.
Journal Article
أفكار حول تعميق الإصلاح
يناقش الكتاب سلسلة من الإيضاحات الهامة قدمها الرئيس الصيني والأمين العام للجنة المركزية للحزب الشيوعي الصيني، شي جين بينغ، وتدور حول أفكار الإصلاح وتوسيع الانفتاح على نحو شامل في الصين. يضم الكتاب أكثر من 70 وثيقة هامة على صورة كلمات شي جين بينغ وخطاباته وتعليقاته وتوجيهاته وينقسم الكتاب إلى 12 موضوعا خاصا تتضمن 274 قطعة من مقتطفات الأقوال، نشر بعضها لأول مرة.
Book
A secure rational quantum state sharing protocol
A novel rational protocol to share two arbitrary qubits among multiple parties is investigated in this paper. First, the protocol is presented, which is learned from Li et al.＇s protocol. Second, the utility,security, correctness, fairness, Nash equilibrium, and Pareto optimality of our scheme are discussed in detail,where the utility, correctness, and fairness of rational quantum state sharing protocols are creatively given because the agent who recovers the state plays a different and more important role. Another important point is that assumptions about our protocol are more practical and suitable than existing protocols.
Journal Article
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 three-particle 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 basis. Secondly, when transmission fails upon prediction, the quantum state will not be lost, and it will still 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 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.
Journal Article
The solvability of quantum k-pair network in a measurement-based way
Network coding is an effective means to enhance the communication efficiency. The characterization of network solvability is one of the most important topic in this field. However, for general network, the solvability conditions are still a challenge. In this paper, we consider the solvability of general quantum
k
-pair network in measurement-based framework. For the first time, a detailed account of measurement-based quantum network coding(MB-QNC) is specified systematically. Differing from existing coding schemes, single qubit measurements on a pre-shared graph state are the only allowed coding operations. Since no control operations are concluded, it makes MB-QNC schemes more feasible. Further, the sufficient conditions formulating by eigenvalue equations and stabilizer matrix are presented, which build an unambiguous relation among the solvability and the general network. And this result can also analyze the feasibility of sharing
k
EPR pairs task in large-scale networks. Finally, in the presence of noise, we analyze the advantage of MB-QNC in contrast to gate-based way. By an instance network
G
k
, we show that MB-QNC allows higher error thresholds. Specially, for
X
error, the error threshold is about 30% higher than 10% in gate-based way. In addition, the specific expressions of fidelity subject to some constraint conditions are given.
Journal Article
Efficient Quantum Transmission in Multiple-Source Networks
A difficult problem in quantum network communications is how to efficiently transmit quantum information over large-scale networks with common channels. We propose a solution by developing a quantum encoding approach. Different quantum states are encoded into a coherent superposition state using quantum linear optics. The transmission congestion in the common channel may be avoided by transmitting the superposition state. For further decoding and continued transmission, special phase transformations are applied to incoming quantum states using phase shifters such that decoders can distinguish outgoing quantum states. These phase shifters may be precisely controlled using classical chaos synchronization via additional classical channels. Based on this design and the reduction of multiple-source network under the assumption of restricted maximum-flow, the optimal scheme is proposed for specially quantized multiple-source network. In comparison with previous schemes, our scheme can greatly increase the transmission efficiency.
Journal Article
Asymmetric Circular Controlled Quantum State Transmission Scheme in Ideal and Noisy Environment
We present a four-participant scheme for the asymmetric circular controlled quantum states transmission. David is the controller, Alice, Bob and Charlie can complete the transmission of single-qubit, two-qubit and three-qubit states respectively. The scheme is discussed in ideal and noisy environments respectively. In an ideal environment, we first construct a quantum channel by using quantum gate operations. Secondly, the senders and controller choose an appropriate measurement basis to measure their own particles, and the receiver can use appropriate unitary operations to restore the quantum state according to the measurement results. All the measurement results and corresponding recovery operations are given. In the noise environment, we calculate the fidelities of the output states in the amplitude damping and phase damping noise environments, and observe the effect of noise according to the different values of the quantum state coefficient and noise factor. Finally, through the analysis of the scheme performance, it can be seen that our scheme has obvious advantages in quantum state transmission, including increasing the number of quantum state particles transmitted, reducing the consumption of classical communication and higher communication efficiency.
Journal Article
A secure quantum homomorphic encryption ciphertext retrieval scheme
In a recent paper (Gong et al. Quantum Inf Process 19:3, 2020), a novel ciphertext retrieval scheme based on the Grover algorithm and quantum homomorphic encryption was presented. In this scheme, when the server performs the operation of marking the solution on the user’s encrypted state in the Grover iteration, it needs to remove many gate-errors generated in the homomorphic evaluation of the T gate. And the server could judge this specific solution from the quantum circuit of marking the solution. It makes this scheme unable to achieve the low-cost and secure ciphertext retrieval. Therefore, we improve the Gong et al.’s scheme and propose a secure quantum homomorphic encryption ciphertext retrieval scheme. In our scheme, the trusted third party is introduced to cooperate with the server to execute the Grover algorithm. In each Grover iteration, the trusted third party can quickly mark the solution on the plaintext state, encrypt the marked state, and transmit it to the server. Then the server performs the remaining operations of this Grover iteration on the encrypted state. The trusted third party finally decrypts the iterated state. This cooperative approach ensures that the number of auxiliary qubits required and extra quantum gates executed in our scheme are lower than the Gong et al.’s scheme. By analyzing the security of our scheme, we confirm that the server and the trusted third party will not be informed of this solution. Thus, our scheme realizes the secure ciphertext retrieval with low computational overhead. We utilize IBM’s Qiskit framework to simulate our scheme, and the experimental result shows that our scheme is correct. It is worth noting that the low-cost and secure ciphertext retrieval will play a crucial role in modern information security and privacy protection.
Journal Article
Geometry of Quantum Computation with Qudits
The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of
SU
(
d
n
). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound.
Journal Article