The present invention relates to the fields of communication networks and information propagation technologies, and in particular, to an undetermined terminal-based accelerated joint quantum remote state preparation method.
Remote quantum state preparation is the successful implementation of transferring a known quantum state based on classical information and entangled states. In 2000, Lo[6], Pati[7], and Bennett[8] et al. proposed a remote preparation scheme of known quantum states. A teleportation scheme has many similarities to the remote preparation scheme, but the information about a quantum state to be transmitted in the former is unknown, which is completely different from the latter. In the remote state preparation scheme, the precondition is that a sender knows the information about a quantum state to be transmitted. Therefore, the scheme is also called “quantum teleportation of a known state”. The basic idea of the remote state preparation is that Alice, the sender, and Bob, the receiver, first share entanglement resources, and then Alice performs some classical information and local operations to implement the transmission of a quantum state that is completely known to Alice but unknown to Bob.
Current remote quantum state preparation schemes are all based on the condition that a sending terminal and a receiving terminal are determined, and there is a lack of a remote quantum state preparation scheme in a case that a receiving terminal is indefinite.
For this, a technical problem to be resolved by the present invention is to overcome the problem in the prior art that there is a lack of a remote quantum state preparation scheme in a case that a receiving terminal is indefinite.
To resolve the foregoing technical problems, a first aspect of the present invention provides an undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system. The system includes at least two sending terminals, a receiving terminal edge node, and a plurality of candidate receiving terminals. The method includes:
In a preferred technical solution, the determining chain channels between the at least two sending terminals and the receiving terminal edge node includes:
In a preferred technical solution, the determining GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals includes:
In a preferred technical solution, the jointly preparing, by the at least two sending terminals together, to-be-transferred information for the receiving terminal edge node, where the to-be-transferred information is shared together by the at least two sending terminals includes:
In a preferred technical solution, the separately selecting, by the at least two sending terminals, corresponding amplitude measurement bases and phase measurement bases according to a part of the to-be-transferred information shared by the at least two sending terminals, and jointly preparing the to-be-transferred information for the receiving terminal edge node together includes:
In a preferred technical solution, when measurement results of one of the sending terminals for the particles are |P01 and |P11, states of the particles are converted into |Q0b,4 and |Q1b,4; and the other sending terminal then measures the particles, and sends measurement results to the receiving terminal edge node, and the receiving terminal edge node performs a unitary operation to recover the to-be-transferred information.
In a preferred technical solution, the determining a target receiving terminal in the plurality of candidate receiving terminals, performing, by the other candidate receiving terminals, a measurement operation, and performing, by the target receiving terminal, corresponding unitary transformation to recover the to-be-transferred information includes:
In a preferred technical solution, entangled states between the receiving terminal edge node and the plurality of candidate receiving terminals are as follows:
where in the formula, {K} is a binary sequence of 0s and 1s, and includes an even-numbered quantity of 1s; and
A second aspect of the present invention provides an undetermined terminal-based accelerated joint quantum remote state preparation method performed by a sending terminal, including:
A third aspect of the present invention provides an undetermined terminal-based accelerated joint quantum remote state preparation method performed by a receiving terminal edge node, including:
Beneficial effects of the present invention are as follows: In the present invention, in a case that a receiving terminal is undetermined, a scheme of joint remote state preparation and a scheme of selecting a candidate receiving terminal are simultaneously implemented, so that information transfer efficiency and information security are greatly improved, thereby resolving a current problem that a carrier terminal lacks a scheme of remotely preparing a quantum state in a case that a receiving terminal is indefinite.
To make the content of the present invention clearer and more comprehensible, the present invention is further described in detail below according to specific embodiments of the present invention and the accompanying draws. Where:
The present invention is further described below with reference to the accompanying drawings and specific embodiments, to enable a person skilled in the art to better understand and implement the present invention. However, the embodiments are not used to limit the present invention.
Before the content of the present invention is introduced, several technical nouns in the present application are first described. Details are as follows:
In path selection, it is set that the form of a Bell state
is used between two adjacent links.
A Hadamard gate is also referred to as H transform. The function of the Hadamard gate may be represented as follows:
The operation on a single bit in the Hadamard gate is expressed as follows:
A Bell basis is a maximum entangled state formed by two particles, and forms a group of complete orthogonal basis of a four-dimensional Hilbert space. A specific form is as follows:
A quantum controlled-NOT gate (or a CNOT gate) has two input quantum bits, namely, a control quantum bit and a target quantum bit. The function of the CNOT gate is: when the control quantum bit is |0, the state of the target quantum bit does not change, and when the control quantum bit is |1, the state of the target bit is inverted. A matrix form corresponding to the CNOT gate is:
In H measurement, a to-be-tested particle first passes through one Hadamard gate, and a measurement is then performed on the to-be-tested particle on the basis |0, |1.
Some unitary matrices, that is, Pauli matrices, are further used in the present invention. A specific form is as follows:
Referring to
Step S100: Determine chain channels between the at least two sending terminals and the receiving terminal edge node, and determine GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals.
For example, an entire network includes terminal users and one intermediate backbone network. The terminal users include a sending terminal and a receiving terminal. The intermediate backbone network includes network edge nodes and t network intermediate nodes. The network edge nodes include a sending terminal edge node and a receiving terminal edge node. In this accelerated preparation scheme, the sending terminal and the receiving terminal edge node are connected by Bell channels between t backbone network intermediate nodes, and a direct entangled channel is recovered through the measurement of the intermediate nodes. Multi-particle state GHZ channels are formed between the receiving terminal edge node and the plurality of candidate receiving terminals through a corresponding CNOT operation.
Step S200: The at least two sending terminals together jointly prepare to-be-transferred information for the receiving terminal edge node, where the to-be-transferred information is shared together by the at least two sending terminals, and the receiving terminal edge node receives the to-be-transferred information.
For example, an auxiliary particle |0b is introduced into one of the sending terminals, a CNOT operation is performed on particles (1, b), and the auxiliary particle |0b is sent to the other sending terminal. The at least two sending terminals separately select corresponding amplitude measurement bases and phase measurement bases according to a part of the to-be-transferred information shared by the at least two sending terminals, and jointly prepare the to-be-transferred information for the receiving terminal edge node together. Specifically, when measurement results of one of the sending terminals for the particles are |P01 and |P11, states of the particles are converted into |Q0b,4 and |Q1b,4; and the other sending terminal then measures the particles, and sends measurement results to the receiving terminal edge node, and the receiving terminal edge node performs a unitary operation to recover the to-be-transferred information.
Step S300: The receiving terminal edge node sends the to-be-transferred information to the plurality of candidate receiving terminals, and determines a target receiving terminal in the plurality of candidate receiving terminals, the other candidate receiving terminals perform a measurement operation, and the target receiving terminal performs corresponding unitary transformation to recover the to-be-transferred information.
For example, the receiving terminal edge node performs Bell measurement on particles, to obtain a first measurement result, and sends the first measurement result to the plurality of candidate receiving terminals. After the target receiving terminal is determined from the plurality of candidate receiving terminals, H transform and basis measurement are performed on the other candidate receiving terminals, to obtain a second measurement result, and the second measurement result is sent to the target receiving terminal. The target receiving terminal performs corresponding unitary transformation according to the first measurement result and the second measurement result, to recover the to-be-transferred information.
In summary, in the present invention, in a case that a receiving terminal is undetermined, a scheme of joint remote state preparation and a scheme of selecting a candidate receiving terminal are simultaneously implemented, so that information transfer efficiency and information security are greatly improved, thereby resolving a current problem that a carrier terminal lacks a scheme of remotely preparing a quantum state in a case that a receiving terminal is indefinite.
Referring to
The terminal users include sending users Alice and Bob and a receiving user Charlie. An intermediate backbone network includes network edge nodes and two network intermediate nodes. The network edge nodes include a sending user edge node and a receiving user edge node.
Because this embodiment is about two candidate receiving users, the receiving user edge node includes particles @1, @2, the two candidate receiving users include particles c1, c2, and there are a Bell channel between a1 and c1 and a Bell channel between a2 and c2. The sending user Alice has a particle 1, the receiving user edge node has a particle 4, and the intermediate nodes have particles 2 and 3.
Specifically, an undetermined terminal-based accelerated joint quantum remote state preparation method includes the following steps.
Step 1: Entangle the two Bell channels between the receiving user edge node and the two candidate receiving users c1, c2, which may be represented as:
The receiving user edge node performs a CNOT operation on the particles (a1, a2), where a1 is a control quantum bit, and a2 is a target quantum bit.
The receiving user edge node measures the base {|0, |1} of the particle a2. When a measurement result of the particle a2 is |0, a receiving user performs an I operation on the corresponding particle c2. When the measurement result of the particle a2 by the receiving user edge node is |1, the receiving user performs an X operation on the corresponding particle c2. Therefore, the original two mixed Bell channels may be converted into a corresponding GHZ state, as shown in the following formula:
|ξ′=(|000+|111)a
Step 2: In a transmission path, connect the sending user, the receiving user edge node, and the two intermediate nodes to each other two by two, where the sending user and the nodes share one two-bit maximum entangled Bell state,
Therefore, the intermediate nodes perform a bell measurement on the particles (2, 3) of the intermediate nodes, and send a measurement result to the receiving user edge node. If the measurement result of the intermediate nodes is |φm
Specifically, if the result of the bell measurement of the particles (2, 3) by the intermediate nodes is
and is sent to the receiving user edge node. The receiving user edge node performs a unitary operation U00=I on the particle 4. Other measurement operations are similar.
Finally, the channel between the sending user Alice and the receiving user edge node is converted into:
Step 2.1: Preprocess the channel first, where the sending user Alice adds an auxiliary particle |0b to convert the original channel into:
A CNOT operation is then performed on a particle pair (1, b). The particle 1 is a control quantum bit, the particle b is a controlled quantum bit, the operated particle b is sent to Bob for management, and the original channel is converted into:
The sending users Alice and Bob jointly prepare to-be-transferred information for the receiving user edge node together. To obtain amplitude information, Alice selects a corresponding amplitude measurement basis {|Pm; m∈{0,1}} and (|P0=a0|0+a1|1, |P1=a1|0−a0|1) according to information that Alice possesses. To obtain phase information, Bob selects a corresponding phase measurement basis {|On(m); m, n∈{0,1}} in the form of
according to information that Bob possesses. A quantum state may be written as:
As can be known from the foregoing formula, when measurement results of the particle 1 by the sending user Alice are |P01 and |P11, states of the particles b and 4 are respectively converted into |Q0b,4 and |Q1b,4. Bob then measures the particle b and sends a measurement result to the receiving user edge node. The receiving user edge node separately performs a unitary operation to recover the to-be-transferred information |ϕ.
Specifically, if the measurement result of the particle 1 by the sending user Alice is |P0), the particle b and the particle 4 collapse to |Q0. Bob then measures b. If the measurement result is |O0(0), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R0(0) to obtain the to-be-transferred information |ϕ. If the measurement result of the particle b by Bob is |O1(0), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R1(0) to obtain the to-be-transferred information |ϕ. If the measurement result of the particle 1 by the sending user Alice is | P1, the particle b and the particle 4 collapse to |Q1. Bob then measures the auxiliary particle b. If the measurement result is |O0(1), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R0(1) to obtain the to-be-transferred information |ϕ. If the measurement result of the particle b by Bob is |O1(1), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R1(1) to obtain the to-be-transferred information |ϕ.
It needs to be noted that the foregoing step 1 and step 2 may be performed simultaneously.
Step 3: Establish entangled states between the receiving user edge node and the two candidate receiving users as follows:
As can be known from the foregoing results, the receiving user edge node first selects Bell measurement bases |00±|11and |01±|10 to measure the particle 4 and a1, and sends the measurement result to the receiving user. If the determined receiving user is c1, the candidate receiving user c2 performs a corresponding H operation and basis measurement {|0, |1}.
In combination with the foregoing communication process, if the measurement result of the particle 1 by the sending user Alice is |P0 and the measurement result of the particle b by Bob is |O0(0) the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R0(0) to obtain the to-be-transferred information |ϕ. The receiving user edge node then performs a Bell measurement on the particles (4, a1). If a measurement result is |00±|11 and a measurement result of a candidate receiving user b2 is |0, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01±|10 and the measurement result of the candidate receiving user b2 is |0, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕ.
If the measurement result of the particle 1 by the sending user Alice is |P0 and the measurement result of the particle b by Bob is |O1(0), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R1(0) to obtain the to-be-transferred information |ϕ. The receiving user edge node then performs a Bell measurement on the particles (4, a1). If a measurement result is |00±|11 and a measurement result of a candidate receiving user b2 is |0, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01±|10 and the measurement result of the candidate receiving user b2 is |0, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕ.
If the measurement result of the particle 1 by the sending user Alice is | P1 and the measurement result of the particle b by Bob is |O0(1), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R0(1) to obtain the to-be-transferred information |ϕ. The receiving user edge node then performs a Bell measurement on a particle pair (4, a1). If a measurement result is |00±|11 and a measurement result of a candidate receiving user b2 is |0, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01±|10 and the measurement result of the candidate receiving user b2 is |0, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕ.
If the measurement result of the particle 1 by the sending user Alice is | P1 and the measurement result of the particle b by Bob is |O1(1), the measurement result is sent to the receiving user edge node. The receiving user edge node performs a unitary operation R1(1) to obtain the to-be-transferred information |ϕ. The receiving user edge node then performs a Bell measurement on the particles (4, a1). If a measurement result is |00±|11 and a measurement result of a candidate receiving user b2 is |0, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01±|10and the measurement result of the candidate receiving user b2 is |0, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕ.
A person skilled in the art should understand that the embodiments of the present application may be provided as a method, a system or a computer program product. Therefore, the present application may use a form of hardware only embodiments, software only embodiments, or embodiments with a combination of software and hardware. Moreover, the present application may use a form of a computer program product that is implemented on one or more computer-usable storage media (including but not limited to a disk memory, a CD-ROM, an optical memory, and the like) that include computer usable program code.
The present application is described with reference to the flowcharts and/or block diagrams of the method, the device (system), and the computer program product according to the embodiments of the present application. It should be understood that computer program instructions may be used to implement each process and/or each block in the flowcharts and/or the block diagrams and a combination of a process and/or a block in the flowcharts and/or the block diagrams. These computer program instructions may be provided for a general-purpose computer, a dedicated computer, an embedded processor, or a processor of any other programmable data processing device to generate a machine, so that the instructions executed by a computer or a processor of any other programmable data processing device generate an apparatus for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
These computer program instructions may be stored in a computer readable memory that can instruct the computer or any other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory generate an artifact that includes an instruction apparatus. The instruction apparatus implements a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
These computer program instructions may be loaded onto a computer or another programmable data processing device, so that a series of operations and steps are performed on the computer or the another programmable device, thereby generating computer-implemented processing. Therefore, the instructions executed on the computer or the another programmable device provide steps for implementing a specific function in one or more processes in the flowcharts and/or in one or more blocks in the block diagrams.
Obviously, the foregoing embodiments are merely examples for clear description, rather than a limitation to implementations. For a person of ordinary skill in the art, other changes or variations in different forms may also be made based on the foregoing description. All implementations cannot and do not need to be exhaustively listed herein. Obvious changes or variations that are derived there from still fall within the protection scope of the invention of the present invention.
Number | Date | Country | Kind |
---|---|---|---|
202110246788.4 | Mar 2021 | CN | national |
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/CN2021/138678 | 12/16/2021 | WO |