Quantum Computing Glossary

A

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 is 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 to the ground state. 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, 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, typically fabricated using superconducting circuits or semiconductor materials, that 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, typically operating in a vacuum. The trap uses a combination of electric and magnetic fields to 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.

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. 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. 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.

↑ Back to top

B

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.

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. 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.

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. 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.

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.

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. Solving boson sampling problems could demonstrate the quantum computational advantage of photonic systems over classical computers.

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.

Bra-Ket Notation

Bra-ket notation, also known as Dirac notation, is a standard notation for describing quantum states in quantum mechanics, 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.

↑ Back to top

C

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 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. 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). 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

Cloud-based quantum 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 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 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.

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. 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. When cosmic rays interact 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 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. 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.

↑ Back to top

D

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.

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.

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.

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.

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 centre of the Earth. It consists of two opposing diamonds with a sample placed between their culets (tips). 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) centres, as qubits. NV centres 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 centre 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.

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 quantum computing, 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 centres 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.

Dirac Notation

Dirac notation, also known as bra-ket notation, is a standard notation for describing quantum states in quantum mechanics, 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. 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.

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.

↑ Back to top

E

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 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 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. In quantum computing, ESR can be used to manipulate and read out the state of electron spin qubits, particularly in systems like nitrogen-vacancy centres 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. 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 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 and then calculating the von Neumann entropy of the reduced density matrix of one of the subsystems.

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 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 is the controlled-NOT (CNOT) gate. 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.

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 colour code, are designed to detect and correct errors that occur during quantum computation. Error correction is essential for building fault-tolerant quantum computers.

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. 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. 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 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.

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. 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. 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 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.

↑ Back to top

F

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.

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.

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 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 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. 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 correspond to clockwise and counterclockwise supercurrents. Flux qubits are typically controlled and measured using magnetic fields and microwave pulses.

Fluxon

A fluxon, also known as a magnetic flux quantum, is a quantum of magnetic flux that can exist in certain superconducting systems. 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.

Fourier Transform

The Fourier transform is a mathematical operation that decomposes a function of time (or space) into its constituent frequencies. 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 and reduce cross-talk with other qubits.

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. In quantum computing, quantum full adders can be implemented using quantum gates to perform arithmetic operations on quantum states.

↑ Back to top

G

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.

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.

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.

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.

Gottesman-Knill Theorem

The Gottesman-Knill theorem states that any quantum computation that involves only 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.

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.

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 optimization, machine learning, and cryptography.

↑ Back to top

H

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 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. 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. Hardware-efficient ansatze are often used in variational quantum algorithms, such as the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA).

High-Performance Computing (HPC)

High-performance computing (HPC) refers to the use of powerful computing systems, often supercomputers, to solve complex computational problems. 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. 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 have some potential advantages, such as weaker coupling to nuclear spins and the possibility of faster gate operations due to stronger spin-orbit coupling.

Hybrid Quantum Computing

Hybrid quantum computing refers to an approach that integrates quantum computers with classical computing resources, such as CPUs, GPUs, and FPGAs, to solve computational problems. Quantum computers are used as specialized accelerators to perform specific tasks that are more efficient on quantum hardware, while classical computers handle other parts of the computation.

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. 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 handles other parts and controls the overall execution. Variational quantum algorithms, such as VQE and QAOA, are examples of hybrid quantum-classical algorithms.

Hydrogen-like Atom

A hydrogen-like atom is an atom that consists of a single electron orbiting a nucleus with a positive 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.

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.

↑ Back to top

I

Impurities

In materials science, impurities are atoms or molecules that are different from the primary constituents of a material. In the context of quantum computing, impurities in solid-state systems, such as nitrogen-vacancy centres in diamond or dopants in silicon, can be used as qubits.

Initialization

Initialization, in the context of quantum computing, refers to the process of preparing a quantum system in a well-defined initial state before the start of a computation. Typically, qubits are initialized in their ground state, 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.

Integrated Photonics

Integrated photonics is a field of technology that involves the fabrication of photonic devices and circuits on a single chip. 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 computing, interference is exploited in many quantum algorithms. 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. In quantum optics and quantum computing, interferometers can be used to manipulate and measure the quantum states of photons.

Ion Trap

An ion trap is a device used to confine and isolate individual ions 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. Ion traps are used in trapped-ion quantum computing, where individual ions serve as qubits.

Ion Trap Quantum Computing

Ion trap quantum computing is an approach to building quantum computers that uses trapped ions as qubits. Individual ions are confined in an ion trap using electromagnetic fields, and their electronic states or motional modes encode quantum information. Quantum gates are implemented by applying laser or microwave pulses. Trapped-ion quantum computers have demonstrated long coherence times, high gate fidelities, and all-to-all connectivity.

↑ Back to top

J

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. The Josephson effect is a fundamental component of superconducting quantum computing.

Josephson Energy

The Josephson energy is a characteristic energy scale associated with a Josephson junction. 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.

Josephson Junction

A Josephson junction is a device consisting of two superconductors separated by a thin insulating barrier. It exhibits the Josephson effect and is a fundamental component in superconducting quantum computing, where it is used as a nonlinear element to create qubits. The properties of a Josephson junction can be engineered during fabrication to optimize the performance of superconducting qubits.

↑ Back to top

K

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. 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, denoted by the symbol |ψ⟩. Kets are vectors in a complex Hilbert space. The corresponding concept to a ket is a bra, denoted by ⟨ψ|. 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. Quantum key distribution (QKD) is a method 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 with periodic boundary conditions. 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). In superconducting quantum computing, klystrons are used to generate the microwave pulses that control and manipulate superconducting qubits.

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, every energy level of such a system is at least doubly degenerate. Kramers pairs can be used to encode robust qubits that are protected from certain types of noise.

↑ Back to top

L

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.

Lamb Shift

The Lamb shift is a small difference in energy between two energy levels of the hydrogen atom that 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.

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.

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 must be accompanied by a corresponding increase in entropy. 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.

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. Laser cooling is used in various quantum technologies, including 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. In quantum computing, lattices can be used to define the connectivity of qubits in certain architectures. 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 by discretizing spacetime into a lattice. 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 into higher energy levels. Leakage errors are particularly challenging 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. 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.

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, the energy levels exhibit an "avoided crossing."

Lindblad Equation

The Lindblad 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.

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.

Linear Optics

Linear optics is a branch of optics that deals with optical systems in which the output is linearly related to the input. Linear optics is used in various quantum information processing applications, such as linear optical quantum computing (LOQC).

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. Linear Paul traps are commonly used in trapped-ion quantum computing.

Liquid State NMR Quantum Computer

A liquid-state nuclear magnetic resonance (NMR) quantum computer uses the nuclear spins of molecules in a liquid solution as qubits. Quantum gates are implemented by applying radio-frequency pulses. Liquid-state NMR was one of the first experimental platforms for quantum computing.

Local Realism

Local realism is a combination of two assumptions: locality (physical influences cannot propagate faster than the speed of light) and realism (physical systems possess definite properties independent of measurement). Quantum mechanics violates local realism, as demonstrated by the violation of Bell's inequalities.

Locality

Locality is a principle in physics that states that physical influences cannot propagate faster than the speed of light. However, quantum mechanics exhibits non-local correlations, as demonstrated by the violation of Bell's inequalities.

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 properties of a logical qubit 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. In quantum computing, long-range interactions can be used to implement multi-qubit gates and create highly entangled states.

↑ Back to top

M

Magic State

A magic state is a special type of quantum state that, when combined with Clifford operations, can enable universal quantum computation. Magic states are necessary for certain quantum error correction schemes to achieve universality.

Magic State Distillation

Magic state distillation is a process 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.

Magnetic Flux Quantum

The magnetic flux quantum, denoted by Φ0, 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.

Magnetic Resonance

