A method, system, terminal, and storage medium for optimizing quantum entanglement conversion efficiency.

By performing Schmitt decomposition on the initial state, target state, and catalyst state of the quantum node, the success probability of E-SLOCC conversion of the catalyst in a branch-by-branch return manner is calculated. This solves the problem that the optimal success probability of the catalyst cannot be accurately determined in the existing technology, and realizes an entangled conversion scheme in which the catalyst is accurately returned in each branch.

CN123070366APending Publication Date: 2026-11-10THE CHINESE UNIV OF HONG KONG (SHENZHEN)
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611577464.8
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-10-13
Publication Date
2026-11-10

AI Technical Summary

Technical Problem

Existing technologies cannot directly and accurately determine the optimal conversion success probability of a given catalyst under branch-by-branch return constraints, which may result in the conversion protocol's success probability parameters being unrealizable or overly conservative, making it difficult to fully leverage the catalyst's auxiliary role in the entanglement conversion of the main system.

Method used

By determining the initial state, target state, and catalyst state vectors of the target quantum node, a Schmitt decomposition is performed to construct the Schmitt vectors of the input state, successful branch, and failed branch. The optimal success probability under the constraint of catalyst return to branch by branch is calculated, and a fixed product state that can be prepared through local operations is selected as the unified failure state to ensure that the catalyst is returned to its original state in each branch.

Benefits of technology

The optimal success probability of a given catalyst under the branch-by-branch return constraint was directly calculated, avoiding overestimation or underestimation of the probability parameter, ensuring that the catalyst can be accurately returned in each branch, giving full play to its auxiliary role, and providing an accurate basis for the configuration of protocol parameters.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123070366A_ABST
    Figure CN123070366A_ABST
Patent Text Reader

Abstract

This invention belongs to the field of quantum information processing technology and discloses a method, system, terminal, and storage medium for optimizing quantum entanglement conversion efficiency. The method includes: constructing an initial state vector, a target state vector, and a catalyst state vector for a target quantum node, and performing Schmitt decomposition to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector; constructing an input state Schmitt vector, a successful branch output state Schmitt vector, and a failed branch output state Schmitt vector based on the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector, arranging them in non-increasing order to obtain the first tail sum, the second tail sum, and the third tail sum; and then calculating the optimal success probability under the catalyst branch-by-branch return constraint. This invention can accurately calculate the optimal success probability of quantum entanglement conversion under the branch-by-branch return constraint, thereby fully utilizing the conversion capability of a given catalyst.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of quantum information processing technology, and in particular to a method, system, terminal, and computer-readable storage medium for optimizing quantum entanglement conversion efficiency. Background Technology

[0002] Quantum entanglement is an important resource in quantum information processing, applicable to fields such as quantum computing, quantum communication, quantum cryptography, and quantum precision measurement. To ensure the practical effectiveness of quantum entanglement in these applications, a given initial entangled state needs to be transformed into a target entangled state that meets the specific requirements of the task before it can be put into actual use.

[0003] Existing methods have different technical objectives. For a given catalyst, the Vidal formula can calculate the optimal SLOCC conversion probability only if the catalyst returns to its original state in the successful branch; however, since this formula does not require the catalyst to remain in its original state in the failed branch, the obtained probability only constitutes an upper bound on the optimal success probability of branch-by-branch return E-SLOCC, and may be higher than the practically achievable value. Fixed-dimensional catalyst design methods are used to search for approximately globally optimal catalysts within a given dimension. The output P of this method... L The lower bound of the branch-back success probability, which is only used to verify the feasibility of the output catalyst, is not necessarily equal to the optimal success probability of the catalyst itself. Therefore, neither can directly determine the optimal E-SLOCC conversion success probability of a given catalyst under the branch-back constraint.

[0004] Therefore, existing technologies still need to be improved and developed. Summary of the Invention

[0005] The main objective of this invention is to provide a method, system, terminal, and computer-readable storage medium for optimizing quantum entanglement conversion efficiency. This invention aims to address the problem that existing methods cannot directly and accurately determine the optimal conversion success probability of a given catalyst under branch-by-branch return constraints, which leads to the possibility that the success probability parameters used in the conversion protocol may be unrealizable or too conservative, thus making it difficult to fully utilize the auxiliary role of the given catalyst in the entanglement conversion of the main system.

[0006] To achieve the above objectives, the present invention provides a method for optimizing quantum entanglement conversion efficiency, the method comprising the following steps: The target quantum node is determined, and the initial state vector, target state vector, and catalyst state vector of the target quantum node are constructed. The initial state vector, the target state vector, and the catalyst state vector are then subjected to Schmitt decomposition to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector. Based on the initial state Schmitt vector and the catalyst state Schmitt vector, an input state Schmitt vector is constructed. The input state Schmitt vector is then arranged in non-increasing order to obtain the first tail sum of the initial state Schmitt vector. Based on the target state Schmitt vector and the catalyst state Schmitt vector, a successful branch output state Schmitt vector is constructed. The successful branch output state Schmitt vectors are arranged in non-increasing order to obtain the second tail sum of the target state Schmitt vector. Determine the Schmitt vector of the fixed product state, construct the Schmitt vector of the failed branch output state based on the Schmitt vector of the fixed product state and the Schmitt vector of the catalyst state, and arrange the Schmitt vector of the failed branch output state in non-increasing order to obtain the third tail sum of the Schmitt vector of the fixed product state; The optimal success probability under the catalyst branch-by-branch return constraint is calculated based on the first tail sum, the second tail sum, and the third tail sum.

[0007] Optionally, the method for optimizing quantum entanglement conversion efficiency, wherein determining the target quantum node, constructing the initial state vector, target state vector, and catalyst state vector of the target quantum node, and performing Schmitt decomposition on the initial state vector, the target state vector, and the catalyst state vector to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector, specifically includes: Identify a target quantum node, wherein the target quantum node includes a first quantum node and a second quantum node; The first quantum node includes a first main system and a first auxiliary system, and the second quantum node includes a second main system and a second auxiliary system; An initial state vector and a target state vector are constructed based on the first main system and the second main system, and a catalyst state vector is constructed based on the first auxiliary system and the second auxiliary system; The initial state vector is subjected to Schmitt decomposition to obtain the initial state Schmitt vector; The expression for the initial state vector after Schmitt decomposition is as follows: ; in, For definition in composite quantum systems The state vector of the initial two-body pure state on the surface. As the primary system, As the second main system, Let be the length of the Schmitt vector. The initial state vector corresponds to the Schmitt coefficient. This is a set of orthogonal normalized vectors on the first principal system. This is a set of orthogonal normalized vectors on the second principal system. Let G be the initial state Schmitt vector. The first component of the initial state Schmitt vector. The first of the initial state Schmitt vectors One component; The target state vector is subjected to Schmitt decomposition to obtain the target state Schmitt vector; The expression for the target state vector after Schmitt decomposition is as follows: ; in, For definition in composite quantum systems The state vector of the target two-body pure state. The Schmitt coefficients corresponding to the target state vector. Let G be the target state Schmitt vector. Let the first component be the target state Schmitt vector. The first of the target state Schmitt vectors One component; The catalyst state vector is subjected to Schmitt decomposition to obtain the catalyst state Schmitt vector; The expression for the catalyst state vector after Schmitt decomposition is as follows: ; in, Let be the catalyst state vector. As the target catalyst, Let be the length of the catalyst state Schmitt vector. For the first auxiliary system A set of orthogonal normalized vectors on the , For the second auxiliary system A set of orthogonal normalized vectors on the , Let G be the catalyst state Schmitt vector. This is the first component in the catalyst state Schmitt vector. The first of the catalyst state Schmitt vectors Each component.

[0008] Optionally, the method for optimizing quantum entanglement conversion efficiency, wherein determining the target quantum node, constructing the initial state vector, target state vector, and catalyst state vector of the target quantum node, and performing Schmitt decomposition on the initial state vector, the target state vector, and the catalyst state vector to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector, further includes: Compare the length of the initial state Schmitt vector with the length of the target state Schmitt vector; If the length of the initial state Schmitt vector is less than the length of the target state Schmitt vector, then add a zero component to the end of the initial state Schmitt vector until it has the same length as the target state Schmitt vector; If the length of the initial state Schmitt vector is greater than the length of the target state Schmitt vector, then a zero component is added to the end of the target state Schmitt vector until it has the same length as the initial state Schmitt vector.

