Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Engineering Trends and Technology

Quantum Clustering Algorithm using the Wheel of Tomography

Shradha Deshmukh, Preeti Mulay

Published May 25, 2022• 2 citations
Publisher
DOI
10.14445/22315381/ijett-v70i5p214

Related papers

Reinventing Akaike?s Wheel: model selection for quantum tomography.

Robin Blume-Kohout

•Jun 1, 2015•0 citations

Quantum Clustering

Davide Pastorello

Machine learning•Dec 16, 2022•1 citation

Clustering Algorithm for Predicting Quantum States in a Quantum Computer

Feng Qian

Quantum state tomography refers to the process of estimating the density matrix of an unknown system after obtaining data through a series of quantum measurements. Quantum state tomography can be divided into two processes: quantum measurement and reconstruction algorithm. From these two processes, different schemes can be designed, and they also have their own advantages and disadvantages. At the same time, quantum tomography is mainly concerned with two factors: estimation accuracy and complexity. High-precision quantum tomography is a necessary condition for quantum computing and other quantum technologies, and the scarcity of quantum resources forces us to find more effective methods to reduce estimation errors. The complexity problem of quantum tomography grows with the dimensionality of the quantum system. I simulate the behavior of a linear optics quantum computing circuit that performs the quantum Fourier transform. We investigated the possibility of using k-means clustering algorithm to predict the output of the quantum computer and compare its performance with the conditional generative adversarial network (CGAN), shadow tomography, maximum likelihood estimation. Using this simulated data, I apply the various algorithms to the order-finding problem to determine the trade-off between the required number of measurements and the accuracy. The result shows that k-means clustering can take a polynomial number of samples to access the result of the order-finding problem with more than 90 percent accuracy. The comparison of all four methods is analyzed.

•May 1, 2021•0 citations

Clustering Structure and Quantum Computing

Péter Wittek

Elsevier eBooks•Jan 1, 2014•6 citations

Quantum tomography

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

•Jan 1, 2025•0 citations

An Ideal Random Number Generator Based on Quantum Fluctuations and Rotating Wheel for Secure Image Encryption

Subhadip Rana, Sanku Paul, Mrinal Kanti Mandal

In the era of digitization secure transmission of digital images has become essential in real world applications. Image encryption is an effective technique for protecting image data from unauthorized access. The security of encrypted data strongly depends on the quality of the random numbers used as the encryption key. In this paper, we proposed a hybrid random number generator based on quantum fluctuations and an algorithmically inspired rotating wheel. The wheel contains integer values from 0 to 255 that are shuffled using quantum fluctuations generated by time-evolving the quantum kicked rotor model. There are four pre-defined tapping positions in the rotating wheel to collect the number sequences. The wheel rotation speed is dynamically varied after each set of tapping to enhance unpredictability. The entropy of the number sequence obtained from the rotating wheel attains the ideal value of 8 (in an 8 bit representation). Further, the generated number sequences exhibit a flat histogram and nearly zero correlation, indicating strong randomness. The generated sequences are applied to the image encryption and analyzed cryptographically. Experimental results demonstrate a near ideal entropy of 7.997, an NPCR of 99.60%, low correlation in all directions, and low PSNR for encrypted images. These results confirm that the proposed random number generator achieves efficient and high-security performance, making it suitable for the security of consumer applications such as mobile healthcare imaging, biometric authentication, QR-based and multimedia communication on smart devices.

cs.CRCross-listedarXiv:2603.13472•Mar 17, 2026
Quantum state tomography refers to the process of estimating the density matrix of an unknown system after obtaining data through a series of quantum measurements. Quantum state tomography can be divided into two processes: quantum measurement and reconstruction algorithm. From these two processes, different schemes can be designed, and they also have their own advantages and disadvantages. At the same time, quantum tomography is mainly concerned with two factors: estimation accuracy and complexity. High-precision quantum tomography is a necessary condition for quantum computing and other quantum technologies, and the scarcity of quantum resources forces us to find more effective methods to reduce estimation errors. The complexity problem of quantum tomography grows with the dimensionality of the quantum system. I simulate the behavior of a linear optics quantum computing circuit that performs the quantum Fourier transform. We investigated the possibility of using k-means clustering algorithm to predict the output of the quantum computer and compare its performance with the conditional generative adversarial network (CGAN), shadow tomography, maximum likelihood estimation. Using this simulated data, I apply the various algorithms to the order-finding problem to determine the trade-off between the required number of measurements and the accuracy. The result shows that k-means clustering can take a polynomial number of samples to access the result of the order-finding problem with more than 90 percent accuracy. The comparison of all four methods is analyzed.
In the era of digitization secure transmission of digital images has become essential in real world applications. Image encryption is an effective technique for protecting image data from unauthorized access. The security of encrypted data strongly depends on the quality of the random numbers used as the encryption key. In this paper, we proposed a hybrid random number generator based on quantum fluctuations and an algorithmically inspired rotating wheel. The wheel contains integer values from 0 to 255 that are shuffled using quantum fluctuations generated by time-evolving the quantum kicked rotor model. There are four pre-defined tapping positions in the rotating wheel to collect the number sequences. The wheel rotation speed is dynamically varied after each set of tapping to enhance unpredictability. The entropy of the number sequence obtained from the rotating wheel attains the ideal value of 8 (in an 8 bit representation). Further, the generated number sequences exhibit a flat histogram and nearly zero correlation, indicating strong randomness. The generated sequences are applied to the image encryption and analyzed cryptographically. Experimental results demonstrate a near ideal entropy of 7.997, an NPCR of 99.60%, low correlation in all directions, and low PSNR for encrypted images. These results confirm that the proposed random number generator achieves efficient and high-security performance, making it suitable for the security of consumer applications such as mobile healthcare imaging, biometric authentication, QR-based and multimedia communication on smart devices.