558 Result(s)
within
English
Electronics and Microelectronics, Instrumentation
Theory of Computation
**e **an
Chapter
-
Chapter
Electron Spin Resonance
The analysis of the preceding Chapter was for a constant magnetic field. From Exercise 14.9, we see that the magnetic field is very large (> 1 T) for the Zeeman splitting to exceed the thermal energy. This is ...
-
Chapter
Teleportation
uses to move a quantum state from one quantum system to another, without having to send the physical system.
-
Chapter
Implementing Two-Qubit Gates
The previous chapters were about single-qubit operations. Single-qubit rotations and a two-qubit gate (such as a CNOT gate) are required to form a set of . Therefore, let us consider how to implement a two-qu...
-
Chapter
Trapped Ion Quantum Computing
In , ions are created and trapped to form a qubit register. Ions can be suspended and trapped in free space using electromagnetic fields. The , defined by the electronic states of the ions, are manipulated a...
-
Chapter
Nuclear Magnetic Resonance
Nuclear uses a large ensemble of molecules in a test tube (a liquid). The states of nuclei within the atoms of the molecules act as the . Each molecule is a quantum computer.
-
Chapter
Adiabatic Quantum Computing
is an approach to quantum computing based on the . The adiabatic theorem states that if a , \( \widehat{H} \) H ^ , changes slowly in time, then the state remains in the ground state. By starting with ...
-
Chapter
Quantum Error Correction
#5 from Chap. 18 states that the qubit lifetimes should be long compared to the duration of the algorithm. However, quantum systems are fragile. Unwanted external perturbations from the environment (e.g., ele...
-
Chapter
Superposition
One of the defining characteristics of quantum mechanics is the possibility of a superposition of states.
-
Chapter
Quantum Parallelism and Computational Complexity
Quantum computers can use a to run many states simultaneously through an algorithm, rather than sequentially as in a classical computer. This principle is called . This chapter refines our notion of quantum...
-
Chapter
Spin
In Chap. 2, we represented “0” by an electron in a lower energy level ( ) and “1” by an electron in an . Another method of implementing quantum computing is by using the of electrons or protons to represent...
-
Chapter
Grover Algorithm
The is a quantum algorithm that provides a polynomial speedup compared to classical algorithms for searching a database. This algorithm could also be used to solve complexity.
-
Chapter
Entanglement
There exist multiple qubit states that cannot be expressed as a product of individual qubit states. These states are called entangled states, which is another powerful resource used in quantum computing.
-
Chapter
Precession
In the next few chapters, we are going to examine how to build . First, let us consider . Single-qubit gates can be implemented by in a magnetic field. We begin with a mathematical description of rotat...
-
Chapter
Quantum Gates
In classical and quantum computing, we implement gate operations for information processing.
-
Chapter
Two-State Dynamics
In the previous chapter, we examined electron spin to implement . In this chapter, the dynamics of a two-level quantum system and ESR will be examined in more detail. We consider how the electron cycles bac...
-
Chapter
Solid-State Spin Qubits
Solid-state are based on the electron spin in solid materials. We want to manufacture a system by confining/trap** a single electron in a quantum two-level system containing spin up or spin down, and the...
-
Chapter
Tensor Products
provide a mathematical tool for dealing with multiple .
-
Chapter
DiVincenzo Criteria
The , named after the physicist, , is a list of criteria that every quantum computer should satisfy [1, 2].
-
Chapter
Superconducting Qubits
Thus far, we have examined quantum computing based on single particle states in atoms, ions and semiconductor structures. In this chapter, we will examine quantum states in superconductors and their applicatio...
-
Chapter
Optical Quantum Computing
Optical (also known as photonic or bosonic) quantum computing uses , so-called “ ”, to encode \( \left| 0 \right\rangle \) 0 or \( \left| 1 \right\rangle \) 1 . Several different methods exist f...
