Physics:Quantum Gates and circuits: Difference between revisions

From ScholarlyWiki
Jump to navigation Jump to search
← Older edit
imported>WikiHarold
Repair Quantum Collection B backlink template
Update Quantum information navigation links
 
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{Short description|Quantum Collection topic on Quantum Gates and circuits}}
{{Quantum book backlink|Quantum information and computing}}
{{Quantum book backlink|Quantum information and computing}}
'''Quantum gates''' are the fundamental operations that act on qubits. They are the building blocks of '''quantum circuits''', which define computations in a quantum computer.<ref name="NielsenChuang2010">{{cite book |last1=Nielsen |first1=Michael A. |last2=Chuang |first2=Isaac L. |title=Quantum Computation and Quantum Information |publisher=Cambridge University Press |year=2010}}</ref>
{{Quantum article nav|previous=Physics:Quantum Bell state|previous label=Bell state|next=Physics:Quantum BB84|next label=BB84}}
<ref>{{cite book
 
| last = Williams
<div style="display:flex; gap:24px; align-items:flex-start; max-width:1200px;">
| first = Colin P.
 
| title = Explorations in Quantum Computing
<div style="width:280px;">
| publisher = Springer
__TOC__
| year = 2011
</div>
| isbn = 978-1-84628-887-6
 
}}</ref>
<div style="flex:1; line-height:1.45; color:#006b45; column-count:2; column-gap:32px; column-rule:1px solid #b8d8c8;">
'''Gates and circuits''' quantum gates are the fundamental operations that act on qubits. They are the building blocks of quantum circuits, which define computations in a quantum computer. Quantum gates are the fundamental operations that act on qubits. They are the building blocks of quantum circuits, which define computations in a quantum computer. Single-qubit gates act on individual qubits and correspond to rotations on the Bloch sphere. where U is a unitary operator satisfying These transformations preserve normalization and correspond to reversible evolution in quantum mechanics. These gates create superposition and control phase relationships. The CNOT gate acts on basis states as: Together with single-qubit gates, the CNOT gate forms a universal set for quantum computation.
</div>


<div style="width:300px;">
[[File:Quantum_circuits.jpg|thumb|280px|Quantum Gates and circuits.]]
</div>


[[File:Quantum_circuits.jpg|thumb|400px|Example of a quantum circuit composed of quantum gates acting on qubits.]]
</div>


== Quantum operations ==
== Quantum operations ==
Line 185: Line 192:
{{Author|Harold Foppele}}
{{Author|Harold Foppele}}


{{Sourceattribution|Quantum gates and circuits|1}}
{{Sourceattribution|Physics:Quantum Gates and circuits|1}}

Latest revision as of 22:21, 21 May 2026



← Back to Quantum information and computing
← Previous : Bell state
Next : BB84 →

Gates and circuits quantum gates are the fundamental operations that act on qubits. They are the building blocks of quantum circuits, which define computations in a quantum computer. Quantum gates are the fundamental operations that act on qubits. They are the building blocks of quantum circuits, which define computations in a quantum computer. Single-qubit gates act on individual qubits and correspond to rotations on the Bloch sphere. where U is a unitary operator satisfying These transformations preserve normalization and correspond to reversible evolution in quantum mechanics. These gates create superposition and control phase relationships. The CNOT gate acts on basis states as: Together with single-qubit gates, the CNOT gate forms a universal set for quantum computation.

Quantum Gates and circuits.

Quantum operations

Quantum states evolve according to unitary transformations:[1]

|ψ⟩→U|ψ⟩,

where U is a unitary operator satisfying

U†U=I.

These transformations preserve normalization and correspond to reversible evolution in quantum mechanics.

Single-qubit gates

Single-qubit gates act on individual qubits and correspond to rotations on the Bloch sphere.

Common examples include:

  • Pauli-X gate

X=(0110)

  • Pauli-Y gate

Y=(0−ii0)

  • Pauli-Z gate

Z=(100−1)

  • Hadamard gate

H=12(111−1)

These gates create superposition and control phase relationships.

Multi-qubit gates

Multi-qubit gates act on multiple qubits and can generate entanglement.[2]

A key example is the controlled-NOT (CNOT) gate, which flips a target qubit if the control qubit is in the state |1⟩.

The CNOT gate acts on basis states as:

|00⟩→|00⟩

|01⟩→|01⟩

|10⟩→|11⟩

|11⟩→|10⟩

Together with single-qubit gates, the CNOT gate forms a universal set for quantum computation.[3]

Quantum circuits

A quantum circuit is a sequence of quantum gates applied to a set of qubits.

A typical circuit consists of:

  • initialization of qubits
  • application of unitary gates
  • measurement of the final state

Circuits are usually represented diagrammatically, with time progressing from left to right.

Universal gate sets

A set of quantum gates is called universal if any unitary operation can be approximated to arbitrary accuracy using only gates from that set.[3]

A commonly used universal set consists of:

  • all single-qubit gates
  • the controlled-NOT (CNOT) gate

In practice, finite gate sets such as {H, T, CNOT} are used, where the T gate introduces a nontrivial phase. These sets allow efficient approximation of arbitrary quantum operations.

Circuit depth and complexity

The complexity of a quantum circuit is characterized by measures such as:

  • circuit depth — the number of sequential layers of gates
  • gate count — the total number of gates used

Circuit depth is particularly important, as it determines how long a computation takes and how susceptible it is to noise.

Efficient quantum algorithms aim to minimize both gate count and depth while achieving the desired transformation.

Example: Bell state circuit

Entanglement can be generated using a simple circuit:

1. Start with |0⟩⊗|0⟩ 2. Apply a Hadamard gate to the first qubit 3. Apply a CNOT gate

This produces the entangled state

12(|00⟩+|11⟩).

Noise and decoherence

Real quantum systems are affected by noise and interactions with their environment, leading to decoherence and errors in quantum operations.

Noise limits the size and depth of quantum circuits that can be reliably executed. This is a central challenge in current quantum computing devices.

These limitations define the so-called noisy intermediate-scale quantum (NISQ) regime (see Physics:Quantum Noisy Qubits).

Measurement

Measurement converts a quantum state into classical information.

For a qubit

|ψ⟩=α|0⟩+β|1⟩,

measurement yields:

  • |0⟩ with probability |α|2
  • |1⟩ with probability |β|2

Measurement is irreversible and collapses the quantum state.

Physical significance

Quantum gates and circuits:

  • define how quantum computations are performed
  • enable superposition and entanglement to be controlled
  • provide the framework for quantum algorithms

See also

Table of contents (212 articles)

Index

Full contents

References

  1. ↑ Feynman, Richard P. (1986). "Quantum mechanical computers". Foundations of Physics 16 (6): 507–531. doi:10.1007/bf01886518. ISSN 0015-9018. Bibcode: 1986FoPh...16..507F. 
  2. ↑ "UnitaryGate adjoint()". IBM. https://quantum.cloud.ibm.com/docs/api/qiskit/qiskit.circuit.library.UnitaryGate. 
  3. ↑ 3.0 3.1 Cite error: Invalid <ref> tag; no text was provided for refs named NielsenChuang2010


Author: Harold Foppele


Source attribution: Physics:Quantum Gates and circuits

Retrieved from "https://scholarlywiki.org/index.php?title=Physics:Quantum_Gates_and_circuits&oldid=7138"