[0009] Optionally, in the method for optimizing quantum entanglement conversion efficiency, the expression for the first tail sum is: ; in, for The first tail of the first step, It is the input state Schmitt vector. It is the vector obtained by arranging the input state Schmitt vectors in non-increasing order. It is the first vector obtained by arranging the input state Schmitt vectors in non-increasing order. One portion, For the first The tail of the step, The total number of components of the input state Schmitt vector. This is the symbol for tensor product.

[0010] Optionally, in the method for optimizing quantum entanglement conversion efficiency, the expression for the second tail sum is: ; in, for The second tail of the order, It is the output state Schmitt vector of the successful branch. It is the vector obtained by arranging the output state Schmitt vectors of successful branches in non-increasing order. It is the first vector obtained by arranging the output state Schmitt vectors of successful branches in non-increasing order. Each component.

[0011] Optionally, in the method for optimizing quantum entanglement conversion efficiency, the expression for the third tail sum is: ; in, for The third tail of the order, The Schmitt vector is a fixed product state. The first of the catalyst state Schmitt vectors Each component.

[0012] Optionally, in the method for optimizing quantum entanglement conversion efficiency, the expression for the optimal success probability is: ; in, This represents the optimal success probability.

[0013] Furthermore, to achieve the above objectives, the present invention also provides an optimization system for quantum entanglement conversion efficiency, wherein the optimization system for quantum entanglement conversion efficiency includes: The Schmitt decomposition module is used to determine the target quantum node, construct the initial state vector, target state vector, and catalyst state vector of the target quantum node, and perform Schmitt decomposition on the initial state vector, the target state vector, and the catalyst state vector to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector. The first tail sum calculation module is used to construct an input state Schmitt vector based on the initial state Schmitt vector and the catalyst state Schmitt vector, arrange the input state Schmitt vector in non-increasing order, and obtain the first tail sum of the initial state Schmitt vector; The second tail sum calculation module is used to construct a successful branch output state Schmitt vector based on the target state Schmitt vector and the catalyst state Schmitt vector, arrange the successful branch output state Schmitt vector in non-increasing order, and obtain the second tail sum of the target state Schmitt vector; The third tail sum calculation module is used to determine the Schmitt vector of the fixed product state, construct the Schmitt vector of the failed branch output state based on the Schmitt vector of the fixed product state and the Schmitt vector of the catalyst state, and arrange the Schmitt vector of the failed branch output state in non-increasing order to obtain the third tail sum of the Schmitt vector of the fixed product state. The optimal success probability calculation module is used to calculate the optimal success probability under the catalyst branch-by-branch return constraint based on the first tail sum, the second tail sum, and the third tail sum.

[0014] Furthermore, to achieve the above objectives, the present invention also provides a terminal, wherein the terminal includes: a memory, a processor, and a quantum entanglement conversion efficiency optimization program stored in the memory and executable on the processor, wherein when the quantum entanglement conversion efficiency optimization program is executed by the processor, it implements the steps of the quantum entanglement conversion efficiency optimization method as described above.

[0015] Furthermore, to achieve the above objectives, the present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores an optimization program for quantum entanglement conversion efficiency, and when the optimization program for quantum entanglement conversion efficiency is executed by a processor, it implements the steps of the quantum entanglement conversion efficiency optimization method as described above.

[0016] In this invention, a target quantum node is determined, and an initial state vector, a target state vector, and a catalyst state vector of the target quantum node are constructed. The initial state vector, the target state vector, and the catalyst state vector are then subjected to Schmitt decomposition to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector. An input state Schmitt vector is constructed based on the initial state Schmitt vector and the catalyst state Schmitt vector. The input state Schmitt vectors are arranged in non-increasing order to obtain the first tail sum of the initial state Schmitt vector. The first tail sum of the initial state Schmitt vector is then obtained based on the target state Schmitt vector and the catalyst state Schmitt vector. The successful branch output state Schmitt vector is constructed using the Schmitt vector. These successful branch output state Schmitt vectors are arranged in non-increasing order to obtain the second tail sum of the target state Schmitt vector. The Schmitt vector of the fixed product state is determined. Based on the Schmitt vector of the fixed product state and the catalyst state Schmitt vector, the failed branch output state Schmitt vector is constructed. These failed branch output state Schmitt vectors are arranged in non-increasing order to obtain the third tail sum of the fixed product state Schmitt vector. The optimal success probability under the catalyst branch-by-branch return constraint is calculated based on the first tail sum, the second tail sum, and the third tail sum. This invention selects a fixed product state that can be prepared through local operations as a unified failure state. Under the constraint that a given catalyst is accurately returned in both the successful and failed branches and is decoupled from the main system, the optimal success probability of the corresponding quantum entanglement transformation is directly calculated. This provides an accurate basis for configuring the probability parameters of the corresponding transformation protocol and fully leverages the auxiliary role of the catalyst in the entanglement transformation of the main system. Attached Figure Description

[0017] Figure 1 This is a flowchart of a preferred embodiment of the method for optimizing the quantum entanglement conversion efficiency of the present invention; Figure 2 This is a schematic diagram of the system architecture for a preferred embodiment of the method for optimizing quantum entanglement conversion efficiency of the present invention; Figure 3 This is a structural diagram of a preferred embodiment of the quantum entanglement conversion efficiency optimization system of the present invention; Figure 4 This is a structural diagram of a preferred embodiment of the terminal of the present invention. Detailed Implementation

[0018] To make the objectives, technical solutions, and advantages of this invention clearer and more explicit, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

[0019] Quantum entanglement is a non-classical correlation in composite quantum systems. For an entangled state, the overall quantum state cannot be represented as a simple product of the quantum states of its individual subsystems. Although each local subsystem can be described by a reduced quantum state, the correlation between the measurement results of different subsystems still needs to be characterized in conjunction with the overall quantum state. For example, for two particles in a specific entangled state, when they are measured under the same or agreed-upon measurement basis, their measurement results can exhibit a correlation that classical systems cannot produce. This correlation can be maintained when the two particles are far apart, but it cannot be used independently of classical communication for faster-than-light information transmission.

[0020] Quantum entanglement is a crucial resource in quantum information processing, applicable to fields such as quantum computing, quantum communication, quantum cryptography, and quantum precision measurement. In quantum computing, entanglement can be used to establish correlations between multiple qubits, supporting specific quantum algorithms and distributed quantum computing tasks. In entanglement-based quantum key distribution protocols, communicating parties can utilize the statistical properties of entanglement measurements to detect eavesdropping or channel anomalies. In quantum teleportation, the sender and receiver transfer an unknown quantum state from one quantum node to another by pre-sharing an entangled state and combining local measurement with classical communication. Furthermore, in appropriate quantum measurement schemes, entanglement can be used to improve the accuracy or sensitivity of parameter estimation. The properties of quantum entanglement enable communication and computation that transcend the limitations of classical theory, opening up new possibilities for technological development.

[0021] In quantum information processing, quantum entanglement with different structures can be applied to different practical scenarios. To ensure the practical effectiveness of quantum entanglement in relevant applications, before it is actually put into use, the given initial entangled state (hereinafter referred to as...) needs to be... Transform it into a target entangled state that meets the requirements of a specific task (hereinafter referred to as...). For a two-body pure state held by two remote quantum nodes, its entanglement structure can be described by Schmitt decomposition and the corresponding Schmitt vector. The relevant transformation methods mainly include the following categories: Local Operations and Classical Communication (LOCC): This allows two parties sharing an entangled state to perform quantum operations on their respective local quantum systems and exchange measurement results or control information through a classical channel. A deterministic LOCC transformation can be represented as: ; Whether the transformation can be achieved when both the initial state and the target state are pure states can be determined by the majorization relationship between the Schmitt vectors of the initial state and the target state, and the corresponding LOCC transformation protocol can be constructed accordingly.

[0022] Stochastic Local Operations and Classical Communication (SLOCC): Its permitted local operations and classical communication methods are similar to LOCC, but the target state only needs to be obtained with a certain probability. The corresponding transformation can be expressed as: ; in, This represents the quantum state obtained from the failed branch. In general, It remains in an entangled state, but cannot be transformed into the target state through subsequent LOCC operations. When both the initial and target states are pure states, Vidal provides the maximum success probability of a SLOCC transformation and a corresponding SLOCC transformation protocol. It should be noted that in a SLOCC transformation, the physical operations performed by the two entangled states do not exceed the scope of LOCC. It is called SLOCC because the target state only has a probability of success in the successful branch. get.

