Quantum homomorphic cryptography directly evaluates the quantum ciphertext

rather than decrypts the quantum ciphertext and then calculates it. Based on a general

d

-dimensional unitary operator of phase and state transformation

a

d

-dimensional (

t

n

) threshold quantum homomorphic encryption algorithm was proposed. In this algorithm

the client sent the quantum state ciphertext to

t

of

n

servers. Each of the

t

servers generated the evaluation sub-keys

and then run the evaluation algorithm on the quantum state ciphertext to complete the calculation of quantum homomorphism. The client perfo

rmed CNOT gates on the quantum states after decryption

and the aggregate value of

t

+1 particles was the result after evaluation calculation on the quantum state plaintext. The algorithm uses Shamir's (

t

n

) threshold scheme to hide the evaluation keys

so that it protects the client's private data. The theorems prove the correctness of the algorithm theoretically

and the simulations of each stage of the algorithm further verify its correctness.