UNDETERMINED TERMINAL-BASED ACCELERATED JOINT QUANTUM REMOTE STATE PREPARATION METHOD

Information

  • Patent Application
  • 20240204884
  • Publication Number
    20240204884
  • Date Filed
    December 16, 2021
    2 years ago
  • Date Published
    June 20, 2024
    3 months ago
Abstract
The invention provides an undetermined terminal-based accelerated joint quantum remote state preparation method, including: determining chain channels between at least two sending terminals and a receiving terminal edge node, and determining GHZ channels between the receiving terminal edge node and a plurality of candidate receiving terminals; jointly preparing, by the at least two sending terminals together, to-be-transferred information for the receiving terminal edge node; and sending, by the receiving terminal edge node, the to-be-transferred information to the plurality of candidate receiving terminals, after a target receiving terminal is determined, 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. Information transfer efficiency and information security are greatly improved, thereby resolving a current problem that a terminal lacks a scheme of remotely preparing a quantum state in a case that a receiving terminal is indefinite.
Description
FIELD OF THE INVENTION

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.


DESCRIPTION OF THE RELATED ART

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.


SUMMARY OF THE INVENTION

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:

    • determining chain channels between the at least two sending terminals and the receiving terminal edge node, and determining GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals;
    • 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, and receiving, by the receiving terminal edge node, the to-be-transferred information; and
    • sending, by the receiving terminal edge node, the to-be-transferred information to the plurality of candidate receiving terminals, 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.


In a preferred technical solution, the determining chain channels between the at least two sending terminals and the receiving terminal edge node includes:

    • connecting the at least two sending terminals and the receiving terminal edge node by Bell channels, and determining quantum entangled channels between the at least two sending terminals and the receiving terminal edge node by using an intermediate node measurement operation.


In a preferred technical solution, the determining GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals includes:

    • converting Bell channels between the receiving terminal edge node and the plurality of candidate receiving terminals into multi-particle state GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals.


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:

    • introducing an auxiliary particle |0custom-characterb into one of the sending terminals, performing a CNOT operation on particles (1, b), and sending the auxiliary particle |0custom-characterb to the other sending terminal; and 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.


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:

    • selecting, by one of the sending terminals, an amplitude measurement basis {|Pmcustom-character; m∈{0,1}} (|P0custom-character)=a0|0custom-character+a1|1custom-character and |P1custom-character=a1|0custom-character−a0|1custom-character) according to a part of the to-be-transferred information shared by the sending terminal, and selecting, by the other sending terminal, a phase measurement basis {On(m)custom-character; m, n∈{0,1}} in the form of









(







"\[LeftBracketingBar]"


O
0






(
m
)














"\[LeftBracketingBar]"


O
1






(
m
)









)

=


V






(
m
)



(







"\[LeftBracketingBar]"

0











"\[LeftBracketingBar]"

1






)








    •  according to a part of the to-be-transferred information shared by the sending terminal, where













V






(
0
)



=



1

2




(




e


-
i



θ
0






e


-
i



θ
1








e


-
i



θ
0






-

e


-
i



θ
1







)



and



V






(
1
)




=


1

2




(




e


-
i



θ
1






e


-
i



θ
0








-

e


-
i



θ
1







e


-
i



θ
0






)





,







    •  and a quantum state is:






















"\[LeftBracketingBar]"

GHZ




1
,
b
,

2

p



=


1

2







m
=
0

1




"\[LeftBracketingBar]"


P
m







1





"\[LeftBracketingBar]"


Q
m






b
,

t










=


1
2



