Quantum Obfuscation of Generalized Quantum Power Functions with Coefficient

Quantum obfuscation is one of the important primitives in quantum cryptography that can be used to enhance the security of various quantum cryptographic schemes. The research on quantum obfuscation focuses mainly on the obfuscatability of quantum functions. As a primary quantum function, the quantum power function has led to the development of quantum obfuscation because it is applicable to construct new obfuscation applications such as quantum encryption schemes. However, the previous definition of quantum power functions is constrained and cannot be beneficial to the further construction of other quantum functions. Thus, it is essential to extend the definition of the basic quantum power function in a more general manner. In this paper, we provide a formal definition of two quantum power functions called generalized quantum power functions with coefficients, each of which is characterized by a leading coefficient and an exponent that corresponds to either a quantum or classical state, indicating the generality. The first is the quantum power function with a leading coefficient, and the second is the quantum n-th power function, which are both fundamental components of quantum polynomial functions. In addition, obfuscation schemes for the functions are constructed by quantum teleportation and quantum superdense coding, and demonstrations of their obfuscatability are also provided in this paper. This work establishes the fundamental basis for constructing more quantum functions that can be utilized for quantum obfuscation, therefore contributing to the theory of quantum obfuscation.


Introduction
In recent years, the development of quantum computing has deeply threatened classical cryptography.More and more quantum algorithms are proven to be effective in breaking classical cryptographic protocols.For instance, Shor's algorithm [1] reduces the time complexity of solving the difficult problem of large integer factorization to the polynomial level.
Quantum computing not only presents cryptography with new challenges but also with new opportunities.Quantum cryptography is the science of exploiting the superior properties of quantum mechanics to perform cryptographic tasks.In 1984, Bennett and Brassard proposed the BB84 protocol [2], the world's first quantum key distribution protocol, which utilizes the principle of quantum uncertainty to solve the problems of eavesdropping and man-in-the-middle attacks in key distribution protocols.Subsequently, quantum cryptography has developed a succession of new protocols, including quantum teleportation, quantum secret sharing [3], quantum message authentication [4], and quantum signature [5].
Quantum obfuscation is one of the primitives of quantum cryptography that can be used to enhance the security of quantum cryptographic schemes.The study of quantum obfuscation originated from classical obfuscation.The research on classical obfuscation was originally initiated by Hada [6] and formally elaborated by Barak.Barak et al. [7] analyzed the impossibility of virtual black-box (VBB) obfuscation and proposed a new definition of obfuscation called indistinguishability obfuscation.The definition requires that if two circuits compute the same function, then their obfuscations should be indistinguishable.Lynn et al. [8] discussed point functions and the simple obfuscation of combined point functions and presented the first positive result of obfuscation theory by means of an access control problem based on regular expression.In 2013, Garg et al. [9] gave a general structure for indistinguishable obfuscation and functional encryption applicable to all circuits with polynomial size.Several applications of obfuscation are subsequently demonstrated [10][11][12][13][14], and these works have significantly promoted the study of classical obfuscation.
Quantum obfuscation can enhance the security of quantum cryptographic applications.For instance, quantum point obfuscation can successfully protect private keys and identity information in cryptographic protocols.Furthermore, quantum obfuscation can be used in the construction of various quantum cryptographic protocols, providing greater flexibility.In 2016, Alagic and Fefferman [15] first proposed the definitions of quantum black-box obfuscation and quantum indistinguishable obfuscation.They also constructed general structures for some related cryptography applications, including quantum-secure one-way functions and quantum symmetric encryption.This work has greatly promoted the study of quantum obfuscation.Quantum obfuscation-based cryptographic applications have made some progress in recent years, including the quantum IND-secure quantum symmetric encryption scheme [16], the quantum homomorphic encryption scheme [17], the quantum tokens for digital signatures [18], and the quantum money scheme [19].
Research on the construction of quantum obfuscation is still relatively immature.To further develop the construction methods of quantum obfuscation, it is essential to investigate the obfuscatability of quantum nonlinear functions since they cover a wide range of obfuscatable quantum functions.Pan [20] et al. proposed a universal method for obfuscating quantum parameters in quantum nonlinear functions.They also defined a rough quantum power function to demonstrate universal obfuscation.However, as a basic component of nonlinear functions and composite functions, quantum power functions are not well defined at present.Consequently, it is important to extend the definition of quantum power functions, which we refer to as generalized quantum power functions.
In this work, we first introduce practical primitives for the obfuscation of generalized quantum power functions.We define two specific generalized quantum power functions and illustrate the functionality of each function.Then, we construct obfuscation schemes for generalized quantum power functions and provide demonstrations of their obfuscatability.We hope that our work will be beneficial to the theory of quantum obfuscation.
The main contributions of our work are described as follows: 1. Definition of generalized quantum power functions.We define two different generalized quantum power functions, which we refer to as quantum power functions with leading coefficient and quantum n-th power functions, respectively.A quantum power function with a leading coefficient contains two parameters in the form of a quantum state.Quantum n-th power function contains both quantum and classical parameters.