Magnetic resonance is a phenomenon that occurs when a system with a magnetic moment is placed in a static magnetic field and exposed to an oscillating magnetic field at the resonance frequency. It is the basis for techniques such as NMR and ESR, and is used in quantum computing to manipulate 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. In quantum computing, magnetic traps can be used to trap ions or neutral atoms that serve as qubits.

Magnetometry

Magnetometry is the measurement of magnetic fields. Quantum sensors, such as nitrogen-vacancy centres 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. 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 localized at zero energy at the edge or defect of a topological superconductor. Majorana zero modes are predicted to exhibit non-Abelian exchange statistics, making them promising candidates for building blocks of topological quantum computers.

Master Equation

A master equation describes the time evolution of the probability distribution or density matrix of a system undergoing a stochastic or open quantum process. In quantum mechanics, the most commonly used form is the Lindblad equation.

Measurement

In quantum mechanics, measurement is the process of extracting classical information from a quantum system. 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.

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. MBQC is equivalent in computational power to the circuit model.

Microwave Engineering

Microwave engineering is a branch of electrical engineering that deals with the study and application of microwave frequencies. In superconducting quantum computing, microwave engineering plays a crucial role in the design of control and readout electronics.

Microwave Pulse

A microwave pulse is a short burst of electromagnetic radiation in the microwave frequency range. In superconducting quantum computing, microwave pulses are used to control and manipulate the quantum states of superconducting qubits.

Mixed State

A mixed state is a statistical ensemble of pure quantum states, described by a density matrix rather than a single state vector. Mixed states arise when a quantum system interacts with its environment or when there is classical uncertainty about the system's state.

Mixer

In electronics, a mixer is a nonlinear circuit that combines two input signals to produce an output signal at a new frequency. In superconducting quantum computing, mixers are used to generate and manipulate the microwave signals that control and read out qubits.

Motional Mode

In trapped-ion quantum computing, a motional mode refers to a collective mode of motion of the trapped ions. These motional modes are used to mediate interactions between qubits and implement entangling gates.

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.

Multiplexing

Multiplexing is a technique used to combine multiple signals into a single channel. In quantum computing, multiplexing can be used to control and read out multiple qubits using a smaller number of control lines, helping improve scalability.

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. MUBs have applications in quantum state tomography and quantum cryptography.

Mølmer-Sørensen Gate

The Mølmer-Sørensen gate is a type of two-qubit entangling gate 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.

↑ Back to top

N

N-Qubit System

An N-qubit system is 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 are the fundamental building blocks of quantum computers.

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.

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 and are not yet fully fault-tolerant. These devices, also known as Noisy Intermediate-Scale Quantum (NISQ) computers, can be used to explore potential applications and develop quantum algorithms.

Neutral Atom

A neutral atom is an atom with equal numbers of protons and electrons, carrying no net electric charge. In quantum computing, neutral atoms can be used as qubits, with quantum information encoded in internal electronic states. They can be trapped using optical tweezers or optical lattices.

Nitrogen-Vacancy (NV) Centre

A nitrogen-vacancy (NV) centre is a type of point defect in the diamond crystal lattice. NV centres have unique optical and spin properties that make them promising for quantum technologies. The electronic spin of the NV centre can be used as a qubit, with long coherence times even at room temperature.

No-Cloning Theorem

The no-cloning theorem is a fundamental result in quantum mechanics that states it is impossible to create an identical copy of an arbitrary unknown quantum state. This has important implications for quantum information processing and quantum cryptography.

No-Communication Theorem

The no-communication theorem states that it is impossible to use entanglement alone to instantaneously transmit information between two distant parties. This 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. Various techniques, such as error correction and error mitigation, are used to combat the effects of noise.

Noise Characterization

Noise characterization is the process of identifying and quantifying the sources and types of noise that affect a quantum computing system. It is crucial for understanding the limitations of a quantum computer and developing effective error correction strategies.

Noise Model

A noise model is a mathematical description of the types and strengths of noise that affect a quantum computing system. Common noise models include the depolarizing channel, the amplitude damping channel, and the phase damping channel.

Noisy Intermediate-Scale Quantum (NISQ)

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. Despite their limitations, NISQ computers are valuable tools for exploring potential applications of quantum computing.

Non-Abelian Anyon

A non-Abelian anyon is a type of quasiparticle with non-Abelian exchange statistics, meaning that the order in which they are exchanged affects the quantum state of the system. This property makes them promising for topological quantum computers.

Non-Clifford Gate

A non-Clifford gate is a quantum gate that does not belong to the set of Clifford gates. Non-Clifford gates, such as the T gate, are necessary to achieve universal quantum computation when combined with Clifford gates.

Non-Demolition Measurement

A non-demolition measurement (quantum non-demolition or QND measurement) is a special type of measurement that does not disturb the measured observable, allowing for repeated measurements without altering its value.

Non-Local Correlations

Non-local correlations are correlations between measurement outcomes of spatially separated quantum systems that cannot be explained by any local realistic theory. The most famous example is the violation of Bell's inequalities.

NP (Non-deterministic Polynomial Time)

NP is a complexity class representing the set of decision problems for which a solution can be verified in polynomial time. It is widely believed, but not yet proven, that P ≠ NP.

NP-Complete

NP-complete is a class of decision problems within NP that are the "hardest" problems in NP. If a polynomial-time algorithm were found for any NP-complete problem, it would imply that P = NP.

NP-Hard

NP-hard is a class of problems that are at least as hard as the hardest problems in NP. Many optimization problems relevant to practical applications are NP-hard.

Nuclear Magnetic Resonance (NMR)

Nuclear Magnetic Resonance (NMR) is a phenomenon that occurs when atomic nuclei with non-zero nuclear spin are placed in a static magnetic field and exposed to a radio-frequency field. NMR has been used as a platform to demonstrate early quantum computing concepts.

Nuclear Spin

Nuclear spin is an intrinsic form of angular momentum possessed by atomic nuclei. In quantum computing, nuclear spins can be used as qubits. Nuclear spin qubits have long coherence times but can be challenging to manipulate.

Number State

A number state, also known as a Fock state, is a quantum state of a harmonic oscillator with a definite number of energy quanta. Number states form a basis for the Hilbert space of the harmonic oscillator.

NV Centre Quantum Computing

NV centre quantum computing uses nitrogen-vacancy centres in diamond as qubits. The electronic spin of the NV centre serves as the qubit and can be manipulated using optical and microwave techniques. NV centre qubits have long coherence times even at room temperature.

↑ Back to top

O

One-Way Quantum Computing

One-way quantum computing, also known as measurement-based quantum computing (MBQC), proceeds by performing single-qubit measurements on a highly entangled resource state. The choice of measurement bases drives the computation forward.

Open Quantum System

An open quantum system is a quantum system that interacts with its environment. Unlike closed quantum systems, open quantum systems are subject to decoherence and dissipation, typically described by a master equation such as the Lindblad equation.

Operator

In quantum mechanics, an operator is a mathematical object that acts on quantum states and corresponds to a physical observable. The eigenvalues of an operator represent the possible measurement outcomes.

Optical Lattice

An optical lattice is a periodic potential created by the interference of multiple laser beams. Neutral atoms can be trapped in the lattice, forming a regular array that can be used in quantum computing and quantum simulation.

Optical Qubit

An optical qubit encodes quantum information in the properties of photons, such as polarization, path, or frequency. Optical qubits benefit from long coherence times and easy long-distance transmission.

Optical Tweezer

An optical tweezer is a scientific instrument that uses a highly focused laser beam to trap and manipulate microscopic objects. In quantum computing, optical tweezers can trap individual neutral atoms that serve as qubits.

Optimization Problem

An optimization problem is a computational problem where the goal is to find the best solution among a set of possible solutions. Quantum computing offers the potential to solve certain optimization problems more efficiently than classical computers.

Oracle