[0023] Entanglement-Assisted Local Operations and Classical Communication (E-LOCC): Existing techniques have proposed catalytic phenomena in quantum entanglement transformations. For some initial states that cannot be deterministically transformed through LOCC themselves... and target state (Hereinafter, the system containing both will be referred to as the main system), which can introduce additional two-body entangled states. As a catalyst, thus achieving: .

[0024] In this transformation, the main system is... Certainty transformed into And entangled catalyst It remains unchanged after the transformation and is decoupled from the target state, thus enabling it to be reused in subsequent quantum information processing tasks.

[0025] Entanglement-Assisted Stochastic Local Operations and Classical Communication (E-SLOCC): Furthermore, existing technologies have also proposed solutions for initial states where deterministic transformations cannot be achieved with the aid of any catalyst. and target state There may still be a catalyst. This increases the success rate of the SLOCC transformation, and the corresponding transformation can be expressed as: ; In the successful branch, the entangled catalyst is returned intact and decoupled from the transformed master system. In the failed branch, the master system and the catalyst may form a jointly entangled state that cannot be decomposed into a tensor product of the master system state and the original catalyst state. At this point, the main system input states involved in the transformation have usually been consumed, and new main system input states need to be prepared before subsequent transformations can be performed. Furthermore, there is no guarantee that these protocols can be recovered through subsequent operations after a failure. The original catalyst is restored. Therefore, a single conversion failure may consume current main system input resources and render the original catalyst unusable. This invention refers to this type of protocol, which guarantees the return of the catalyst only in successful branches, as the "Success Branch Return Type E-SLOCC Protocol".

[0026] This problem is particularly pronounced in scenarios where the same catalyst needs to continuously process multiple input states of the master system. For example, two remote quantum nodes can pre-prepare and share an entangled state as an auxiliary entanglement resource that can be reused across tasks to sequentially process multiple input states provided by the master system's entanglement source. In this scenario, the master system's input state is a transient resource provided for a single task, while the catalyst is a long-term resource that can be reused across multiple tasks. If a transformation fails but the catalyst remains intact, it can continue to process subsequent input states; if the original catalyst cannot be recovered from the failed branch, the quantum node needs to re-prepare, distribute, and store the catalyst to continue executing subsequent tasks, thus additionally occupying the entanglement source, quantum communication link, quantum memory, and local control device. In applications where the catalyst needs to be distributed across remote quantum nodes, has a large local storage dimension, or requires complex preparation and calibration processes, repeated re-preparation of the catalyst triggered by failure increases the consumption of entanglement resources and device occupation, and may interrupt subsequent quantum state transformation tasks.

[0027] To ensure the catalyst can be reused as a long-term resource, it can be further required that the catalyst be precisely returned to its original state in every final output branch with a non-zero probability of occurrence, and decoupled from the main system. This invention refers to this constraint as "branch-by-branch return" and the protocol that satisfies this constraint as the "branch-by-branch return type E-SLOCC protocol".

[0028] With the optimization objective solely focused on the probability of obtaining the target state, and without imposing any other constraints on the main system output in the failed branches, each identified failed branch outputs the original catalyst decoupled from the main system. Quantum nodes can discard the main system outputs of each failed branch without affecting the catalyst and, through local operations, uniformly prepare them into a fixed product state. Then, the failed results are merged, and the corresponding transformations can be uniformly represented as: ; Under the above constraints, regardless of whether the main system conversion is successful or not, the catalyst remains in its original state and is decoupled from the main system, thus enabling it to continue to be used for subsequent quantum information processing tasks.

[0029] Construction of a branch-return E-SLOCC protocol given a catalyst. Prior art provides necessary and sufficient criteria for transforming a single two-body pure state into a given two-body pure state ensemble via LOCC, and its proof also provides a method for constructing the corresponding protocol. In the branch-return E-SLOCC protocol considered in this invention, when the catalyst state... When fixed, the input state is The output ensemble is determined by the probability of Successful branches The probability is Failed branch Composition. Success probability for any candidate. The above transformation exists if and only if the input state is the same as the input state. The corresponding output ensemble satisfies the above necessary and sufficient criterion. When this criterion is true, a LOCC transformation protocol that implements the corresponding branch probability can be generated.

[0030] In summary, existing methods still have the following shortcomings in determining the above-mentioned success probability parameters: 1. The success probability of a branch-by-branch return may overestimate the optimal success probability of a branch-by-branch return. For a given catalyst state... If only the catalyst is required to be returned in the successful branch, then... and Using these as the input and target pure states respectively, and calculating the optimal success probability of the corresponding successful branch return type E-SLOCC transformation using Vidal, this probability is denoted as... .

[0031] However, this calculation method only imposes constraints on the target output of successful branches and does not require failed branches to return the original catalyst. Since the feasible protocol set of the branch-by-branch return-type E-SLOCC protocol is a subset of the feasible protocol set of the successful branch return-type E-SLOCC protocol, their optimal success probabilities satisfy: ; in, This represents the optimal success probability for a given catalyst under branch-and-return constraints. Therefore, the value obtained from the Vidal formula is only guaranteed to be an upper bound on the optimal success probability for branch-and-return constraints. For some combinations of initial states, target states, and catalysts, this upper bound may be strictly greater than the actual achievable success probability under branch-and-return constraints. When the two are strictly unequal, if the value obtained from the Vidal formula is directly used as the success branch probability, the corresponding output ensemble does not satisfy the aforementioned LOCC realizability criterion, and therefore there is no branch-and-return E-SLOCC protocol that can achieve this success probability.

[0032] 2. Fixed-dimensional catalyst design methods cannot directly determine the optimal E-SLOCC conversion success probability of the output catalyst under branch-by-branch return constraints, but they can guarantee the output catalyst's success. The optimal success probability is no less than P. L And ensure P L The difference between the probability of success and the globally optimal probability of success with a fixed dimension does not exceed ε. However, P L Only for output catalyst A proven lower bound for the success probability is generally not equal to the theoretically optimal success probability achievable by the catalyst itself. If only P is used... L While configuring the corresponding conversion protocol can guarantee the feasibility of the conversion, the configured success probability may be lower than the optimal value that the catalyst can actually achieve, thus failing to fully leverage the catalyst's auxiliary role in the entanglement conversion of the main system.

[0033] In summary, the probability obtained from the Vidal formula may be too high to be realized, while the feasible lower bound output by the fixed-dimensional catalyst design method may be lower than the optimal value that a given catalyst can actually achieve. Therefore, a method is needed to directly determine the theoretically optimal success probability under branch-back constraints for any given finite-dimensional catalyst. The calculated optimal success probability can be used together with the state descriptions of the composite input state, successful output state, and failed output state as input to the subsequent protocol construction method to generate a branch-back entanglement transformation scheme that achieves this optimal success probability.

[0034] To address the aforementioned issues, this invention provides a method for calculating the optimal success probability of branch-by-branch return type E-SLOCC and generating conversion schemes for quantum entangled catalysts. This method addresses the problem that directly substituting the composite input state and composite target state into the Vidal formula may overestimate the optimal success probability of branch-by-branch return type E-SLOCC, and that existing fixed-dimensional catalyst design methods cannot directly determine the optimal success probability of the output catalyst itself.

[0035] This invention obtains the initial state Target state and a given catalyst The Schmitt vector is selected, and a fixed principal system product state that can be prepared through local operations is chosen. As a unified failure state, this invention incorporates the catalyst return requirements in both successful and failed branches into the success probability calculation, directly determining the theoretically optimal success probability achievable by a given catalyst under branch-by-branch return constraints.

[0036] This invention is applicable to both finite-dimensional catalysts that have been prepared, stored, or pre-specified by quantum devices and near-globally optimal catalysts. For near-globally optimal catalysts, this invention can further determine the theoretically optimal success probability that the output catalyst itself can achieve, based on the existing lower bound of feasible success probability and the range enclosed by the fixed-dimensional global optimal probability.