2.
Construction of quantum obfuscation schemes for generalized quantum power functions.We construct different quantum circuits to obfuscate and interpret each function.
We utilize quantum teleportation for multiple qubits to obfuscate two quantum states simultaneously in a quantum power function with a leading coefficient.In addition, we utilize quantum teleportation and quantum superdense coding to obfuscate quantum and classical parameters in the quantum n-th power function.More generally, the parameter obfuscation method used in this work can be applied as a general method to obfuscate more quantum functions, therefore contributing to the progression of quantum obfuscation.

Quantum Function Obfuscation
Quantum obfuscation was first introduced by Alagic et al. [15], which is derived from classical obfuscation.The black-box quantum obfuscator was first defined and demonstrated more practicable than the classical black-box obfuscator.Definition 1.A black-box quantum obfuscator is a quantum algorithm O and a QPT interpreter δ such that whenever C is an n-qubit quantum circuit, the output of O is an m-qubit quantum state O(C) satisfying 1.
Polynomial expansion: The output quantum state O(C) with m-qubit remains polynomial scale satisfying m = poly(n). (1)

2.
Functional equivalence: For any possible quantum state ρ, there exists The obfuscated program has the same functionality as the original one.

3.
Virtual black box: For every QPT adversary A there exists a QPT quantum simulator Here, poly(n) means any polynomial of n and negl(n) means for all c ∈ R >0 , there exists n 0 ∈ Z >0 such that for all integers n > n 0 , we have The end user (and also any adversary A) should be in possession of a quantum computer, Most theoretical research on quantum obfuscation focuses on the obfuscation of quantum circuits.The definition of quantum obfuscation for quantum point functions was introduced by Chen et al. [16].They defined the quantum point function with a general output and constructed an obfuscation scheme for quantum point functions.Definition 2. A quantum point function U α,β with a general output is defined as where α ∈ {0, 1} n , β ∈ {0, 1} m \0 m and P α,β is a classical function expressed as Chen et al. demonstrated the obfuscatability of the quantum point function with a general output and proposed a specific quantum obfuscation scheme for the quantum point function.And they also proposed a quantum symmetric encryption scheme based on the quantum point function obfuscation.
However, there are still a few constructions of quantum obfuscation for different quantum functions.The definition of quantum power function was first introduced by Pan et al. [20].Quantum power function returns |1 when the exponent |a = |0 , and returns |x when the exponent |a = |1 .Definition 3. A quantum power function U α is defined as Here, a ∈ {0, 1} and P a is a function expressed as Pan et al. also proposed a method to construct a quantum obfuscator for quantum power function and proved its correctness.The property of the quantum power function can be extracted into the quantum state |a , which they named parameter states.They utilized quantum teleportation to obfuscate this parameter and provided some specific cryptographic quantum applications.
However, we note that the definition of quantum power function is so far a relatively rough one, and there are still many quantum functions to be defined that will benefit the theory of quantum obfuscation.

Quantum Techniques for Obfuscation
Pan et al. [20] first utilized quantum teleportation to construct the obfuscation scheme for quantum power functions.They demonstrated that quantum teleportation is universal to quantum nonlinear functions.The specific explanation is described as follows.
Theorem 1.Quantum obfuscation based on quantum teleportation is universal to quantum nonlinear functions whose parameter can be represented as a quantum state |a , which can be written as Consider the quantum power function as an example.We can transmit the parameter |a by quantum teleportation to obtain the obfuscated state O(|a ).The receiver obtains the collapsed state after the measurement and performs corresponding unitary operations to restore the parameter |a .The quantum power function is obfuscatable and satisfies all properties of quantum obfuscation through this universal obfuscation method.
Quantum teleportation is used to transfer an unknown quantum state to a distant place by utilizing entangled states.The circuit in Figure 1 gives an accurate description of quantum teleportation.The relationship between the measurement results, collapsed states, and corresponding unitary operation is listed in Table 1.
Quantum superdense coding is used to transfer several classical bits of information with a small number of qubits under the assumption of sender and receiver pre-sharing an entangled state.The circuit of quantum superdense coding is illustrated in Figure 2.
Circuit of quantum superdense coding for 2 classical bits message.
The relationship among classical bits, operation of Alice, resultant state, and decoded bits is listed in Table 2.