In computational complexity theory, an oracle is an abstract machine that can solve a specific decision problem in a single step. In quantum computing, oracles are used in algorithms like Grover's algorithm and the Deutsch-Jozsa algorithm.

Orbital

In atomic physics, an orbital is a mathematical function that describes the wave-like behavior of an electron in an atom or molecule. Orbitals are characterized by quantum numbers that specify their energy, shape, and spatial orientation.

Orthogonality

Orthogonality in quantum mechanics refers to two quantum states being mutually exclusive. Two states |ψ⟩ and |φ⟩ are orthogonal if their inner product is zero. The basis states |0⟩ and |1⟩ of a qubit are orthogonal.

Orthonormal Basis

An orthonormal basis is a set of basis vectors that are both orthogonal to each other and normalized. The computational basis {|0⟩, |1⟩} is an example of an orthonormal basis in quantum computing.

Overhead

In quantum computing, overhead refers to the additional resources (qubits and operations) required to implement fault-tolerant quantum computation using quantum error correction. The overhead can be significant, with some estimates suggesting thousands of physical qubits per logical qubit.

↑ Back to top

P

Parity

Parity refers to the behavior of a system under spatial inversion, or to the evenness or oddness of the number of 1s in a binary string. Parity checks are used in some error detection and correction schemes.

Partial Measurement

A partial measurement is performed on a subset of a larger quantum system, extracting partial information without fully collapsing the wavefunction. It is used in entanglement distillation and quantum error correction.

Particle Statistics

Particle statistics refers to the behavior of identical particles under exchange. Bosons follow Bose-Einstein statistics, while fermions follow Fermi-Dirac statistics.

Passive Qubit

A passive qubit does not require active control signals to maintain its coherence or perform quantum gates. Topological qubits based on Majorana zero modes are an example.

Path Integral

The path integral formulation of quantum mechanics, developed by Richard Feynman, expresses the probability amplitude as a sum over all possible paths a system can take, weighted by a complex phase factor.

Pauli Error

A Pauli error is a quantum error corresponding to one of the three Pauli matrices: X (bit flip), Y (bit and phase flip), or Z (phase flip). Pauli errors are a common model of noise in quantum computing.

Pauli Exclusion Principle

The Pauli exclusion principle states that two or more identical fermions cannot occupy the same quantum state simultaneously. It is responsible for the structure of atoms and the stability of matter.

Pauli Gates

The Pauli gates are three single-qubit quantum gates represented by the Pauli matrices: the X gate (bit flip), the Y gate (bit and phase flip), and the Z gate (phase flip). Together with the identity, they form a basis for 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. They are Hermitian and unitary, and they satisfy specific commutation and anticommutation relations. In quantum computing, they 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 relative phase between different components of a superposition state is crucial for interference phenomena and quantum computation.

Phase Estimation

Phase estimation is a quantum algorithm that estimates the eigenvalue of a unitary operator corresponding to a given eigenvector. It is a key subroutine in many quantum algorithms, including Shor's algorithm.

Phase Flip

A phase flip is a quantum error that changes the relative phase between the |0⟩ and |1⟩ components of a qubit's state, equivalent to applying the Z Pauli gate.

Phase Gate

The phase gate is a single-qubit quantum gate that adds a phase to the |1⟩ state and leaves the |0⟩ state unchanged. It is one of the Clifford gates.

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. It is used in the quantum Fourier transform and phase estimation.

Phase Space

In classical mechanics, phase space represents all possible states of a physical system. In quantum mechanics, quasi-probability distributions like the Wigner function represent quantum states in a phase space-like manner.

Phonon

A phonon is a quantum of vibrational energy in a crystal lattice. In trapped-ion quantum computing, phonons in the collective motional modes of trapped ions are used to mediate interactions between qubits.

Photodetector

A photodetector converts light into an electrical signal. In quantum information processing, photodetectors are used to detect individual photons, which is crucial for quantum key distribution and photonic quantum computing.

Photonic Quantum Computing

Photonic quantum computing uses photons as qubits, with quantum information encoded in properties such as polarization, path, or frequency. Advantages include room-temperature operation and low decoherence rates.

Photonics

Photonics is the science and technology of generating, controlling, and detecting photons. It plays an important role in quantum technologies including quantum key distribution and photonic quantum computing.

Physical Qubit

A physical qubit is the actual physical system used to implement a qubit in a quantum computer. Examples include trapped ions, superconducting circuits, photons, and electron spins in quantum dots.

Planck's Constant

Planck's constant (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 × 10⁻³⁴ joule-seconds.

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. In quantum computing, it can be used to manipulate the polarization or phase of photons.

Pointer State

A pointer state is a quantum state that is robust against decoherence caused by the interaction with a specific environment. Pointer states are central to the theory of decoherence and the emergence of classicality.

Polarization

Polarization refers to the orientation of the electric field vector of an electromagnetic wave. In quantum information processing, the polarization of photons can encode qubits, with orthogonal polarization states representing |0⟩ and |1⟩.

Polynomial Time

Polynomial time refers to computational problems solvable in time that is a polynomial function of the input size. The complexity class P is the set of all decision problems solvable in polynomial time.

Post-Quantum Cryptography

Post-quantum cryptography refers to cryptographic algorithms that are believed to be secure against attacks by both classical and quantum computers. Examples include lattice-based, code-based, and hash-based cryptography.

Postselection

Postselection is a technique where only computation outcomes satisfying a certain condition are accepted. It is an essential ingredient in some models of quantum computation, such as linear optical quantum computing.

Power-Law Distribution

A power-law distribution is a probability distribution in which the probability of an event is proportional to a power of some attribute. In quantum computing, power-law interactions between qubits can be used to implement certain types of gates.

Precision

Precision refers to the degree of refinement in a numerical value. In quantum computing, the precision of operations and measurements is limited by factors such as decoherence, noise, and finite control accuracy.

Prepared State

The prepared state is the quantum state of a system at the beginning of a quantum computation, typically the |0⟩ state. High-fidelity state preparation is crucial for the reliable operation of a quantum computer.

Principle of Superposition

The principle of superposition states that a quantum system can exist in multiple states simultaneously until a measurement is made. This 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 makes use of randomness as part of its logic. In quantum computing, many algorithms are inherently probabilistic due to the probabilistic nature of quantum measurement.

Probability Amplitude

A probability amplitude is a complex number whose absolute square gives the probability that the system will be found in a particular state upon measurement. Probability amplitudes can interfere constructively or destructively.

Programmable Quantum Computer

A programmable quantum computer can execute different quantum algorithms, as opposed to a fixed-function device. It requires a universal set of quantum gates and the ability to control interactions between qubits.

Projective Measurement

A projective measurement projects the state of a quantum system onto one of the eigenstates of an observable. After a projective measurement, the system is left in the eigenstate corresponding to the measurement outcome.

Protective Measurement

A protective measurement aims to minimize the disturbance to the measured system, extracting information about the expectation value of an observable without significantly changing the state.

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, since initializing a true pure state is challenging in NMR systems.

Pure State

A pure state is a quantum state that can be described by a single state vector in a Hilbert space. A pure state represents the maximum possible knowledge about a quantum system.

Purification

Purification is a concept where a mixed state of a quantum system is represented as a pure state in a larger, extended system. It is a useful theoretical tool in quantum information theory.

↑ Back to top

Q

Q Factor

The Q factor (quality factor) is a dimensionless parameter that describes the sharpness of a resonance. In quantum computing, the Q factor of resonators used for qubit coupling and readout affects coherence times and gate fidelities.

Quadrature

In continuous-variable quantum computing, quadratures refer to the two components of a mode of the electromagnetic field analogous to position and momentum. They are used to encode and process quantum information in continuous-variable systems.

Quantization

Quantization is the process of transitioning from a classical description to a quantum mechanical description, where physical quantities such as energy and momentum are restricted to discrete values.