[0037] Because this invention explicitly incorporates the constraint of returning the catalyst to its previous branch in the calculation, the obtained probability is the optimal success probability that can actually be achieved under the branch-by-branch return constraint, rather than an upper bound obtained through the E-SLOCC probability formula for successful branch return. This avoids using probability parameters that do not satisfy the pure-state ensemble LOCC realizability criterion for protocol configuration, and also avoids using only a conservative lower bound for the feasible success probability without fully utilizing the conversion capacity of the given catalyst.

[0038] The optimal success probability calculated by this invention determines the probability of successful and failed branches. The protocol construction module can take this probability, along with the state descriptions of the composite input state, successful output state, and failed output state, as input to generate corresponding local measurement, classical communication, and conditional local operation parameters, thereby forming a branch-by-branch return entanglement transformation scheme that can be executed by quantum nodes.

[0039] This invention can be used for: 1. Calculate the optimal E-SLOCC conversion success probability for any given finite-dimensional catalyst under a branch-by-branch return constraint; 2. Further evaluate the catalysts output by existing fixed-dimensional catalyst design schemes to obtain the optimal success probability of the catalyst itself; 3. Compare the conversion performance of multiple prepared, stored or pre-specified candidate catalysts under branch-by-branch return constraints to provide parameter basis for catalyst selection and quantum mission scheduling; 4. The calculated optimal success probability and the state descriptions of the corresponding input and output ensembles are used for subsequent protocol configuration to generate a branch-by-branch return entanglement transformation scheme that can be executed by quantum nodes.

[0040] The method for optimizing quantum entanglement conversion efficiency according to a preferred embodiment of the present invention, such as... Figure 1 As shown, the method for optimizing the quantum entanglement conversion efficiency includes the following steps: Step S10: Determine the target quantum node, construct the initial state vector, target state vector, and catalyst state vector of the target quantum node, and perform Schmitt decomposition on the initial state vector, the target state vector, and the catalyst state vector to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector.

[0041] The calculation process for the Schmitt vector is as follows: A quantum state is a mathematical description of the state of a quantum system. When the state of a quantum system can be completely described by a single normalized state vector in its Hilbert space, the quantum state is called a pure state, and the corresponding state vector is... This is called the state vector of the quantum state. For a given state defined by... A and B The two-body pure states in a composite quantum system can be written in Schmitt decomposition form as follows: ; in, For each system A and B A set of orthogonal normalized vectors on the vector plane. Let be the Schmidt coefficient, satisfying ≥0 and The number of strictly positive Schmitt coefficients is called the Schmitt rank of the two-body pure state. Without loss of generality, the squares of the Schmitt coefficients can be arranged in non-increasing order, i.e. The probability vector is called a probability vector. Let be the Schmitt vector of the two-body pure state. Here, The system uses the Schmitt vector to represent the length. A and system B The dimension of the local state space is not less than Because some are allowed It equals zero, therefore It is not necessarily equal to the Schmitt rank of the binary pure state.

[0042] If two two-body pure states have the same Schmitt vector but different Schmitt bases, such as the pure states mentioned above... and .

[0043] At this point, the two can act on the system separately. A and B The local operations can be transformed into each other. Based on this, in the implementation of the present invention, a preset canonical Schmitt basis can be used without loss of generality, and the corresponding two-body pure state can be characterized by a Schmitt vector.

[0044] Specifically, a target quantum node is determined, wherein the target quantum node includes a first quantum node and a second quantum node; the first quantum node includes a first master system and a first auxiliary system, and the second quantum node includes a second master system and a second auxiliary system; an initial state vector and a target state vector are constructed based on the first master system and the second master system, and a catalyst state vector is constructed based on the first auxiliary system and the second auxiliary system; the initial state vector is subjected to Schmitt decomposition to obtain an initial state Schmitt vector.

[0045] The expression for the initial state vector after Schmitt decomposition is as follows: ; in, For definition in composite quantum systems The state vector of the initial two-body pure state on the surface. As the primary system, As the second main system, Let be the length of the Schmitt vector. The initial state vector corresponds to the Schmitt coefficient. This is a set of orthogonal normalized vectors on the first principal system. This is a set of orthogonal normalized vectors on the second principal system. Let G be the initial state Schmitt vector. The first component of the initial state Schmitt vector. The first of the initial state Schmitt vectors One component; The target state vector is subjected to Schmitt decomposition to obtain the target state Schmitt vector; The expression for the target state vector after Schmitt decomposition is as follows: ; in, For definition in composite quantum systems The state vector of the target two-body pure state. The Schmitt coefficients corresponding to the target state vector. Let G be the target state Schmitt vector. Let the first component be the target state Schmitt vector. The first of the target state Schmitt vectors One component; The catalyst state vector is subjected to Schmitt decomposition to obtain the catalyst state Schmitt vector; The expression for the catalyst state vector after Schmitt decomposition is as follows: ; in, Let be the catalyst state vector. As the target catalyst, Let be the length of the catalyst state Schmitt vector. For the first auxiliary system A set of orthogonal normalized vectors on the , For the second auxiliary system A set of orthogonal normalized vectors on the , Let G be the catalyst state Schmitt vector. This is the first component in the catalyst state Schmitt vector. The first of the catalyst state Schmitt vectors Each component.

[0046] The branch-by-branch return type E-SLOCC conversion protocol in this invention is described below: This invention can be applied to two remote quantum network nodes. and (i.e., the target quantum node in this invention) As the first quantum node, The transformation of two-body pure-state entanglement between quantum nodes (for the second quantum node). Main system (i.e., the primary system) and auxiliary systems (i.e., the first auxiliary system). Quantum node Main system (i.e., the second main system) and auxiliary systems (i.e., the second auxiliary system). Each quantum node may include a local quantum state storage and processing module, and a classical communication link is also set up between two quantum nodes for exchanging measurement results and operation control information.

[0047] This invention considers quantum nodes and The branch-by-branch return type E-SLOCC transformation can be generally expressed as: ; Where, 0≤ r ≤1 indicates a successful branch. The probability of occurrence For the corresponding failed branch The probability of occurrence. The above branches satisfy the probability normalization requirement, that is... The branch-by-branch return constraint requires that the catalyst be returned precisely in its original state in each final branch with a non-zero probability of occurrence, and be decoupled from the main system.

[0048] Wherein, the initial state For the reason and The Schmitt decomposition and Schmitt vector (i.e., the initial state vector) of the two-body pure state in the composite quantum system are as follows: ; target state For the reason and The Schmitt decomposition and Schmitt vector (i.e., the target state vector) of the two-body pure state in the composite quantum system are as follows: ; Catalyst state For the reason and The Schmitt decomposition and Schmitt vector (i.e., the catalyst state vector) of the two-body pure state in the composite quantum system are as follows: ; in, A positive integer not less than 1, representing the number of failed branches.

[0049] Further, the lengths of the initial state Schmitt vector and the target state Schmitt vector are compared; if the length of the initial state Schmitt vector is less than the length of the target state Schmitt vector, a zero component is added to the end of the initial state Schmitt vector until it is the same length as the target state Schmitt vector; if the length of the initial state Schmitt vector is greater than the length of the target state Schmitt vector, a zero component is added to the end of the target state Schmitt vector until it is the same length as the initial state Schmitt vector.

[0050] This invention assumes that the initial state and the target state have the same length in their Schmitt vectors. This is because when the initial state and the target state have different lengths in their Schmitt vectors, zero components can always be added to the end of the shorter vector to make them have the same length. d After arranging the components of the Schmitt vector in non-increasing order, we have: ; ; Since the branch-by-branch return constraint already ensures that the output of each identified failed branch is... Furthermore, the catalyst is decoupled from the main system. Therefore, in a main system where the optimization objective is solely based on the probability of obtaining the target state and the failed branch is not affected, the output of the catalyst is optimized accordingly. When other constraints are imposed, quantum nodes can be based on known failure branch labels. The main system is discarded or reset without acting on the catalyst, and then uniformly prepared into a fixed product state through local operations. Then, ignoring the classic labels of different failure branches, we can coarsely reduce it to a single total failure branch without changing the success probability. The corresponding transformation can be uniformly represented as: ; Among them, the fixed product state corresponding The Widschmidt vector is It has only one non-zero Schmitt coefficient, and its Schmitt rank is 1. This state can be represented as a system. Local state and system The tensor product of the local states of two systems indicates that there is no entanglement between them; such quantum states are called product states. For a two-body pure state, when its Schmitt rank is greater than 1, the state is an entangled state. For simplicity, the tensor product symbol is usually omitted unless it causes ambiguity. ,Will Recorded as If the tensor product sign is explicitly preserved, the Schmitt decomposition of a general two-body pure state should be written as follows: .

