A method and device for compressing quantum information
A quantum information and compression method technology, applied in the field of coding, can solve problems such as long operation time, increased number of operations, multi-multiply-add operations, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0100] Suppose the 10-dimensional quantum information is as follows: |φ>=|efghijklmn>, e, f, g, h, i, j, k, l, m, n=a, b.
[0101] According to a quantum information compression method provided by an embodiment of the present invention, 10-dimensional quantum information can be split into 4-dimensional |φ 4 >=|efgh>, e, f, g, h=a, b and 6 dimensions |φ 6 >=|ijklmn>, i, j, k, l, m, n=a, b two parts of quantum information.
[0102] According to formula (6), the information entropy of each qubit in 10-dimensional quantum information can be determined:
[0103] S(ρ)=-λ a logλ a -λ b logλ b =0.6008
[0104] According to the condition η≥S(ρ), for the part of 4-dimensional quantum information, since 4×S(ρ)=2.4032, since the smallest integer greater than 2.4 is 3, the compression for 4-dimensional quantum information can be compressed up to 3 qubits.
[0105] Similarly, for the part of 6-dimensional quantum information, 6×S(ρ)=3.6048, since the smallest integer greater than 3....
Embodiment 2
[0144] Suppose the 15-dimensional quantum information is as follows:
[0145]
[0146] According to a quantum information compression method provided by an embodiment of the present invention, 15-dimensional quantum information can be split into 8-dimensional and 6D And 1-dimensional three-part quantum information.
[0147]According to formula (6), the information entropy of each qubit in 10-dimensional quantum information can be determined:
[0148] S(ρ)=-λ a logλ a -λ b logλ b =0.6008
[0149] According to the condition η≥S(ρ), for the part of 8-dimensional quantum information, since 8×S(ρ)=4.8064, it can be seen that the smallest integer greater than 4.8 is 5, therefore, the compression of 8-dimensional quantum information can be compressed up to 5 qubits.
[0150] Similarly, for the part of 6-dimensional quantum information, since 6×S(ρ)=3.6048, it can be determined that the smallest integer greater than 3.6048 is 4. Therefore, the compression of 6-dimensional...
Embodiment 3
[0191] Suppose 20-dimensional quantum information is as follows:
[0192] |φ>=|cdefghijklmnopqrstuv>,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v=a, b.
[0193] According to a quantum information compression method provided by an embodiment of the present invention, 20-dimensional quantum information can be split into 10-dimensional and 10-dimensional |φ 10 >=|efghijklmn>, e, f, g, h, i, j, k, l, m, n=a, b two parts of quantum information.
[0194] According to the first embodiment, it can be determined that the computational complexity of compressing the 10-dimensional quantum information is [n+(n-1)]×n=(2n-1)n| n=10 = 190, the fidelity is
[0195]
[0196] The method for compressing 10-dimensional quantum information has been described in detail in Embodiment 1, and will not be repeated here.
[0197] Therefore, the total number of multiplication and addition operations of 20-dimensional quantum information is 190+190=380. Compared with directly compressing the multipli...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


