Quantum Computing (Part 2 of 4)

Is the mysterious world of superposition a gateway to the demonic realm?

DISCLAIMER: The following is my opinion, based on my research and the research of others. I am not an authority on such matters. But I am concerned. Take what you see with a grain of salt and seek the guidance from others more qualified that myself.

Notes from Scott

In my last post (here), we explored the strange world of quantum computers, uncovering their unique way of handling information through qubits, superposition, and entanglement. As a quick recap, a qubit is the quantum version of a bit (which classical computers use). Unlike traditional bits—which are limited to a state of either 0 or 1—a qubit can exist in a superposition, meaning it can represent 0 and 1 simultaneously. We used the spinning coin analogy to visualize this. Additionally, we discovered entanglement, the special phenomenon where qubits become interconnected. Think of entanglement like two toy cars linked invisibly, where moving one immediately influences the other, no matter how far apart they are.

Today, I want to continue this series by delving into how quantum computers actually manipulate these qubits using special tools called quantum gates. Think of quantum gates as the quantum version of logical gates in classical computing. In classical computing, gates control the flow and logic of bits—like tiny traffic lights guiding information down different pathways. Similarly, quantum gates control and manipulate qubits, helping quantum computers perform calculations and tasks efficiently.

Quantum Gates Explained

Quantum gates are the essential building blocks for quantum computations. They carefully alter the state of qubits to achieve specific results. Let’s look at a few common quantum gates to understand this clearly. Now, bear in mind that this is techno-speak, but becoming more familiar with the terminology of quantum computers—like my AI series prior—helps the Watchman community more fully understand what is going on and the implications forthcoming. The implications I’m referring to are more for Tribulation Saints that will come after us, but it is undeniable that we see massive progress in quantum technology today…seemingly just-in-time for the continued groundwork for the Beast System. Do not fear (here).

Hadamard Gate (H Gate)

The Hadamard gate is crucial because it creates superposition. Imagine again that you're flipping a coin. Before flipping it, the coin clearly shows either heads or tails. But once you flip it, it spins in the air, holding possibilities of both outcomes. Applying the Hadamard gate is like flipping a stationary coin—putting it into a state of uncertainty and allowing it to exist simultaneously as heads and tails (or, in quantum terms, as both 0 and 1). This is incredibly useful, as it lets quantum computers explore multiple solutions simultaneously, greatly speeding up certain calculations.

You might ask yourself: how exactly does superposition speed up calculations? Here's the critical insight:

• With classical computing, if you wanted to evaluate two outcomes, you’d have to perform two separate calculations sequentially (one after another).

• With quantum computing, a qubit in superposition can represent both outcomes simultaneously. When combined into multiple qubits, a quantum computer can represent and work with many different possible outcomes at the same time.

Let's illustrate this clearly:

Classical Approach (Normal Coin Flip):

• Imagine you need to find the best route between two cities among 4 possible routes.

• You’d check each route one-by-one: Route A → Route B → Route C → Route D.

• Total: 4 separate steps, one after another.

Quantum Approach (Coin Flipping in the Air):

• Imagine having multiple spinning coins (qubits). When they're spinning in superposition, they simultaneously represent all possible routes (A, B, C, and D).

• You can now apply quantum operations to all possibilities at the same time. It's as if you can evaluate all the routes simultaneously, taking only one "step."

• Total: effectively just 1 step to evaluate multiple possibilities.

---

Clarifying Misconceptions

Here's a common point of confusion: "Doesn't the quantum computer have to check each possibility individually anyway?"

• Yes, but with a key difference:

  • A quantum computer doesn't explicitly “run” separate sequential calculations. Instead, it encodes all possibilities simultaneously into the quantum state and uses quantum interference—another quantum concept—to amplify correct answers and diminish incorrect ones. NOTE: We are covering quantum interference in Part 3 next week!

  • Thus, while you still have to carefully design your quantum algorithms, the quantum nature allows you to extract answers without checking every possibility sequentially.

Think of it like this analogy:

Analogy #1: Symphony Orchestra

• Classical approach: Imagine having a single musician play each instrument separately one by one to create a full song. It takes considerable time.

