Quantum computing leverages the principles of quantum mechanics to perform computations. These computations can be exponentially faster than those of classical computers for certain problems. A quantum computing glossary is essential for understanding the specialized terminology and concepts. These concepts drive this rapidly advancing field.

Quantum Computing Glossary

Algorithm
Amplitude
Amplitude Amplification
Amplitude Damping
Annealing
Anyon
Approximate Quantum Computing
Artificial Atom
Atom Trap
Atomic Clock
Atomic-Molecular-Optical Physics (AMO)
Axion
BQP (Bounded-Error Quantum Polynomial Time)
Basis States
Beam Splitter
Bell Inequality
Bell Measurement
Bell State
Bell’s Theorem
Bloch Sphere
Bloch Vector
Boson
Boson Sampling
Bra-Ket Notation
Braiding
Building Block
Cat State
Cavity Quantum Electrodynamics (cQED)
Charge Qubit
Chip-Based Quantum Computing
Circuit
Circuit Depth
Circuit Model
Circuit-Based Quantum Computing
Classical Computer
Classical Control
Clock Speed
Cloud-Based Quantum Computing
Cloud-Based Quantum Computing
Coherence
Coherence Time
Coherent Control
Coherent State
Cold Atom
Compiler
Complex Conjugate
Complexity Class
Computational Basis
Computational Complexity Theory
Concurrence
Conditional Gate
Connectivity
Continuous-Variable Quantum Computing
Control Qubit
Controlled-NOT (CNOT) Gate
Cooper Pair
Cooper Pair Box
Cosmic Ray
Coupler
Cross-Resonance Gate
Cross-Talk
Cryogenic
Cryogenic Control Electronics
Cryptography
Current-Biased Josephson Junction
De Broglie Wavelength
Decoherence
Decoherence-Free Subspace
Density Matrix
Depth
Diamond Anvil Cell
Diamond-Based Quantum Computing
Digital Quantum Computing
Dilution Refrigerator
Dipole-Dipole Interaction
Dirac Notation
Distributed Quantum Computing
Distributed Quantum Computing
Dynamical Decoupling
D-Wave Systems
Electron Spin
Electron Spin Resonance (ESR)
Emulation
Energy Gap
Entanglement
Entanglement Distillation
Entanglement Entropy
Entanglement Fidelity
Entanglement Swapping
Entangling Gate
Environmental Noise
Error Correction
Error Detection
Error Mitigation
Error Rate
Error Syndrome
Exchange Interaction
Excited State
Exciton
Fault Tolerance
Distributed Quantum Computing
Dynamical Decoupling
D-Wave Systems
Electron Spin
Electron Spin Resonance (ESR)
Emulation
Energy Gap
Entanglement
Entanglement Distillation
Entanglement Entropy
Entanglement Fidelity
Entanglement Swapping
Entangling Gate
Environmental Noise
Error Correction
Error Detection
Error Mitigation
Error Rate
Error Syndrome
Exchange Interaction
Excited State
Exciton
Fault Tolerance
Fault-Tolerant Quantum Computing
Fermion
Fidelity
Field-Programmable Gate Array (FPGA)
Flux Qubit
Fluxon
Fourier Transform
Frequency-Tunable Qubit
Full Adder
Gate
Gate Decomposition
Gate Error
Gate Set
Global Control
Gottesman-Knill Theorem
Ground State
Grover’s Algorithm
Hadamard Gate
Hamiltonian
Hardware-Efficient Ansatz
High-Performance Computing (HPC)
Hilbert Space
Hole Spin Qubit
Hybrid Quantum-Classical Algorithm
Hybrid Quantum Computing
Hydrogen-like Atom
Hyperfine Interaction
Impurities
Initialization
Integrated Photonics
Interference
Interferometer
Ion Trap
Ion Trap Quantum Computing
Josephson Effect
Josephson Energy
Josephson Junction
Kernel
Ket
Key Distribution
Kitaev’s Toric Code
Klystron
Kramers Pair
Lagrangian
Lamb Shift
Landau-Zener Transition
Landauer’s Principle
Laser Cooling
Lattice
Lattice Gauge Theory
Leakage
Leggett-Garg Inequality
Level Repulsion
Lindblad Equation
Linear Optics
Linear Optical Quantum Computing (LOQC)
Linear Paul Trap
Liquid State NMR Quantum Computer
Local Realism
Locality
Logical Qubit
Long-Range Interaction
Magic State
Magic State Distillation
Magnetic Flux Quantum
Magnetic Resonance
Magnetic Trap
Magnetometry
Majorana Fermion
Majorana Zero Mode
Master Equation
Measurement
Measurement-Based Quantum Computing (MBQC)
Microwave Engineering
Microwave Pulse
Mixed State
Mixer
Mølmer-Sørensen Gate
Motional Mode
Multi-Qubit Gate
Multiplexing
Mutually Unbiased Bases
N-Qubit System
Native Gate
Near-Term Quantum Computing
Neutral Atom
Nitrogen-Vacancy (NV) Center
No-Cloning Theorem
No-Communication Theorem
Noise
Noise Characterization
Noise Model
Noisy Intermediate-Scale Quantum (NISQ)
Non-Abelian Anyon
Non-Clifford Gate
Non-Demolition Measurement
Non-Local Correlations
NP (Non-deterministic Polynomial Time)
NP-Complete
NP-Hard
Nuclear Magnetic Resonance (NMR)
Nuclear Spin
Number State
NV Center Quantum Computing
One-Way Quantum Computing
Open Quantum System
Operator
Optical Lattice
Optical Qubit
Optical Tweezer
Optimization Problem
Oracle
Orbital
Orthogonality
Orthonormal Basis
Overhead
Parity
Partial Measurement
Particle Statistics
Passive Qubit
Path Integral
Pauli Error
Pauli Exclusion Principle
Pauli Gates
Pauli Matrices
Phase
Phase Estimation
Phase Flip
Phase Gate
Phase Kickback
Phase Space
Phonon
Photodetector
Photonic Quantum Computing
Photonics
Physical Qubit
Planck’s Constant
Pockels Effect
Pointer State
Polarization
Polynomial Time
Post-Quantum Cryptography
Postselection
Power-Law Distribution
Precision
Prepared State
** প্রাইমারী স্টেট**
Principle of Superposition
Probabilistic Algorithm
Probability Amplitude
Programmable Quantum Computer
Projective Measurement
Protective Measurement
Pseudopure State
Pure State
Purification
Q Factor
Qubit
Qubit-Qubit Coupling
Qubit Initialization
Qubit Readout
Quadrature
Quantization
Quantum Algorithm
Quantum Annealing
Quantum Approximate Optimization Algorithm (QAOA)
Quantum আর্টিফ্যাক্ট
Quantum Assembly Language (QASM)
Quantum আর্টিফিশিয়াল ইন্টেলিজেন্স
Quantum Biology
Quantum Bus
Quantum Byte (Qbyte)
Quantum Chaos
Quantum Chemistry
Quantum Circuit
Quantum-Classical Hybrid Algorithm
Quantum Communication
Quantum Compiler
Quantum Complexity Theory
Quantum Computer
Quantum Control
Quantum Cryptography
Quantum Data
Quantum Data Bus
Quantum Decoder
Quantum Defect
Quantum Degeneracy
Quantum Detector
Quantum Dot
Quantum Efficiency
Quantum Electrodynamics (QED)
Quantum Electronics
Quantum Enigma
Quantum Entanglement
Quantum Error Correction (QEC)
Quantum Error Detection
Quantum Field Theory (QFT)
Quantum Fourier Transform (QFT)
Quantum Gate
Quantum Graph
Quantum Hall Effect
Quantum Hardware
Quantum హీలింగ్
Quantum Hybrid
Quantum Information
Quantum Information Processing
Quantum Information Science
Quantum Internet
Quantum Key Distribution (QKD)
Quantum Machine Learning
Quantum ম্যাগনেটোমিটার
Quantum Many-Body System
Quantum Measurement
Quantum Memory
Quantum Metrology
Quantum Monte Carlo
Quantum Network
Quantum Neural Network
Quantum Nonlocality
Quantum Operation
Quantum Optics
Quantum Parallelism
Quantum Phase
Quantum Phase Estimation
Quantum Phase Transition
Quantum Photonics
Quantum Physics
Quantum Processor
Quantum Programming
Quantum Random Access Memory (QRAM)
Quantum Random Number Generator (QRNG)
Quantum Repeater
Quantum Reservoir Computing
Quantum Safe
Quantum Search
Quantum Sensor
Quantum Simulation
Quantum Simulator
Quantum Software
Quantum Software Development Kit (QDK)
Quantum Speedup
Quantum State
Quantum Supremacy
Quantum System
Quantum Technology
Quantum Teleportation
Quantum Tomography
Quantum Tunneling
Quantum Volume
Quantum Walk
Quantum Wire
Quantum Zeno Effect
Quantum-Inspired Algorithm
Quasi-Particle
Qubit
Qubit Connectivity
Qubit Encoding
Qubit Fidelity
Qubit-Photon Interface
Quil
Qubit Mapping
Rabi Cycle
Rabi Frequency
Ramsey Experiment
Random Circuit Sampling
Random Matrix Theory
Rare-Earth Ion
Readout Fidelity
Realism
Reduced Density Matrix
Register
Relaxation
Remote State Preparation
Repetition Code
Reservoir Computing
Resistive Quantum Computing
Resonator
Rydberg Atom
S Parameter
Sampling Problem
Scaling
Scanning Probe Microscopy
Schmidt Decomposition
Schrödinger Equation
Schrödinger’s Cat
Semiconductor
Semiconductor Quantum Computing
Shor’s Algorithm
Shot Noise
SIAM (Single Impurity Anderson Model)
Sigma Matrices
Silicon-Based Quantum Computing
Simulated Annealing
Simulation
Single-Electron Transistor (SET)
Single-Flux-Quantum (SFQ) Logic
Single-Photon Detector
Single-Photon Source
Single-Qubit Gate
Singlet State
Solid-State Quantum Computing
Soliton
Spacetime
Special Relativity
Spectroscopy
Spin
Spin Bath
Spin Chain
Spin Echo
Spin-Flip Error
Spin-Orbit Coupling
Spin Qubit
SQUID (Superconducting Quantum Interference Device)
Squeezed State
Stabilizer Code
Stabilizer Formalism
Standard Quantum Limit (SQL)
State Vector
Stimulated Emission
STM (Scanning Tunneling Microscope)
Storage Time
Strong Coupling
Superconducting Circuit
Superconducting Qubit
Superconducting Quantum Computing
Superconductivity
Superdense Coding
Superoperator
Superposition
Surface Code
SWAP Gate
Symmetry
Symmetry-Protected Topological (SPT) Phase
T Gate
Target State
Teleportation
Tensor Network
Tensor Product
Thermal Equilibrium
Thermal State
Thermodynamics
Threshold Theorem
Tight-Binding Model
Time Crystal
Time-Dependent Hamiltonian
Time-Dependent Schrödinger Equation
Time-Independent Schrödinger Equation
Time-Reversal Symmetry
Toffoli Gate
Tomography
Topological Quantum Computing
Topological Qubit
Topology
Total Variation Distance
Transistor
Transmon Qubit
Transport
Trapped-Ion Quantum Computing
Traveling Wave Parametric Amplifier (TWPA)
Triplet State
Tunneling
Two-Qubit Gate
Type-I Superconductor
Type-II Superconductor
Ultracold Atom
Uncertainty Principle
Uncomputation
Unitary
Unitary Matrix
Unitary Transformation
Universal Gate Set
Universal Quantum Computer
Vacuum Rabi Splitting
Vacuum State
Valence Band
Variational Quantum Algorithm
Variational Quantum Eigensolver (VQE)
Vector Space
Verification
Visibility
Von Neumann Architecture
Von Neumann Entropy
Von Neumann Measurement
Vortex
VQE
W State
Wave Function
Wave-Particle Duality
Waveguide
Weak Measurement
Weyl Fermion
Work Function
X Gate
XY Model
Y Gate
YIG (Yttrium Iron Garnet)
Young’s Double-Slit Experiment
Yukawa Interaction
Z Gate
Zeeman Effect
Zero-Point Energy
Zero-Point Fluctuations
Zitterbewegung
Zone Plate

Algorithm

Much like its classical counterpart, an algorithm in quantum computing is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or perform a computation. However, quantum algorithms leverage the principles of quantum mechanics, enabling them to solve certain problems more efficiently than classical algorithms. Examples include Shor’s algorithm for factoring large numbers and Grover’s algorithm for searching unsorted databases. These algorithms are designed to be executed on a quantum computer, taking advantage of quantum phenomena such as superposition and entanglement.

Amplitude

In quantum mechanics, amplitude refers to a complex number that describes the probability of a particular outcome when a quantum system is measured. Unlike classical probabilities, which are always real and positive, quantum amplitudes can be positive, negative, or even complex. The square of the magnitude of the amplitude gives the probability of the associated outcome. Amplitudes are central to the mathematical formalism of quantum mechanics and are used to calculate the probabilities of different measurement results in quantum algorithms.

Amplitude Amplification

Amplitude amplification is a technique used in quantum algorithms to boost the probability of finding a desired state. It’s a generalization of the core idea behind Grover’s search algorithm. By iteratively applying specific quantum operations, the amplitude of the desired state (or states) is increased, while the amplitudes of other states are decreased. This allows the desired state to be measured with a higher probability, effectively speeding up the search process.

Amplitude Damping

Amplitude damping is a type of quantum error that occurs in quantum systems, analogous to energy dissipation in classical systems. It represents the loss of energy from a qubit, typically due to interaction with the environment. In a two-level system, amplitude damping causes the qubit to decay from the excited state (|1⟩) to the ground state (|0⟩). This process is a significant challenge in building practical quantum computers, as it leads to the loss of quantum information and limits the coherence time of qubits.

Annealing

Quantum annealing is a specific type of quantum computation used to find the global minimum of a given objective function over a set of candidate solutions (states), by a process using quantum fluctuations. It is primarily used for optimization problems, where the goal is to find the best solution among many possible solutions. Quantum annealing starts with a superposition of all possible states, and the system gradually evolves towards the ground state, representing the optimal solution. This is analogous to the process of annealing in metallurgy, where a material is heated and then slowly cooled to reduce defects and increase its strength.

Anyon

Anyons are quasiparticles that exhibit properties intermediate between those of fermions (such as electrons) and bosons (such as photons). Unlike fermions and bosons, which are governed by specific rules of quantum statistics when interchanged. In contrast, anyons have more complex exchange statistics. When two identical anyons are exchanged, their wave function can acquire a phase shift that is neither 0 (like bosons) nor π (like fermions), but any arbitrary value. This unique property has potential applications in topological quantum computing, where anyons are used to encode and process quantum information in a fault-tolerant manner.

Approximate Quantum Computing

Approximate quantum computing involves finding acceptable, but not necessarily optimal, solutions to computational problems using quantum algorithms. This approach can be useful when exact solutions are either computationally intractable or not required. By introducing controlled approximations, quantum algorithms can potentially achieve a significant speedup over classical algorithms, even if the solution is not perfectly accurate. This approach is particularly relevant in the current era of noisy intermediate-scale quantum (NISQ) computers, where resources are limited and errors are prevalent.

Artificial Atom

In the context of quantum computing, an artificial atom is a human-made structure. It is typically fabricated using superconducting circuits or semiconductor materials. This structure mimics the behavior of a natural atom. These artificial atoms can be engineered to have discrete energy levels, much like their natural counterparts, and can be used as qubits in a quantum computer. Unlike natural atoms, the properties of artificial atoms, such as their energy level spacing and coupling strength to other atoms, can be tailored during the fabrication process. This allows for greater flexibility and control in designing and building quantum computing systems.

Atom Trap

An atom trap is a device used to capture and isolate individual atoms or ions. It typically operates in a vacuum. The trap uses a combination of electric and magnetic fields. These traps can hold atoms in place for extended periods, allowing for precise control and manipulation of their quantum states. Atom traps are essential tools in quantum computing, particularly for trapped-ion and neutral-atom based quantum computers, where individual atoms or ions serve as qubits. The ability to isolate and control individual atoms is crucial for performing quantum operations and maintaining coherence.

Atomic Clock

An atomic clock is a type of clock that uses the frequency of atomic transitions as its timekeeping element. These clocks are among the most accurate timekeeping devices known, as the frequency of atomic transitions is extremely stable and well-defined. Atomic clocks are used in various applications, including GPS satellites, telecommunications, and fundamental scientific research. In the context of quantum computing, atomic clocks can provide precise timing signals for controlling quantum gates and maintaining synchronization between different parts of a quantum computer.

Atomic-Molecular-Optical Physics (AMO)

AMO is the interdisciplinary field that studies the interactions of matter-matter and light-matter at the scale of one or a few atoms and energy scales around a few electron volts. This area of physics is fundamental to the development of quantum technologies, as it provides the theoretical and experimental framework for understanding and controlling the behavior of individual atoms, molecules, and photons. Many quantum computing platforms, such as trapped-ion and neutral-atom systems, are based on principles and techniques developed in AMO physics.

Axion

An axion is a hypothetical elementary particle postulated in particle physics to solve the strong CP problem in quantum chromodynamics. Although originally proposed in a different context, axions have also been suggested as potential candidates for dark matter, the mysterious substance that makes up a significant portion of the universe’s mass. Some theoretical proposals suggest that axions could be used as a basis for building qubits in a quantum computer, leveraging their unique properties and interactions.

BQP (Bounded-Error Quantum Polynomial Time)

BQP, or Bounded-error Quantum Polynomial time, is a complexity class in quantum computing that represents the set of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances. It is the quantum analogue of the classical complexity class BPP (Bounded-error Probabilistic Polynomial time). BQP is important in understanding the power of quantum computation, as it captures the class of problems for which quantum computers are believed to offer a significant advantage over classical computers.

Basis States

In quantum mechanics, basis states are a set of quantum states that form a basis for the state space of a quantum system. Any quantum state of the system can be expressed as a linear combination (superposition) of these basis states. For example, in a qubit, the basis states are typically denoted as |0⟩ and |1⟩, corresponding to the classical bit values 0 and 1. The choice of basis states is not unique, and different bases can be used to describe the same quantum system, depending on the context and the specific problem being studied.

Beam Splitter

A beam splitter is an optical device that splits a beam of light into two or more separate beams. It is a crucial component in many optical setups, including those used in quantum optics and quantum computing. In quantum computing, beam splitters can be used to create superposition states and entangle photons, which are essential resources for quantum information processing. They can also be used to perform quantum measurements and implement quantum gates in photonic quantum computers.

Bell Inequality

Bell inequalities, named after physicist John Stewart Bell, are a set of inequalities that are satisfied by any classical theory that obeys local realism, the principle that physical systems possess definite properties independent of measurement and that influences cannot travel faster than the speed of light. Quantum mechanics predicts that Bell inequalities can be violated, a prediction that has been experimentally confirmed. This violation demonstrates that quantum mechanics cannot be explained by any classical theory based on local realism, highlighting the fundamental non-classical nature of quantum phenomena.

Bell Measurement

A Bell measurement, also known as a Bell state measurement, is a type of quantum measurement that determines which of the four Bell states two qubits are in. The Bell states are a set of four maximally entangled two-qubit states, forming an orthonormal basis for the two-qubit state space. Bell measurements are a crucial component in many quantum information protocols, including quantum teleportation and quantum error correction. They involve entangling the two qubits to be measured with an ancillary qubit and then performing specific single-qubit measurements.

Bell State

A Bell state is one of four specific maximally entangled quantum states of two qubits. They are named after John Stewart Bell and are a fundamental resource in many quantum information processing tasks. The four Bell states form an orthonormal basis for the two-qubit state space and are denoted as: |Φ+⟩, |Φ-⟩, |Ψ+⟩, and |Ψ-⟩. Each Bell state represents a specific combination of entanglement between the two qubits, and they cannot be described as a product of individual qubit states.

Bell’s Theorem

Bell’s theorem, formulated by physicist John Stewart Bell in 1964, is a fundamental result in quantum mechanics that demonstrates the incompatibility of quantum mechanics with local hidden variable theories. The theorem states that no physical theory based on local realism can reproduce all the predictions of quantum mechanics. Bell’s theorem is often expressed in terms of Bell inequalities, which are satisfied by local hidden variable theories but violated by quantum mechanics. Experimental tests of Bell’s theorem have consistently confirmed the predictions of quantum mechanics, providing strong evidence against local realism.

Bloch Sphere

The Bloch sphere is a geometrical representation of the state of a two-level quantum system, typically a qubit. It is a unit sphere where each point on the surface represents a possible pure state of the qubit. The north and south poles of the sphere usually correspond to the basis states |0⟩ and |1⟩, respectively, while points on the equator represent superposition states. The Bloch sphere provides a useful visualization tool for understanding the behavior of qubits and the effect of quantum gates on their states.

Bloch Vector

The Bloch vector is a three-dimensional vector that represents the state of a qubit on the Bloch sphere. Its components are the expectation values of the Pauli operators (X, Y, Z) for the qubit. The length of the Bloch vector is 1 for pure states and less than 1 for mixed states. The direction of the Bloch vector corresponds to the point on the Bloch sphere representing the qubit’s state. The Bloch vector provides a convenient way to visualize the state of a qubit and track its evolution under quantum operations.

Boson

A boson is a type of particle that obeys Bose-Einstein statistics. Unlike fermions, which follow the Pauli exclusion principle and cannot occupy the same quantum state, multiple bosons can occupy the same quantum state simultaneously. Examples of bosons include photons, gluons, and the Higgs boson. In quantum computing, bosons can be used as carriers of quantum information, particularly in photonic quantum computing, where photons are used as qubits. Bosons are also used in some approaches to quantum simulation, such as simulating the behavior of other bosonic systems.

Boson Sampling

Boson sampling is a specific computational problem that involves sampling from the probability distribution of identical bosons (typically photons) scattered by a linear optical network. It was proposed as an intermediate model of quantum computation that is believed to be hard for classical computers to simulate efficiently but can be naturally performed using photonic systems. While not believed to be universal for quantum computation, solving boson sampling problems could demonstrate the quantum computational advantage of photonic systems over classical computers.

Bra-Ket Notation

Bra-ket notation, also known as Dirac notation, is a standard notation for describing quantum states in quantum mechanics. It was introduced by physicist Paul Dirac. In this notation, a “ket,” denoted as |ψ⟩, represents a column vector describing a quantum state, while a “bra,” denoted as ⟨ψ|, represents a row vector corresponding to the complex conjugate transpose of the ket. The inner product of a bra and a ket, denoted as ⟨φ|ψ⟩, represents the probability amplitude of transitioning from state |ψ⟩ to state |φ⟩.

Braiding

Braiding is a topological operation used in topological quantum computing to manipulate the quantum states of anyons. It involves exchanging the positions of anyons in a specific sequence, which results in a change in their quantum state based on the topology of the braid. Unlike simple particle exchanges, the order in which braiding operations are performed is crucial, as different braiding sequences can lead to different quantum states. Braiding operations are used to perform quantum gates in topological quantum computers, leveraging the inherent fault-tolerance of topological systems.

Building Block

In the context of quantum computing, a building block refers to a fundamental component or module that can be used to construct a larger, more complex quantum system. These building blocks can be individual qubits, quantum gates, or even small-scale quantum circuits that perform specific tasks. The concept of building blocks is essential for scaling up quantum computers, as it allows for a modular design approach where complex systems are built by combining simpler, well-characterized components.

Cat State

A cat state, also known as a Schrödinger’s cat state, is a type of coherent superposition state that involves two macroscopically distinguishable states. The name comes from Erwin Schrödinger’s famous thought experiment, where a cat is simultaneously in a superposition of being both alive and dead. In quantum computing, cat states can be created with multiple qubits, where all qubits are in the |0⟩ state plus all qubits in the |1⟩ state, forming a superposition of two distinct states. Cat states are a type of entangled state and can be used to study the boundary between quantum and classical physics.

Cavity Quantum Electrodynamics (cQED)

Cavity quantum electrodynamics (cQED) is a branch of quantum optics that studies the interaction between light and matter in a cavity, typically at the level of single atoms and photons. In cQED, an atom is placed inside a high-quality optical or microwave cavity, where it can interact strongly with the cavity’s electromagnetic field. This strong coupling allows for the coherent transfer of quantum information between the atom and the cavity field, making cQED systems a promising platform for quantum information processing. In superconducting quantum computing, cQED principles are used to couple superconducting qubits to microwave resonators, enabling qubit control and readout.

Charge Qubit

A charge qubit is a type of superconducting qubit where the quantum information is encoded in the charge states of a small superconducting island, also known as a Cooper-pair box. The two basis states of the qubit, |0⟩ and |1⟩, correspond to different numbers of Cooper pairs (pairs of electrons) on the island. Charge qubits were among the first types of superconducting qubits to be experimentally demonstrated. However, they are generally more sensitive to charge noise compared to other types of superconducting qubits, such as flux or transmon qubits.

Chip-Based Quantum Computing

Chip-based quantum computing refers to quantum computing platforms where the qubits and associated control and readout structures are fabricated on a solid-state chip, typically using techniques similar to those used in the semiconductor industry. Superconducting qubits and silicon-based spin qubits are examples of chip-based quantum computing technologies. The advantage of chip-based approaches is their potential for scalability, as the fabrication techniques are well-established and allow for the integration of a large number of qubits on a single chip.

Circuit

In quantum computing, a quantum circuit is a model for quantum computation in which a computation is a sequence of quantum gates, which are reversible transformations on a quantum mechanical analog of an n-bit register. This analogous structure is referred to as an n-qubit register. Quantum circuits are represented graphically, with horizontal lines representing qubits and boxes representing quantum gates acting on those qubits. The order of gates in the circuit determines the sequence of operations performed on the qubits.

Circuit Depth

Circuit depth is a measure of the complexity of a quantum circuit, representing the number of time steps required to execute the circuit on a quantum computer. It is defined as the longest path from any input qubit to any output qubit in the circuit, considering the dependencies between gates. Circuit depth is an important factor in determining the overall runtime of a quantum algorithm, as well as the potential for errors to accumulate during the computation. Minimizing circuit depth is a key consideration in designing efficient quantum algorithms.

Circuit Model

The circuit model of quantum computation is a framework for describing quantum computations in terms of quantum circuits. In this model, a quantum computation is represented as a sequence of quantum gates acting on a set of qubits. The circuit model is the most widely used model for quantum computation and provides a convenient way to design, analyze, and compare quantum algorithms. It is analogous to the circuit model in classical computation, where computations are described in terms of logic gates acting on bits.

Circuit-Based Quantum Computing

Circuit-based quantum computing is an approach to quantum computation where algorithms are implemented as quantum circuits, composed of a sequence of quantum gates acting on qubits. This is the most common and well-developed model of quantum computation. In circuit-based quantum computing, the specific problem being solved is encoded in the structure of the quantum circuit itself. This is in contrast to other models, such as adiabatic quantum computing or measurement-based quantum computing, which use different mechanisms to perform computations.

Classical Computer

A classical computer is a type of computer that uses classical bits as its basic unit of information. Classical computers operate based on the principles of classical physics and use transistors to perform logical operations on bits. They are the standard computers we use in everyday life, from smartphones to supercomputers. Unlike quantum computers, which leverage quantum-mechanical phenomena to perform computations, classical computers cannot efficiently solve certain problems that are believed to be tractable for quantum computers.

Classical Control

In quantum computing, classical control refers to the use of classical computers and electronic systems to control and manipulate the quantum states of qubits. Classical control systems are responsible for sending the necessary signals to apply quantum gates, perform measurements, and manage the overall operation of the quantum computer. While the core computations are performed by the quantum system, classical control is essential for interacting with and extracting information from the quantum computer.

Clock Speed

In the context of quantum computing, clock speed refers to the rate at which quantum gates can be applied to qubits. It is a measure of how quickly a quantum computer can perform operations and is typically measured in hertz (Hz) or cycles per second. Higher clock speeds generally correspond to faster computation times. However, unlike classical computers, where clock speed is a primary determinant of performance, the overall performance of a quantum computer depends on many other factors, such as qubit coherence times, gate fidelity, and connectivity.

Cloud-Based Quantum Computing

www.stockholmresilience.org

pidx.org

m.zhihujingxuan.com

knowledgezone.co.in

2.0 Experimental Advanced. Lacks access to real-time info and some Gemini features.

Cloud-Based Quantum Computing

Cloud-based quantum computing, also known as Quantum Cloud Computing is a model of quantum computing where users can access and use quantum computers or quantum computing resources over the internet, typically through a cloud computing platform. This approach allows researchers, developers, and businesses to experiment with quantum algorithms and applications without needing to invest in their own quantum hardware. Several companies, including IBM, Microsoft, Google, and Amazon, currently offer cloud access to their quantum computing platforms, providing users with a range of tools and resources for developing and running quantum programs.

Coherence