Quantum Algorithm

A quantum algorithm is designed to run on a quantum computer and can solve certain computational problems more efficiently than classical algorithms. Famous examples include Shor's algorithm and Grover's algorithm.

Quantum Annealing

Quantum annealing is a metaheuristic for finding the global minimum of an objective function by exploiting quantum effects such as tunneling. It is the primary algorithm employed by D-Wave Systems' quantum annealers.

Quantum Approximate Optimization Algorithm (QAOA)

QAOA is a hybrid quantum-classical algorithm for solving combinatorial optimization problems, introduced by Farhi, Goldstone, and Gutmann in 2014. It is a leading candidate algorithm for demonstrating quantum advantage in the NISQ era.

Quantum Assembly Language (QASM)

Quantum assembly language (QASM) is a low-level programming language for quantum computers that describes quantum circuits in terms of elementary quantum gates and measurements.

Quantum Biology

Quantum biology is an emerging field that studies the role of quantum mechanics in biological systems, exploring whether non-trivial quantum effects play a functional role in processes such as photosynthesis and enzyme catalysis.

Quantum Bus

A quantum bus mediates interactions between different qubits or between qubits and control/readout devices. It can be implemented using microwave resonators in superconducting quantum computers or motional modes in trapped-ion systems.

Quantum Byte (Qbyte)

A quantum byte, or qbyte, is a collection of eight qubits, analogous to a classical byte. A qbyte can represent 256 distinct classical states simultaneously in a superposition.

Quantum Chaos

Quantum chaos studies the quantum behavior of systems that exhibit classical chaos. It typically manifests in the statistical properties of energy levels, the structure of wave functions, and the dynamics of quantum systems.

Quantum Chemistry

Quantum chemistry applies the principles of quantum mechanics to chemical systems, aiming to understand and predict the properties and behavior of molecules. Quantum computing has the potential to revolutionize quantum chemistry by enabling exact simulation of molecular systems.

Quantum Circuit

A quantum circuit is a model for quantum computation represented as a sequence of quantum gates, measurements, and resets acting on a set of qubits. It is the most widely used framework for describing quantum algorithms.

Quantum Communication

Quantum communication uses quantum systems, such as photons, to encode and transmit information. It offers the potential for unconditionally secure communication through quantum key distribution.

Quantum Compiler

A quantum compiler translates a high-level description of a quantum algorithm into instructions for a specific quantum computer, performing optimizations for the target hardware.

Quantum Complexity Theory

Quantum complexity theory studies the computational complexity of problems using the quantum model of computation, aiming to classify quantum algorithms and understand the fundamental limits of quantum computation.

Quantum Computer

A quantum computer uses the principles of quantum mechanics to perform computations. Unlike classical computers using bits, quantum computers use qubits that can exist in superposition and exploit entanglement to perform certain computations more efficiently.

Quantum Control

Quantum control deals with the manipulation and control of quantum systems using external fields to steer the evolution of a quantum system towards a desired target state or to implement a specific quantum operation.

Quantum Cryptography

Quantum cryptography secures communication using the principles of quantum mechanics, most notably through quantum key distribution (QKD), where security is guaranteed by the laws of physics rather than computational hardness.

Quantum Data

Quantum data is information encoded in the state of a quantum system. Unlike classical data, quantum data can exist in superposition and be entangled.

Quantum Data Bus

A quantum data bus enables the transfer of quantum information between different qubits or parts of a quantum computer. It can be implemented using shared resonators or common motional modes.

Quantum Decoder

A quantum decoder analyzes syndrome measurements from ancilla qubits to determine the most likely error on data qubits. The performance of the decoder is crucial for 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. Quantum defects such as NV centres can serve as qubits.

Quantum Degeneracy

Quantum degeneracy refers to the situation where two or more distinct quantum states have the same energy. Degeneracy can arise due to symmetries and can be lifted by perturbations.

Quantum Detector

A quantum detector detects individual quanta of energy, such as photons or phonons. Examples include single-photon detectors and superconducting nanowire single-photon detectors.

Quantum Dot

A quantum dot is a nanoscale semiconductor structure that confines electrons in all three spatial dimensions. Due to quantum confinement, quantum dots have discrete energy levels and can be used as qubits.

Quantum Efficiency

Quantum efficiency measures the effectiveness of a device in converting input quanta into a desired output, such as the ratio of photoelectrons generated to incident photons.

Quantum Electrodynamics (QED)

Quantum electrodynamics (QED) is the quantum field theory describing the interaction of light and matter. It is one of the most successful theories in physics and provides the framework for understanding qubit-electromagnetic field interactions.

Quantum Electronics

Quantum electronics deals with the application of quantum mechanics to electronic devices and systems, playing a crucial role in the development of quantum computing hardware.

Quantum Entanglement

Quantum entanglement is a phenomenon where two or more particles become correlated such that their quantum states cannot be described independently. Entanglement enables quantum teleportation, superdense coding, and quantum key distribution.

Quantum Error Correction (QEC)

Quantum error correction protects quantum information from errors by encoding it in a larger number of physical qubits. QEC codes such as the surface code and colour code detect and correct errors during computation.

Quantum Error Detection

Quantum error detection uses measurements on ancilla qubits to detect errors on data qubits without learning the logical state. The measurement outcomes (error syndrome) reveal error information.

Quantum Field Theory (QFT)

Quantum field theory combines quantum mechanics with special relativity to describe particles as excitations of underlying quantum fields. It is the basis for the Standard Model of particle physics.

Quantum Fourier Transform (QFT)

The Quantum Fourier Transform is a quantum algorithm performing the discrete Fourier transform on a quantum state. It is a key component of Shor's algorithm and quantum phase estimation.

Quantum Gate

A quantum gate is a basic quantum circuit operating on a small number of qubits. Quantum gates are unitary transformations that manipulate the quantum state of qubits, analogous to classical logic gates.

Quantum Graph

A quantum graph is a mathematical structure of vertices connected by edges, with a differential operator defined on each edge. Quantum graphs can model quantum wires and certain types of 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 under strong magnetic fields. The Hall conductance is quantized.

Quantum Hardware

Quantum hardware refers to the physical components used to build a quantum computer, including qubits, control and readout systems, cryogenic environments, and classical electronics.

Quantum Information

Quantum information is information encoded in the state of a quantum system. Based on qubits rather than classical bits, quantum information can exist in superposition and be entangled.

Quantum Information Processing

Quantum information processing refers to the manipulation and processing of quantum information using quantum systems, encompassing quantum computation, communication, simulation, and sensing.

Quantum Information Science

Quantum information science is an interdisciplinary field combining quantum mechanics, computer science, information theory, and mathematics to study the processing, storage, and communication of quantum information.

Quantum Internet

The quantum internet is a hypothetical network connecting quantum devices to enable the transmission of quantum information over long distances, including distributed quantum computing and quantum teleportation.

Quantum Key Distribution (QKD)

Quantum key distribution allows two parties to establish a shared secret key with security guaranteed by the laws of physics. Protocols such as BB84 and E91 detect eavesdropping attempts.

Quantum Machine Learning

Quantum machine learning explores the use of quantum computing to enhance machine learning algorithms, including speeding up model training and enabling learning from quantum data.

Quantum Many-Body System

A quantum many-body system is a collection of a large number of interacting quantum particles. Quantum computers are expected to be powerful tools for studying these systems.

Quantum Measurement

Quantum measurement extracts classical information from a quantum system, causing the state to collapse into an eigenstate of the measured observable with a probability given by the Born rule.

Quantum Memory

Quantum memory stores quantum information for retrieval on demand. It is essential for quantum repeaters, quantum networks, and linear optical quantum computing.

Quantum Metrology

Quantum metrology exploits quantum phenomena such as superposition and entanglement to enhance measurement precision beyond classical limits, towards the Heisenberg limit.

Quantum Monte Carlo