(






















"\[LeftBracketingBar]"


P
0




1

[




"\[LeftBracketingBar]"



O
0








(
0
)








b



R
0








(
0
)








"\[LeftBracketingBar]"

φ





t









+




"\[LeftBracketingBar]"



O
1








(
0
)








b



R
1








(
0
)








"\[LeftBracketingBar]"

φ





t









]

+
























"\[LeftBracketingBar]"




P

1




1

[




"\[LeftBracketingBar]"



O
0








(
1
)








b



R
0








(
1
)









"\[LeftBracketingBar]"

φ






t









+




"\[LeftBracketingBar]"



O
1








(
1
)








b



R
1








(
1
)









"\[LeftBracketingBar]"

φ






t









]




)









    • where Rn(m) in the formula is a unitary operation, R0(0)=I, R1(0)2, R0(1)=−σzσx, and R1(1)=−σx.





In a preferred technical solution, when measurement results of one of the sending terminals for the particles are |P0custom-character1 and |P1custom-character1, states of the particles are converted into |Q0custom-characterb,4 and |Q1custom-characterb,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:

    • performing, by the receiving terminal edge node, Bell measurement on particles, to obtain a first measurement result, and sending the first measurement result to a target candidate receiving terminal;
    • after the target receiving terminal is determined from the plurality of candidate receiving terminals, performing, by the other candidate receiving terminals, H transform and basis measurement on respective particles, to obtain a second measurement result, and sending the second measurement result to the target receiving terminal; and
    • performing, by the target receiving terminal, corresponding unitary transformation according to the first measurement result and the second measurement result, to recover the to-be-transferred information.


In a preferred technical solution, entangled states between the receiving terminal edge node and the plurality of candidate receiving terminals are as follows:





































"\[LeftBracketingBar]"

Ϛ



=





(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

0





+


a
1



e






i



θ
1







"\[LeftBracketingBar]"

1







)

i







(



"\[LeftBracketingBar]"


00

L


0





+



"\[LeftBracketingBar]"


11

L


1







)



a
1



c
1



c
2


L



c
N



=






(



"\[LeftBracketingBar]"


00





±



"\[LeftBracketingBar]"

11







)



t








,

a
1



[


a
0



e






i



θ
0







"\[LeftBracketingBar]"


00

L


0









c
1



c
2


L



c
N



±


a
1



e






i



θ
1







"\[LeftBracketingBar]"


11

L


1








c
1



c
2


L



c
N



]

+





(



"\[LeftBracketingBar]"

01






±




"\[LeftBracketingBar]"

10





)



t








,

a
1



[


a
0



e






i



θ
0







"\[LeftBracketingBar]"


11

L


1








c
1



c
2


L



c
N



±


a
1



e






i



θ
1







"\[LeftBracketingBar]"


00

L


0








c
1



c
2


L



c
N



]

=





(



"\[LeftBracketingBar]"


00





±



"\[LeftBracketingBar]"

11







)



t








,

a
1



[
















K
=
0


N
-
1






"\[LeftBracketingBar]"


{
K
}








c
2


L



c
N






(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

0







±



a
1



e






i



θ
1







"\[LeftBracketingBar]"

1






)


c
1


+

















K
=
0


N
-
1






"\[LeftBracketingBar]"



{
K
}

_








c
2


L



c
N






(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

0









m







a
1





e






i



θ
1









"\[LeftBracketingBar]"

1





)


c
1





]

+




(



"\[LeftBracketingBar]"


01





±



"\[LeftBracketingBar]"

10







)



t








,

a
1



[
















K
=
0


N
-
1






"\[LeftBracketingBar]"


{
K
}








c
2


L



c
N






(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

1







±



a
1



e






i



θ
1







"\[LeftBracketingBar]"

0






)


c
1


-

















K
=
0


N
-
1






"\[LeftBracketingBar]"



{
K
}

_








c
2


L



c
N






(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

1









m







a
1





e






i



θ
1









"\[LeftBracketingBar]"

0





)


c
1





]






