Quantum Computing
From Quantum Foam · · 30 min
This plays from the publisher's own server. We do not host a copy.
Description
Here is the thirtieth episode of Quantum Foam, Quantum Computing. This is the third section of 10 of the podcast. The ability to Quantum Compute will crack all current encryption. This won't crack all encryption forever, though. IBM and Google currently have Quantum Computers. There will likely be updated versions and others with the same technology soon enough. We are using the prevailing logic for Quantum Computing using probability vectors and density operators. The different states can be written using different types of math. Nobody gets this stuff. This stuff isn't meant to be hidden anymore. The standard Cartesian coordinate system is to be assumed for creating point matrices with infinitely many factorization complex numbers. We will be working with computer binary systems. We can use 3 different options or 4 different options for our fundamental parameters. That is for when we are actually programming a Quantum Computer. You have a 1 on the left, an x in the middle, and a 0 on the right. This is a way you can visualize the different parameters. Great attention is taken when describing the qubit that is both an on and an off or an off and an on. There needs to be a tendency to land exactly 50 percent between the value of 1 and the value of 0 built into the programming. There are specific directions of subsets of programming that are important. Then, qubit measurements are done. There are other types of Quantum Computing. There is Adiabatic Quantum Computing. Next, there is one called a Universal Quantum Computer. In other words, A Turing Machine. There are others such as Quantum Circuit Models that use n-bit registers. Quantum Computing is concerned with entanglement and integer superpositions. Quantum Computing will most likely be an extension of the silicon computers that we have now. Silicon isn't going away any time soon. We are able to potentially program microchips that enable the possibility of Faster-than-light Communication. We can currently manipulate both particles and antiparticles on our silicon devices.
We can use different mathematics when describing our physics. We can use a Hilbert Space and set it to a complex inner product space that is complete. This is used in Quantum Mechanics to describe all possible states of a system. We can have a 2D complex vector space for a single qubit or perhaps a square-integrable wave function, depending on the system's dimensionality. We have a 50 percent difference engine with a 1 on the left and a 0 on the right and an x in the middle. There is programming that gives the direction of the information exchange. This is essentially a working 2 state system. There were lots of different people that are said to have contributed to this theory. Information Science is built upon this idea. This is Linear Computer Technology as well as Quantum Computing Technology. This is a linear superposition that can be represented by its 2 orthonormal basis states. In other words, it can be represented by their basis vectors. 2 values are used that are both 2 to the n qubits. 2 to the 2 is equal to 4 values. We have different qubit states. We also have what you can refer to as abstract spaces described by a sphere where the surface area covers the math for 2 states. We are talking about certain positions within a mechanics. These state spaces do not describe literal locations. We are talking about theoretical spin space states. We have the ability to be in a world where we have a smooth transition into an era of encryption that cannot be cracked. We are trying to send 1 qubit between Alice on one end and Bob on another. They are pre-sharing an entangled state in order to make something such as communication work. Quantum Computing is done differently than Classical Computers. The placement of the 1, the 0, and the variable x can be written logically any way. We have chosen to represent our fundamental variables as a 1 on the left, 0 on the right, and an x in the middle. We are…