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

Quantum Computing Using Chaotic Numbers

Usama Shamsuddin Thakur

Published May 11, 2022• 0 citations
Publisher

Abstract

Abstract Quantum Mechanics and Computation has a major problem calledthe measurement problem [7] [19]. This has given physicists a very hardtime over the years when I first looked into the problem my approach wassimple find a new number system that can go with the uncertainty of aQuantum particle the paper deals with the mathematics of uncertaintywhich has solved 2 millenium prize problems [4], [5] and quantum measurementproblem very efficiently. We divide chaos into two parts lowchaos and high chaos then we find the desired value [19] inside the intersectionof both. This helps us find something in a ℵ3 >>> ∞ this takesthe problems around us to the next level if we are able to control a chaosthen we can achieve pretty much anything. This paper is inspired by [22]

DOI
10.21203/rs.3.rs-1636992/v2

Related papers

Quantum Computing Using Chaotic Numbers

Quantum Mechanics and Computation has a major problem calledthe measurement problem [7, 19]. This has given physicists a very hardtime over the years when I first looked into the problem my approach wassimple find a new number system that can go with the uncertainty of aQuantum particle the paper deals with the mathematics of uncertaintywhich has solved 2 millenium prize problemsand quantum measurementproblem very efficiently[4, 5]. We divide chaos into two parts lowchaos and high chaos then we find the desired value inside the intersectionof both[19]. This helps us find something in a 3 >>>∞ this takesthe problems around us to the next level if we are able to control a chaosthen we can achieve pretty muchanything[22]. This paper is inspired by .

Journal of Robotics and Automation Research•May 30, 2022•1 citation

Quantum Computing Error Correction Solved Using Chaotic Numbers

Usama Shamsuddin Thakur

Abstract Quantum Mechanics and Computation has a major problem calledthe measurement problem [7] [19]. This has given physicists a very hardtime over the years when I first looked into the problem my approach wassimple find a new number system that can go with the uncertainty of aQuantum particle the paper deals with the mathematics of uncertaintywhich has solved 2 millenium prize problems [4], [5] and quantum measurementproblem very efficiently. We divide chaos into two parts lowchaos and high chaos then we find the desired value [19] inside the intersectionof both. This helps us find something in a ℵ3 >>> ∞ this takesthe problems around us to the next level if we are able to control a chaosthen we can achieve pretty much anything. This paper is inspired by [22]

•Nov 17, 2022•0 citations

Quantum Computing Using Chaotic Numbers

Usama Shamsuddin Thakur

Quantum Mechanics and Computation has a major problem called the measurement problem. This has given physicists a very hard time over the years when I first looked into the problem my approach was simple find a new number system that can go with the uncertainty of a Quantum particle the paper deals with the mathematics of uncertainty which has solved 2 millenium prize problems and quantum mea- surement problem very efficiently. We divide chaos into two parts low chaos and high chaos then we find the desired value inside the inter- section of both. This helps us find something in a ℵ3 >>> ∞ this takes the problems around us to the next level if we are able to control a chaos then we can achieve pretty much anything.

•May 10, 2022•5 citations

Mathematics Of Uncertainty For Quantum Computing

Usama Shamsuddin Thakur

Abstract Quantum Mechanics and Computation has a major problem called the measurement problem. This has given physicists a very hard time over the years when I first looked into the problem my approach was simple find a new number system that can go with the uncertainty of a Quantum particle the paper deals with the mathematics of uncertainty which has solved 2 millenium prize problems [4], [5] and quantum mea- surement problem very efficiently. We divide chaos into two parts low chaos and high chaos then we find the desired value [18] inside the inter- section of both. This helps us find something in a ℵ3 >>> ∞ this takes the problems around us to the next level if we are able to control a chaos then we can achieve pretty much anything.

•May 10, 2022•0 citations

Randomness

Scott Aaronson

In the last two chapters, we talked about computational complexity up till the early 1970s. Here, we'll add a new ingredient to our already simmering stew – something that was thrown in around the mid-1970s, and that now pervades complexity to such an extent that it's hard to imagine doing anything without it. This new ingredient is randomness . Certainly, if you want to study quantum computing, then you first have to understand randomized computing. I mean, quantum amplitudes only become interesting when they exhibit some behavior that classical probabilities don't : contextuality, interference, entanglement (as opposed to correlation), etc. So we can't even begin to discuss quantum mechanics without first knowing what it is that we're comparing against. Alright, so what is randomness? Well, that’s a profound philosophical question, but I’m a simpleminded person. So, you’ve got some probability p , which is a real number in the unit interval [0, 1]. That’s randomness. But wasn’t it a big achievement when Kolmogorov put probability on an axiomatic basis in the 1930s? Yes, it was! But in this chapter, we’ll only care about probability distributions over finitely many events, so all the subtle questions of integrability, measurability, and so on won’t arise. In my view, probability theory is yet another example where mathematicians immediately go to infinite-dimensional spaces, in order to solve the problem of having a nontrivial problem to solve! And that’s fine – whatever floats your boat. I’m not criticizing that. But in theoretical computer science, we’ve already got our hands full with 2n choices. We need 2ℵ0 choices like we need a hole in the head.

Cambridge University Press eBooks•Mar 14, 2013•0 citations

Quantum computing

Harry Paul

Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.