• Quantum approach: All musicians in a symphony orchestra play simultaneously. You hear the full composition at once. Quantum algorithms similarly orchestrate all possibilities into one "symphony," providing a meaningful output quickly.

Analogy #2: Maze Solving

• Classical approach: You try every pathway in a maze sequentially.

• Quantum approach: Imagine simultaneously sending a fluid through every pathway instantly. The quickest route reveals itself almost immediately as the first to show fluid on the other side of the maze.

---

But what happens when you "measure" the qubits?

Upon measuring (or observing) a quantum state, you collapse the superposition. It's like catching the spinning coin—you'll only see heads or tails at that exact instant.

Therefore, quantum algorithms are carefully designed to ensure the correct solution has a high probability of appearing when measured. In other words, superposition enables the quantum computer to simultaneously explore all possibilities. Quantum interference and algorithm design then ensure that the correct solution stands out clearly at measurement time.

You may have heard a statement similar to “When you measure something, you change it.” This is a simplified and intuitive paraphrasing, commonly used in popular science, of a more nuanced scientific understanding.

However, physicists like Heisenberg, Niels Bohr, and John Wheeler have expressed similar ideas:

• Werner Heisenberg himself explained measurement’s fundamental disturbance of quantum systems clearly in his writing, although not in these exact words.

• Niels Bohr emphasized that measurement apparatus and the act of observation are fundamentally intertwined with quantum reality, strongly influencing the observed results.

• John Archibald Wheeler, a notable theoretical physicist, famously coined simplified and memorable phrases like "it from bit" and emphasized that observation and measurement play a key role in creating the reality we observe. He often expressed ideas similar to "when you measure something, you affect it," which helped popularize this intuitive phrasing.

For illustrative purposes, imagine checking the tire pressure on your bicycle. To measure it, you briefly connect a gauge that inevitably releases some air, slightly changing the pressure. Your act of measurement has slightly altered the original condition of your tire—this is the essence of the observer effect.

In quantum physics, the act of measurement does far more fundamental "changing," affecting the very state of quantum particles themselves.

---

Quantum Algorithms

So, quantum gates (like the Hadamard gate) are intriguing, but their real power emerges when organized into quantum algorithms.

Quantum algorithms are specific sets of quantum gate operations designed
to solve particular problems efficiently.

Let’s explore two famous quantum algorithms—Shor’s Algorithm and Grover’s Algorithm—to appreciate their capabilities:

Shor’s Algorithm (Factoring Large Numbers)

Shor’s algorithm is perhaps the most famous quantum algorithm because it tackles the tough problem of factoring large numbers. Factoring involves breaking down a number into smaller numbers that multiply together to give the original one. While factoring small numbers is easy (6 = 2 × 3), factoring huge numbers is extremely difficult for classical computers.

Shor’s algorithm utilizes quantum gates to examine many potential factors simultaneously, making the task exponentially quicker than traditional computers. Imagine trying every possible key to open a locked door—classical computing checks keys one by one, while Shor’s algorithm effectively tries many keys simultaneously, drastically reducing the time needed.

[NOTE: This is important!] Why does this matter? Modern encryption relies on factoring large numbers (prime number theory) which is extremely slow for classical computers. Shor’s algorithm will eventually break this encryption, leading scientists to rethink security practices entirely. And this is the part where all privacy is broken, and all encryption is potentially hacked almost instantaneously. So, we have to be alert to WHO is controlling quantum computers at this scale. Would it surprise you that the two main ones right now are Google and Microsoft? Hello! Key players in the End Times technical race to setup what we call the Beast System leading to Revelation 13.

Grover’s Algorithm (Searching Unstructured Databases)

Grover’s algorithm solves another common but difficult problem: searching large, unstructured databases. Imagine you have a huge phone book with millions of unsorted names, and you want to find one specific person. A classical computer would have to look at each entry sequentially, like checking every page from front to back—very slow if the book is huge. Grover’s algorithm provides a clever quantum shortcut: by leveraging quantum superposition and entanglement, it can search much faster, effectively reducing the search time dramatically.

It does this by checking multiple entries simultaneously, exploiting quantum mechanics to quickly eliminate incorrect possibilities. This quantum “shortcut” dramatically speeds up the search, opening doors for quicker data analysis, searches in enormous datasets, and potential advancements in artificial intelligence and machine learning.

