Color watermarking algorithm combining the quantum discrete cosine transform with the sinusoidal – tent map

To overcome the drawbacks of the existing sinusoidal map and tent map, this paper proposes the design of a sinusoidal – tent (ST) map. The test results indicate that the new chaotic system exhibits more signi ﬁ cant advantages in chaos control. Compared with the sinusoidal map and tent map, the proposed sinusoidal – tent map performs better in terms of bifurcation diagram and Lyapunov exponents. The trajectories of the sinusoidal – tent map can occupy all the phase planes over (0,4), while those of the two classic maps only occupy a small phase space, and the Lyapunov exponents of the ST map are all positive within the range of control parameters, higher than those of seed maps. Simultaneously, a novel quantum scrambling operation is devised based on the sinusoidal – tent map to avoid the periodicity of the quantum Arnold scrambling method. Initially, two chaotic sequences are generated to scramble the pixel positions of the watermark image, further enhancing the security of the watermarking algorithm. Subsequently, the host image is processed by the quantum discrete cosine transform, and ﬁ nally, the scrambled watermark image is inserted into the medium-frequency band of the transformed host image, ensuring the invisibility of the watermarking. According to the simulation results, the quantum watermarking algorithm has excellent invisibility and robustness.


Introduction
Information security is indeed a crucial field in the era of big data.Image information security is one of its significant branches that have witnessed rapid development over the past few decades [1][2][3][4][5].Particularly, benefiting from the entanglement characteristics and the powerful parallel computing abilities, quantum computing has the potential to overcome the limitations of classical computation.Quantum computing is a computational model that employs quantum bits, utilizing the principles of quantum mechanics to process information.Traditional computers use bits (0 or 1) as the smallest units for storage and processing, while quantum computers use quantum bits, often referred to as "qubits."Qubits can not only represent the states of 0 and 1 but also exist in superstitions of these states, a key aspect of quantum parallelism [6].
During signal transmission, the computing complexity of quantum operations has been effectively reduced, thereby significantly increasing information security through quantum computing.Beach et al. [7] highlighted and analyzed the doubts surrounding quantum image processing, demonstrating the true quantum superiority in quantum image classification and recognition.To improve the fault tolerance of quantum circuits, Li et al. [8] implemented cyclic and complete translations on quantum images through quantum arithmetic operations and realized the scalar matrix multiplication by designing faulttolerant circuits for these operations with the TR and Peres gates.The mid-point filter, which is an order statistic filter, cannot be directly used in the frequency domain.As a solution, Ali et al. [9] introduced a new quantum mid-point filter designed specifically for spatial domain applications.This proposed approach maintains the same level of noise suppression as the classical version but significantly reduces the complexity.
For different purposes, various representation models of quantum images have been investigated [10][11][12][13][14].The first flexible representation of the quantum image (FRQI) was invented to encode the position information and color information of an image into a single quantum state [10].A novel enhanced quantum representation (NEQR) was explored to quadratically speed up the preparation of quantum images and enhance the compression ratio of quantum images [11].The radiation energy value of a pixel in infrared images could be stored using the probability of projection measurement [12].A quantum scaling-up algorithm for images was proposed using nearest-neighbor interpolation [14].In addition, researchers have also developed several models for quantum color image representation, such as NCQI [15], MQIR [16], and DQRCI [17].
Digital watermarking is a technique that embeds specific information within digital media, with the aim of verifying or identifying the authenticity, ownership, or source of digital content.This technology is commonly used in digital media files such as images, audio, and videos [18].To address the security issue in copyright protection, various watermarking strategies have been explored [19,20].Gong et al. [19] proposed a watermarking scheme for double-color images, which involved the use of quaternion fractional-order orthogonal Fourier-Mellin moments and geometric correction.Different from classical watermarking algorithms, quantum watermarking algorithms (QWAs) combine principles of quantum computation theory and watermarking strategies [20,21].A quantum watermarking scheme was enhanced by utilizing the novel enhanced quantum representation (NEQR) along with a color scrambling technique and small-scale quantum circuits [22].In order to improve the visual quality and embedding capacity, Zeng et al. [23] proposed a quantum watermarking algorithm by combining the maximal pixel difference with the tent map.A self-recovery QWA was devised with block truncation coding to increase the key space and improve security [24].In 2021, Li et al. [25] proposed a quantum watermarking scheme for the quantum hue, saturation, and lightness (QHSL) image in the spatial domain.The scheme aimed to protect the integrity and ownership of QHSL images against various attacks.A QWA was presented with the quantum Fourier transformation [26].Similarly, a quantum image watermarking algorithm was investigated by the quantum Haar wavelet transform [27].The discrete cosine transform (DCT) is a Fourier-related transform similar to the discrete Fourier transform but using only real numbers [28].The utilization of DCT shifts an image from the time domain to the frequency domain, where most of the signal information is focused on the low-frequency bands situated in the upper-left corner.DCT is frequently employed for lossy compression, as seen in the JPEG compression of digital images and the MP3 compression of digital audio, owing to its robust energy compaction features.Simultaneously, DCT coefficients in the high-frequency bands, located in the lowerright corner, are nearly zero.Building upon the aforementioned characteristics of the DCT, Mohsen et al. [29] proposed a quantum watermarking algorithm for audio using the quantum discrete cosine transform (QDCT).This algorithm utilizes QDCT, a quantum counterpart of the classical DCT, to achieve enhanced information compression performance inherited from the DCT.Overall, the use of QDCT in audio watermarking offers advantages in terms of imperceptibility and robustness.However, it is important to conduct further research to evaluate the effectiveness and security of QDCT-based QWAs in practical applications and against more sophisticated attacks.
Quantum image scrambling techniques were invented for quantum watermarking due to the superiority of quantum computing models.The quantum Arnold transform is one of the common and available image scrambling methods [30].However, the risk from the periodicity of the Arnold transform is unavoidable, as attackers can restore the scrambled image with sufficient computing resources.In order to mitigate this risk, a new quantum image scrambling operation using the sinusoidal-tent map is proposed here.This map is a 1D chaotic map which is chosen due to its simple structure and easy implementation.The sinusoidal-tent map exhibits more significant advantages in spatiotemporal performance and chaotic characteristics compared to the sinusoidal map and tent map.Additionally, a quantum color watermarking algorithm is studied by integrating the QDCT with the sinusoidal-tent map, and a quantum network for the proposed quantum image watermark embedding is also devised.