Generalized Quantum Power Functions with Coefficient
Quantum power functions are originally defined without coefficients and are restricted to quantum states.We provide a formal definition of two quantum power functions, referred to as generalized quantum power functions with coefficients.Each function is characterized by an exponent that corresponds to either a quantum or classical state, together with a leading coefficient.It is more straightforward to extend quantum power functions with a coefficient into other quantum functions.The first function, which combines the fundamental quantum power function with a leading coefficient in quantum states, is referred to as the quantum power function with a leading coefficient.The second function, which combines both quantum coefficient and classical exponent, is referred to as the quantum n-th power function.

Quantum Power Function with Leading Coefficient
According to the theory of quantum computing, classical functions can be mapped to quantum functions by means of quantum circuits.In previous research, quantum power function Π a is defined as Here, a ∈ {0, 1} and P a is a function defined as A classical polynomial function is a function that can be written as Each a i is a coefficient, and each product a i x i is an independent term in the form of a power function with a leading coefficient.To further the development of the quantum polynomial function, we define the quantum power function with a leading coefficient as where parameters |a and |b are quantum states, |a is the leading coefficient and |b is the exponent of quantum power function.Equation ( 13) explains the functionality of quantum power functions with a leading coefficient.
The relationship between quantum coefficient |a , quantum exponent |b , and the output |y is listed in Table 3.In quantum computing, the Bloch sphere is a geometrical representation of a universal qubit.The north and south poles of the Bloch sphere correspond to the computational basis vectors |0 and |1 .A universal qubit represented by the Bloch sphere can be written as where 0 ≤ θ ≤ π and 0 ≤ ϕ ≤ 2π, and it is shown in Figure 3.Each quantum state vector can also be written in R 3 as q = (sin θ cos ϕ, sin θ sin ϕ, cos θ).(15) RX, RY, and RZ gates are rotation operators, indicating the rotation of a qubit through angles α around each axis, and the associated transformation equations for these rotational gates are given by ) By combining these operations, qubits can rotate freely on the Bloch sphere.

Functionality of Quantum n-th Power Function
According to the classical n-th power function, the n-th power of a number x, when n is an integer, is the result of multiplying x to itself n times (x * x * x . . .* x).It can be written as x n .
Since every qubit can be expressed as (θ, ϕ), we consider |x 1 as the final state of rotating |0 by angles θ and ϕ around the Y and Z axes, respectively.According to Equation ( 19), quantum n-th power function can be described as the result of several rotations.
Equation ( 20) describes the functionality of quantum n-th power function.The transformation of |0 can be expressed as RZ(nϕ)RY(nθ)|0 , which means the nθ angle is rotated around the y-axis, followed by the nϕ angle around the z-axis when |a = |1 .|a is the leading coefficient in quantum n-th power functions.
The functionality of quantum n-th power functions can be visualized in Figure 4.

Quantum Obfuscation Schemes for Generalized Quantum Power Functions
We propose schemes for obfuscating generalized quantum power functions by quantum teleportation and enhanced quantum superdense coding.Quantum teleportation is used to obfuscate quantum parameters, while enhanced quantum superdense coding is used to obfuscate classical parameters.We construct specific quantum obfuscators to obfuscate each quantum generalized power function and quantum interpreters to restore their original functionality.To obfuscate two quantum states, we construct the obfuscator by quantum teleportation for multiple qubits [21].We can teleport the product states of two arbitrary particles independently.Consider the direct product of two quantum states is |Φ = |a ⊗ |b .The quantum circuit receives two particles as input, while |a = α|0 + β|1 and |b = γ|0 + δ|1 .Particles |a , |b , 1, 3 belong to the sender Alice, and particles 2, 4 belong to the receiver Bob.The circuit is shown in Figure 5. Alice measures particles (|a , 1) and (|b , 3) by Bell basis.The measurement result of Alice and the unitary operations corresponding to the result are shown in Table 4.
Thus, we can construct an obfuscator for quantum power functions with the leading coefficient by obfuscating the leading coefficient and the exponent.The obfuscation scheme is described as follows.
(1) Alice Input the leading coefficient |a , the exponent |b into the obfuscator.
(2) Alice measures the particles (|a , 1) and (|b , 3) by Bell basis and obtains the measurement result.(3) Alice sends the measurement result to Bob through a classical channel.(4) Bob performs corresponding unitary operations to restore the initial leading coefficient and the exponent of the function.

