Sitemap
QDuality

QDuality

AI and QC

Quantum Computing Models

--

Qucode: Day 13/21; QCC; Cohort-3;

Welcome to Day 13.

Circuit based models are very common and we basically use the gates that we went over the last few articles to build our quantum circuits. So I won’t be diving too deeply into circuit based models but let us look at measurement based and adiabatic quantum computation models.

Let’s get started!

Measurement based computation

Measurement-based computation is an alternative quantum computing paradigm that relies on a series of measurements instead of the more traditional gate-based quantum circuits. The core idea is that any gate operation can be replicated by preparing a specific two-qubit state and then performing two successive measurements.

Key Concepts and Equations

The central problem addressed is how to perform an arbitrary unitary transformation U on a single qubit state |psi> using only measurements. The method uses two qubits: a qubit of interest (initialized to |psi>) and an ancilla qubit (initialized to | 0>).

First Measurement: A measurement of a two-qubit observable, B, is performed. The observable is defined by the following Hermitian operator, which has eigenvalues of +1 and -1:

Press enter or click to view image in full size

Here, sigma_x and sigma_y are Pauli matrices, and U is the desired unitary transformation.

Get QDuality’s stories in your inbox

Join Medium for free to get updates from this writer.

Second Measurement: A second measurement is performed on the ancilla qubit.

  • If the result is -1 (corresponding to the basis state | 1>), the process is successful, and the qubit of interest is now in the desired state U|psi>.
  • If the result is +1 (corresponding to | 0>), the process has failed, and the circuit must be repeated. On average, this process will succeed after two attempts.

This probabilistic, measurement-based approach is as universal and powerful as gate-based quantum computation.

Adiabatic Quantum Computation

Adiabatic quantum computation is an alternative to the more common circuit model. The central idea is to solve a problem by slowly evolving a quantum system from a known, simple ground state to a final ground state that encodes the solution to a complex problem.

Key Concepts and Equations

  • Adiabatic Process: The system starts in the ground state of a simple initial Hamiltonian, H_0, and is slowly transformed into a final Hamiltonian, H_f, whose ground state is the solution to the problem. This transformation is described by the equation:

H(t) = (1-t)*H_0 + t*H_f; where t is the time parameter that goes from 0 to 1.

  • Quantum Adiabatic Theorem: This theorem states that if the transformation from H_0 to H_f happens slowly enough, the system will remain in its ground state throughout the process.
  • Time Complexity: The total time, T, required for the computation is inversely related to the square of the minimum energy gap between the ground state and the first excited state, known as the spectral gap, G_{min}. The smaller the gap, the more slowly the system must evolve, making the computation take longer. The relationship is:

where T is the computation time and G_{min} is the minimum spectral gap.

Practical Challenges

  • While this model has potential, the spectral gap can become exponentially small for certain problems, requiring exponentially long computation times, thus eliminating any potential quantum speed-up.

Tags

#QuantumComputing #QuantumLearning #Probability #Statistics #BayesTheorem #Qohort3 #STEM #QuCode #QuantumIndia #NationalQuantumMission #DeepTech #FutureOfComputing #QuantumStartups #ResearchAndInnovation #LearnQuantum #QuantumAlgorithms #QuantumCommunity #NextGenTech #DigitalIndia #TechForGood

Resources/References

This article was written by understanding content from:

--

--