Quantum Monte Carlo refers to a class of algorithms that use Monte Carlo methods to simulate quantum systems, representing quantum states as statistical ensembles of classical configurations.

Quantum Network

A quantum network connects multiple quantum devices to enable quantum information transmission. Quantum networks are essential for distributed quantum computing and quantum key distribution.

Quantum Neural Network

A quantum neural network is a neural network implemented using quantum systems or that exploits quantum phenomena. They are a key component of quantum machine learning.

Quantum Nonlocality

Quantum nonlocality refers to measurement correlations on entangled particles that cannot be explained by local realistic theories. It is demonstrated by violation of Bell's inequalities.

Quantum Operation

A quantum operation is the most general transformation a quantum state can undergo, represented by a completely positive, trace-preserving map. It includes unitary transformations, measurements, and noise effects.

Quantum Optics

Quantum optics studies the quantum nature of light and its interaction with matter at the level of individual photons. It provides the framework for quantum communication and photonic quantum computing.

Quantum Parallelism

Quantum parallelism allows a quantum computer to explore many computational paths simultaneously, arising from the ability of qubits to exist in superposition.

Quantum Phase Transition

A quantum phase transition occurs at zero temperature due to changes in a non-thermal parameter, driven by quantum fluctuations rather than thermal fluctuations.

Quantum Photonics

Quantum photonics deals with the generation, manipulation, and detection of single photons and entangled photon states, playing a crucial role in quantum communication and photonic quantum computing.

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.

Quantum Processor

A quantum processor is the central processing unit of a quantum computer, consisting of physical qubits and the hardware to control and manipulate their quantum states.

Quantum Programming

Quantum programming is the process of writing code for quantum computers using specialized languages and tools to describe quantum algorithms as circuits.

Quantum Random Access Memory (QRAM)

QRAM is a hypothetical type of memory for quantum computers that would allow efficient storage and retrieval of quantum information in superposition.

Quantum Random Number Generator (QRNG)

A QRNG generates truly random numbers by exploiting the inherent randomness of quantum mechanical processes, unlike classical pseudo-random number generators.

Quantum Repeater

A quantum repeater extends the range of quantum communication by dividing long channels into segments and using entanglement swapping and quantum memory to establish long-distance entanglement.

Quantum Reservoir Computing

Quantum reservoir computing uses a quantum system as a fixed dynamical reservoir to process input data, with a simple classical readout layer extracting the output.

Quantum Search

Quantum search algorithms find items in unstructured databases more efficiently than classical algorithms. Grover's algorithm provides a quadratic speedup over classical search.

Quantum Sensor

A quantum sensor exploits quantum phenomena to measure physical quantities with high precision and sensitivity, surpassing classical sensors through quantum metrology principles.

Quantum Simulation

Quantum simulation uses a controllable quantum system to simulate the behavior of another, less accessible quantum system. It includes analog and digital approaches.

Quantum Simulator

A quantum simulator is a specialized quantum device designed to simulate specific quantum models or phenomena, as opposed to a universal quantum computer.

Quantum Software

Quantum software includes programs, libraries, and tools used to develop, compile, simulate, and execute quantum algorithms on quantum computers or simulators.

Quantum Software Development Kit (QDK)

A QDK is a collection of tools and libraries for writing, testing, and running quantum programs. Examples include Qiskit (IBM), Cirq (Google), and Q# (Microsoft).

Quantum Speedup

Quantum speedup is the ability of a quantum algorithm to solve a problem faster than the best known classical algorithm. Speedups can be superpolynomial (like Shor's) or polynomial (like Grover's).

Quantum State

A quantum state is a mathematical description of a quantum system containing all knowable information. Quantum states can be pure (described by a state vector) or mixed (described by a density matrix).

Quantum Supremacy

Quantum supremacy (or quantum advantage) is the point at which a quantum computer can perform a task beyond the capabilities of the most powerful classical computers. Google first claimed this in 2019.

Quantum System

A quantum system is any physical system governed by the laws of quantum mechanics, from individual particles to complex systems like molecules, quantum dots, or superconducting circuits.

Quantum Technology

Quantum technology is a class of devices exploiting quantum mechanical phenomena for tasks impossible or inefficient for classical technologies, including quantum computers, sensors, and communication systems.

Quantum Teleportation

Quantum teleportation transfers an unknown quantum state from one location to another using entanglement and classical communication, without physically moving the particle.

Quantum Tomography

Quantum tomography reconstructs the quantum state of a system by performing a series of measurements on identically prepared copies, fully characterizing the density matrix.

Quantum Tunneling

Quantum tunneling allows a particle to pass through a potential energy barrier that it classically could not surmount. In quantum computing, tunneling is exploited in quantum annealing.

Quantum Volume

Quantum volume is a metric quantifying the overall performance of a quantum computer, depending on the number of qubits, connectivity, gate error rates, and measurement fidelity.

Quantum Walk

A quantum walk is the quantum mechanical analogue of a classical random walk, where a quantum walker can exist in a superposition of multiple locations. Quantum walks have applications in quantum algorithms and simulation.

Quantum Wire

A quantum wire is a quasi-one-dimensional conductor that confines electrons to move along a single direction, with quantized transverse motion.

Quantum Zeno Effect

The quantum Zeno effect is a phenomenon where frequent measurements of a quantum system can inhibit its evolution, preventing transitions to different states.

Quantum-Classical Hybrid Algorithm

A quantum-classical hybrid algorithm combines quantum and classical computations. The quantum computer performs a specific subroutine while the classical computer controls the operation and processes measurement results. VQE and QAOA are examples.

Quantum-Inspired Algorithm

A quantum-inspired algorithm is a classical algorithm inspired by quantum mechanics principles that does not require a quantum computer. They can be applied to optimization, machine learning, and materials science.

Quasi-Particle

A quasiparticle is an emergent phenomenon in interacting many-body systems, where collective behavior is described as if composed of weakly interacting entities. Examples include phonons, excitons, and plasmons.

Qubit

A qubit, short for quantum bit, is the basic unit of quantum information. Unlike a classical bit, which can be either 0 or 1, a qubit can exist in a superposition of both states simultaneously. 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 Connectivity

Qubit connectivity describes which qubits can directly interact through two-qubit gates. Different platforms have different connectivity patterns, such as linear chains, 2D grids, or all-to-all connectivity.

Qubit Encoding

Qubit encoding refers to how quantum information is represented in a physical system, such as electron spin, photon polarization, atomic energy levels, or magnetic flux in a superconducting loop.

Qubit Fidelity

Qubit fidelity measures how closely the state of a physical qubit matches the intended quantum state. It ranges from 0 to 1, with high fidelity essential for reliable quantum computation.

Qubit Initialization

Qubit initialization is the process of preparing a qubit in a known initial state before the start of a quantum computation. It can be achieved through techniques such as optical pumping, laser cooling, or measurement-based feedback.

Qubit Mapping

Qubit mapping assigns logical qubits in a quantum circuit to physical qubits on hardware, considering connectivity constraints and error rates. Optimal mapping minimizes gates and overall error.

Qubit Readout

Qubit readout is the process of measuring the state of a qubit at the end of a quantum computation, typically by coupling the qubit to a measurement device and detecting the state-dependent response.

Qubit-Photon Interface

A qubit-photon interface allows coherent transfer of quantum information between a stationary qubit and a photon. It is essential for quantum networks and distributed quantum computing.

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 and can be mediated by various physical mechanisms.

Quil

Quil is an instruction set architecture for quantum computing developed by Rigetti Computing. It is a low-level, hardware-agnostic language for describing quantum circuits.

↑ Back to top

R

Rabi Cycle

A Rabi cycle is the cyclic oscillation of a two-level quantum system between its energy levels when driven by a resonant external field. Rabi cycles are used to manipulate qubit states.

Rabi Frequency