Fundamental knowledge 2.1 NCQI model
The NCQI model storing a quantum color image | I〉 of size 2 n × 2 n was mathematically defined as Eq. 1 [15] |I〉 1 where | C(y, x)〉 denotes the color value of the associated pixel encoded by a binary sequence and is expressed as the following Eq. 2.
The grayscale value of each channel R, G, or B ranges from 0 to 2 q − 1.The NCQI model can store a color image in a normalized quantum superposition state.To represent a pixel, the color information | C(y, x)〉 and the vertical and horizontal positions | y〉 and | x〉 are involved.As for any 2 n by 2 n color image with channel R, G, or B ranging from 0 to 2 q − 1, there are 2n + 3q qubits involved to store it into an NCQI state.

Novel enhanced quantum representation
As a commonly used quantum representation of images, NEQR stores the gray information of each image pixel via the basis state of a qubit sequence, and it performs well because of its accuracy and flexibility.Assume that the gray value of an image pixel ranges from 0 to 2 q − 1 and yx is a binary sequence encoding the pixel value f(y, x), then Eq. 3 is obtained.
A q − qubit quantum image of size 2 n × 2 n could be written as Eq. 4.
A quantum binary image of size 2 × 2 can be written as Eq. 5.
where | 0〉 and | 1〉 represent black and white, respectively.The calculation of the absolute value (CAV) of two n-qubit sequences can be implemented by integrating the above RPS and CO modules [31].
To determine whether two input quantum sequences | A〉 and | B〉 are equal, a quantum equal (QE) module was designed by Zhou et al. [32].

Quantum discrete cosine transform
The quantum discrete cosine transform on a 2 n by 2 n image is defined mathematically as Eq. 6 and Eq. 7.
extracted from matrices U 2 n and V 2 n , respectively, where i 2 −1.
Figure 1 illustrates the whole QDCT quantum circuit.
3 Quantum color image watermarking scheme 3.1 Improved quantum module

Improved reversible half-subtractor
Figure 2 illustrates the quantum circuits and quantum modules of the proposed improved reversible half-subtractor (IRHS) according to [31].The IRHS module performs the halfsubtraction operation.| A ⊕ B〉 represents the difference between single qubits | A〉 and | B〉, and | AB〉 denotes the corresponding borrow bit.The quantum circuit of IRHS shown in Figure 2 saves one CNOT gate and one qubit compared with the RHS [31].The complexity of Controlled − V (Controlled − V † ) is 1, and that of the CNOT gate is also 1. Therefore, the complexities of the RHS and IRHS modules are 8 and 7, respectively.