[0051] Unless otherwise stated, the branch-by-branch return type E-SLOCC protocol mentioned later in this invention refers to the conversion protocol after merging the failed branches.

[0052] Furthermore, the aforementioned input state, successful branch output state, and failed branch output state are all composite systems. The pure state on the system, where the system and Located at node ,system and Located at node Therefore, the above quantum state can be regarded as... As one party, This represents the other side's two-body pure state. The input state at this point... The corresponding Schmitt vector is Successful branch output state The corresponding Schmitt vector is Failed branch output state The corresponding Schmitt vector is .

[0053] Step S20: Construct an input state Schmitt vector based on the initial state Schmitt vector and the catalyst state Schmitt vector, and arrange the input state Schmitt vector in non-increasing order to obtain the first tail sum of the initial state Schmitt vector.

[0054] Specifically, the expression for the first tail sum is: ; in, for The first tail of the first step, It is the input state Schmitt vector. It is the vector obtained by arranging the input state Schmitt vectors in non-increasing order. It is the first vector obtained by arranging the input state Schmitt vectors in non-increasing order. One portion, For the first The tail of the step, The total number of components of the input state Schmitt vector. This is the symbol for tensor product.

[0055] Understandably, the specific process for calculating the maximum success probability of branch-by-branch return type E-SLOCC is as follows: For any n 3D probability vector ,by This represents the vector obtained by arranging its components in non-increasing order. For any... , define the first The sum of the steps is: ; That is, first divide the probability vector Arrange the components from largest to smallest, then calculate the order after the arrangement. The sum of the components from the first term to the last term.

[0056] For the above branch-by-branch return type E-SLOCC conversion protocol input state Its Schmitt vector is: This vector contains a total of One component: ; Arrange the above components in non-increasing order, and the resulting vector is denoted as . ,Right now: ; in, Represents the first element of the sorted vector. t Each component, that is, all product terms The first in t Large components. When multiple product terms have equal values, their order can be determined according to any preset rule; the order among equal components does not affect the subsequent tail sum calculation result. Therefore, the input state Schmitt vector... The The sum of the last two digits (i.e., the sum of the first digit) is: .

[0057] Step S30: Construct a successful branch output state Schmitt vector based on the target state Schmitt vector and the catalyst state Schmitt vector, and arrange the successful branch output state Schmitt vector in non-increasing order to obtain the second tail sum of the target state Schmitt vector.

[0058] Specifically, the expression for the second tail sum is: ; in, for The second tail of the order, It is the output state Schmitt vector of the successful branch. It is the vector obtained by arranging the output state Schmitt vectors of successful branches in non-increasing order. It is the first vector obtained by arranging the output state Schmitt vectors of successful branches in non-increasing order. Each component.

[0059] Similarly, the successful branch can also be output as a state. Its corresponding Schmitt vector Arranged in non-increasing order, we get The corresponding first The sum of the last two digits (i.e., the sum of the second digit) is: ; Step S40: Determine the Schmitt vector of the fixed product state, construct the Schmitt vector of the failed branch output state based on the Schmitt vector of the fixed product state and the Schmitt vector of the catalyst state, and arrange the Schmitt vector of the failed branch output state in non-increasing order to obtain the third tail sum of the Schmitt vector of the fixed product state.

[0060] Specifically, the expression for the third tail sum is: ; in, for The third tail of the order, The Schmitt vector is a fixed product state. The first of the catalyst state Schmitt vectors Each component.

[0061] For the failed branch output state of the above branch-by-branch return type E-SLOCC conversion protocol ,because Its corresponding Schmitt vector for: ; when When already arranged in non-increasing order It has already been arranged in non-increasing order. Therefore, its last sum (i.e., the third last sum) can be directly calculated as: .

[0062] Step S50: Calculate the optimal success probability of the catalyst under the branch-by-branch return constraint based on the first tail sum, the second tail sum, and the third tail sum.

[0063] Specifically, the expression for the optimal success probability is: ; in, This represents the optimal success probability.

[0064] It can be theoretically proven that, for a given catalyst The maximum success probability of the above branch-by-branch return type E-SLOCC is: ; The ratios are interpreted according to the following rules:

[0065] This formula is the core foundation of the technical solution of this invention.

[0066] Given the initial state, target state, and catalyst, for a fixed... Define the shift tail sum of the initial state and the target state relative to the fixed failure state: ; In the context of this invention, and Both are non-negative numbers. When calculating their ratio, there are three possible scenarios: 1. When When, directly calculate the first... Term Ratio ; 2. When and At that time, the ratio is specified as follows: Since the minimum value of all ratios is ultimately required, this term does not limit the optimal success probability. 3. When At that time, the corresponding ratio is specified as At this time, the first Similarly, no additional restrictions are imposed on the probability of success.

[0067] In particular, when At that time, since all Schmitt vectors have been normalized, we have ; Therefore, it is inevitable that This ensures that for all After the corresponding ratio reaches its minimum value, the optimal success probability obtained does not exceed 1.

[0068] Detailed calculation process: Input: Initial state Schmitt vector p Target state Schmitt vector q And given the catalyst state Schmitt vector c .

[0069] Output: Given catalyst Optimal E-SLOCC conversion success probability under branch-by-branch return constraint .

[0070] The specific steps are as follows: 1. Obtain p , q and c .

[0071] 2. Inspection p , q and c If the input is not satisfied, the input is considered invalid.

[0072] 3. When p and q When the lengths of the vectors are different, zero components are added to the end of the shorter vector to make them have the same length. d The catalyst Schmitt vector c The components are arranged in non-increasing order, and their length is denoted as . k .make n = dk .

[0073] 4. Construct the tensor product Schmitt vector of the initial state and target state with the catalyst. and And arrange them in non-increasing order, denoted as: ; and ; in, It is used for recording The vector variable representing the non-increasing sort result. It is used for recording The vector variable representing the non-increasing sort result; express The One component; express The One portion, The range of values ​​is 1, 2, ... n This invention does not limit the specific sorting method used; quicksort, heapsort, or other sorting methods that can obtain the same non-increasing arrangement result can be used. When multiple product terms have equal values, they can be arranged according to any preset rule; the order among equal components does not affect the subsequent tail sum calculation result.

[0074] 5. Calculate the tail sums of the initial-state tensor product vector and the target-state tensor product vector, respectively. (Settings...) Then according to The sequential recursive calculation: ; in, It is used to record vectors From the The component up to the first n The tail sum of the sum of the components, It is used to record vectors From the The component up to the first n The tail sum variable of the sum of its components, i.e.: .

[0075] 6. Calculate the tail sum of the tensor product between the fixed failure states and the catalyst:

[0076] in, It is used to record the Schmitt vector of the tensor product of failed branches. The variables of the order and tail sum.

[0077] 7. For each Calculate the shift tail sum of the initial state and the target state relative to the fixed failure state.

[0078] ; 8. Initialization ,according to Process the tail sums of each shift in sequence: i.if Then update ; ii. If and If the ratio is positive, the corresponding ratio will be treated as +∞ and will not be updated. And continue processing the next index; iii. If If the ratio is 1, then it will be treated as 1 and will not be updated. And continue processing the next index; 9. Return As output.

[0079] The application scenarios and system implementation process of this invention are as follows: This invention can be applied to the transformation of two-body pure-state entanglement in quantum networks or distributed quantum computing systems. One embodiment of the system structure is as follows: Figure 2 As shown. The system includes quantum nodes. N A and quantum nodes N B Quantum nodes N A and N B It includes a classical information processing module and a local quantum state storage and processing module. The classical information processing module is used to process quantum state parameters, calculate the optimal success probability, configure the conversion protocol, and process classical measurement results; the local quantum state storage and processing module is used to store quantum states and perform local measurements and conditional local operations according to the control parameters issued by the classical information processing module. Quantum Node N A The local quantum state storage and processing module includes the main system. A 0 and auxiliary systems A 1. Quantum Nodes N B The local quantum state storage and processing module includes the main system. B 0 and auxiliary systems B 1. Quantum Nodes N A and quantum nodes N B A classic channel is set up between them for exchanging state parameters, local measurement results, and conditional operation information.

