Skip to main content
Nano Convergence logoLink to Nano Convergence
. 2024 Mar 18;11:11. doi: 10.1186/s40580-024-00418-5

An elementary review on basic principles and developments of qubits for quantum computing

Eunmi Chae 1,, Joonhee Choi 2,, Junki Kim 3,4,
PMCID: PMC10948723  PMID: 38498068

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.

Keywords: Qubits, Quantum operations, Quantum computers

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 [113]. 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 [1719], 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 [2426], trapped ions [2730], Rydberg atoms [3135], dipolar molecules [36], semiconductors [3741], nucleus spins [4246],photons [4752], 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 [5562], 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, 6466]. 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 [6870].

Numerous reviews have comprehensively detailed existing quantum computing systems [7173], 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.

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-210-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, 7678].

Fig. 1.

Fig. 1

An introductory overview of classical computers and quantum computers. The basic unit of information in classical computers is a digital bit whose value is either 0 or 1. Quantum computers consist of qubits, which have 0 and 1 states, as well as superposition states. The physical system of classical bits is a transistor, while there are many physical systems for qubits. The error rates of classical bits are extremely low, 10-1310-18, and are caused by clock jitters, background radiation, etc. Temperature fluctuations, noises in microwaves and lasers for qubit manipulation, environmental electromagnetic fields can induce qubit errors at a rate of 10-210-4. The errors in classical bits can be corrected by copying the information to multiple bits. Because a quantum state cannot be copied, multiple physical qubits are entangled to form a logical qubit to reduce the error

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 and |1 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+b|1, 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.

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, |01, |10, and |11, 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+|10, 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 and |1. These consist of superpositions of the linear combinations of the two states: |00+|11, |00-|11, |01+|10, and |01-|10. 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 |000+|111.

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 (T1) and dephasing time (T2). T1 is the time scale at which a system relaxes from one quantum state to another, reprensenting a classical lifetime. Typically, the |0 state is the ground state of a system, and the |1 state is the first excited state. Owing to the limited lifetime of the excited state, the |1 state relaxes to the ground state |0 after a certain amount of time, as described by T1. Another form of decay affects the phase relationship between the |0 and |1 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 and |1 states. This decay also follows exponential decay and can be characterized by T2, which is the dephasing time. T2 is contingent on the system environment, and its upper limit is determined by T1.

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+b|1. When a measurement is made, the superposition collapses, and the system is observed in one of its possible states, either |0 or |1, 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.

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 [7981]. 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.

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

Fig. 2.

Fig. 2

Three different qubit types. Natural qubits employ naturally emerging physical systems such as electrons or atoms. Some systems inherently have two quantum states to be occupied (a intrinsic two-level system) while others have a larger state space and the qubit space is defined as a subset (b two-level subset system). Synthetic qubits utilize engineered quantum systems and their quantum states can be tuned by system parameters. (c engineered two-level system)

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 [9598]. 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.

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

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 [4246]. 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].

Fig. 3.

Fig. 3

General approaches to establish qubit-qubit entanglements. a Some qubit platforms have direct qubit-qubit interactions by nature, which are persistent during the computation process. Controllable interaction can be achieved by introducing b auxiliary quantum states or c auxiliary quantum systems while maintaining the isolation of qubits. Blue arrows indicate interaction channels between quantum states or systems

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.

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 [1012], drug discovery [36], 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.

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.

Fig. 4.

Fig. 4

a Analog Hamiltonian evolution and b digital quantum circuit. In a, quench evolution is performed as a function of time under a time-independent Hamiltonian H^, implementing a time evolution operator U^(t) and thereby transforming the initial all-zero qubit state, |Ψ(0)=|0000, into the target state, |Ψ(t)=U^(t)|Ψ(0), at a later time t. In b, single- and two-qubit gates are employed to construct a quantum circuit. By applying judiciously chosen quantum gates, the target quantum state, |Ψtarget, is prepared via digitized state evolution

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

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.

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 102-3 logical qubits from 104 physical qubits in the near future [62].

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.

Acknowledgements

Not applicable.

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

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.

Availability of data and materials

Not applicable.

Declarations

Comepting interests

The authors declare no competing interests.

Footnotes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Eunmi Chae, Email: echae@korea.ac.kr.

Joonhee Choi, Email: joonhee.choi@stanford.edu.

Junki Kim, Email: junki.kim.q@skku.edu.