Improved reversible full-subtractor
An improved reversible full-subtractor (IRFS) based on [31] is redesigned, as shown in Figure 3. Different from the quantum circuit

Improved reversible parallel subtractor
A reversible parallel subtractor (RPS) usually involves RHS and RFS [31], and thus the improved reversible parallel subtractor (IRPS) for q − qubit sequences can be implemented by combining IRHS and IRFS.As shown in Figure 4, the sequence | S〉 denotes the difference between sequence | X〉 and sequence | Y〉.Obviously, the complexities of the single q − qubit IRPS and RPS modules are 10q − 3 and 11q − 3, respectively.

Improved calculation of the absolute value
The quantum module CAV consists of RPS and CO [31].Figure 5 shows the proposed improved calculation of the absolute value (ICAV), which consists of CO and IRPS.A q − qubit CO module is composed of q + 1 CNOT gates, one Toffoli gate, and some m − CNOT operation gates.

Sinusoidal-tent map 3.2.1 Sinusoidal map
The sinusoidal map is a common one-dimensional chaotic map [33] and is defined as Eq. 9.
where x n ∈ (0, 1) and u is the control parameter within the range of u ∈(0, 4].The bifurcation and Lyapunov exponent plots of the sinusoidal map are shown in Figure 6A; Figure 7A, respectively.The Lyapunov exponents and bifurcation diagram serve as crucial Circuit of IRHS and its quantum module.
Circuit of IRFS and its quantum module.

FIGURE 4
Quantum circuit of IRPS and its quantum module.
Frontiers in Physics frontiersin.orgmetrics in discerning the chaotic characteristics of systems exhibiting chaos.In the case of a chaotic map, the onset of chaotic behaves when its Lyapunov exponents surpass zero.As illustrated in Figure 6A, the Lyapunov exponents of the sinusoidal map exceed 0 only under specific control parameters u ∈ [2.16, 2.32].Furthermore, as depicted in Figure 7A, the values of the chaotic sequence generated by the sinusoidal map are irregularly distributed within the chaotic range u ∈ [2.16, 2.32].These observations suggest that the sinusoidal map demonstrates suboptimal chaos behavior, imposing significant limitations on its practical applicability.

Tent map
The tent map is a one-dimensional piece-wise linear map [34] and is defined as Eq. 10.
where x n ∈ (0, 1) and v is the parameter within the range of (0, 4].The bifurcation and Lyapunov exponent plots of the tent map are shown in Figure 6B; Figure 7B, respectively.When v ∈ [2,4], the tent map is chaotic.Therefore, this mapping also shares the same issues as the sinusoidal mapping technique.

Sinusoidal-tent map
By combining the sinusoidal map with the tent map, a sinusoidal-tent map as the new chaotic map is designed as Eq.11.
where the parameter r ∈(0, 4] and x n is the output chaotic sequence.
Compared with the sinusoidal and tent maps, the designed sinusoidal-tent map performs better in terms of bifurcation Quantum module of ICAV.diagram and Lyapunov exponents.As shown in Figure 6, the bifurcation of ST is distributed across the entire data range of the plane.This distribution area is significantly larger than the outputs of the sinusoidal map and tent map.By observing Figure 7, it can be noted that the Lyapunov exponents of the ST map are all positive within the range of control parameters, indicating favorable chaotic characteristics.

Quantum scrambling with the sinusoidal-tent map
The Arnold scrambling method is insecure with sufficient computing resources owing to its periodicity.Therefore, we put forward a new irregular scrambling method.The scrambling on a yx 〉|yx〉 is as follows: (1) a and b are chosen as initial parameter values of the sinusoidal-tent map.
(2) The original image is then scrambled via the element values of | h * i 〉 and | l * i 〉, where | h * i 〉 and | l * i 〉 express the quantum states of sequences h * i |i 0, 1, . . ., j and l * i |i 0, 1, . . ., j , respectively.The quantum image position scrambling operation is denoted as S, and the 2 n × 2 n scrambled image | K S 〉 is represented as Eq.14. where