[0080] In this embodiment, the initial state The two local subsystems have been stored in the main system. A 0 and B 0, given catalyst state The two local subsystems have been stored in the auxiliary system. A 1 and B 1. Therefore, during the branch-by-branch return E-SLOCC conversion described in this invention, the two quantum nodes only need to exchange measurement results and control information through a classical channel.

[0081] In the above system, the present invention is implemented according to the following steps: 1. Obtain the parameters of the initial state, target state, and catalyst state. (Quantum node) N A quantum nodes NB Based on the quantum entanglement state transformation task to be performed, obtain the initial state of the main system. Schmitt vector Main system target state Schmitt vector And auxiliary system catalyst state Schmitt vector .

[0082] 2. Calculate the optimal success probability of the branch-by-branch return-type E-SLOCC protocol. (Quantum node) N A and quantum nodes N B Calculations yielded a given catalyst Optimal E-SLOCC conversion success probability under branch-by-branch return constraint The computation can be performed by either node and the result can be sent to another quantum node via a classical channel; alternatively, it can be performed by both nodes.

[0083] 3. Configure a branch-by-branch return-type E-SLOCC conversion protocol. Quantum Node N A and quantum nodes N B Input state Successful branch output state Failed branch output state and the calculated success probability As input, the corresponding E-SLOCC conversion protocol is generated.

[0084] 4. Perform branch-by-branch return entanglement transformation. Quantum node N A and N B The local quantum state storage and processing module performs local measurements and conditional local operations on its master and auxiliary systems according to the generated protocol parameters. The classical information processing modules of the two quantum nodes exchange measurement results and operation control information through the inter-node classical channel, thereby performing the following transformations: ; 5. Process the main system output and reuse the catalyst. When the conversion enters the success branch, the main system... Output target state This target state can be delivered to subsequent quantum information processing tasks. When the transition enters the failure branch, the main system... Output fixed product state This product state can be discarded, reset, or reinitialized. Regardless of whether the transition leads to a successful or failed branch, the catalyst state... All remain in their original state in the auxiliary system. and In this process, the quantum node is decoupled from the main system. Therefore, the quantum node does not need to re-prepare or redistribute the catalyst and can continue to retain the auxiliary system. and The catalyst state in the quantum state can be used to process the input state of the main system that has the same transformation requirements, or for other quantum state transformation tasks that have been verified to be feasible.

[0085] Example 1: The probability obtained by the Vidal formula is strictly higher than the optimal success probability of the branch-by-branch return type. This example uses... Figure 2 The diagram shows a two-node quantum network system. Quantum nodes. N A and N B The local dimension of the main system is no less than 3, and the local dimension of the auxiliary system is no less than 2. Let the Schmitt vectors of the initial state, target state, and given catalyst state be respectively: ; The failure state is fixed and taken as the product state, whose Schmitt vector is: ; First, construct and sort the tensor product Schmitt vectors of the initial state, target state, and fixed failure state with the catalyst, and obtain: , , .

[0086] The corresponding tail sums and ratios are shown in Table 1: Table 1: Tail sums and ratios of the tensor product Schmitt vectors of the catalyst for the initial, target, and fixed failure states, sorted together.

[0087] If only the catalyst is required to be returned in the successful branch, then substituting the composite input state and composite target state into the Vidal equation yields: ; However, according to the shifted tail sum formula of this invention, the optimal success probability for a given catalyst under the branch-by-branch return constraint is: ; Therefore, there is no branch-by-branch return-type E-SLOCC protocol with a success probability of 5 / 6. Quantum nodes should use the optimal success probability calculated in this invention. Configuration protocol. This translates to:

[0088] This example demonstrates that directly using the Vidal formula may yield success probability parameters that are unrealizable under the branch-by-branch return constraint.

[0089] Example 2: Calculating the optimal success probability of a catalyst output by a fixed-dimensional catalyst design method. This example uses... Figure 2 The diagram shows a two-node quantum network system. Let the Schmitt vectors of the initial state and the target state be respectively: ; The failure state is fixed and taken as the product state, whose Schmitt vector is: f =(1, 0, 0, 0); The fixed-dimensional catalyst design method sets the upper limit of the local dimension of the catalyst to... The output catalyst Schmidt vector is obtained after four rounds of binary search: ; And the bounding interval of the globally optimal success probability of a fixed dimension: ; To further determine the output catalyst To determine its optimal success probability, this embodiment first constructs and sorts three tensor product Schmitt vectors: , as well as ; According to the calculation method of the present invention, the corresponding tail sum and the ratio of shifted tail sum are shown in Table 2.

[0090] Table 2: Tail sums and shift tail sum ratios of the three tensor product-Schmidt vectors in the order of their tandem.

[0091] Therefore, the output catalyst Its own branch-by-branch return optimal success probability is: ; The result satisfies: ; In particular, the fixed-dimensional catalyst design method provides a feasible lower bound. This is strictly less than 2 / 3 of the optimal success probability achievable by the output catalyst itself. Therefore, if only the feasible lower bound configuration protocol output by the fixed-dimensional catalyst design method is used, the success probability can only be guaranteed to be 5 / 8; after further calculation using this invention, the protocol success probability can be set to 2 / 3 of the actual optimal value achievable by the given catalyst. The corresponding branch-by-branch return type is transformed into:

[0092] Quantum nodes can use the aforementioned optimal success probability and the state description of the output ensemble as input to the protocol construction method to generate corresponding local measurement, classical communication, and conditional local operation parameters.

[0093] The effects of the technical solution of this invention: 1. Avoid overestimating the optimal success probability of branch-by-branch return. This invention explicitly introduces a fixed tensor product tail sum of the failure state and the catalyst in the success probability calculation, so that the calculation conditions simultaneously include the catalyst return requirements in both the success and failure branches. Compared with directly applying the success-branch return E-SLOCC probability formula to the composite input state and composite target state, this invention obtains the actually achievable optimal success probability under the branch-by-branch return constraint, rather than its upper bound, thereby avoiding the use of unachievable success probability parameters in subsequent protocol configurations.

[0094] 2. Directly obtain the optimal success probability of a given catalyst. This invention represents the optimal success probability of a given catalyst as the minimum value of a finite number of shift tail sum ratios, which can be directly obtained through tensor integral sorting, tail sum calculation, and ratio comparison. The result is the optimal success probability of the catalyst itself under the branch-by-branch return constraint, rather than a lower bound or probability interval of the feasible success probability.

[0095] 3. Supplementing the output of the fixed-dimensional optimal catalyst design scheme. For the near-globally optimal catalyst output by the fixed-dimensional optimal catalyst design scheme, this invention can further calculate the optimal success probability of the catalyst itself.

[0096] 4. Provides parameter basis for catalyst selection and subsequent protocol configuration. This invention can calculate the optimal success probability of multiple prepared, stored, or pre-specified candidate catalysts, providing parameter basis for catalyst selection, task scheduling, and performance comparison for classical information processing modules of quantum nodes or optional quantum network resource management devices.

[0097] 5. A complete implementation process from success probability calculation to catalyst reuse is established. This invention uses the calculated optimal success probability, along with descriptions of the composite input state, the successful branch output state, and the failed branch output state, to configure the conversion protocol and control the two quantum nodes to perform local measurements, classical communication, and conditional local operations. In both the successful and failed branches, the catalyst is retained in its original state and decoupled from the main system, thus allowing it to continue to be used for subsequent quantum state conversion tasks.

[0098] Furthermore, alternative implementations of the present invention include: 1. The initial state, target state, and catalyst can be directly input as Schmitt vectors, or they can be input through pure state amplitude, reduced density matrix, quantum state description data, or quantum circuit parameters. The corresponding Schmitt vectors are obtained through Schmitt decomposition, singular value decomposition, or eigenvalue decomposition of the reduced density matrix. The specific representation of the input data does not change the probability calculation principle of this invention.

[0099] 2. The tensor product Schmitt vector can be ordered non-increasingly using comparison sorting, merge sort, heap sort, parallel sorting, or other equivalent sorting methods. Different sorting methods only affect computation speed and storage requirements, without changing the final success probability.

[0100] 3. The fixed failure state can be selected as any fixed product state that can be prepared through local operations. Different fixed product states all have a Schmitt vector f=(1,0,…,0) under the corresponding local basis. Therefore, changing the specific basis vector of the fixed product state does not change the success probability calculation result of this invention.