Coherence, in the context of quantum mechanics, refers to the ability of a quantum system to maintain a well-defined phase relationship between different components of its wave function. In quantum computing, coherence is crucial for preserving the superposition states of qubits, which are necessary for performing quantum computations. Loss of coherence, known as decoherence, is a major challenge in building practical quantum computers, as it leads to errors in the computation.

Coherence Time

Coherence time is a measure of how long a quantum system, such as a qubit, can maintain its coherence before it is lost due to interactions with the environment. It is a crucial parameter for quantum computing, as longer coherence times allow for more complex and lengthy quantum computations to be performed before errors become significant. Coherence times vary depending on the specific quantum system and are influenced by factors such as temperature, magnetic fields, and material purity.

Coherent Control

Coherent control is a technique used to manipulate the quantum state of a system by applying external fields in a way that preserves the system’s coherence. In quantum computing, coherent control is used to perform quantum gates on qubits, which involves applying precisely timed pulses of electromagnetic radiation to alter the qubit’s state. Coherent control techniques are essential for implementing quantum algorithms and maintaining the integrity of quantum information during computation.

Coherent State

A coherent state is a specific type of quantum state that exhibits properties similar to those of classical waves. In the context of quantum optics, a coherent state describes the state of a light field that is as close as possible to a classical electromagnetic wave, with well-defined amplitude and phase. Coherent states are often used in quantum information processing, particularly in continuous-variable quantum computing, where they serve as the basis states for encoding and manipulating quantum information.

Cold Atom

Cold atoms are atoms that have been cooled to extremely low temperatures, typically close to absolute zero, using techniques such as laser cooling and evaporative cooling. At these temperatures, the atoms’ motion is significantly reduced, and their quantum properties become more prominent. Cold atoms are used in various quantum technologies, including quantum computing, where they can serve as qubits in neutral-atom quantum computers. Their long coherence times and the ability to trap and manipulate them with high precision make them an attractive platform for quantum information processing.

Compiler

In quantum computing, a quantum compiler is a software tool that translates a high-level quantum algorithm or program into a set of instructions that can be executed on a specific quantum computer. The compiler optimizes the quantum circuit for the target hardware, taking into account factors such as the connectivity of qubits, the available gate set, and the coherence times. Quantum compilers play a crucial role in bridging the gap between abstract quantum algorithms and the physical implementation on quantum hardware.

Complex Conjugate

The complex conjugate of a complex number is obtained by changing the sign of its imaginary part. For example, the complex conjugate of a + bi is a – bi, where a and b are real numbers and i is the imaginary unit. In quantum mechanics, the complex conjugate is used in the definition of the bra vector, which is the complex conjugate transpose of the corresponding ket vector. The complex conjugate is also used in calculating probabilities from quantum amplitudes.

Complexity Class

A complexity class is a set of computational problems that can be solved by a computational model using a certain amount of resources, such as time or memory. In computational complexity theory, problems are classified into different complexity classes based on the resources required to solve them. Examples of classical complexity classes include P, NP, and PSPACE. In quantum computing, there are analogous quantum complexity classes, such as BQP, QMA, and QMA, which characterize the computational power of quantum computers.

Computational Basis

The computational basis, also known as the standard basis or the Z-basis, is the most commonly used basis for representing the states of qubits in quantum computing. It consists of the two basis states |0⟩ and |1⟩, which correspond to the classical bit values 0 and 1, respectively. In this basis, the state of a qubit can be written as a linear combination of |0⟩ and |1⟩, with complex coefficients representing the probability amplitudes.

Computational Complexity Theory

Computational complexity theory is a branch of computer science and mathematics that studies the resources required to solve computational problems. It provides a framework for classifying problems based on their inherent difficulty and for understanding the limitations of computation. Computational complexity theory is relevant to quantum computing, as it helps to identify problems for which quantum computers may offer a significant advantage over classical computers, such as factoring large numbers and searching unsorted databases.

Concurrence

Concurrence is a measure of entanglement for two qubits. It ranges from 0 for a separable state (no entanglement) to 1 for a maximally entangled state, such as a Bell state. Concurrence provides a way to quantify the amount of entanglement between two qubits and is used in the study of quantum entanglement and its applications in quantum information processing.

Conditional Gate

A conditional gate, also known as a controlled gate, is a type of quantum gate that acts on multiple qubits, where the state of one or more control qubits determines the operation performed on the target qubit(s). The most common example is the controlled-NOT (CNOT) gate, where the state of the target qubit is flipped if and only if the control qubit is in the |1⟩ state. Conditional gates are essential for creating entanglement and implementing quantum algorithms.

Connectivity

In the context of quantum computing, connectivity refers to the arrangement and connections between qubits in a quantum computer. It describes which qubits can directly interact with each other through two-qubit gates. Connectivity is an important factor in determining the capabilities and limitations of a quantum computer, as it affects the types of quantum circuits that can be implemented and the efficiency of quantum algorithms. Different quantum computing platforms have different connectivity patterns, such as linear, 2D grid, or all-to-all connectivity.

Continuous-Variable Quantum Computing

Continuous-variable quantum computing is a model of quantum computation that uses continuous degrees of freedom, such as the position and momentum of a particle or the amplitude and phase of a light field, to encode and process quantum information. Unlike qubit-based quantum computing, which uses discrete variables, continuous-variable quantum computing operates on continuous variables, typically represented by coherent states or squeezed states. This approach is particularly well-suited for certain types of quantum simulations and quantum communication protocols.

Control Qubit

In a multi-qubit quantum gate, the control qubit is the qubit that determines whether or not a specific operation is applied to the target qubit(s). For example, in a controlled-NOT (CNOT) gate, the state of the target qubit is flipped if and only if the control qubit is in the |1⟩ state. Control qubits are essential for implementing conditional operations and creating entanglement in quantum circuits.

Controlled-NOT (CNOT) Gate

The controlled-NOT (CNOT) gate is a fundamental quantum gate that operates on two qubits: a control qubit and a target qubit. The CNOT gate flips the state of the target qubit if and only if the control qubit is in the |1⟩ state. It is a key component in many quantum algorithms and is essential for creating entanglement between qubits. The CNOT gate, along with single-qubit gates, forms a universal set of gates for quantum computation, meaning that any quantum operation can be decomposed into a sequence of CNOT and single-qubit gates.

Cooper Pair

A Cooper pair is a pair of electrons (or other fermions) that are bound together at low temperatures in a superconductor. The formation of Cooper pairs is the basis of the Bardeen-Cooper-Schrieffer (BCS) theory of superconductivity. In superconducting quantum computing, Cooper pairs are used to create charge qubits, where the two basis states correspond to different numbers of Cooper pairs on a superconducting island.

Cooper Pair Box

A Cooper pair box is a type of superconducting qubit where the quantum information is encoded in the number of Cooper pairs on a small superconducting island. The island is connected to a superconducting reservoir through a Josephson junction, which allows Cooper pairs to tunnel on and off the island. The two basis states of the qubit correspond to different charge states of the island, typically differing by one Cooper pair. Cooper pair boxes were among the first types of superconducting qubits to be experimentally demonstrated.

Cosmic Ray

Cosmic rays are high-energy particles that originate from outside the Earth’s atmosphere, such as from the Sun or distant galaxies. When cosmic rays interact with the Earth’s atmosphere or with materials on the ground, they can create secondary particles that can cause errors in sensitive electronic devices, including quantum computers. In particular, cosmic rays can induce decoherence and errors in qubits, making them a challenge for the development of fault-tolerant quantum computers. Shielding and error correction techniques are used to mitigate the effects of cosmic rays on quantum computing systems.

Coupler

In a quantum computer, a coupler is a device that mediates the interaction between two or more qubits, allowing for the implementation of multi-qubit gates. Couplers can be either fixed or tunable, depending on whether the coupling strength between the qubits can be adjusted. Tunable couplers are particularly useful for implementing high-fidelity two-qubit gates and for controlling the connectivity of qubits in a quantum processor.

Cross-Resonance Gate

The cross-resonance gate is a type of two-qubit gate used in superconducting quantum computers, particularly in those based on transmon qubits. It involves driving one qubit at the frequency of another qubit, which results in an interaction that can be used to implement a controlled-phase or controlled-NOT gate. The cross-resonance gate is a commonly used entangling gate in IBM’s quantum computing platform.

Cross-Talk

Cross-talk, in the context of quantum computing, refers to unwanted interactions between qubits or between control lines and qubits in a quantum computer. These interactions can lead to errors in the computation, as the state of one qubit may unintentionally affect the state of another qubit. Cross-talk can arise from various sources, such as capacitive or inductive coupling between qubits or from imperfections in the control signals. Minimizing cross-talk is a crucial challenge in designing and operating quantum computers.

Cryogenic

Cryogenic refers to the production and behavior of materials at very low temperatures, typically below -150 degrees Celsius. In quantum computing, cryogenic techniques are used to cool quantum devices, such as superconducting qubits and their associated control and readout electronics, to temperatures near absolute zero. These low temperatures are necessary to reduce thermal noise, which can cause decoherence and errors in qubits. Cryogenic systems, such as dilution refrigerators, are essential components of many quantum computing platforms.

Cryogenic Control Electronics

Cryogenic control electronics refers to the electronic components and systems that are used to control and manipulate qubits in a quantum computer while operating at cryogenic temperatures. These electronics generate the microwave or radio-frequency pulses that are used to apply quantum gates, as well as the signals for reading out the state of qubits. Operating control electronics at cryogenic temperatures, close to the qubits themselves, can improve signal fidelity, reduce latency, and minimize the number of cables needed to connect the quantum processor to room-temperature instruments.

Cryptography

Cryptography is the practice and study of techniques for secure communication in the presence of adversarial behavior. It involves the use of mathematical algorithms to encrypt and decrypt information, ensuring that only authorized parties can access it. Quantum computing has significant implications for cryptography, as quantum algorithms, such as Shor’s algorithm, can break many of the widely used public-key cryptosystems, such as RSA and ECC. This has led to the development of post-quantum cryptography, which aims to develop cryptographic algorithms that are secure against both classical and quantum attacks.

Current-Biased Josephson Junction

A current-biased Josephson junction is a type of Josephson junction where a constant current is applied across the junction. This configuration is commonly used in superconducting quantum computing to create nonlinear elements for building qubits. By adjusting the bias current, the properties of the junction, such as its resonant frequency and inductance, can be tuned. Current-biased Josephson junctions are used in various types of superconducting qubits, including flux qubits and phase qubits.

De Broglie Wavelength

The de Broglie wavelength is a concept in quantum mechanics that describes the wave-like behavior of matter. It states that every particle, such as an electron or an atom, has an associated wavelength that is inversely proportional to its momentum. The de Broglie wavelength is given by the equation λ = h/p, where λ is the wavelength, h is Planck’s constant, and p is the momentum of the particle. This concept is fundamental to understanding the behavior of particles at the quantum level and is relevant to various quantum technologies, including quantum computing.

Decoherence

Decoherence is the loss of coherence in a quantum system due to its interaction with the environment. In quantum computing, decoherence is a major obstacle to building practical quantum computers, as it causes the loss of quantum information encoded in qubits. Decoherence can be caused by various factors, such as thermal noise, electromagnetic interference, and interactions with other particles. Minimizing decoherence is a key challenge in quantum computing, and various techniques, such as error correction and dynamical decoupling, are used to mitigate its effects.

Decoherence-Free Subspace

A decoherence-free subspace (DFS) is a subspace of the Hilbert space of a quantum system that is immune to certain types of decoherence. By encoding quantum information in a DFS, it is possible to protect it from the detrimental effects of the environment. DFSs are typically used in situations where the dominant source of decoherence has a specific symmetry or structure, which can be exploited to design a subspace that is not affected by it. DFSs are an important concept in quantum error correction and fault-tolerant quantum computation.

Density Matrix

The density matrix, also known as the density operator, is a mathematical representation of the state of a quantum system. Unlike the state vector, which can only describe pure states, the density matrix can describe both pure and mixed states. A mixed state is a statistical ensemble of pure states, representing a classical probability distribution over quantum states. The density matrix is a Hermitian, positive semi-definite matrix with a trace equal to 1. It provides a more general framework for describing quantum systems and is particularly useful when dealing with open quantum systems and decoherence.

Depth

In quantum computing, the depth of a quantum circuit is a measure of its complexity, representing the number of time steps required to execute the circuit on a quantum computer. It is defined as the longest path from any input qubit to any output qubit in the circuit, considering the dependencies between gates. Circuit depth is an important factor in determining the overall runtime of a quantum algorithm, as well as the potential for errors to accumulate during the computation. Minimizing circuit depth is a key consideration in designing efficient quantum algorithms.

Diamond Anvil Cell

A diamond anvil cell is a device used in experimental physics and materials science to generate extremely high pressures, often exceeding those found at the center of the Earth. It consists of two opposing diamonds with a sample placed between their culets (tips). By applying force to the diamonds, pressures in the gigapascal range can be achieved. Diamond anvil cells are used to study the behavior of materials under extreme conditions, which can have implications for understanding the properties of materials used in quantum computing, such as superconductors and other novel quantum materials.

Diamond-Based Quantum Computing

Diamond-based quantum computing is an approach to building quantum computers that uses defects in the diamond crystal lattice, such as nitrogen-vacancy (NV) centers, as qubits. NV centers are point defects in diamond where a nitrogen atom replaces a carbon atom, and an adjacent lattice site is vacant. The electronic spin of the NV center can be used as a qubit, and its quantum state can be manipulated and read out using optical and microwave techniques. Diamond-based qubits have long coherence times, even at room temperature, making them a promising platform for quantum computing and quantum sensing.

Digital Quantum Computing

Digital quantum computing is a model of quantum computation that uses a sequence of discrete quantum gates acting on qubits to perform computations. It is analogous to classical digital computing, which uses logic gates acting on bits. In digital quantum computing, a quantum algorithm is implemented as a quantum circuit, which is a sequence of quantum gates applied to a set of qubits. This is the most common and well-developed model of quantum computation, and it is the approach used by most current quantum computing platforms.

Dilution Refrigerator

A dilution refrigerator is a cryogenic device that is used to achieve extremely low temperatures, typically in the millikelvin range. It works by exploiting the unique properties of mixtures of helium-3 and helium-4 isotopes at low temperatures. Dilution refrigerators are essential tools in many areas of experimental physics, including quantum computing. They are used to cool superconducting qubits and their associated control electronics to temperatures close to absolute zero, which is necessary to reduce thermal noise and maintain the coherence of qubits.

Dipole-Dipole Interaction

The dipole-dipole interaction is an interaction between two dipoles, which can be either electric or magnetic. In the context of quantum computing, dipole-dipole interactions can occur between qubits, particularly those based on electric or magnetic dipoles, such as trapped ions or NV centers in diamond. These interactions can be used to implement two-qubit gates, but they can also be a source of cross-talk and errors if not properly controlled. The strength of the dipole-dipole interaction depends on the distance between the dipoles and their relative orientation.

Dirac Notation

Dirac notation, also known as bra-ket notation, is a standard notation for describing quantum states in quantum mechanics. It was introduced by physicist Paul Dirac. In this notation, a “ket,” denoted as |ψ⟩, represents a column vector describing a quantum state, while a “bra,” denoted as ⟨ψ|, represents a row vector corresponding to the complex conjugate transpose of the ket. The inner product of a bra and a ket, denoted as ⟨φ|ψ⟩, represents the probability amplitude of transitioning from state |ψ⟩ to state |φ⟩. Dirac notation is widely used in quantum computing to represent the states of qubits and the operations performed on them.

Distributed Quantum Computing

Distributed quantum computing is an approach to quantum computation that involves connecting multiple small-scale quantum processors together to form a larger, more powerful quantum computer. This is analogous to distributed computing in classical computers, where multiple processors are connected to work together on a computational task. Distributed quantum computing can potentially overcome some of the challenges associated with building large-scale monolithic quantum computers, such as the difficulty of maintaining coherence and control over a large number of qubits. It also allows for modularity and scalability in the design of quantum computingSources and related content

www.docsity.com

brainly.com

2.0 Experimental Advanced. Lacks access to real-time info and some Gemini features.

Distributed Quantum Computing

Dynamical Decoupling

Dynamical decoupling is a technique used to suppress decoherence and extend the coherence time of qubits in a quantum computer. It involves applying a sequence of carefully timed control pulses to the qubits, which effectively average out the interactions between the qubits and the environment that cause decoherence. Dynamical decoupling is similar to spin echo techniques used in nuclear magnetic resonance (NMR) and can significantly improve the performance of quantum computers by reducing errors due to decoherence.

D-Wave Systems

D-Wave Systems is a Canadian quantum computing company that develops and sells quantum annealing computers. Their systems are based on superconducting flux qubits and are designed to solve optimization problems using the principle of quantum annealing. D-Wave’s quantum computers have been used by various organizations for research and for solving specific types of optimization problems. While D-Wave’s systems have been subject to debate regarding their quantum nature and performance advantages over classical computers, they represent a unique approach to quantum computation.

Electron Spin

Electron spin is an intrinsic form of angular momentum carried by electrons, a fundamental property in quantum mechanics. It is a purely quantum mechanical phenomenon with no classical analogue. Electron spin is quantized, meaning it can only take on specific discrete values. Typically, it is described as either “spin up” or “spin down.” In quantum computing, the spin of an electron can be used as a qubit, where the two spin states represent the |0⟩ and |1⟩ states. Electron spin qubits can be implemented in various platforms, such as quantum dots and defects in diamond.

Electron Spin Resonance (ESR)

Electron spin resonance (ESR), also known as electron paramagnetic resonance (EPR), is a spectroscopic technique used to study materials with unpaired electrons. It is based on the principle that unpaired electrons have a magnetic moment and can absorb electromagnetic radiation when placed in a magnetic field. ESR is used in various fields, including chemistry, biology, and materials science. In quantum computing, ESR can be used to manipulate and read out the state of electron spin qubits, particularly in systems like nitrogen-vacancy centers in diamond.

Emulation

In the context of quantum computing, emulation refers to the use of classical computers to simulate the behavior of quantum systems. Quantum emulators are software programs that run on classical hardware but mimic the behavior of quantum circuits and algorithms. Emulation is a valuable tool for studying small-scale quantum systems, developing and testing quantum algorithms, and validating the performance of quantum hardware. However, due to the exponential growth of the quantum state space with the number of qubits, classical emulation of large quantum systems is generally intractable.

Energy Gap

The energy gap in a quantum system refers to the difference in energy between the ground state (the lowest energy state) and the first excited state. In many quantum systems, such as atoms and molecules, the energy levels are discrete, and there is a finite energy gap between them. The size of the energy gap is an important property of a quantum system and can affect its behavior and stability. In superconducting qubits, for example, a larger energy gap can help to reduce the effects of thermal noise and improve coherence times.

Entanglement

Entanglement is a fundamental phenomenon in quantum mechanics where two or more quantum particles become correlated in such a way that their quantum states cannot be described independently, even when the particles are separated by large distances. In an entangled state, the properties of the particles are linked, and measuring the state of one particle instantaneously determines the state of the other, regardless of the distance between them. Entanglement is a crucial resource in quantum computing and is used in many quantum algorithms, such as quantum teleportation and superdense coding.

Entanglement Distillation

Entanglement distillation is a process in quantum information theory that aims to create a smaller number of highly entangled states from a larger number of less entangled states. It is a crucial technique for quantum communication and quantum computing, as it allows for the purification of entanglement, which can be degraded due to noise and decoherence. Entanglement distillation protocols typically involve performing local operations and classical communication (LOCC) on multiple copies of entangled states to obtain a smaller set of states with higher entanglement.

Entanglement Entropy

Entanglement entropy is a measure of the degree of entanglement between two subsystems of a larger quantum system. It quantifies the amount of information that is shared between the two subsystems due to entanglement. Entanglement entropy is typically calculated by dividing the system into two parts, A and B, and then calculating the von Neumann entropy of the reduced density matrix of one of the subsystems (e.g., subsystem A). If the entanglement entropy is zero, the two subsystems are not entangled. If it is maximal, the two subsystems are maximally entangled.

Entanglement Fidelity

Entanglement fidelity is a measure of how closely a given entangled state resembles a desired or ideal entangled state, such as a Bell state. It quantifies the quality of entanglement and is often used to characterize the performance of quantum gates and quantum communication protocols. Entanglement fidelity is typically defined as the overlap between the actual entangled state and the target entangled state, and it ranges from 0 (no resemblance) to 1 (perfect fidelity).

Entanglement Swapping

Entanglement swapping is a quantum protocol that allows for the creation of entanglement between two particles that have never directly interacted. It involves performing a joint measurement on two particles, each of which is entangled with another particle. This measurement projects the two particles into an entangled state, effectively “swapping” the entanglement from the original pairs to the new pair. Entanglement swapping is a key component in quantum repeaters, which are used to extend the range of quantum communication.

Entangling Gate

An entangling gate is a type of quantum gate that creates entanglement between two or more qubits. The most common example of an entangling gate is the controlled-NOT (CNOT) gate, which acts on two qubits and flips the state of the target qubit if and only if the control qubit is in the |1⟩ state. Entangling gates are essential for quantum computation, as entanglement is a crucial resource for many quantum algorithms. A universal set of quantum gates must include at least one entangling gate, along with a set of single-qubit gates.

Environmental Noise

Environmental noise, in the context of quantum computing, refers to the unwanted interactions between a quantum system and its surrounding environment. These interactions can lead to decoherence, which is the loss of quantum information and the degradation of the performance of a quantum computer. Sources of environmental noise include thermal fluctuations, electromagnetic interference, and interactions with other particles. Minimizing the effects of environmental noise is a major challenge in building and operating quantum computers.

Error Correction

Quantum error correction is a set of techniques used to protect quantum information from errors caused by decoherence and other quantum noise. It involves encoding quantum information in a larger number of physical qubits, such that errors can be detected and corrected without destroying the encoded information. Quantum error correction codes, such as the surface code and the color code, are designed to detect and correct errors that occur during quantum computation. Error correction is essential for building fault-tolerant quantum computers that can perform complex computations reliably.

Error Detection

Error detection, in the context of quantum computing, refers to the process of identifying the occurrence of errors in a quantum computation without necessarily correcting them. It is a crucial component of quantum error correction. Error detection typically involves performing measurements on ancilla qubits that are entangled with the data qubits in a specific way. The measurement outcomes reveal information about the errors that have occurred, without revealing the encoded quantum information itself.

Error Mitigation

Error mitigation is a set of techniques used to reduce the impact of errors on the results of quantum computations, without necessarily performing full error correction. Unlike error correction, which aims to detect and correct individual errors, error mitigation techniques typically involve post-processing the results of a quantum computation to remove or reduce the effects of errors. Examples of error mitigation techniques include zero-noise extrapolation, probabilistic error cancellation, and symmetry verification. Error mitigation is particularly useful for near-term quantum computers that do not have the resources to implement full error correction.

Error Rate

In quantum computing, the error rate refers to the probability that a quantum gate or a quantum operation will introduce an error into the computation. Error rates are typically specified per gate or per qubit and can vary depending on the specific quantum computing platform and the type of operation being performed. Lower error rates are desirable, as they lead to more reliable quantum computations. Error rates are a key factor in determining the feasibility of implementing quantum error correction and achieving fault tolerance.

Error Syndrome

In quantum error correction, the error syndrome is the information obtained from measurements performed on ancilla qubits that is used to diagnose the errors that have occurred on the data qubits. The error syndrome provides information about the type and location of errors without revealing the encoded quantum information. By analyzing the error syndrome, it is possible to determine the appropriate error correction operations to apply to the data qubits to restore the encoded state.

Exchange Interaction

The exchange interaction is a quantum mechanical effect that arises between identical particles, such as electrons. It is a consequence of the Pauli exclusion principle, which states that two identical fermions cannot occupy the same quantum state simultaneously. The exchange interaction can be either attractive or repulsive, depending on the relative spin orientation of the particles. In quantum computing, the exchange interaction can be used to implement two-qubit gates in certain types of qubits, such as those based on electron spins in quantum dots.

Excited State

In quantum mechanics, an excited state is any quantum state of a system that has a higher energy than the ground state (the lowest-energy state). Excited states are typically unstable and will eventually decay to the ground state, emitting energy in the process, such as a photon. In quantum computing, qubits are typically initialized in their ground state, and quantum gates are used to manipulate the qubits and create superpositions and entangled states involving excited states.

Exciton

An exciton is a bound state of an electron and a hole (the absence of an electron) in a semiconductor or insulator. It is a quasiparticle that can transport energy but not charge. Excitons can be created by the absorption of a photon, which promotes an electron from the valence band to the conduction band, leaving behind a hole. Excitons have been proposed as a potential platform for quantum computing, where the presence or absence of an exciton in a quantum dot could represent the |1⟩ or |0⟩ state of a qubit.

Fault Tolerance

Fault tolerance, in the context of quantum computing, refers to the ability of a quantum computer to perform reliable computations even in the presence of errors and imperfections in the hardware. Fault-tolerant quantum computation is achieved through the use of quantum error correction codes and specific architectural designs that ensure that errors do not propagate uncontrollably through the system. Achieving fault tolerance is a major goal in the development of practical quantum computers, as it is necessary for performing complex and lengthy quantum computations.

Distributed Quantum Computing

Dynamical Decoupling

D-Wave Systems

Electron Spin

Electron Spin Resonance (ESR)

Emulation

Energy Gap

Entanglement

Entanglement Distillation

Entanglement Entropy

Entanglement Fidelity

Entanglement Swapping

Entangling Gate

Environmental Noise

Error Correction

Error Detection

Error Mitigation

Error Rate

Error Syndrome

Exchange Interaction

Excited State

Exciton

Fault Tolerance

Fault-Tolerant Quantum Computing

Fault-tolerant quantum computing is an approach to quantum computation that can reliably perform computations even in the presence of noise and errors. It involves using quantum error correction codes to encode quantum information in a way that is resilient to errors and employing specific protocols for performing quantum gates and measurements that do not allow errors to propagate uncontrollably. Fault-tolerant quantum computing is essential for building large-scale, practical quantum computers that can solve complex problems beyond the reach of classical computers.

Fermion

A fermion is a type of particle that obeys Fermi-Dirac statistics and follows the Pauli exclusion principle, which states that two identical fermions cannot occupy the same quantum state simultaneously. Electrons, protons, and neutrons are examples of fermions. In contrast, bosons are particles that obey Bose-Einstein statistics and do not follow the Pauli exclusion principle. In the context of quantum computing, fermions can be simulated using qubits, and there are proposals for using fermionic systems directly for quantum computation.

Fidelity

In quantum computing, fidelity is a measure of how closely a given quantum state or quantum operation resembles a desired or ideal state or operation. It quantifies the accuracy and reliability of quantum gates, quantum state preparation, and quantum measurements. Fidelity is typically defined as the overlap between the actual state or operation and the target state or operation, and it ranges from 0 (no resemblance) to 1 (perfect fidelity). High fidelity is crucial for building reliable and fault-tolerant quantum computers.

Field-Programmable Gate Array (FPGA)

A field-programmable gate array (FPGA) is an integrated circuit that can be reconfigured after manufacturing, allowing for the implementation of custom digital circuits. FPGAs consist of an array of programmable logic blocks and a hierarchy of reconfigurable interconnects that allow the blocks to be connected in various configurations. In quantum computing, FPGAs are often used for classical control and readout of qubits, as well as for implementing parts of the quantum error correction protocols. They provide a flexible and high-performance platform for interfacing between classical control systems and quantum hardware.

Flux Qubit

A flux qubit is a type of superconducting qubit where the quantum information is encoded in the direction of a persistent supercurrent flowing in a superconducting loop interrupted by one or more Josephson junctions. The two basis states of the qubit, |0⟩ and |1⟩, correspond to clockwise and counterclockwise supercurrents, respectively. Flux qubits are typically controlled and measured using magnetic fields and microwave pulses. They are known for their relatively long coherence times and are one of the main types of qubits used in superconducting quantum computers.

Fluxon

A fluxon, also known as a magnetic flux quantum, is a quantum of magnetic flux that can exist in certain superconducting systems, such as a long Josephson junction or a type-II superconductor. The magnetic flux of a fluxon is quantized and equal to h/2e, where h is Planck’s constant and e is the elementary charge. Fluxons can be used to create and manipulate quantum states in superconducting circuits and have been proposed as a potential platform for quantum computing.

Fourier Transform

The Fourier transform is a mathematical operation that decomposes a function of time (or space) into its constituent frequencies. It is widely used in signal processing, physics, and engineering. In quantum computing, the quantum Fourier transform (QFT) is a quantum algorithm that performs the discrete Fourier transform on a quantum state. The QFT is a key component of many quantum algorithms, including Shor’s algorithm for factoring large numbers and the quantum phase estimation algorithm.

Frequency-Tunable Qubit

A frequency-tunable qubit is a type of qubit whose energy level spacing, and thus its operating frequency, can be adjusted by applying an external control parameter, such as a magnetic field or a voltage. This tunability allows for precise control over the qubit’s properties and can be used to optimize its performance, reduce cross-talk with other qubits, and implement certain types of quantum gates. Many types of superconducting qubits, such as transmon qubits and flux qubits, are frequency-tunable.