where in the formula, {K} is a binary sequence of 0s and 1s, and includes an even-numbered quantity of 1s; and {K} includes an odd-numbered quantity of 1s.


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:

    • determining chain channels between at least two sending terminals and a receiving terminal edge node; and
    • jointly preparing, by the at least two sending terminals that share to-be-transferred information together, the to-be-transferred information for the receiving terminal edge node together, sending, by the receiving terminal edge node, the to-be-transferred information to a plurality of candidate receiving terminals, and after a target receiving terminal is determined, recovering, by the other candidate receiving terminals and the target receiving terminal, the to-be-transferred information shared together by the at least two sending terminals.


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:

    • determining GHZ channels between the receiving terminal edge node and a plurality of candidate receiving terminals; and
    • jointly preparing, by the receiving terminal edge node and at least two sending terminals that share to-be-transferred information together, the to-be-transferred information, receiving the to-be-transferred information, sending the to-be-transferred information to the plurality of candidate receiving terminals, and after a target receiving terminal is determined, recovering, by the other candidate receiving terminals and the target receiving terminal, the to-be-transferred information shared together by the at least two sending terminals.


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.





BRIEF DESCRIPTION OF THE DRAWINGS

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:



FIG. 1 is a flowchart of an undetermined terminal-based accelerated joint quantum remote state preparation method according to the present invention.



FIG. 2 is a schematic diagram of establishing a quantum channel between only two unknown terminal particles in terminal users Alice and Bob to perform communication according to an embodiment.



FIG. 3 is a schematic diagram of an undetermined terminal-based accelerated joint quantum remote state preparation method according to an embodiment of the present invention.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

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:


1. Path Selection

In path selection, it is set that the form of a Bell state









1

2








(



"\[LeftBracketingBar]"

00




+



"\[LeftBracketingBar]"

11






)




is used between two adjacent links.


2. Hadamard Gate

A Hadamard gate is also referred to as H transform. The function of the Hadamard gate may be represented as follows:





















H
=



1

2



[



(



"\[LeftBracketingBar]"

0







+




"\[LeftBracketingBar]"

1





)






0




"\[LeftBracketingBar]"


+

(



"\[LeftBracketingBar]"

0









-




"\[LeftBracketingBar]"

1





)






1


"\[LeftBracketingBar]"





]






=



1

2





(



1


1




1



-
1




)

.










The operation on a single bit in the Hadamard gate is expressed as follows:

















H




"\[LeftBracketingBar]"

0




=



1

2





(



"\[LeftBracketingBar]"

0







+




"\[LeftBracketingBar]"

1





)













H




"\[LeftBracketingBar]"

1




=



1

2





(



"\[LeftBracketingBar]"

0







-




"\[LeftBracketingBar]"

1





)

.








3. Bell Basis

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:




















"\[LeftBracketingBar]"


ϕ
00




=



1

2





(



"\[LeftBracketingBar]"

00







+




"\[LeftBracketingBar]"

11





)

,















"\[LeftBracketingBar]"


ϕ
01




=



1

2





(



"\[LeftBracketingBar]"

00







-




"\[LeftBracketingBar]"

11





)

,















"\[LeftBracketingBar]"


ϕ
10




=



1

2





(



"\[LeftBracketingBar]"

01







+




"\[LeftBracketingBar]"

10





)

,















"\[LeftBracketingBar]"


ϕ
11




=



1

2





(



"\[LeftBracketingBar]"

01







-




"\[LeftBracketingBar]"

10





)

.








4. Quantum Controlled NOT Gate

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 |0custom-character, the state of the target quantum bit does not change, and when the control quantum bit is |1custom-character, the state of the target bit is inverted. A matrix form corresponding to the CNOT gate is:









C
NOT

=


[



1


0


0


0




0


1


0


0




0


0


0


1




0


0


1


0



]

.






5. H Measurement

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 |0custom-character, |1custom-character.


6. Pauli Matrix

Some unitary matrices, that is, Pauli matrices, are further used in the present invention. A specific form is as follows:



















I
=



"\[LeftBracketingBar]"

0







0




"\[RightBracketingBar]"


+



"\[LeftBracketingBar]"

1







1




"\[RightBracketingBar]"


=

(



1


0




0


1



)


,

X
=










"\[LeftBracketingBar]"

0






1




"\[RightBracketingBar]"


+



