Skip to main content

Quantum Computing Basics: Qubits, Basis, and Probability


Quantum Computing Fundamentals

Understanding qubits, basis, Hadamard transform, and quantum probability

1. Qubit (quantum bit)

A qubit is a unit vector in a 2-dimensional complex Hilbert space:

\[ |\psi\rangle = \alpha |0\rangle + \beta |1\rangle \]

where

\[ \alpha, \beta \in \mathbb{C}, \quad |\alpha|^2 + |\beta|^2 = 1 \]

  • \(|0\rangle, |1\rangle\) are basis states
  • \(|\alpha|^2\) = probability of measuring 0
  • \(|\beta|^2\) = probability of measuring 1

2. Basis (measurement basis)

A basis is a set of orthonormal vectors used to describe or measure a qubit.

(a) Computational (Z) basis

\[ |0\rangle = \begin{pmatrix} 1 \\ 0 \end{pmatrix}, \quad |1\rangle = \begin{pmatrix} 0 \\ 1 \end{pmatrix} \]

Measurement probabilities:

\[ P(0) = |\langle 0|\psi\rangle|^2 = |\alpha|^2 \]

\[ P(1) = |\langle 1|\psi\rangle|^2 = |\beta|^2 \]

(b) Hadamard (X) basis

\[ |+\rangle = \frac{|0\rangle + |1\rangle}{\sqrt{2}}, \quad |-\rangle = \frac{|0\rangle - |1\rangle}{\sqrt{2}} \]

Same qubit, different description:

\[ |\psi\rangle = c_+ |+\rangle + c_- |-\rangle \]

3. Basis change (Hadamard transform)

The Hadamard gate:

\[ H = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix} \]

Example:

\[ H|0\rangle = |+\rangle, \quad H|1\rangle = |-\rangle \]

4. Why basis matters (quantum communication)

  • Measuring in the wrong basis gives random outcomes
  • Non-commuting bases: \[ [Z, X] \neq 0 \]
  • Used in protocols like BB84 for eavesdropping detection
A qubit is a vector; a basis is the coordinate system you choose to measure it.

5. Why Hadamard are used?

  • Hadmard is used to keep the total probality value 1 because practically probabity cannot be greter than 1. If we do not apply Hadamard then probability of P(0) + P(1) could be 2 (max). Hadamard limts it to P(0) + P(1) = 1/2 + 1/2 = 1 (max)

6. Amplitude and Probability in Quantum Mechanics

In the above you observe the probabity of qbits are directly proportional to their amplitude. Surprised? You should know that the probabily of dection of a wave increases as the legth of wavelength increases. It is a natural phenomena

Amplitude becomes probability by squaring its size.

That rule is called the Born rule.

What is an amplitude? (In general)

  • a signed size (can be + or −)
  • or a length of an arrow

It is not a probability.

Why amplitude cannot be probability

Amplitudes can be:

  • negative
  • complex (in advanced cases)

Probabilities must:

  • be positive
  • be between 0 and 1

So we need a way to turn:

+ or − → always positive
      

The rule that does this

\[ \text{probability} = |\text{amplitude}|^2 \]

This is not chosen by us — experiments confirm it. This rule is the Born rule.

Simple number example

Amplitude for 0:

\[ a = \frac{1}{\sqrt{2}} \]

Probability:

\[ P(0) = \left(\frac{1}{\sqrt{2}}\right)^2 = \frac{1}{2} \]

Same for 1.

Why square and not something else?

  1. Removes minus signs \[ (-a)^2 = a^2 \]
  2. Makes probability always positive
  3. Preserves total probability: \[ a^2 + b^2 = 1 \]

No other simple rule does all three and matches experiments.

Everyday analogy

  • Wave height = amplitude
  • Energy ∝ (height)²

Double the wave height → 4× energy

Quantum probability behaves the same way.

Example: qubit

Suppose a qubit is:

\[ |\psi\rangle = \frac{|0\rangle + |1\rangle}{\sqrt{2}} \]

  • Amplitude for 0: \(\psi_0 = \frac{1}{\sqrt{2}}\)
  • Amplitude for 1: \(\psi_1 = \frac{1}{\sqrt{2}}\)

Probability of measuring 0:

\[ P(0) = |\psi_0|^2 = \left(\frac{1}{\sqrt{2}}\right)^2 = \frac{1}{2} \]

Probability of measuring 1:

\[ P(1) = |\psi_1|^2 = \left(\frac{1}{\sqrt{2}}\right)^2 = \frac{1}{2} \]

Further Reading

Contact Us

Name

Email *

Message *

Popular Posts

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit f...

Q-function in BER vs SNR Calculation

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Intel 8086 Transistor Count: Architecture, Specifications, and Comparison with Other Microprocessors

Intel 8086 Transistor Count: Architecture, Specifications, and Comparison with Other Microprocessors Intel 8086 Transistor Count: Complete Guide with Architecture and Processor Comparison The Intel 8086 microprocessor is one of the most important processors in computer history. Released in 1978 , it introduced the x86 architecture that still influences modern CPUs. One of the most frequently asked questions in computer architecture and microprocessor courses is: How many transistors are present in the Intel 8086? The commonly accepted answer is approximately 29,000 transistors . However, reverse-engineering studies have shown that the actual number of physical transistors is closer to 19,618 , while Intel's published figure includes programmable transistor locations used in ROM and PLA structures. Intel 8086 Transistor Count Metric Value Published transistor count ~29,000 Physical transistor count ~19,618 Release year 1978 Word ...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

Choke Input Filter Explained

  Choke Input Filter Choke Input Filter A well-designed choke input filter is a type of power supply filter used to smooth the output of a rectifier (like in DC power supplies). It uses an inductor (choke) as the first component right after the rectifier, followed by a capacitor. Basic Structure Rectifier → Choke (L) → Capacitor (C) → Load What Makes It Well-Designed? Critical Inductance is satisfied: The choke must have enough inductance to keep current flowing continuously. This minimum value is called critical inductance. Low ripple output: A good design significantly reduces AC ripple in the DC output. The choke resists sudden changes in current. Proper load current: Works best when the load current is above a certain minimum level. Too light a load results in poor filter...