Construction of Quantum Interpreter
The original quantum circuits, which realize the functionality of quantum power functions with leading coefficients, are obfuscated into qubits through the obfuscator.Consequently, we should design a specific interpreter to explain the obfuscated quantum states and restore the original functionality.
The interpreter is intended to restore the functionality of quantum power functions with a leading coefficient.We can derive a logical expression among the output |y , the leading coefficient |a , the exponent |b and the input variable |x in Equation (21).
There are no corresponding quantum "AND" and quantum "OR" gates in quantum circuits, so we utilize Toffoli gates to implement quantum "AND" and quantum "OR" gates instead.The circuits are shown in Figure 6.
. Circuits of quantum "AND" and quantum "OR" gates.
Consequently, we can construct the interpreter by means of corresponding quantum gates to realize the functionality of quantum power functions with the leading coefficient according to the logical expression.Figure 7 shows the quantum circuit of the interpreter.Initially, receiver Bob performs quantum measurement on the obfuscated results to restore the leading coefficient |a and the exponent |b .Then, Bob puts the restored leading coefficient |a , the restored exponent |b , the base |x , and three auxiliary qubits |0 into the circuit.The detail of the interpreter is described as follows.
( Proof.To demonstrate the obfuscatability of quantum power functions with the leading coefficient, we prove the properties of polynomial expansion, functional equivalence, and virtual black-box property as follows. Assume that quantum power functions with the leading coefficient are denoted by |y = |a |x |b , the parameters extracted from it are denoted by C q (|a ⊗ |b ), which is another representation of the functionality.These parameters are transformed into the obfuscated states O(C q (|a ⊗ |b )) through the obfuscator.
Suppose the original circuit C is n-qubit, the obfuscated leading coefficient O(|a ) is m 1 -qubit and the obfuscated power O(|b ) is m 2 -qubit.Since all quantum gates contained in the obfuscator operate linearly, the size of m 1 and m 2 are certainly of polynomial size.Consequently, the total size of the output is m 1 + m 2 + n, which is also of polynomial size, satisfying the property of polynomial expansion.
The quantum power functions with the leading coefficient must satisfy the preservation of functionality by the interpreter.In our construction, the two obfuscated parameters can be restored by performing the corresponding unitary operations, which satisfies the property of functional equivalence.
Since the oracle is truly random to any adversary, the obfuscation O(C) leaks no information on the parameters.Thus, it satisfies the virtual black-box property.
Therefore, quantum power functions with the leading coefficient are obfuscatable.

Obfuscation Scheme for Quantum n-th Power Functions 4.2.1. Construction of Quantum Obfuscator
The parameters that need to be obfuscated for quantum n-th power functions include both classical and quantum states.Therefore, we utilize quantum teleportation, and enhanced quantum superdense coding [22] to obfuscate the quantum and classical states simultaneously.
Equation ( 20) explains the functionality of quantum n-th power functions, and Figure 8 shows the obfuscator for quantum n-th power functions, assuming the exponent n of the function contains two classical bits denoted by ij.This quantum circuit can be divided into two parts, used to obfuscate quantum parameters and classical parameters, respectively.To obfuscate the leading coefficient |a , we use quantum teleportation to obfuscate the qubit |a .Depending on different measurements, we perform corresponding unitary operations to restore the initial state according to Table 5.
The classical exponent n of quantum n-th power function is obfuscated by enhanced quantum superdense coding.First, Alice and Bob generate a pair of Bell states ) by means of the Hadamard and CNOT gates, each of which holds a qubit.To obfuscate the two-bit parameter n, Alice performs the corresponding operation listed in Table 6.Table 6.Obfuscation for two-bit exponent.