"\[LeftBracketingBar]"

1







0








"\[RightBracketingBar]"



=

(



0


1




1


0



)


,























Y
=



"\[LeftBracketingBar]"

0







1




"\[RightBracketingBar]"


-



"\[LeftBracketingBar]"

1







0




"\[RightBracketingBar]"


=

(



0


1





-
1



0



)


,

Z
=






"\[LeftBracketingBar]"

0






0








"\[RightBracketingBar]"



-




"\[LeftBracketingBar]"

1









1






"\[RightBracketingBar]"



=


(



1


0




0



-
1




)

.





Referring to FIG. 1, an undetermined terminal-based accelerated joint quantum remote state preparation method of the present invention includes the following steps.


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 |0custom-characterb is introduced into one of the sending terminals, a CNOT operation is performed on particles (1, b), and the auxiliary particle |0custom-characterb 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 |P0custom-character1 and |P1custom-character1, states of the particles are converted into |Q0custom-characterb,4 and |Q1custom-characterb,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 FIG. 2 and FIG. 3, an undetermined terminal-based accelerated joint quantum remote state preparation method of the present invention is described below in detail through the embodiments. In this embodiment, two candidate receiving users and two intermediate nodes with undetermined terminals are used as an example. It is implemented that terminal users Alice and Bob transfer known quantum state information to another terminal user Charlie. In a transfer process, Alice and Bob help a receiving user edge node to remotely prepare a target state: |φcustom-character=a0e0|0custom-character+a1e1|1custom-character, where a0, a1∈R, |a0|2+|a1|2=1, and θ0, θ1∈[0,2π].


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:










































"\[LeftBracketingBar]"

φ



=


1

2





(



"\[LeftBracketingBar]"

00







+




"\[LeftBracketingBar]"

11





)



a
1



c
1





1

2






(



"\[LeftBracketingBar]"

00






+




"\[LeftBracketingBar]"

11





)



a
2



c
2



=



1
2

[




"\[LeftBracketingBar]"

0







a
2





(



"\[LeftBracketingBar]"


000





+



"\[LeftBracketingBar]"

111







)



a
1



c
1



c
2




+




"\[LeftBracketingBar]"

1







a

2




(



"\[LeftBracketingBar]"

001





+




"\[LeftBracketingBar]"

110





)



a
1



c
1



c
2



]

.




(
1
)








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 {|0custom-character, |1custom-character} of the particle a2. When a measurement result of the particle a2 is |0custom-character, 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 |1custom-character, 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:





|ξ′custom-character=(|000custom-character+|111custom-character)a1c1c2  (2).


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,





































"\[LeftBracketingBar]"

φ



=


1

2





(



"\[LeftBracketingBar]"

00







+




"\[LeftBracketingBar]"

11





)

12



1

2






(



"\[LeftBracketingBar]"

00






+




"\[LeftBracketingBar]"

11





)

34

=



1
2








m
1



n
1


=
0

1





"\[LeftBracketingBar]"



φ


m
1



n
1









23




U


m
1



n
1





1

2






(



"\[LeftBracketingBar]"

00






+




"\[LeftBracketingBar]"

11





)

14

,




(
3
)










    • where Um1n1 is a corresponding unitary operation, U00=I4, U01=Z4, U10=X4, and U11=Z4X4.





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 |φm1n1custom-character, the receiving user edge node performs an Um1n1 operation. Finally, a direct quantum entangled channel is established between Alice and the receiving user edge node.


Specifically, if the result of the bell measurement of the particles (2, 3) by the intermediate nodes is

















"\[LeftBracketingBar]"


ϕ
00





=



1

2




(



"\[LeftBracketingBar]"

00







+




"\[LeftBracketingBar]"

11





)

,




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:



















1

2




(



"\[LeftBracketingBar]"

00





+



"\[LeftBracketingBar]"

11




)



1
,
4


.




(
5
)








Step 2.1: Preprocess the channel first, where the sending user Alice adds an auxiliary particle |0custom-characterb to convert the original channel into:



