Watermark embedding procedure
During the watermark embedding process, the color image I is watermarked with a binary watermark W. Figure 9 shows the embedding procedure of the quantum color image watermarking algorithm, and the detailed embedding process is given below.
Step 1: The classical image I of size 2 n × 2 n is transformed into a quantum image | I〉 by the NCQI.
Step 2: With the initial parameter value a of the sinusoidal-tent map, one chaotic sequence x 1i |i 0, 1, . . ., j is produced using the sinusoidal-tent chaotic map.The chaotic sequence is changed to an integer sequence x 1i ′ |i 0, 1, . . ., j : According to Eq. 16, if x 1i ″ equals to 0, 1, or 2, then R, G, or B channel of the quantum image | I〉 is chosen to embed the watermarking image, i.e., | P〉.
Step 3: The original watermark W of size 2 n × 2 n is transformed into a quantum image | W〉 by the NEQR.Then, a scrambled quantum watermarked image | W′〉 is yielded by executing the quantum scrambling operation S on | W〉.The quantum scrambling circuit is shown in Figure 8.
Step 4: Image | P〉 is translated into the frequency domain by the QDCT operation.The energy of the QDCT coefficients is mainly congregated in the upper-left corner of the sub-block, which is the lowfrequency part of an image, and most of the remaining coefficients are very close to zero.Therefore, the medium-frequency part is a better area to embed the watermark compared with the low-frequency part.| P′〉 is an image transformed using the QDCT operation.
Step 5: The medium-frequency QDCT coefficients of every subblock are selected randomly and embedded with a quantum image | W′〉 multiplied by a coefficient k to obtain | P*〉 by Eq. 17: Step

Watermark extraction
The watermark image is extracted from a watermarked quantum color image with the help of the color host image and the keys to choose the embedded channel and scramble the watermark image.Step 2: The chaotic sequence x 1i |i 0, 1, . . ., j is generated by the sinusoidal-tent map with the same initial parameter a.According to Eq. 15 and Eq. 16, the random sequence x 1i is converted into the random integer sequence x 1i ″ .In the following, if x 1i ″ equals to 0, 1, or 2, the corresponding R, G, or B channel | P″〉 with a watermark image can be easily chosen from the final color image | I*〉.
Step 3: This step is only to perform QDCT on the watermarked image | P″〉 in order to recover the quantum image | P*〉.
Step 4 : | P′〉 can be obtained by performing the QDCT operation on image | P〉.According to the corresponding medium-frequency embedding position, the scrambled watermark image | W′〉 could be obtained as Eq.18.
Step 5: The sequences h * i |i 0, 1, . . ., j and l * i |i 0, 1, . . ., j are then generated using the sinusoidal-tent map controlled by the initial parameters a and b, respectively.By recalling | h i 〉 and | l * i 〉, the extracted watermark image | W〉 is acquired by executing the inverse scrambling operation S −1 shown in Eq. 19: Embedding procedure of the quantum watermarking algorithm.
Quantum watermark embedding network.
Extraction procedure of the quantum watermarking algorithm.
Frontiers in Physics frontiersin.org Step 6: After quantum measurement, the quantum watermark image | W〉 is eventually translated into a classical image.

Numerical simulation and discussion
The numerical simulations are carried out under the MATLAB R2017b platform on a classical PC.Ten host color images of size 512 × 512 taken for the test are shown in Figure 12.Two binary watermark images of sizes 128 × 128 and 64 × 64 are shown in Figure 13.The initial values a and b and the control parameter r of the sinusoidal-tent map are set to 0.325, 0.333, and 0.1, respectively, and the embedding coefficient k of the proposed color image QWA is set at 0.01.
The scrambling operation S is executed on the watermark image "Camera" and "Cat," and Figures 14A, B show the corresponding scrambled watermark images.As shown in Figure 14, the proposed scrambling operation has an acceptable scrambling performance.

Watermark evaluation exponents
The peak signal-to-noise ratio (PSNR) is expressed as Eq.20.
PSNR 20 lg where 2 n − 1 is the maximal image grayscale value, MSE 1 N e,r [I(e, r) − Z(e, r)] 2 is the mean-squared error between the host image I(e, r) and its associated watermarked image Z(e, r), and N is the number of pixels in an image.
where c 1 and c 2 are constants, σ and μ are the variance value and the mean value, respectively, and σ xy is the covariance value of x and y.Normalized cross-correlation (NCC) is another important exponent to assess the similarity of two images and is usually employed to measure the robustness of watermarking algorithms against different attacks, which is expressed as Eq.22.
NCC I, Z ( ) Here, M × N is the image size.I(x, y) and Z(x, y) represent the pixel values of images I and Z at the position (x, y), respectively.The NCC value is in the range of [−1, 1].The closer the NCC value is to 1, the more similar the two images are.