The Rabi frequency is the rate at which a driven two-level quantum system oscillates between its energy levels. It is proportional to the driving field strength and determines the speed of qubit state changes.

Ramsey Experiment

A Ramsey experiment measures the energy difference between two quantum states or the coherence time of a quantum system using two separated pulses with free evolution in between.

Random Circuit Sampling

Random circuit sampling involves sampling from the output distribution of a randomly generated quantum circuit. It was used by Google in 2019 to claim the first demonstration of quantum supremacy.

Random Matrix Theory

Random matrix theory studies the statistical properties of matrices with randomly drawn elements. In quantum computing, it can model certain quantum systems and analyze properties of random quantum circuits.

Rare-Earth Ion

Rare-earth ions doped into crystals can be used as qubits, with quantum information encoded in their electronic or nuclear spin states. They have unique optical and magnetic properties.

Readout Fidelity

Readout fidelity measures the accuracy of the measurement process in a quantum computer, quantifying the probability of correctly determining the qubit's state.

Realism

Realism is the philosophical view that physical systems possess definite properties independent of measurement. Quantum mechanics challenges this assumption through Bell inequality violations.

Reduced Density Matrix

The reduced density matrix describes the state of a subsystem of a larger quantum system, obtained by taking the partial trace over the other subsystem's degrees of freedom.

Register

In quantum computing, a register is a collection of qubits used to store and process quantum information. Unlike a classical register, a quantum register can exist in a superposition of multiple values.

Relaxation

Relaxation is the process by which a qubit loses energy to its environment and returns to its ground state. The characteristic timescale is the relaxation time T1.

Remote State Preparation

Remote state preparation allows one party to prepare a specific quantum state in a distant party's laboratory using classical communication and shared entanglement.

Repetition Code

A repetition code encodes a single bit of information using multiple physical bits. In quantum computing, the concept generalizes to quantum error-correcting codes such as the surface code.

Reservoir Computing

Reservoir computing uses a fixed, randomly connected dynamical system to process input data, with a simple readout layer trained to extract the desired output.

Resonator

In quantum computing, a resonator stores electromagnetic energy at specific frequencies. Resonators are used to couple to and read out superconducting qubits.

Rydberg Atom

A Rydberg atom has one or more electrons excited to a very high energy level. Rydberg atoms have exaggerated properties including large size, long lifetime, and strong dipole-dipole interactions useful for fast entangling gates.

↑ Back to top

S

S Parameter

S parameters (scattering parameters) describe the input-output relationships of a linear electrical network. In superconducting quantum computing, they characterize microwave resonators, filters, and amplifiers.

Sampling Problem

A sampling problem involves generating random numbers following a specified probability distribution. Some sampling problems are believed to be hard for classical computers but efficient for quantum computers.

Scaling

In quantum computing, scaling refers to the ability to increase the size and complexity of a quantum computer by adding more qubits and improving control and connectivity.

Scanning Probe Microscopy

Scanning probe microscopy uses a physical probe to scan surfaces at the nanoscale. STM and AFM can characterize and manipulate individual atoms for quantum computing applications.

Schmidt Decomposition

The Schmidt decomposition expresses a pure bipartite quantum state as a sum of product states with non-negative coefficients (Schmidt coefficients). The number of non-zero coefficients measures entanglement.

Schrödinger Equation

The Schrödinger equation describes how the quantum state of a physical system evolves over time. Formulated by Erwin Schrödinger in 1926, it is one of the central postulates of quantum mechanics.

Schrödinger's Cat

Schrödinger's cat is a thought experiment illustrating the paradoxical nature of quantum superposition when applied to everyday objects. Until observed, the cat is in a superposition of being both alive and dead.

Semiconductor

A semiconductor has electrical conductivity between that of a conductor and an insulator. Semiconductors are the foundation of modern electronics and can be used to create qubits based on electron or hole spins in quantum dots.

Semiconductor Quantum Computing

Semiconductor quantum computing uses semiconductor devices to create and manipulate qubits, often based on electron or hole spins confined in quantum dots. It has the potential advantage of leveraging existing semiconductor fabrication infrastructure.

Shor's Algorithm

Shor's algorithm is a quantum algorithm for factoring large numbers exponentially faster than the best known classical algorithms. This has significant implications for cryptography, as it can break widely used public-key cryptosystems such as RSA.

Shot Noise

Shot noise is electronic noise arising from the discrete nature of electric charge. It can affect the fidelity of qubit operations and measurements in quantum computing.

SIAM (Single Impurity Anderson Model)

The Single Impurity Anderson Model describes a magnetic impurity embedded in a non-magnetic metallic host. It exhibits the Kondo effect and has been studied using various theoretical techniques.

Silicon-Based Quantum Computing

Silicon-based quantum computing uses silicon as the host material for qubits, leveraging semiconductor industry infrastructure. Qubits can be implemented using electron spins, nuclear spins, or charge states.

Simulated Annealing

Simulated annealing is a classical optimization algorithm inspired by metallurgical annealing. It is a widely used heuristic for solving NP-hard optimization problems.

Single-Electron Transistor (SET)

A single-electron transistor uses controlled tunneling of single electrons to amplify current. SETs are extremely sensitive to electric charge and can read out qubit states.

Single-Flux-Quantum (SFQ) Logic

SFQ logic uses the presence or absence of a magnetic flux quantum in a superconducting loop to represent bits. SFQ circuits can operate at very high speeds with very low power dissipation.

Single-Photon Detector

A single-photon detector detects individual photons with high efficiency and low noise. Types include photomultiplier tubes, avalanche photodiodes, and superconducting nanowire single-photon detectors.

Single-Photon Source

A single-photon source emits individual photons on demand. Ideal sources have high efficiency, high purity, and indistinguishability between successive photons.

Single-Qubit Gate

A single-qubit gate operates on a single qubit, rotating its state on the Bloch sphere. Examples include the Pauli gates (X, Y, Z), the Hadamard gate (H), and the T gate.

Singlet State

A singlet state is a two-particle quantum state with total spin zero. It is a maximally entangled state and plays an important role in quantum information theory.

Solid-State Quantum Computing

Solid-state quantum computing uses solid-state devices such as semiconductor nanostructures or superconducting circuits to implement qubits. It has the potential advantage of scalability.

Soliton

A soliton is a self-reinforcing solitary wave that maintains its shape and speed as it propagates through a medium. Solitons have been proposed for information transmission in communication systems.

Spacetime

Spacetime combines the three dimensions of space with time into a single four-dimensional continuum. It is central to Einstein's theories of relativity.

Special Relativity

Special relativity describes the relationship between space and time for objects moving at constant velocities. Its consequences include time dilation, length contraction, and E = mc².

Spectroscopy

Spectroscopy studies the interaction between matter and electromagnetic radiation. In quantum computing, spectroscopic techniques characterize and control qubits and study the properties of quantum device materials.

Spin

Spin is an intrinsic form of angular momentum possessed by elementary particles. In quantum computing, the spin of electrons or nuclei can encode quantum information as qubits.

Spin Bath

A spin bath is a collection of environmental spins that interact with a central qubit. The spin bath is a major source of decoherence in solid-state spin qubits.

Spin Chain

A spin chain is a one-dimensional array of interacting spins, used to study quantum magnetism, quantum phase transitions, and quantum state transfer.

Spin Echo

Spin echo reverses the loss of phase coherence in a collection of spins by applying specific pulse sequences. In quantum computing, spin echo techniques extend coherence times.

Spin Qubit

A spin qubit uses the spin of a particle (electron or nucleus) to encode quantum information. Spin qubits can be implemented in quantum dots, donors in semiconductors, and NV centres in diamond.

Spin-Flip Error

A spin-flip error (bit-flip error) flips a qubit's state, corresponding to application of the Pauli X gate. It is one of the two primary types of qubit errors.

Spin-Orbit Coupling