Full Adder

A full adder is a fundamental component in digital electronics that performs the addition of three binary digits: two input bits and a carry-in bit from a previous addition. It produces two outputs: a sum bit and a carry-out bit. Full adders are used as building blocks to construct more complex arithmetic circuits, such as ripple-carry adders and carry-lookahead adders. In quantum computing, quantum full adders can be implemented using quantum gates to perform arithmetic operations on quantum states.

Gate

In quantum computing, a quantum gate is a basic quantum circuit operating on a small number of qubits. Quantum gates are the building blocks of quantum circuits, analogous to classical logic gates for conventional digital circuits. Quantum gates are unitary transformations that manipulate the quantum state of qubits. Examples include single-qubit gates like the Hadamard gate and Pauli gates, and multi-qubit gates like the CNOT gate and the Toffoli gate. Quantum gates are used to implement quantum algorithms and perform quantum computations.

Gate Decomposition

Gate decomposition is the process of breaking down a complex quantum gate or quantum circuit into a sequence of simpler, more elementary gates that are native to a specific quantum computing platform. Since quantum computers typically have a limited set of native gates that can be directly implemented, gate decomposition is necessary to translate arbitrary quantum algorithms into a form that can be executed on the hardware. Efficient gate decomposition is important for minimizing the depth and complexity of quantum circuits and for reducing the accumulation of errors during computation.

Gate Error

A gate error is an imperfection in the implementation of a quantum gate that causes the actual operation performed on the qubits to deviate from the ideal, intended operation. Gate errors can arise from various sources, such as miscalibration of control signals, unwanted interactions between qubits, and decoherence.

Gate Set

A gate set is a collection of quantum gates that can be used to construct quantum circuits. A universal gate set is a gate set that can be used to implement any possible quantum computation, up to arbitrary precision. An example of a universal gate set is the combination of the Hadamard gate, the T gate, and the CNOT gate. Different quantum computing platforms may have different native gate sets, which are the gates that can be directly implemented on the hardware.

Global Control

Global control, in the context of quantum computing, refers to the ability to apply the same quantum operation simultaneously to all qubits in a quantum computer, or to a large subset of qubits. Global control can simplify the implementation of certain quantum algorithms and reduce the number of control lines required. However, it can also be a source of errors if the control field is not uniform across all qubits or if it unintentionally affects qubits that should not be manipulated.

Gottesman-Knill Theorem

The Gottesman-Knill theorem is a result in quantum computing theory that states that any quantum computation that involves only operations from a specific set, known as Clifford operations (which includes gates like the Hadamard, CNOT, and phase gates), can be efficiently simulated on a classical computer. This implies that quantum computers need to use non-Clifford operations, such as the T gate, to achieve a computational advantage over classical computers. The Gottesman-Knill theorem is important for understanding the boundary between classical and quantum computation and for developing techniques for verifying and validating quantum computers.

Ground State

The ground state of a quantum system is its lowest-energy state. It is the state that the system will naturally tend to occupy in the absence of external perturbations or excitations. In quantum computing, qubits are typically initialized in their ground state before the start of a computation. The ground state is often denoted as |0⟩ for a single qubit and |00…0⟩ for a multi-qubit system.

Grover’s Algorithm

Grover’s algorithm is a quantum algorithm for searching an unsorted database with N entries in O(√N) time and using O(log N) storage space. It provides a quadratic speedup over the best possible classical algorithm, which requires O(N) time. Grover’s algorithm uses the principle of amplitude amplification to iteratively increase the probability of measuring the desired state. It is one of the key quantum algorithms and has applications in various areas, including optimization, machine learning, and cryptography.

Hadamard Gate

The Hadamard gate is a single-qubit quantum gate that creates a superposition state. When applied to a qubit in the |0⟩ state, it produces an equal superposition of |0⟩ and |1⟩, and when applied to a qubit in the |1⟩ state, it produces an equal superposition of |0⟩ and -|1⟩. The Hadamard gate is represented by a 2×2 matrix and is often used as the first gate in many quantum algorithms to create an initial superposition of all possible states.

Hamiltonian

In quantum mechanics, the Hamiltonian is an operator that corresponds to the total energy of a system. It describes the time evolution of the system through the Schrödinger equation. The Hamiltonian typically consists of two parts: the kinetic energy and the potential energy. In quantum computing, the Hamiltonian of a system can be engineered to encode a specific computational problem, such as in adiabatic quantum computation or quantum simulation.

Hardware-Efficient Ansatz

A hardware-efficient ansatz is a type of variational quantum circuit that is designed to take advantage of the specific architecture and native gate set of a particular quantum computing platform. It typically consists of a sequence of parameterized single-qubit and two-qubit gates that can be efficiently implemented on the hardware. Hardware-efficient ansätze are often used in variational quantum algorithms, such as the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA), to find approximate solutions to optimization and quantum chemistry problems.

High-Performance Computing (HPC)

High-performance computing (HPC) refers to the use of powerful computing systems, often supercomputers, to solve complex computational problems that require a large amount of processing power and memory. HPC systems are used in various fields, such as scientific research, engineering, and finance, to perform simulations, data analysis, and other computationally intensive tasks. In the context of quantum computing, HPC systems can be used to simulate quantum systems, develop and test quantum algorithms, and process the data generated by quantum computers.

Hilbert Space

Hilbert space is a mathematical concept used in quantum mechanics to describe the state space of a quantum system. It is a complex vector space with an inner product that allows for the calculation of probabilities and expectation values. Each point in Hilbert space represents a possible state of the quantum system, and the evolution of the system is described by the movement of this point in Hilbert space. The dimension of the Hilbert space grows exponentially with the number of qubits in a quantum system, which is one of the reasons why quantum computers are potentially more powerful than classical computers for certain tasks.

Hole Spin Qubit

A hole spin qubit is a type of qubit that uses the spin of a hole (the absence of an electron) in a semiconductor material, such as silicon or germanium, to encode quantum information. Hole spin qubits are similar to electron spin qubits but have some potential advantages, such as weaker coupling to nuclear spins and the possibility of faster gate operations due to stronger spin-orbit coupling. Hole spin qubits are typically implemented in quantum dot structures and are a promising platform for solid-state quantum computing.

Hybrid Quantum-Classical Algorithm

A hybrid quantum-classical algorithm is a type of algorithm that combines both quantum and classical computations to solve a problem. In these algorithms, a quantum computer is used to perform specific parts of the computation that are believed to be more efficient on a quantum device, while a classical computer is used to perform other parts of the computation and to control the overall execution of the algorithm. Variational quantum algorithms, such as VQE and QAOA, are examples of hybrid quantum-classical algorithms, where a quantum computer is used to prepare and measure quantum states, while a classical computer is used to optimize the parameters of the quantum circuit.

Hybrid Quantum Computing

Hybrid quantum computing refers to an approach to quantum computation that integrates quantum computers with classical computing resources, such as CPUs, GPUs, and FPGAs, to solve computational problems. In this approach, quantum computers are used as specialized accelerators to perform specific tasks that are more efficient on quantum hardware, while classical computers are used for other parts of the computation, as well as for pre- and post-processing of data. Hybrid quantum computing aims to leverage the strengths of both quantum and classical computing to tackle complex problems that are beyond the reach of either technology alone.

Hydrogen-like Atom

A hydrogen-like atom, also known as a hydrogenic atom, is an atom that consists of a single electron orbiting a nucleus with a positive charge of Ze, where Z is the atomic number and e is the elementary charge. Hydrogen-like atoms are the simplest atomic systems and can be solved analytically using the Schrödinger equation. They serve as a fundamental model in quantum mechanics and are used to understand the behavior of more complex atoms and molecules. In quantum computing, the energy levels of hydrogen-like atoms can be used to create artificial atoms or qubits for quantum information processing.

Hyperfine Interaction

The hyperfine interaction is a small interaction between the magnetic moment of an electron and the magnetic moment of the nucleus in an atom or ion. This interaction causes a splitting of the energy levels of the atom, known as the hyperfine structure. The hyperfine interaction can be used to manipulate and control the quantum state of electron spin qubits, particularly in systems like nitrogen-vacancy centers in diamond and phosphorus donors in silicon. The hyperfine splitting can also serve as a long-lived quantum memory, as the nuclear spin states are often less susceptible to decoherence than electron spin states.

Impurities

In materials science, impurities are atoms or molecules that are different from the primary constituents of a material. Impurities can be intentionally introduced into a material to modify its properties, or they can be present unintentionally as defects. In the context of quantum computing, impurities in solid-state systems, such as nitrogen-vacancy centers in diamond or dopants in silicon, can be used as qubits. The electronic or nuclear spins associated with these impurities can store and process quantum information.

Initialization

Initialization, in the context of quantum computing, refers to the process of preparing a quantum system, such as a set of qubits, in a well-defined initial state before the start of a computation. Typically, qubits are initialized in their ground state, which is often denoted as |0⟩. Initialization is a crucial step in quantum computation, as the accuracy and reliability of the computation depend on starting from a known and well-defined state. Various techniques are used to initialize qubits, depending on the specific quantum computing platform.

Integrated Photonics

Integrated photonics is a field of technology that involves the fabrication of photonic devices and circuits on a single chip, typically using semiconductor materials like silicon. It is analogous to integrated circuits in electronics, where multiple electronic components are integrated on a single chip. Integrated photonics is used to create compact, scalable, and energy-efficient optical systems for various applications, including telecommunications, sensing, and signal processing. In quantum computing, integrated photonics can be used to build photonic quantum computers, where photons are used as qubits, and to create on-chip components for manipulating and measuring quantum states.

Interference

Interference is a fundamental phenomenon in wave mechanics where two or more waves superpose to form a resultant wave of greater, lower, or the same amplitude. In quantum mechanics, particles like electrons and photons can exhibit wave-like behavior and undergo interference. Interference is a key concept in quantum computing and is exploited in many quantum algorithms, such as the quantum Fourier transform and Grover’s algorithm. By manipulating the phases of quantum states, constructive and destructive interference can be used to amplify the probability of measuring the desired outcome.

Interferometer

An interferometer is an instrument that uses the interference of waves, typically light waves, to make precise measurements of distance, displacement, or refractive index. Interferometers are widely used in various fields, including physics, astronomy, and engineering. In quantum optics and quantum computing, interferometers can be used to manipulate and measure the quantum states of photons. For example, a Mach-Zehnder interferometer can be used to create and analyze superposition states of photons, which are essential for photonic quantum computing.

Ion Trap

An ion trap is a device used to confine and isolate individual ions (charged atoms or molecules) in a vacuum using electromagnetic fields. Ion traps typically use a combination of static and oscillating electric fields to create a potential well that traps the ions in a small region of space. Ion traps are used in various applications, including mass spectrometry, precision spectroscopy, and quantum computing. In trapped-ion quantum computing, individual ions are trapped and used as qubits, with their electronic states or motional modes encoding quantum information.

Ion Trap Quantum Computing

Ion trap quantum computing is an approach to building quantum computers that uses trapped ions as qubits. In this approach, individual ions are confined in an ion trap using electromagnetic fields, and their electronic states or motional modes are used to encode quantum information. Quantum gates are implemented by applying laser or microwave pulses to manipulate the quantum states of the ions. Trapped-ion quantum computers have demonstrated long coherence times, high gate fidelities, and all-to-all connectivity, making them a promising platform for scalable quantum computation.

Josephson Effect

The Josephson effect is a quantum mechanical phenomenon that occurs when two superconductors are separated by a thin insulating barrier, forming a Josephson junction. It predicts that a supercurrent can flow across the junction even in the absence of an external voltage, and that the application of a voltage across the junction will cause the supercurrent to oscillate at a frequency proportional to the voltage. The Josephson effect is a fundamental component of superconducting quantum computing, as Josephson junctions are used to create nonlinear elements for building superconducting qubits.

Josephson Energy

The Josephson energy is a characteristic energy scale associated with a Josephson junction, which is a device consisting of two superconductors separated by a thin insulating barrier. It represents the coupling strength between the two superconductors and is proportional to the critical current of the junction. The Josephson energy, along with the charging energy, determines the behavior of superconducting qubits, such as the transmon. By adjusting the ratio of the Josephson energy to the charging energy, the properties of the qubit, such as its anharmonicity and sensitivity to noise, can be tuned.

Josephson Junction

A Josephson junction is a device consisting of two superconductors separated by a thin insulating barrier. It exhibits the Josephson effect, where a supercurrent can flow across the junction even in the absence of an external voltage, and the application of a voltage across the junction causes the supercurrent to oscillate at a frequency proportional to the voltage. Josephson junctions are fundamental components in superconducting quantum computing, where they are used as nonlinear elements to create qubits, such as the transmon qubit. The properties of a Josephson junction, such as its critical current and Josephson energy, can be engineered during fabrication to optimize the performance of superconducting qubits.

Kernel

In the context of quantum machine learning, a kernel is a function that computes the similarity between two data points in a high-dimensional feature space. Kernels are used in kernel methods, such as support vector machines (SVMs), to perform non-linear classification and regression. Quantum kernels are quantum algorithms that compute kernels using quantum computers, potentially offering advantages over classical kernels by exploiting the high dimensionality of quantum state spaces.

Ket

A ket is a notation used in quantum mechanics to represent a quantum state. It is denoted by the symbol |ψ⟩, where ψ represents the state of the system. Kets are vectors in a complex Hilbert space, and they can be manipulated using linear algebra. The corresponding concept to a ket is a bra, denoted by ⟨ψ|, which is a linear functional that maps kets to complex numbers. The inner product of a bra and a ket, ⟨φ|ψ⟩, gives the probability amplitude of transitioning from state |ψ⟩ to state |φ⟩.

Key Distribution

Key distribution, in the context of cryptography, is the process of securely sharing a secret key between two or more parties. The security of many cryptographic systems relies on the secrecy of the key, so it is crucial to distribute the key in a way that prevents eavesdropping or interception. Quantum key distribution (QKD) is a method of key distribution that uses the principles of quantum mechanics to ensure the security of the key exchange. QKD protocols, such as BB84 and E91, can detect the presence of an eavesdropper and guarantee the confidentiality of the shared key.

Kitaev’s Toric Code

Kitaev’s toric code is a type of topological quantum error-correcting code introduced by Alexei Kitaev. It is defined on a two-dimensional lattice of qubits, typically arranged in a square or honeycomb pattern with periodic boundary conditions (forming a torus). The toric code has two types of stabilizer operators, called star and plaquette operators, which are defined on the vertices and faces of the lattice, respectively. The code space of the toric code is the simultaneous +1 eigenspace of all these stabilizer operators. The toric code is notable for its ability to protect against local errors and for its connection to topological phases of matter.

Klystron

A klystron is a specialized linear-beam vacuum tube, used as an amplifier for high-frequency radio waves (microwaves). Klystrons are used to generate the microwave pulses that are used to control and manipulate superconducting qubits. They are an essential component of the classical control electronics in superconducting quantum computing platforms.

Kramers Pair

A Kramers pair refers to a pair of time-reversed states in a quantum system with half-integer spin. According to Kramers’ theorem, in the presence of time-reversal symmetry and in the absence of magnetic fields, every energy level of such a system is at least doubly degenerate. This degeneracy is known as Kramers degeneracy. Kramers pairs can be used to encode robust qubits that are protected from certain types of noise.

Lagrangian

In classical mechanics, the Lagrangian is a function that describes the state of a physical system in terms of its generalized coordinates and their time derivatives. It is defined as the difference between the kinetic energy and the potential energy of the system. In quantum mechanics, the Lagrangian formalism can be used to derive the equations of motion for quantum systems, such as the Schrödinger equation. The Lagrangian is also used in the path integral formulation of quantum mechanics.

Lamb Shift

The Lamb shift is a small difference in energy between two energy levels, 2S_1/2 and 2P_1/2, of the hydrogen atom, which are predicted to be degenerate by the Dirac equation. The Lamb shift was first measured by Willis Lamb and Robert Retherford in 1947 and is caused by the interaction of the electron with the quantum fluctuations of the electromagnetic field. The discovery of the Lamb shift was a key development in the advancement of quantum electrodynamics (QED).

Landau-Zener Transition

A Landau-Zener transition is a non-adiabatic transition between two energy levels of a quantum system. It occurs when the system’s Hamiltonian is varied slowly in time. The probability of the transition depends on the rate of change of the Hamiltonian and the energy gap between the levels. Landau-Zener transitions are important in various quantum systems and can be used to manipulate and control the quantum states of qubits.

Landauer’s Principle

Landauer’s principle is a physical principle that relates the erasure of information to the dissipation of heat. It states that any logically irreversible manipulation of information, such as the erasure of a bit, must be accompanied by a corresponding¹ increase in entropy of the non-information-bearing degrees of freedom of the information-processing apparatus or its environment. Specifically, erasing one bit of information requires dissipating at least kT ln 2 of heat, where k is Boltzmann’s constant and T is the temperature. Landauer’s principle has implications for the energy efficiency of both classical and quantum computing.

1. researchain.net

researchain.net

Laser Cooling

Laser cooling is a technique used to cool atoms to extremely low temperatures, typically in the microkelvin or nanokelvin range. It works by using laser light to slow down the motion of atoms, reducing their kinetic energy and thus their temperature. Laser cooling is used in various areas of physics, including atomic clocks, Bose-Einstein condensation, and quantum computing with trapped ions or neutral atoms.

Lattice

In the context of quantum computing and condensed matter physics, a lattice refers to a regular, repeating arrangement of points or objects in space. Lattices are used to model the structure of crystals, where atoms are arranged in a periodic pattern. In quantum computing, lattices can be used to define the connectivity of qubits in certain architectures, such as those based on trapped ions or neutral atoms. Lattice models, such as the toric code, are also used in quantum error correction.

Lattice Gauge Theory

Lattice gauge theory is a theoretical framework for studying gauge theories, such as quantum chromodynamics (QCD), by discretizing spacetime into a lattice. In lattice gauge theory, the fields are defined on the sites or links of the lattice, and the gauge symmetry is preserved by the lattice structure. Lattice gauge theory allows for non-perturbative calculations of quantities in QCD, such as hadron masses, using numerical simulations on classical computers. It has also been proposed as a potential application for quantum computers.

Leakage

Leakage, in quantum computing, refers to the unwanted transition of a qubit out of the two-dimensional computational subspace (|0⟩ and |1⟩) into higher energy levels. Leakage can occur due to various factors, such as strong driving fields or interactions with the environment. It is a type of error that can affect the fidelity of quantum gates and the overall performance of a quantum computer. Leakage errors are particularly challenging to deal with because they take the qubit out of the computational space, making standard quantum error correction techniques ineffective.

Leggett-Garg Inequality

The Leggett-Garg inequality is a mathematical inequality that is satisfied by any macroscopic realistic theory, which assumes that a system always possesses definite properties independent of measurement (macrorealism) and that measurements can be performed non-invasively. Like Bell’s inequality, the Leggett-Garg inequality can be violated by quantum mechanics, demonstrating the incompatibility of quantum mechanics with the assumptions of macrorealism. Experimental tests of the Leggett-Garg inequality have confirmed the predictions of quantum mechanics.

Level Repulsion

Level repulsion is a phenomenon in quantum mechanics where the energy levels of a quantum system tend to avoid crossing each other as a parameter in the Hamiltonian is varied. Instead of crossing, the energy levels exhibit an “avoided crossing,” where they come close together but then repel each other. Level repulsion is a consequence of the non-crossing rule and is a signature of quantum chaos in some systems.

Lindblad Equation

The Lindblad equation, also known as the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) equation, is a general form of a master equation that describes the time evolution of the density matrix of an open quantum system. It takes into account the effects of decoherence and dissipation due to the interaction of the system with its environment. The Lindblad equation is widely used to model the dynamics of open quantum systems, including quantum computing systems subject to noise and decoherence.

Linear Optics

Linear optics is a branch of optics that deals with optical systems in which the output is linearly related to the input. In linear optical systems, the superposition principle holds, meaning that the response to a sum of inputs is equal to the sum of the responses to each input individually. Linear optics is used in various quantum information processing applications, such as linear optical quantum computing (LOQC), where quantum information is encoded in the states of photons, and quantum gates are implemented using beam splitters, phase shifters, and other linear optical elements.

Linear Optical Quantum Computing (LOQC)

Linear optical quantum computing (LOQC) is a model of quantum computation that uses photons as qubits and linear optical elements, such as beam splitters and phase shifters, to implement quantum gates. LOQC is based on the principles of linear optics and the quantum properties of light. While LOQC is a promising approach to quantum computing, it faces challenges related to the probabilistic nature of certain gates and the difficulty of creating strong interactions between photons.

Linear Paul Trap

A linear Paul trap is a type of ion trap that uses a combination of static and oscillating electric fields to confine ions in a linear configuration. The ions are trapped along a central axis by a combination of a static quadrupole field and a radio-frequency (RF) field. Linear Paul traps are commonly used in trapped-ion quantum computing, where each ion represents a qubit, and quantum gates are implemented using laser beams that couple to the ions’ internal electronic states and their collective motional modes.

Liquid State NMR Quantum Computer

A liquid-state nuclear magnetic resonance (NMR) quantum computer is a type of quantum computer that uses the nuclear spins of molecules in a liquid solution as qubits. Quantum gates are implemented by applying radio-frequency pulses that manipulate the nuclear spins through their magnetic interactions. Liquid-state NMR was one of the first experimental platforms for quantum computing and was used to demonstrate some early quantum algorithms. However, it faces challenges related to scalability and the difficulty of initializing the system in a pure state.

Local Realism

Local realism is a combination of two assumptions about the physical world: locality, which states that physical influences cannot propagate faster than the speed of light, and realism, which states that physical systems possess definite properties independent of measurement. Local realism is a fundamental assumption underlying classical physics. However, quantum mechanics violates local realism, as demonstrated by the violation of Bell’s inequalities in experiments. This violation implies that either locality or realism, or both, must be abandoned in a quantum world.

Locality

Locality is a principle in physics that states that physical influences cannot propagate faster than the speed of light. In other words, an event at one point in space cannot instantaneously affect another event at a distant point. Locality is a fundamental assumption in classical physics and is incorporated into Einstein’s theory of special relativity. However, quantum mechanics exhibits non-local correlations, as demonstrated by the violation of Bell’s inequalities, suggesting that quantum mechanics is fundamentally non-local.

Logical Qubit

A logical qubit is a qubit that is encoded using multiple physical qubits to protect it from errors. Logical qubits are the basic unit of information in fault-tolerant quantum computation. The physical qubits that make up a logical qubit are manipulated collectively to implement quantum gates and perform error correction. The properties of a logical qubit, such as its coherence time and gate fidelity, are determined by the underlying error correction code and the quality of the physical qubits.

Long-Range Interaction

A long-range interaction is an interaction between particles that decays slowly with distance, typically as a power law with an exponent smaller than the dimensionality of the system. Examples of long-range interactions include Coulomb interactions between charged particles and dipole-dipole interactions. In quantum computing, long-range interactions can be used to implement multi-qubit gates and create highly entangled states. However, they can also be a source of cross-talk and errors if not properly controlled.

Magic State

A magic state is a special type of quantum state that, when combined with Clifford operations (operations that can be efficiently simulated on a classical computer), can enable universal quantum computation. Magic states are necessary for certain quantum error correction schemes, such as those based on stabilizer codes, to achieve universality. The most common example of a magic state is the |T⟩ state, which is an eigenstate of the T gate.

Magic State Distillation

Magic state distillation is a process in quantum computing where multiple copies of a noisy magic state are converted into a smaller number of higher-fidelity magic states. It is a crucial technique for achieving fault-tolerant quantum computation using certain quantum error correction codes, such as stabilizer codes. Magic state distillation protocols typically involve performing Clifford operations on multiple copies of the noisy magic state, followed by measurements and classical post-processing.

Magnetic Flux Quantum

The magnetic flux quantum, denoted by Φ₀, is the quantum of magnetic flux that can exist in a superconducting loop. It is equal to h/2e, where h is Planck’s constant and e is the elementary charge. The quantization of magnetic flux is a fundamental property of superconductors and is the basis for various superconducting devices, including SQUIDs (superconducting quantum interference devices) and flux qubits.

Magnetic Resonance

Magnetic resonance is a phenomenon that occurs when a system with a magnetic moment, such as an electron spin or a nuclear spin, is placed in a static magnetic field and exposed to an oscillating magnetic field at a specific frequency, called the resonance frequency. At the resonance frequency, the system absorbs energy from the oscillating field and undergoes transitions between its energy levels. Magnetic resonance is the basis for various spectroscopic techniques, such as nuclear magnetic resonance (NMR) and electron spin resonance (ESR), and is used in quantum computing to manipulate and read out the state of spin qubits.

Magnetic Trap

A magnetic trap is a device that uses magnetic fields to confine and trap charged or neutral particles with a magnetic moment. Magnetic traps are used in various areas of physics, including plasma physics, atomic physics, and particle physics. In quantum computing, magnetic traps can be used to trap ions or neutral atoms, which can serve as qubits. The most common type of magnetic trap used in quantum computing is the Paul trap, which uses a combination of static and oscillating electric fields to trap ions.

Magnetometry

Magnetometry is the measurement of magnetic fields. It has various applications in science and technology, including navigation, mineral exploration, and medical imaging. In quantum computing, magnetometry can be used to characterize and control the magnetic environment of qubits, which is crucial for maintaining their coherence and performing high-fidelity quantum gates. Quantum sensors, such as nitrogen-vacancy (NV) centers in diamond, can be used for high-precision magnetometry with nanoscale spatial resolution.

Majorana Fermion

A Majorana fermion is a hypothetical type of fermion that is its own antiparticle. Unlike Dirac fermions, such as electrons, which have distinct antiparticles (positrons), Majorana fermions are described by a real wavefunction and are identical to their antiparticles. Majorana fermions are predicted to exist as emergent quasiparticles in certain condensed matter systems, such as topological superconductors, and are of great interest for topological quantum computing due to their non-Abelian exchange statistics.

Majorana Zero Mode

A Majorana zero mode is a special type of Majorana fermion that is localized at zero energy at the edge or defect of a topological superconductor. Majorana zero modes are predicted to exhibit non-Abelian exchange statistics, meaning that exchanging their positions can result in a non-trivial transformation of the quantum state. This property makes them promising candidates for building blocks of topological quantum computers, which are expected to be inherently fault-tolerant.

Master Equation

A master equation is a general form of an equation that describes the time evolution of the probability distribution of a system undergoing a stochastic process. In quantum mechanics, a master equation describes the time evolution of the density matrix of an open quantum system, taking into account the effects of decoherence and dissipation due to the interaction of the system with its environment. The most commonly used form of a master equation in quantum optics and quantum information is the Lindblad equation.

Measurement

In quantum mechanics, measurement is the process of extracting classical information from a quantum system by interacting with it. According to the postulates of quantum mechanics, a measurement causes the quantum state to collapse into one of the eigenstates of the measured observable, with a probability given by the Born rule. The outcome of a measurement is inherently probabilistic, and the act of measurement generally disturbs the state of the system. Measurement is a fundamental concept in quantum mechanics and plays a crucial role in quantum computing.

Measurement-Based Quantum Computing (MBQC)

Measurement-based quantum computing (MBQC) is a model of quantum computation where the computation proceeds by performing a sequence of single-qubit measurements on a highly entangled resource state, such as a cluster state. Unlike the circuit model, where quantum gates are applied to qubits, in MBQC, the computation is driven by the choice of measurement bases and the classical processing of measurement outcomes. MBQC is equivalent in computational power to the circuit model and offers a different perspective on quantum computation.

Microwave Engineering

Microwave engineering is a branch of electrical engineering that deals with the study and application of microwave frequencies, typically in the range of 300 MHz to 300 GHz. Microwave engineering is essential for various technologies, including wireless communication, radar, and satellite communication. In superconducting quantum computing, microwave engineering plays a crucial role in the design and fabrication of control and readout electronics, as well as in the manipulation of superconducting qubits using microwave pulses.

Microwave Pulse

A microwave pulse is a short burst of electromagnetic radiation in the microwave frequency range (typically 300 MHz to 300 GHz). In superconducting quantum computing, microwave pulses are used to control and manipulate the quantum states of superconducting qubits. The frequency, amplitude, phase, and duration of the microwave pulses are carefully tailored to implement specific quantum gates and perform quantum algorithms.

Mixed State

A mixed state is a statistical ensemble of pure quantum states. Unlike a pure state, which can be described by a single state vector (ket), a mixed state is described by a density matrix, representing a probabilistic combination of pure states.

Mixed states arise when a quantum system is not perfectly isolated and interacts with its environment, or when there is classical uncertainty about the state of the system. A mixed state can be represented as:

ρ = Σ_i p_i|ψ_i⟩⟨ψ_i|

where p_i are the probabilities of the pure states |ψ_i⟩.

Mixer