1

2




(



"\[LeftBracketingBar]"

000





+



"\[LeftBracketingBar]"

110




)



1
,
4
,
b


.




(
6
)








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:



















1

2




(



"\[LeftBracketingBar]"

000





+



"\[LeftBracketingBar]"

111




)



1
,
4
,
b


.




(
7
)








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 {|Pmcustom-character; m∈{0,1}} and (|P0custom-character=a0|0custom-character+a1|1custom-character, |P1custom-character=a1|0custom-character−a0|1custom-character) according to information that Alice possesses. To obtain phase information, Bob selects a corresponding phase measurement basis {|On(m)custom-character; m, n∈{0,1}} in the form of










(







"\[LeftBracketingBar]"


O
0






(
m
)














"\[LeftBracketingBar]"


O
1






(
m
)









)

=


V






(
m
)



(







"\[LeftBracketingBar]"

0











"\[LeftBracketingBar]"

1






)


,









(


V






(
0
)



=



1

2




(




e







-
i




θ
0






e







-
i




θ
1








e







-
i




θ
0






-

e







-
i




θ
1







)



and



V






(
1
)




=


1

2




(




e







-
i




θ
1






e







-
i




θ
0








-

e







-
i




θ
1







e







-
i




θ
0






)





)





according to information that Bob possesses. A quantum state may be written as:
























"\[LeftBracketingBar]"

GHZ




1
,
b
,
4


=


1

2







m
=
0

1




"\[LeftBracketingBar]"


P
m







1





"\[LeftBracketingBar]"


Q
m







b
,
4


=



1
2



(
























"\[LeftBracketingBar]"


P
0





1

[




"\[LeftBracketingBar]"


O
0






(
0
)








b




R
0






(
0
)









"\[LeftBracketingBar]"

φ





4

+




"\[LeftBracketingBar]"


O
1






(
0
)








b




R
1






(
0
)









"\[LeftBracketingBar]"

φ





4

]

+


























"\[LeftBracketingBar]"


P
1





1

[




"\[LeftBracketingBar]"


O
0






(
1
)








b




R
0






(
1
)









"\[LeftBracketingBar]"

φ





4

+




"\[LeftBracketingBar]"


O
1






(
1
)








b



R
1






(
1
)








"\[LeftBracketingBar]"

φ





4

]





)



,




(
8
)










    • where Rn(m) is a unitary operation, R0(0)=I, R1(0)z, R0(1)=−σzσx, and R1(1)=−σx.





As can be known from the foregoing formula, when measurement results of the particle 1 by the sending user Alice are |P0custom-character1 and |P1custom-character1, states of the particles b and 4 are respectively converted into |Q0custom-characterb,4 and |Q1custom-characterb,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 |ϕcustom-character.


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 |Q0custom-character. Bob then measures b. If the measurement result is |O0(0)custom-character, 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 |ϕcustom-character. If the measurement result of the particle b by Bob is |O1(0)custom-character, 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 |ϕcustom-character. If the measurement result of the particle 1 by the sending user Alice is | P1custom-character, the particle b and the particle 4 collapse to |Q1custom-character. Bob then measures the auxiliary particle b. If the measurement result is |O0(1)custom-character, 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 |ϕcustom-character. If the measurement result of the particle b by Bob is |O1(1)custom-character, 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 |ϕcustom-character.


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:



























































"\[LeftBracketingBar]"

Ϛ



=

(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

0






+


a
1



e






i



θ
1







"\[LeftBracketingBar]"

1





)

4



(



"\[LeftBracketingBar]"

000





+



"\[LeftBracketingBar]"

111




)




a
1



c
1



c
2



=



(



"\[LeftBracketingBar]"

00






±




"\[LeftBracketingBar]"

11





)


4
,

a
1



[



a
0



e






i



θ
0







"\[LeftBracketingBar]"

00








c
1



c
2



±



a
1



e






i



θ
1







"\[LeftBracketingBar]"

11








c
1



c
2



]