Spin-orbit coupling is an interaction between the spin and orbital motion of a particle. It plays an important role in topological insulators and certain types of qubits.

Squeezed State

A squeezed state has reduced uncertainty in one quadrature below the standard quantum limit, at the expense of increased uncertainty in the conjugate quadrature. Squeezed states have applications in quantum metrology and continuous-variable quantum computing.

SQUID (Superconducting Quantum Interference Device)

A SQUID is a very sensitive magnetometer based on flux quantization and Josephson effects in superconducting loops. SQUIDs can read out the state of superconducting flux qubits.

Stabilizer Code

A stabilizer code is a quantum error-correcting code defined by a set of commuting Pauli operators. Examples include the Steane code, the surface code, and colour codes.

Stabilizer Formalism

The stabilizer formalism describes quantum states and operations important for quantum error correction. The Gottesman-Knill theorem shows that stabilizer states with Clifford operations can be efficiently classically simulated.

Standard Quantum Limit (SQL)

The standard quantum limit is a fundamental limit on measurement precision arising from the quantum nature of the measurement apparatus. It can be surpassed using quantum metrology techniques.

State Vector

A state vector is a mathematical representation of a quantum system in a Hilbert space. The absolute square of the amplitude associated with each basis vector gives the probability of finding the system in that state.

Stimulated Emission

Stimulated emission occurs when an incoming photon causes an excited atom to emit a second photon with the same frequency, phase, polarization, and direction. It is the basis of lasers.

STM (Scanning Tunneling Microscope)

An STM images surfaces at the atomic scale using the tunneling current between a sharp tip and a sample. STMs can also manipulate individual atoms on surfaces.

Storage Time

In quantum memory, the storage time is the duration for which a quantum state can be stored and retrieved with high fidelity. It is limited by decoherence and noise processes.

Strong Coupling

Strong coupling occurs when the coupling strength between a quantum emitter and a cavity mode exceeds the decay rates of both. It leads to hybrid light-matter states (polaritons) and vacuum Rabi splitting.

Superconducting Circuit

A superconducting circuit is made of superconducting materials operated at cryogenic temperatures, exhibiting quantum effects such as flux quantization and the Josephson effect.

Superconducting Quantum Computing

Superconducting quantum computing uses superconducting circuits to implement qubits and gates. Companies like Google, IBM, and Rigetti Computing are actively developing this approach.

Superconducting Qubit

A superconducting qubit is implemented using superconducting circuits, manipulating macroscopic quantum variables. Operated at millikelvin temperatures, they are a leading platform for quantum computers.

Superconductivity

Superconductivity is a phenomenon where electrical resistance drops to exactly zero at very low temperatures. It is the basis for superconducting quantum computing.

Superdense Coding

Superdense coding transmits two classical bits by sending only one qubit, provided the parties share a maximally entangled pair. It demonstrates the power of entanglement for communication.

Superoperator

A superoperator is a linear operator acting on other operators, used to describe the most general transformations of quantum states, including unitary evolution, measurement, and noise.

Superposition

Superposition is a fundamental principle of quantum mechanics where a quantum system can exist in multiple states simultaneously until measured. It allows qubits to exist in superpositions of |0⟩ and |1⟩, enabling parallel exploration of computational paths.

Surface Code

The surface code is a topological quantum error-correcting code defined on a two-dimensional lattice. It has a high threshold error rate and nearest-neighbour interactions, making it one of the most promising candidates for fault-tolerant quantum computing.

SWAP Gate

The SWAP gate is a two-qubit quantum gate that swaps the states of two qubits. It is particularly useful for moving quantum information when qubit connectivity is limited.

Symmetry

In physics, a symmetry is a feature of a system that remains unchanged under some transformation. According to Noether's theorem, every continuous symmetry corresponds to a conserved quantity.

Symmetry-Protected Topological (SPT) Phase

An SPT phase exhibits topological order protected by a symmetry, with non-trivial edge states. SPT phases generalize topological insulators and superconductors to interacting systems.

↑ Back to top

T

T Gate

The T gate is a single-qubit quantum gate that adds a phase of π/4 to the |1⟩ state. When combined with Clifford gates, it forms a universal gate set for quantum computation.

Target State

The target state is the desired quantum state to be prepared or reached at the end of a quantum algorithm or control process.

Tensor Network

A tensor network represents a many-body quantum state as a network of interconnected tensors. Examples include matrix product states (MPS) and projected entangled pair states (PEPS).

Tensor Product

The tensor product combines two or more vector spaces to form a larger one. In quantum mechanics, it describes the state space of composite quantum systems.

Thermal Equilibrium

Thermal equilibrium is a state with no net flow of thermal energy and uniform temperature. In quantum mechanics, it is described by a thermal state (Gibbs state).

Thermal State

A thermal state describes a system in thermal equilibrium, with density matrix given by the Boltzmann distribution. It is used in statistical mechanics and as an initial state for quantum simulations.

Thermodynamics

Thermodynamics deals with the relationships between heat, work, temperature, and energy. Its four laws govern fundamental principles of energy transfer and conversion.

Threshold Theorem

The threshold theorem states that arbitrarily long quantum computations can be performed with arbitrarily high accuracy, provided the physical error rate is below a certain threshold (typically around 10⁻³ to 10⁻²).

Tight-Binding Model

The tight-binding model calculates electronic band structure by assuming electrons are tightly bound to atoms and weakly interact with neighbours. It is widely used for narrow-band materials.

Time Crystal

A time crystal is a phase of matter that exhibits periodic behavior in time, analogous to the spatial periodicity of regular crystals. Experimentally confirmed in 2017, time crystals are non-equilibrium phases.

Time-Dependent Hamiltonian

A time-dependent Hamiltonian changes over time, arising when a system is subjected to varying external fields. It describes quantum gate operations and non-equilibrium processes.

Time-Dependent Schrödinger Equation

The time-dependent Schrödinger equation describes how a quantum state evolves over time: iħ ∂|ψ(t)⟩/∂t = H(t)|ψ(t)⟩.

Time-Independent Schrödinger Equation

The time-independent Schrödinger equation H|ψ⟩ = E|ψ⟩ is an eigenvalue equation determining the energy levels and stationary states of a quantum system.

Time-Reversal Symmetry

Time-reversal symmetry is the invariance of physical laws under t → –t. While largely preserved in fundamental physics, it is violated by the weak interaction and by the second law of thermodynamics.

Toffoli Gate

The Toffoli gate (controlled-controlled-NOT) is a three-qubit gate that flips the target qubit if and only if both control qubits are in the |1⟩ state. It is universal for classical computation and, with the Hadamard gate, forms a universal quantum gate set.

Topological Quantum Computing

Topological quantum computing uses topological properties of certain quantum systems to protect quantum information from errors. Qubits are encoded in topological states of anyons, with braiding operations performing quantum gates.

Topological Qubit

A topological qubit is based on the topological properties of quantum systems such as anyons. Topological qubits are inherently non-local and protected from local noise sources.

Topology

Topology studies properties of geometric objects preserved under continuous deformations. In physics, topology classifies topological phases of matter and topological defects.

Total Variation Distance

Total variation distance measures the difference between two probability distributions, ranging from 0 (identical) to 1 (completely different).

Transistor

A transistor is a semiconductor device used to amplify or switch electronic signals. It is the fundamental building block of modern electronics. Invented in 1947, it revolutionized computing.

Transmon Qubit

A transmon qubit is a widely used superconducting qubit that is an improved version of the Cooper-pair box, designed to be less sensitive to charge noise. It consists of a Josephson junction shunted by a large capacitor.

Transport

Transport refers to the movement of particles, energy, or other physical quantities. Transport properties such as electrical and thermal conductivity characterize the behavior of materials.

Trapped-Ion Quantum Computing

