Day 13 Qucode Cohort 3

Topic: Circuit model, Adiabatic QC, Measurement-based QC

Quantum computing is rapidly evolving from theoretical constructs into practical frameworks for computation. While most popular discussions focus on algorithms like Shor’s or Grover’s, it is crucial to understand the foundational paradigms that underpin quantum computation. In this article, we dive deep into three fundamental models: the Circuit Model, Adiabatic Quantum Computing (AQC), and Measurement-Based Quantum Computing (MBQC).

1. The Circuit Model of Quantum Computation

The circuit model is arguably the most familiar paradigm, closely mirroring classical digital circuits but operating on quantum bits (qubits) instead of classical bits. The basic idea is to represent quantum algorithms as sequences of unitary operations (quantum gates) applied to qubits, followed by measurements to extract classical results.

Universal Gate Set

Any quantum circuit can, in principle, be decomposed into a small universal set of gates:

1. Single-qubit gates: The Hadamard (H) and T gates are sufficient to implement any single-qubit unitary transformation.
2. Two-qubit gate: The Controlled-NOT (CNOT) gate is enough to entangle qubits.

Remarkably, this minimal set of gates suffices to construct arbitrary quantum circuits, meaning any unitary transformation on a system of qubits can be realized by combining these elementary operations.

Measurement at the End

Once the quantum computation completes, we perform measurements on the qubits to obtain classical information. These measurements collapse the quantum state into one of the basis states, giving probabilistic outcomes that reflect the amplitudes of the superposed states.

The circuit model provides a concrete, step-by-step approach to quantum computation and forms the backbone of most quantum algorithm implementations on hardware such as IBM Q, Rigetti, or IonQ.

2. Adiabatic Quantum Computing (AQC)

Adiabatic Quantum Computing offers a radically different perspective. Instead of manipulating qubits through discrete gates, AQC leverages continuous evolution of a quantum system under a slowly changing Hamiltonian.

The Core Idea

• Begin with a system in the ground state of an initial, easily-preparable Hamiltonian H0H_0H0​.
• Slowly evolve the system toward a problem Hamiltonian HP​, whose ground state encodes the solution to a computational problem.
• If the evolution is slow enough (adiabatic), the system remains in its ground state throughout, and the final measurement yields the solution with high probability.

Mathematically, the adiabatic theorem guarantees that a system evolving under a time-dependent Hamiltonian H(t)=(1−s(t))H0+s(t)H​, with s(0)=0 and s(T)=1, will remain in the instantaneous ground state if T is sufficiently large compared to the inverse of the minimum energy gap between the ground and first excited states.

Get Andreabenassi’s stories in your inbox

Join Medium for free to get updates from this writer.

Remember me for faster sign in

Advantages and Challenges

• AQC is particularly suited for optimization problems.
• Physical implementations include quantum annealers like D-Wave.
• The main challenge lies in maintaining adiabaticity and avoiding transitions to excited states in real hardware.

AQC illustrates the power of quantum mechanics to solve certain problems continuously, rather than through discrete gate sequences.

3. Measurement-Based Quantum Computing (MBQC)

Measurement-Based Quantum Computing (also called the one-way quantum computer) is a striking paradigm in which measurements, rather than unitary gates, drive computation.

The Basic Mechanism

• Start with a highly entangled cluster state across multiple qubits.
• Perform sequential measurements on qubits in specific bases
• Each measurement probabilistically projects the system into a new state, effectively implementing quantum gates on the remaining unmeasured qubits.

Example: Single-Qubit Transformation via Measurements

Consider a qubit in an arbitrary state ∣ψ⟩ and an auxiliary qubit initialized in ∣0⟩. The goal is to apply an arbitrary unitary U to ∣ψ⟩ using only measurements:

1. Measure a two-qubit observable B, carefully constructed so that it has eigenvalues ±1 and acts on both qubits.
2. Depending on the outcome, the system is projected onto one of the eigenstates of B.
3. Perform a second measurement on the auxiliary qubit in the standard basis.
4. Repeat the process probabilistically until the second qubit achieves the transformed state U∣ψ⟩.

This approach is probabilistic: the expected number of iterations for success is 2 in the simplest case, but the method can be extended to multi-qubit operations, demonstrating universality comparable to the circuit model.

Key Properties

• Universality: MBQC can implement arbitrary single- and multi-qubit gates using only measurements.
• Probabilistic algorithm: The computation is not deterministic per run but converges with repeated measurements.
• Decoupling of entanglement and computation: All entanglement is prepared upfront, and computation proceeds through local operations (measurements).

MBQC reveals the profound difference between classical and quantum computation: measurement, a fundamentally probabilistic process, can itself serve as the engine of computation.