Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2207.08900 · New Journal of Physics

A quantum simulator based on locally controlled logical systems

Ferran Riera-Sàbat, Pavel Sekatski, Wolfgang Dür

Published Jan 24, 2023• 3 citations
arXivHTMLPDF

Abstract

Abstract In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where several physical qubits are used to represent a single logical two-level system to obtain enhanced and simple control over effective interactions between logical systems. Fixed, distance-dependent pairwise interactions between the physical qubits lead to effective interactions between the logical systems, which can be fully controlled solely by the choice of their internal state. This allows one to directly manipulate the topology and strength of effective interactions between logical systems. We show how to choose and generate the required states of logical systems for any desired interaction pattern and topology, how to perform arbitrary logical measurements, and how to obtain full control over single logical systems using only the intrinsic two-body interactions and control of individual physical qubits. This leads to a universal quantum simulator based on logical systems. We discuss the advantages of such a logical quantum simulator over standard ones, including the possibility to reach target topologies that are only accessible with large overheads otherwise. We provide several examples of how to obtain different target interaction patterns and topologies from initial long-ranged or short-ranged qubit-qubit interactions with a specific distance dependence.

DOI
10.1088/1367-2630/acb5ba

Related papers

Universality in quantum computation

Jennifer L. Dodd

A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.

•Jan 1, 2004•7 citations

Digital quantum simulators in a scalable architecture of hybrid spin-photon qubits

Alessandro Chiesa, Paolo Maria Santini, Dario Gerace +3 more

Resolving quantum many-body problems represents one of the greatest challenges in physics and physical chemistry, due to the prohibitively large computational resources that would be required by using classical computers. A solution has been foreseen by directly simulating the time evolution through sequences of quantum gates applied to arrays of qubits, i.e. by implementing a digital quantum simulator. Superconducting circuits and resonators are emerging as an extremely promising platform for quantum computation architectures, but a digital quantum simulator proposal that is straightforwardly scalable, universal, and realizable with state-of-the-art technology is presently lacking. Here we propose a viable scheme to implement a universal quantum simulator with hybrid spin-photon qubits in an array of superconducting resonators, which is intrinsically scalable and allows for local control. As representative examples we consider the transverse-field Ising model, a spin-1 Hamiltonian, and the two-dimensional Hubbard model and we numerically simulate the scheme by including the main sources of decoherence.

arXiv:1504.05667•Scientific Reports•Nov 13, 2015•34 citations

Quantum Computers as Universal Quantum Simulators: State‐of‐the‐Art and Perspectives

Francesco Tacchino, Alessandro Chiesa, Stefano Carretta +1 more

Abstract The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present Review aims at giving a comprehensive outlook on the state‐of‐the‐art capabilities offered from these near‐term noisy devices as universal quantum simulators, that is, programmable quantum computers potentially able to calculate the time evolution of many physical models. First, a pedagogic overview on the basic theoretical background pertaining digital quantum simulations is given, with a focus on hardware‐dependent mapping of spin‐type Hamiltonians into the corresponding quantum circuit as a key initial step toward simulating more complex models. Then, the main experimental achievements obtained in the last decade are reviewed, focusing on the digital quantum simulation of such spin models by employing two leading quantum architectures. Their performances are compared, and future challenges are outlined, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long‐sought quantum advantage for the simulation of complex many‐body models in the physical sciences.

arXiv:1907.03505•Advanced Quantum Technologies•Dec 19, 2019•172 citations

From the control of quantum systems to multiqubit logic

Ville Bergholm

Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.

•Dec 4, 2007•0 citations

Universal Digital Quantum Simulation with Trapped Ions

B. P. Lanyon, Cornelius Hempel, Daniel Nigg +11 more

A digital quantum simulator is an envisioned quantum device that can be programmed to efficiently simulate any other local system. We demonstrate and investigate the digital approach to quantum simulation in a system of trapped ions. With sequences of up to 100 gates and 6 qubits, the full time dynamics of a range of spin systems are digitally simulated. Interactions beyond those naturally present in our simulator are accurately reproduced, and quantitative bounds are provided for the overall simulation quality. Our results demonstrate the key principles of digital quantum simulation and provide evidence that the level of control required for a full-scale device is within reach.

arXiv:1109.1512•Science•Sep 2, 2011•613 citations

Quantum computing with neutral atoms

Mark E. Saffman