In electronics, a mixer is a nonlinear circuit that combines two input signals to produce an output signal at a new frequency. Mixers are used in various applications, including radio communication, signal processing, and frequency conversion. In superconducting quantum computing, mixers are used to generate and manipulate the microwave signals that control and read out superconducting qubits. They are an essential component of the classical control electronics used in these systems.

Mølmer-Sørensen Gate

The Mølmer-Sørensen gate is a type of two-qubit entangling gate that is commonly used in trapped-ion quantum computing. It is implemented by applying a bichromatic laser field that couples to the internal electronic states of the ions and their collective motional modes. The Mølmer-Sørensen gate can create maximally entangled states, such as Bell states, and is a key component of many quantum algorithms implemented on trapped-ion systems.

Motional Mode

In trapped-ion quantum computing, a motional mode refers to a collective mode of motion of the trapped ions. Due to the Coulomb repulsion between the ions, their individual motions are coupled, leading to collective oscillations. These motional modes can be described as phonons, the quanta of vibrational energy. In trapped-ion systems, motional modes are used to mediate interactions between qubits and implement entangling gates, such as the Mølmer-Sørensen gate.

Multi-Qubit Gate

A multi-qubit gate is a quantum gate that acts on more than one qubit simultaneously. Multi-qubit gates are essential for creating entanglement between qubits and performing non-trivial quantum computations. The most common example of a multi-qubit gate is the controlled-NOT (CNOT) gate, which acts on two qubits. Other examples include the Toffoli gate (controlled-controlled-NOT), the SWAP gate, and the Mølmer-Sørensen gate.

Multiplexing

Multiplexing is a technique used to combine multiple signals into a single channel or medium for transmission or processing. In quantum computing, multiplexing can be used to control and read out multiple qubits using a smaller number of control lines or readout resonators. This can help reduce the complexity of the wiring and improve the scalability of quantum computing systems. Various types of multiplexing techniques, such as frequency-division multiplexing and time-division multiplexing, can be used in quantum computing platforms.

Mutually Unbiased Bases

Mutually unbiased bases (MUBs) are sets of orthonormal bases in a Hilbert space such that the inner product between any two vectors from different bases has the same magnitude. In other words, if a quantum system is prepared in one of the basis states of one basis, then the measurement outcomes in any of the other bases are completely random. MUBs have applications in quantum state tomography, quantum cryptography, and other areas of quantum information science.

N-Qubit System

An N-qubit system refers to a quantum system composed of N qubits. The state space of an N-qubit system is a 2^N-dimensional Hilbert space, which grows exponentially with the number of qubits.

N-qubit systems can exhibit complex quantum phenomena, such as entanglement and superposition, and are the fundamental building blocks of quantum computers. The ability to control and manipulate N-qubit systems is crucial for performing quantum computations and simulations.

Mixed State in Quantum Mechanics

A mixed state is a statistical ensemble of pure quantum states. Unlike a pure state, which can be described by a single state vector (ket), a mixed state is characterized by a density matrix. This matrix represents a probabilistic combination of pure states.

Mixed states occur when a quantum system is not perfectly isolated and interacts with its environment or when there is classical uncertainty about the system’s state. The mathematical representation of a mixed state is:

ρ = Σ_i p_i|ψ_i⟩⟨ψ_i|

where p_i represents the probabilities associated with the pure states |ψ_i⟩.

Native Gate

A native gate is a quantum gate that can be directly implemented on a specific quantum computing platform using the physical interactions available in that system. The set of native gates varies depending on the platform. For example, in superconducting quantum computers, typical native gates include single-qubit rotations and two-qubit gates like the iSWAP or cross-resonance gate. In trapped-ion systems, native gates might include single-qubit rotations and the Mølmer-Sørensen gate. Quantum algorithms are typically compiled into a sequence of native gates that can be executed on the target hardware.

Near-Term Quantum Computing

Near-term quantum computing refers to the current era of quantum computing, where quantum computers have a limited number of qubits (typically 50-100) and are not yet fully fault-tolerant. These devices, also known as Noisy Intermediate-Scale Quantum (NISQ) computers, are not expected to solve complex problems that are intractable for classical computers. However, they can be used to explore potential applications of quantum computing, develop and test quantum algorithms, and gain insights into the behavior of quantum systems.

Neutral Atom

A neutral atom is an atom that has an equal number of protons and electrons, and thus carries no net electric charge. In quantum computing, neutral atoms can be used as qubits, where the quantum information is encoded in the internal electronic states of the atom. Neutral atoms can be trapped and manipulated using optical tweezers or optical lattices, and quantum gates can be implemented using laser pulses. Neutral-atom quantum computing is a promising platform for quantum computation and simulation, with potential advantages in terms of scalability and coherence times.

Nitrogen-Vacancy (NV) Center

A nitrogen-vacancy (NV) center is a type of point defect in the diamond crystal lattice that consists of a nitrogen atom substituting for a carbon atom and an adjacent vacancy. NV centers have unique optical and spin properties that make them promising for various quantum technologies, including quantum sensing, quantum communication, and quantum computing. The electronic spin of the NV center can be used as a qubit, and its quantum state can be manipulated and read out using optical and microwave techniques. NV centers in diamond have long coherence times, even at room temperature, making them particularly attractive for quantum sensing applications.

No-Cloning Theorem

The no-cloning theorem is a fundamental result in quantum mechanics that states that it is impossible to create an identical copy of an arbitrary unknown quantum state. This is in stark contrast to classical information, where bits can be copied freely. The no-cloning theorem is a consequence of the linearity of quantum mechanics and has important implications for quantum information processing and quantum cryptography. It prevents certain types of attacks on quantum key distribution protocols and highlights the fundamental differences between classical and quantum information.

No-Communication Theorem

The no-communication theorem is a result in quantum mechanics that states that it is impossible to use entanglement alone to instantaneously transmit information between two distant parties. While entanglement allows for correlations between the measurement outcomes of two entangled particles, the outcomes themselves are random and cannot be controlled. Therefore, entanglement cannot be used to send signals faster than the speed of light, and the no-communication theorem ensures that quantum mechanics is consistent with special relativity.

Noise

In quantum computing, noise refers to any unwanted interaction or process that affects the quantum state of a qubit or the operation of a quantum gate. Noise can arise from various sources, including interactions with the environment, imperfections in the control signals, and unwanted couplings between qubits. Noise is a major obstacle to building practical quantum computers, as it can lead to errors in the computation and the loss of quantum information. Various techniques, such as error correction and error mitigation, are used to combat the effects of noise in quantum computing systems.

Noise Characterization

Noise characterization is the process of identifying and quantifying the sources and types of noise that affect a quantum computing system. It involves performing experiments and measurements to determine the noise parameters, such as the coherence times of qubits, the error rates of quantum gates, and the spectral properties of the noise. Noise characterization is crucial for understanding the limitations of a quantum computer, optimizing its performance, and developing effective error correction and mitigation strategies.

Noise Model

A noise model is a mathematical description of the types and strengths of noise that affect a quantum computing system. Noise models are used to simulate the behavior of quantum computers in the presence of noise and to develop and test error correction and mitigation techniques. Common noise models include the depolarizing channel, the amplitude damping channel, and the phase damping channel. More sophisticated noise models can capture the specific characteristics of the noise in a particular quantum computing platform, such as its frequency dependence and spatial correlations.

Noisy Intermediate-Scale Quantum (NISQ)

Noisy Intermediate-Scale Quantum (NISQ) refers to the current generation of quantum computers, which have a limited number of qubits (typically 50-100) and are not yet fully fault-tolerant. NISQ devices are characterized by relatively high error rates and limited coherence times, which restrict the complexity of the quantum algorithms that can be executed on them. Despite their limitations, NISQ computers are valuable tools for exploring potential applications of quantum computing, developing quantum algorithms, and studying the behavior of noisy quantum systems.

Non-Abelian Anyon

A non-Abelian anyon is a type of quasiparticle that can exist in certain two-dimensional systems, such as fractional quantum Hall systems and topological superconductors. Non-Abelian anyons are characterized by their non-Abelian exchange statistics, meaning that the order in which they are exchanged affects the quantum state of the system in a non-trivial way. This property makes them promising candidates for building blocks of topological quantum computers, which are expected to be inherently fault-tolerant.

Non-Clifford Gate

A non-Clifford gate is a quantum gate that does not belong to the set of Clifford gates. The Clifford gates are a special set of quantum gates that include the Hadamard gate, the phase gate (S gate), and the CNOT gate, among others. Clifford gates have the property that they can be efficiently simulated on a classical computer using the Gottesman-Knill theorem. Non-Clifford gates, such as the T gate (π/8 gate), are necessary to achieve universal quantum computation when combined with Clifford gates.

Non-Demolition Measurement

A non-demolition measurement, also known as a quantum non-demolition (QND) measurement, is a special type of measurement in quantum mechanics that does not disturb the measured observable. In a QND measurement, the measured quantity remains unchanged after the measurement, allowing for repeated measurements of the same observable without altering its value. QND measurements are important for various quantum information processing tasks, such as quantum state preparation, quantum feedback control, and quantum error correction.

Non-Local Correlations

Non-local correlations are correlations between the measurement outcomes of two or more spatially separated quantum systems that cannot be explained by any local realistic theory. These correlations are a fundamental feature of quantum mechanics and are exhibited by entangled states. The most famous example of non-local correlations is the violation of Bell’s inequalities by entangled particles. Non-local correlations have important implications for the foundations of quantum mechanics and are a key resource in quantum information processing.

NP (Non-deterministic Polynomial Time)

NP (Non-deterministic Polynomial time) is a complexity class in computer science that represents the set of decision problems for which a solution can be verified in polynomial time by a classical computer, given a certificate or witness. Many important problems in computer science belong to the NP class, including the traveling salesman problem and the Boolean satisfiability problem (SAT). While NP problems can be verified efficiently, finding a solution may require exponential time on a classical computer. It is widely believed, but not yet proven, that P ≠ NP, meaning that there are problems in NP that cannot be solved in polynomial time by any classical algorithm.

NP-Complete

NP-complete is a class of decision problems within the NP complexity class that are considered to be the “hardest” problems in NP. A problem is NP-complete if it is in NP and every other problem in NP can be reduced to it in polynomial time. This means that if a polynomial-time algorithm were found for any NP-complete problem, it would imply that P = NP. Examples of NP-complete problems include the traveling salesman problem, the Boolean satisfiability problem (SAT), and the graph coloring problem.

NP-Hard

NP-hard is a class of problems that are at least as hard as the hardest problems in NP. A problem is NP-hard if every problem in NP can be reduced to it in polynomial time. Unlike NP-complete problems, NP-hard problems do not necessarily have to be in NP themselves. This means that NP-hard problems may not even have a polynomial-time verification algorithm. Many optimization problems that are relevant to practical applications are NP-hard.

Nuclear Magnetic Resonance (NMR)

Nuclear Magnetic Resonance (NMR) is a phenomenon that occurs when atomic nuclei with a non-zero nuclear spin are placed in a static magnetic field and exposed to a radio-frequency (RF) field at their Larmor frequency. This causes transitions between different nuclear spin energy levels. The specific frequencies at which these transitions occur are highly sensitive to the chemical environment of each nucleus, providing information about molecular structure. NMR has been used as a platform to demonstrate early quantum computing concepts. It is also a technique to characterize materials for quantum computing.

Nuclear Spin

Nuclear spin is an intrinsic form of angular momentum possessed by atomic nuclei with an odd number of protons and/or neutrons. Like electron spin, nuclear spin is quantized, meaning it can only take on specific discrete values. Nuclei with non-zero nuclear spin have a magnetic moment, which allows them to interact with magnetic fields. In quantum computing, nuclear spins can be used as qubits, where the quantum information is encoded in the orientation of the nuclear spin. Nuclear spin qubits have long coherence times but can be challenging to manipulate and couple to each other.

Number State

A number state, also known as a Fock state, is a quantum state of a harmonic oscillator (such as a mode of the electromagnetic field) that has a definite number of energy quanta (e.g., photons). Number states are eigenstates of the number operator, which counts the number of quanta in the system. For example, the number state |n⟩ represents a state with n photons. Number states are orthogonal to each other and form a basis for the Hilbert space of the harmonic oscillator.

NV Center Quantum Computing

NV center quantum computing is an approach to building quantum computers that uses nitrogen-vacancy (NV) centers in diamond as qubits. The electronic spin of the NV center serves as the qubit, and its quantum state can be manipulated and read out using optical and microwave techniques. NV center qubits have long coherence times, even at room temperature, making them a promising platform for quantum computing. However, creating and controlling large-scale systems of interacting NV center qubits remains a significant challenge.

One-Way Quantum Computing

One-way quantum computing, also known as measurement-based quantum computing (MBQC), is a model of quantum computation where the computation proceeds by performing a sequence of single-qubit measurements on a highly entangled resource state, such as a cluster state. In this model, the choice of measurement bases and the classical processing of measurement outcomes drive the computation forward. One-way quantum computing is equivalent in computational power to the circuit model and offers a different perspective on quantum computation.

Open Quantum System

An open quantum system is a quantum system that interacts with its environment. Unlike closed quantum systems, which are isolated and evolve unitarily according to the Schrödinger equation, open quantum systems are subject to decoherence and dissipation due to their coupling to the environment. The dynamics of open quantum systems are typically described by a master equation, such as the Lindblad equation. Understanding and controlling the interaction between a quantum system and its environment is crucial for building practical quantum computers.

Operator

In quantum mechanics, an operator is a mathematical object that acts on quantum states and corresponds to a physical observable. Operators are typically represented by matrices in a given basis. When an operator acts on a quantum state, it transforms the state into another quantum state. The eigenvalues of an operator represent the possible measurement outcomes of the corresponding observable, and the eigenvectors represent the states in which the observable has a definite value.

Optical Lattice

An optical lattice is a periodic potential created by the interference of multiple laser beams. Neutral atoms can be trapped at the intensity maxima or minima of the optical lattice, forming a regular array of isolated atoms. Optical lattices are used in various areas of physics, including condensed matter physics, atomic physics, and quantum information science. In quantum computing, optical lattices can be used to trap and manipulate neutral-atom qubits, where each atom represents a qubit.

Optical Qubit

An optical qubit is a type of qubit where the quantum information is encoded in the properties of photons, such as their polarization, path, or frequency. Optical qubits are used in linear optical quantum computing (LOQC) and other photonic approaches to quantum information processing. They have the advantage of being able to propagate easily over long distances and interact weakly with the environment, which can lead to long coherence times. However, creating strong interactions between photons for implementing two-qubit gates is challenging.

Optical Tweezer

An optical tweezer is a scientific instrument that uses a highly focused laser beam to trap and manipulate microscopic and nanoscopic objects, such as atoms, molecules, and nanoparticles. Optical tweezers are based on the principle that photons carry momentum and can exert forces on objects through scattering and absorption. In quantum computing, optical tweezers can be used to trap and manipulate individual neutral atoms, which can serve as qubits. They provide a high degree of control over the position and motion of the trapped atoms.

Optimization Problem

An optimization problem is a type of computational problem where the goal is to find the best solution among a set of possible solutions, according to some objective function. Optimization problems arise in many areas of science, engineering, and business, such as logistics, finance, and machine learning. Many optimization problems are computationally hard, meaning that the time required to find the optimal solution grows exponentially with the size of the problem. Quantum computing offers the potential to solve certain optimization problems more efficiently than classical computers, using algorithms such as quantum annealing and the quantum approximate optimization algorithm (QAOA).

Oracle

In computer science and computational complexity theory, an oracle is an abstract machine or black box that can solve a specific decision problem or compute a specific function in a single step. Oracles are used as a theoretical tool to study the relative computational power of different algorithms and complexity classes. In quantum computing, oracles are often used to represent problems or subroutines that can be queried by a quantum algorithm, such as in Grover’s algorithm and the Deutsch-Jozsa algorithm.

Orbital

In atomic physics and quantum chemistry, an orbital is a mathematical function that describes the wave-like behavior of an electron in an atom or molecule. Atomic orbitals are solutions to the time-independent Schrödinger equation for an electron in an atom, while molecular orbitals are solutions for an electron in a molecule.

Orbitals are characterized by a set of quantum numbers (n, l, m_l) that specify their energy, shape, and spatial orientation. The concept of orbitals is fundamental to understanding the electronic structure of atoms and molecules.

Orthogonality

Orthogonality, in the context of quantum mechanics, refers to the property of two quantum states being mutually exclusive or independent. Two quantum states, represented by the kets |ψ⟩ and |φ⟩, are orthogonal if their inner product is zero, i.e., ⟨ψ|φ⟩ = 0. Orthogonal states correspond to distinct measurement outcomes, and the probability of transitioning between orthogonal states is zero. In quantum computing, the basis states of a qubit, |0⟩ and |1⟩, are orthogonal.

Orthonormal Basis

An orthonormal basis is a set of basis vectors in a vector space that are both orthogonal to each other and normalized (have a magnitude of 1). In quantum mechanics, an orthonormal basis for a Hilbert space is a set of quantum states that are mutually orthogonal and form a complete set, meaning that any quantum state in the Hilbert space can be expressed as a linear combination of the basis states. The computational basis, consisting of the states |0⟩ and |1⟩ for a single qubit, is an example of an orthonormal basis in quantum computing.

Overhead

In quantum computing, overhead refers to the additional resources, such as qubits and operations, that are required to implement fault-tolerant quantum computation using quantum error correction. The overhead depends on the specific error correction code used, the desired level of fault tolerance, and the error rates of the physical qubits and gates. The overhead can be significant, with some estimates suggesting that thousands or even millions of physical qubits may be required to implement a single logical qubit with sufficiently low error rates for practical applications.

Parity

Parity, in physics, refers to the behavior of a system or a state under spatial inversion, i.e., the transformation where the spatial coordinates are flipped (x → -x, y → -y, z → -z). In quantum mechanics, parity is a conserved quantity for systems that are invariant under spatial inversion. The parity operator, denoted by P, has eigenvalues of +1 and -1, corresponding to even and odd parity, respectively. Parity can also refer to the evenness or oddness of the number of 1s in a binary string, which is used in some error detection and correction schemes.

Partial Measurement

A partial measurement is a type of quantum measurement that is performed on a subset of a larger quantum system. It involves measuring one or more qubits of a multi-qubit system while leaving the other qubits unmeasured. Partial measurements can be used to extract partial information about the state of the system without fully collapsing the wavefunction. They are used in various quantum information processing tasks, such as entanglement distillation and quantum error correction.

Particle Statistics

Particle statistics refers to the behavior of a system of identical particles under the exchange of particles. In quantum mechanics, identical particles are fundamentally indistinguishable, and their wavefunction must be either symmetric (for bosons) or antisymmetric (for fermions) under particle exchange. This leads to two types of particle statistics: Bose-Einstein statistics for bosons and Fermi-Dirac statistics for fermions. The type of particle statistics obeyed by a system has important consequences for its physical properties.

Passive Qubit

A passive qubit is a type of qubit that does not require active control signals to maintain its coherence or perform quantum gates. Instead, passive qubits rely on inherent properties of the physical system to preserve their quantum state and implement operations. Examples of passive qubits include topological qubits based on Majorana zero modes, where the topological properties of the system protect the qubit from decoherence. Passive qubits have the potential to offer longer coherence times and reduced control complexity compared to active qubits.

Path Integral

The path integral formulation of quantum mechanics is an alternative approach to the standard Schrödinger equation and Heisenberg picture formulations. Developed by Richard Feynman, the path integral formulation expresses the probability amplitude for a quantum system to evolve from one state to another as a sum over all possible paths the system can take, weighted by a complex phase factor that depends on the action of each path. The path integral formulation provides a powerful and intuitive way to understand quantum phenomena and has been used in various fields, including quantum field theory, condensed matter physics, and quantum computing.

Pauli Error

A Pauli error is a type of quantum error that can affect a qubit. There are three types of Pauli errors, corresponding to the three Pauli matrices: X (bit flip), Y (bit and phase flip), and Z (phase flip). A general Pauli error can be expressed as a combination of these three errors. Pauli errors are a common and simple model of noise in quantum computing, and many quantum error correction codes are designed to correct Pauli errors.

Pauli Exclusion Principle

The Pauli exclusion principle is a fundamental principle in quantum mechanics that states that two or more identical fermions (particles with half-integer spin, such as electrons) cannot occupy the same quantum state simultaneously within a quantum system. The principle was formulated by Austrian physicist Wolfgang Pauli in 1925. The Pauli exclusion principle is responsible for the structure of atoms, the stability of matter, and the behavior of many-body systems such as white dwarf stars and neutron stars. It also dictates the degeneracy pressure that prevents gravitational collapse in these astrophysical objects.

Pauli Gates

The Pauli gates are a set of three single-qubit quantum gates that are represented by the Pauli matrices. The three Pauli gates are: the X gate (also known as the NOT gate), which flips the qubit state (|0⟩ to |1⟩ and |1⟩ to |0⟩); the Y gate, which performs a combined bit flip and phase flip; and the Z gate, which leaves the |0⟩ state unchanged and flips the sign of the |1⟩ state. The Pauli gates, along with the identity matrix, form a basis for the set of all single-qubit unitary operations.

Pauli Matrices

The Pauli matrices are a set of three 2×2 complex matrices used in quantum mechanics to represent the spin operators for spin-1/2 particles, such as electrons. They are denoted by σ_x, σ_y, and σ_z (or sometimes σ₁, σ₂, and σ₃).

The Pauli matrices are Hermitian and unitary, and they satisfy specific commutation and anticommutation relations. In quantum computing, the Pauli matrices represent the Pauli gates (X, Y, Z).

Phase

In quantum mechanics, the phase of a quantum state is a complex number of unit magnitude that multiplies the state vector. The phase factor does not affect the probabilities of measurement outcomes, as these depend on the absolute square of the state vector.

However, the relative phase between different components of a superposition state is crucial for interference phenomena and is essential for quantum computation. The phase can be represented as e^iφ, where φ is the phase angle.

Phase Estimation

Phase estimation is a quantum algorithm that allows one to estimate the eigenvalue of a unitary operator corresponding to a given eigenvector. It is a key subroutine in many quantum algorithms, including Shor’s algorithm for factoring and quantum simulations. The phase estimation algorithm uses the quantum Fourier transform and inverse quantum Fourier transform to determine the phase of the eigenvalue to a desired precision.

Phase Flip

A phase flip is a type of quantum error that affects a qubit by changing the relative phase between the |0⟩ and |1⟩ components of the qubit’s state. Specifically, a phase flip error transforms the state |0⟩ to |0⟩ and |1⟩ to -|1⟩. It is equivalent to applying the Z Pauli gate to the qubit. Phase flip errors are one of the two primary types of errors that can affect a qubit, the other being a bit flip error.

Phase Gate

The phase gate is a single-qubit quantum gate that adds a phase of π to the |1⟩ state and leaves the |0⟩ state unchanged. It is represented by the matrix:

S = [[1, 0], [0, i]]

where i is the imaginary unit. The phase gate is a special case of the R_φ gate, which adds a phase of φ to the |1⟩ state. The phase gate is one of the Clifford gates and is used in various quantum algorithms and quantum error correction codes.

Phase Kickback

Phase kickback is a quantum computing technique where the phase accumulated by an ancilla qubit during a controlled operation is “kicked back” onto the control qubit. This effect can be used to implement certain quantum algorithms, such as the quantum Fourier transform and phase estimation, more efficiently. Phase kickback is a consequence of the properties of controlled unitary operations and the linearity of quantum mechanics.

Phase Space

In classical mechanics, phase space is a mathematical space that represents all possible states of a physical system. Each point in phase space corresponds to a unique state of the system, and the coordinates of the point represent the values of the system’s generalized coordinates and momenta. In quantum mechanics, the concept of phase space is more subtle due to the uncertainty principle, which prevents the simultaneous precise determination of position and momentum. However, various quasi-probability distributions, such as the Wigner function, can be used to represent quantum states in a phase space-like manner.

Phonon

A phonon is a quantum of vibrational energy in a crystal lattice or other periodic structure. Phonons are quasiparticles that arise from the collective oscillations of atoms or molecules in a solid. They play an important role in the thermal and electrical properties of materials. In trapped-ion quantum computing, phonons in the collective motional modes of the trapped ions are used to mediate interactions between qubits and implement entangling gates.

Photodetector

A photodetector is a device that converts light into an electrical signal. Photodetectors are used in various applications, including optical communication, imaging, and sensing. In quantum optics and quantum information processing, photodetectors are used to detect individual photons, which is crucial for implementing quantum key distribution, linear optical quantum computing, and other quantum technologies. Examples of single-photon detectors include photomultiplier tubes (PMTs), avalanche photodiodes (APDs), and superconducting nanowire single-photon detectors (SNSPDs).

Photonic Quantum Computing

Photonic quantum computing is an approach to quantum computation that uses photons as qubits. In this approach, quantum information is encoded in the properties of photons, such as their polarization, path, or frequency. Photonic quantum computing has several potential advantages, including the ability to operate at room temperature, the low decoherence rates of photons, and the ease of transmitting photonic qubits over long distances. However, creating strong interactions between photons for implementing two-qubit gates is a major challenge.

Photonics

Photonics is the science and technology of generating, controlling, and detecting photons, which are the fundamental particles of light. Photonics encompasses various areas, including lasers, optical fibers, photodetectors, and integrated optical circuits. Photonics plays an important role in many technologies, such as telecommunications, medical imaging, and sensing. In quantum information science, photonics is used for quantum key distribution, linear optical quantum computing, and other quantum technologies based on the manipulation of single photons.

Physical Qubit

A physical qubit is the actual physical system that is used to implement a qubit in a quantum computer. Examples of physical qubits include trapped ions, superconducting circuits, photons, and electron spins in quantum dots or NV centers. Physical qubits are distinguished from logical qubits, which are encoded using multiple physical qubits to protect against errors. The properties of physical qubits, such as their coherence times, gate fidelities, and connectivity, determine the performance and capabilities of a quantum computer.

Planck’s Constant

Planck’s constant, denoted by h, is a fundamental physical constant in quantum mechanics that relates the energy of a photon to its frequency. It has a value of approximately 6.626 x 10^-34 joule-seconds.

Planck’s constant was first introduced by Max Planck in his explanation of blackbody radiation, which marked the beginning of quantum theory. It appears in many equations in quantum mechanics, including the Schrödinger equation and the expression for the energy of a photon:

E = hf

where f is the frequency.

Pockels Effect

The Pockels effect is an electro-optic effect in which the refractive index of a material changes linearly with an applied electric field. It occurs in certain crystals that lack inversion symmetry, such as lithium niobate and potassium dihydrogen phosphate (KDP). The Pockels effect is used in various optical devices, including modulators, Q-switches, and electro-optic deflectors. In quantum computing, the Pockels effect can be used to manipulate the polarization or phase of photons in photonic quantum computing platforms.

Pointer State

A pointer state is a state of a quantum system that is robust against decoherence caused by the interaction with a specific environment. Pointer states are the preferred states of a system that is being continuously measured by its environment, and they are the states that the system will tend to evolve into under the influence of the environment. The concept of pointer states is central to the theory of decoherence and the emergence of classicality from quantum mechanics.

Polarization

Polarization, in the context of electromagnetic waves such as light, refers to the orientation of the electric field vector in the plane perpendicular to the direction of propagation. Light can be linearly polarized, where the electric field oscillates along a single direction, circularly polarized, where the electric field vector rotates in a circle, or elliptically polarized, which is a combination of linear and circular polarization. In quantum information processing, the polarization of photons can be used to encode qubits, with the two orthogonal polarization states (e.g., horizontal and vertical) representing the |0⟩ and |1⟩ states.

Polynomial Time

Polynomial time refers to a class of computational problems that can be solved by a classical algorithm in a time that is a polynomial function of the input size. In other words, the number of steps required to solve the problem grows as n^k, where n is the size of the input and k is a constant.

Problems that can be solved in polynomial time are considered to be efficiently solvable or tractable. The complexity class P (polynomial time) is the set of all decision problems that can be solved in polynomial time by a deterministic Turing machine.

Post-Quantum Cryptography

Post-quantum cryptography, also known as quantum-resistant cryptography, refers to cryptographic algorithms that are believed to be secure against attacks by both classical and quantum computers. With the development of large-scale quantum computers, many currently used public-key cryptosystems, such as RSA and elliptic curve cryptography, will become vulnerable to attacks based on Shor’s algorithm. Post-quantum cryptography aims to develop new cryptographic schemes that can withstand such attacks and ensure long-term security in a post-quantum world. Examples of post-quantum cryptographic algorithms include lattice-based cryptography, code-based cryptography, and hash-based cryptography.

Postselection

Postselection is a technique used in quantum computation and quantum information theory where only the outcomes of a computation that satisfy a certain condition are accepted, and all other outcomes are discarded. Postselection can be used to implement operations that are otherwise difficult or impossible to perform, but it typically comes at the cost of a reduced success probability. In some models of quantum computation, such as the one based on linear optics, postselection is an essential ingredient for achieving universal quantum computation.

