Abstract
An elementary review on principles of qubits and their prospects for quantum computing is provided. Due to its rapid development, quantum computing has attracted considerable attention as a core technology for the next generation and has demonstrated its potential in simulations of exotic materials, molecular structures, and theoretical computer science. To achieve fully error-corrected quantum computers, building a logical qubit from multiple physical qubits is crucial. The number of physical qubits needed depends on their error rates, making error reduction in physical qubits vital. Numerous efforts to reduce errors are ongoing in both existing and emerging quantum systems. Here, the principle and development of qubits, as well as the current status of the field, are reviewed to provide information to researchers from various fields and give insights into this promising technology.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.1 Introduction
Quantum computing is emerging as a ground breaking technology that has attracted widespread attention as the next-generation frontier. The growing complexity of modern technology challenges, particularly in fields such as chemistry, materials science, and finance, has surpassed the capabilities of conventional classical computers. Quantum computing is promising for addressing these challenges, which were previously considered nearly impossible to solve [1,2,3,4,5,6,7,8,9,10,11,12,13]. Its significance has become even more pronounced because quantum computers have the potential to revolutionize cryptography [14]. Consequently, numerous countries and organizations are actively exploring and investing in this transformative technology. As a result, quantum computing has made significant strides over the past decade in demonstrating quantum advantages [15, 16], exploring new material phases [17,18,19], conducting molecular calculations [20], and studying the quantum dynamics of exotic matters [21, 22].
If the physical realization of quantum computers was impossible, the theory of quantum computing and its algorithms would not have attracted much attention despite their high potential and promises [23]. The recent rapid development of quantum computing hardware has reached a stage where simple quantum algorithms and various proofs of concepts can be successfully implemented, which has further accelerated the expansion of the field. However, the successful implementation of practical quantum algorithms requires significantly more computing resources and demands substantial breakthroughs.
Numerous qubit technologies have been proposed and experimentally studied to date, including superconducting circuits [24,25,26], trapped ions [27,28,29,30], Rydberg atoms [31,32,33,34,35], dipolar molecules [36], semiconductors [37,38,39,40,41], nucleus spins [42,43,44,45,46],photons [47,48,49,50,51,52], etc. Significant progress has been made in pushing the system size and controllability limits, and state-of-the-art systems demonstrate middle-sized machines exhibiting small quantum algorithms [53, 54], quantum error corrections [55,56,57,58,59,60,61,62], and quantum advantages [15, 16]. Despite successful advancements in quantum computing hardware, recent research has uncovered critical challenges in realizing fault-tolerant, scalable quantum computers [63].
In the race to develop quantum computers over the past three decades, the leading platform has been changing over time from one system to another. The question of which platform will be eventually used to implement a practical large-scale quantum computer remains unanswered. It is possible that an entirely novel type of qubit, which has not yet been proposed or realized, could lead to substantial breakthroughs in quantum computing technology.
Numerous efforts are ongoing to enhance existing quantum computing platforms, including strategies to minimize errors by creating logical qubits from multiple physical qubits or establishing quantum connections between quantum computers [59, 62, 64,65,66]. The overhead required to construct a logical qubit reduces when the error rates of physical qubits become low. For example, it is expected that a few thousands of physical qubits are required to create one logical qubit when their error rates are 0.1% [63]. Therefore, it is crucial to properly engineer and develop physical qubits for constructing scalable and fully error-corrected quantum computers. Ongoing research is actively exploring new quantum computing platforms, including solid-based options comprising quantum dots and silicon, which are known for their seamless integration with existing technologies [67]. Nanotechnology is pivotal for shaping and preserving the delicate quantum properties essential for progress in this domain [68,69,70].
Numerous reviews have comprehensively detailed existing quantum computing systems [71,72,73], including articles about material challenges for quantum computers [74, 75]. This review is intended to facilitate researchers from a broad variety of fields, not only physics but also nanotechnology and material sciences, in developing physical qubit systems. In this regard, we summarize the fundamental quantum properties employed in quantum computing, including superposition and entanglement, and the requirements for qubits and quantum operations. In addition, we explore the current status of this field and its applications.
2 A brief review of unique features in quantum mechanics
In this section, we provide a concise overview of the fundamental characteristics distinguishing quantum computers from classical computers (Fig. 1). Quantum computers differ from their classical counterparts by leveraging the principles of ‘superposition’ and ‘entanglement’ of quantum states. Superposition states excessively broaden the possible combinations of qubit states. Currently, typical qubit systems have errors at rates of \(10^{-2}\)–\(10^{-4}\) due to temperature fluctuations, noises in microwaves or lasers used for manipulating qubits, and environmental electromagnetic fields. These errors must be corrected in quantum computations. To minimize errors, it is crucial to entangle multiple physical qubits and form a fault-tolerant ‘logical’ qubit because a quantum state cannot be naively copied, unlike in classical computers. Entanglement is therefore a basic block in the construction of quantum operations. In addition, the stochastic nature of detection in quantum mechanics plays a pivotal role in quantum computing. Each of these aspects is briefly discussed in this section. Many textbooks on quantum mechanics and quantum computations are available for those seeking more detailed explanations [23, 76,77,78].
2.1 Quantum states and their superposition
In quantum mechanics, the quantum state characterizes the state of a physical system, and contains all information about the system at a given point in time. To construct a quantum computer, qubit states should be defined. For example, the two lowest energy states of a system can constitute a qubit. The two quantum states of qubits are usually denoted \(|0\rangle\) and \(|1\rangle\) using Dirac notations. Quantum mechanics also permits the system to exist in multiple states simultaneously. This phenomenon is called quantum superposition and can be expressed as a linear combination of two states \(a|0\rangle + b|1\rangle\), where a and b are complex numbers (coefficients) that determine the probability amplitudes of each state. Superposition also results in interference effects, where the probability amplitudes of different states can reinforce or cancel each other out after the state evolution. This interference phenomenon is crucial for quantum algorithms, allowing for the manipulation of probabilities to achieve specific outcomes.
2.2 Entanglement
Entanglement is a multi-particle state that cannot be expressed as the product of two single-particle states. The basis of the quantum states of a system with two qubits, A and B, consists of \(|00\rangle\), \(|01\rangle\), \(|10\rangle\), and \(|11\rangle\), where the first number indicates the quantum state of A, and the latter indicates that of B. If measuring the quantum state of A does not affect the state of B, then the two qubits are independent, and we call this the product state of the two. However, if the system is in a state such as \(|01\rangle + |10\rangle\), the measurement results for A and B are strongly correlated, and the two particles are entangled.
One of the most exotic aspects of entanglement is its non-local nature. Changes to the state of one entangled particle instantaneously affect the state of the other, regardless of the distance separating them. Some famous examples of entangled states are the Bell states and the Greenberger-Horne-Zeilinger states (GHZ states). The Bell states are four maximally entangled states in a two-particle system with two states: \(|0 \rangle\) and \(|1 \rangle\). These consist of superpositions of the linear combinations of the two states: \(|00 \rangle + |11 \rangle\), \(|00 \rangle - |11 \rangle\), \(|01 \rangle + |10 \rangle\), and \(|01 \rangle - |10 \rangle\). The Bell states are the most basic building blocks in quantum computing processes. A GHZ state, also called the Schrodinger’s cat state, expands the concept of the Bell states to systems with more than two particles. This is a superposition of all 0 qubits and all 1 qubits, such as \(|00 \cdots 0 \rangle + |11 \cdots 1 \rangle\).
2.3 Coherence time
Superposition and entanglement are extremely fragile. How long these exotic states are preserved is a measure of the “quantum-ness”, or “coherence”, of a system and determines the quality of a quantum computer. Therefore, measuring the coherence time is important for evaluating a quantum system. Two time scales describe the lifetime of a quantum state: the relaxation time (\(T_1\)) and dephasing time (\(T_2\)). \(T_1\) is the time scale at which a system relaxes from one quantum state to another, reprensenting a classical lifetime. Typically, the \(|0\rangle\) state is the ground state of a system, and the \(|1\rangle\) state is the first excited state. Owing to the limited lifetime of the excited state, the \(|1\rangle\) state relaxes to the ground state \(|0\rangle\) after a certain amount of time, as described by \(T_1\). Another form of decay affects the phase relationship between the \(|0\rangle\) and \(|1\rangle\) states, limiting a quantum lifetime of a qubit. External factors such as the lifetime of the excited states, temperature, and ambient fields can influence whether a superposition state persists or transforms into the \(|0\rangle\) and \(|1\rangle\) states. This decay also follows exponential decay and can be characterized by \(T_2\), which is the dephasing time. \(T_2\) is contingent on the system environment, and its upper limit is determined by \(T_1\).
2.4 Detection in quantum mechanics
The nature of measurement in quantum mechanics is very different from that in classical physics. In classical physics, measurements do not affect the measured system. However, quantum measurements destructively affect the quantum state of the system. Let’s assume that our quantum system is in a superposition state of \(a|0\rangle + b|1\rangle\). When a measurement is made, the superposition collapses, and the system is observed in one of its possible states, either \(|0\rangle\) or \(|1\rangle\), with a probability determined by the squared magnitude of the coefficients a and b in the superposition. This is called “wavefunction collapse”. Therefore, many repeated measurements are necessary to recover all information included in the wavefunction. This probabilistic aspect is a departure from classical determinism.
3 Desiderata for qubits
Qubits, the fundamental units of quantum information, are the basic building blocks of quantum computing, and building quantum computers begins with the implementation of physical qubits. Many discussions on the necessary conditions for qubits were conducted in the early era of quantum computing [79,80,81]. Among these, DiVincenzo proposed a set of five criteria that an ideal qubit should meet to be viable for quantum computing: (i) the ability to initialize the qubit state, (ii) sufficiently long coherence, (iii) the ability to perform universal gate operations, (iv) efficient qubit state readout, and (v) scalability to create large-scale quantum computing architectures [82, 83]. Although the aforementioned criteria are seemingly straightforward, successfully meeting all of these requirements concurrently poses a significant challenge, particularly with regard to scalability.
This section begins by introducing different methodologies for defining qubits in various physical systems. We provide broad approaches to satisfy the requirements of universal quantum computing, focusing particularly on entangling qubits. This section aims to provide guidance for designing and constructing innovative qubits on emerging platforms.
3.1 Defining qubit states
Quantum computers utilize quantum states to store and manipulate information, harnessing properties such as quantum superposition and entanglement. Qubits have two basis states to encode binary quantum information, and an arbitrary amount of quantum information can be stored in a collection of qubits, similar to the classical case.
Qubit implementations are commonly categorized according to the types of physical platforms used, such as superconducting circuits, neutral atoms, or trapped ions. However, it is equally crucial to consider the choice of quantum states designated as basis states within these physical systems. Physical platforms often contain more than two quantum states and various qubit encodings are possible within a single platform. The properties of the physical qubits are determined not only by the chosen physical system but also by the particular qubit encoding employed within that system. Furthermore, quantum states outside of the defined qubit space can be utilized as resources of quantum operations. Here, we classified qubits into three types: intrinsic two-level systems, two-level subset systems, and engineered two-level systems (Fig. 2).
Because nature is quantum mechanical [84], microscopic physical systems, such as atoms or electrons, naturally exhibit quantum mechanical behaviors. Consequently, these systems can potentially serve as natural qubits. Some systems inherently have two possible quantum states, making them natural candidates for qubits. For example, electrons and some atomic nuclei possess a spin of 1/2, resulting in two possible spin states: up or down. When subjected to a sufficiently large and stable magnetic field, these two spin states become non-degenerate and show long coherence time, which makes them good candidates for qubits. Various physical configurations have been utilized to realize such naturally two-level spin qubits, for instance, electrons floating on liquid helium [85, 86], linear electron Paul trap [87], semiconductor quantum dots [38], nuclear magnetic resonance (NMR) molecules [42, 88] and phosphorus donor atoms in silicon substrate [37, 89]. Polarization of photons is another example of an intrinsic two-level system that has been actively studied as a qubit.
In contrast, atoms or ions are composed of a central nucleus and multiple electrons, forming more complicated systems than a single electron or nucleus. Such composite systems have complex energy levels as an inter-combination of orbital states, spin states of electrons and nuclei, and their couplings [90]; hence, they possess more than two quantum states. A qubit space can be defined as a two-dimensional subset of the Hilbert space, and is classified as a two-level subset system. For example, even when considering the same species of atoms or ions, various types of qubits can be defined such as hyperfine qubits, Zeeman qubits, optical qubits [30], and Rydberg qubits [33], which are named based on transitions between specified qubit states, Color centers such as nitrogen-vacancy centers [91] and multi-electrons confined within a silicon substrate [41] possess more than two possible quantum states, which belong to the category of two-level subset systems.
In two-level subset systems, quantum states may propagate outside the qubit space, resulting in leakage errors during information processing. These errors are particularly problematic because they cannot be corrected using conventional quantum error correction methods [92, 93].
Nevertheless, the presence of auxiliary states can offer certain advantages, as they can serve as intermediate states during information processing. Many qubit control protocols use auxiliary states to implement single- and two-qubit gates [30, 32, 33] and qubit state discrimination and initialization [30, 34, 94]. Despite the aforementioned leakage errors, recent advances in error correction techniques have converted these errors into erasure errors, thereby enhancing the error correction performance [95,96,97,98]. Although the presence of redundant quantum states can potentially introduce errors, it can also provide opportunities for engineering advancements if carefully utilized.
Utilizing a high-dimensional Hilbert space with multiple qubits [99, 100] or a single qudit [101, 102], a d-dimensional information unit, can be encoded into a single physical system. Certain encoding techniques employ highly entangled states as the basis for the qubits, thereby possessing intrinsic error detection and correction properties [103, 104].
Synthetic qubits, in contrast to natural qubits, utilize the engineered Hilbert space of fabricated quantum systems. For example, the energy eigenvalues, number of bounded states, and other quantum properties of superconducting circuits are highly dependent on the circuit design [25]. A creative design of the Hilbert space may enable realization of high performance qubits in such systems. Conversely, inhomogeneity among numerous qubits can result from imperfections in the fabrication process, whereas natural qubits such as atoms or ions are identical regardless of the qubit counts.
3.2 Manipulation of single-qubit states
The qubit manipulation mechanism depends heavily on qubit states and their platforms because the underlying physical principles are different. To accomplish universal quantum computation with qubits, qubit state initialization, control via single- and two-qubit gates, and state discrimination must be performed [83].
The initialization of qubit states into a fiducial state is a fundamental step in all quantum algorithms and is frequently employed for qubit reuse, particularly for quantum error correction. The initial qubit states generally exist as thermal states with high entropy. A straightforward method for initializing qubits is to cool the qubit systems until they decay to their energy ground state. However, this method requires a sufficiently long wait time to achieve high-fidelity state initialization, making it unsuitable for repeated qubit recycling. Alternatively, quantum states can be transferred to an auxiliary state with a shorter lifetime; for example, the optical pumping process used in trapped ions or neutral atoms [94, 105] or active cooling using microwaves in superconducting qubits [106]. In addition, heralded-state preparation based on state detection can be used to induce rapid high-fidelity state preparation [107, 108].
The control of single-qubit states, i.e., single-qubit gates, can be represented by unitary evolution. A representative example of the single-qubit control method is Rabi oscillation. When these qubits are exposed to a resonant electromagnetic field, the qubit state coherently oscillates between the \(|0\rangle\) and \(|1\rangle\) states. By tuning the pulse duration, field intensity, and phase, arbitrary single qubit rotations could be realized. For better accuracy and control, more complex configurations such as Raman transitions [109] or stimulated Raman adiabatic passage [110, 111] can be used.
Contrarily, different control methods must be developed when the qubit states are not energy eigenstates or are degenerate. For example, photonic polarization qubits utilize quarter- or half-wave waveplates to realize single-qubit state control [112], and exchange-only qubits of semiconductor quantum dots utilize spin-interaction control via DC voltage pulses on electrodes [113].
The readout of qubit states involves state-dependent interactions with the environments, which commonly rely on spectroscopic methods. For example, in natural atoms or ions, a specific wavelength of light can be applied to drive qubit state-dependent transitions with short lifetimes. By collecting photons from the driven transitions, one can discriminate between the \(|0\rangle\) and \(|1\rangle\) states using the rate of photon collection [30, 34, 94]. Similar approaches include the state-dependent tunneling of spin qubits [41] and dispersive readout of superconducting qubits [25].
In summary, common strategies are widely applied across numerous qubit platforms, even though qubit manipulation is greatly diversified by physical platforms.
3.3 Creating entanglement between qubits
Quantum entanglement is a key component in quantum computing; however, achieving reliable quantum entanglement can be challenging. Many qubit platforms have successfully demonstrated single-qubit operations but not quantum entanglement. The key challenge is that the qubits should only interact with each other and not with the nearby environment.
Some qubit systems have direct qubit-qubit interaction by their nature, which can be utilized to generate entanglement between qubits (Fig. 3a). Nuclear spin qubits in NMR molecules interact with each other via direct dipolar coupling and indirect through-bond interaction [114]. Using these interactions, various entangling gates and algorithms have been demonstrated for NMR qubits [42,43,44,45,46]. Trapped molecules also exhibit mutual dipolar interaction owing to their large electric dipole moment, but unlike the nuclear spins, their strength can be controlled by varying the distance. By moving molecules trapped in an optical tweezer array, programmable entanglement via spin-exchange interaction among molecule qubits has been demonstrated [115, 116].
Although direct interaction between qubits can be straightforward, it is generally preferable to have controllable interaction rather than persistent interaction. To create entangling interactions while maintaining qubit isolation, (i) auxiliary quantum states (Fig. 3b) or (ii) auxiliary quantum systems (Fig. 3c) can be temporarily introduced to mediate these interactions.
An example of (i) is neutral atomic qubits using Rydberg interaction. Generally, neutral atoms in an optical tweezer array do not interact with each other because of vanishingly small dipole moments. However, when they are excited to highly excited Rydberg states, the enhanced dipole moments induce long-range interactions with nearby atoms, causing the Rydberg blockade phenomenon [31]. By adopting these Rydberg states as auxiliary interaction channels, neutral atoms can store quantum information within low-lying stable quantum states and are temporarily excited to Rydberg states to mediate qubit-qubit entanglement operations [33]. Along with reconfigurable interaction via atomic shuttling, programmable quantum computation has been demonstrated in neutral atom qubit platform [56, 62].
A more broadly applicable approach would be introducing auxiliary quantum systems (ii) that mediate qubit interactions, the so-called “quantum bus”. One example is the collective vibrational (phonon) modes of trapped ion chains. While quantum information is stored in the electronic states of trapped ions, phonon modes as external quantum systems can mediate the entanglement between qubit states. Resonant laser or microwave fields can induce coupling between the electronic and motional states of trapped ions, and by controlling the laser or microwave pulses, qubit-qubit entanglement can be generated in a controllable manner [27, 29, 117, 118]. Similar examples include microwave resonators of superconducting transmon qubits [25] and nitrogen-vacancy centers mediating many carbon-13 nuclei [119]. When auxiliary states or systems are introduced temporarily, those intermediate states must be properly disentangled by the end of the operation. Any residual quantum entanglement between qubit space and the auxiliary space can lead to the decoherence of qubit states and operational errors in quantum computations.
By utilizing and tuning the interactions between qubits, two-qubit unitary evolution or two-qubit entangling gates can be realized. Arbitrary quantum operations or algorithms on qubits can be decomposed into two-qubit entangling gates and single-qubit rotations, which form a universal quantum gate set. Although the controlled-NOT operation is broadly used as a universal gate element, almost any two-qubit entangling gate with single qubit rotations can form a universal gate set [114, 120, 121]. Once qubits are equipped with universal gates, state initialization, and measurement, they can be operated as a universal quantum computer.
4 Towards development of a quantum computer
Quantum computers possess disruptive potential across various fields, leveraging quantum parallelism to achieve substantial advantages in both speed and efficiency compared to classical counterparts [1, 2, 9, 15, 16, 122, 123]. Notable examples of the power of quantum parallelism include Shor’s algorithm [124] and Grover’s search algorithm [125]. Specifically, quantum computers’ capabilities in optimization [13], cryptography [14], and scientific research [20, 21] promise transformative breakthroughs in areas such as security [126], finance [10,11,12], drug discovery [3,4,5,6], and material science [7, 8].
While advancements in quantum devices have been remarkable over the past decade, realizing a fully programmable quantum computer capable of running any quantum algorithm, typically referred to as universal quantum computation, is an experimentally challenging task. Despite their potential, the current quantum computing devices are imperfect and susceptible to environmental noise. However, significant strides have been made over the past decade, achieving remarkable single- and two-qubit gate fidelities, surpassing 0.9999 and 0.999, respectively [97, 98, 127].
These advancements naturally raise several timely questions: (1) Can large-scale, albeit ‘noisy’, quantum devices outperform classical ones in specific applications? [15, 16]; (2) How can we verify ‘quantum advantage’? [128, 129]; (3) Can we envision achieving a fault-tolerant quantum computer with error-correcting protocols in the near future? [59, 61, 62]. In the following, we provide a brief summary of these points.
4.1 Analog and digital quantum device
As mentioned earlier, universal quantum computing requires the implementation of arbitrary single-qubit rotation and two-qubit entangling gates, as well as an independent local readout of all qubits. A combination of these elements serves as the building block for preparing and benchmarking arbitrary target states. However, owing to experimental limitations, not all quantum devices fulfill these requirements.
Despite the experimental constraints and limitations, it is valuable to study the behavior of large quantum systems by evolving an initial state over time under their natural Hamiltonians (Fig. 4a). If these Hamiltonians include strong interactions between qubits, the simple time evolution from a trivial unentangled state, such as with all qubits initialized in the ground state, leads to a generation of entangled states as a result of qubit-qubit interactions. This type of evolution is often referred to as quench dynamics and is employed for analog quantum simulations [130]. When the size of a quantum system becomes large or if the amount of entanglement is too extensive at late times, simulating quench dynamics using classical computers can be extremely challenging. For example, the current world-leading record for simulating large-scale quantum dynamics in generic Hamiltonian cases is limited to 38 qubits [131]. Hence, the use of an experimental quantum device for analog quantum simulations provides a way to understand large-scale quantum systems that are difficult to investigate using classical computers.
Specifically, if the Hamiltonian parameters of a given quantum device can be varied to emulate the behavior of another quantum system, for example, by adjusting the external electromagnetic fields or applying a sequence of control pulses, many-body quantum dynamics can be systematically studied in a controlled manner [130]. These direct experimental approaches are particularly valuable for understanding complex quantum phenomena in condensed matter physics, quantum chemistry, and other fields, where the computational demands of simulating quantum behavior on a classical computer become impractical.
In contrast, fully programmable quantum computers have the potential to enable practical applications beyond the reach of their classical counterparts [132]. Unlike analog quantum simulators that rely on continuous-time evolution, a fully programmable quantum computer can employ digital quantum logic (Fig. 4b). Specifically, this involves the utilization of the quantum analogs of logic gates, which serve as building blocks for designing quantum circuits for quantum computations. The diverse applications of universal quantum computers have extended from cryptography to materials science and drug discovery [133].
4.2 Near-term intermediate-scale quantum devices
The best quantum computers reported thus far provide a seemingly high two-qubit gate fidelity, exceeding 0.999. However, the ‘global’ quantum fidelity, defined as the probability of making no errors at the end of a sequence on a system level, decreases exponentially with the number of gates used in the sequence. Such imperfect quantum computers without any error correction have recently been termed Noisy Intermediate-Scale Quantum (NISQ) devices [134]. For instance, Google and a research group at the USTC in China reported global fidelities of approximately 0.002 and 0.0007 for their 53-qubit and 56-qubit quantum computers based on superconducting information processors in 2019 [15] and 2021 [122], respectively. Although their global fidelity values may seem quite low at first glance, they claimed that these global fidelities were sufficiently high to solve certain computationally hard problems much faster than classical computers, marking the first demonstration of quantum advantage. However, these computationally expensive problems intentionally employ randomized quantum circuits consisting of randomly chosen single- and two-qubit gates to create large but random states. These highly entangled, yet random, quantum states were introduced to showcase an example in which quantum computers could outperform classical computers.
In addition to these quantum advantage tests based on random states, there is a growing interest in exploring whether a NISQ device can be employed for more practical problems. While this remains an open question, IBM has recently published a paper on solving the Schrödinger equation for the celebrated quantum Ising model using a 127-qubit quantum computer [123]. In the paper, they demonstrate that physically relevant observables from a large-scale quantum simulation can be accurately measured in situations where brute-force classical computation of the Schrödinger equation becomes intractable due to exponentially long runtimes and large memory sizes. They employed a technique called noise mitigation [135] to predict the ground truth values of the observables of interest. The application of noise mitigation techniques to noisy quantum computers may provide insights into how to better utilize NISQ devices for practical applications, especially in quantum simulations.
4.3 Quantum error correction for fault-tolerant computing
The physical qubits discussed above are inherently susceptible to errors and noise, making error correction crucial for preserving the integrity of quantum information. The goal of fault-tolerant quantum computing is to ensure stable quantum operations, even in the presence of random errors and control imperfections. In summary, this involves the identification of errors in both space and time through syndrome measurements using additional ancillary qubits for real-time error correction [136]. This sophisticated approach to error correction in quantum hardware is inevitable because the existing classical error-correcting protocols are not directly applicable. This is due to the no-cloning theorem [23], which states that it is impossible to create an identical copy of an arbitrary unknown quantum state.
Full details regarding quantum error correction are beyond the scope of this elementary review (see Ref. [137] for more extensive reviews). The main idea was to define multiple delocalized entangled qubits. Specifically, the threshold theorem [23] establishes that if the error rate per physical gate operation is below a certain threshold, the delocalized state can be robustly stabilized through real-time monitoring and error correction using quantum stabilizers [138]. Hence, with the help of quantum stabilizers as spectators of random error events, the delocalized state defined over many noisy qubits can be protected to encode quantum information in an error-resilient form, which is called a ‘logical’ qubit.
Over the last few decades, extensive theoretical and experimental research has been conducted to develop various forms of logical qubits from different physical qubits, which are also referred to as quantum error correction codes. These include Shor’s code [139], Steane code [62], surface code [59, 140], and cat code [141]. Recently, the experimental realization of logical qubits has been demonstrated in leading quantum platforms, such as superconducting qubits [59], trapped ions [140], and neutral atom arrays [62]. In particular, neutral atom arrays exhibit entanglement operations with up to 48 logical qubits out of the 280 physical qubits, demonstrating a quantum error correction code [62]. This achievement was realized by employing a real-time array reconfiguration based on atom transport, along with zoned architectures for entanglement, readout, and information storage. These results show great promise for realizing medium-scale logical quantum information processors with \(\sim\) \(10^{2-3}\) logical qubits from \(\sim\) \(10^4\) physical qubits in the near future [62].
5 Conclusion
The basic principles and requirements of qubits and their prospects for quantum computing were reviewed. After demonstrating the precise control of qubits, quantum computers with hundreds of noisy qubits have become readily available in various systems and are proving its value in various fields, including quantum simulations and computations. However, owing to the limitations of current quantum computing systems, developing a fully fault-tolerant quantum computer requires considerable efforts in various areas, particularly in the constituent hardware of qubits. Attempts to identify new qubits will uncover new insights and rejuvenate research and development efforts in the broader field of quantum computing.
Availability of data and materials
Not applicable.
References
J.D. Hidary, Quantum Computing: An Applied Approach (Springer International Publishing, 2021), pp.1–422. https://doi.org/10.1007/978-3-030-83274-2/COVER
E.R. MacQuarrie, C. Simon, S. Simmons, E. Maine, The emerging commercial landscape of quantum computing. Nat. Rev. Phys. 2(11), 596–598 (2020). https://doi.org/10.1038/s42254-020-00247-5
Y. Cao, J. Romero, J.P. Olson, M. Degroote, P.D. Johnson, M. Kieferová, I.D. Kivlichan, T. Menke, B. Peropadre, N.P. Sawaya, S. Sim, L. Veis, A. Aspuru-Guzik, Quantum chemistry in the age of quantum computing. Chem. Rev. 119(19), 10856–10915 (2019). https://doi.org/10.1021/acs.chemrev.8b00803
M. Motta, J.E. Rice, Emerging quantum computing algorithms for quantum chemistry. Wiley Interdiscip. Rev. Comput. Mol. Sci. 12(3), e1580 (2022). https://doi.org/10.1002/WCMS.1580
H.P. Cheng, E. Deumens, J.K. Freericks, C. Li, B.A. Sanders, Application of quantum computing to biochemical systems: a look to the future. Front. Chem. 8, 587143 (2020). https://doi.org/10.3389/FCHEM.2020.587143
C. Outeiral, M. Strahm, J. Shi, G.M. Morris, S.C. Benjamin, C.M. Deane, The prospects of quantum computing in computational molecular biology. Wiley Interdiscip. Rev. Comput. Mol. Sci. 11(1), e1481 (2021). https://doi.org/10.1002/WCMS.1481
B. Bauer, S. Bravyi, M. Motta, G. Kin-Lic Chan, Quantum algorithms for quantum chemistry and quantum materials science. Chem. Rev. 120(22), 12685–12717 (2020). https://doi.org/10.1021/ACS.CHEMREV.9B00829
L. Bassman, M. Urbanek, M. Metcalf, J. Carter, A.F. Kemper, W.A. De Jong, Simulating quantum materials with digital quantum computers. Quant. Sci. Technol. 6(4), 043002 (2021). https://doi.org/10.1088/2058-9565/AC1CA6
F. Tacchino, A. Chiesa, S. Carretta, D. Gerace, Quantum computers as universal quantum simulators: state-of-the-art and perspectives. Adv. Quant. Technol. 3(3), 1900052 (2020). https://doi.org/10.1002/QUTE.201900052
R. Orús, S. Mugel, E. Lizaso, Quantum computing for finance: overview and prospects. Rev. Phys. 4, 100028 (2019). https://doi.org/10.1016/J.REVIP.2019.100028
D. Herman, C. Googin, X. Liu, Y. Sun, A. Galda, I. Safro, M. Pistoia, Y. Alexeev, Quantum computing for finance. Nat. Rev. Phys. 5(8), 450–465 (2023). https://doi.org/10.1038/s42254-023-00603-1
D.J. Egger, C. Gambella, J. Marecek, S. McFaddin, M. Mevissen, R. Raymond, A. Simonetto, S. Woerner, E. Yndurain, Quantum computing for finance: state-of-the-art and future prospects. IEEE Trans. Quant. Eng. 1, 3101724 (2020). https://doi.org/10.1109/TQE.2020.3030314
A. Perdomo-Ortiz, M. Benedetti, J. Realpe-Gómez, R. Biswas, Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers. Quant. Sci. Technol. 3(3), 030502 (2018). https://doi.org/10.1088/2058-9565/AAB859
T.M. Fernandez-Carames, P. Fraga-Lamas, Towards post-quantum blockchain: a review on blockchain cryptography resistant to quantum computing attacks. IEEE Access 8, 21091–21116 (2020). https://doi.org/10.1109/ACCESS.2020.2968985
F. Arute, K. Arya, R. Babbush, D. Bacon, J.C. Bardin, R. Barends, R. Biswas, S. Boixo, F.G. Brandao, D.A. Buell, B. Burkett, Y. Chen, Z. Chen, B. Chiaro, R. Collins, W. Courtney, A. Dunsworth, E. Farhi, B. Foxen, A. Fowler, C. Gidney, M. Giustina, R. Graff, K. Guerin, S. Habegger, M.P. Harrigan, M.J. Hartmann, A. Ho, M. Hoffmann, T. Huang, T.S. Humble, S.V. Isakov, E. Jeffrey, Z. Jiang, D. Kafri, K. Kechedzhi, J. Kelly, P.V. Klimov, S. Knysh, A. Korotkov, F. Kostritsa, D. Landhuis, M. Lindmark, E. Lucero, D. Lyakh, S. Mandrà, J.R. McClean, M. McEwen, A. Megrant, X. Mi, K. Michielsen, M. Mohseni, J. Mutus, O. Naaman, M. Neeley, C. Neill, M.Y. Niu, E. Ostby, A. Petukhov, J.C. Platt, C. Quintana, E.G. Rieffel, P. Roushan, N.C. Rubin, D. Sank, K.J. Satzinger, V. Smelyanskiy, K.J. Sung, M.D. Trevithick, A. Vainsencher, B. Villalonga, T. White, Z.J. Yao, P. Yeh, A. Zalcman, H. Neven, J.M. Martinis, Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505–510 (2019). https://doi.org/10.1038/s41586-019-1666-5
H.S. Zhong, H. Wang, Y.H. Deng, M.C. Chen, L.C. Peng, Y.H. Luo, J. Qin, D. Wu, X. Ding, Y. Hu, P. Hu, X.Y. Yang, W.J. Zhang, H. Li, Y. Li, X. Jiang, L. Gan, G. Yang, L. You, Z. Wang, L. Li, N.L. Liu, C.Y. Lu, J.W. Pan, Quantum computational advantage using photons. Science 370(6523), 1460–1463 (2020). https://doi.org/10.1126/science.abe8770
J. Choi, A.L. Shaw, I.S. Madjarov, X. Xie, R. Finkelstein, J.P. Covey, J.S. Cotler, D.K. Mark, H.Y. Huang, A. Kale, H. Pichler, F.G. Brandão, S. Choi, M. Endres, Preparing random states and benchmarking with many-body quantum chaos. Nature 613(7944), 468–473 (2023). https://doi.org/10.1038/s41586-022-05442-1
M. Kalinowski, N. Maskara, M.D. Lukin, Non-abelian floquet spin liquids in a digital Rydberg simulator. Phys. Rev. X 13(3), 031008 (2023). https://doi.org/10.1103/PHYSREVX.13.031008
J.Y. Lee, J. Ramette, M.A. Metlitski, V. Vuletić, W.W. Ho, S. Choi, Landau-forbidden quantum criticality in Rydberg quantum simulators. Phys. Rev. Lett. 131(8), 083601 (2023). https://doi.org/10.1103/PhysRevLett.131.083601
...Y.H. Shi, Y. Liu, Y.R. Zhang, Z. Xiang, K. Huang, T. Liu, Y.Y. Wang, J.C. Zhang, C.L. Deng, G.H. Liang, Z.Y. Mei, H. Li, T.M. Li, W.G. Ma, H.T. Liu, C.T. Chen, T. Liu, Y. Tian, X. Song, S.P. Zhao, K. Xu, D. Zheng, F. Nori, H. Fan, Quantum simulation of topological zero modes on a 41-qubit superconducting processor. Phys. Rev. Lett. 131(8), 080401 (2023). https://doi.org/10.1103/PHYSREVLETT.131.080401
...A.D. King, J. Raymond, T. Lanting, R. Harris, A. Zucca, F. Altomare, A.J. Berkley, K. Boothby, S. Ejtemaee, C. Enderud, E. Hoskinson, S. Huang, E. Ladizinsky, A.J. MacDonald, G. Marsden, R. Molavi, T. Oh, G. Poulin-Lamarre, M. Reis, C. Rich, Y. Sato, N. Tsai, M. Volkmann, J.D. Whittaker, J. Yao, A.W. Sandvik, M.H. Amin, Quantum critical dynamics in a 5000-qubit programmable spin glass. Nature 617(7959), 61–66 (2023). https://doi.org/10.1038/s41586-023-05867-2
D.K. Mark, J. Choi, A.L. Shaw, M. Endres, S. Choi, Benchmarking quantum simulators using ergodic quantum dynamics. Phys. Rev. Lett. 131(11), 110601 (2023). https://doi.org/10.1103/PHYSREVLETT.131.110601
M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, 10th edn. (Cambridge University Press, 2011)
J. Clarke, F.K. Wilhelm, Superconducting quantum bits. Nature 453, 1031–1042 (2008). https://doi.org/10.1038/nature07128
P. Krantz, M. Kjaergaard, F. Yan, T.P. Orlando, S. Gustavsson, W.D. Oliver, A quantum engineer’s guide to superconducting qubits. Appl. Phys. Rev. 6(2), 021318 (2019). https://doi.org/10.1063/1.5089550
M. Kjaergaard, M.E. Schwartz, J. Braumüller, P. Krantz, J.I.J. Wang, S. Gustavsson, W.D. Oliver, Superconducting qubits: current state of play. Annu. Rev. Condensed Matter Phys. 11(1), 369–395 (2020). https://doi.org/10.1146/annurev-conmatphys-031119-050605
J.I. Cirac, P. Zoller, Quantum computations with cold trapped ions. Phys. Rev. Lett. 74(20), 4091–4094 (1995). https://doi.org/10.1103/PhysRevLett.74.4091
H. Häffner, C.F. Roos, R. Blatt, Quantum computing with trapped ions. Phys. Rep. 469(4), 155–203 (2008). https://doi.org/10.1016/j.physrep.2008.09.003
R. Blatt, D. Wineland, Entangled states of trapped atomic ions. Nature 453(7198), 1008–1015 (2008). https://doi.org/10.1038/nature07125
C.D. Bruzewicz, J. Chiaverini, R. McConnell, J.M. Sage, Trapped-ion quantum computing: progress and challenges. Appl. Phys. Rev. 6(2), 021314 (2019). https://doi.org/10.1063/1.5088164
E. Urban, T.A. Johnson, T. Henage, L. Isenhower, D.D. Yavuz, T.G. Walker, M. Saffman, Observation of Rydberg blockade between two atoms. Nat. Phys. 5(2), 110–114 (2009). https://doi.org/10.1038/nphys1178
M. Saffman, T.G. Walker, K. Mølmer, Quantum information with Rydberg atoms. Rev. Mod. Phys. 82(3), 2313–2363 (2010). https://doi.org/10.1103/RevModPhys.82.2313
M. Saffman, Quantum computing with atomic qubits and Rydberg interactions: progress and challenges. J. Phys. B Atomic Mol. Opt. Phys. 49(20), 202001 (2016). https://doi.org/10.1088/0953-4075/49/20/202001
C.S. Adams, J.D. Pritchard, J.P. Shaffer, Rydberg atom quantum technologies. J. Phys. B Atomic Mol. Opt. Phys. 53(1), 012002 (2019). https://doi.org/10.1088/1361-6455/ab52ef
X. Wu, X. Liang, Y. Tian, F. Yang, C. Chen, Y.C. Liu, M.K. Tey, L. You, A concise review of Rydberg atom based quantum computation and quantum simulation. Chin. Phys. B 30(2), 020305 (2021). https://doi.org/10.1088/1674-1056/abd76f
D. DeMille, Quantum computation with trapped polar molecules. Phys. Rev. Lett. 88(6), 067901 (2002). https://doi.org/10.1103/PhysRevLett.88.067901
B.E. Kane, A silicon-based nuclear spin quantum computer. Nature 393(6681), 133–137 (1998). https://doi.org/10.1038/30156
D. Loss, D.P. DiVincenzo, Quantum computation with quantum dots. Phys. Rev. A 57(1), 120–126 (1998). https://doi.org/10.1103/PhysRevA.57.120
J.R. Petta, A.C. Johnson, J.M. Taylor, E.A. Laird, A. Yacoby, M.D. Lukin, C.M. Marcus, M.P. Hanson, A.C. Gossard, Coherent manipulation of coupled electron spins in semiconductor quantum dots. Science 309(5744), 2180–2184 (2005). https://doi.org/10.1126/science.1116955
R. Hanson, L.P. Kouwenhoven, J.R. Petta, S. Tarucha, L.M.K. Vandersypen, Spins in few-electron quantum dots. Rev. Mod. Phys. 79(4), 1217–1265 (2007). https://doi.org/10.1103/RevModPhys.79.1217
G. Burkard, T.D. Ladd, A. Pan, J.M. Nichol, J.R. Petta, Semiconductor spin qubits. Rev. Mod. Phys. 95(2), 025003 (2023). https://doi.org/10.1103/RevModPhys.95.025003
D.G. Cory, A.F. Fahmy, T.F. Havel, Ensemble quantum computing by NMR spectroscopy. Proc. Natl. Acad. Sci. 94(5), 1634–1639 (1997). https://doi.org/10.1073/pnas.94.5.1634
D.G. Cory, M.D. Price, W. Maas, E. Knill, R. Laflamme, W.H. Zurek, T.F. Havel, S.S. Somaroo, Experimental quantum error correction. Phys. Rev. Lett. 81(10), 2152–2155 (1998). https://doi.org/10.1103/PhysRevLett.81.2152
I.L. Chuang, N. Gershenfeld, M. Kubinec, Experimental implementation of fast quantum searching. Phys. Rev. Lett. 80(15), 3408–3411 (1998). https://doi.org/10.1103/PhysRevLett.80.3408
I.L. Chuang, L.M.K. Vandersypen, X. Zhou, D.W. Leung, S. Lloyd, Experimental realization of a quantum algorithm. Nature 393(6681), 143–146 (1998). https://doi.org/10.1038/30181
J.A. Jones, Quantum computing with NMR. Progr. Nucl. Magn. Resonan. Spectrosc. 59(2), 91–120 (2011). https://doi.org/10.1016/j.pnmrs.2010.11.001
J.L. O’Brien, Optical quantum computing. Science 318(5856), 1567–1570 (2007). https://doi.org/10.1126/science.1142892
J.L. O’Brien, A. Furusawa, J. Vučković, Photonic quantum technologies. Nat. Photonics 3(12), 687–695 (2009). https://doi.org/10.1038/nphoton.2009.229
P. Kok, W.J. Munro, K. Nemoto, T.C. Ralph, J.P. Dowling, G.J. Milburn, Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 79(1), 135–174 (2007). https://doi.org/10.1103/RevModPhys.79.135
F. Flamini, N. Spagnolo, F. Sciarrino, Photonic quantum information processing: a review. Rep. Progr. Phys. 82(1), 016001 (2018). https://doi.org/10.1088/1361-6633/aad5b2
S. Slussarenko, G.J. Pryde, Photonic quantum information processing: a concise review. Appl. Phys. Rev. 6(4), 041303 (2019). https://doi.org/10.1063/1.5115814
J. Wang, F. Sciarrino, A. Laing, M.G. Thompson, Integrated photonic quantum technologies. Nat. Photonics 14(5), 273–284 (2020). https://doi.org/10.1038/s41566-019-0532-1
S. Debnath, N.M. Linke, C. Figgatt, K.A. Landsman, K. Wright, C. Monroe, Demonstration of a small programmable quantum computer with atomic qubits. Nature 536(7614), 63–66 (2016). https://doi.org/10.1038/nature18648
...R. Barends, L. Lamata, J. Kelly, L. García-Álvarez, A.G. Fowler, A. Megrant, E. Jeffrey, T.C. White, D. Sank, J.Y. Mutus, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, I.C. Hoi, C. Neill, P.J.J. O’Malley, C. Quintana, P. Roushan, A. Vainsencher, J. Wenner, E. Solano, J.M. Martinis, Digital quantum simulation of fermionic models with a superconducting circuit. Nat. Commun. 6(1), 7654 (2015). https://doi.org/10.1038/ncomms8654
M.H. Abobeih, Y. Wang, J. Randall, S.J.H. Loenen, C.E. Bradley, M. Markham, D.J. Twitchen, B.M. Terhal, T.H. Taminiau, Fault-tolerant operation of a logical qubit in a diamond quantum processor. Nature 606(7916), 884–889 (2022). https://doi.org/10.1038/s41586-022-04819-6
D. Bluvstein, H. Levine, G. Semeghini, T.T. Wang, S. Ebadi, M. Kalinowski, A. Keesling, N. Maskara, H. Pichler, M. Greiner, V. Vuletić, M.D. Lukin, A quantum processor based on coherent transport of entangled atom arrays. Nature 604(7906), 451–456 (2022). https://doi.org/10.1038/s41586-022-04592-6
...Z. Chen, K.J. Satzinger, J. Atalaya, A.N. Korotkov, A. Dunsworth, D. Sank, C. Quintana, M. McEwen, R. Barends, P.V. Klimov, S. Hong, C. Jones, A. Petukhov, D. Kafri, S. Demura, B. Burkett, C. Gidney, A.G. Fowler, A. Paler, H. Putterman, I. Aleiner, F. Arute, K. Arya, R. Babbush, J.C. Bardin, A. Bengtsson, A. Bourassa, M. Broughton, B.B. Buckley, D.A. Buell, N. Bushnell, B. Chiaro, R. Collins, W. Courtney, A.R. Derk, D. Eppens, C. Erickson, E. Farhi, B. Foxen, M. Giustina, A. Greene, J.A. Gross, M.P. Harrigan, S.D. Harrington, J. Hilton, A. Ho, T. Huang, W.J. Huggins, L.B. Ioffe, S.V. Isakov, E. Jeffrey, Z. Jiang, K. Kechedzhi, S. Kim, A. Kitaev, F. Kostritsa, D. Landhuis, P. Laptev, E. Lucero, O. Martin, J.R. McClean, T. McCourt, X. Mi, K.C. Miao, M. Mohseni, S. Montazeri, W. Mruczkiewicz, J. Mutus, O. Naaman, M. Neeley, C. Neill, M. Newman, M.Y. Niu, T.E. O’Brien, A. Opremcak, E. Ostby, B. Pató, N. Redd, P. Roushan, N.C. Rubin, V. Shvarts, D. Strain, M. Szalay, M.D. Trevithick, B. Villalonga, T. White, Z.J. Yao, P. Yeh, J. Yoo, A. Zalcman, H. Neven, S. Boixo, V. Smelyanskiy, Y. Chen, A. Megrant, J. Kelly, Google quantum AI, exponential suppression of bit or phase errors with cyclic error correction. Nature 595(7867), 383–387 (2021). https://doi.org/10.1038/s41586-021-03588-y
S. Krinner, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Herrmann, G.J. Norris, C.K. Andersen, M. Müller, A. Blais, C. Eichler, A. Wallraff, Realizing repeated quantum error correction in a distance-three surface code. Nature 605(7911), 669–674 (2022). https://doi.org/10.1038/s41586-022-04566-8
R. Acharya, I. Aleiner, R. Allen, T.I. Andersen, M. Ansmann, F. Arute, K. Arya, A. Asfaw, J. Atalaya, R. Babbush, D. Bacon, J.C. Bardin, J. Basso, A. Bengtsson, S. Boixo, G. Bortoli, A. Bourassa, J. Bovaird, L. Brill, M. Broughton, B.B. Buckley, D.A. Buell, T. Burger, B. Burkett, N. Bushnell, Y. Chen, Z. Chen, B. Chiaro, J. Cogan, R. Collins, P. Conner, W. Courtney, A.L. Crook, B. Curtin, D.M. Debroy, A. Del Toro Barba, S. Demura, A. Dunsworth, D. Eppens, C. Erickson, L. Faoro, E. Farhi, R. Fatemi, L. Flores Burgos, E. Forati, A.G. Fowler, B. Foxen, W. Giang, C. Gidney, D. Gilboa, M. Giustina, A. Grajales Dau, J.A. Gross, S. Habegger, M.C. Hamilton, M.P. Harrigan, S.D. Harrington, O. Higgott, J. Hilton, M. Hoffmann, S. Hong, T. Huang, A. Huff, W.J. Huggins, L.B. Ioffe, S.V. Isakov, J. Iveland, E. Jeffrey, Z. Jiang, C. Jones, P. Juhas, D. Kafri, K. Kechedzhi, J. Kelly, T. Khattar, M. Khezri, M. Kieferová, S. Kim, A. Kitaev, P.V. Klimov, A.R. Klots, A.N. Korotkov, F. Kostritsa, J.M. Kreikebaum, D. Landhuis, P. Laptev, K.M. Lau, L. Laws, J. Lee, K. Lee, B.J. Lester, A. Lill, W. Liu, A. Locharla, E. Lucero, F.D. Malone, J. Marshall, O. Martin, J.R. McClean, T. McCourt, M. McEwen, A. Megrant, B. Meurer Costa, X. Mi, K.C. Miao, M. Mohseni, S. Montazeri, A. Morvan, E. Mount, W. Mruczkiewicz, O. Naaman, M. Neeley, C. Neill, A. Nersisyan, H. Neven, M. Newman, J.H. Ng, A. Nguyen, M. Nguyen, M.Y. Niu, T.E. O’Brien, A. Opremcak, J. Platt, A. Petukhov, R. Potter, L.P. Pryadko, C. Quintana, P. Roushan, N.C. Rubin, N. Saei, D. Sank, K. Sankaragomathi, K.J. Satzinger, H.F. Schurkus, C. Schuster, M.J. Shearn, A. Shorter, V. Shvarts, J. Skruzny, V. Smelyanskiy, W.C. Smith, G. Sterling, D. Strain, M. Szalay, A. Torres, G. Vidal, B. Villalonga, C. Vollgraff Heidweiller, T. White, C. Xing, Z.J. Yao, P. Yeh, J. Yoo, G. Young, A. Zalcman, Y. Zhang, N. Zhu, Suppressing quantum errors by scaling a surface code logical qubit. Nature 614(7949), 676–681 (2023). https://doi.org/10.1038/s41586-022-05434-1
L. Egan, D.M. Debroy, C. Noel, A. Risinger, D. Zhu, D. Biswas, M. Newman, M. Li, K.R. Brown, M. Cetina, C. Monroe, Fault-tolerant control of an error-corrected qubit. Nature 598(7880), 281–286 (2021). https://doi.org/10.1038/s41586-021-03928-y
L. Postler, S. Heuben, I. Pogorelov, M. Rispler, T. Feldker, M. Meth, C.D. Marciniak, R. Stricker, M. Ringbauer, R. Blatt, P. Schindler, M. Müller, T. Monz, Demonstration of fault-tolerant universal quantum gate operations. Nature 605(7911), 675–680 (2022). https://doi.org/10.1038/s41586-022-04721-1
D. Bluvstein, S.J. Evered, A.A. Geim, S.H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J.P.B. Ataides, N. Maskara, I. Cong, X. Gao, P.S. Rodriguez, T. Karolyshyn, G. Semeghini, M.J. Gullans, M. Greiner, V. Vuletić, M.D. Lukin, Logical quantum processor based on reconfigurable atom arrays. Nature (2023). https://doi.org/10.1038/s41586-023-06927-3
J. Sevilla, C. J. Riedel. Forecasting timelines of quantum computing. arXiv:2009.05045 (2020)
C. Monroe, R. Raussendorf, A. Ruthven, K.R. Brown, P. Maunz, L.M. Duan, J. Kim, Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects. Phys. Rev. A Atomic Mol. Opt. Phys. 89(2), 022317 (2014). https://doi.org/10.1103/PHYSREVA.89.022317
E.T. Campbell, B.M. Terhal, C. Vuillot, Roads towards fault-tolerant universal quantum computation. Nature 549(7671), 172–179 (2017). https://doi.org/10.1038/nature23460
...J. Niu, L. Zhang, Y. Liu, J. Qiu, W. Huang, J. Huang, H. Jia, J. Liu, Z. Tao, W. Wei, Y. Zhou, W. Zou, Y. Chen, X. Deng, X. Deng, C. Hu, L. Hu, J. Li, D. Tan, Y. Xu, F. Yan, T. Yan, S. Liu, Y. Zhong, A.N. Cleland, D. Yu, Low-loss interconnects for modular superconducting quantum processors. Nat. Electr. 6(3), 235–241 (2023). https://doi.org/10.1038/s41928-023-00925-z
A.J. Weinstein, M.D. Reed, A.M. Jones, R.W. Andrews, D. Barnes, J.Z. Blumoff, L.E. Euliss, K. Eng, B.H. Fong, S.D. Ha, D.R. Hulbert, C.A. Jackson, M. Jura, T.E. Keating, J. Kerckhoff, A.A. Kiselev, J. Matten, G. Sabbir, A. Smith, J. Wright, M.T. Rakher, T.D. Ladd, M.G. Borselli, Universal logic with encoded spin qubits in silicon. Nature 615(7954), 817–822 (2023). https://doi.org/10.1038/s41586-023-05777-3. arXiv:2202.03605
P. Ranjan, S. Gaur, H. Yadav, A.B. Urgunde, V. Singh, A. Patel, K. Vishwakarma, D. Kalirawana, R. Gupta, P. Kumar, 2D materials: increscent quantum flatland with immense potential for applications. Nano Convergence 9, 26 (2022). https://doi.org/10.1186/S40580-022-00317-7
M. Hellenbrand, J. MacManus-Driscoll, Multi-level resistive switching in hafnium-oxide-based devices for neuromorphic computing. Nano Convergence 10, 44 (2023). https://doi.org/10.1186/S40580-023-00392-4
S. Choi, T. Moon, G. Wang, J.J. Yang, Filament-free memristors for computing. Nano Convergence 10, 58 (2023). https://doi.org/10.1186/S40580-023-00407-0
E. Grumbling, M. Horowitz (eds.), Quantum Computing: Progress and Prospects (The National Academies Press, Washington, DC, 2019). https://doi.org/10.17226/25196
L. Gyongyosi, S. Imre, A survey on quantum computing technology. Comput. Sci. Rev. 31, 51–71 (2019). https://doi.org/10.1016/J.COSREV.2018.11.002
A.D. Corcoles, A. Kandala, A. Javadi-Abhari, D.T. McClure, A.W. Cross, K. Temme, P.D. Nation, M. Steffen, J.M. Gambetta, Challenges and opportunities of near-term quantum computing systems. Proc. IEEE 108(8), 1338–1352 (2020). https://doi.org/10.1109/JPROC.2019.2954005
N.P. de Leon, K.M. Itoh, D. Kim, K.K. Mehta, T.E. Northup, H. Paik, B.S. Palmer, N. Samarth, S. Sangtawesin, D.W. Steuerman, Materials challenges and opportunities for quantum computing hardware. Science (2021). https://doi.org/10.1126/SCIENCE.ABB2823
K.R. Brown, J. Chiaverini, J.M. Sage, H. Häffner, Materials challenges for trapped-ion quantum computers. Nat. Rev. Mater. 6(10), 892–905 (2021). https://doi.org/10.1038/s41578-021-00292-1
R. Feynman, The Feynman Lectures on Physics, vol. 3, 2nd edn. (Addison-Wesley, 2005)
C. Cohen-Tannoudji, B. Diu, F. Laloe, Quantum Mechanics (Wiley, 1977)
D.J. Griffiths, Introduction to Quantum Mechanics, 3rd edn. (Cambridge University Press, 2018)
D.E. Deutsch, Quantum computational networks. Proc. R. Soc. Lond. A Math. Phys. Sci. 425(1868), 73–90 (1989). https://doi.org/10.1098/rspa.1989.0099
S. Lloyd, Necessary and sufficient conditions for quantum computation. J. Mod. Opt. 41(12), 2503–2520 (1994). https://doi.org/10.1080/09500349414552341
S. Lloyd, A potentially realizable quantum computer. Science 261(5128), 1569–1571 (1993). https://doi.org/10.1126/science.261.5128.1569
D.P. DiVincenzo, D. Loss, Quantum information is physical. Superlattices Microstruct. 23(3), 419–432 (1998). https://doi.org/10.1006/spmi.1997.0520
D.P. DiVincenzo, The physical implementation of quantum computation. Fortschritte der Physik 48(9–11), 771–783 (2000). https://doi.org/10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E
R.P. Feynman, Simulating physics with computers. Int. J. Theor. Phys. 21(6/7), 467–488 (1982)
M.I. Dykman, P.M. Platzman, P. Seddighrad, Qubits with electrons on liquid helium. Phys. Rev. B 67(15), 155402 (2003). https://doi.org/10.1103/PhysRevB.67.155402
S.A. Lyon, Spin-based quantum computing using electrons on liquid helium. Phys. Rev. A 74(5), 052338 (2006). https://doi.org/10.1103/PhysRevA.74.052338
C. Matthiesen, Q. Yu, J. Guo, A.M. Alonso, H. Häffner, Trapping electrons in a room-temperature microwave paul trap. Phys. Rev. X 11(1), 011019 (2021). https://doi.org/10.1103/PhysRevX.11.011019
N.A. Gershenfeld, I.L. Chuang, Bulk spin-resonance quantum computation. Science 275(5298), 350–356 (1997). https://doi.org/10.1126/science.275.5298.350
J.C. McCallum, B.C. Johnson, T. Botzem, Donor-based qubits for quantum computing in silicon. Appl. Phys. Rev. 8(3), 031314 (2021). https://doi.org/10.1063/5.0060957
C.J. Foot, Atomic Physics. Oxford Master Series in Physics (Oxford University Press, Oxford, 2004)
S. Pezzagna, J. Meijer, Quantum computer based on color centers in diamond. Appl. Phys. Rev. 8(1), 011308 (2021). https://doi.org/10.1063/5.0007444
...Z. Chen, J. Kelly, C. Quintana, R. Barends, B. Campbell, Y. Chen, B. Chiaro, A. Dunsworth, A. Fowler, E. Lucero, E. Jeffrey, A. Megrant, J. Mutus, M. Neeley, C. Neill, P. O’Malley, P. Roushan, D. Sank, A. Vainsencher, J. Wenner, T. White, A. Korotkov, J.M. Martinis, Measuring and suppressing quantum state leakage in a superconducting qubit. Phys. Rev. Lett. 116(2), 020501 (2016). https://doi.org/10.1103/PhysRevLett.116.020501
D. Hayes, D. Stack, B. Bjork, A. Potter, C. Baldwin, R. Stutz, Eliminating leakage errors in hyperfine qubits. Phys. Rev. Lett. 124(17), 170501 (2020). https://doi.org/10.1103/PhysRevLett.124.170501
S. Crain, C. Cahall, G. Vrijsen, E.E. Wollman, M.D. Shaw, V.B. Verma, S.W. Nam, J. Kim, High-speed low-crosstalk detection of a 171Yb+ qubit using superconducting nanowire single photon detectors. Commun. Phys. 2(1), 1–6 (2019). https://doi.org/10.1038/s42005-019-0195-8
Y. Wu, S. Kolkowitz, S. Puri, J.D. Thompson, Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays. Nat. Commun. 13(1), 4657 (2022). https://doi.org/10.1038/s41467-022-32094-6
M. Kang, W.C. Campbell, K.R. Brown, Quantum error correction with metastable states of trapped ions using erasure conversion. PRX Quantum 4(2), 020358 (2023). https://doi.org/10.1103/PRXQuantum.4.020358
S. Ma, G. Liu, P. Peng, B. Zhang, S. Jandura, J. Claes, A.P. Burgers, G. Pupillo, S. Puri, J.D. Thompson, High-fidelity gates and mid-circuit erasure conversion in an atomic qubit. Nature 622(7982), 279–284 (2023). https://doi.org/10.1038/s41586-023-06438-1
P. Scholl, A.L. Shaw, R.B.S. Tsai, R. Finkelstein, J. Choi, M. Endres, Erasure conversion in a high-fidelity Rydberg quantum simulator. Nature 622(7982), 273–278 (2023). https://doi.org/10.1038/s41586-023-06516-4
W.C. Campbell, E.R. Hudson, Polyqubit quantum processing (2022). https://doi.org/10.48550/arXiv.2210.15484
D.T.C. Allcock, W.C. Campbell, J. Chiaverini, I.L. Chuang, E.R. Hudson, I.D. Moore, A. Ransford, C. Roman, J.M. Sage, D.J. Wineland, omg blueprint for trapped ion quantum computing with metastable states. Appl. Phys. Lett. 119(21), 214002 (2021). https://doi.org/10.1063/5.0069544
P.J. Low, B.M. White, A.A. Cox, M.L. Day, C. Senko, Practical trapped-ion protocols for universal qudit-based quantum computing. Phys. Rev. Res. 2(3), 033128 (2020). https://doi.org/10.1103/PhysRevResearch.2.033128
...Y. Chi, J. Huang, Z. Zhang, J. Mao, Z. Zhou, X. Chen, C. Zhai, J. Bao, T. Dai, H. Yuan, M. Zhang, D. Dai, B. Tang, Y. Yang, Z. Li, Y. Ding, L.K. Oxenløwe, M.G. Thompson, J.L. O’Brien, Y. Li, Q. Gong, J. Wang, A programmable qudit-based quantum processor. Nat. Commun. 13(1), 1166 (2022). https://doi.org/10.1038/s41467-022-28767-x
D. Gottesman, A. Kitaev, J. Preskill, Encoding a qubit in an oscillator. Phys. Rev. A 64(1), 012310 (2001). https://doi.org/10.1103/PhysRevA.64.012310
V.V. Sivak, A. Eickbusch, B. Royer, S. Singh, I. Tsioutsios, S. Ganjam, A. Miano, B.L. Brock, A.Z. Ding, L. Frunzio, S.M. Girvin, R.J. Schoelkopf, M.H. Devoret, Real-time quantum error correction beyond break-even. Nature 616(7955), 50–55 (2023). https://doi.org/10.1038/s41586-023-05782-6
W. Happer, Optical Pumping. Rev. Mod. Phys. 44(2), 169–249 (1972). https://doi.org/10.1103/RevModPhys.44.169
S.O. Valenzuela, W.D. Oliver, D.M. Berns, K.K. Berggren, L.S. Levitov, T.P. Orlando, Microwave-induced cooling of a superconducting qubit. Science 314(5805), 1589–1592 (2006). https://doi.org/10.1126/science.1134008
D. Ristè, J.G. van Leeuwen, H.S. Ku, K.W. Lehnert, L. DiCarlo, Initialization by measurement of a superconducting quantum bit circuit. Phys. Rev. Lett. 109(5), 050507 (2012). https://doi.org/10.1103/PhysRevLett.109.050507
J.E. Johnson, C. Macklin, D.H. Slichter, R. Vijay, E.B. Weingarten, J. Clarke, I. Siddiqi, Heralded state preparation in a superconducting qubit. Phys. Rev. Lett. 109(5), 050506 (2012). https://doi.org/10.1103/PhysRevLett.109.050506
C. Monroe, D.M. Meekhof, B.E. King, W.M. Itano, D.J. Wineland, Demonstration of a fundamental quantum logic gate. Phys. Rev. Lett. 75(25), 4714–4717 (1995). https://doi.org/10.1103/PhysRevLett.75.4714
Z. Kis, F. Renzoni, Qubit rotation by stimulated Raman adiabatic passage. Phys. Rev. A 65(3), 032318 (2002). https://doi.org/10.1103/PhysRevA.65.032318
N.V. Vitanov, A.A. Rangelov, B.W. Shore, K. Bergmann, Stimulated Raman adiabatic passage in physics, chemistry, and beyond. Rev. Mod. Phys. 89(1), 015006 (2017). https://doi.org/10.1103/RevModPhys.89.015006
E. Knill, R. Laflamme, G.J. Milburn, A scheme for efficient quantum computation with linear optics. Nature 409(6816), 46–52 (2001). https://doi.org/10.1038/35051009
E.A. Laird, J.M. Taylor, D.P. DiVincenzo, C.M. Marcus, M.P. Hanson, A.C. Gossard, Coherent spin manipulation in an exchange-only qubit. Phys. Rev. B 82(7), 075403 (2010). https://doi.org/10.1103/PhysRevB.82.075403
M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information, 10th edn. (Cambridge University Press, Cambridge, 2000)
C.M. Holland, Y. Lu, L.W. Cheuk, On-demand entanglement of molecules in a reconfigurable optical tweezer array. Science 382(6675), 1143–1147 (2023). https://doi.org/10.1126/science.adf4272
Y. Bao, S.S. Yu, L. Anderegg, E. Chae, W. Ketterle, K.K. Ni, J.M. Doyle, Dipolar spin-exchange and entanglement between molecules in an optical tweezer array. Science 382(6675), 1138–1143 (2023). https://doi.org/10.1126/science.adf8999
A. Sørensen, K. Mølmer, Quantum Computation with Ions in Thermal Motion. Phys. Rev. Lett. 82(9), 1971–1974 (1999). https://doi.org/10.1103/PhysRevLett.82.1971
Z. Cai, C.Y. Luan, L. Ou, H. Tu, Z. Yin, J.N. Zhang, K. Kim, Entangling gates for trapped-ion quantum computation and quantum simulation. J. Korean Phys. Soc. 82(9), 882–900 (2023). https://doi.org/10.1007/s40042-023-00772-3
C. Bradley, J. Randall, M. Abobeih, R. Berrevoets, M. Degen, M. Bakker, M. Markham, D. Twitchen, T. Taminiau, A ten-qubit solid-state spin register with quantum memory up to one minute. Phys. Rev. X 9(3), 031045 (2019). https://doi.org/10.1103/PhysRevX.9.031045
S. Lloyd, Almost any quantum logic gate is universal. Phys. Rev. Lett. 75(2), 346–349 (1995). https://doi.org/10.1103/PhysRevLett.75.346
D.E. Deutsch, A. Barenco, A. Ekert, Universality in quantum computation. Proc. R. Soc. Lond. Ser. A Math. Phys. Sci. 449(193), 669–677 (1997). https://doi.org/10.1098/rspa.1995.0065
Y. Wu, W.S. Bao, S. Cao, F. Chen, M.C. Chen, X. Chen, T.H. Chung, H. Deng, Y. Du, D. Fan et al., Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett. 127(18), 180501 (2021)
Y. Kim, A. Eddins, S. Anand, K.X. Wei, E. van den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, A. Kandala, Evidence for the utility of quantum computing before fault tolerance. Nature 618(7965), 500–505 (2023). https://doi.org/10.1038/s41586-023-06096-3
P.W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484 (1997)
L.K. Grover, A fast quantum mechanical algorithm for database search. Proceedings of the annual ACM symposium on theory of computing pp. 212–219 (1996). https://doi.org/10.1145/237814.237866. https://dl.acm.org/doi/10.1145/237814.237866. arXiv:9605043 [quant-ph]
M.J. Hossain Faruk, S. Tahora, M. Tasnim, H. Shahriar, N. Sakib, in 2022 1st International Conference on AI in Cybersecurity (ICAIC) (2022), pp. 1–8. https://doi.org/10.1109/ICAIC53980.2022.9896970
S.J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S.H. Li, A.A. Geim, T.T. Wang, N. Maskara, H. Levine, G. Semeghini, M. Greiner, V. Vuletic, M.D. Lukin, High-fidelity parallel entangling gates on a neutral atom quantum computer, Nature (2023). https://doi.org/10.48550/arXiv.2304.05420
F. Pan, P. Zhang, Simulation of quantum circuits using the big-batch tensor network method. Phys. Rev. Lett. 128(3), 030501 (2022)
G.D. Kahanamoku-Meyer, S. Choi, U.V. Vazirani, N.Y. Yao, Classically verifiable quantum advantage from a computational bell test. Nat. Phys. 18(8), 918–924 (2022)
A.J. Daley, Twenty-five years of analogue quantum simulation. Nat. Rev. Phys. 5(12), 702–703 (2023). https://doi.org/10.1038/s42254-023-00666-0
M. Hauru, A. Morningstar, J. Beall, M. Ganahl, A. Lewis, G. Vidal, Simulation of quantum physics with tensor processing units: brute-force computation of ground states and time evolution. arXiv:2111.10466 (2021)
I. Georgescu, The DiVincenzo criteria 20 years on. Nat. Rev. Phys. 2(12), 666–666 (2020). https://doi.org/10.1038/s42254-020-00256-4
S.S. Gill, A. Kumar, H. Singh, M. Singh, K. Kaur, M. Usman, R. Buyya, Quantum computing: a taxonomy, systematic review and future directions. Softw. Pract. Exp. 52(1), 66–114 (2022). https://doi.org/10.1002/spe.3039
J. Preskill, Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https://doi.org/10.22331/q-2018-08-06-79
Y. Suzuki, S. Endo, K. Fujii, Y. Tokunaga, Quantum error mitigation as a universal error reduction technique: applications from the NISQ to the fault-tolerant quantum computing eras. PRX Quantum 3(1), 010345 (2022)
I. Georgescu, 25 years of quantum error correction. Nat. Rev. Phys. 2(10), 519–519 (2020)
J. Roffe, Quantum error correction: an introductory guide. Contemp. Phys. 60(3), 226–245 (2019)
D. Gottesman, Stabilizer Codes and Quantum Error Correction (California Institute of Technology, 1997)
P.W. Shor, Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52(4), R2493 (1995)
L. Postler, F. Butt, I. Pogorelov, C.D. Marciniak, S. Heußen, R. Blatt, P. Schindler, M. Rispler, M. Müller, T. Monz, Demonstration of fault-tolerant steane quantum error correction. arXiv:2312.09745 (2023)
N. Ofek, A. Petrenko, R. Heeres, P. Reinhold, Z. Leghtas, B. Vlastakis, Y. Liu, L. Frunzio, S. Girvin, L. Jiang et al., Extending the lifetime of a quantum bit with error correction in superconducting circuits. Nature 536(7617), 441–445 (2016)
Acknowledgements
Not applicable.
Funding
EC acknowledges the support from the National Research Foundation of Korea under grant numbers 2021M3H3A1085299, 2022M3E4A1077340, and 2022M3C1C8097622. JK acknowledges the support from the National Research Foundation of Korea (NRF) under grant numbers 2022M3E4A105136512, 2022R1C1C100375812, 2022M3K4A109712211, and RS-2023-00302576 funded by the Korean government(MSIT). JC acknowledges the support from the startup fund and the Terman Faculty Fellowship at Stanford.
Author information
Authors and Affiliations
Contributions
EC, JC, and JK contributed equally to this work. EC, JC, and JK wrote, reviewed, and edited the manuscript. All authors read and have approved the final manuscript for publication.
Corresponding authors
Ethics declarations
Comepting interests
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Chae, E., Choi, J. & Kim, J. An elementary review on basic principles and developments of qubits for quantum computing. Nano Convergence 11, 11 (2024). https://doi.org/10.1186/s40580-024-00418-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s40580-024-00418-5