The power of quantum computation derives from algorithmic methods that exploit the availability of quantum superposition and entanglement to perform computations that are intractable with classical devices. The race is on to develop hardware that will unleash the promise of quantum algorithms. A handful of different types of hardware are currently being developed with the greatest efforts directed at superconducting, quantum-dot, trapped-ion, photonic, and neutral-atom approaches [1]. While all approaches have strengths and weaknesses, and are at different stages of development, the challenge of creating a practical design that can be scaled to a million or more qubits has not yet been met with any of the existing platforms. One may wonder if we really need a million qubits for a useful quantum computer. The answer depends on our ambition level. On the one hand it is widely believed that a quantum computer with less than 100 reliable qubits will be able to demonstrate a quantum advantage for a well defined computational problem [2]. Demonstration of a quantum computational advantage will generate great excitement in the halls of academia, but will have little broader import. A problem of great practical interest such as ab initio design of chemicals for increasing the yield of fertilizers for crop production, to name but one example, may also require just a few hundred qubits, provided computational sequences with circuit depth of 1010 or more operations can be reliably performed [3]. However, given the current performance of qubit hardware, which has demonstrated error rates not less than ∼10−3, computations with depth 1010 will only produce random outcomes of negligible value. The solution lies in the construction of error-correction circuitry operating on logical qubits, each composed of many physical qubits, which will enable logical error rates many orders of magnitude smaller than physical error rates. Although error correction is remarkably efficient for classical computing devices—Hamming codes detect and correct errors while only requiring roughly 10% overhead in the number of physical bits—quantum error correction is notoriously expensive. New approaches to error correction are the subject of intensive research with one promising direction being the development of codes that are optimized to suppress the dominant error mechanism in a particular physical platform [4,5]. Nevertheless, with physical error rates of 10−4, a plausible target for current qubit systems, the overhead required to reach logical error rates of 10−10 may be measured in thousands of physical qubits for each logical qubit. Thus a quantum computer able to perform deep calculations on a few hundred logical qubits could require a million physical qubits. A consequence of the cost of quantum error correction is that any viable approach to large-scale quantum computing needs to combine high-fidelity quantum logic operations with a capability for integrating large numbers of physical qubits. From this perspective neutral-atom qubits appear particularly promising [6] as they have already demonstrated control of more qubits than any other platform with recent experiments in 1D [7], 2D [8,9], and 3D [10] geometries showing control of up to 50 atomic qubits. Large qubit arrays can potentially be prepared in 1D, 2D, or 3D geometries. The number of proximal qubits increases with the dimensionality, which is advantageous for implementation of error correction code words, and points towards a preference for 2D or 3D arrays. On the other hand, the added overhead of compensating crosstalk incurred when targeting atoms inside a 3D volume makes parallel operations on multiple qubits challenging. A 2D geometry, as shown schematically in Fig. 1, may be an optimal choice since qubit control and measurement can be performed with lasers propagating normal to the plane of the array so that individual qubit sites can be addressed independently. With demonstrated array periods of a few micrometers we require a footprint of less than 1 mm2 for 104 qubits. Conceptual picture of a 2D neutral-atom qubit array. a) High-numerical-aperture lenses project several different wavelengths of light for control and measurement of the qubits. Specific choices of optical wavelengths depend on the atomic species. Not shown are optics for initial laser cooling, transport to the array, beam scanning, and imaging for qubit measurement. b) Averaged fluorescence image of 49 atomic qubits on a 2D grid with |$3.8 \, {\mu} \rm {m}$| spacing [8]. From a fundamental perspective the prospects for scaling neutral-atom systems are particularly promising due to the exceptionally large ratio between coherent and incoherent coupling rates. Neutral-atom qubits are encoded in hyperfine ground states for which coherence times of the order of 10 s have been demonstrated [10]. This implies a dephasing rate |$\gamma \sim 0.1 \, \rm s^{-1}$|⁠. The coherent coupling that enables quantum logic operations is switched on by exciting atoms to high-lying Rydberg states with principal quantum number close to 100 [11,12]. Rydberg excited atoms at spacings of a few micrometers in an optical lattice interact coherently with rates |$g > 10^9\, \rm s^{-1}$|⁠. The ratio between desired coherent coupling and residual incoherent dephasing of g/γ ∼ 1010 establishes a figure of merit that is enabling for scalability. To our knowledge only trapped ions can claim a similar g/γ ratio [13], but without a correspondingly direct path towards controlling thousands of qubits in a single processing unit. Although the g/γ ratio is exceptionally favorable for neutral-atom qubits a complete set of universal gate operations has not yet been demonstrated with high fidelity. Single-qubit gates in large 2D and 3D arrays have reached fidelity |${\mathcal {F}}\sim 0.999$| [8,10]. However, the highest demonstrated fidelity for two-qubit entanglement mediated by Rydberg-state interactions is |${\mathcal {F}}< 0.8$| [6,14,15], a value that is well short of the theoretical limit of |${\mathcal {F}}> 0.9999$| [16,17]. There is healthy optimism within the research community working with neutral-atom qubits that combining improved laser sources with reduced noise, better cooling to reduce motional dephasing, and control of stray electric fields that perturb Rydberg atoms will lead to substantially improved gate fidelity in the near future. Recent results with better filtering of laser phase noise have already demonstrated remarkable improvement in ground–Rydberg entanglement [18]. The outlook for the next few years appears very promising. We anticipate that with advances in lasers, optical lattices for atom trapping, deterministic rearrangement and loading of atoms in multi-dimensional arrays [19,20], and optics for fast beam scanning it will be possible to increase the number of physical qubits in a single neutral-atom module to at least 104. A challenging yet plausible path to a million-qubit processor can then be contemplated by connecting 100 such modules with atom–photon entanglement channels [21]. Beyond the potential for advancing the state of the art in computation, development of techniques for single-atom control inside large multi-atom arrays will enable other applications of quantum science including metrology and time-keeping. Rydberg interactions that are at the heart of a neutral-atom quantum computer may lead to multi-atom entanglement and Heisenberg scaling of atomic-clock precision [22]. This work was supported by the NSF and ARL CDQI.