Power-Law Distribution

A power-law distribution is a type of probability distribution in which the probability of an event is proportional to a power of some attribute of the event. Power-law distributions are characterized by a “heavy tail,” meaning that large events are more likely to occur than in an exponential distribution. Power-law distributions appear in many areas of science and nature, such as the distribution of city sizes, the frequency of words in a language, and the connectivity of the internet. In quantum computing, power-law interactions between qubits can be used to implement certain types of quantum gates and simulate certain physical systems.

Precision

In the context of measurement and computation, precision refers to the degree of refinement or the number of significant digits in a numerical value. High precision means that a value is specified with a large number of digits, while low precision means that fewer digits are used. In quantum computing, the precision of operations and measurements is limited by factors such as decoherence, noise, and the finite control accuracy of the experimental apparatus. Achieving high precision in quantum computations is a major challenge and an active area of research.

Prepared State

The prepared state, also known as the initial state, is the quantum state of a system at the beginning of a quantum computation or experiment. In quantum computing, it is typically assumed that qubits can be reliably prepared in a known initial state, such as the |0⟩ state, before the start of a computation. State preparation is a crucial step in quantum algorithms, and the ability to prepare qubits in a desired initial state with high fidelity is essential for the successful operation of a quantum computer.

প্রাইমারী স্টেট

In the context of quantum computing, a primary state often refers to a specific state within a larger quantum system that is of particular interest. This could be because it represents the initial state of the system before a computation, the target state of an algorithm, or an eigenstate of a particular Hamiltonian. Identifying and characterizing primary states is often a key goal in quantum simulations and computations.

Principle of Superposition

The principle of superposition is a fundamental concept in quantum mechanics that states that a quantum system can exist in multiple states simultaneously until a measurement is made. According to this principle, if a quantum system can be in two or more distinct states, it can also be in a linear combination, or superposition, of those states. The superposition state is described by a wave function that is a sum of the individual state wave functions, each multiplied by a complex coefficient called the amplitude. The principle of superposition is essential for quantum computing, as it allows qubits to exist in superpositions of |0⟩ and |1⟩, enabling the exploration of many computational paths in parallel.

Probabilistic Algorithm

A probabilistic algorithm is an algorithm that makes use of randomness as part of its logic or procedure. Unlike deterministic algorithms, which produce the same output for a given input every time they are run, probabilistic algorithms may produce different outputs on different runs with the same input. Probabilistic algorithms are often used when it is difficult or impossible to find an exact solution to a problem efficiently, and an approximate or likely solution is acceptable. In quantum computing, many algorithms are inherently probabilistic due to the probabilistic nature of quantum measurement.

Probability Amplitude

In quantum mechanics, a probability amplitude is a complex number that is used to describe the behavior of quantum systems. The absolute square of the probability amplitude gives the probability that the system will be found in a particular state upon measurement. Probability amplitudes are associated with the wave function of a quantum state, and they can interfere constructively or destructively, leading to the characteristic wave-like behavior of quantum systems.

Programmable Quantum Computer

A programmable quantum computer is a quantum computer that can be programmed to execute different quantum algorithms, as opposed to a fixed-function quantum device that can only perform a specific task. A programmable quantum computer requires a universal set of quantum gates that can be used to implement any desired quantum operation. It also requires the ability to control the interactions between qubits and to perform measurements on individual qubits. Building a fully programmable, fault-tolerant quantum computer is a major goal of quantum computing research.

Projective Measurement

A projective measurement is a type of quantum measurement that projects the state of a quantum system onto one of the eigenstates of an observable. Projective measurements are described by a set of projection operators that correspond to the possible measurement outcomes. After a projective measurement, the system is left in the eigenstate corresponding to the measurement outcome, and the probability of obtaining a particular outcome is given by the square of the magnitude of the projection of the initial state onto the corresponding eigenstate. Projective measurements are often assumed in the postulates of quantum mechanics and are widely used in quantum information theory.

Protective Measurement

A protective measurement is a type of quantum measurement that aims to minimize the disturbance to the measured system. Unlike projective measurements, which generally alter the state of the system, protective measurements are designed to extract information about the expectation value of an observable without significantly changing the state. Protective measurements were originally proposed by Aharonov and Vaidman and require a weak coupling between the system and the measurement apparatus, as well as prior knowledge about the state of the system.

Pseudopure State

A pseudopure state is a type of mixed state used in liquid-state NMR quantum computing to mimic the behavior of a pure state. In NMR quantum computing, it is challenging to initialize the system in a true pure state due to the relatively small energy differences between nuclear spin states at room temperature. Instead, pseudopure states are created, which have a density matrix that is proportional to the identity matrix plus a small deviation corresponding to the desired pure state. While not truly pure, pseudopure states can be used to demonstrate some quantum algorithms in NMR systems.

Pure State

A pure state is a quantum state that can be described by a single state vector or ket (|ψ⟩) in a Hilbert space. A pure state represents the maximum possible knowledge about a quantum system, and its state is completely determined. Pure states are in contrast to mixed states, which are statistical ensembles of pure states. Any pure state can be expressed as a linear combination, or superposition, of basis states.

Purification

Purification is a concept in quantum information theory where a mixed state of a quantum system is represented as a pure state in a larger, extended system. Given a mixed state ρ of a system A, it is always possible to find a pure state |ψ⟩ in an extended system AB such that ρ is equal to the partial trace of |ψ⟩⟨ψ| over the subsystem B. Purification is a useful theoretical tool for understanding mixed states and for proving theorems in quantum information theory.

Q Factor

The Q factor, also known as the quality factor, is a dimensionless parameter that describes the sharpness of a resonance or the energy dissipation in an oscillating system. A high Q factor indicates a narrow resonance and low energy loss per oscillation cycle, while a low Q factor indicates a broad resonance and high energy loss. In quantum computing, the Q factor of resonators used for coupling and readout of qubits is an important parameter that affects the coherence times and gate fidelities.

Qubit

A qubit, short for quantum bit, is the basic unit of quantum information. Unlike a classical bit, which can be in one of two states (0 or 1), a qubit can exist in a superposition of both 0 and 1 simultaneously. The state of a qubit can be represented as a linear combination of the basis states |0⟩ and |1⟩, with complex coefficients called amplitudes. Qubits can be implemented using various physical systems, such as the spin of an electron, the polarization of a photon, or the energy levels of an atom.

Qubit-Qubit Coupling

Qubit-qubit coupling refers to the interaction between two or more qubits in a quantum computer. Coupling is necessary to implement multi-qubit gates, such as the CNOT gate, which are essential for creating entanglement and performing universal quantum computation. Qubit-qubit coupling can be mediated by various physical mechanisms, such as capacitive or inductive coupling between superconducting qubits, dipole-dipole interactions between trapped ions, or photon exchange in linear optical systems.

Qubit Initialization

Qubit initialization is the process of preparing a qubit in a known initial state, typically the |0⟩ state, before the start of a quantum computation. High-fidelity qubit initialization is crucial for the reliable operation of a quantum computer, as errors in the initial state can propagate through the computation and lead to incorrect results. Qubit initialization can be achieved through various techniques, such as optical pumping, laser cooling, or measurement-based feedback.

Qubit Readout

Qubit readout is the process of measuring the state of a qubit at the end of a quantum computation. Readout is typically performed by coupling the qubit to a measurement device, such as a resonator or a meter, and detecting the state-dependent response of the device. Qubit readout should be fast, accurate, and ideally non-destructive, meaning that it does not disturb the state of the qubit if further operations are to be performed.

Quadrature

In the context of continuous-variable quantum computing and quantum optics, quadratures refer to the two components of a mode of the electromagnetic field that are analogous to the position and momentum of a harmonic oscillator. The quadratures are often denoted as X and P, and they satisfy a commutation relation similar to that of position and momentum in quantum mechanics. Quadratures can be measured using homodyne detection and are used to encode and process quantum information in continuous-variable systems.

Quantization

Quantization is the process of transitioning from a classical description of a physical system to a quantum mechanical description. In classical physics, physical quantities such as energy, momentum, and angular momentum can take on continuous values. In quantum mechanics, these quantities are often restricted to discrete values, or quanta. Quantization involves replacing classical variables with quantum operators and imposing commutation relations between them. The resulting quantum theory describes the probabilistic behavior of particles and fields at the atomic and subatomic scales.

Quantum Algorithm

A quantum algorithm is an algorithm that is designed to be run on a quantum computer. Quantum algorithms can solve certain computational problems more efficiently than the best known classical algorithms. Famous examples include Shor’s algorithm for factoring large numbers and Grover’s algorithm for searching an unsorted database. Quantum algorithms exploit the principles of quantum mechanics, such as superposition and entanglement, to achieve speedups over classical algorithms.

Quantum Annealing

Quantum annealing is a metaheuristic for finding the global minimum of a given objective function by exploiting quantum effects such as tunneling. It is a quantum analogue of simulated annealing, a classical optimization technique. In quantum annealing, a system of qubits is initialized in a superposition state and then slowly evolved towards the ground state of a problem Hamiltonian, which encodes the objective function. Quantum annealing is used in optimization, machine learning, and materials science and is the primary algorithm employed by D-Wave Systems’ quantum annealers.

Quantum Approximate Optimization Algorithm (QAOA)

The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm for solving combinatorial optimization problems. It was introduced by Edward Farhi, Jeffrey Goldstone, and Sam Gutmann in 2014. QAOA uses a quantum computer to prepare a parameterized quantum state that encodes a candidate solution to the optimization problem, and a classical computer to optimize the parameters of the state to minimize the objective function. QAOA is a leading candidate algorithm for demonstrating quantum advantage in the NISQ era.

Quantum আর্টিফ্যাক্ট

A quantum artifact is a physical object or device that exhibits quantum mechanical properties or is used to manipulate and control quantum systems. This can range from natural systems like atoms and molecules, which intrinsically follow the laws of quantum mechanics, to engineered devices like quantum dots, superconducting circuits, and photonic crystals, which are designed to exhibit specific quantum behaviors. Quantum artifacts are the building blocks of quantum technologies, including quantum computers, quantum sensors, and quantum communication systems. They often require specialized fabrication techniques and operation at cryogenic temperatures or in ultra-high vacuum to isolate them from environmental noise and decoherence. As fabrication techniques improve, quantum artifacts are becoming increasingly sophisticated, enabling more complex and powerful quantum systems to be realized.

Quantum Assembly Language (QASM)

Quantum assembly language (QASM) is a low-level programming language for quantum computers. QASM describes quantum circuits in terms of elementary quantum gates and measurements, similar to how classical assembly language describes classical computations in terms of basic logical operations. QASM is used to represent quantum algorithms in a form that can be executed on a quantum computer or simulated on a classical computer. Several variants of QASM exist, such as OpenQASM and Quil.

Quantum আর্টিফিশিয়াল ইন্টেলিজেন্স

Quantum artificial intelligence is a field of research that explores the intersection of quantum computing and artificial intelligence. It investigates how quantum algorithms can be used to enhance machine learning and other AI techniques, as well as how AI can be used to improve the design and control of quantum systems. Potential applications of quantum artificial intelligence include faster training of machine learning models, improved optimization algorithms, and the discovery of new quantum materials and drugs.

Quantum Biology

Quantum biology is an emerging field that studies the role of quantum mechanics in biological systems. It explores whether non-trivial quantum effects, such as superposition, entanglement, and tunneling, play a functional role in biological processes, such as photosynthesis, enzyme catalysis, and avian navigation. While the idea that quantum mechanics is relevant to biology is not new, recent experimental advances have provided evidence for quantum effects in biological systems, sparking renewed interest in this interdisciplinary field.

Quantum Bus

A quantum bus is a component of a quantum computer that is used to mediate interactions between different qubits or between qubits and control/readout devices. The quantum bus can be implemented using various physical systems, such as a microwave resonator in superconducting quantum computers or a motional mode in trapped-ion systems. The quantum bus allows for the implementation of multi-qubit gates and the transfer of quantum information between different parts of the quantum computer.

Quantum Byte (Qbyte)

A quantum byte, or qbyte, is a collection of eight qubits, analogous to a classical byte consisting of eight bits. While the term is not as widely used as qubit, it can be helpful for discussing the organization and manipulation of larger sets of qubits in a quantum computer.

A qbyte can represent 2⁸ = 256 distinct classical states simultaneously in a superposition.

Quantum Chaos

Quantum chaos is a branch of quantum mechanics that studies the quantum behavior of systems that exhibit classical chaos. Classically chaotic systems are characterized by their sensitivity to initial conditions, meaning that small changes in the initial state can lead to exponentially diverging trajectories. In quantum mechanics, the concept of chaos is more subtle due to the linearity of the Schrödinger equation. Quantum chaos typically manifests itself in the statistical properties of energy levels, the structure of wave functions, and the dynamics of quantum systems.

Quantum Chemistry

Quantum chemistry is a branch of chemistry that applies the principles of quantum mechanics to chemical systems. It aims to understand and predict the properties and behavior of molecules based on the fundamental laws of quantum mechanics. Quantum chemistry calculations can provide information about molecular structures, energies, spectra, and reaction mechanisms. Quantum computing has the potential to revolutionize quantum chemistry by enabling the exact simulation of molecular systems that are intractable for classical computers.

Quantum Circuit

A quantum circuit is a model for quantum computation in which a computation is represented as a sequence of quantum gates, measurements, and resets, all acting on a set of qubits. Quantum circuits are analogous to classical circuits, which are composed of logic gates acting on bits. The quantum circuit model is the most widely used framework for describing quantum algorithms and is used by many quantum programming languages and software tools.

Quantum-Classical Hybrid Algorithm

A quantum-classical hybrid algorithm is an algorithm that combines both quantum and classical computations to solve a problem. In a typical hybrid algorithm, a quantum computer is used to perform a specific subroutine or task that is difficult for classical computers, while the rest of the computation is carried out on a classical computer. The classical computer also controls the operation of the quantum computer and processes the measurement results. Many near-term quantum algorithms, such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are hybrid algorithms.

Quantum Communication

Quantum communication is a field of quantum information science that deals with the transmission of quantum information between different locations. Unlike classical communication, which relies on the transmission of classical bits, quantum communication uses quantum systems, such as photons or atoms, to encode and transmit information. Quantum communication offers the potential for unconditionally secure communication through quantum key distribution (QKD) and enables the distribution of entanglement between distant parties, which is a crucial resource for various quantum information processing tasks.

Quantum Compiler

A quantum compiler is a software tool that translates a high-level description of a quantum algorithm into a set of instructions that can be executed on a specific quantum computer. The quantum compiler performs various optimizations to reduce the number of gates, improve the circuit’s fidelity, and adapt the algorithm to the specific architecture and constraints of the target hardware. Quantum compilers are essential for bridging the gap between abstract quantum algorithms and their practical implementation on real quantum devices.

Quantum Complexity Theory

Quantum complexity theory is a branch of theoretical computer science that studies the computational complexity of problems using the quantum model of computation. It aims to classify quantum algorithms based on their resource requirements, such as time and space, and to understand the fundamental limits of quantum computation. Quantum complexity theory also investigates the relationship between classical and quantum complexity classes, such as P, NP, and BQP (Bounded-error Quantum Polynomial time).

Quantum Computer

A quantum computer is a type of computer that uses the principles of quantum mechanics to perform computations. Unlike classical computers, which store and process information using bits that can be either 0 or 1, quantum computers use qubits, which can exist in a superposition of both 0 and 1 simultaneously. Quantum computers can also exploit quantum phenomena such as entanglement to perform certain computations more efficiently than the best known classical algorithms.

Quantum Control

Quantum control is the field of science and engineering that deals with the manipulation and control of quantum systems. It involves the use of external fields, such as electromagnetic pulses, to steer the evolution of a quantum system towards a desired target state or to implement a specific quantum operation. Quantum control techniques are essential for building and operating quantum computers, as well as for other quantum technologies such as quantum sensors and quantum simulators.

Quantum Cryptography

Quantum cryptography is a method of securing communication using the principles of quantum mechanics. The most well-known application of quantum cryptography is quantum key distribution (QKD), which allows two parties to establish a shared secret key with security guaranteed by the laws of physics. Unlike classical cryptography, which relies on the computational hardness of certain mathematical problems, quantum cryptography is based on fundamental principles of quantum mechanics, such as the no-cloning theorem and the uncertainty principle.

Quantum Data

Quantum data refers to information that is encoded in the state of a quantum system, such as a qubit or a collection of qubits. Unlike classical data, which is represented by bits that are either 0 or 1, quantum data can exist in a superposition of multiple states simultaneously. Quantum data can also be entangled, meaning that the state of one part of the data is correlated with the state of another part, even if they are physically separated.

Quantum Data Bus

A quantum data bus is a component of a quantum computer that enables the transfer of quantum information between different qubits or between qubits and other parts of the system. The quantum data bus can be implemented using various physical systems, such as a shared resonator in superconducting qubits or a common motional mode in trapped ions. The quantum data bus plays a crucial role in implementing multi-qubit gates and moving quantum information around the quantum computer.

Quantum Decoder

A quantum decoder is a component of a quantum error correction system that is responsible for analyzing the measurement results from the ancilla qubits (syndrome measurements) and determining the most likely error that occurred on the data qubits. The decoder uses classical algorithms to process the syndrome information and identify the appropriate correction operations to apply. The performance of the decoder, in terms of its speed and accuracy, is crucial for achieving fault-tolerant quantum computation.

Quantum Defect

A quantum defect is a point-like imperfection in a crystal lattice that can trap a single electron or hole and has discrete energy levels, similar to an atom. Quantum defects can be used as qubits in various quantum computing platforms, such as nitrogen-vacancy (NV) centers in diamond or silicon vacancies in silicon carbide. The electronic or nuclear spin associated with the defect can serve as the qubit, and its quantum state can be manipulated and read out using optical or microwave techniques.

Quantum Degeneracy

Quantum degeneracy refers to the situation where two or more distinct quantum states of a system have the same energy. Degeneracy can arise due to symmetries in the system’s Hamiltonian or due to accidental coincidences in the energy levels. In quantum mechanics, degeneracy can be lifted by applying a perturbation that breaks the symmetry of the system. Degeneracy plays an important role in various quantum phenomena, such as the behavior of electrons in atoms and the properties of certain quantum materials.

Quantum Detector

A quantum detector is a device that is capable of detecting individual quanta of energy, such as photons or phonons. Quantum detectors are essential for various quantum technologies, including quantum communication, quantum sensing, and photonic quantum computing. Examples of quantum detectors include single-photon detectors, such as avalanche photodiodes and superconducting nanowire single-photon detectors, and bolometers that can detect the energy of individual phonons.

Quantum Dot

A quantum dot is a nanoscale semiconductor structure that confines electrons, holes, or excitons in all three spatial dimensions. Due to the quantum confinement effect, quantum dots have discrete energy levels, similar to atoms, and are sometimes referred to as “artificial atoms.” The size, shape, and composition of a quantum dot can be tuned to control its electronic and optical properties. Quantum dots can be used as qubits in various quantum computing platforms, where the quantum information is encoded in the electronic or spin states of the confined particles.

Quantum Efficiency

Quantum efficiency is a measure of the effectiveness of a device or process in converting input quanta (e.g., photons) into a desired output (e.g., electrons or a specific quantum state). For example, the quantum efficiency of a photodetector is the ratio of the number of photoelectrons generated to the number of incident photons. In quantum computing, the quantum efficiency of various components, such as single-photon sources and detectors, can affect the overall performance and fidelity of quantum operations.

Quantum Electrodynamics (QED)

Quantum electrodynamics (QED) is the quantum field theory that describes the interaction of light and matter. It is one of the most successful and accurately tested theories in physics, and it provides a complete description of electromagnetic phenomena at the quantum level. QED explains various effects, such as the Lamb shift and the anomalous magnetic moment of the electron, which cannot be accounted for by classical electromagnetism. QED is also relevant to quantum computing, as it provides the theoretical framework for understanding the interaction of qubits with electromagnetic fields.

Quantum Electronics

Quantum electronics is a field of science and engineering that deals with the application of quantum mechanics to electronic devices and systems. It encompasses various areas, including the study of quantum effects in semiconductor devices, the development of quantum sensors and detectors, and the design of quantum computing hardware. Quantum electronics plays a crucial role in the development of new technologies that exploit quantum phenomena for enhanced performance and functionality.

Quantum Enigma

The Quantum Enigma is a cryptographic device that was used by Nazi Germany during World War II to encrypt and decrypt secret messages. It was an electromechanical rotor machine that implemented a polyalphabetic substitution cipher. The Enigma machine was considered to be highly secure at the time, but its code was eventually broken by Allied cryptanalysts, most notably Alan Turing and his team at Bletchley Park. The breaking of the Enigma code was a major intelligence breakthrough that had a significant impact on the outcome of the war. This is different from Quantum Enigma, which is an example of the fields of steganography and cryptography being adapted to quantum circuits.

Quantum Entanglement

Quantum entanglement is a fundamental phenomenon in quantum mechanics where two or more quantum particles become correlated in such a way that their quantum states cannot be described independently, even when the particles are separated by large distances. In an entangled state, the properties of the particles are linked, and measuring the state of one particle instantaneously determines the state of the other, regardless of the distance between them. Entanglement is a crucial resource in quantum computing and quantum communication, enabling tasks such as quantum teleportation, superdense coding, and quantum key distribution.

Quantum Error Correction (QEC)

Quantum error correction (QEC) is a set of techniques used to protect quantum information from errors caused by decoherence and other quantum noise. QEC involves encoding quantum information in a larger number of physical qubits, such that errors can be detected and corrected without destroying the encoded information. Quantum error correction codes, such as the surface code and the color code, are designed to detect and correct errors that occur during quantum computation. QEC is essential for building fault-tolerant quantum computers that can perform complex computations reliably.

Quantum Error Detection

Quantum error detection is a process used in quantum error correction where measurements are performed on ancilla qubits to detect the occurrence of errors on the data qubits without learning the logical state of the encoded information. The measurement outcomes, known as the error syndrome, provide information about the type and location of the errors. Error detection is a crucial step in quantum error correction, as it allows for the identification of errors without collapsing the encoded quantum state.

Quantum Field Theory (QFT)

Quantum field theory (QFT) is a theoretical framework that combines quantum mechanics with special relativity to describe the behavior of particles and fields. In QFT, particles are treated as excitations of underlying quantum fields that permeate all of space. QFT provides a powerful tool for studying the fundamental interactions of nature, and it is the basis for the Standard Model of particle physics. QFT also plays an important role in condensed matter physics, where it is used to describe phenomena such as superconductivity and the quantum Hall effect.

Quantum Fourier Transform (QFT)

The Quantum Fourier Transform (QFT) is a quantum algorithm that performs the discrete Fourier transform on a quantum state. It is a key component of many quantum algorithms, including Shor’s algorithm for factoring large numbers and the quantum phase estimation algorithm. The QFT maps a quantum state in the computational basis to a superposition of states in the Fourier basis, where the amplitudes are related by the discrete Fourier transform. The QFT can be implemented efficiently on a quantum computer using a sequence of Hadamard gates and controlled phase gates.

Quantum Gate

A quantum gate is a basic quantum circuit operating on a small number of qubits. Quantum gates are the building blocks of quantum circuits, analogous to classical logic gates for conventional digital circuits. Quantum gates are unitary transformations that manipulate the quantum state of qubits. Examples include single-qubit gates like the Hadamard gate, Pauli gates, and phase gate, and multi-qubit gates like the CNOT gate and the Toffoli gate. Quantum gates are used to implement quantum algorithms and perform quantum computations.

Quantum Graph

A quantum graph is a mathematical structure consisting of a set of vertices connected by edges, where each edge is assigned a length, and a differential operator (usually a Schrödinger operator) is defined on each edge. Quantum graphs are used to model various physical systems, such as quantum wires, photonic crystals, and molecules. They can also be used to study quantum chaos and other quantum phenomena. In quantum computing, certain types of quantum graphs can be used as quantum algorithms or as models for quantum walks.

Quantum Hall Effect

The quantum Hall effect is a quantum-mechanical version of the classical Hall effect, observed in two-dimensional electron systems at low temperatures and under strong magnetic fields. In the quantum Hall effect, the Hall conductance is quantized and takes on values that are integer or fractional multiples of the fundamental constant e²/h, where e is the elementary charge and h is Planck’s constant.

The integer quantum Hall effect is characterized by the formation of Landau levels, while the fractional quantum Hall effect arises from strong electron-electron interactions, leading to the emergence of quasiparticles with fractional charge and statistics.

Quantum Hardware

Quantum hardware refers to the physical components and devices that are used to build a quantum computer. This includes the qubits themselves, the control and readout systems, the cryogenic or vacuum environment, and the classical electronics needed to interface with the quantum system. Different quantum computing platforms, such as superconducting circuits, trapped ions, and photonic systems, have their own specific hardware requirements and challenges. The development of scalable, high-performance quantum hardware is a major focus of research and engineering efforts in the field of quantum computing.

Quantum హీలింగ్

Quantum healing is a pseudoscientific concept that combines ideas from alternative medicine and quantum mechanics. Proponents of quantum healing claim that consciousness and intention can directly influence the physical body and promote healing by manipulating the quantum state of the body’s cells and tissues. However, there is no scientific evidence to support these claims, and quantum healing is not recognized as a valid medical treatment by the scientific community. The term “quantum healing” has been criticized for misusing and misinterpreting concepts from quantum physics to promote unsubstantiated medical claims.

Quantum Hybrid

See Quantum-Classical Hybrid Algorithm

Quantum Information

Quantum information is information that is encoded in the state of a quantum system. Unlike classical information, which is based on bits that can be either 0 or 1, quantum information is based on qubits, which can exist in a superposition of 0 and 1. Quantum information can also be entangled, meaning that the state of one part of the information is correlated with the state of another part, even if they are physically separated. Quantum information is the foundation of quantum computing, quantum communication, and quantum cryptography.

Quantum Information Processing

Quantum information processing refers to the manipulation and processing of quantum information using quantum systems, such as qubits. It encompasses various tasks, including quantum computation, quantum communication, quantum simulation, and quantum sensing. Quantum information processing exploits the unique features of quantum mechanics, such as superposition and entanglement, to perform tasks that are difficult or impossible for classical information processing systems.

Quantum Information Science

Quantum information science is an interdisciplinary field that combines quantum mechanics, computer science, information theory, and mathematics to study the processing, storage, and communication of quantum information. It explores the fundamental principles of quantum mechanics and their applications to information processing tasks. Quantum information science encompasses various areas, such as quantum computing, quantum cryptography, quantum communication, quantum metrology, and quantum error correction.

Quantum Internet

The quantum internet is a hypothetical network that would connect quantum computers and other quantum devices to enable the transmission of quantum information over long distances. The quantum internet would allow for the distribution of entanglement between distant nodes, enabling applications such as quantum key distribution, distributed quantum computing, and quantum teleportation. Building a quantum internet requires overcoming significant technical challenges, such as the development of quantum repeaters, quantum memory, and efficient quantum interfaces between different quantum systems.

Quantum Key Distribution (QKD)

Quantum key distribution (QKD) is a method for secure communication that uses the principles of quantum mechanics to allow two parties to establish a shared secret key. QKD protocols, such as BB84 and E91, exploit the properties of quantum systems, such as the no-cloning theorem and the uncertainty principle, to ensure that any attempt to eavesdrop on the key distribution will be detected. QKD provides a way to achieve information-theoretic security, meaning that the security of the key is guaranteed by the laws of physics, rather than by the computational complexity of certain mathematical problems.

Quantum Machine Learning

Quantum machine learning is a field of research that explores the use of quantum computing to enhance machine learning algorithms. It investigates how quantum algorithms can be used to speed up the training of machine learning models, improve their accuracy, or enable them to learn from quantum data. Quantum machine learning also encompasses the use of machine learning techniques to analyze and optimize quantum systems. Potential applications of quantum machine learning include pattern recognition, anomaly detection, and the discovery of new materials and drugs.

Quantum ম্যাগনেটোমিটার

A quantum magnetometer is a device that uses quantum phenomena to measure magnetic fields with high sensitivity and precision. Quantum magnetometers can be based on various quantum systems, such as nitrogen-vacancy (NV) centers in diamond, superconducting quantum interference devices (SQUIDs), or atomic vapors. These devices can achieve sensitivities that surpass those of classical magnetometers, enabling applications in fields such as medical imaging, materials science, and fundamental physics research. For example, NV center-based magnetometers can detect the magnetic fields produced by single electron spins, while SQUIDs can measure magnetic fields as weak as a few femtoteslas. Quantum magnetometers also play a crucial role in characterizing and calibrating the magnetic environment for qubits in quantum computing, helping to minimize magnetic noise that can lead to decoherence and gate errors.

Quantum Many-Body System