[0101] 4. If there are multiple candidate catalysts, the calculation process of this invention can be executed sequentially or in parallel, and the catalyst for the current task can be selected according to the obtained optimal success probability.

[0102] In summary, the key innovations of this invention are as follows: 1. Incorporating the branch-by-branch return constraint into the success probability calculation for a given catalyst. This invention, for a given initial state, target state, and catalyst, uses a fixed product state that can be prepared through local operations as a unified failure state. Under the constraint that both successful and failed branches return to the reduced catalyst, the optimal E-SLOCC success probability is calculated, which differs from probability calculation methods that only require successful branches to return to the catalyst.

[0103] 2. Forming a finite-dimensional computational flow for a given catalyst. This invention constructs and sorts the tensor product Schmitt vectors of the initial state, target state, and catalyst, and calculates all tail sums. For each tail sum, the shifted tail sums of the initial state and target state relative to the fixed failure state are calculated, and the minimum value of the corresponding shifted tail sum ratio is taken, thus distinguishing it from the Vidal formula that directly uses the ordinary tail sum ratio of the composite input state and composite target state. This invention is applicable to any given finite-dimensional catalyst and can also be used to further calculate the optimal success probability of the catalyst output by the optimal catalyst design of fixed dimensions.

[0104] 3. Optimal probabilities are used for protocol configuration. The calculated probabilities, along with the composite input state, successful output state, and failed output state, are used as inputs to construct the pure-state ensemble protocol, yielding local operations and classical communication parameters. The focus of this invention is to provide accurate optimal success probabilities and a complete input-output ensemble description for protocol configuration.

[0105] 4. Implementation Combination for Quantum Nodes. Two remote quantum nodes perform local measurements and conditional local operations respectively according to the generated protocol parameters, and exchange measurement results and control information through a classical channel; both successful and failed branches output the original catalyst, which is decoupled from the main system, so that it can continue to be used for subsequent tasks.

[0106] Among them, items 1 and 2 constitute the core probability calculation scheme; items 1 to 3 constitute the probability calculation and protocol configuration scheme; and items 1 to 4 constitute the complete implementation scheme for dual-node quantum networks.

[0107] Possible design changes or modifications to this invention include: 1. Input and Modification of Failure States. The initial state, target state, and catalyst can be directly input as a Schmitt vector, or the corresponding Schmitt vector can be obtained from pure state amplitude, reduced density matrix, or other quantum state description data. The failure state can be selected as any pure product state that can be prepared through local operations, not limited to product states under a specific local basis.

[0108] 2. Variations in sorting and tail sum calculation methods. The tensor product Schmitt vector can be ordered non-increasingly using comparison sorting, merge sorting, or other equivalent methods; the tail sum can be calculated using reverse accumulation, prefix sum transformation, or other equivalent methods. Different implementations only affect computational efficiency and storage requirements, without changing the final success probability.

[0109] 3. Protocol construction method. Any method that can generate an equivalent LOCC protocol based on the input pure state-output ensemble can be adopted.

[0110] 4. Deployment method of computing and control modules. Computing can be performed by... N A , N B It can be executed by any node, by two nodes working together, or by a network control device connected to two nodes via classic communication.

[0111] 5. Multi-catalyst evaluation method. It can perform calculations on a single catalyst or on multiple candidate catalysts in batches, and complete catalyst selection and task scheduling accordingly.

[0112] Furthermore, such as Figure 3 As shown, based on the above-mentioned method for optimizing quantum entanglement conversion efficiency, the present invention also provides a corresponding system for optimizing quantum entanglement conversion efficiency, wherein the system for optimizing quantum entanglement conversion efficiency includes: The Schmitt decomposition processing module 51 is used to determine the target quantum node, construct the initial state vector, target state vector and catalyst state vector of the target quantum node, and perform Schmitt decomposition processing on the initial state vector, the target state vector and the catalyst state vector to obtain the initial state Schmitt vector, the target state Schmitt vector and the catalyst state Schmitt vector. The first tail sum calculation module 52 is used to construct an input state Schmitt vector based on the initial state Schmitt vector and the catalyst state Schmitt vector, arrange the input state Schmitt vector in non-increasing order, and obtain the first tail sum of the initial state Schmitt vector; The second tail sum calculation module 53 is used to construct a successful branch output state Schmitt vector based on the target state Schmitt vector and the catalyst state Schmitt vector, and arrange the successful branch output state Schmitt vector in non-increasing order to obtain the second tail sum of the target state Schmitt vector; The third tail sum calculation module 54 is used to determine the Schmitt vector of the fixed product state, construct the Schmitt vector of the failed branch output state based on the Schmitt vector of the fixed product state and the Schmitt vector of the catalyst state, and arrange the Schmitt vector of the failed branch output state in non-increasing order to obtain the third tail sum of the Schmitt vector of the fixed product state. The optimal success probability calculation module 55 is used to calculate the optimal success probability under the catalyst branch-by-branch return constraint based on the first tail sum, the second tail sum, and the third tail sum.

[0113] Furthermore, such as Figure 4 As shown, based on the above-mentioned optimization method and system for quantum entanglement conversion efficiency, the present invention also provides a terminal, which includes a processor 10, a memory 20 and a display 30. Figure 4 Only some of the terminal components are shown; however, it should be understood that it is not required to implement all of the components shown, and more or fewer components may be implemented instead.

[0114] In some embodiments, the memory 20 may be an internal storage unit of the terminal, such as a hard disk or memory. In other embodiments, the memory 20 may be an external storage device of the terminal, such as a plug-in hard disk, SmartMediaCard (SMC), SecureDigital (SD) card, or FlashCard. Furthermore, the memory 20 may include both internal and external storage devices. The memory 20 is used to store application software and various types of data installed on the terminal, such as the program code installed on the terminal. The memory 20 can also be used to temporarily store data that has been output or will be output. In one embodiment, the memory 20 stores an optimization program 40 for quantum entanglement conversion efficiency, which can be executed by the processor 10 to implement the quantum entanglement conversion efficiency optimization method of this application.

[0115] In some embodiments, the processor 10 may be a central processing unit (CPU), a microprocessor, or other data processing chip, used to run program code stored in the memory 20 or process data, such as executing the optimization method for quantum entanglement conversion efficiency.

[0116] In some embodiments, the display 30 may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, or an OLED (Organic Light-Emitting Diode) touchscreen, etc. The display 30 is used to display information on the terminal and to display a visual user interface.

[0117] In one embodiment, when the processor 10 executes the quantum entanglement conversion efficiency optimization program 40 in the memory 20, it implements the steps of the quantum entanglement conversion efficiency optimization method as described above.

[0118] The present invention also provides a computer-readable storage medium, wherein the computer-readable storage medium stores an optimization program for quantum entanglement conversion efficiency, and when the optimization program for quantum entanglement conversion efficiency is executed by a processor, it implements the steps of the quantum entanglement conversion efficiency optimization method as described above.

[0119] In summary, this invention provides a method, system, terminal, and storage medium for optimizing quantum entanglement conversion efficiency. The method includes: determining a target quantum node; constructing an initial state vector, a target state vector, and a catalyst state vector for the target quantum node; performing Schmitt decomposition on the initial state vector, the target state vector, and the catalyst state vector to obtain an initial state Schmitt vector, a target state Schmitt vector, and a catalyst state Schmitt vector; constructing an input state Schmitt vector based on the initial state Schmitt vector and the catalyst state Schmitt vector; arranging the input state Schmitt vector in non-increasing order to obtain the first tail sum of the initial state Schmitt vector. Based on the target state Schmitt vector and the catalyst state Schmitt vector, a successful branch output state Schmitt vector is constructed. The successful branch output state Schmitt vectors are arranged in non-increasing order to obtain the second tail sum of the target state Schmitt vector. The Schmitt vector of the fixed product state is determined. Based on the fixed product state Schmitt vector and the catalyst state Schmitt vector, a failed branch output state Schmitt vector is constructed. The failed branch output state Schmitt vectors are arranged in non-increasing order to obtain the third tail sum of the fixed product state Schmitt vector. The optimal success probability under the catalyst branch-by-branch return constraint is calculated based on the first tail sum, the second tail sum, and the third tail sum. This invention selects a fixed product state that can be prepared through local operations as a unified failure state. Under the constraint that a given catalyst is accurately returned in both successful and failed branches and is decoupled from the main system, the optimal success probability of the corresponding quantum entanglement transformation is directly calculated. This provides an accurate basis for configuring the probability parameters of the corresponding transformation protocol and fully leverages the auxiliary role of the catalyst in the entanglement transformation of the main system.