References

  • 1.Hidary JD. Quantum Computing: An Applied Approach. Springer International Publishing; 2021. pp. 1–422. [Google Scholar]
  • 2.MacQuarrie ER, Simon C, Simmons S, Maine E. The emerging commercial landscape of quantum computing. Nat. Rev. Phys. 2020;2(11):596–598. doi: 10.1038/s42254-020-00247-5. [DOI] [Google Scholar]
  • 3.Cao Y, Romero J, Olson JP, Degroote M, Johnson PD, Kieferová M, Kivlichan ID, Menke T, Peropadre B, Sawaya NP, Sim S, Veis L, Aspuru-Guzik A. Quantum chemistry in the age of quantum computing. Chem. Rev. 2019;119(19):10856–10915. doi: 10.1021/acs.chemrev.8b00803. [DOI] [PubMed] [Google Scholar]
  • 4.Motta M, Rice JE. Emerging quantum computing algorithms for quantum chemistry. Wiley Interdiscip. Rev. Comput. Mol. Sci. 2022;12(3):e1580. doi: 10.1002/WCMS.1580. [DOI] [Google Scholar]
  • 5.Cheng HP, Deumens E, Freericks JK, Li C, Sanders BA. Application of quantum computing to biochemical systems: a look to the future. Front. Chem. 2020;8:587143. doi: 10.3389/FCHEM.2020.587143. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 6.Outeiral C, Strahm M, Shi J, Morris GM, Benjamin SC, Deane CM. The prospects of quantum computing in computational molecular biology. Wiley Interdiscip. Rev. Comput. Mol. Sci. 2021;11(1):e1481. doi: 10.1002/WCMS.1481. [DOI] [Google Scholar]
  • 7.Bauer B, Bravyi S, Motta M, Kin-Lic Chan G. Quantum algorithms for quantum chemistry and quantum materials science. Chem. Rev. 2020;120(22):12685–12717. doi: 10.1021/ACS.CHEMREV.9B00829. [DOI] [PubMed] [Google Scholar]
  • 8.Bassman L, Urbanek M, Metcalf M, Carter J, Kemper AF, De Jong WA. Simulating quantum materials with digital quantum computers. Quant. Sci. Technol. 2021;6(4):043002. doi: 10.1088/2058-9565/AC1CA6. [DOI] [Google Scholar]
  • 9.Tacchino F, Chiesa A, Carretta S, Gerace D. Quantum computers as universal quantum simulators: state-of-the-art and perspectives. Adv. Quant. Technol. 2020;3(3):1900052. doi: 10.1002/QUTE.201900052. [DOI] [Google Scholar]
  • 10.Orús R, Mugel S, Lizaso E. Quantum computing for finance: overview and prospects. Rev. Phys. 2019;4:100028. doi: 10.1016/J.REVIP.2019.100028. [DOI] [Google Scholar]
  • 11.Herman D, Googin C, Liu X, Sun Y, Galda A, Safro I, Pistoia M, Alexeev Y. Quantum computing for finance. Nat. Rev. Phys. 2023;5(8):450–465. doi: 10.1038/s42254-023-00603-1. [DOI] [Google Scholar]
  • 12.Egger DJ, Gambella C, Marecek J, McFaddin S, Mevissen M, Raymond R, Simonetto A, Woerner S, Yndurain E. Quantum computing for finance: state-of-the-art and future prospects. IEEE Trans. Quant. Eng. 2020;1:3101724. doi: 10.1109/TQE.2020.3030314. [DOI] [Google Scholar]
  • 13.Perdomo-Ortiz A, Benedetti M, Realpe-Gómez J, Biswas R. Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers. Quant. Sci. Technol. 2018;3(3):030502. doi: 10.1088/2058-9565/AAB859. [DOI] [Google Scholar]
  • 14.Fernandez-Carames TM, Fraga-Lamas P. Towards post-quantum blockchain: a review on blockchain cryptography resistant to quantum computing attacks. IEEE Access. 2020;8:21091–21116. doi: 10.1109/ACCESS.2020.2968985. [DOI] [Google Scholar]
  • 15.Arute F, Arya K, Babbush R, Bacon D, Bardin JC, Barends R, Biswas R, Boixo S, Brandao FG, Buell DA, Burkett B, Chen Y, Chen Z, Chiaro B, Collins R, Courtney W, Dunsworth A, Farhi E, Foxen B, Fowler A, Gidney C, Giustina M, Graff R, Guerin K, Habegger S, Harrigan MP, Hartmann MJ, Ho A, Hoffmann M, Huang T, Humble TS, Isakov SV, Jeffrey E, Jiang Z, Kafri D, Kechedzhi K, Kelly J, Klimov PV, Knysh S, Korotkov A, Kostritsa F, Landhuis D, Lindmark M, Lucero E, Lyakh D, Mandrà S, McClean JR, McEwen M, Megrant A, Mi X, Michielsen K, Mohseni M, Mutus J, Naaman O, Neeley M, Neill C, Niu MY, Ostby E, Petukhov A, Platt JC, Quintana C, Rieffel EG, Roushan P, Rubin NC, Sank D, Satzinger KJ, Smelyanskiy V, Sung KJ, Trevithick MD, Vainsencher A, Villalonga B, White T, Yao ZJ, Yeh P, Zalcman A, Neven H, Martinis JM. Quantum supremacy using a programmable superconducting processor. Nature. 2019;574(7779):505–510. doi: 10.1038/s41586-019-1666-5. [DOI] [PubMed] [Google Scholar]
  • 16.Zhong HS, Wang H, Deng YH, Chen MC, Peng LC, Luo YH, Qin J, Wu D, Ding X, Hu Y, Hu P, Yang XY, Zhang WJ, Li H, Li Y, Jiang X, Gan L, Yang G, You L, Wang Z, Li L, Liu NL, Lu CY, Pan JW. Quantum computational advantage using photons. Science. 2020;370(6523):1460–1463. doi: 10.1126/science.abe8770. [DOI] [PubMed] [Google Scholar]
  • 17.Choi J, Shaw AL, Madjarov IS, Xie X, Finkelstein R, Covey JP, Cotler JS, Mark DK, Huang HY, Kale A, Pichler H, Brandão FG, Choi S, Endres M. Preparing random states and benchmarking with many-body quantum chaos. Nature. 2023;613(7944):468–473. doi: 10.1038/s41586-022-05442-1. [DOI] [PubMed] [Google Scholar]
  • 18.Kalinowski M, Maskara N, Lukin MD. Non-abelian floquet spin liquids in a digital Rydberg simulator. Phys. Rev. X. 2023;13(3):031008. doi: 10.1103/PHYSREVX.13.031008. [DOI] [Google Scholar]
  • 19.Lee JY, Ramette J, Metlitski MA, Vuletić V, Ho WW, Choi S. Landau-forbidden quantum criticality in Rydberg quantum simulators. Phys. Rev. Lett. 2023;131(8):083601. doi: 10.1103/PhysRevLett.131.083601. [DOI] [PubMed] [Google Scholar]
  • 20.Shi YH, Liu Y, Zhang YR, Xiang Z, Huang K, Liu T, Wang YY, Zhang JC, Deng CL, Liang GH, Mei ZY, Li H, Li TM, Ma WG, Liu HT, Chen CT, Liu T, Tian Y, Song X, Zhao SP, Xu K, Zheng D, Nori F, Fan H. Quantum simulation of topological zero modes on a 41-qubit superconducting processor. Phys. Rev. Lett. 2023;131(8):080401. doi: 10.1103/PHYSREVLETT.131.080401. [DOI] [PubMed] [Google Scholar]
  • 21.King AD, Raymond J, Lanting T, Harris R, Zucca A, Altomare F, Berkley AJ, Boothby K, Ejtemaee S, Enderud C, Hoskinson E, Huang S, Ladizinsky E, MacDonald AJ, Marsden G, Molavi R, Oh T, Poulin-Lamarre G, Reis M, Rich C, Sato Y, Tsai N, Volkmann M, Whittaker JD, Yao J, Sandvik AW, Amin MH. Quantum critical dynamics in a 5000-qubit programmable spin glass. Nature. 2023;617(7959):61–66. doi: 10.1038/s41586-023-05867-2. [DOI] [PubMed] [Google Scholar]
  • 22.Mark DK, Choi J, Shaw AL, Endres M, Choi S. Benchmarking quantum simulators using ergodic quantum dynamics. Phys. Rev. Lett. 2023;131(11):110601. doi: 10.1103/PHYSREVLETT.131.110601. [DOI] [PubMed] [Google Scholar]
  • 23.Nielsen MA, Chuang IL. Quantum Computation and Quantum Information. 10. Cambridge University Press; 2011. [Google Scholar]
  • 24.Clarke J, Wilhelm FK. Superconducting quantum bits. Nature. 2008;453:1031–1042. doi: 10.1038/nature07128. [DOI] [PubMed] [Google Scholar]
  • 25.Krantz P, Kjaergaard M, Yan F, Orlando TP, Gustavsson S, Oliver WD. A quantum engineer’s guide to superconducting qubits. Appl. Phys. Rev. 2019;6(2):021318. doi: 10.1063/1.5089550. [DOI] [Google Scholar]
  • 26.Kjaergaard M, Schwartz ME, Braumüller J, Krantz P, Wang JIJ, Gustavsson S, Oliver WD. Superconducting qubits: current state of play. Annu. Rev. Condensed Matter Phys. 2020;11(1):369–395. doi: 10.1146/annurev-conmatphys-031119-050605. [DOI] [Google Scholar]
  • 27.Cirac JI, Zoller P. Quantum computations with cold trapped ions. Phys. Rev. Lett. 1995;74(20):4091–4094. doi: 10.1103/PhysRevLett.74.4091. [DOI] [PubMed] [Google Scholar]
  • 28.Häffner H, Roos CF, Blatt R. Quantum computing with trapped ions. Phys. Rep. 2008;469(4):155–203. doi: 10.1016/j.physrep.2008.09.003. [DOI] [Google Scholar]
  • 29.Blatt R, Wineland D. Entangled states of trapped atomic ions. Nature. 2008;453(7198):1008–1015. doi: 10.1038/nature07125. [DOI] [PubMed] [Google Scholar]
  • 30.Bruzewicz CD, Chiaverini J, McConnell R, Sage JM. Trapped-ion quantum computing: progress and challenges. Appl. Phys. Rev. 2019;6(2):021314. doi: 10.1063/1.5088164. [DOI] [Google Scholar]
  • 31.Urban E, Johnson TA, Henage T, Isenhower L, Yavuz DD, Walker TG, Saffman M. Observation of Rydberg blockade between two atoms. Nat. Phys. 2009;5(2):110–114. doi: 10.1038/nphys1178. [DOI] [Google Scholar]
  • 32.Saffman M, Walker TG, Mølmer K. Quantum information with Rydberg atoms. Rev. Mod. Phys. 2010;82(3):2313–2363. doi: 10.1103/RevModPhys.82.2313. [DOI] [Google Scholar]
  • 33.Saffman M. Quantum computing with atomic qubits and Rydberg interactions: progress and challenges. J. Phys. B Atomic Mol. Opt. Phys. 2016;49(20):202001. doi: 10.1088/0953-4075/49/20/202001. [DOI] [Google Scholar]
  • 34.Adams CS, Pritchard JD, Shaffer JP. Rydberg atom quantum technologies. J. Phys. B Atomic Mol. Opt. Phys. 2019;53(1):012002. doi: 10.1088/1361-6455/ab52ef. [DOI] [Google Scholar]
  • 35.Wu X, Liang X, Tian Y, Yang F, Chen C, Liu YC, Tey MK, You L. A concise review of Rydberg atom based quantum computation and quantum simulation. Chin. Phys. B. 2021;30(2):020305. doi: 10.1088/1674-1056/abd76f. [DOI] [Google Scholar]
  • 36.DeMille D. Quantum computation with trapped polar molecules. Phys. Rev. Lett. 2002;88(6):067901. doi: 10.1103/PhysRevLett.88.067901. [DOI] [PubMed] [Google Scholar]
  • 37.Kane BE. A silicon-based nuclear spin quantum computer. Nature. 1998;393(6681):133–137. doi: 10.1038/30156. [DOI] [Google Scholar]
  • 38.Loss D, DiVincenzo DP. Quantum computation with quantum dots. Phys. Rev. A. 1998;57(1):120–126. doi: 10.1103/PhysRevA.57.120. [DOI] [Google Scholar]
  • 39.Petta JR, Johnson AC, Taylor JM, Laird EA, Yacoby A, Lukin MD, Marcus CM, Hanson MP, Gossard AC. Coherent manipulation of coupled electron spins in semiconductor quantum dots. Science. 2005;309(5744):2180–2184. doi: 10.1126/science.1116955. [DOI] [PubMed] [Google Scholar]
  • 40.Hanson R, Kouwenhoven LP, Petta JR, Tarucha S, Vandersypen LMK. Spins in few-electron quantum dots. Rev. Mod. Phys. 2007;79(4):1217–1265. doi: 10.1103/RevModPhys.79.1217. [DOI] [Google Scholar]
  • 41.Burkard G, Ladd TD, Pan A, Nichol JM, Petta JR. Semiconductor spin qubits. Rev. Mod. Phys. 2023;95(2):025003. doi: 10.1103/RevModPhys.95.025003. [DOI] [Google Scholar]
  • 42.Cory DG, Fahmy AF, Havel TF. Ensemble quantum computing by NMR spectroscopy. Proc. Natl. Acad. Sci. 1997;94(5):1634–1639. doi: 10.1073/pnas.94.5.1634. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 43.Cory DG, Price MD, Maas W, Knill E, Laflamme R, Zurek WH, Havel TF, Somaroo SS. Experimental quantum error correction. Phys. Rev. Lett. 1998;81(10):2152–2155. doi: 10.1103/PhysRevLett.81.2152. [DOI] [Google Scholar]
  • 44.Chuang IL, Gershenfeld N, Kubinec M. Experimental implementation of fast quantum searching. Phys. Rev. Lett. 1998;80(15):3408–3411. doi: 10.1103/PhysRevLett.80.3408. [DOI] [Google Scholar]
  • 45.Chuang IL, Vandersypen LMK, Zhou X, Leung DW, Lloyd S. Experimental realization of a quantum algorithm. Nature. 1998;393(6681):143–146. doi: 10.1038/30181. [DOI] [Google Scholar]
  • 46.Jones JA. Quantum computing with NMR. Progr. Nucl. Magn. Resonan. Spectrosc. 2011;59(2):91–120. doi: 10.1016/j.pnmrs.2010.11.001. [DOI] [PubMed] [Google Scholar]
  • 47.O’Brien JL. Optical quantum computing. Science. 2007;318(5856):1567–1570. doi: 10.1126/science.1142892. [DOI] [PubMed] [Google Scholar]
  • 48.O’Brien JL, Furusawa A, Vučković J. Photonic quantum technologies. Nat. Photonics. 2009;3(12):687–695. doi: 10.1038/nphoton.2009.229. [DOI] [Google Scholar]
  • 49.Kok P, Munro WJ, Nemoto K, Ralph TC, Dowling JP, Milburn GJ. Linear optical quantum computing with photonic qubits. Rev. Mod. Phys. 2007;79(1):135–174. doi: 10.1103/RevModPhys.79.135. [DOI] [Google Scholar]
  • 50.Flamini F, Spagnolo N, Sciarrino F. Photonic quantum information processing: a review. Rep. Progr. Phys. 2018;82(1):016001. doi: 10.1088/1361-6633/aad5b2. [DOI] [PubMed] [Google Scholar]
  • 51.Slussarenko S, Pryde GJ. Photonic quantum information processing: a concise review. Appl. Phys. Rev. 2019;6(4):041303. doi: 10.1063/1.5115814. [DOI] [Google Scholar]
  • 52.Wang J, Sciarrino F, Laing A, Thompson MG. Integrated photonic quantum technologies. Nat. Photonics. 2020;14(5):273–284. doi: 10.1038/s41566-019-0532-1. [DOI] [Google Scholar]
  • 53.Debnath S, Linke NM, Figgatt C, Landsman KA, Wright K, Monroe C. Demonstration of a small programmable quantum computer with atomic qubits. Nature. 2016;536(7614):63–66. doi: 10.1038/nature18648. [DOI] [PubMed] [Google Scholar]
  • 54.Barends R, Lamata L, Kelly J, García-Álvarez L, Fowler AG, Megrant A, Jeffrey E, White TC, Sank D, Mutus JY, Campbell B, Chen Y, Chen Z, Chiaro B, Dunsworth A, Hoi IC, Neill C, O’Malley PJJ, Quintana C, Roushan P, Vainsencher A, Wenner J, Solano E, Martinis JM. Digital quantum simulation of fermionic models with a superconducting circuit. Nat. Commun. 2015;6(1):7654. doi: 10.1038/ncomms8654. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 55.Abobeih MH, Wang Y, Randall J, Loenen SJH, Bradley CE, Markham M, Twitchen DJ, Terhal BM, Taminiau TH. Fault-tolerant operation of a logical qubit in a diamond quantum processor. Nature. 2022;606(7916):884–889. doi: 10.1038/s41586-022-04819-6. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 56.Bluvstein D, Levine H, Semeghini G, Wang TT, Ebadi S, Kalinowski M, Keesling A, Maskara N, Pichler H, Greiner M, Vuletić V, Lukin MD. A quantum processor based on coherent transport of entangled atom arrays. Nature. 2022;604(7906):451–456. doi: 10.1038/s41586-022-04592-6. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 57.Chen Z, Satzinger KJ, Atalaya J, Korotkov AN, Dunsworth A, Sank D, Quintana C, McEwen M, Barends R, Klimov PV, Hong S, Jones C, Petukhov A, Kafri D, Demura S, Burkett B, Gidney C, Fowler AG, Paler A, Putterman H, Aleiner I, Arute F, Arya K, Babbush R, Bardin JC, Bengtsson A, Bourassa A, Broughton M, Buckley BB, Buell DA, Bushnell N, Chiaro B, Collins R, Courtney W, Derk AR, Eppens D, Erickson C, Farhi E, Foxen B, Giustina M, Greene A, Gross JA, Harrigan MP, Harrington SD, Hilton J, Ho A, Huang T, Huggins WJ, Ioffe LB, Isakov SV, Jeffrey E, Jiang Z, Kechedzhi K, Kim S, Kitaev A, Kostritsa F, Landhuis D, Laptev P, Lucero E, Martin O, McClean JR, McCourt T, Mi X, Miao KC, Mohseni M, Montazeri S, Mruczkiewicz W, Mutus J, Naaman O, Neeley M, Neill C, Newman M, Niu MY, O’Brien TE, Opremcak A, Ostby E, Pató B, Redd N, Roushan P, Rubin NC, Shvarts V, Strain D, Szalay M, Trevithick MD, Villalonga B, White T, Yao ZJ, Yeh P, Yoo J, Zalcman A, Neven H, Boixo S, Smelyanskiy V, Chen Y, Megrant A, Kelly J. Google quantum AI, exponential suppression of bit or phase errors with cyclic error correction. Nature. 2021;595(7867):383–387. doi: 10.1038/s41586-021-03588-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 58.Krinner S, Lacroix N, Remm A, Di Paolo A, Genois E, Leroux C, Hellings C, Lazar S, Swiadek F, Herrmann J, Norris GJ, Andersen CK, Müller M, Blais A, Eichler C, Wallraff A. Realizing repeated quantum error correction in a distance-three surface code. Nature. 2022;605(7911):669–674. doi: 10.1038/s41586-022-04566-8. [DOI] [PubMed] [Google Scholar]
  • 59.Acharya R, Aleiner I, Allen R, Andersen TI, Ansmann M, Arute F, Arya K, Asfaw A, Atalaya J, Babbush R, Bacon D, Bardin JC, Basso J, Bengtsson A, Boixo S, Bortoli G, Bourassa A, Bovaird J, Brill L, Broughton M, Buckley BB, Buell DA, Burger T, Burkett B, Bushnell N, Chen Y, Chen Z, Chiaro B, Cogan J, Collins R, Conner P, Courtney W, Crook AL, Curtin B, Debroy DM, Del Toro Barba A, Demura S, Dunsworth A, Eppens D, Erickson C, Faoro L, Farhi E, Fatemi R, Flores Burgos L, Forati E, Fowler AG, Foxen B, Giang W, Gidney C, Gilboa D, Giustina M, Grajales Dau A, Gross JA, Habegger S, Hamilton MC, Harrigan MP, Harrington SD, Higgott O, Hilton J, Hoffmann M, Hong S, Huang T, Huff A, Huggins WJ, Ioffe LB, Isakov SV, Iveland J, Jeffrey E, Jiang Z, Jones C, Juhas P, Kafri D, Kechedzhi K, Kelly J, Khattar T, Khezri M, Kieferová M, Kim S, Kitaev A, Klimov PV, Klots AR, Korotkov AN, Kostritsa F, Kreikebaum JM, Landhuis D, Laptev P, Lau KM, Laws L, Lee J, Lee K, Lester BJ, Lill A, Liu W, Locharla A, Lucero E, Malone FD, Marshall J, Martin O, McClean JR, McCourt T, McEwen M, Megrant A, Meurer Costa B, Mi X, Miao KC, Mohseni M, Montazeri S, Morvan A, Mount E, Mruczkiewicz W, Naaman O, Neeley M, Neill C, Nersisyan A, Neven H, Newman M, Ng JH, Nguyen A, Nguyen M, Niu MY, O’Brien TE, Opremcak A, Platt J, Petukhov A, Potter R, Pryadko LP, Quintana C, Roushan P, Rubin NC, Saei N, Sank D, Sankaragomathi K, Satzinger KJ, Schurkus HF, Schuster C, Shearn MJ, Shorter A, Shvarts V, Skruzny J, Smelyanskiy V, Smith WC, Sterling G, Strain D, Szalay M, Torres A, Vidal G, Villalonga B, Vollgraff Heidweiller C, White T, Xing C, Yao ZJ, Yeh P, Yoo J, Young G, Zalcman A, Zhang Y, Zhu N. Suppressing quantum errors by scaling a surface code logical qubit. Nature. 2023;614(7949):676–681. doi: 10.1038/s41586-022-05434-1. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 60.Egan L, Debroy DM, Noel C, Risinger A, Zhu D, Biswas D, Newman M, Li M, Brown KR, Cetina M, Monroe C. Fault-tolerant control of an error-corrected qubit. Nature. 2021;598(7880):281–286. doi: 10.1038/s41586-021-03928-y. [DOI] [PubMed] [Google Scholar]
  • 61.Postler L, Heuben S, Pogorelov I, Rispler M, Feldker T, Meth M, Marciniak CD, Stricker R, Ringbauer M, Blatt R, Schindler P, Müller M, Monz T. Demonstration of fault-tolerant universal quantum gate operations. Nature. 2022;605(7911):675–680. doi: 10.1038/s41586-022-04721-1. [DOI] [PubMed] [Google Scholar]
  • 62.Bluvstein D, Evered SJ, Geim AA, Li SH, Zhou H, Manovitz T, Ebadi S, Cain M, Kalinowski M, Hangleiter D, Ataides JPB, Maskara N, Cong I, Gao X, Rodriguez PS, Karolyshyn T, Semeghini G, Gullans MJ, Greiner M, Vuletić V, Lukin MD. Logical quantum processor based on reconfigurable atom arrays. Nature. 2023 doi: 10.1038/s41586-023-06927-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 63.J. Sevilla, C. J. Riedel. Forecasting timelines of quantum computing. arXiv:2009.05045 (2020)
  • 64.Monroe C, Raussendorf R, Ruthven A, Brown KR, Maunz P, Duan LM, Kim J. Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects. Phys. Rev. A Atomic Mol. Opt. Phys. 2014;89(2):022317. doi: 10.1103/PHYSREVA.89.022317. [DOI] [Google Scholar]
  • 65.Campbell ET, Terhal BM, Vuillot C. Roads towards fault-tolerant universal quantum computation. Nature. 2017;549(7671):172–179. doi: 10.1038/nature23460. [DOI] [PubMed] [Google Scholar]
  • 66.Niu J, Zhang L, Liu Y, Qiu J, Huang W, Huang J, Jia H, Liu J, Tao Z, Wei W, Zhou Y, Zou W, Chen Y, Deng X, Deng X, Hu C, Hu L, Li J, Tan D, Xu Y, Yan F, Yan T, Liu S, Zhong Y, Cleland AN, Yu D. Low-loss interconnects for modular superconducting quantum processors. Nat. Electr. 2023;6(3):235–241. doi: 10.1038/s41928-023-00925-z. [DOI] [Google Scholar]
  • 67.Weinstein AJ, Reed MD, Jones AM, Andrews RW, Barnes D, Blumoff JZ, Euliss LE, Eng K, Fong BH, Ha SD, Hulbert DR, Jackson CA, Jura M, Keating TE, Kerckhoff J, Kiselev AA, Matten J, Sabbir G, Smith A, Wright J, Rakher MT, Ladd TD, Borselli MG. Universal logic with encoded spin qubits in silicon. Nature. 2023;615(7954):817–822. doi: 10.1038/s41586-023-05777-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 68.Ranjan P, Gaur S, Yadav H, Urgunde AB, Singh V, Patel A, Vishwakarma K, Kalirawana D, Gupta R, Kumar P. 2D materials: increscent quantum flatland with immense potential for applications. Nano Convergence. 2022;9:26. doi: 10.1186/S40580-022-00317-7. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 69.Hellenbrand M, MacManus-Driscoll J. Multi-level resistive switching in hafnium-oxide-based devices for neuromorphic computing. Nano Convergence. 2023;10:44. doi: 10.1186/S40580-023-00392-4. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 70.Choi S, Moon T, Wang G, Yang JJ. Filament-free memristors for computing. Nano Convergence. 2023;10:58. doi: 10.1186/S40580-023-00407-0. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 71.Grumbling E, Horowitz M, editors. Quantum Computing: Progress and Prospects. Washington, DC: The National Academies Press; 2019. [Google Scholar]
  • 72.Gyongyosi L, Imre S. A survey on quantum computing technology. Comput. Sci. Rev. 2019;31:51–71. doi: 10.1016/J.COSREV.2018.11.002. [DOI] [Google Scholar]
  • 73.Corcoles AD, Kandala A, Javadi-Abhari A, McClure DT, Cross AW, Temme K, Nation PD, Steffen M, Gambetta JM. Challenges and opportunities of near-term quantum computing systems. Proc. IEEE. 2020;108(8):1338–1352. doi: 10.1109/JPROC.2019.2954005. [DOI] [Google Scholar]
  • 74.de Leon NP, Itoh KM, Kim D, Mehta KK, Northup TE, Paik H, Palmer BS, Samarth N, Sangtawesin S, Steuerman DW. Materials challenges and opportunities for quantum computing hardware. Science. 2021 doi: 10.1126/SCIENCE.ABB2823. [DOI] [PubMed] [Google Scholar]
  • 75.Brown KR, Chiaverini J, Sage JM, Häffner H. Materials challenges for trapped-ion quantum computers. Nat. Rev. Mater. 2021;6(10):892–905. doi: 10.1038/s41578-021-00292-1. [DOI] [Google Scholar]
  • 76.Feynman R. The Feynman Lectures on Physics. 2. Addison-Wesley; 2005. [Google Scholar]
  • 77.Cohen-Tannoudji C, Diu B, Laloe F. Quantum Mechanics. Wiley; 1977. [Google Scholar]
  • 78.Griffiths DJ. Introduction to Quantum Mechanics. 3. Cambridge University Press; 2018. [Google Scholar]
  • 79.Deutsch DE. Quantum computational networks. Proc. R. Soc. Lond. A Math. Phys. Sci. 1989;425(1868):73–90. doi: 10.1098/rspa.1989.0099. [DOI] [Google Scholar]
  • 80.Lloyd S. Necessary and sufficient conditions for quantum computation. J. Mod. Opt. 1994;41(12):2503–2520. doi: 10.1080/09500349414552341. [DOI] [Google Scholar]
  • 81.Lloyd S. A potentially realizable quantum computer. Science. 1993;261(5128):1569–1571. doi: 10.1126/science.261.5128.1569. [DOI] [PubMed] [Google Scholar]
  • 82.DiVincenzo DP, Loss D. Quantum information is physical. Superlattices Microstruct. 1998;23(3):419–432. doi: 10.1006/spmi.1997.0520. [DOI] [Google Scholar]
  • 83.DiVincenzo DP. The physical implementation of quantum computation. Fortschritte der Physik. 2000;48(9–11):771–783. doi: 10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E. [DOI] [Google Scholar]
  • 84.Feynman RP. Simulating physics with computers. Int. J. Theor. Phys. 1982;21(6/7):467–488. doi: 10.1007/BF02650179. [DOI] [Google Scholar]
  • 85.Dykman MI, Platzman PM, Seddighrad P. Qubits with electrons on liquid helium. Phys. Rev. B. 2003;67(15):155402. doi: 10.1103/PhysRevB.67.155402. [DOI] [Google Scholar]
  • 86.Lyon SA. Spin-based quantum computing using electrons on liquid helium. Phys. Rev. A. 2006;74(5):052338. doi: 10.1103/PhysRevA.74.052338. [DOI] [Google Scholar]
  • 87.Matthiesen C, Yu Q, Guo J, Alonso AM, Häffner H. Trapping electrons in a room-temperature microwave paul trap. Phys. Rev. X. 2021;11(1):011019. doi: 10.1103/PhysRevX.11.011019. [DOI] [Google Scholar]
  • 88.Gershenfeld NA, Chuang IL. Bulk spin-resonance quantum computation. Science. 1997;275(5298):350–356. doi: 10.1126/science.275.5298.350. [DOI] [PubMed] [Google Scholar]
  • 89.McCallum JC, Johnson BC, Botzem T. Donor-based qubits for quantum computing in silicon. Appl. Phys. Rev. 2021;8(3):031314. doi: 10.1063/5.0060957. [DOI] [Google Scholar]
  • 90.Foot CJ. Atomic Physics. Oxford Master Series in Physics. Oxford: Oxford University Press; 2004. [Google Scholar]
  • 91.Pezzagna S, Meijer J. Quantum computer based on color centers in diamond. Appl. Phys. Rev. 2021;8(1):011308. doi: 10.1063/5.0007444. [DOI] [Google Scholar]
  • 92.Chen Z, Kelly J, Quintana C, Barends R, Campbell B, Chen Y, Chiaro B, Dunsworth A, Fowler A, Lucero E, Jeffrey E, Megrant A, Mutus J, Neeley M, Neill C, O’Malley P, Roushan P, Sank D, Vainsencher A, Wenner J, White T, Korotkov A, Martinis JM. Measuring and suppressing quantum state leakage in a superconducting qubit. Phys. Rev. Lett. 2016;116(2):020501. doi: 10.1103/PhysRevLett.116.020501. [DOI] [PubMed] [Google Scholar]
  • 93.Hayes D, Stack D, Bjork B, Potter A, Baldwin C, Stutz R. Eliminating leakage errors in hyperfine qubits. Phys. Rev. Lett. 2020;124(17):170501. doi: 10.1103/PhysRevLett.124.170501. [DOI] [PubMed] [Google Scholar]
  • 94.Crain S, Cahall C, Vrijsen G, Wollman EE, Shaw MD, Verma VB, Nam SW, Kim J. High-speed low-crosstalk detection of a 171Yb+ qubit using superconducting nanowire single photon detectors. Commun. Phys. 2019;2(1):1–6. doi: 10.1038/s42005-019-0195-8. [DOI] [Google Scholar]
  • 95.Wu Y, Kolkowitz S, Puri S, Thompson JD. Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays. Nat. Commun. 2022;13(1):4657. doi: 10.1038/s41467-022-32094-6. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 96.Kang M, Campbell WC, Brown KR. Quantum error correction with metastable states of trapped ions using erasure conversion. PRX Quantum. 2023;4(2):020358. doi: 10.1103/PRXQuantum.4.020358. [DOI] [Google Scholar]
  • 97.Ma S, Liu G, Peng P, Zhang B, Jandura S, Claes J, Burgers AP, Pupillo G, Puri S, Thompson JD. High-fidelity gates and mid-circuit erasure conversion in an atomic qubit. Nature. 2023;622(7982):279–284. doi: 10.1038/s41586-023-06438-1. [DOI] [PubMed] [Google Scholar]
  • 98.Scholl P, Shaw AL, Tsai RBS, Finkelstein R, Choi J, Endres M. Erasure conversion in a high-fidelity Rydberg quantum simulator. Nature. 2023;622(7982):273–278. doi: 10.1038/s41586-023-06516-4. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 99.W.C. Campbell, E.R. Hudson, Polyqubit quantum processing (2022). 10.48550/arXiv.2210.15484
  • 100.Allcock DTC, Campbell WC, Chiaverini J, Chuang IL, Hudson ER, Moore ID, Ransford A, Roman C, Sage JM, Wineland DJ. omg blueprint for trapped ion quantum computing with metastable states. Appl. Phys. Lett. 2021;119(21):214002. doi: 10.1063/5.0069544. [DOI] [Google Scholar]
  • 101.Low PJ, White BM, Cox AA, Day ML, Senko C. Practical trapped-ion protocols for universal qudit-based quantum computing. Phys. Rev. Res. 2020;2(3):033128. doi: 10.1103/PhysRevResearch.2.033128. [DOI] [Google Scholar]
  • 102.Chi Y, Huang J, Zhang Z, Mao J, Zhou Z, Chen X, Zhai C, Bao J, Dai T, Yuan H, Zhang M, Dai D, Tang B, Yang Y, Li Z, Ding Y, Oxenløwe LK, Thompson MG, O’Brien JL, Li Y, Gong Q, Wang J. A programmable qudit-based quantum processor. Nat. Commun. 2022;13(1):1166. doi: 10.1038/s41467-022-28767-x. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 103.Gottesman D, Kitaev A, Preskill J. Encoding a qubit in an oscillator. Phys. Rev. A. 2001;64(1):012310. doi: 10.1103/PhysRevA.64.012310. [DOI] [Google Scholar]
  • 104.Sivak VV, Eickbusch A, Royer B, Singh S, Tsioutsios I, Ganjam S, Miano A, Brock BL, Ding AZ, Frunzio L, Girvin SM, Schoelkopf RJ, Devoret MH. Real-time quantum error correction beyond break-even. Nature. 2023;616(7955):50–55. doi: 10.1038/s41586-023-05782-6. [DOI] [PubMed] [Google Scholar]
  • 105.Happer W. Optical Pumping. Rev. Mod. Phys. 1972;44(2):169–249. doi: 10.1103/RevModPhys.44.169. [DOI] [Google Scholar]
  • 106.Valenzuela SO, Oliver WD, Berns DM, Berggren KK, Levitov LS, Orlando TP. Microwave-induced cooling of a superconducting qubit. Science. 2006;314(5805):1589–1592. doi: 10.1126/science.1134008. [DOI] [PubMed] [Google Scholar]
  • 107.Ristè D, van Leeuwen JG, Ku HS, Lehnert KW, DiCarlo L. Initialization by measurement of a superconducting quantum bit circuit. Phys. Rev. Lett. 2012;109(5):050507. doi: 10.1103/PhysRevLett.109.050507. [DOI] [PubMed] [Google Scholar]
  • 108.Johnson JE, Macklin C, Slichter DH, Vijay R, Weingarten EB, Clarke J, Siddiqi I. Heralded state preparation in a superconducting qubit. Phys. Rev. Lett. 2012;109(5):050506. doi: 10.1103/PhysRevLett.109.050506. [DOI] [PubMed] [Google Scholar]
  • 109.Monroe C, Meekhof DM, King BE, Itano WM, Wineland DJ. Demonstration of a fundamental quantum logic gate. Phys. Rev. Lett. 1995;75(25):4714–4717. doi: 10.1103/PhysRevLett.75.4714. [DOI] [PubMed] [Google Scholar]
  • 110.Kis Z, Renzoni F. Qubit rotation by stimulated Raman adiabatic passage. Phys. Rev. A. 2002;65(3):032318. doi: 10.1103/PhysRevA.65.032318. [DOI] [Google Scholar]
  • 111.Vitanov NV, Rangelov AA, Shore BW, Bergmann K. Stimulated Raman adiabatic passage in physics, chemistry, and beyond. Rev. Mod. Phys. 2017;89(1):015006. doi: 10.1103/RevModPhys.89.015006. [DOI] [Google Scholar]
  • 112.Knill E, Laflamme R, Milburn GJ. A scheme for efficient quantum computation with linear optics. Nature. 2001;409(6816):46–52. doi: 10.1038/35051009. [DOI] [PubMed] [Google Scholar]
  • 113.Laird EA, Taylor JM, DiVincenzo DP, Marcus CM, Hanson MP, Gossard AC. Coherent spin manipulation in an exchange-only qubit. Phys. Rev. B. 2010;82(7):075403. doi: 10.1103/PhysRevB.82.075403. [DOI] [Google Scholar]
  • 114.Nielsen MA, Chuang IL. Quantum Computation and Quantum Information. 10. Cambridge: Cambridge University Press; 2000. [Google Scholar]
  • 115.Holland CM, Lu Y, Cheuk LW. On-demand entanglement of molecules in a reconfigurable optical tweezer array. Science. 2023;382(6675):1143–1147. doi: 10.1126/science.adf4272. [DOI] [PubMed] [Google Scholar]
  • 116.Bao Y, Yu SS, Anderegg L, Chae E, Ketterle W, Ni KK, Doyle JM. Dipolar spin-exchange and entanglement between molecules in an optical tweezer array. Science. 2023;382(6675):1138–1143. doi: 10.1126/science.adf8999. [DOI] [PubMed] [Google Scholar]
  • 117.Sørensen A, Mølmer K. Quantum Computation with Ions in Thermal Motion. Phys. Rev. Lett. 1999;82(9):1971–1974. doi: 10.1103/PhysRevLett.82.1971. [DOI] [Google Scholar]
  • 118.Cai Z, Luan CY, Ou L, Tu H, Yin Z, Zhang JN, Kim K. Entangling gates for trapped-ion quantum computation and quantum simulation. J. Korean Phys. Soc. 2023;82(9):882–900. doi: 10.1007/s40042-023-00772-3. [DOI] [Google Scholar]
  • 119.Bradley C, Randall J, Abobeih M, Berrevoets R, Degen M, Bakker M, Markham M, Twitchen D, Taminiau T. A ten-qubit solid-state spin register with quantum memory up to one minute. Phys. Rev. X. 2019;9(3):031045. doi: 10.1103/PhysRevX.9.031045. [DOI] [Google Scholar]
  • 120.Lloyd S. Almost any quantum logic gate is universal. Phys. Rev. Lett. 1995;75(2):346–349. doi: 10.1103/PhysRevLett.75.346. [DOI] [PubMed] [Google Scholar]
  • 121.Deutsch DE, Barenco A, Ekert A. Universality in quantum computation. Proc. R. Soc. Lond. Ser. A Math. Phys. Sci. 1997;449(193):669–677. doi: 10.1098/rspa.1995.0065. [DOI] [Google Scholar]
  • 122.Wu Y, Bao WS, Cao S, Chen F, Chen MC, Chen X, Chung TH, Deng H, Du Y, Fan D, et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett. 2021;127(18):180501. doi: 10.1103/PhysRevLett.127.180501. [DOI] [PubMed] [Google Scholar]
  • 123.Kim Y, Eddins A, Anand S, Wei KX, van den Berg E, Rosenblatt S, Nayfeh H, Wu Y, Zaletel M, Temme K, Kandala A. Evidence for the utility of quantum computing before fault tolerance. Nature. 2023;618(7965):500–505. doi: 10.1038/s41586-023-06096-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 124.Shor PW. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 1997;26(5):1484. doi: 10.1137/S0097539795293172. [DOI] [Google Scholar]
  • 125.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). 10.1145/237814.237866. https://dl.acm.org/doi/10.1145/237814.237866. arXiv:9605043 [quant-ph]
  • 126.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. 10.1109/ICAIC53980.2022.9896970
  • 127.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). 10.48550/arXiv.2304.05420 [DOI] [PMC free article] [PubMed]
  • 128.Pan F, Zhang P. Simulation of quantum circuits using the big-batch tensor network method. Phys. Rev. Lett. 2022;128(3):030501. doi: 10.1103/PhysRevLett.128.030501. [DOI] [PubMed] [Google Scholar]
  • 129.Kahanamoku-Meyer GD, Choi S, Vazirani UV, Yao NY. Classically verifiable quantum advantage from a computational bell test. Nat. Phys. 2022;18(8):918–924. doi: 10.1038/s41567-022-01643-7. [DOI] [Google Scholar]
  • 130.Daley AJ. Twenty-five years of analogue quantum simulation. Nat. Rev. Phys. 2023;5(12):702–703. doi: 10.1038/s42254-023-00666-0. [DOI] [Google Scholar]
  • 131.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)
  • 132.Georgescu I. The DiVincenzo criteria 20 years on. Nat. Rev. Phys. 2020;2(12):666–666. doi: 10.1038/s42254-020-00256-4. [DOI] [Google Scholar]
  • 133.Gill SS, Kumar A, Singh H, Singh M, Kaur K, Usman M, Buyya R. Quantum computing: a taxonomy, systematic review and future directions. Softw. Pract. Exp. 2022;52(1):66–114. doi: 10.1002/spe.3039. [DOI] [Google Scholar]
  • 134.Preskill J. Quantum computing in the NISQ era and beyond. Quantum. 2018;2:79. doi: 10.22331/q-2018-08-06-79. [DOI] [Google Scholar]
  • 135.Suzuki Y, Endo S, Fujii K, Tokunaga Y. Quantum error mitigation as a universal error reduction technique: applications from the NISQ to the fault-tolerant quantum computing eras. PRX Quantum. 2022;3(1):010345. doi: 10.1103/PRXQuantum.3.010345. [DOI] [Google Scholar]
  • 136.Georgescu I. 25 years of quantum error correction. Nat. Rev. Phys. 2020;2(10):519–519. doi: 10.1038/s42254-020-0244-y. [DOI] [Google Scholar]
  • 137.Roffe J. Quantum error correction: an introductory guide. Contemp. Phys. 2019;60(3):226–245. doi: 10.1080/00107514.2019.1667078. [DOI] [Google Scholar]
  • 138.Gottesman D. Stabilizer Codes and Quantum Error Correction. California Institute of Technology; 1997. [Google Scholar]
  • 139.Shor PW. Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A. 1995;52(4):R2493. doi: 10.1103/PhysRevA.52.R2493. [DOI] [PubMed] [Google Scholar]
  • 140.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)
  • 141.Ofek N, Petrenko A, Heeres R, Reinhold P, Leghtas Z, Vlastakis B, Liu Y, Frunzio L, Girvin S, Jiang L, et al. Extending the lifetime of a quantum bit with error correction in superconducting circuits. Nature. 2016;536(7617):441–445. doi: 10.1038/nature18949. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

Not applicable.


Articles from Nano Convergence are provided here courtesy of Springer

RESOURCES