A quantum many-body system is a collection of a large number of interacting quantum particles, such as electrons, atoms, or ions. The behavior of quantum many-body systems is governed by the principles of quantum mechanics and is typically very complex due to the exponential growth of the Hilbert space with the number of particles. Understanding and simulating quantum many-body systems is a major challenge in condensed matter physics, quantum chemistry, and materials science. Quantum computers are expected to be powerful tools for studying these systems, potentially providing insights that are inaccessible to classical computers.

Quantum Measurement

Quantum measurement is the process of extracting classical information from a quantum system by interacting with it. According to the postulates of quantum mechanics, a measurement causes the quantum state to collapse into one of the eigenstates of the measured observable, with a probability given by the Born rule. The outcome of a measurement is inherently probabilistic, and the act of measurement generally disturbs the state of the system. Measurement is a fundamental concept in quantum mechanics and plays a crucial role in quantum computing, where measurements are used to extract the results of a computation.

Quantum Memory

Quantum memory is a device that can store quantum information for a certain period of time and then retrieve it on demand. Quantum memory is an essential component for various quantum technologies, including quantum repeaters, quantum networks, and linear optical quantum computing. Quantum memory can be implemented using various physical systems, such as ensembles of atoms, single atoms, ions, or solid-state defects. The key performance metrics for quantum memory include storage time, efficiency, fidelity, and bandwidth.

Quantum Metrology

Quantum metrology is a field of research that exploits quantum phenomena, such as superposition and entanglement, to enhance the precision of measurements beyond what is possible with classical methods. Quantum metrology techniques can be used to improve the performance of sensors, clocks, and other measurement devices. A key concept in quantum metrology is the Heisenberg limit, which is the fundamental limit on the precision of a measurement allowed by quantum mechanics.

Quantum Monte Carlo

Quantum Monte Carlo refers to a class of computer algorithms that use Monte Carlo methods to simulate quantum systems. These algorithms are based on representing the quantum state of the system as a statistical ensemble of classical configurations and using random sampling to estimate the properties of the system. Quantum Monte Carlo methods can be used to study ground-state properties, thermal properties, and even the dynamics of quantum systems. They are particularly useful for problems that are intractable for other numerical methods, such as those involving strong correlations or large system sizes.

Quantum Network

A quantum network is a network that connects multiple quantum devices, such as quantum computers, sensors, or memories, to enable the transmission of quantum information between them. Quantum networks are essential for distributed quantum computing, quantum communication, and quantum key distribution. They can be based on various physical platforms, such as optical fibers, free-space optical links, or trapped-ion systems. Building large-scale, fault-tolerant quantum networks is a major challenge in quantum information science and requires the development of key technologies such as quantum repeaters and quantum error correction.

Quantum Neural Network

A quantum neural network is a type of neural network that is implemented using quantum systems or that exploits quantum phenomena to enhance its performance. Quantum neural networks can be based on various models of quantum computation, such as the circuit model or adiabatic quantum computing. They can potentially offer advantages over classical neural networks in terms of training speed, generalization ability, or capacity. Quantum neural networks are a key component of the emerging field of quantum machine learning.

Quantum Nonlocality

Quantum nonlocality refers to the phenomenon where measurements performed on entangled particles show correlations that cannot be explained by any local realistic theory. These correlations persist even when the particles are separated by large distances, suggesting that quantum mechanics is fundamentally nonlocal. The most famous example of quantum nonlocality is the violation of Bell’s inequalities by entangled particles. Quantum nonlocality has important implications for the foundations of quantum mechanics and is a key resource in quantum information processing.

Quantum Operation

A quantum operation is a mathematical description of the most general type of transformation that a quantum state can undergo. It includes unitary transformations, measurements, and the effects of noise and decoherence. Quantum operations are represented by completely positive, trace-preserving (CPTP) maps, which map density operators to density operators. In quantum computing, quantum operations are used to describe the evolution of qubits and the implementation of quantum gates and circuits.

Quantum Optics

Quantum optics is a field of physics that studies the quantum nature of light and its interaction with matter at the level of individual photons and atoms. It explores phenomena such as the quantization of the electromagnetic field, the wave-particle duality of light, and the interaction of photons with atoms and other quantum systems. Quantum optics provides the theoretical framework and experimental techniques for various quantum technologies, including quantum communication, quantum cryptography, and photonic quantum computing.

Quantum Parallelism

Quantum parallelism is a fundamental feature of quantum computing that allows a quantum computer to explore many possible computational paths simultaneously. It arises from the ability of qubits to exist in a superposition of multiple states at the same time. When a quantum gate is applied to a superposition state, it acts on all the components of the superposition in parallel. This allows a quantum computer to perform many computations at once, potentially offering significant speedups over classical computers for certain problems.

Quantum Phase

See Phase

Quantum Phase Estimation

See Phase Estimation

Quantum Phase Transition

A quantum phase transition is a phase transition that occurs in a quantum system at zero temperature due to changes in a non-thermal parameter, such as pressure, magnetic field, or chemical composition. Unlike classical phase transitions, which are driven by thermal fluctuations, quantum phase transitions are driven by quantum fluctuations arising from the Heisenberg uncertainty principle. Quantum phase transitions are associated with changes in the ground state properties of the system and can lead to the emergence of novel quantum phases of matter, such as superconductors, superfluids, and topological insulators.

Quantum Photonics

Quantum photonics is a subfield of quantum optics that deals with the generation, manipulation, and detection of single photons and entangled photon states. It plays a crucial role in various quantum technologies, including quantum communication, quantum cryptography, and photonic quantum computing. Quantum photonics involves the development of advanced optical components, such as single-photon sources, single-photon detectors, and integrated photonic circuits, to enable the precise control and measurement of photonic quantum states.

Quantum Physics

Quantum physics, also known as quantum mechanics, is the branch of physics that deals with the behavior of matter and energy at the atomic and subatomic level. It is a fundamental theory that underlies many areas of modern physics and technology, including quantum chemistry, quantum field theory, quantum technology, and quantum information science.

Quantum Processor

A quantum processor is the central processing unit of a quantum computer, analogous to the microprocessor in a classical computer. It consists of a set of physical qubits and the necessary hardware to control and manipulate their quantum states. Quantum processors can be based on various physical platforms, such as superconducting circuits, trapped ions, photons, or quantum dots. The performance of a quantum processor is characterized by the number of qubits, their coherence times, the fidelity of gate operations, and the connectivity between qubits.

Quantum Programming

Quantum programming is the process of writing code for quantum computers. It involves using specialized quantum programming languages and software tools to describe quantum algorithms in terms of quantum circuits, which are sequences of quantum gates and measurements. Quantum programming also involves compiling these high-level descriptions into low-level instructions that can be executed on specific quantum hardware, as well as optimizing the code to minimize errors and improve performance.

Quantum Random Access Memory (QRAM)

Quantum random access memory (QRAM) is a hypothetical type of memory for quantum computers that would allow for the efficient storage and retrieval of quantum information. Unlike classical RAM, which stores bits, QRAM would store qubits in a superposition state and allow for the retrieval of any specific qubit or superposition of qubits on demand. QRAM is a crucial component for many proposed quantum algorithms, but building a scalable and efficient QRAM remains a significant technological challenge.

Quantum Random Number Generator (QRNG)

A quantum random number generator (QRNG) is a device that generates truly random numbers by exploiting the inherent randomness of quantum mechanical processes. Unlike classical random number generators, which are based on deterministic algorithms and can only produce pseudo-random numbers, QRNGs can generate numbers that are fundamentally unpredictable. QRNGs are important for various applications, including cryptography, simulations, and quantum key distribution.

Quantum Repeater

A quantum repeater is a device used in quantum communication to extend the range of quantum key distribution (QKD) and other quantum communication protocols. Due to the no-cloning theorem, quantum signals cannot be amplified like classical signals, which limits the distance over which they can be transmitted. Quantum repeaters overcome this limitation by dividing the long communication channel into smaller segments and using entanglement swapping and quantum memory to establish entanglement between the end nodes of each segment. By connecting these entangled links, entanglement can be extended over longer distances, enabling secure quantum communication over a large-scale quantum network.

Quantum Reservoir Computing

Quantum reservoir computing is a machine learning approach inspired by the concept of reservoir computing, which uses a fixed, randomly connected dynamical system (the reservoir) to process input data. In quantum reservoir computing, the reservoir is a quantum system, such as a collection of interacting qubits or a continuous-variable quantum system. The input data is encoded into the initial state of the reservoir, and the system is allowed to evolve for a certain time. The output is then obtained by performing measurements on the reservoir and using a simple readout layer to classify or process the measurement results. Quantum reservoir computing has the potential to offer advantages over classical reservoir computing in terms of computational power and efficiency.

Quantum Safe

See Post-Quantum Cryptography

Quantum Search

Quantum search refers to a class of quantum algorithms that aim to find a specific item or a set of items in an unstructured database or a search space more efficiently than classical algorithms. The most famous example of a quantum search algorithm is Grover’s algorithm, which can search an unsorted database of N items in O(√N) time, providing a quadratic speedup over the best possible classical algorithm. Quantum search algorithms have applications in various areas, such as optimization, machine learning, and database searching.

Quantum Sensor

A quantum sensor is a device that exploits quantum phenomena, such as superposition and entanglement, to measure physical quantities with high precision and sensitivity. Quantum sensors can surpass the performance of classical sensors by exploiting the principles of quantum metrology. Examples of quantum sensors include atomic clocks, quantum magnetometers, quantum gravimeters, and quantum thermometers. Quantum sensors have applications in various fields, including navigation, medical imaging, materials science, and fundamental physics research.

Quantum Simulation

Quantum simulation is the use of a controllable quantum system to simulate the behavior of another, less accessible quantum system. Quantum simulators can be used to study the properties of complex quantum many-body systems, such as molecules, materials, and quantum field theories, that are difficult or impossible to simulate using classical computers. There are two main types of quantum simulation: analog quantum simulation, where the simulator is designed to directly mimic the Hamiltonian of the target system, and digital quantum simulation, where the evolution of the target system is approximated by a sequence of quantum gates.

Quantum Simulator

A quantum simulator is a specialized quantum device that is designed to simulate the behavior of other quantum systems. Unlike universal quantum computers, which can be programmed to execute any quantum algorithm, quantum simulators are typically built to study specific types of quantum models or phenomena. Quantum simulators can be based on various physical platforms, such as ultracold atoms in optical lattices, trapped ions, superconducting circuits, or photonic systems. They offer a promising avenue for exploring complex quantum many-body physics and for gaining insights into the behavior of materials and molecules.

Quantum Software

Quantum software refers to the set of programs, libraries, and tools that are used to develop, compile, simulate, and execute quantum algorithms on quantum computers or simulators. Quantum software plays a crucial role in bridging the gap between high-level quantum algorithms and the low-level control of quantum hardware. It includes quantum programming languages, quantum compilers, quantum simulators, and tools for quantum error correction, verification, and validation.

Quantum Software Development Kit (QDK)

A quantum software development kit (QDK) is a collection of software tools and libraries that are provided by a quantum computing platform or company to enable developers to write, test, and run quantum programs. QDKs typically include a quantum programming language, a compiler, a simulator, and various tools for debugging, optimization, and visualization. Examples of QDKs include Qiskit from IBM, Cirq from Google, and Q# from Microsoft.

Quantum Speedup

Quantum speedup refers to the ability of a quantum algorithm to solve a computational problem faster than the best known classical algorithm for that problem. Quantum speedups can be either superpolynomial or polynomial, depending on the scaling of the runtime with the input size. For example, Shor’s algorithm for factoring large numbers provides a superpolynomial speedup over the best known classical algorithm, while Grover’s algorithm for searching an unsorted database provides a quadratic (polynomial) speedup. Demonstrating a quantum speedup for a practically relevant problem is a major goal of quantum computing research.

Quantum State

A quantum state is a mathematical description of the physical state of a quantum system. It contains all the information about the system that can be known, given the principles of quantum mechanics. Quantum states can be represented by state vectors (kets) in a Hilbert space or by density matrices. A quantum state can be either a pure state, which can be described by a single state vector, or a mixed state, which is a statistical ensemble of pure states. The state of a quantum system evolves in time according to the Schrödinger equation, and it changes when a measurement is performed on the system.

Quantum Supremacy

Quantum supremacy, also known as quantum advantage, is the point at which a quantum computer can perform a computational task that is beyond the capabilities of the most powerful classical computers, or practically infeasible for them to carry out in any reasonable amount of time. Achieving quantum supremacy is a major milestone in the development of quantum computing, demonstrating the potential of quantum computers to outperform classical computers for certain tasks. The first demonstration of quantum supremacy was claimed by Google in 2019 using their Sycamore superconducting quantum processor.

Quantum System

A quantum system is any physical system whose behavior is governed by the laws of quantum mechanics. Quantum systems can range from individual particles, such as electrons, photons, or atoms, to more complex systems, such as molecules, quantum dots, or superconducting circuits. Quantum systems exhibit unique phenomena, such as superposition, entanglement, and quantum tunneling, which are not observed in classical systems. Quantum systems are the fundamental building blocks of quantum technologies, including quantum computers, quantum sensors, and quantum communication networks.

Quantum Technology

Quantum technology refers to a class of devices and systems that exploit quantum mechanical phenomena, such as superposition, entanglement, and quantum measurement, to perform tasks that are impossible or inefficient for classical technologies. Quantum technologies include quantum computers, quantum simulators, quantum sensors, quantum communication systems, and quantum cryptography. These technologies have the potential to revolutionize various fields, including computation, communication, metrology, and materials science.

Quantum Teleportation

Quantum teleportation is a protocol that allows for the transfer of an unknown quantum state from one location to another, using entanglement and classical communication. In quantum teleportation, two parties, Alice and Bob, share an entangled pair of qubits. Alice performs a joint measurement on the qubit she wants to teleport and her half of the entangled pair, and sends the classical measurement outcome to Bob. Based on this outcome, Bob performs a unitary operation on his half of the entangled pair, which transforms it into the original state that Alice wanted to teleport. Quantum teleportation is a fundamental building block for quantum communication and distributed quantum computing.

Quantum Tomography

Quantum tomography, also known as quantum state tomography, is the process of reconstructing the quantum state of a system by performing a series of measurements on identically prepared copies of the system. By measuring a complete set of observables, one can obtain enough information to fully characterize the density matrix of the system. Quantum tomography is an important tool for verifying the preparation of quantum states, characterizing quantum processes, and validating the performance of quantum gates and devices.

Quantum Tunneling

Quantum tunneling is a quantum mechanical phenomenon where a particle can pass through a potential energy barrier that it classically could not surmount. This is possible because the wave function of the particle has a non-zero probability of being found on the other side of the barrier, even if its energy is less than the barrier height. Quantum tunneling plays an important role in various physical processes, such as nuclear fusion, alpha decay, and the operation of scanning tunneling microscopes. In quantum computing, quantum tunneling can be exploited in quantum annealing to find the global minimum of an objective function.

Quantum Volume

Quantum volume is a metric used to quantify the overall performance of a quantum computer. It was introduced by IBM as a way to capture the capabilities of near-term quantum computers beyond just the number of qubits.

The quantum volume depends on various factors, including the number of qubits, their connectivity, the gate error rates, and the measurement fidelity. It is defined as 2ⁿ, where n is the size of the largest random square circuit that the quantum computer can successfully execute.

A higher quantum volume indicates a more powerful quantum computer.

Quantum Walk

A quantum walk is the quantum mechanical analogue of a classical random walk. In a quantum walk, a quantum particle (or “walker”) moves on a discrete lattice or graph, with its motion governed by the principles of quantum mechanics. The walker can exist in a superposition of multiple locations, and its evolution is determined by a unitary operator that depends on the structure of the lattice or graph. Quantum walks can exhibit different properties than classical random walks, such as faster spreading and different hitting time statistics. They have applications in quantum algorithms, quantum simulation, and quantum search.

Quantum Wire

A quantum wire is a quasi-one-dimensional conductor that confines electrons to move along a single direction. Due to the confinement, the transverse motion of the electrons is quantized, and the wire exhibits properties that are distinct from those of bulk conductors. Quantum wires can be fabricated using various techniques, such as lithography, molecular beam epitaxy, or by using carbon nanotubes or other nanowires. They are used in various quantum devices and are of interest for studying low-dimensional quantum phenomena.

Quantum Zeno Effect

The quantum Zeno effect is a phenomenon in quantum mechanics where frequent measurements of a quantum system can inhibit its evolution and prevent it from transitioning to a different state. The effect is named after the Zeno paradox in philosophy, which argues that motion is impossible if time is divided into discrete instants. In the quantum Zeno effect, if a system is initially in an eigenstate of an observable and is measured repeatedly in the basis of that observable, the probability of finding the system in the initial state can approach unity as the measurement frequency increases. The quantum Zeno effect has been experimentally demonstrated and has implications for quantum control and measurement.

Quantum-Inspired Algorithm

A quantum-inspired algorithm is a classical algorithm that is inspired by the principles of quantum mechanics or the structure of quantum algorithms, but does not require a quantum computer to run. These algorithms often use techniques such as tensor networks, matrix product states, or other mathematical tools that have been developed in the context of quantum physics to solve classical problems more efficiently or to gain new insights into their structure. Quantum-inspired algorithms can be applied to various fields, including optimization, machine learning, and materials science.

Quasi-Particle

A quasiparticle is an emergent phenomenon that occurs in interacting many-body systems, where the collective behavior of the particles can be described as if it were composed of weakly interacting entities called quasiparticles. Quasiparticles can have properties that are different from those of the underlying particles, such as a different mass or charge. Examples of quasiparticles include phonons (vibrational modes in a crystal), excitons (bound electron-hole pairs), and plasmons (collective oscillations of electrons in a metal). In condensed matter physics, quasiparticles are often used to describe the low-energy excitations of complex systems.

Qubit

Qubit Connectivity

Qubit connectivity refers to the arrangement and interactions between qubits in a quantum computer. It describes which qubits can directly interact with each other through two-qubit gates. Qubit connectivity is an important factor in determining the capabilities and limitations of a quantum computer, as it affects the types of quantum circuits that can be implemented and the efficiency of quantum algorithms. Different quantum computing platforms have different connectivity patterns, such as linear chains, 2D grids, or all-to-all connectivity.

Qubit Encoding

Qubit encoding refers to the way in which quantum information is represented or stored in a physical system. Different physical systems can be used to encode qubits, such as the spin of an electron, the polarization of a photon, the energy levels of an atom, or the magnetic flux in a superconducting loop. The choice of qubit encoding depends on various factors, such as the available control techniques, the coherence properties of the system, and the scalability of the platform.

Qubit Fidelity

Qubit fidelity is a measure of how closely the state of a physical qubit matches the ideal or intended quantum state. It quantifies the accuracy and reliability of qubit operations, such as state preparation, measurement, and quantum gates. Qubit fidelity is typically defined as the overlap between the actual state and the target state, and it ranges from 0 (no resemblance) to 1 (perfect fidelity). High qubit fidelity is essential for building reliable and fault-tolerant quantum computers.

Qubit-Photon Interface

A qubit-photon interface is a system that allows for the coherent transfer of quantum information between a stationary qubit, such as an atom or a solid-state defect, and a flying qubit, typically a photon. Qubit-photon interfaces are essential for building quantum networks, as they enable the distribution of entanglement and the transmission of quantum information over long distances. They also play a crucial role in various quantum information processing tasks, such as quantum teleportation and quantum repeaters.

Quil

Quil is an instruction set architecture for quantum computing developed by Rigetti Computing. It is a low-level language that describes quantum circuits in terms of quantum gates, measurements, and classical control flow. Quil is designed to be hardware-agnostic and can be used to target different quantum computing platforms. It also includes features for specifying gate parameters, defining custom gate sets, and handling classical data.

Qubit Mapping

Qubit mapping is the process of assigning logical qubits in a quantum circuit to physical qubits on a quantum computer. The mapping needs to take into account the connectivity constraints of the hardware, as well as the error rates of different qubits and gates. Qubit mapping can have a significant impact on the performance of a quantum algorithm, and optimizing the mapping to minimize the number of gates and the overall error rate is an important step in quantum circuit compilation.

Rabi Cycle

A Rabi cycle is the cyclic behavior of a two-level quantum system undergoing oscillations between its two energy levels when driven by a resonant or near-resonant external field. The oscillations are known as Rabi oscillations, and their frequency, called the Rabi frequency, is proportional to the strength of the driving field. Rabi cycles are used to manipulate the quantum state of qubits in various quantum computing platforms, such as trapped ions, superconducting circuits, and NV centers in diamond.

Rabi Frequency

The Rabi frequency is the frequency at which a two-level quantum system oscillates between its two energy levels when driven by a resonant or near-resonant external field. It is proportional to the strength of the driving field and the coupling strength between the system and the field. The Rabi frequency is a key parameter in controlling and manipulating qubits, as it determines the rate at which the qubit’s state can be changed.

Ramsey Experiment

A Ramsey experiment is a type of experiment used to measure the energy difference between two quantum states or the coherence time of a quantum system. It was first developed by Norman Ramsey in the context of atomic clocks. In a Ramsey experiment, the system is first prepared in a superposition of the two states, then allowed to evolve freely for a certain time, and finally a second pulse is applied to rotate the state before a measurement is performed. By varying the time between the two pulses and measuring the probability of finding the system in one of the states, one can determine the energy difference or the coherence time.

Random Circuit Sampling

Random circuit sampling is a computational task that involves sampling from the output distribution of a randomly generated quantum circuit. It has been proposed as a way to demonstrate quantum supremacy, as it is believed to be hard for classical computers to simulate the output of large, random quantum circuits. In 2019, Google reported using their Sycamore superconducting quantum processor to perform a random circuit sampling task that would be practically infeasible for the most powerful classical supercomputers, thus claiming the first demonstration of quantum supremacy.

Random Matrix Theory

Random matrix theory (RMT) is a branch of mathematics that studies the statistical properties of matrices whose elements are drawn from a random distribution. RMT was originally developed in the context of nuclear physics to describe the energy levels of heavy nuclei, but it has since found applications in various fields, including quantum chaos, condensed matter physics, and number theory. In quantum computing, RMT can be used to model the behavior of certain types of quantum systems and to analyze the properties of random quantum circuits.

Rare-Earth Ion

A rare-earth ion is an ion of an element in the lanthanide series of the periodic table, plus yttrium and scandium. Rare-earth ions have unique optical and magnetic properties due to their partially filled 4f electron shells, which are shielded by outer electron shells. These properties make them useful for various applications, including lasers, phosphors, and magnets. In quantum information science, rare-earth ions doped into crystals can be used as qubits, where the quantum information is encoded in the electronic or nuclear spin states of the ion.

Readout Fidelity

Readout fidelity, also known as measurement fidelity, is a measure of the accuracy of the measurement process in a quantum computer. It quantifies the probability of correctly determining the state of a qubit after a measurement. Readout fidelity is typically defined as the average probability of obtaining the correct measurement outcome for each of the possible qubit states. High readout fidelity is essential for the reliable operation of a quantum computer, as measurement errors can propagate through the computation and lead to incorrect results.

Realism

Realism, in the context of the foundations of quantum mechanics, is the philosophical view that physical systems possess definite properties independent of measurement. In other words, a realist believes that a quantum system has a well-defined state even when it is not being observed. Realism is one of the key assumptions underlying classical physics, but it is challenged by quantum mechanics. The violation of Bell’s inequalities in experiments demonstrates that quantum mechanics is incompatible with the combination of realism and locality (the assumption that physical influences cannot travel faster than the speed of light).

Reduced Density Matrix

The reduced density matrix is a mathematical tool used to describe the state of a subsystem of a larger quantum system. If a composite quantum system is in a state described by a density matrix ρ, and we are interested in the state of a subsystem A, we can obtain the reduced density matrix ρ_A by taking the partial trace of ρ over the degrees of freedom of the rest of the system (subsystem B).

The reduced density matrix contains all the information about subsystem A that can be obtained by performing measurements on A alone. It is a crucial concept in the study of entanglement and open quantum systems.

Register

In quantum computing, a register is a collection of qubits used to store and process quantum information. A quantum register can be thought of as the quantum analogue of a classical register, which is a set of bits. However, unlike a classical register, which can only store a single definite value at a time, a quantum register can exist in a superposition of multiple values simultaneously.

The state of an n-qubit quantum register is described by a n^2 -dimensional complex vector.

Relaxation

Relaxation, in the context of quantum computing, refers to the process by which a qubit loses energy to its environment and returns to its ground state. Relaxation is an important source of decoherence in quantum systems, as it leads to the loss of quantum information encoded in the qubit.

The characteristic time scale for this process is known as the relaxation time, denoted by T₁. Relaxation is typically caused by the interaction of the qubit with its environment, such as the emission of photons or phonons.

Remote State Preparation

Remote state preparation is a quantum communication protocol that allows one party (Alice) to prepare a specific quantum state in the laboratory of a distant party (Bob), using only classical communication and shared entanglement. Unlike quantum teleportation, where an arbitrary unknown state can be transferred, in remote state preparation, Bob knows the state that Alice intends to prepare. Remote state preparation can be used as a subroutine in various quantum information processing tasks, such as distributed quantum computing and quantum cryptography.

Repetition Code

A repetition code is a simple type of classical error-correcting code where a single bit of information is encoded using multiple physical bits. For example, in a 3-bit repetition code, the logical 0 is encoded as 000 and the logical 1 is encoded as 111. If a single bit-flip error occurs during the transmission or storage of the encoded information, it can be detected and corrected by taking the majority vote of the three bits. In quantum computing, the concept of repetition codes can be generalized to create quantum error-correcting codes, such as the surface code, that can protect quantum information from errors.

Reservoir Computing

Reservoir computing is a machine learning framework that uses a fixed, randomly connected dynamical system, known as a reservoir, to process input data. The reservoir maps the input data into a high-dimensional feature space, and a simple readout layer is trained to extract the desired output from the reservoir’s state. Reservoir computing has been successfully applied to various tasks, such as time series prediction, speech recognition, and control problems. Recently, there has been growing interest in using quantum systems as reservoirs, leading to the field of quantum reservoir computing.

Resistive Quantum Computing

A hypothetical approach to building quantum computers that uses resistive elements, such as Josephson junctions operating in the dissipative regime, to implement qubits and quantum gates. Unlike superconducting quantum computing, which relies on dissipationless supercurrents, resistive quantum computing exploits the controlled dissipation of energy to manipulate and control the quantum states of the system. While still in the early stages of research, resistive quantum computing could potentially offer advantages in terms of scalability, fabrication, and operation at higher temperatures.

Resonator

In the context of quantum computing, a resonator is a device that can store electromagnetic energy at specific resonant frequencies. Resonators are often used in superconducting quantum computing to couple to and read out the state of superconducting qubits. For example, a coplanar waveguide resonator can be coupled to a transmon qubit, and the state of the qubit can be determined by measuring the transmission or reflection of microwave signals through the resonator. Resonators can also be used to mediate interactions between qubits and implement multi-qubit gates.

Rydberg Atom

A Rydberg atom is an atom that has one or more electrons excited to a very high energy level, with a large principal quantum number n. Rydberg atoms have exaggerated properties compared to ground-state atoms, such as a very large size (proportional to n²), a long lifetime (proportional to n³), and a strong response to electric and magnetic fields.

These properties make them interesting for various applications in quantum information science, including quantum computing, quantum simulation, and quantum sensing. In particular, the strong dipole-dipole interactions between Rydberg atoms can be used to implement fast, long-range entangling gates.

S Parameter

S parameters, also known as scattering parameters, are a set of parameters that describe the input-output relationships of a linear electrical network. They characterize how the network responds to signals incident on its ports, in terms of the reflected and transmitted signals. S parameters are widely used in microwave engineering and are particularly useful for characterizing high-frequency components and circuits. In superconducting quantum computing, S parameters are used to characterize the properties of microwave resonators, filters, and amplifiers that are used for qubit control and readout.

Sampling Problem

A sampling problem is a type of computational problem where the goal is to sample from a probability distribution. Given a description of the distribution, the task is to generate random numbers that follow the specified distribution. Sampling problems are important in various areas of science and engineering, such as statistical physics, machine learning, and cryptography. Some sampling problems are believed to be hard for classical computers but can be solved efficiently by quantum computers, as demonstrated by the task of random circuit sampling.

Scaling

In the context of quantum computing, scaling refers to the ability to increase the size and complexity of a quantum computer by adding more qubits and improving the control and connectivity of the system. Scaling is a major challenge in the development of practical quantum computers, as it requires overcoming various technological hurdles, such as maintaining coherence, reducing error rates, and improving the fabrication and integration of quantum devices. Different quantum computing platforms face different scaling challenges and are pursuing various approaches to address them.

Scanning Probe Microscopy

Scanning probe microscopy (SPM) is a branch of microscopy that uses a physical probe to scan the surface of a sample and create an image with nanoscale resolution. SPM techniques, such as scanning tunneling microscopy (STM) and atomic force microscopy (AFM), have been instrumental in the development of nanoscience and nanotechnology. In quantum computing, SPM can be used to characterize and manipulate individual atoms, molecules, or quantum dots, which can serve as qubits or components of quantum devices. For example, STM can be used to position individual atoms on a surface with atomic precision, creating artificial structures that can be used for quantum simulation or computation.