Classical Exponent
Operation States after Operation If the exponent of the quantum n-th power function is 11, then Alice performs Z 1 X 1 to obtain a specific entangled state.Equation ( 22) demonstrates the specific transformation of the entangled state |Φ + AB .
Then, Alice sends the transformed qubit to Bob over a quantum channel, and Bob obtains the whole entangled state.Bob performs the CNOT gate on the entangled state, where the received qubit is the control bit, and the qubit he originally owned is the target bit, then performs the Hadamard gate to the received qubit.The last step is to perform the measurement operation under the computational basis, which restores the exponent b of the quantum n-th power function.
If the exponent n contains multiple bits, it can be obfuscated by means of enhanced superdense coding.This is implemented by constructing the GHZ state, and the circuit for transmitting 4 bits is shown in Figure 9.
Quantum circuit of the enhanced superdense coding for 4 classical bits.
By means of this kind of structure, the number of classical bits to be teleported cannot be restricted anymore.This makes it possible to obfuscate any classical parameters.We split the quantum circuit into two parts to construct the obfuscator and interpreter for classical parameters in Figure 10.

Construction of Quantum Interpreter
The obfuscator has obfuscated the functionality of the quantum n-th power function, so we design an interpreter for the quantum n-th power function to restore the parameters and realize the original functionality.The circuit for interpreting the quantum n-th power function is shown in Figure 11.
According to the functionality of the quantum n-th power function, the parameters to be obfuscated are the hybrid state of quantum and classical states.Consequently, we construct a quantum circuit to implement the functionality.Initially, receiver Bob performs a quantum measurement on the obfuscated results to restore the leading coefficient |a and the exponent n.Then, Bob puts the restored leading coefficient |a , the base |x , and an auxiliary qubit |0 into the circuit.The classical exponent, b, is reflected in the rotation angle.
The detail of the interpreter is described as follows.
( Proof.To prove quantum n-th power functions are obfuscatable, we prove its polynomial expansion, functional equivalence, and virtual black-box property as follows. Assume that quantum n-th power functions with the leading coefficient are denoted by |y = |a |x n , the parameters extracted from it are denoted by C q (|a ⊗ n), which is another representation of the functionality.These parameters are transformed into the obfuscated states O(C q (|a ⊗ n)) through the obfuscator.
Suppose the original circuit C is n-qubit, the obfuscated leading coefficient O(|a ) is m 1 -qubit and the obfuscated power O(n) is m 2 -qubit.Since all quantum gates contained in the obfuscator operate linearly, the size of m 1 and m 2 are certainly of polynomial size.Consequently, the total size of the output is m 1 + m 2 + n, which is also of polynomial size, satisfying the property of polynomial expansion.
The quantum n-th power functions must satisfy the preservation of its original functionality by the interpreter.In our construction, the two obfuscated parameters can be restored by performing the corresponding unitary operation, which satisfies the property of functional equivalence.
Since the oracle is truly random to any adversary, the obfuscation O(C) leaks no information about the parameters.Thus, it satisfies the virtual black-box property.
Therefore, quantum n-th power functions are obfuscatable.

Impossibility and Possibility
Alagic et al. [23] proposed an impossibility result of quantum obfuscation of classical circuits under the assumption that learning-with-errors (LWE) is hard for quantum computers.Their work is based on the work of Barak [7], who demonstrated that a universal obfuscator that obfuscates classical circuits into other classical circuits is impossible.Alagic made a quantum generalization of this obfuscation and extended the impossible result of Barak to quantum settings, proving the impossibility of universal quantum black-box obfuscation.
Following the demonstration by Barak that a universal black-box obfuscation does not exist, two categories of research were established for classical obfuscation.The first objective is to develop and analyze the obfuscation strategy for particular functions; the second is to weaken the definition of black-box obfuscation.Similarly, Alagic et al. demonstrated the impossibility of universal virtual black-box obfuscation in quantum settings, but quantum obfuscation can still be achieved by particular obfuscation methods for specific functions or circuits.In 2023, Bartusek et al. [24] implemented a quantum obfuscation scheme for polynomial-sized pseudo-deterministic quantum circuits.In particular, this scheme can obfuscate the circuit implementing Shor's algorithm.This work provides a new method to achieve efficient quantum communication.Thus, the feasibility of quantum obfuscation as a tool for quantum software protection has remained wide open, and the obfuscation scheme proposed in our work for a specific generalized quantum power function with coefficient does not conflict with the impossibility result proposed by Alagic.

Obfuscation Circuits in a Noisy Channel
Quantum teleportation and quantum superdense coding are utilized in the construction of the obfuscator and the interpreter.Quantum teleportation requires a noiseless quantum channel to transmit a purely entangled state.However, in practice, the shared entanglement usually becomes degraded because of various decoherence mechanisms, and the noise and decoherence are unavoidable.When applying the proposed obfuscation circuits to realistic channels, we can implement the idealized quantum teleportation circuit and quantum superdense coding circuit through correspondingly improved protocols to enhance the fidelity of each protocol and overcome the effects of severe noise and loss.
There are several methods to overcome the impact of severe noise and loss.Zhao et al. [25] utilized a noiseless amplifier as a pre-device for quantum teleportation and achieved a high fidelity of 92% for teleporting coherent states, which also presented a new way of applying teleportation to purify quantum systems from thermal noise.Islam et al. [26] demonstrated that the decoherence noise can enhance the quantum correlation between two qubits and restore the entanglement lost in the environment, therefore improving the fidelity of quantum teleportation and the capacity of quantum superdense coding and contributing to efficient quantum communication.

Conclusions
In this paper, we have defined generalized quantum power functions with coefficients and applied quantum mechanics to construct circuits for quantum obfuscators and interpreters.Quantum and classical parameters are obfuscated by quantum teleportation for multiple qubits and enhanced quantum superdense coding, respectively.Also, we have constructed quantum interpreters to restore the functionality of generalized quantum power functions with coefficients.
In the construction of the obfuscation scheme for quantum power functions with leading coefficient, we utilized quantum teleportation for multiple qubits to obfuscate quantum parameters, summarized the logical expression, and utilized the Toffoli gate to realize the quantum "OR" gate and the quantum "AND" gate to construct the interpreter.In the construction of the obfuscation scheme for the quantum n-th power function, we utilized quantum teleportation and quantum-enhanced superdense coding to obfuscate both quantum and classical parameters, and we utilized rotational gates for constructing the interpreters to restore the functionality of quantum n-th power function.Furthermore, the obfuscatability of generalized quantum power functions with coefficients is demonstrated in this paper.
Other types of quantum functions, such as quantum polynomial functions and quantum composite functions, have not yet been defined, and corresponding obfuscation schemes have not yet been developed either.Also, it remains unexplored how to use the quantum circuit to restore the functionality of an obfuscated quantum function and how to build a simple and efficient quantum interpreter.

Figure 1 .
Figure 1. Circuit of quantum teleportation for a single qubit.

Figure 3 .
Figure 3.A universal qubit represented by the Bloch sphere.

Figure 4 .
Figure 4. Functionality of quantum n-th power function represented by the Bloch sphere.

4. 1 .
Obfuscation Scheme for Quantum Power Function with Leading Coefficient 4.1.1.Construction of Quantum Obfuscator Quantum power function with leading coefficient has the form |y = |a |x |b , where |a and |b are both quantum state.

Figure 5 .
Figure 5. Circuit of quantum teleportation for multiple qubits.

Figure 7 .
Figure 7. Interpreter of quantum power functions with leading coefficient.

Figure 8 .
Figure 8. Construction of the obfuscator for quantum n-th power functions.

Figure 10 .
Figure 10.Construction of the obfuscator and the interpreter for 4 classical bits: (a) Quantum circuit for obfuscating classical parameters.(b) Quantum circuit for restoring classical parameters.

Table 1 .
Relationship among measurement results collapsed states, and unitary operations.

Table 3 .
Relationship between the parameters and the output.

Table 4 .
Unitary operations corresponding to the measurement result of Alice.
1) Perform an X gate on the restored exponent |b , then we can obtain |¬b .(2) Perform a Toffoli gate on |a , |b , and the first auxiliary qubit |0 , in which |a and |b are control qubits and |0 is the target qubit.After this step, we obtain |a ∧ |¬b .(3) Perform a CNOT gate on |b and |x , in which |b is the control qubit and |x is the target qubit.After this step, we obtain ¬|b ⊕ |x .(4) Perform a Toffoli gate on |a ,|x and the second auxiliary qubit |0 , in which |a and |x are the control qubits and |0 is the target qubit.(5) Perform a quantum "OR" gate on |a ∧ |¬b and |a ∧ |¬b ⊕ x .Then we can obtain (|a ∧ |¬b ) ∨ (|a ∧ |¬b ⊕ x ) which satisfies the functionality of quantum power functions with leading coefficient.Theorem 2. Quantum power functions with leading coefficients are obfuscatable by quantum teleportation for multiple qubits.It satisfies all properties of quantum obfuscation.

Table 5 .
Unitary operation for specific measurement.