Trapped-ion quantum computing uses ions confined in electromagnetic fields as qubits. Quantum gates are implemented using laser beams. This platform has demonstrated very long coherence times and high gate fidelities.

Traveling Wave Parametric Amplifier (TWPA)

A TWPA is a low-noise amplifier used in superconducting quantum computing for qubit readout. TWPAs achieve near-quantum-limited noise performance over a broad bandwidth.

Triplet State

A triplet state has total spin angular momentum S=1 with three possible z-component values. For two spin-1/2 particles, the triplet states include |up-up⟩, (|up-down⟩ + |down-up⟩)/√2, and |down-down⟩.

Two-Qubit Gate

A two-qubit gate operates on two qubits simultaneously and is essential for creating entanglement. Examples include the CNOT gate, SWAP gate, and controlled-phase gate.

Type-I Superconductor

A type-I superconductor exhibits a complete Meissner effect below a critical temperature and magnetic field. Type-I superconductors are typically pure metals with relatively low critical temperatures.

Type-II Superconductor

A type-II superconductor has two critical magnetic fields and exhibits a vortex state between them. Type-II superconductors include alloys and compounds used in high-field magnets.

↑ Back to top

U

Ultracold Atom

An ultracold atom has been cooled to near absolute zero (microkelvin or nanokelvin range). Ultracold atoms are used for quantum simulation, quantum computing, and precision measurements.

Uncertainty Principle

The uncertainty principle states that certain pairs of physical properties (such as position and momentum) cannot both be known to arbitrary precision simultaneously: ΔxΔp ≥ ħ/2.

Uncomputation

Uncomputation reverses a previous computation to return qubits to their initial state, removing entanglement between ancilla and data qubits. It is achieved by applying the inverse of the original computation.

Unitary

A unitary transformation preserves the inner product between quantum states. Unitary operators describe the time evolution of closed quantum systems and represent quantum gates. A unitary operator U satisfies U†U = UU† = I.

Unitary Matrix

A unitary matrix is a complex square matrix whose conjugate transpose equals its inverse. Unitary matrices represent quantum gates and have a determinant with absolute value 1.

Universal Gate Set

A universal gate set can approximate any unitary transformation to arbitrary accuracy. A common example is the set containing the Hadamard gate, T gate, and CNOT gate.

Universal Quantum Computer

A universal quantum computer can perform any quantum computation given enough time and resources. It must be able to implement a universal set of quantum gates.

↑ Back to top

V

Vacuum Rabi Splitting

Vacuum Rabi splitting occurs in the strong coupling regime of cavity QED, where the interaction between an emitter and a cavity mode creates two new energy levels even in the vacuum state.

Vacuum State

The vacuum state is the quantum state with the lowest possible energy, containing no particles. Despite its name, it has non-trivial properties due to quantum fluctuations.

Valence Band

The valence band is the highest energy band in a solid normally occupied by electrons. The gap between the valence band and conduction band determines a material's electrical conductivity.

Variational Quantum Algorithm

A variational quantum algorithm uses a hybrid quantum-classical approach with a parameterized quantum circuit (ansatz) optimized by a classical computer. Examples include VQE and QAOA.

Variational Quantum Eigensolver (VQE)

VQE is a hybrid quantum-classical algorithm for finding the ground state energy of a quantum system. A quantum computer prepares a parameterized trial state while a classical computer optimizes parameters.

Vector Space

A vector space consists of objects (vectors) that can be added together and multiplied by scalars. In quantum mechanics, the state space is a complex vector space called a Hilbert space.

Verification

Verification is the process of checking whether a quantum computer functions correctly and produces expected results, crucial for ensuring reliability and accuracy.

Visibility

Visibility measures the contrast in an interference pattern: (Imax – Imin)/(Imax + Imin). In quantum optics, it quantifies single-photon source quality and degree of entanglement.

Von Neumann Architecture

The von Neumann architecture uses a single address space for both instructions and data. Proposed in 1945, it is the basis for most modern digital computers.

Von Neumann Entropy

Von Neumann entropy S(ρ) = –Tr(ρ log ρ) measures uncertainty in a quantum state. It is zero for pure states and maximal for maximally mixed states.

Von Neumann Measurement

A von Neumann (projective) measurement projects a quantum state onto an eigenstate of an observable, leaving the system in that eigenstate after measurement.

Vortex

A vortex is a region where flow rotates around an axis. In superconductors, vortices carry quantized magnetic flux and can form regular lattices (Abrikosov lattices).

↑ Back to top

W

W State

The W state is a genuinely multipartite entangled state of three qubits: |W⟩ = (|001⟩ + |010⟩ + |100⟩)/√3. It is used in quantum communication and error correction.

Wave Function

The wave function is a mathematical description of a quantum state. The absolute square of the wave function gives the probability density of finding a particle at a particular position and time.

Wave-Particle Duality

Wave-particle duality states that all particles exhibit both wave-like and particle-like properties. It is encapsulated in the de Broglie relation λ = h/p.

Waveguide

A waveguide guides waves along a specific path. In quantum computing, waveguides guide photons in photonic systems or couple superconducting qubits via coplanar waveguide resonators.

Weak Measurement

A weak measurement minimally disturbs the measured system, extracting limited information while preserving coherence. It was introduced by Aharonov, Albert, and Vaidman.

Weyl Fermion

A Weyl fermion is a massless fermion with definite chirality. Discovered as quasiparticles in Weyl semimetals, they exhibit unique properties such as the chiral anomaly.

Work Function

The work function is the minimum energy required to remove an electron from a solid's surface. It affects the performance of superconducting qubits and other quantum devices.

↑ Back to top

X

X Gate

The X gate (NOT gate) is a single-qubit quantum gate that performs a bit-flip: |0⟩ → |1⟩ and |1⟩ → |0⟩. It is analogous to the classical NOT gate.

XY Model

The XY model describes a system of spins on a lattice that can rotate in a two-dimensional plane. It is used to study phase transitions, magnetism, and can be implemented in quantum simulators.

↑ Back to top

Y

Y Gate

The Y gate performs a combined bit-flip and phase-flip operation. It maps |0⟩ to i|1⟩ and |1⟩ to –i|0⟩. It is one of the three Pauli gates.

YIG (Yttrium Iron Garnet)

YIG is a ferrimagnetic synthetic garnet with low spin-wave damping. In quantum computing, magnons in YIG can be coupled to superconducting qubits to create hybrid quantum systems.

Young's Double-Slit Experiment

Young's double-slit experiment demonstrates wave-particle duality. A coherent beam passing through two slits produces an interference pattern, illustrating superposition and complementarity.

Yukawa Interaction

The Yukawa interaction describes the force between particles mediated by the exchange of a massive scalar particle. It was originally proposed to explain the nuclear force.

↑ Back to top

Z

Z Gate

The Z gate performs a phase-flip: it leaves |0⟩ unchanged and maps |1⟩ to –|1⟩. It is its own inverse and is one of the three Pauli gates.

Zeeman Effect

The Zeeman effect is the splitting of atomic spectral lines in a magnetic field. In quantum computing, it can control and manipulate the states of spin-based qubits.

Zero-Point Energy

Zero-point energy is the lowest possible energy of a quantum system, even at absolute zero. It arises from the Heisenberg uncertainty principle and has observable consequences such as the Casimir effect.

Zero-Point Fluctuations

Zero-point fluctuations are temporary changes in energy at a point in space arising from the Heisenberg uncertainty principle. They give rise to virtual particle-antiparticle pairs even in a vacuum.

Zitterbewegung

Zitterbewegung is a theoretical rapid oscillatory motion of fermions described by the Dirac equation, caused by interference between positive and negative energy states.

Zone Plate

A zone plate is a diffractive optical device that focuses light using concentric alternating opaque and transparent rings. In quantum computing, zone plates can focus ion beams in trapped-ion systems.

↑ Back to top

Tags:

Quantum Computing Quantum Computing Glossary