Schmidt Decomposition

The Schmidt decomposition is a way of expressing a pure bipartite quantum state (a state of two quantum systems) in a particular form that reveals the entanglement between the two subsystems.

Given a pure state |ψ⟩ of a composite system AB, the Schmidt decomposition expresses |ψ⟩ as a sum of product states of the form |i_A⟩ ⊗ |i_B⟩, where |i_A⟩ and |i_B⟩ are orthonormal basis states for subsystems A and B, respectively. The coefficients in the sum are real, non-negative numbers called Schmidt coefficients.

The number of non-zero Schmidt coefficients is called the Schmidt rank and is a measure of the entanglement between A and B.

Schrödinger Equation

The Schrödinger equation is a fundamental equation in quantum mechanics that describes how the quantum state of a physical system evolves over time. It was formulated by Austrian physicist Erwin Schrödinger in 1926. The time-dependent Schrödinger equation is a linear partial differential equation that relates the time derivative of the wave function of a system to its Hamiltonian, which represents the total energy of the system. The time-independent Schrödinger equation is an eigenvalue equation that determines the stationary states and energy levels of a system. The Schrödinger equation is one of the central postulates of quantum mechanics and plays a crucial role in understanding the behavior of atoms, molecules, and other quantum systems.

Schrödinger’s Cat

Schrödinger’s cat is a famous thought experiment devised by Austrian physicist Erwin Schrödinger in 1 from 1935 to illustrate the paradoxical nature of quantum superposition when applied to everyday objects. In the thought experiment, a cat is placed in a sealed box with a device that has a 50% chance of killing the cat within an hour, based on the random decay of a radioactive atom. According to the Copenhagen interpretation of quantum mechanics, until the box is opened and the system is observed, the cat is in a superposition of both being alive and dead. Schrödinger’s cat highlights the conceptual difficulties in reconciling the quantum description of microscopic systems with our classical intuitions about macroscopic objects.

Semiconductor

A semiconductor is a material that has electrical conductivity between that of a conductor and an insulator. The conductivity of a semiconductor can be controlled by doping, which involves introducing impurities into the material, or by applying an electric field. Semiconductors are the foundation of modern electronics, and they are used to make devices such as transistors, diodes, and integrated circuits. In quantum computing, semiconductors can be used to create qubits based on the spin or charge of electrons or holes confined in quantum dots or other nanostructures.

Semiconductor Quantum Computing

Semiconductor quantum computing is an approach to building quantum computers that uses semiconductor materials and devices, similar to those used in classical electronics, to create and manipulate qubits. One common approach is to use the spin of electrons or holes confined in quantum dots as qubits, where the quantum information is encoded in the spin-up and spin-down states. Semiconductor quantum computing has the potential advantage of leveraging the existing infrastructure and expertise of the semiconductor industry to scale up to larger numbers of qubits. However, it also faces challenges related to qubit coherence, control, and fabrication.

Shor’s Algorithm

Shor’s algorithm is a quantum algorithm for factoring large numbers exponentially faster than the best known classical algorithms. It was developed by mathematician Peter Shor in 1994.

Shor’s algorithm can factor an N-digit number in time proportional to (log N)³, while the best classical algorithm, the general number field sieve, requires time proportional to exp(c(log N)^1/3(log log N)^2/3).

This result has significant implications for cryptography, as the security of many widely used public-key cryptosystems, such as RSA, relies on the difficulty of factoring large numbers. The ability of a quantum computer to run Shor’s algorithm and break these cryptosystems is a major driver for the development of post-quantum cryptography.

Shot Noise

Shot noise is a type of electronic noise that arises from the discrete nature of electric charge. It occurs when a current is not perfectly smooth but consists of individual charge carriers (e.g., electrons) arriving at random times. Shot noise is a fundamental source of noise in electronic devices and can limit the sensitivity of measurements. In quantum computing, shot noise can affect the fidelity of qubit operations and measurements. However, in some cases, it can also be used as a resource for quantum sensing and metrology.

SIAM (Single Impurity Anderson Model)

The Single Impurity Anderson Model (SIAM) is a theoretical model in condensed matter physics that describes a magnetic impurity embedded in a non-magnetic metallic host. It was introduced by Philip Anderson in 1961 to explain the formation of localized magnetic moments in metals. The SIAM is characterized by the hybridization between the localized d or f orbitals of the impurity and the conduction electrons of the host metal, as well as by the on-site Coulomb repulsion between electrons on the impurity. The SIAM exhibits a variety of interesting phenomena, such as the Kondo effect, and has been studied extensively using various theoretical and numerical techniques.

Sigma Matrices

See Pauli Matrices

Silicon-Based Quantum Computing

Silicon-based quantum computing is an approach to building quantum computers that uses silicon as the host material for qubits. This approach leverages the vast knowledge and infrastructure developed for the semiconductor industry. In silicon-based quantum computing, qubits can be implemented using various degrees of freedom, such as the spin of electrons or holes confined in quantum dots, the nuclear spin of phosphorus dopants, or the charge states of single electrons. Silicon-based qubits have shown promising coherence times and can potentially be integrated with classical electronic components on the same chip.

Simulated Annealing

Simulated annealing is a classical optimization algorithm inspired by the process of annealing in metallurgy, where a material is heated and then slowly cooled to reduce defects and reach a low-energy state. Simulated annealing can be used to find approximate solutions to optimization problems by allowing the system to explore the solution space and probabilistically accept moves that increase the cost function, with the probability decreasing as the “temperature” of the system is lowered. Simulated annealing is a widely used heuristic for solving NP-hard optimization problems.

Simulation

See Quantum Simulation

Single-Electron Transistor (SET)

A single-electron transistor (SET) is a type of transistor that uses the controlled tunneling of single electrons to amplify current. SETs are extremely sensitive to electric charge and can be used to detect the motion or presence of individual electrons. They are based on the phenomenon of Coulomb blockade, which prevents electrons from tunneling onto a small conducting island unless a sufficient voltage is applied. In quantum computing, SETs can be used as charge sensors to read out the state of qubits based on their charge or to manipulate the charge state of quantum dots.

Single-Flux-Quantum (SFQ) Logic

Single-flux-quantum (SFQ) logic is a type of digital logic that uses the presence or absence of a magnetic flux quantum in a superconducting loop to represent a bit of information. SFQ circuits can operate at very high speeds (up to hundreds of GHz) with very low power dissipation. SFQ logic has been proposed as a potential technology for building classical control electronics for superconducting quantum computers, as it can operate at cryogenic temperatures and is compatible with superconducting fabrication processes.

Single-Photon Detector

A single-photon detector is a device that can detect individual photons with high efficiency and low noise. Single-photon detectors are essential for various quantum technologies, including quantum key distribution, linear optical quantum computing, and quantum imaging. There are several types of single-photon detectors, such as photomultiplier tubes (PMTs), avalanche photodiodes (APDs), and superconducting nanowire single-photon detectors (SNSPDs). Each type has its own advantages and disadvantages in terms of efficiency, dark count rate, timing resolution, and operating wavelength.

Single-Photon Source

A single-photon source is a device that emits individual photons on demand, one at a time. Single-photon sources are crucial for various quantum information processing tasks, including linear optical quantum computing, quantum key distribution, and quantum metrology. An ideal single-photon source should have high efficiency, high purity (i.e., a low probability of emitting more than one photon at a time), and indistinguishability between successive photons. Various physical systems can be used to create single-photon sources, such as single atoms, ions, molecules, quantum dots, and nitrogen-vacancy centers in diamond.

Single-Qubit Gate

A single-qubit gate is a quantum gate that operates on a single qubit. It is a unitary transformation that rotates the state of the qubit on the Bloch sphere. Examples of single-qubit gates include the Pauli gates (X, Y, Z), the Hadamard gate (H), the phase gate (S), and the T gate. Single-qubit gates, together with two-qubit gates, form a universal set of gates, meaning that any quantum operation can be decomposed into a sequence of single-qubit and two-qubit gates.

Singlet State

A singlet state is a two-particle quantum state with a total spin of zero. In the context of two spin-1/2 particles, such as electrons, the singlet state is an entangled state that can be written as (|↑↓⟩ – |↓↑⟩)/√2, where |↑⟩ and |↓⟩ represent the spin-up and spin-down states of each particle, respectively. The singlet state is an example of a maximally entangled state, and it plays an important role in quantum information theory and condensed matter physics.

Solid-State Quantum Computing

Solid-state quantum computing is an approach to building quantum computers that uses solid-state devices, such as semiconductor nanostructures or superconducting circuits, to implement qubits and quantum gates. Solid-state platforms have the potential advantage of scalability, as they can leverage existing nanofabrication techniques developed for the semiconductor and superconducting electronics industries. Examples of solid-state quantum computing platforms include superconducting qubits, silicon-based spin qubits, and topological qubits.

Soliton

A soliton is a self-reinforcing solitary wave that maintains its shape and speed as it propagates through a medium. Solitons arise as solutions to certain nonlinear partial differential equations that describe wave propagation in various physical systems, such as shallow water waves, optical fibers, and plasmas. Solitons have been proposed as a potential means of transmitting information in classical and quantum communication systems.

Spacetime

Spacetime is a mathematical model that combines the three dimensions of space with the dimension of time into a single four-dimensional continuum. Spacetime is the arena in which all physical events take place. The concept of spacetime is central to Einstein’s theories of special and general relativity. In special relativity, spacetime is a flat, Minkowskian space, while in general relativity, spacetime is curved by the presence of mass and energy, giving rise to the phenomenon of gravity.

Special Relativity

Special relativity is a theory of physics that describes the relationship between space and time for objects moving at constant velocities. It was developed by Albert Einstein in 1905 and is based on two postulates:

The laws of physics are the same for all observers in uniform motion.
The speed of light in a vacuum is constant for all observers, regardless of the motion of the light source.

Special relativity has various counterintuitive consequences, such as time dilation, length contraction, and the equivalence of mass and energy (E = mc²). It is a cornerstone of modern physics and has been experimentally verified to high accuracy.

Spectroscopy

Spectroscopy is the study of the interaction between matter and electromagnetic radiation as a function of wavelength or frequency. It is a powerful tool for investigating the structure, properties, and dynamics of atoms, molecules, and materials. In spectroscopy, a sample is exposed to electromagnetic radiation, and the absorption, emission, or scattering of the radiation is measured. The resulting spectrum provides information about the energy levels, composition, and other characteristics of the sample. Spectroscopy has numerous applications in various fields, including chemistry, physics, biology, astronomy, and materials science. In quantum computing, spectroscopic techniques are used to characterize and control qubits, as well as to study the properties of materials used in quantum devices.

Spin

Spin is an intrinsic form of angular momentum possessed by elementary particles, composite particles, and atomic nuclei. Unlike classical angular momentum, which is associated with the rotation of a macroscopic object, spin is a purely quantum mechanical property that has no classical analogue. Spin is quantized, meaning that it can only take on certain discrete values. For example, electrons, protons, and neutrons have a spin of 1/2, while photons have a spin of 1. Spin plays a crucial role in many areas of physics, including atomic and molecular structure, particle physics, and condensed matter physics. In quantum computing, the spin of electrons or nuclei can be used to encode quantum information, with the spin-up and spin-down states representing the |0⟩ and |1⟩ states of a qubit.

Spin Bath

A spin bath is a collection of spins in the environment that interact with a central spin or qubit. The spins in the bath can be associated with various degrees of freedom, such as nuclear spins in a solid, paramagnetic impurities, or other electronic spins. The interaction between the central spin and the spin bath is a major source of decoherence and noise in solid-state spin qubits. Understanding and controlling the spin bath is crucial for improving the coherence times and gate fidelities of these qubits.

Spin Chain

A spin chain is a one-dimensional array of interacting spins. Spin chains are important model systems in condensed matter physics and are used to study various quantum phenomena, such as quantum magnetism, quantum phase transitions, and many-body localization. Spin chains can be realized in various physical systems, including magnetic materials, cold atoms in optical lattices, and arrays of coupled qubits. They can also be used for quantum information processing tasks, such as quantum simulation and quantum state transfer.

Spin Echo

Spin echo is a phenomenon in magnetic resonance where the loss of phase coherence in a collection of spins, caused by inhomogeneities in the magnetic field or other factors, can be reversed by applying a specific sequence of radio-frequency pulses. The spin echo technique was discovered by Erwin Hahn in 1950 and is widely used in nuclear magnetic resonance (NMR) and electron spin resonance (ESR) spectroscopy to measure relaxation times and improve spectral resolution. In quantum computing, spin echo techniques can be used to extend the coherence times of spin qubits by refocusing certain types of dephasing noise.

Spin-Flip Error

A spin-flip error, also known as a bit-flip error in the context of qubits, is a type of quantum error that affects a spin or qubit by flipping its state from up to down or vice versa. In the language of quantum computing, a spin-flip error corresponds to the application of the Pauli X gate to the qubit. Spin-flip errors are one of the two primary types of errors that can affect a qubit, the other being a phase-flip error.

Spin-Orbit Coupling

Spin-orbit coupling is an interaction between the spin and the orbital motion of a particle, such as an electron in an atom or a solid. It arises from the relativistic effect of the electron’s motion in the electric field of the nucleus or the crystal lattice. Spin-orbit coupling can lead to the splitting of energy levels and the mixing of spin and orbital degrees of freedom. It plays an important role in various phenomena in condensed matter physics, such as the fine structure of atomic spectra, the formation of topological insulators, and the behavior of certain types of qubits.

Spin Qubit

A spin qubit is a type of qubit that uses the spin of a particle, such as an electron or a nucleus, to encode quantum information. The two spin states, typically spin-up (|↑⟩) and spin-down (|↓⟩), represent the |0⟩ and |1⟩ states of the qubit. Spin qubits can be implemented in various physical systems, including quantum dots, donors in semiconductors, and nitrogen-vacancy centers in diamond. They are promising candidates for quantum computing due to their long coherence times and potential for scalability.

SQUID (Superconducting Quantum Interference Device)

SQUID stands for Superconducting Quantum Interference Device. It is a very sensitive magnetometer used to measure extremely subtle magnetic fields. SQUIDs are based on the principles of flux quantization and Josephson effects in superconducting loops. They can detect changes in magnetic flux as small as a fraction of the magnetic flux quantum (Φ₀ = h/2e ≈ 2.07 x 10^-15 webers). SQUIDs have numerous applications in science and technology, including medical imaging (magnetoencephalography), materials science, and geophysics. In quantum computing, SQUIDs can be used to read out the state of superconducting flux qubits.

Squeezed State

A squeezed state is a type of quantum state of a harmonic oscillator (such as a mode of the electromagnetic field) in which the uncertainty in one quadrature (e.g., position or amplitude) is reduced below the standard quantum limit, at the expense of increased uncertainty in the conjugate quadrature (e.g., momentum or phase). Squeezed states are non-classical states that have applications in quantum metrology, quantum communication, and continuous-variable quantum computing. They can be generated using nonlinear optical processes or by manipulating the quantum state of mechanical oscillators.

Stabilizer Code

A stabilizer code is a type of quantum error-correcting code that is defined by a set of commuting Pauli operators called stabilizers. The codespace of a stabilizer code is the simultaneous +1 eigenspace of all the stabilizer operators. Stabilizer codes are widely used in quantum computing because they allow for efficient encoding, decoding, and error correction procedures. Examples of stabilizer codes include the Steane code, the surface code, and color codes.

Stabilizer Formalism

The stabilizer formalism is a mathematical framework for describing a certain class of quantum states and operations that play an important role in quantum error correction and fault-tolerant quantum computation. Stabilizer states are quantum states that are simultaneous eigenstates of a set of commuting Pauli operators (the stabilizer group). Clifford operations are quantum operations that map stabilizer states to stabilizer states. The stabilizer formalism allows for efficient classical simulation of stabilizer states and Clifford operations, as described by the Gottesman-Knill theorem.

Standard Quantum Limit (SQL)

The standard quantum limit (SQL) is a fundamental limit on the precision of measurements that arises from the quantum nature of the measurement apparatus. It applies to the measurement of a certain class of observables, such as the position of a free mass or the amplitude of a harmonic oscillator. The SQL arises from the back-action of the measurement on the system being measured, which is a consequence of the Heisenberg uncertainty principle. For example, in the case of measuring the position of a free mass, the SQL states that the uncertainty in the position measurement is proportional to the square root of the mass and inversely proportional to the square root of the measurement time. The SQL can be surpassed by using techniques from quantum metrology, such as squeezed states or entangled states.

State Vector

A state vector is a mathematical representation of the state of a quantum system. In the Dirac notation, a state vector is denoted by a ket, such as |ψ⟩. The state vector is an element of a complex vector space called the Hilbert space, and it contains all the information about the quantum system. The state vector can be expressed as a linear combination of basis vectors, with complex coefficients called amplitudes. The absolute square of the amplitude associated with each basis vector gives the probability of finding the system in the corresponding state when a measurement is performed.

Stimulated Emission

Stimulated emission is a process in which an incoming photon interacts with an excited atom or molecule, causing it to emit a second photon that has the same frequency, phase, polarization, and direction as the incident photon. This process is the basis for the operation of lasers and masers. Stimulated emission is the opposite of absorption, where an atom or molecule absorbs a photon and transitions to a higher energy level. The concept of stimulated emission was first introduced by Albert Einstein in 1917 in his derivation of Planck’s law for blackbody radiation.

STM (Scanning Tunneling Microscope)

STM stands for Scanning Tunneling Microscope. It is a type of scanning probe microscope that can image surfaces at the atomic scale. An STM uses a sharp conducting tip that is brought very close to the surface of a sample. When a voltage is applied between the tip and the sample, electrons can tunnel through the vacuum gap, creating a tunneling current. By measuring the tunneling current as the tip is scanned across the surface, an image of the surface topography can be obtained. STMs can also be used to manipulate individual atoms and molecules on a surface, making them valuable tools for nanoscience and nanotechnology.

Storage Time

In the context of quantum memory, the storage time refers to the duration for which a quantum state can be stored in the memory and retrieved with high fidelity. The storage time is limited by decoherence and other noise processes that affect the quantum system used to implement the memory. Longer storage times are desirable for various quantum information processing tasks, such as quantum communication and distributed quantum computing.

Strong Coupling

Strong coupling, in the context of quantum optics and cavity quantum electrodynamics (cQED), refers to a regime of interaction between a quantum emitter (such as an atom or a quantum dot) and a cavity mode where the coupling strength between the emitter and the cavity is larger than the decay rates of both the emitter and the cavity. In the strong coupling regime, the emitter and the cavity can coherently exchange energy back and forth multiple times before the energy is lost to the environment. This leads to the formation of hybrid light-matter states, known as polaritons, and the observation of phenomena such as vacuum Rabi splitting. Strong coupling is essential for various quantum information processing tasks, such as the implementation of quantum gates and the transfer of quantum states between light and matter.

Superconducting Circuit

A superconducting circuit is an electrical circuit made of superconducting materials, typically operated at cryogenic temperatures where the resistance of the materials drops to zero. Superconducting circuits can exhibit various quantum mechanical effects, such as the quantization of magnetic flux and the Josephson effect. They are used in various quantum technologies, including superconducting quantum computing, where they are used to create qubits, resonators, and other components of quantum processors.

Superconducting Qubit

A superconducting qubit is a type of qubit that is implemented using superconducting circuits. Superconducting qubits are based on the manipulation of macroscopic quantum variables, such as the charge or magnetic flux in a superconducting loop or the phase difference across a Josephson junction. They are typically operated at millikelvin temperatures to reduce thermal noise and maintain superconductivity. Superconducting qubits are one of the leading platforms for building quantum computers, and they have demonstrated relatively long coherence times, high gate fidelities, and good scalability.

Superconducting Quantum Computing

Superconducting quantum computing is an approach to building quantum computers that uses superconducting circuits to implement qubits and quantum gates. Superconducting qubits are based on the manipulation of macroscopic quantum variables, such as the charge or magnetic flux in a superconducting loop or the phase difference across a Josephson junction. They are typically operated at millikelvin temperatures to reduce thermal noise and maintain superconductivity. Superconducting quantum computing is one of the leading platforms for building quantum computers, and it has demonstrated significant progress in recent years in terms of qubit coherence, gate fidelity, and system size. Companies like Google, IBM, and Rigetti Computing are actively developing superconducting quantum computers.

Superconductivity

Superconductivity is a phenomenon that occurs in certain materials at very low temperatures, where the electrical resistance drops to exactly zero. In a superconductor, electric current can flow indefinitely without any loss of energy. Superconductivity was first discovered in mercury by Heike Kamerlingh Onnes in 1911. The most widely accepted theory of superconductivity is the BCS theory, named after John Bardeen, Leon Cooper, and John Robert Schrieffer, which explains superconductivity as a macroscopic quantum phenomenon arising from the formation of Cooper pairs of electrons. Superconductivity has numerous applications in science and technology, including powerful electromagnets used in MRI machines and particle accelerators, as well as in superconducting quantum computing.

Superdense Coding

Superdense coding is a quantum communication protocol that allows two parties, Alice and Bob, to transmit two classical bits of information by sending only one qubit from Alice to Bob, provided that they share a maximally entangled pair of qubits (an EPR pair or Bell state) beforehand. Superdense coding is the opposite of quantum teleportation, where two classical bits of communication are used to transmit one qubit. It demonstrates the power of entanglement as a resource for communication and information processing.

Superoperator

A superoperator is a linear operator that acts on other operators, rather than on state vectors. In quantum mechanics, superoperators are used to describe the most general type of transformations that a quantum state can undergo, including unitary evolution, measurement, and the effects of noise and decoherence. Superoperators are often represented using the Kraus operator formalism or the Liouville-von Neumann equation. They are a fundamental concept in the study of open quantum systems and quantum information theory.

Superposition

Superposition is a fundamental principle of quantum mechanics which states that a quantum system can exist in multiple states simultaneously until a measurement is made. This is in stark contrast to classical physics, where an object can only be in one definite state at any given time. In quantum mechanics, the state of a system is described by a wave function, which is a mathematical object that encodes the probabilities of different measurement outcomes. According to the superposition principle, if a system can be in two or more distinct states, it can also be in a linear combination, or superposition, of those states. The superposition state is described by a wave function that is a sum of the individual state wave functions, each multiplied by a complex coefficient called the amplitude. Superposition is a key concept in quantum computing, as it allows qubits to exist in superpositions of |0⟩ and |1⟩, enabling the exploration of many computational paths in parallel.

Surface Code

The surface code is a type of topological quantum error-correcting code that is considered one of the most promising candidates for building fault-tolerant quantum computers. It is a stabilizer code that is defined on a two-dimensional lattice of qubits, with data qubits located on the vertices and ancilla qubits located on the faces of the lattice. The surface code has a high threshold error rate, meaning that it can tolerate a relatively large amount of noise in the physical qubits and still perform reliable quantum computation. It also has a relatively simple structure and nearest-neighbor interactions, which makes it potentially easier to implement in certain physical architectures.

SWAP Gate

The SWAP gate is a two-qubit quantum gate that swaps the states of two qubits. It can be represented by the matrix:

[[1, 0, 0, 0],
[0, 0, 1, 0],
[0, 1, 0, 0],
[0, 0, 0, 1]]

The SWAP gate is not a universal gate by itself, but it can be used in combination with other gates to implement any quantum computation. It is particularly useful for moving quantum information around in a quantum computer, especially when the qubit connectivity is limited.

Symmetry

In physics, a symmetry is a physical or mathematical feature of a system that remains unchanged under some transformation. Symmetries play a fundamental role in many areas of physics, including classical mechanics, electromagnetism, relativity, and quantum mechanics. According to Noether’s theorem, every continuous symmetry of a physical system corresponds to a conserved quantity. For example, the symmetry of physical laws under spatial translation leads to the conservation of linear momentum, and the symmetry under time translation leads to the conservation of energy. In quantum mechanics, symmetries are associated with operators that commute with the Hamiltonian of the system, and they lead to degeneracies in the energy spectrum and the existence of conserved quantum numbers.

Symmetry-Protected Topological (SPT) Phase

A symmetry-protected topological (SPT) phase is a phase of matter that exhibits topological order that is protected by a symmetry. SPT phases are generalizations of topological insulators and superconductors to interacting systems. They have a bulk energy gap and no fractionalized excitations, but they have non-trivial edge states that are protected by the symmetry. SPT phases are classified by the symmetry group that protects them and the dimension of space.

T Gate

The T gate is a single-qubit quantum gate that adds a phase of π/4 to the |1⟩ state and leaves the |0⟩ state unchanged. It is represented by the matrix:

[[1, 0],
[0, e^(iπ/4)]]

The T gate is also known as the π/8 gate. It is not a Clifford gate, but when combined with Clifford gates, it forms a universal gate set, meaning that any quantum operation can be approximated to arbitrary accuracy using only T gates and Clifford gates. The T gate is often used in quantum error correction and fault-tolerant quantum computation.

Target State

In quantum computing and quantum control, the target state is the desired quantum state that one wants to prepare or reach at the end of a quantum algorithm or a control process. The target state can be a specific pure state, such as an entangled state or the ground state of a Hamiltonian, or it can be a mixed state described by a density matrix. The goal of many quantum algorithms and control protocols is to steer the quantum system from an initial state to the target state with high fidelity.

Teleportation

See Quantum Teleportation

Tensor Network

A tensor network is a mathematical representation of a many-body quantum state or an operator as a network of interconnected tensors. Tensor networks provide a compact and efficient way to describe certain classes of quantum states, particularly those with limited entanglement, such as ground states of gapped local Hamiltonians in one dimension. Examples of tensor networks include matrix product states (MPS), projected entangled pair states (PEPS), and the multiscale entanglement renormalization ansatz (MERA). Tensor networks have found applications in various areas of condensed matter physics, quantum chemistry, and quantum information science, including the simulation of quantum many-body systems and the development of quantum algorithms.

Tensor Product

The tensor product is a mathematical operation that combines two or more vector spaces to form a larger vector space. In quantum mechanics, the tensor product is used to describe the state space of a composite quantum system in terms of the state spaces of its subsystems. If system A has a state space described by the Hilbert space H_A and system B has a state space described by H_B, then the state space of the composite system AB is given by the tensor product H_A ⊗ H_B.

The tensor product of two state vectors |ψ_A⟩ and |ψ_B⟩ is denoted as |ψ_A⟩ ⊗ |ψ_B⟩ or simply |ψ_A⟩|ψ_B⟩.

The tensor product is a fundamental concept in quantum mechanics and is used extensively in quantum information theory and quantum computing.

Thermal Equilibrium

Thermal equilibrium is a state of a system in which there is no net flow of thermal energy between any of its parts, and the temperature is uniform throughout the system. In classical thermodynamics, a system in thermal equilibrium is characterized by a well-defined temperature and is described by the laws of statistical mechanics. In quantum mechanics, a system in thermal equilibrium is described by a thermal state, which is a mixed state with a density matrix given by the Boltzmann distribution. Thermal equilibrium is an important concept in statistical mechanics, thermodynamics, and quantum information theory.

Thermal State

A thermal state, also known as a Gibbs state, is a mixed quantum state that describes a system in thermal equilibrium with a heat bath at a given temperature. The density matrix of a thermal state is given by ρ = exp(-βH)/Z, where H is the Hamiltonian of the system, β = 1/(kT) is the inverse temperature (k is Boltzmann’s constant and T is the temperature), and Z = Tr[exp(-βH)] is the partition function. Thermal states are important in statistical mechanics and quantum thermodynamics, and they are often used as initial states for quantum simulations.

Thermodynamics

Thermodynamics is a branch of physics that deals with the relationships between heat, work, temperature, and energy. It describes the behavior of macroscopic systems in terms of state variables such as temperature, pressure, volume, and internal energy. The four laws of thermodynamics govern the fundamental principles of energy transfer and conversion. The first law is the principle of energy conservation, the second law introduces the concept of entropy and the directionality of natural processes, the third law states that the entropy of a perfect crystal approaches zero as the temperature approaches absolute zero, and the zeroth law establishes the concept of temperature and thermal equilibrium. Thermodynamics has wide-ranging applications in various fields of science and engineering.

Threshold Theorem

The threshold theorem, also known as the quantum fault-tolerance theorem, is a fundamental result in quantum computation that states that it is possible to perform arbitrarily long quantum computations with arbitrarily high accuracy, provided that the error rate per qubit and per gate operation is below a certain threshold value.

The threshold theorem guarantees that quantum error correction and fault-tolerant protocols can be used to suppress the accumulation of errors during a computation, as long as the physical error rate is below the threshold.

The exact value of the threshold depends on the specific error correction code and fault-tolerance scheme used, but it is typically estimated to be around 10^-3 to 10^-2.

Tight-Binding Model