Remember all of “our data” that gets hoovered up by the main tech oligarchs? It is this algorithm that will allow bad actors to find Tribulation Saints easily. Thus, when we architected Rapture Kit 3.0 for example, we removed all hyperlinks—the attribution is still there, of course, but clicking on a link no longer opens the corresponding webpage. We went even further by putting WARNINGS about using the Internet after the Rapture occurs. When using the Rapture Kit resources, an Internet connection is not required. All the sermons, audio, PDFs and other resources are already self-contained on the USB drive (or your PC or Mac).

Quantum Computing Theory: Quantum States, Operators, and Interference

Quantum computing rests heavily on the theory and mathematics of quantum mechanics. To grasp this clearly, let’s first discuss quantum states and how they’re represented mathematically.

Quantum States and Operators

Quantum states describe exactly what’s happening with a quantum particle—like a qubit—at a given moment. Scientists represent these quantum states using mathematical tools called wave functions. Imagine a wave function like a musical note: it describes not just a single tone, but an entire shape, frequency, and amplitude of a sound wave. Similarly, a quantum wave function defines the entire probability and behavior of a quantum particle.

Now, quantum computers manipulate these states through mathematical tools called operators, which change quantum states precisely, similar to how quantum gates function practically. Operators act on quantum states mathematically, changing their behavior and probability distributions. You might think of operators like instructions to carefully tune the musical notes, shifting their pitch and volume to create a perfect melody.

Quantum Interference

A critical phenomenon in quantum computing is quantum interference. Quantum interference occurs when quantum states combine and interact with each other—much like water waves colliding on the surface of a pond. When waves meet, they either reinforce each other (constructive interference) or cancel each other out (destructive interference). Quantum computing cleverly leverages interference to amplify correct solutions to problems, while reducing or eliminating incorrect paths.

Think of quantum interference like carefully timed sound waves in noise-canceling headphones: by carefully matching and combining waves, you amplify sounds you want to hear (solutions to your problem) and silence unwanted noise (incorrect solutions). Quantum algorithms, such as Grover’s search algorithm, use this phenomenon precisely to quickly zero in on correct answers, far faster than classical methods.

Summary

So, quantum gates and quantum algorithms are the heartbeat of quantum computing. Gates manipulate qubits by applying quantum mechanical rules—creating superposition, changing states, and establishing entanglement. Algorithms intelligently combine these gates to solve problems that classical computers simply find impossible or extremely time-consuming.

As we've seen, quantum computing isn’t just about powerful hardware cooled to near zero degrees kelvin. It is also about smart, elegant solutions designed to harness quantum mechanics. Shor’s and Grover’s algorithms illustrate the quantum advantage—solving problems rapidly, efficiently, and, in some cases, revolutionarily.

In our next post in this quantum series, we'll take a deeper dive into quantum interference and new approaches to error correction, because this is where most of the recent advances have been made. We will continue to discuss the significant challenges scientists currently face. For example, I intend to discuss issues such as qubit stability (why quantum systems are fragile), quantum error correction, and what lies ahead for the future of quantum computing.

The goal is to help the Watchman community understand these key terms and principles so you have a better grasp on the implications. One implication that I am always sifting through are things obviously supporting the Mark of the Beast technology. As my audience already knows, I look at Revelation 13 and work backward. To immediately confirm something to you, other technically minded Watchmen have already concluded that there is only a thin veil between where we find ourselves today and the horrible conditions found in the Tribulation. In other words, I don’t see any major hurdles anymore—perhaps with the exception of the Mark itself. We don’t exactly know how it will be implemented. What we do know is the body parts involved. The right hand or the forehead. The Bible is super clear about that.

By way of encouragement, let’s keep focused. Make every effort to obey the prompting from the Holy Spirit as you interact with people in your sphere of influence. Tom Hughes and I discussed the two things he has reduced the “End Times” down to: the state of technology, and the state of Israel. Both of these provide enough substantiation to confirm to all of us the urgency of the hour.

It appears our interview just posted. Here it is:

#maranatha

YBIC,
Scott