[0120] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or terminal. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or terminal that includes that element.

[0121] Of course, those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware (such as a processor, controller, etc.). The program can be stored in a computer-readable storage medium, and when executed, it can include the processes described in the above method embodiments. The computer-readable storage medium can be a memory, magnetic disk, optical disk, etc.

[0122] It should be understood that the application of the present invention is not limited to the examples above. Those skilled in the art can make improvements or modifications based on the above description, and all such improvements and modifications should fall within the protection scope of the appended claims.

Claims

1. A method for optimizing quantum entanglement conversion efficiency, characterized in that, The optimization methods for quantum entanglement conversion efficiency include: The target quantum node is determined, and the initial state vector, target state vector, and catalyst state vector of the target quantum node are constructed. The initial state vector, the target state vector, and the catalyst state vector are then subjected to Schmitt decomposition to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector. Based on the initial state Schmitt vector and the catalyst state Schmitt vector, an input state Schmitt vector is constructed. The input state Schmitt vector is then arranged in non-increasing order to obtain the first tail sum of the initial state Schmitt vector. Based on the target state Schmitt vector and the catalyst state Schmitt vector, a successful branch output state Schmitt vector is constructed. The successful branch output state Schmitt vectors are arranged in non-increasing order to obtain the second tail sum of the target state Schmitt vector. Determine the Schmitt vector of the fixed product state, construct the Schmitt vector of the failed branch output state based on the Schmitt vector of the fixed product state and the Schmitt vector of the catalyst state, and arrange the Schmitt vector of the failed branch output state in non-increasing order to obtain the third tail sum of the Schmitt vector of the fixed product state; The optimal success probability under the catalyst branch-by-branch return constraint is calculated based on the first tail sum, the second tail sum, and the third tail sum.

2. The method for optimizing quantum entanglement conversion efficiency according to claim 1, characterized in that, The process of determining the target quantum node, constructing the initial state vector, target state vector, and catalyst state vector of the target quantum node, and performing Schmitt decomposition on the initial state vector, target state vector, and catalyst state vector to obtain the initial state Schmitt vector, target state Schmitt vector, and catalyst state Schmitt vector specifically includes: Identify a target quantum node, wherein the target quantum node includes a first quantum node and a second quantum node; The first quantum node includes a first main system and a first auxiliary system, and the second quantum node includes a second main system and a second auxiliary system; An initial state vector and a target state vector are constructed based on the first main system and the second main system, and a catalyst state vector is constructed based on the first auxiliary system and the second auxiliary system; The initial state vector is subjected to Schmitt decomposition to obtain the initial state Schmitt vector; The expression for the initial state vector after Schmitt decomposition is as follows: ; in, For definition in composite quantum systems The state vector of the initial two-body pure state on the surface. As the primary system, As the second main system, Let be the length of the Schmitt vector. The initial state vector corresponds to the Schmitt coefficient. This is a set of orthogonal normalized vectors on the first principal system. This is a set of orthogonal normalized vectors on the second principal system. Let G be the initial state Schmitt vector. The first component of the initial state Schmitt vector. The first of the initial state Schmitt vectors One component; The target state vector is subjected to Schmitt decomposition to obtain the target state Schmitt vector; The expression for the target state vector after Schmitt decomposition is as follows: ; in, For definition in composite quantum systems The state vector of the target two-body pure state. The Schmitt coefficients corresponding to the target state vector. Let G be the target state Schmitt vector. Let the first component be the target state Schmitt vector. The first of the target state Schmitt vectors One component; The catalyst state vector is subjected to Schmitt decomposition to obtain the catalyst state Schmitt vector; The expression for the catalyst state vector after Schmitt decomposition is as follows: ; in, Let be the catalyst state vector. As the target catalyst, Let be the length of the catalyst state Schmitt vector. For the first auxiliary system A set of orthogonal normalized vectors on the , For the second auxiliary system A set of orthogonal normalized vectors on the , Let G be the catalyst state Schmitt vector. This is the first component in the catalyst state Schmitt vector. The first of the catalyst state Schmitt vectors Each component.

3. The method for optimizing quantum entanglement conversion efficiency according to claim 1, characterized in that, The process involves determining the target quantum node, constructing the initial state vector, target state vector, and catalyst state vector of the target quantum node, and performing Schmitt decomposition on the initial state vector, target state vector, and catalyst state vector to obtain the initial state Schmitt vector, target state Schmitt vector, and catalyst state Schmitt vector, followed by: Compare the length of the initial state Schmitt vector with the length of the target state Schmitt vector; If the length of the initial state Schmitt vector is less than the length of the target state Schmitt vector, then add a zero component to the end of the initial state Schmitt vector until it has the same length as the target state Schmitt vector; If the length of the initial state Schmitt vector is greater than the length of the target state Schmitt vector, then a zero component is added to the end of the target state Schmitt vector until it has the same length as the initial state Schmitt vector.

4. The method for optimizing quantum entanglement conversion efficiency according to claim 2, characterized in that, The expression for the first tail sum is: ; in, for The first tail of the first step, It is the input state Schmitt vector. It is the vector obtained by arranging the input state Schmitt vectors in non-increasing order. It is the vector obtained by arranging the input state Schmitt vectors in non-increasing order. One portion, For the first The tail of the step, The total number of components of the input state Schmitt vector. This is the symbol for tensor product.

5. The method for optimizing quantum entanglement conversion efficiency according to claim 4, characterized in that, The expression for the second tail sum is: ; in, for The second tail of the order, It is the output state Schmitt vector of the successful branch. It is the vector obtained by arranging the output state Schmitt vectors of successful branches in non-increasing order. It is the first vector obtained by arranging the output state Schmitt vectors of successful branches in non-increasing order. Each component.

6. The method for optimizing quantum entanglement conversion efficiency according to claim 5, characterized in that, The expression for the third tail sum is: ; in, for The third tail of the order, The Schmitt vector is a fixed product state. The first of the catalyst state Schmitt vectors Each component.

7. The method for optimizing quantum entanglement conversion efficiency according to claim 6, characterized in that, The expression for the optimal success probability is: ; in, This represents the optimal success probability.

8. A system for optimizing quantum entanglement conversion efficiency, characterized in that, The optimization system for quantum entanglement conversion efficiency includes: The Schmitt decomposition module is used to determine the target quantum node, construct the initial state vector, target state vector, and catalyst state vector of the target quantum node, and perform Schmitt decomposition on the initial state vector, the target state vector, and the catalyst state vector to obtain the initial state Schmitt vector, the target state Schmitt vector, and the catalyst state Schmitt vector. The first tail sum calculation module is used to construct an input state Schmitt vector based on the initial state Schmitt vector and the catalyst state Schmitt vector, arrange the input state Schmitt vector in non-increasing order, and obtain the first tail sum of the initial state Schmitt vector; The second tail sum calculation module is used to construct a successful branch output state Schmitt vector based on the target state Schmitt vector and the catalyst state Schmitt vector, arrange the successful branch output state Schmitt vector in non-increasing order, and obtain the second tail sum of the target state Schmitt vector; The third tail sum calculation module is used to determine the Schmitt vector of the fixed product state, construct the Schmitt vector of the failed branch output state based on the Schmitt vector of the fixed product state and the Schmitt vector of the catalyst state, and arrange the Schmitt vector of the failed branch output state in non-increasing order to obtain the third tail sum of the Schmitt vector of the fixed product state. The optimal success probability calculation module is used to calculate the optimal success probability under the catalyst branch-by-branch return constraint based on the first tail sum, the second tail sum, and the third tail sum.

9. A terminal, characterized in that, The terminal includes: a memory, a processor, and a quantum entanglement conversion efficiency optimization program stored in the memory and executable on the processor. When the quantum entanglement conversion efficiency optimization program is executed by the processor, it implements the steps of the quantum entanglement conversion efficiency optimization method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores an optimization program for quantum entanglement conversion efficiency, which, when executed by a processor, implements the steps of the quantum entanglement conversion efficiency optimization method as described in any one of claims 1-7.