National Science Review•Sep 9, 2018•79 citations
Abstract In a digital quantum simulator, basic two-qubit interactions are manipulated by means of fast local control operations to establish a desired target Hamiltonian. Here we consider a quantum simulator based on logical systems, i.e. where several physical qubits are used to represent a single logical two-level system to obtain enhanced and simple control over effective interactions between logical systems. Fixed, distance-dependent pairwise interactions between the physical qubits lead to effective interactions between the logical systems, which can be fully controlled solely by the choice of their internal state. This allows one to directly manipulate the topology and strength of effective interactions between logical systems. We show how to choose and generate the required states of logical systems for any desired interaction pattern and topology, how to perform arbitrary logical measurements, and how to obtain full control over single logical systems using only the intrinsic two-body interactions and control of individual physical qubits. This leads to a universal quantum simulator based on logical systems. We discuss the advantages of such a logical quantum simulator over standard ones, including the possibility to reach target topologies that are only accessible with large overheads otherwise. We provide several examples of how to obtain different target interaction patterns and topologies from initial long-ranged or short-ranged qubit-qubit interactions with a specific distance dependence.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers.        The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected.       This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate.       Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.
Resolving quantum many-body problems represents one of the greatest challenges in physics and physical chemistry, due to the prohibitively large computational resources that would be required by using classical computers. A solution has been foreseen by directly simulating the time evolution through sequences of quantum gates applied to arrays of qubits, i.e. by implementing a digital quantum simulator. Superconducting circuits and resonators are emerging as an extremely promising platform for quantum computation architectures, but a digital quantum simulator proposal that is straightforwardly scalable, universal, and realizable with state-of-the-art technology is presently lacking. Here we propose a viable scheme to implement a universal quantum simulator with hybrid spin-photon qubits in an array of superconducting resonators, which is intrinsically scalable and allows for local control. As representative examples we consider the transverse-field Ising model, a spin-1 Hamiltonian, and the two-dimensional Hubbard model and we numerically simulate the scheme by including the main sources of decoherence.
Abstract The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have become available for simulations and benchmarking, with up to few tens of qubits that can be reliably initialized, controlled, and measured. The present Review aims at giving a comprehensive outlook on the state‐of‐the‐art capabilities offered from these near‐term noisy devices as universal quantum simulators, that is, programmable quantum computers potentially able to calculate the time evolution of many physical models. First, a pedagogic overview on the basic theoretical background pertaining digital quantum simulations is given, with a focus on hardware‐dependent mapping of spin‐type Hamiltonians into the corresponding quantum circuit as a key initial step toward simulating more complex models. Then, the main experimental achievements obtained in the last decade are reviewed, focusing on the digital quantum simulation of such spin models by employing two leading quantum architectures. Their performances are compared, and future challenges are outlined, also in view of prospective hybrid technologies, towards the ultimate goal of reaching the long‐sought quantum advantage for the simulation of complex many‐body models in the physical sciences.
Quantum computing and quantum information science are two recently discovered and rapidly growing fields of physics that show substantial promise in providing new and valuable technologies in the foreseeable future. Large-scale quantum computers, if ever realized experimentally, are likely to outperform their classical counterparts in a number of important computational tasks, the most important of which may be the accurate simulation of many-body quantum systems such as the ones encountered in physics, chemistry and life sciences. This thesis investigates the problem of controlling quantum systems for the purpose of performing quantum information processing tasks. The problem is approached from a theoretical and simulational viewpoint. The work contained here encompasses a range of levels of abstraction. Firstly, we discuss the decomposition of abstract multiqubit logic gates into sequences of simple elementary gates. Secondly, we study the local commutational properties of two-qubit gates using local gate invariants. Thirdly, we develop methods for the physical implementation of the elementary gates through the control of specific quantum systems, possibly in the presence of noise and decoherence. We present a new, almost optimal n-qubit gate decomposition based on the cosine-sine decomposition, which utilizes a likewise new intermediate quantum circuit structure we call a uniformly controlled gate. We then show how they can be used in constructing a general state transformation circuit. Both of the resulting circuits can be efficiently implemented using nearest-neighbor gates which makes their physical realization simpler. A local gate invariant is introduced which can be used to assess the suitability of two-qubit gates for serving as the entangling gate in elementary gate libraries. Finally, we develop numerical optimization methods for finding near-optimal control sequences for generating oneand two-qubit gates, both in closed quantum systems and in the presence of Markovian noise.
A digital quantum simulator is an envisioned quantum device that can be programmed to efficiently simulate any other local system. We demonstrate and investigate the digital approach to quantum simulation in a system of trapped ions. With sequences of up to 100 gates and 6 qubits, the full time dynamics of a range of spin systems are digitally simulated. Interactions beyond those naturally present in our simulator are accurately reproduced, and quantitative bounds are provided for the overall simulation quality. Our results demonstrate the key principles of digital quantum simulation and provide evidence that the level of control required for a full-scale device is within reach.
The power of quantum computation derives from algorithmic methods that exploit the availability of quantum superposition and entanglement to perform computations that are intractable with classical devices. The race is on to develop hardware that will unleash the promise of quantum algorithms. A handful of different types of hardware are currently being developed with the greatest efforts directed at superconducting, quantum-dot, trapped-ion, photonic, and neutral-atom approaches [1]. While all approaches have strengths and weaknesses, and are at different stages of development, the challenge of creating a practical design that can be scaled to a million or more qubits has not yet been met with any of the existing platforms. One may wonder if we really need a million qubits for a useful quantum computer. The answer depends on our ambition level. On the one hand it is widely believed that a quantum computer with less than 100 reliable qubits will be able to demonstrate a quantum advantage for a well defined computational problem [2]. Demonstration of a quantum computational advantage will generate great excitement in the halls of academia, but will have little broader import. A problem of great practical interest such as ab initio design of chemicals for increasing the yield of fertilizers for crop production, to name but one example, may also require just a few hundred qubits, provided computational sequences with circuit depth of 1010 or more operations can be reliably performed [3]. However, given the current performance of qubit hardware, which has demonstrated error rates not less than ∼10−3, computations with depth 1010 will only produce random outcomes of negligible value. The solution lies in the construction of error-correction circuitry operating on logical qubits, each composed of many physical qubits, which will enable logical error rates many orders of magnitude smaller than physical error rates. Although error correction is remarkably efficient for classical computing devices—Hamming codes detect and correct errors while only requiring roughly 10% overhead in the number of physical bits—quantum error correction is notoriously expensive. New approaches to error correction are the subject of intensive research with one promising direction being the development of codes that are optimized to suppress the dominant error mechanism in a particular physical platform [4,5]. Nevertheless, with physical error rates of 10−4, a plausible target for current qubit systems, the overhead required to reach logical error rates of 10−10 may be measured in thousands of physical qubits for each logical qubit. Thus a quantum computer able to perform deep calculations on a few hundred logical qubits could require a million physical qubits. A consequence of the cost of quantum error correction is that any viable approach to large-scale quantum computing needs to combine high-fidelity quantum logic operations with a capability for integrating large numbers of physical qubits. From this perspective neutral-atom qubits appear particularly promising [6] as they have already demonstrated control of more qubits than any other platform with recent experiments in 1D [7], 2D [8,9], and 3D [10] geometries showing control of up to 50 atomic qubits. Large qubit arrays can potentially be prepared in 1D, 2D, or 3D geometries. The number of proximal qubits increases with the dimensionality, which is advantageous for implementation of error correction code words, and points towards a preference for 2D or 3D arrays. On the other hand, the added overhead of compensating crosstalk incurred when targeting atoms inside a 3D volume makes parallel operations on multiple qubits challenging. A 2D geometry, as shown schematically in Fig. 1, may be an optimal choice since qubit control and measurement can be performed with lasers propagating normal to the plane of the array so that individual qubit sites can be addressed independently. With demonstrated array periods of a few micrometers we require a footprint of less than 1 mm2 for 104 qubits. Conceptual picture of a 2D neutral-atom qubit array. a) High-numerical-aperture lenses project several different wavelengths of light for control and measurement of the qubits. Specific choices of optical wavelengths depend on the atomic species. Not shown are optics for initial laser cooling, transport to the array, beam scanning, and imaging for qubit measurement. b) Averaged fluorescence image of 49 atomic qubits on a 2D grid with |3.8 μm3.8 \, {\mu} \rm {m}3.8μm| spacing [8]. From a fundamental perspective the prospects for scaling neutral-atom systems are particularly promising due to the exceptionally large ratio between coherent and incoherent coupling rates. Neutral-atom qubits are encoded in hyperfine ground states for which coherence times of the order of 10 s have been demonstrated [10]. This implies a dephasing rate |γ∼0.1 s−1\gamma \sim 0.1 \, \rm s^{-1}γ∼0.1s−1|⁠. The coherent coupling that enables quantum logic operations is switched on by exciting atoms to high-lying Rydberg states with principal quantum number close to 100 [11,12]. Rydberg excited atoms at spacings of a few micrometers in an optical lattice interact coherently with rates |g>109 s−1g > 10^9\, \rm s^{-1}g>109s−1|⁠. The ratio between desired coherent coupling and residual incoherent dephasing of g/γ ∼ 1010 establishes a figure of merit that is enabling for scalability. To our knowledge only trapped ions can claim a similar g/γ ratio [13], but without a correspondingly direct path towards controlling thousands of qubits in a single processing unit. Although the g/γ ratio is exceptionally favorable for neutral-atom qubits a complete set of universal gate operations has not yet been demonstrated with high fidelity. Single-qubit gates in large 2D and 3D arrays have reached fidelity |F∼0.999{\mathcal {F}}\sim 0.999F∼0.999| [8,10]. However, the highest demonstrated fidelity for two-qubit entanglement mediated by Rydberg-state interactions is |F<0.8{\mathcal {F}}< 0.8F<0.8| [6,14,15], a value that is well short of the theoretical limit of |F>0.9999{\mathcal {F}}> 0.9999F>0.9999| [16,17]. There is healthy optimism within the research community working with neutral-atom qubits that combining improved laser sources with reduced noise, better cooling to reduce motional dephasing, and control of stray electric fields that perturb Rydberg atoms will lead to substantially improved gate fidelity in the near future. Recent results with better filtering of laser phase noise have already demonstrated remarkable improvement in ground–Rydberg entanglement [18]. The outlook for the next few years appears very promising. We anticipate that with advances in lasers, optical lattices for atom trapping, deterministic rearrangement and loading of atoms in multi-dimensional arrays [19,20], and optics for fast beam scanning it will be possible to increase the number of physical qubits in a single neutral-atom module to at least 104. A challenging yet plausible path to a million-qubit processor can then be contemplated by connecting 100 such modules with atom–photon entanglement channels [21]. Beyond the potential for advancing the state of the art in computation, development of techniques for single-atom control inside large multi-atom arrays will enable other applications of quantum science including metrology and time-keeping. Rydberg interactions that are at the heart of a neutral-atom quantum computer may lead to multi-atom entanglement and Heisenberg scaling of atomic-clock precision [22]. This work was supported by the NSF and ARL CDQI.