Cambridge University Press eBooks•Jun 5, 2008•0 citations
Abstract Quantum Mechanics and Computation has a major problem calledthe measurement problem [7] [19]. This has given physicists a very hardtime over the years when I first looked into the problem my approach wassimple find a new number system that can go with the uncertainty of aQuantum particle the paper deals with the mathematics of uncertaintywhich has solved 2 millenium prize problems [4], [5] and quantum measurementproblem very efficiently. We divide chaos into two parts lowchaos and high chaos then we find the desired value [19] inside the intersectionof both. This helps us find something in a ℵ3 >>> ∞ this takesthe problems around us to the next level if we are able to control a chaosthen we can achieve pretty much anything. This paper is inspired by [22]
Quantum Mechanics and Computation has a major problem calledthe measurement problem [7, 19]. This has given physicists a very hardtime over the years when I first looked into the problem my approach wassimple find a new number system that can go with the uncertainty of aQuantum particle the paper deals with the mathematics of uncertaintywhich has solved 2 millenium prize problemsand quantum measurementproblem very efficiently[4, 5]. We divide chaos into two parts lowchaos and high chaos then we find the desired value inside the intersectionof both[19]. This helps us find something in a 3 >>>∞ this takesthe problems around us to the next level if we are able to control a chaosthen we can achieve pretty muchanything[22]. This paper is inspired by .
Abstract Quantum Mechanics and Computation has a major problem calledthe measurement problem [7] [19]. This has given physicists a very hardtime over the years when I first looked into the problem my approach wassimple find a new number system that can go with the uncertainty of aQuantum particle the paper deals with the mathematics of uncertaintywhich has solved 2 millenium prize problems [4], [5] and quantum measurementproblem very efficiently. We divide chaos into two parts lowchaos and high chaos then we find the desired value [19] inside the intersectionof both. This helps us find something in a ℵ3 >>> ∞ this takesthe problems around us to the next level if we are able to control a chaosthen we can achieve pretty much anything. This paper is inspired by [22]
Quantum Mechanics and Computation has a major problem called the measurement problem. This has given physicists a very hard time over the years when I first looked into the problem my approach was simple find a new number system that can go with the uncertainty of a Quantum particle the paper deals with the mathematics of uncertainty which has solved 2 millenium prize problems and quantum mea- surement problem very efficiently. We divide chaos into two parts low chaos and high chaos then we find the desired value inside the inter- section of both. This helps us find something in a ℵ3 >>> ∞ this takes the problems around us to the next level if we are able to control a chaos then we can achieve pretty much anything.
Abstract Quantum Mechanics and Computation has a major problem called the measurement problem. This has given physicists a very hard time over the years when I first looked into the problem my approach was simple find a new number system that can go with the uncertainty of a Quantum particle the paper deals with the mathematics of uncertainty which has solved 2 millenium prize problems [4], [5] and quantum mea- surement problem very efficiently. We divide chaos into two parts low chaos and high chaos then we find the desired value [18] inside the inter- section of both. This helps us find something in a ℵ3 >>> ∞ this takes the problems around us to the next level if we are able to control a chaos then we can achieve pretty much anything.
In the last two chapters, we talked about computational complexity up till the early 1970s. Here, we'll add a new ingredient to our already simmering stew – something that was thrown in around the mid-1970s, and that now pervades complexity to such an extent that it's hard to imagine doing anything without it. This new ingredient is randomness . Certainly, if you want to study quantum computing, then you first have to understand randomized computing. I mean, quantum amplitudes only become interesting when they exhibit some behavior that classical probabilities don't : contextuality, interference, entanglement (as opposed to correlation), etc. So we can't even begin to discuss quantum mechanics without first knowing what it is that we're comparing against. Alright, so what is randomness? Well, that’s a profound philosophical question, but I’m a simpleminded person. So, you’ve got some probability p , which is a real number in the unit interval [0, 1]. That’s randomness. But wasn’t it a big achievement when Kolmogorov put probability on an axiomatic basis in the 1930s? Yes, it was! But in this chapter, we’ll only care about probability distributions over finitely many events, so all the subtle questions of integrability, measurability, and so on won’t arise. In my view, probability theory is yet another example where mathematicians immediately go to infinite-dimensional spaces, in order to solve the problem of having a nontrivial problem to solve! And that’s fine – whatever floats your boat. I’m not criticizing that. But in theoretical computer science, we’ve already got our hands full with 2n choices. We need 2ℵ0 choices like we need a hole in the head.
Why quantum computing? As we all know very well, conventional (electronic) computers have enormous power which, moreover, is constantly increasing. With their help gigantic quantities of data can be handled and evaluated. This is of crucial importance, for instance, in modern high energy physics experiments. On the other hand, computers can be used to model very complex systems with the aim of predicting, for example, future developments in our environment, notably climatic changes. Thanks to their incredible speed computers are, of course, destined to treat mathematical problems for which specific algorithms exist very efficiently. To mention a simple example, the digits of π are readily evaluated up to a very high order. Last, but not least, their potential to solve differential equations numerically, even when they are nonlinear, makes computers indispensable in modern research. So, one might ask, is there any reason to look for fundamentally new ways of computing as they are seemingly offered by quantum processes? What advantages can be expected when the laws of quantum mechanics, rather than those of classical physics, are exploited for computation? Two answers were given: first, the simulation of complex quantum systems on classical computers meets serious difficulties that might be overcome with the help of quantum computers. This idea was suggested in 1982 by R. Feynman, and in the 1990s it was indeed shown by several groups of researchers that quantum mechanical systems for which no efficient simulation on a classical computer is known can be efficiently simulated on a quantum computer.