We make a detailed analysis of error mechanisms, gate fidelity, and scalability of proposals for quantum computation with neutral atoms in addressable (large lattice constant) optical lattices. We have identified possible limits to the size of quantum computations, arising in 3D optical lattices from current limitations on the ability to perform single qubit gates in parallel and in 2D lattices from constraints on laser power. Our results suggest that 3D arrays as large as 100 x 100 x 100 sites (i.e., $\sim 10^6$ qubits) may be achievable, provided two-qubit gates can be performed with sufficiently high precision and degree of parallelizability. Parallelizability of long range interaction-based two-qubit gates is qualitatively compared to that of collisional gates. Different methods of performing single qubit gates are compared, and a lower bound of $1 \times 10^{-5}$ is determined on the error rate for the error mechanisms affecting $^{133}$Cs in a blue-detuned lattice with Raman transition-based single qubit gates, given reasonable limits on experimental parameters.
We experimentally demonstrate novel structures for the realisation of registers of atomic qubits: We trap neutral atoms in one and two-dimensional arrays of far-detuned dipole traps obtained by focusing a red-detuned laser beam with a microfabricated array of microlenses. We are able to selectively address individual trap sites due to their large lateral separation of 125 mu m. We initialize and read out different internal states for the individual sites. We also create two interleaved sets of trap arrays with adjustable separation, as required for many proposed implementations of quantum gate…
We present a scheme for correcting qubit loss error while quantum computing with neutral atoms in an addressable optical lattice. The qubit loss is first detected using a quantum non-demolition measurement and then transformed into a standard qubit error by inserting a new atom in the vacated lattice site. The logical qubit, encoded here into four physical qubits with the Grassl-Beth-Pellizzari code, is reconstructed via a sequence of one projective measurement, two single-qubit gates, and three controlled-NOT operations. No ancillary qubits are required. Both quantum non-demolition and projec…
Artificial magnetic molecules are suitable hosts to one or several spin qubits, which could then implement small-scale algorithms. In order to become of practical use, such molecular spin processors need to increase the dimension $d$ of the available computational space and fulfill the highly demanding conditions that warrant universal operations. Here, we design, synthesize and fully characterize dissymetric molecular dimers hosting either one or two Gd(III) ions. The strong sensitivity of Gd(III) magnetic anisotropy to the symmetry of its local coordination gives rise to different zero-field…
We show that several qubits can be integrated in a single magnetic ion, using its internal electronic spin states with energies tuned by a suitably chosen molecular environment. This approach is illustrated with a nearly-isotropic Gd(III) ion entrapped in a polyoxometalate molecule. Experiments with microwave technologies, either three dimensional cavities or quantum superconducting circuits, show that this magnetic molecule possesses the number of spin states and the set of coherently addressable transitions connecting these states that are needed to perform a universal three-qubit processor …
We describe a method to execute globally controlled quantum information processing which admits a fault tolerant quantum error correction scheme. Our scheme nominally uses three species of addressable two-level systems which are arranged in a one dimensional array in a specific periodic arrangement. We show that the scheme possesses a fault tolerant error threshold.
We experimentally demonstrate the coherent manipulation of atomic states in far-detuned dipole traps and registers of dipole traps based on two-dimensional arrays of microlenses. By applying Rabi, Ramsey, and spin-echo techniques, we systematically investigate the dephasing mechanisms and determine the coherence time. Simultaneous Ramsey measurements in up to 16 dipole traps are performed and proves the scalability of our approach. This represents an important step in the application of scalable registers of atomic qubits for quantum information processing. In addition, this system can serve a…
Optically connecting quantum bits can effectively reduce decoherence and facilitate long-distance communication. Optically addressable spin-bearing molecules have been demonstrated to have a good potential for quantum computing. In this report optically induced exchange interactions and spin dynamics, which are inherently important for spin-based quantum computing, have been calculated for a bi-radical - a potential quantum computing circuit unit. Consistent with the previous experimental observation of spin coherence induced by optical excitation, our work demonstrated an optically driven qua…
We review recent experimental progress towards quantum information processing and quantum simulation using neutral atoms in two-dimensional (2D) arrays of optical microtraps as 2D registers of qubits. We describe a scalable quantum information architecture based on micro-fabricated optical elements, simultaneously targeting the important issues of single-site addressability and scalability. This approach provides flexible and integrable configurations for quantum state storage, manipulation, and retrieval. We present recent experimental results on the initialization and coherent one-qubit rota…
We present a blueprint for building a fault-tolerant universal quantum computer with Rydberg atoms. Our scheme, which is based on the surface code, uses individually-addressable optically-trapped atoms as qubits and exploits electromagnetically induced transparency to perform the multi-qubit gates required for error correction and computation. We discuss the advantages and challenges of using Rydberg atoms to build such a quantum computer, and we perform error correction simulations to obtain an error threshold for our scheme. Our findings suggest that Rydberg atoms are a promising candidate f…
We consider two new quantum gate mechanisms based on nuclear spins in hyperpolarized solid $^{129}Xe$ and HCl mixtures and inorganic semiconductors. We propose two schemes for implementing a controlled NOT (CNOT) gate based on nuclear magnetic resonance (NMR) spectroscopy and magnetic resonance imaging (MRI) from hyperpolarized solid $^{129}Xe$ and HCl mixtures and optically pumped NMR in semiconductors. Such gates might be built up with particular spins addressable based on MRI techniques and optical pumping and optical detection techniques. The schemes could be useful for implementing actual…
Measurement-based quantum computation has revolutionized quantum information processing, and the physical systems with which it can be implemented. One simply needs the ability to prepare a particular state, known as the cluster state, and subsequently to perform single-qubit measurements on it. Nevertheless, a scalable implementation is yet to be realized. Here we propose a hybrid light-matter system comprised of coupled cavities interacting with two level systems. Utilising the stable, individually addressable, qubits resulting from the localised long-lived atom-photon excitations, we demons…
The quantum information science community has seen a surge in new algorithmic developments across scientific domains. These developments have demonstrated polynomial or better improvements in computational and space complexity, incentivizing further research in the field. However, despite recent progress, many works fail to provide quantitative estimates on algorithmic scalability or quantum resources required -- e.g., number of logical qubits, error thresholds, etc. -- to realize the highly sought "quantum advantage." In this paper, we discuss several quantum algorithms and motivate the impor…
A quantum computer that stores information on two-state systems called quantum bits or qubits must be able to address and manipulate individual qubits, to effect coherent interactions between pairs of qubits, and to read out the value of qubits.1,2 Current methods for addressing qubits are divided up into spatial methods, as when a laser beam is focused on an individual qubit3,4,5 or spectral methods, as when a nuclear spin in a molecule is addressed using NMR.6,7 The density of qubits addressable spatially is limited by the wavelength of light, and the number of qubits addressable spectrally …
Fast computational primitives for La-cross qLDPC codes
University of Strasbourg（斯特拉斯堡大学）；CNRS, CESQ and ISIS (UMR 7006)（法国国家科学研究中心，量子化学与光谱学与成像中心及信息科学研究所联合研究实验室）；aQCess（量子计算、通信与安全应用中心）；QPerfect SAS（QPerfect公司）；European Center for Quantum Sciences（欧洲量子科学中心）；Institut Universitaire de France (IUF)（法国高等研究院）
We study a linear array of coupled cavities interacting with two level systems and show how to construct individually addressable qubits in this system from the long-lived atom-photon excitations (polaritons) at each site. We derive the system dynamics and show that is described by an XY Hamiltonian. We proceed by showing how to implement non-local quantum gates and show that combined with the inherent ability for individual addressing, universal quantum computation is possible in this system. We finally discuss the prospects for experimental implementation using various technologies involving…
Quantum computers promise ultrafast performance of certain tasks. Experimentally appealing, measurement-based quantum computation (MBQC) requires an entangled resource called a cluster state, with long computations requiring large cluster states. Previously, the largest cluster state consisted of 8 photonic qubits or light modes, while the largest multipartite entangled state of any sort involved 14 trapped ions. These implementations involve quantum entities separated in space, and in general, each experimental apparatus is used only once. Here, we circumvent this inherent inefficiency by mul…
We explain how to combine holonomic quantum computation (HQC) with fault tolerant quantum error correction. This establishes the scalability of HQC, putting it on equal footing with other models of computation, while retaining the inherent robustness the method derives from its geometric nature.
Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and fault-tolerance. Universality is the ability to execute arbitrary multi-input quantum algorithms. Scalability means that computational resources such as logical qubits can be increased without requiring exponential increase in physical resources. Lastly, fault-tolerance is the ability to perform quantum algorithms in presence of imperfections and noise. A promising appro…
In this paper we investigate the linear and nonlinear models of optical quantum computation and discuss their scalability and efficiency. We show how there are significantly different scaling properties in single photon computation when weak cross-Kerr nonlinearities are allowed to supplement the usual linear optical set. In particular we show how quantum non-demolition measurements are an efficient resource for universal quantum computation.
The variational quantum Monte Carlo (VQMC) method received significant attention in the recent past because of its ability to overcome the curse of dimensionality inherent in many-body quantum systems. Close parallels exist between VQMC and the emerging hybrid quantum-classical computational paradigm of variational quantum algorithms. VQMC overcomes the curse of dimensionality by performing alternating steps of Monte Carlo sampling from a parametrized quantum state followed by gradient-based optimization. While VQMC has been applied to solve high-dimensional problems, it is known to be difficu…
