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

Analysis of Quantum Computers and Randomness

Deepak Chahal, Preethi Ravichandran Kumar

Published Apr 21, 2020• 0 citations
OpenAlex

Related papers

Detecting Temporal Correlation via Quantum Random Number Generation

Yutaka Shikano, Kentaro Tamura, Rudy Raymond

All computing devices, including quantum computers, must exhibit that for a given input, an output is produced in accordance with the program. The outputs generated by quantum computers that fulfill these requirements are not temporally correlated, however. In a quantum-computing device comprising solid-state qubits such as superconducting qubits, any operation to rest the qubits to their initial state faces a practical problem. We applied a statistical analysis to a collection of random numbers output from a 20-qubit superconducting-qubit cloud quantum computer using the simplest random number generation scheme. The analysis indicates temporal correlation in the output of some sequences obtained from the 20 qubits. This temporal correlation is not related to the relaxation time of each qubit. We conclude that the correlation could be a result of a systematic error.

arXiv:2004.01330•Electronic Proceedings in Theoretical Computer Science•Apr 1, 2020•6 citations

Introduction to Quantum Randomness

WORLD SCIENTIFIC eBooks•May 1, 2003•0 citations

A Leap from Randomized to Quantum Clustering with Support Vector Machine - A Computation Complexity Analysis

Arit Kumar Bishwas, Ashish Mani, Vasile Palade

Supervised machine learning deals with developing complex non-linear models, which can be used later to predict the output for a known input. Clustering is usually treated as an unsupervised machine learning task, but we can formulate a solution to a clustering problem by using a supervised classification algorithm [1]. However, these classification algorithms are highly computationally intensive in nature, so the overall complexity in designing a clustering solution is often very costly from an implementation point of view. The more data we use, the more computational power is required too. Recent advancements in quantum computing show promising advantages in dealing with this kind of computational issues we face while training a complex machine-learning algorithm. In this paper, we do a theoretical investigation on the runtime complexity of algorithms, from classical to randomized, and then to quantum frameworks, when designing a clustering algorithm. The analysis shows significant computational advantages with a quantum framework as compared to the classical and randomized versions of the implementation.

International Conference for Emerging Technology (INCET)•Jun 1, 2020•0 citations

Quantum Randomness: From Practice to Theory and Back

Cristian S. Calude

Theory and applications of computability•Jan 1, 2017•15 citations

Solving Random Satisfiability Problems with Quantum Computers

Tad Hogg

Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including those near a phase transition associated with a high concentration of hard cases. Based on empirical evaluation for small problems, modifying the algorithm in light of this analysis improves its performance. The algorithm improves on both GSAT, a commonly used conventional heuristic, and quantum algorithms ignoring problem structure.

arXiv:quant-ph/0104048•Apr 9, 2001•5 citations

ON QUANTUM RANDOMNESS

WORLD SCIENTIFIC eBooks•Apr 1, 1998•0 citations
All computing devices, including quantum computers, must exhibit that for a given input, an output is produced in accordance with the program. The outputs generated by quantum computers that fulfill these requirements are not temporally correlated, however. In a quantum-computing device comprising solid-state qubits such as superconducting qubits, any operation to rest the qubits to their initial state faces a practical problem. We applied a statistical analysis to a collection of random numbers output from a 20-qubit superconducting-qubit cloud quantum computer using the simplest random number generation scheme. The analysis indicates temporal correlation in the output of some sequences obtained from the 20 qubits. This temporal correlation is not related to the relaxation time of each qubit. We conclude that the correlation could be a result of a systematic error.
Supervised machine learning deals with developing complex non-linear models, which can be used later to predict the output for a known input. Clustering is usually treated as an unsupervised machine learning task, but we can formulate a solution to a clustering problem by using a supervised classification algorithm [1]. However, these classification algorithms are highly computationally intensive in nature, so the overall complexity in designing a clustering solution is often very costly from an implementation point of view. The more data we use, the more computational power is required too. Recent advancements in quantum computing show promising advantages in dealing with this kind of computational issues we face while training a complex machine-learning algorithm. In this paper, we do a theoretical investigation on the runtime complexity of algorithms, from classical to randomized, and then to quantum frameworks, when designing a clustering algorithm. The analysis shows significant computational advantages with a quantum framework as compared to the classical and randomized versions of the implementation.
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including those near a phase transition associated with a high concentration of hard cases. Based on empirical evaluation for small problems, modifying the algorithm in light of this analysis improves its performance. The algorithm improves on both GSAT, a commonly used conventional heuristic, and quantum algorithms ignoring problem structure.