+






(



"\[LeftBracketingBar]"

01




±



"\[LeftBracketingBar]"

10






)


4
,

a
1



[



a
0



e






i



θ
0







"\[LeftBracketingBar]"

11








c
1



c
2



±



a
1



e






i



θ
1







"\[LeftBracketingBar]"

00








c
1



c
2



]

=






(



"\[LeftBracketingBar]"

00




±



"\[LeftBracketingBar]"

11






)


4
,

a
1



[















"\[LeftBracketingBar]"

0




c
2





(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

0







±



a
1



e






i



θ
1







"\[LeftBracketingBar]"

1






)


c
1


+

















"\[LeftBracketingBar]"

1




c
2




(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

0









a
1



e






i



θ
1







"\[LeftBracketingBar]"

1





)



c
1





]

+






(



"\[LeftBracketingBar]"

01




±



"\[LeftBracketingBar]"

10






)


4
,

a
1



[
















"\[LeftBracketingBar]"

0




c
2




(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

1






±


a
1



e






i



θ
1







"\[LeftBracketingBar]"

0





)


c
1


-


















"\[LeftBracketingBar]"

1




c
2




(


a
0



e






i



θ
0







"\[LeftBracketingBar]"

1









a
1



e






i



θ
1







"\[LeftBracketingBar]"

0





)


c
1






]

.




(
9
)








As can be known from the foregoing results, the receiving user edge node first selects Bell measurement bases |00custom-character±|11custom-characterand |01custom-character±|10custom-character 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 {|0custom-character, |1custom-character}.


In combination with the foregoing communication process, if the measurement result of the particle 1 by the sending user Alice is |P0custom-character and the measurement result of the particle b by Bob is |O0(0)custom-character 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 |ϕcustom-character. The receiving user edge node then performs a Bell measurement on the particles (4, a1). If a measurement result is |00custom-character±|11custom-character and a measurement result of a candidate receiving user b2 is |0custom-character, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01custom-character±|10custom-character and the measurement result of the candidate receiving user b2 is |0custom-character, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕcustom-character.


If the measurement result of the particle 1 by the sending user Alice is |P0custom-character and the measurement result of the particle b by Bob is |O1(0)custom-character, 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 |ϕcustom-character. The receiving user edge node then performs a Bell measurement on the particles (4, a1). If a measurement result is |00custom-character±|11custom-character and a measurement result of a candidate receiving user b2 is |0custom-character, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01custom-character±|10custom-character and the measurement result of the candidate receiving user b2 is |0custom-character, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕcustom-character.


If the measurement result of the particle 1 by the sending user Alice is | P1custom-character and the measurement result of the particle b by Bob is |O0(1)custom-character, 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 |ϕcustom-character. The receiving user edge node then performs a Bell measurement on a particle pair (4, a1). If a measurement result is |00custom-character±|11custom-character and a measurement result of a candidate receiving user b2 is |0custom-character, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01custom-character±|10custom-character and the measurement result of the candidate receiving user b2 is |0custom-character, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕcustom-character.


If the measurement result of the particle 1 by the sending user Alice is | P1custom-character and the measurement result of the particle b by Bob is |O1(1)custom-character, 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 |ϕcustom-character. The receiving user edge node then performs a Bell measurement on the particles (4, a1). If a measurement result is |00custom-character±|11custom-character and a measurement result of a candidate receiving user b2 is |0custom-character, the receiving user separately performs I and Z operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs Z and I operations. If the measurement result of the receiving user edge node is |01custom-character±|10custom-characterand the measurement result of the candidate receiving user b2 is |0custom-character, the receiving user separately performs X and ZX operations. If the measurement result of the candidate receiving user b2 is |1custom-character, the receiving user separately performs XZ and ZXZ operations to recover the to-be-transferred information |ϕcustom-character.


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.