The tight-binding model is an approach to the calculation of electronic band structure in solids. It starts from the assumption that the electrons are tightly bound to their respective atoms and only weakly interact with the neighboring atoms. In the tight-binding model, the crystal Hamiltonian is approximated by considering only the on-site atomic energies and the hopping integrals between neighboring atoms. The tight-binding model is widely used in condensed matter physics to describe the electronic properties of various materials, including metals, semiconductors, and insulators. It is particularly useful for describing systems with narrow energy bands, such as transition metal oxides and organic semiconductors.

Time Crystal

A time crystal is a phase of matter that exhibits periodic behavior in time, analogous to the periodic arrangement of atoms in a regular crystal. Unlike ordinary crystals, which are periodic in space, time crystals are periodic in both space and time. The concept of time crystals was first proposed by Frank Wilczek in 2012, and their existence was experimentally confirmed in 2017. Time crystals are examples of non-equilibrium phases of matter and have potential applications in quantum information processing and metrology.

Time-Dependent Hamiltonian

A time-dependent Hamiltonian is a Hamiltonian that changes over time. In quantum mechanics, the Hamiltonian describes the total energy of a system and governs its time evolution through the Schrödinger equation. A time-dependent Hamiltonian arises when the system is subjected to external fields or interactions that vary with time. Time-dependent Hamiltonians are used to describe various phenomena, such as the interaction of atoms with electromagnetic radiation, the operation of quantum gates in a quantum computer, and non-equilibrium processes in quantum systems.

Time-Dependent Schrödinger Equation

The time-dependent Schrödinger equation is a fundamental equation in quantum mechanics that describes how the quantum state of a physical system evolves over time. It is given by:

iħ ∂|ψ(t)⟩/∂t = H(t)|ψ(t)⟩

where i is the imaginary unit, ħ is the reduced Planck constant, |ψ(t)⟩ is the state vector of the system at time t, H(t) is the Hamiltonian operator of the system, and ∂/∂t denotes the partial derivative with respect to time. The time-dependent Schrödinger equation is a linear partial differential equation that governs the dynamics of quantum systems, and it is one of the central postulates of quantum mechanics.

Time-Independent Schrödinger Equation

The time-independent Schrödinger equation is a time-independent form of the Schrödinger equation that describes the stationary states of a quantum system with a time-independent Hamiltonian. It is given by:

H|ψ⟩ = E|ψ⟩

where H is the Hamiltonian operator, |ψ⟩ is the state vector of the system, and E is the energy of the system. The time-independent Schrödinger equation is an eigenvalue equation, where the eigenvalues E represent the possible energy levels of the system, and the eigenvectors |ψ⟩ represent the corresponding stationary states. Solving the time-independent Schrödinger equation is a central problem in quantum mechanics and is used to determine the energy spectrum and wave functions of various quantum systems.

Time-Reversal Symmetry

Time-reversal symmetry is a fundamental symmetry of physical laws under the transformation of time reversal, t → -t. In classical physics, most fundamental laws are time-reversal symmetric, meaning that if a process is allowed, then the time-reversed process is also allowed. In quantum mechanics, time-reversal symmetry is implemented by an anti-unitary operator that involves complex conjugation. While the fundamental laws of physics are believed to be largely time-reversal symmetric, the second law of thermodynamics introduces an arrow of time, and certain processes in particle physics, such as the weak interaction, are known to violate time-reversal symmetry.

Toffoli Gate

The Toffoli gate, also known as the controlled-controlled-not (CCNOT) gate, is a three-qubit quantum gate that is universal for classical computation. It has two control qubits and one target qubit. The Toffoli gate flips the target qubit if and only if both control qubits are in the |1⟩ state. It can be represented by the matrix:

[[1, 0, 0, 0, 0, 0, 0, 0],
[0, 1, 0, 0, 0, 0, 0, 0],
[0, 0, 1, 0, 0, 0, 0, 0],
[0, 0, 0, 1, 0, 0, 0, 0],
[0, 0, 0, 0, 1, 0, 0, 0],
[0, 0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 1],
[0, 0, 0, 0, 0, 0, 1, 0]]

The Toffoli gate can be used to implement any classical logic gate, and when combined with the Hadamard gate, it forms a universal set of gates for quantum computation.

Tomography

See Quantum Tomography

Topological Quantum Computing

Topological quantum computing is an approach to building fault-tolerant quantum computers that uses topological properties of certain quantum systems to protect quantum information from errors. In topological quantum computing, qubits are encoded in the topological states of quasiparticles called anyons, which can exist in certain two-dimensional systems. The braiding of these anyons can be used to perform quantum gates, and the topological nature of the system protects the quantum information from local perturbations and decoherence. Topological quantum computing is a promising approach to achieving fault tolerance, but it requires the creation and manipulation of exotic states of matter.

Topological Qubit

A topological qubit is a type of qubit that is based on the topological properties of certain quantum systems, such as anyons in a two-dimensional electron gas. Unlike conventional qubits, which are based on the properties of individual particles or localized degrees of freedom, topological qubits are inherently non-local and are protected from local sources of noise and decoherence. This makes them promising candidates for building fault-tolerant quantum computers. The most well-known example of a topological qubit is based on Majorana zero modes in topological superconductors.

Topology

Topology is a branch of mathematics that studies the properties of geometric objects that are preserved under continuous deformations, such as stretching, bending, and twisting. Topological properties are those that do not depend on the specific shape or size of an object but rather on its global structure. Topology has important applications in various areas of physics, including condensed matter physics, where it is used to classify topological phases of matter, and quantum field theory, where it is used to study topological defects and solitons.

Total Variation Distance

The total variation distance is a measure of the difference between two probability distributions. Given two probability distributions P and Q over the same sample space Ω, the total variation distance between them is defined as:

δ(P, Q) = (1/2) Σ_x∈Ω |P(x) – Q(x)|

The total variation distance ranges from 0 to 1, with 0 indicating that the two distributions are identical and 1 indicating that they are completely different. In quantum information theory, the total variation distance can be used to quantify the distinguishability of two quantum states or the difference between two quantum channels.

Transistor

A transistor is a semiconductor device used to amplify or switch electronic signals and electrical power. It is the fundamental building block of modern electronic devices, including computers, smartphones, and other integrated circuits. Transistors are typically made from silicon or other semiconductor materials and have three terminals: the source, the drain, and the gate. By applying a voltage to the gate, the conductivity between the source and the drain can be controlled, allowing the transistor to act as a switch or an amplifier. The invention of the transistor in 1947 revolutionized electronics and paved the way for the development of modern digital technology.

Transmon Qubit

A transmon qubit is a type of superconducting qubit that is widely used in superconducting quantum computing. It is an improved version of the Cooper-pair box qubit, designed to be less sensitive to charge noise. The transmon qubit consists of a Josephson junction shunted by a large capacitor, which reduces the qubit’s sensitivity to charge fluctuations while maintaining sufficient anharmonicity for qubit operations. Transmon qubits have demonstrated long coherence times and high gate fidelities, making them one of the leading qubit platforms for building quantum computers.

Transport

In physics, transport refers to the movement of particles, energy, or other physical quantities from one location to another. Transport phenomena play an important role in various areas of science and engineering, including fluid dynamics, heat transfer, and electrical conduction. In condensed matter physics, transport properties such as electrical conductivity, thermal conductivity, and diffusion are used to characterize the behavior of materials and to probe their electronic and magnetic structure.

Trapped-Ion Quantum Computing

Trapped-ion quantum computing is an approach to building quantum computers that uses ions (charged atoms) trapped in electromagnetic fields as qubits. The ions are typically confined in a linear Paul trap, where they form a linear chain and can be individually addressed and manipulated using laser beams. Quantum information is encoded in the electronic states of the ions, and quantum gates are implemented by using lasers to couple the internal states of the ions to their collective motional modes. Trapped-ion qubits have demonstrated very long coherence times and high gate fidelities, making them one of the most promising platforms for quantum computing.

Traveling Wave Parametric Amplifier (TWPA)

A traveling wave parametric amplifier (TWPA) is a type of low-noise amplifier that is used in superconducting quantum computing to amplify weak microwave signals, such as those used for qubit readout. TWPAs are based on the principle of parametric amplification, where a nonlinear medium is used to amplify a signal by modulating a parameter of the medium at twice the signal frequency. TWPAs can achieve near-quantum-limited noise performance over a broad bandwidth, making them ideal for amplifying the signals from superconducting qubits.

Triplet State

A triplet state is a quantum state of a system with a total spin angular momentum of S=1. For a system of two spin-1/2 particles, such as electrons, the triplet state is a combination of the individual spin states that results in a total spin of 1. Unlike the singlet state, which has a total spin of 0, the triplet state has three possible values for the z-component of the spin: -1, 0, and +1. In the context of two spin-1/2 particles, the triplet states are often written as |↑↑⟩, (|↑↓⟩ + |↓↑⟩)/√2, and |↓↓⟩. Triplet states play an important role in various areas of physics and chemistry, including magnetic resonance, photochemistry, and the behavior of certain types of molecules.

Tunneling

See Quantum Tunneling

Two-Qubit Gate

A two-qubit gate is a quantum gate that operates on two qubits simultaneously. Two-qubit gates are essential for creating entanglement between qubits and performing universal quantum computation. The most common example of a two-qubit gate is the controlled-NOT (CNOT) gate, which flips the state of the target qubit if and only if the control qubit is in the |1⟩ state. Other examples of two-qubit gates include the SWAP gate, the controlled-phase gate, and the iSWAP gate. Two-qubit gates, together with single-qubit gates, form a universal set of gates for quantum computation.

Type-I Superconductor

A type-I superconductor is a type of superconductor that exhibits a complete Meissner effect below a critical temperature and a critical magnetic field. In the Meissner effect, the superconductor expels all magnetic fields from its interior, except for a thin surface layer. Type-I superconductors are typically pure metals, such as lead, mercury, and tin. They have a relatively low critical temperature and critical magnetic field compared to type-II superconductors.

Type-II Superconductor

A type-II superconductor is a type of superconductor that exhibits two critical magnetic fields, H_c1 and H_c2. Below H_c1, the superconductor is in the Meissner state and expels all magnetic fields. Between H_c1 and H_c2, the superconductor enters a mixed state, also known as the vortex state, where the magnetic field penetrates the material in the form of quantized vortices. Above H_c2, the superconductivity is destroyed, and the material returns to its normal state.

Type-II superconductors are typically alloys or compounds, such as niobium-titanium (NbTi) and niobium-tin (Nb₃Sn). They have higher critical temperatures and critical magnetic fields than type-I superconductors and are used in various applications, including high-field magnets for MRI machines and particle accelerators.

Ultracold Atom

An ultracold atom is an atom that has been cooled to temperatures very close to absolute zero, typically in the microkelvin or nanokelvin range. At these extremely low temperatures, the quantum mechanical properties of the atoms become prominent, and they can exhibit phenomena such as Bose-Einstein condensation and superfluidity. Ultracold atoms are used as a platform for quantum simulation, quantum computing, and precision measurements. They can be trapped and manipulated using laser beams and magnetic fields, and their interactions can be precisely controlled.

Uncertainty Principle

The uncertainty principle is a fundamental concept in quantum mechanics that states that certain pairs of physical properties of a quantum system, such as position and momentum, cannot both be known to arbitrary precision simultaneously. The more accurately one property is known, the less accurately the other can be known. The uncertainty principle was first formulated by Werner Heisenberg in 1927 and is a consequence of the wave-particle duality of quantum objects. The most common form of the uncertainty principle is the Heisenberg uncertainty relation for position (x) and momentum (p):

Δx Δp ≥ h/4π

where Δx and Δp are the uncertainties in position and momentum, respectively, and h is Planck’s constant. The uncertainty principle has profound implications for the interpretation of quantum mechanics and sets fundamental limits on the precision of measurements.

Uncomputation

Uncomputation is a technique used in quantum computing to reverse the effects of a previous computation and return a set of qubits to their initial state. Uncomputation is often necessary to remove entanglement between ancilla qubits and data qubits, allowing the ancilla qubits to be reused in subsequent computations. It is also used to clean up intermediate states and reduce the accumulation of errors in a quantum circuit. Uncomputation is typically achieved by applying the inverse of the original computation in reverse order.

Unitary

In quantum mechanics, a unitary transformation (or unitary operator) is a transformation that preserves the inner product between quantum states. In other words, if U is a unitary operator, and |ψ⟩ and |φ⟩ are two quantum states, then ⟨ψ|φ⟩ = ⟨Uψ|Uφ⟩.

Unitary transformations are important because they describe the time evolution of closed quantum systems, and they also represent quantum gates in quantum computing.

A unitary operator U satisfies the condition U^†U = UU^† = I, where U^† is the Hermitian conjugate (adjoint) of U and I is the identity operator.

Unitary Matrix

A unitary matrix is a complex square matrix whose conjugate transpose is also its inverse. In other words, a matrix U is unitary if U^†U = UU^† = I, where U^† is the conjugate transpose of U and I is the identity matrix. Unitary matrices represent unitary transformations in quantum mechanics, and they play a crucial role in describing the evolution of quantum states and the implementation of quantum gates. The determinant of a unitary matrix has an absolute value of 1.

Unitary Transformation

See Unitary.

Universal Gate Set

A universal gate set is a set of quantum gates that can be used to approximate any unitary transformation on any number of qubits to arbitrary accuracy. In other words, any quantum operation can be decomposed into a sequence of gates from a universal gate set. A common example of a universal gate set is the set containing the Hadamard gate, the T gate, and the CNOT gate. Another example is the set containing all single-qubit gates and the CNOT gate. The concept of universality is important for building quantum computers, as it guarantees that a quantum computer capable of implementing a universal gate set can perform any quantum computation.

Universal Quantum Computer

A universal quantum computer is a quantum computer that can perform any quantum computation, given enough time and resources. It can implement any unitary transformation on any number of qubits, up to a desired accuracy. To be universal, a quantum computer must be able to implement a universal set of quantum gates, which can be used to approximate any quantum operation. The concept of universality is important because it guarantees that a universal quantum computer can, in principle, simulate any quantum system and execute any quantum algorithm.

Vacuum Rabi Splitting

Vacuum Rabi splitting is a phenomenon that occurs in cavity quantum electrodynamics (cQED) when a quantum emitter, such as an atom or a quantum dot, is strongly coupled to a cavity mode. In the strong coupling regime, the interaction between the emitter and the cavity mode leads to the formation of two new energy levels, which are separated by an energy difference proportional to the coupling strength. This splitting of the energy levels is called vacuum Rabi splitting because it occurs even in the absence of any photons in the cavity, i.e., when the cavity is in its vacuum state. Vacuum Rabi splitting is a signature of strong light-matter interaction and is important for various quantum information processing applications.

Vacuum State

In quantum field theory, the vacuum state, often denoted as |0⟩, is the quantum state with the lowest possible energy. It is the state that contains no particles or excitations. In quantum optics, the vacuum state represents the absence of photons in a particular mode of the electromagnetic field. Despite its name, the vacuum state is not simply “nothing”; it has non-trivial properties due to quantum fluctuations, and it plays an important role in various quantum phenomena, such as the Casimir effect and spontaneous emission.

Valence Band

In solid-state physics, the valence band is the highest range of electron energies in a solid where electrons are normally present at absolute zero temperature. It is typically filled or nearly filled with electrons. The electrons in the valence band are usually tightly bound to the atoms and are responsible for the chemical bonding in the solid. The energy band above the valence band is called the conduction band, and the energy difference between the top of the valence band and the bottom of the conduction band is called the band gap. The properties of the valence band and the conduction band determine the electrical conductivity of a material.

Variational Quantum Algorithm

A variational quantum algorithm is a type of quantum algorithm that uses a hybrid quantum-classical approach to solve optimization problems. Variational quantum algorithms typically involve a parameterized quantum circuit, called an ansatz, that is prepared on a quantum computer. The parameters of the circuit are then optimized using a classical optimization algorithm, based on measurements performed on the quantum state. The goal is to find the parameters that minimize a given cost function, which encodes the solution to the optimization problem. Examples of variational quantum algorithms include the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA).

Variational Quantum Eigensolver (VQE)

The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the ground state energy and the ground state of a quantum system, such as a molecule or a material. VQE uses a quantum computer to prepare a parameterized trial wave function, called an ansatz, and measure the expectation value of the Hamiltonian. A classical computer is then used to optimize the parameters of the ansatz to minimize the expectation value of the Hamiltonian. VQE is one of the most promising near-term quantum algorithms and has been used to study small molecules and other quantum systems.

Vector Space

A vector space is a mathematical structure that consists of a set of objects called vectors, which can be added together and multiplied by scalars (numbers). Vector spaces are fundamental to linear algebra and have applications in various areas of mathematics, physics, and engineering. In quantum mechanics, the state space of a quantum system is a complex vector space called a Hilbert space, and quantum states are represented by vectors in this space.

Verification

In the context of quantum computing, verification refers to the process of checking whether a quantum computer or a quantum device is functioning correctly and producing the expected results. Verification can involve testing the performance of individual components, such as qubits and gates, as well as validating the overall behavior of the system when executing quantum algorithms. Verification is crucial for ensuring the reliability and accuracy of quantum computations and for building trust in quantum technologies.

Visibility

In optics and photonics, visibility is a measure of the contrast in an interference pattern. It is defined as (I_max - I_min)/(I_max + I_min), where _Imax and _Imin are the maximum and minimum intensities of the interference fringes, respectively. In the context of quantum optics and quantum information processing, visibility is often used to quantify the quality of single-photon sources, the degree of entanglement between photons, and the fidelity of quantum gates.

Von Neumann Architecture

The von Neumann architecture is a computer architecture that uses a single address space for both instructions and data. It was proposed by mathematician and physicist John von Neumann in 1945 and is the basis for most modern digital computers. In the von Neumann architecture, a central processing unit (CPU) fetches instructions and data from a shared memory, performs operations on the data, and stores the results back in memory. The von Neumann architecture is in contrast to the Harvard architecture, which uses separate address spaces for instructions and data.

Von Neumann Entropy

The von Neumann entropy is a measure of the uncertainty or randomness in a quantum state. It is the quantum mechanical analogue of the classical Shannon entropy. Given a quantum state described by a density matrix ρ, the von Neumann entropy is defined as S(ρ) = -Tr(ρ log ρ), where Tr denotes the trace operation. The von Neumann entropy is zero for a pure state and positive for a mixed state, reaching its maximum value for a maximally mixed state. It plays a fundamental role in quantum information theory, quantum statistical mechanics, and quantum thermodynamics.

Von Neumann Measurement

A von Neumann measurement, also known as a projective measurement or a strong measurement, is a type of quantum measurement that projects the state of a quantum system onto one of the eigenstates of an observable. After a von Neumann measurement, the system is left in the eigenstate corresponding to the measurement outcome. Von Neumann measurements are described by a set of projection operators that form a complete set, meaning that they sum to the identity operator. They are often used as an idealized model of measurement in quantum mechanics and quantum information theory.

Vortex

In physics, a vortex is a region in a fluid where the flow rotates around an axis line, which may be straight or curved. Vortices are commonly observed in nature, such as in whirlpools, tornadoes, and the rings of smoke. In quantum mechanics, vortices can occur in superfluids and superconductors, where they are quantized and carry a discrete amount of angular momentum or magnetic flux. In type-II superconductors, magnetic flux can penetrate the material in the form of quantized vortices, which can be arranged in a regular lattice known as a vortex lattice or Abrikosov lattice.

VQE

See Variational Quantum Eigensolver

W State

The W state is a type of entangled quantum state of three qubits that has the form:

|W⟩ = (|001⟩ + |010⟩ + |100⟩)/√3

The W state is an example of a genuinely multipartite entangled state, meaning that it cannot be written as a product state of its subsystems. It is also an example of a state that is maximally entangled in a certain sense, as it has the maximum possible average entanglement between any one qubit and the other two. The W state is used in various quantum information processing tasks, such as quantum communication and quantum error correction.

Wave Function

In quantum mechanics, the wave function is a mathematical description of the quantum state of a particle or a system of particles. It is a complex-valued function of the coordinates and time, and it contains all the information about the system that can be known. The wave function is denoted by the Greek letter ψ (psi). The absolute square of the wave function, |ψ|², gives the probability density of finding the particle(s) at a particular position and time. The wave function evolves in time according to the Schrödinger equation.

Wave-Particle Duality

Wave-particle duality is a fundamental concept in quantum mechanics that states that all particles, such as electrons, photons, and atoms, exhibit both wave-like and particle-like properties. This means that particles can behave like waves, exhibiting phenomena such as interference and diffraction, and they can also behave like particles, having a well-defined position and momentum. The wave-particle duality is encapsulated in the de Broglie relation, λ = h/p, which relates the wavelength λ of a particle to its momentum p through Planck’s constant h. Wave-particle duality is a central concept in quantum mechanics and has been experimentally verified for various types of particles.

Waveguide

A waveguide is a structure that guides waves, such as electromagnetic waves or sound waves, along a specific path. Waveguides are used in various applications, including telecommunications, microwave engineering, and optics. In the context of quantum computing, waveguides can be used to guide photons in photonic quantum computing or to couple superconducting qubits in superconducting quantum computing. For example, coplanar waveguide resonators are often used to mediate interactions between transmon qubits and to perform qubit readout.

Weak Measurement

A weak measurement is a type of quantum measurement that minimally disturbs the state of the measured system. Unlike strong (projective) measurements, which significantly alter the state of the system, weak measurements extract a small amount of information about an observable while preserving the coherence of the system. Weak measurements are characterized by a weak coupling between the system and the measurement apparatus, followed by post-selection on a specific outcome. The concept of weak measurements was introduced by Yakir Aharonov, David Albert, and Lev Vaidman, and it has led to the notion of weak values, which can take on values outside the eigenvalue spectrum of the measured observable.

Weyl Fermion

A Weyl fermion is a type of massless fermion that has a definite chirality, meaning that its spin is either aligned or anti-aligned with its momentum. Weyl fermions were first predicted by Hermann Weyl in 1929 as solutions to the Dirac equation, but they were long thought to be only theoretical constructs. However, in recent years, Weyl fermions have been discovered as quasiparticle excitations in certain materials called Weyl semimetals. Weyl fermions have unique properties, such as the chiral anomaly and the existence of Fermi arcs on the surface of Weyl semimetals, which make them interesting for both fundamental physics and potential applications in electronics and spintronics.

Work Function

The work function is the minimum amount of energy required to remove an electron from the surface of a solid to a point in the vacuum immediately outside the surface. It is a property of the material and depends on the crystal structure, surface orientation, and surface condition. The work function is typically measured in electron volts (eV). It plays an important role in various phenomena, such as thermionic emission, photoelectric effect, and field emission. In the context of quantum computing, the work function can affect the performance of superconducting qubits and other quantum devices that rely on the emission or absorption of electrons.

X Gate

The X gate, also known as the NOT gate, is a single-qubit quantum gate that performs a bit-flip operation on a qubit. It maps the |0⟩ state to the |1⟩ state and the |1⟩ state to the |0⟩ state. The X gate is represented by the Pauli X matrix:

[[0, 1],
[1, 0]]

The X gate is analogous to the classical NOT gate and is a fundamental component of many quantum circuits.

XY Model

The XY model is a theoretical model in statistical mechanics and condensed matter physics that describes a system of spins arranged on a lattice, where each spin can rotate in a two-dimensional plane. The spins interact with their nearest neighbors through an interaction that depends on the relative orientation of their in-plane components. The XY model is used to study various phenomena, such as phase transitions, magnetism, and superfluidity. It is also used in quantum simulation, where it can be implemented using systems of ultracold atoms or trapped ions.

Y Gate

The Y gate is a single-qubit quantum gate that performs a combination of a bit-flip and a phase-flip operation on a qubit. It is represented by the Pauli Y matrix:

[[0, -i],
[i, 0]]

where i is the imaginary unit. The Y gate maps the |0⟩ state to i|1⟩ and the |1⟩ state to -i|0⟩. It is one of the three Pauli gates, along with the X gate and the Z gate.

YIG (Yttrium Iron Garnet)

YIG, which stands for yttrium iron garnet, is a type of synthetic garnet that has the chemical formula Y₃Fe₂(FeO₄)₃, or Y₃Fe₅O₁₂. YIG is a ferrimagnetic material that exhibits low damping of spin waves and has a narrow ferromagnetic resonance linewidth. It is widely used in microwave and magneto-optical devices, such as circulators, isolators, and filters.

In the context of quantum computing, YIG has been used to create hybrid quantum systems, where magnons (the quanta of spin waves) in YIG are coupled to superconducting qubits or other quantum systems.

Young’s Double-Slit Experiment

Young’s double-slit experiment is a famous experiment in physics that demonstrates the wave-particle duality of light and matter. It was first performed by Thomas Young in 1801 using light, and later with electrons and other particles. In the experiment, a coherent beam of light or particles is passed through two closely spaced slits, and the resulting pattern is observed on a screen behind the slits. The pattern shows an interference pattern of bright and dark fringes, which is a characteristic of wave behavior. However, when the particles are detected one by one, they arrive at the screen as discrete particles, demonstrating their particle-like nature. Young’s double-slit experiment is a fundamental demonstration of the principles of quantum mechanics and has been used to illustrate various quantum phenomena, such as superposition and complementarity.

Yukawa Interaction

The Yukawa interaction is a type of interaction between a scalar field and a fermion field that was originally proposed by Hideki Yukawa in 1935 to describe the nuclear force between protons and neutrons. The Yukawa interaction is mediated by the exchange of a massive scalar particle, which in the case of the nuclear force is the pion.

The Yukawa potential has the form:

V(r) = -g²(e^-r/λ)/r

where g is a coupling constant, r is the distance between the particles, and λ is the range of the interaction, which is inversely proportional to the mass of the exchanged particle.

The Yukawa interaction is also used in particle physics to describe the interaction between the Higgs field and fermions, which gives rise to the masses of elementary particles.

Z Gate

The Z gate is a single-qubit quantum gate that performs a phase-flip operation on a qubit. It leaves the |0⟩ state unchanged and maps the |1⟩ state to -|1⟩. The Z gate is represented by the Pauli Z matrix:

[[1, 0],
[0, -1]]

The Z gate is its own inverse, meaning that applying the Z gate twice to a qubit returns it to its original state. It is one of the three Pauli gates, along with the X gate and the Y gate.

Zeeman Effect

The Zeeman effect is the splitting of atomic spectral lines into several components in the presence of a static magnetic field. It was first observed by Pieter Zeeman in 1896. The Zeeman effect arises from the interaction between the magnetic moment of an atom and the external magnetic field, which leads to a shift in the energy levels of the atom. The Zeeman effect can be used to measure the strength of magnetic fields and to study the properties of atoms and molecules. In quantum computing, the Zeeman effect can be used to control and manipulate the states of certain types of qubits, such as those based on electron or nuclear spins.

Zero-Point Energy

The zero-point energy is the lowest possible energy that a quantum mechanical system can have, even at absolute zero temperature. It is a consequence of the Heisenberg uncertainty principle, which implies that a quantum system cannot have both a definite position and a definite momentum simultaneously. The zero-point energy is associated with the quantum fluctuations of the system in its ground state. For example, a harmonic oscillator has a zero-point energy of (1/2)ħω, where ħ is the reduced Planck constant and ω is the angular frequency of the oscillator. The zero-point energy has observable consequences, such as the Casimir effect, and it plays an important role in various areas of physics, including quantum field theory and cosmology.

Zero-Point Fluctuations

Zero-point fluctuations, also known as quantum fluctuations, are the temporary changes in the amount of energy at a point in space, arising from the Heisenberg uncertainty principle. Even in a vacuum, where there are no particles or fields present, the energy is not exactly zero but fluctuates around a minimum value due to the zero-point energy. These fluctuations can give rise to virtual particle-antiparticle pairs that spontaneously pop into existence and then annihilate each other. Zero-point fluctuations have observable consequences, such as the Casimir effect and the Lamb shift, and they play an important role in quantum field theory, cosmology, and the study of quantum vacuum.

Zitterbewegung

Zitterbewegung is a theoretical rapid oscillatory motion of elementary particles, particularly fermions like electrons, that are described by the Dirac equation. The term was coined by Erwin Schrödinger in 1930 as a result of his analysis of the solutions to the Dirac equation for a free relativistic electron, where an interference between positive and negative energy states leads to a fluctuation of the electron’s position around its average trajectory with a frequency of 2mc²/ħ, or approximately 1.6 x 10²¹ Hz. The Zitterbewegung has not yet been directly observed experimentally, but it has been simulated using trapped ions and other quantum systems.

Zone Plate

A zone plate is a diffractive optical device that focuses light using a series of concentric rings, called zones, that alternate between being opaque and transparent. The zones are spaced in such a way that the diffracted light from each transparent zone interferes constructively at the desired focal point. Zone plates can be used as lenses in various applications where conventional refractive lenses are difficult to manufacture or use, such as in X-ray microscopy and lithography. In quantum computing, zone plates can be used to focus and manipulate ion beams in trapped-ion systems.

Tags:

Quantum Computing Quantum Computing Glossary