Imperceptibility analysis
Figures 15A-E show the watermarked color images with the watermark image "Camera," while Figures 15F-I show the watermarked images with the watermark image "Cat."By observing and comparing Figure 12; Figure 15, it can be observed that there is no significant difference between the watermarked image and the original host image.
The values listed in Table 1 represent the PSNR and SSIM for the watermark image with two different sizes.The PSNR is mainly used Watermarked image with "Camera": (A) "Boat," (B) "White house," (C) "Villa," (D) "Parrot," and (E) "Building."Watermarked image with "Cat": (F) "Hats," (G) "Motorbike," (H) "Flower," (I) "Yacht," and (J) "Beacon."Adapted with permission from [37], licensed by Eastman Kodak Company.for the evaluation and comparison of image and video compression algorithms and can help measure the impact of different compression algorithms on the quality of images or videos.The higher the value of the PSNR, the smaller the difference between two images, indicating higher quality.Generally, if the PSNR value is greater than 30 dB, it is hard to differentiate between the original host image and the watermarked image.If the PSNR value is greater than 40 dB, then the invisibility of the image watermark algorithm can be ensured.As for the watermark images "Camera" and "Cat," the average PSNR values of the host image and the watermarked image with the proposed QWA are 46.76 dB and 52.60 dB, respectively.It indicates that the quality of the watermarked image and the corresponding original host image are very close.
In addition, the SSIM values of the host image and the watermarked one approach 1.The SSIM value ranges from 0 to 1, where 1 indicates that the two images are identical and 0 indicates that the two images are completely different.A higher SSIM value indicates that the two images are more similar.Therefore, the proposed color image watermark algorithm has good invisibility.In image processing, histograms are valuable tools for analyzing various image features, such as contrast, brightness, and color distribution.By comparing histograms of different images, we can determine their similarities or differences.For instance, if the histograms of two images are closely matched, it suggests that they may have comparable color distributions, indicating their similarity.In Figure 16, the histogram of the watermarked image is similar to the histogram of the original carrier image.This implies that the pixel intensity distributions of the two images may be similar.This can be considered evidence that the watermark image has been successfully embedded into the original carrier image without significantly altering the pixel distribution characteristics of the images.Figures 16A-C show the histograms of three selected host images: "Boat," "Villa," and "Hats," respectively.Figures 16D-F show the histograms of the associated watermarked images.In Figure 16, the histogram of the watermarked image closely resembles that of the original carrier images.This similarity implies that the pixel intensity distributions of the two images may be comparable.Thus, this similarity serves as evidence that the watermark image has been successfully embedded into the original carrier image without significantly altering its pixel distribution characteristics.

Robustness analysis
The image "Cat" of size 64 × 64 and image "Boat" of size 512 × 512 are treated as the watermark image and host image, respectively.As shown in Figure 17, there are no significant difference between the watermarked image and the original host image and no significant distinction between the extracted watermark image and the original watermark image.Noise attack, JPEG compression attack, and filtering attack are used to test the robustness of this algorithm.

Noise attack
Noise attack is a common method used to test the robustness of algorithms against the addition of noise in images.By conducting noise attack tests, the robustness of image processing algorithms against different intensities and types of noise can be evaluated.Salt-and-pepper noise with densities of 0.01, 0.03, and 0.05 was added to the watermarked image "Boat."The watermarked images, along with the corresponding extracted watermark images containing the respective noises, are shown in Figure 18.The (A-C) Histograms of host images "Boat," "Villa," and "Hats," respectively; (D-F) histograms of the corresponding watermarked host images.
Frontiers in Physics frontiersin.org10 NCC values of the extracted watermark images with the added noises are shown in Table 2. From Table 2, it can be observed that the proposed QWA performs well in terms of withstanding noise attacks.

JPEG compression attack
A JPEG compression attack refers to applying different intensities of JPEG compression to an image with an embedded watermark and evaluating the watermark extraction effectiveness in the compressed image.The experimental results of JPEG compression attacks are shown in Table 3. Quality factor parameters used for JPEG compression in the experiment are set to 90, 70, and 50, respectively.Figure 19 shows the watermarked images subjected to different intensities of JPEG compression attacks, along with the corresponding extracted watermark images.Notably, even when the quality factor parameter was set to 50, the extracted watermark images remained complete and clear, with all corresponding NCC values exceeding 0.98.As a result, the presented quantum color image watermarking algorithm demonstrates resistance against JPEG compression attacks.Test result of salt-and-pepper noise attack (intensity 0.05).Adapted with permission from [37], licensed by Eastman Kodak Company.