Claims
  • 1. An undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system, wherein the system comprises at least two sending terminals, a receiving terminal edge node, and a plurality of candidate receiving terminals, and the method comprises: determining chain channels between the at least two sending terminals and the receiving terminal edge node, and determining GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals;jointly preparing, by the at least two sending terminals together, to-be-transferred information for the receiving terminal edge node, wherein the to-be-transferred information is shared together by the at least two sending terminals, and receiving, by the receiving terminal edge node, the to-be-transferred information; andsending, by the receiving terminal edge node, the to-be-transferred information to the plurality of candidate receiving terminals, 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.
  • 2. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 1, wherein the determining chain channels between the at least two sending terminals and the receiving terminal edge node comprises: connecting the at least two sending terminals and the receiving terminal edge node by Bell channels, and determining quantum entangled channels between the at least two sending terminals and the receiving terminal edge node by using an intermediate node measurement operation.
  • 3. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 1, wherein the determining GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals comprises: converting Bell channels between the receiving terminal edge node and the plurality of candidate receiving terminals into multi-particle state GHZ channels between the receiving terminal edge node and the plurality of candidate receiving terminals.
  • 4. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 1, wherein the jointly preparing, by the at least two sending terminals together, to-be-transferred information for the receiving terminal edge node, wherein the to-be-transferred information is shared together by the at least two sending terminals comprises: introducing an auxiliary particle |0b into one of the sending terminals, performing a CNOT operation on particles (1, b), and sending the auxiliary particle |0b to the other sending terminal; andseparately 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.
  • 5. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 4, wherein 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 comprises: selecting, by one of the sending terminals, an amplitude measurement basis {|Pm; m∈{0,1}} and (|P0=a0|0+a1|1, |P1=a1|0−a0|1) according to a part of the to-be-transferred information shared by the sending terminal, and selecting, by the other sending terminal, a phase measurement basis {|On(m);m,n∈{0,1}} in the form of
  • 6. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 5, wherein 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.
  • 7. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 1, wherein 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 comprises: performing, by the receiving terminal edge node, Bell measurement on particles, to obtain a first measurement result, and sending the first measurement result to a target candidate receiving terminal;after the target receiving terminal is determined from the plurality of candidate receiving terminals, performing, by the other candidate receiving terminals, H transform and basis measurement on respective particles, to obtain a second measurement result, and sending the second measurement result to the target receiving terminal; andperforming, by the target receiving terminal, corresponding unitary transformation according to the first measurement result and the second measurement result, to recover the to-be-transferred information.
  • 8. The undetermined terminal-based accelerated joint quantum remote state preparation method implemented by a system according to claim 7, wherein entangled states between the receiving terminal edge node and the plurality of candidate receiving terminals are as follows:
  • 9. An undetermined terminal-based accelerated joint quantum remote state preparation method performed by a sending terminal, comprising: determining chain channels between at least two sending terminals and a receiving terminal edge node; andjointly preparing, by the at least two sending terminals that share to-be-transferred information together, the to-be-transferred information for the receiving terminal edge node together, sending, by the receiving terminal edge node, the to-be-transferred information to a plurality of candidate receiving terminals, and after a target receiving terminal is determined, recovering, by the other candidate receiving terminals and the target receiving terminal, the to-be-transferred information shared together by the at least two sending terminals.
  • 10. An undetermined terminal-based accelerated joint quantum remote state preparation method performed by a receiving terminal edge node, comprising: determining GHZ channels between the receiving terminal edge node and a plurality of candidate receiving terminals; andjointly preparing, by the receiving terminal edge node and at least two sending terminals that share to-be-transferred information together, the to-be-transferred information, receiving the to-be-transferred information, sending the to-be-transferred information to the plurality of candidate receiving terminals, and after a target receiving terminal is determined, recovering, by the other candidate receiving terminals and the target receiving terminal, the to-be-transferred information shared together by the at least two sending terminals.
Priority Claims (1)
Number Date Country Kind
202110246788.4 Mar 2021 CN national
PCT Information
Filing Document Filing Date Country Kind
PCT/CN2021/138678 12/16/2021 WO