Editing Quantum Gates and Circuits

<div style="background-color: #4B0082; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
{{BloomIntro}}
Quantum Gates and Circuits are the tools used to manipulate quantum information and perform calculations. Just as classical computers use logic gates (AND, OR, NOT) to process bits, quantum computers use quantum gates to rotate qubits on the Bloch sphere and "Entangle" them with each other. These gates don't just change a 0 to a 1; they create "Interference Patterns" that allow the computer to navigate through a sea of possibilities to find the right answer. It is the "Algebra of Reality"—the mathematical language used to program the subatomic world.
</div>

__TOC__

<div style="background-color: #000080; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Quantum Gate''' — A basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits.
* '''Unitary Matrix''' — The mathematical representation of a quantum gate, ensuring that the total probability of the qubit remains 1.0.
* '''Reversibility''' — The property that all quantum gates (except measurement) can be "Run Backwards" to return to the original state.
* '''X-Gate (NOT)''' — A gate that flips a qubit from |0⟩ to |1⟩ (a 180-degree rotation).
* '''H-Gate (Hadamard)''' — The most important gate, which puts a qubit into a "Perfect Superposition" (50% chance of 0, 50% of 1).
* '''Z-Gate''' — A gate that flips the "Phase" of a qubit without changing its probability.
* '''CNOT-Gate (Controlled-NOT)''' — A two-qubit gate that flips the second qubit only if the first one is a 1. This is used to create '''Entanglement'''.
* '''Toffoli Gate''' — A "Universal" gate that can perform any classical logic operation within a quantum computer.
* '''Quantum Circuit''' — A sequence of quantum gates applied to a set of qubits, followed by measurement.
* '''Qiskit / Cirq''' — Modern programming languages used to design and run quantum circuits.
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Understanding</span> ==
Quantum circuits are understood through '''Rotation''' and '''Interference'''.

'''1. Logic as Rotation''':
In a classical computer, a "Gate" is like a physical pipe that water flows through.
* In a quantum computer, a "Gate" is like a "Magnetic Pulse" or a "Laser Flash" that nudges the qubit.
* Every gate is just a "Rotation" on the Bloch sphere.
* An **X-Gate** flips the qubit from North to South.
* An **H-Gate** rotates the qubit to the "Equator," where it is half-north and half-south at the same time.

'''2. Creating the "Spooky Connection" (CNOT)''':
The CNOT gate is the "Engine" of quantum power.
* If you take two qubits and apply an H-Gate to the first and then a CNOT between them, they become **Entangled**.
* Now, they no longer have individual states. They are a single "Quantum System." If you measure one, you instantly know the state of the other.

'''3. Constructive and Destructive Interference''':
The goal of a quantum circuit is not to "Calculate" an answer, but to create a "Wave Pattern."
* The gates are designed so that "Wrong" paths interfere with each other and "Cancel Out."
* The "Right" path is amplified.
* By the time the qubits reach the end of the circuit, the probability of measuring the correct answer is nearly 100%.

'''Universal Gate Set''': A small collection of gates (like H, T, and CNOT) that can be combined to perform **any** possible quantum calculation.
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Applying</span> ==
'''Modeling 'The Hadamard Flip' (Creating a superposition):'''
<syntaxhighlight lang="python">
import numpy as np

def apply_hadamard(qubit_state):
    """
    H-Gate Matrix: 1/sqrt(2) * [[1, 1], [1, -1]]
    """
    H = (1 / np.sqrt(2)) * np.array([[1, 1], [1, -1]])
    new_state = np.dot(H, qubit_state)
    return new_state

# Start with |0> = [1, 0]
initial = np.array([1, 0])
result = apply_hadamard(initial)

print(f"Initial State: {initial}")
print(f"State after H-Gate: {result}")
# The result is [0.707, 0.707], representing a 50/50 superposition.
</syntaxhighlight>

; Circuit Landmarks
: '''The Deutsch-Jozsa Algorithm (1992)''' → The first proof that a quantum circuit could solve a problem in "One Step" that takes a classical computer "Two Steps."
: '''IBM Quantum Experience (2016)''' → The first time a quantum computer was put in the "Cloud," allowing anyone in the world to drag-and-drop quantum gates to build circuits.
: '''Quantum Volume''' → A metric used to measure the "Power" of a quantum computer by looking at how many qubits it has AND how many gates it can run before they "Collapse."
: '''Transmon Qubits''' → The specific superconducting circuits used by Google and IBM that act as "Artificial Atoms" for gates.
</div>

<div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Analyzing</span> ==
{| class="wikitable"
|+ Common Quantum Gates
! Gate !! Name !! Symbol !! Function
|-
| X || NOT || ⊕ || Flips 0 to 1 and 1 to 0
|-
| H || Hadamard || H || Creates Superposition
|-
| Z || Phase Flip || Z || Changes the "Sign" of the 1 state
|-
| CNOT || Controlled-NOT || ●—⊕ || Entangles two qubits
|}

'''The Concept of "No-Cloning"''': Analyzing why there is no "Copy" gate in quantum computing. You can move information, you can swap it, but you can never "Duplicate" it. This is a fundamental limit of quantum circuits that makes them very different from classical code.
</div>

<div style="background-color: #483D8B; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Evaluating</span> ==
Evaluating quantum gates:
# '''Gate Fidelity''': In a normal computer, a gate works 99.999999% of the time. In a quantum computer, a gate might fail 1% of the time. How many "Bad Gates" can a circuit handle before the answer is just noise?
# '''Connectivity''': In a circuit, can every qubit "Talk" to every other qubit, or are they limited by the physical wires?
# '''Depth''': How "Long" can a circuit be? (If it's too long, the qubits will "Decohere" and die before the calculation is done).
# '''Verification''': If a quantum circuit solves a problem that a supercomputer can't, how do we "Check" if the answer is actually right?
</div>

<div style="background-color: #2F4F4F; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Creating</span> ==
Future Frontiers:
# '''Quantum Compilers''': Software that takes a high-level "Idea" and breaks it down into the most efficient set of quantum gates automatically.
# '''Adiabatic Quantum Computing''': A different way of "Programming" where you don't use gates, but instead "Slowly Change" the energy of the system to find the answer.
# '''Blind Quantum Computing''': A protocol that allows you to run a circuit on a cloud quantum computer without the owner of the computer knowing what you are calculating.
# '''Pulse Programming''': Moving beyond "Gates" to directly controlling the microwave pulses that move the qubits, providing 10x more precision.

[[Category:Physics]]
[[Category:Computer Science]]
[[Category:Quantum Computing]]
</div>