Filtering attack
A filtering attack refers to a type of cyber-attack in which an attacker tries to block or filter out certain information or content from reaching its intended recipient.The median filtering with a filtering window 3 × 3 is exploited to interfere with the watermarked image.Table 4 shows the watermark images extracted from the host images under filtering attack and the corresponding NCC values.The NCC values corresponding to the extracted watermark image are all above 0.99.As a result, the proposed color image QWA can resist filtering attacks.

Comparative analysis
The imperceptibility of the proposed QWA compared with other typical algorithms [21,35,36] is shown in Tables 5, 6. Notably, the QWA exhibits superior performance with PSNR and SSIM values when compared to the algorithms referenced in [21,35,36].This enhancement in imperceptibility within the proposed algorithm is attributed to the strategic embedding of the watermark into the medium-frequency component of the transformed host image.By focusing on this frequency range, the QWA achieves a balance between robust watermark insertion and minimizing perceptual impact, thereby ensuring an improved level of invisibility compared to the referenced algorithms.The utilization of the medium-frequency component allows the proposed QWA to maintain the visual quality of the watermarked image while successfully concealing the embedded information.

Quantum circuit complexity analysis
The complexity of our proposed color image QWA is mainly related to the quantum scrambling operation and the QDCT.The presented quantum scrambling operation can be realized with two ICAV modules, one QE module, two PA modules, and two PS-MOD Result of JPEG compression attack (QF = 50).Adapted with permission from [37], licensed by Eastman Kodak Company.modules.For an image of size 2 q × 2 q , the complexity of a q − qubit ICAV module is 12q 2 − 45q + 28.The QE module involves 2q CNOT gates and a q − CNOT gate, so its complexity is 6q − 8.The complexity of PA and PS-MOD is O(q).Apparently, the complexity of the scrambling operation is O(q 2 ).For an image of size 2 n × 2 n , the computing complexity of the QDCT is O(2 n ).To sum up, the complexity of the proposed color image QWA is O(2 n ).
5 Conclusion and future challenges and directions

Conclusion
A one-dimensional chaotic map, i.e., a sinusoidal-tent map, is devised by combining the sinusoidal map with the tent map.Depending on the random sequence generated using the sinusoidal-tent map, a new position scrambling operation on a quantum image together with the associated quantum circuit is devised.The original quantum circuits of some existing quantum modules are improved to reduce their complexities.The security of QWA is enhanced by using the sinusoidal-tent map to scramble the watermark image.After the quantum discrete cosine transform, most of the signal energy is concentrated on the low-frequency part; thus, choosing the medium-frequency component to embed watermark can enhance the invisibility and robustness of the algorithm.The experimental results illustrate that the QWA has good invisibility and high robustness against noise attack, JPEG compression attack, and filtering attack.

Potential future challenges and directions
Currently, the quantum watermark technology is generally implemented by simulating quantum theory on classical computers, and there are no well-developed quantum devices available for testing.Therefore, future challenges lie in continuously adjusting the direction of quantum watermark algorithms to cater to the development of quantum computers.This will require proposing algorithms that are better suited for quantum computer applications.Therefore, the future research directions for quantum watermarking will focus on algorithm development, physical implementation, robustness analysis, and application expansion.By exploring these areas, we can create more opportunities and face new challenges in protecting digital content, enhancing information security, and advancing quantum technology.
n ) and |*| represents the absolute value operation.The quantum module of this scrambling operation is shown in Figure 8.

6 :
After executing the inverse QDCT on | P*〉 to obtain | P″〉, the final color image | I*〉 inserted with a secret message can be yielded from the reconstructed | P″〉 and other channels.A quantum watermark embedding network is shown in Figure 10, where |Y〉 |y n−1 y n−2 ...y 0 〉 and |X〉 |x n−1 x n−2 ...x 0 〉.E(k) denotes the scrambled quantum watermarked image | W′〉 multiplied by the watermark embedding coefficient k.

FIGURE 8 Step 1 :
FIGURE 8Circuit of the quantum scrambling operation.

TABLE 1
PSNR and SSIM values with the proposed QWA.

TABLE 2
Test results of salt-and-pepper noise attack.

TABLE 3
Test results of JPEG compression attack.

TABLE 4
Test results of filtering attack.

TABLE 5
PSNR values calculated using the proposed scheme and previous works.

TABLE 6
SSIM values calculated using the proposed scheme and previous works.