Search

Throughout its history, the theory of quantum error correction has heavily benefited from translating classical concepts into the quantum setting. In particular, classical notions of weight enumerators, which relate to the performance of an error-correcting code, and MacWilliams' identity, which helps to compute enumerators, have been generalized to the quantum case. In this work, we establish a distinct relationship between the theoretical machinery of quantum weight enumerators and a seemingly unrelated physics experiment: we prove that Rains' quantum shadow enumerators - a powerful mathematical tool - arise as probabilities of observing fixed numbers of triplets in a Bell sampling experiment. This insight allows us to develop here a rigorous framework for the direct measurement of quantum weight enumerators, thus enabling experimental and theoretical studies of the entanglement structure of any quantum error-correcting code or state under investigation. On top of that, we derive concrete sample complexity bounds and physically-motivated robustness guarantees against unavoidable experimental imperfections. Finally, we experimentally demonstrate the possibility of directly measuring weight enumerators on a trapped-ion quantum computer. Our experimental findings are in good agreement with theoretical predictions and illuminate how entanglement theory and quantum error correction can cross-fertilize each other once Bell sampling experiments are combined with the theoretical machinery of quantum weight enumerators., Comment: 21+12 pages, 6+7 figures

A major hurdle for building a large-scale quantum computer is to scale up the number of qubits while maintaining connectivity between them. In trapped-ion devices, this connectivity can be provided by physically moving subregisters consisting of a few ions across the processor. The topology of the connectivity is given by the layout of the ion trap where one-dimensional and two-dimensional arrangements are possible. Here, we focus on an architecture based on a rectangular two-dimensional lattice, where each lattice site contains a subregister with a linear string of ions. We refer to this architecture as the Quantum Spring Array (QSA). Subregisters placed in neighboring lattice sites can be coupled by bringing the respective ion strings close to each other while avoiding merging them into a single trapping potential. Control of the separation of subregisters along one axis of the lattice, known as the axial direction, uses quasi-static voltages, while the second axis, the radial, requires control of radio frequency signals. In this work, we investigate key elements of the 2D lattice quantum computation architecture along both axes: We show that the coupling rate between neighboring lattice sites increases with the number of ions per site and the motion of the coupled system can be resilient to noise. The coherence of the coupling is assessed, and an entangled state of qubits in separate trapping regions along the radial axis is demonstrated. Moreover, we demonstrate control over radio frequency signals to adjust radial separation between strings, and thus tune their coupling rate. We further map the 2D lattice architecture to code primitives for fault-tolerant quantum error correction, providing a step towards a quantum processor architecture that is optimized for large-scale fault-tolerant operation., Comment: 23 pages, 19 figures (15 in main text, 4 in appendices)

The rotation of trapped molecules offers a promising platform for quantum technologies and quantum information processing. In parallel, quantum error correction codes that can protect quantum information encoded in rotational states of a single molecule have been developed. These codes are currently an abstract concept, as no implementation strategy is yet known. Here, we present a step towards experimental implementation of these codes by introducing architecture-agnostic check and correction operators. These operators can be decomposed into elements of the quantum logic spectroscopy toolbox that is available for molecular ions. We then describe and analyze a measurement-based sequential as well as an autonomous implementation strategy in the presence of thermal background radiation, a major noise source for rotation in polar molecules. The presented strategies and methods might enable robust sensing or even fault-tolerant quantum computing using the rotation of individual molecules.

Quantum error correction is a crucial tool for mitigating hardware errors in quantum computers by encoding logical information into multiple physical qubits. However, no single error-correcting code allows for an intrinsically fault-tolerant implementation of all the gates needed for universal quantum computing [1-3]. One way to tackle this problem is to switch between two suitable error-correcting codes, while preserving the encoded logical information, which in combination give access to a fault-tolerant universal gate set [4-6]. In this work, we present the first experimental implementation of fault-tolerant code switching between two codes. One is the seven-qubit color code [7], which features fault-tolerant CNOT and $H$ quantum gates, while the other one, the 10-qubit code [8], allows for a fault-tolerant $T$-gate implementation. Together they form a complementary universal gate set. Building on essential code switching building blocks, we construct logical circuits and prepare 12 different logical states which are not accessible natively in a fault-tolerant way within a single code. Finally, we use code switching to entangle two logical qubits employing the full universal gate set in a single logical quantum circuit. Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead, not relying on the probabilistic preparation of resource states.

Molecular ions that are generated by chemical reactions with trapped atomic ions can serve as an accessible testbed for developing molecular quantum technologies. On the other hand, they are also a hindrance to scaling up quantum computers based on atomic ions as unavoidable reactions with background gas destroy the information carriers. Here, we investigate the single- and two-photon dissociation processes of single $\text{CaOH}^+$ molecular ions co-trapped in $\text{Ca}^+$ ion crystals using a femtosecond laser system. We report the photodissociation cross section spectra of $\text{CaOH}^+$ for single-photon processes at $\lambda=$245 - 275$\,$nm and for two-photon processes at $\lambda=$500 - 540$\,$nm. Measurements are interpreted with quantum-chemical calculations, which predict the photodissociation threshold for $\text{CaOH}^+\to \text{Ca}^++\text{OH}$ at 265$\,$nm. This result can serve as a basis for dissociation-based spectroscopy for studying the internal structure of $\text{CaOH}^+$. The result also gives a prescription for recycling $\text{Ca}^+$ ions in large-scale trapped $\text{Ca}^+$ quantum experiments from undesired $\text{CaOH}^+$ ions formed in the presence of background water vapor., Comment: 13 pages, 18 figures

Encoding information redundantly using quantum error-correcting (QEC) codes allows one to overcome the inherent sensitivity to noise in quantum computers to ultimately achieve large-scale quantum computation. The Steane QEC method involves preparing an auxiliary logical qubit of the same QEC code used for the data register. The data and auxiliary registers are then coupled with a logical CNOT gate, enabling a measurement of the auxiliary register to reveal the error syndrome. This study presents the implementation of multiple rounds of fault-tolerant Steane QEC on a trapped-ion quantum computer. Various QEC codes are employed, and the results are compared to a previous experimental approach utilizing flag qubits. Our experimental findings show improved logical fidelities for Steane QEC. This establishes experimental Steane QEC as a competitive paradigm for fault-tolerant quantum computing., Comment: 16 pages, 13 figures

Particle physics underpins our understanding of the world at a fundamental level by describing the interplay of matter and forces through gauge theories. Yet, despite their unmatched success, the intrinsic quantum mechanical nature of gauge theories makes important problem classes notoriously difficult to address with classical computational techniques. A promising way to overcome these roadblocks is offered by quantum computers, which are based on the same laws that make the classical computations so difficult. Here, we present a quantum computation of the properties of the basic building block of two-dimensional lattice quantum electrodynamics, involving both gauge fields and matter. This computation is made possible by the use of a trapped-ion qudit quantum processor, where quantum information is encoded in $d$ different states per ion, rather than in two states as in qubits. Qudits are ideally suited for describing gauge fields, which are naturally high-dimensional, leading to a dramatic reduction in the quantum register size and circuit complexity. Using a variational quantum eigensolver, we find the ground state of the model and observe the interplay between virtual pair creation and quantized magnetic field effects. The qudit approach further allows us to seamlessly observe the effect of different gauge field truncations by controlling the qudit dimension. Our results open the door for hardware-efficient quantum simulations with qudits in near-term quantum devices.

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing tools for verifying that a quantum device indeed performed the classically intractable sampling task are either impractical or not scalable to the quantum advantage regime. The verification problem thus remains an outstanding challenge. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation on a trapped-ion quantum processor. We create and sample from random cluster states, which are at the heart of measurement-based computing, up to a size of 4 x 4 qubits. By exploiting the structure of these states, we are able to recycle qubits during the computation to sample from entangled cluster states that are larger than the qubit register. We then efficiently estimate the fidelity to verify the prepared states -- in single instances and on average -- and compare our results to cross-entropy benchmarking. Finally, we study the effect of experimental noise on the certificates. Our results and techniques provide a feasible path toward a verified demonstration of a quantum advantage., Comment: 11+16 pages. Comments welcome. v2: improved presentation

We demonstrate a novel experimental toolset that enables irreversible multi-qubit operations on a quantum platform. To exemplify our approach, we realize two elementary nonunitary operations: the OR and NOR gates. The electronic states of two trapped $^{40}$Ca$^{+}$ ions encode the logical information, and a co-trapped $^{88}$Sr$^{+}$ ion provides the irreversibility of the gate by a dissipation channel through sideband cooling. We measure $87\%$ and $81\%$ success rates for the OR and NOR gates, respectively. The presented methods are a stepping stone towards other nonunitary operations such as in quantum error correction and quantum machine learning., Comment: 5 main text pages, 2 supplemental material pages, 4 main text figures, 1 supplemental material figure, 1 supplemental material table

Fault-tolerant quantum error correction provides a strategy to protect information processed by a quantum computer against noise which would otherwise corrupt the data. A fault-tolerant universal quantum computer must implement a universal gate set on the logical level in order to perform arbitrary calculations to in principle unlimited precision. We characterize the recent demonstration of a fault-tolerant universal gate set in a trapped-ion quantum computer [Postler et al. Nature 605.7911 (2022)] and identify aspects to improve the design of experimental setups to reach an advantage of logical over physical qubit operation. We show that various criteria to assess the break-even point for fault-tolerant quantum operations are within reach for the ion trap quantum computing architecture under consideration. We analyze the influence of crosstalk in entangling gates for logical state preparation circuits. These circuits can be designed to respect fault tolerance for specific microscopic noise models. We find that an experimentally-informed depolarizing noise model captures the essential noise dynamics of the fault-tolerant experiment, and crosstalk is negligible in the currently accessible regime of physical error rates. For deterministic Pauli state preparation, we provide a fault-tolerant unitary logical qubit initialization circuit, which can be realized without in-sequence measurement and feed-forward of classical information. We show that non-deterministic state preparation schemes for logical Pauli and magic states perform with higher logical fidelity over their deterministic counterparts for the current and anticipated future regime of physical error rates. Our results offer guidance on improvements of physical qubit operations and validate the experimentally-informed noise model as a tool to predict logical failure rates in quantum computing architectures based on trapped ions., Comment: 36 pages, 26 figures

Quantum information carriers, just like most physical systems, naturally occupy high-dimensional Hilbert spaces. Instead of restricting them to a two-level subspace, these high-dimensional (qudit) quantum systems are emerging as a powerful resource for the next generation of quantum processors. Yet harnessing the potential of these systems requires efficient ways of generating the desired interaction between them. Here, we experimentally demonstrate an implementation of a native two-qudit entangling gate in a trapped-ion qudit system up to dimension $5$. This is achieved by generalizing a recently proposed light-shift gate mechanism to generate genuine qudit entanglement in a single application of the gate. The gate seamlessly adapts to the local dimension of the system with a calibration overhead that is independent of the dimension., Comment: 9 pages, 5 figures

Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing these quantum systems is vital, yet becoming increasingly challenging. The gold-standard is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge. Measurement and classical computing costs, however, increase exponentially in the system size - a bottleneck given the scale of existing and near-term quantum devices. Here, we demonstrate a scalable and practical QST approach that uses a single measurement setting, namely symmetric informationally complete (SIC) positive operator-valued measures (POVM). We implement these nonorthogonal measurements on an ion trap device by utilizing more energy levels in each ion - without ancilla qubits. More precisely, we locally map the SIC POVM to orthogonal states embedded in a higher-dimensional system, which we read out using repeated in-sequence detections, providing full tomographic information in every shot. Combining this SIC tomography with the recently developed randomized measurement toolbox ("classical shadows") proves to be a powerful combination. SIC tomography alleviates the need for choosing measurement settings at random ("derandomization"), while classical shadows enable the estimation of arbitrary polynomial functions of the density matrix orders of magnitudes faster than standard methods. The latter enables in-depth entanglement studies, which we experimentally showcase on a 5-qubit absolutely maximally entangled (AME) state. Moreover, the fact that the full tomography information is available in every shot enables online QST in real time. We demonstrate this on an 8-qubit entangled state, as well as for fast state identification. All in all, these features single out SIC-based classical shadow estimation as a highly scalable and convenient tool for quantum state characterization., Comment: 34 pages, 15 figures

Tensor-Network (TN) states are efficient parametric representations of ground states of local quantum Hamiltonians extensively used in numerical simulations. Here we encode a TN ansatz state directly into a quantum simulator, which can potentially offer an exponential advantage over purely numerical simulation. In particular, we demonstrate the optimization of a quantum-encoded TN ansatz state using a variational quantum eigensolver on an ion-trap quantum computer by preparing the ground states of the extended Su-Schrieffer-Heeger model. The generated states are characterized by estimating the topological invariants, verifying their topological order. Our TN encoding as a trapped ion circuit employs only single-site addressing optical pulses - the native operations naturally available on the platform. We reduce nearest-neighbor crosstalk by selecting different magnetic sublevels with well-separated transition frequencies to encode even and odd qubits., Comment: 17 pages, 14 figures

With today's quantum processors venturing into regimes beyond the capabilities of classical devices [1-3], we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers [4,5]. In a recent breakthrough in computer science [6-8], a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment a verification protocol using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking [9], or additional quantum resources in case we do not have access to or trust in the device to be tested [5]. While our experimental demonstration uses a simplified version [10] of Mahadev's protocol [6] we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post-quantum secure trapdoor functions within an interactive proof [11]. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage [8], generating [12] and certifying quantum randomness [7], or composable remote state preparation [13]., Comment: 19 pages, 8 figures

A major challenge for the realisation of useful universal quantum computers is achieving high fidelity two-qubit entangling gate operations. However, calibration errors can affect the quantum gate operations and limit their fidelity. To reduce such errors it is desirable to have an analytical understanding and quantitative predictions of the effects that miscalibrations of gate parameters have on the gate performance. In this work, we study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate, which is widely used in trapped ion quantum processors. Our analytical treatment particularly focuses on systematic center line detuning miscalibrations. Via a unitary Magnus expansion, we compute the gate evolution operator which allows us to obtain relevant key properties such as relative phases, electronic populations, quantum state purity and fidelities. These quantities, subsequently, are used to assess the performance of the gate using the fidelity of entangled states as performance metric. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor. The method and the results presented here can help design and calibrate high-fidelity gate operations of large-scale quantum computers., Comment: 17 pages, 13 figures

The performance of quantum gate operations is experimentally determined by how correct operational parameters can be determined and set, and how stable these parameters can be maintained. In addition, gates acting on different sets of qubits require unique sets of control parameters. Thus, an efficient multi-dimensional parameter estimation procedure is crucial to calibrate even medium sized quantum processors. Here, we develop and characterize an efficient calibration protocol to automatically estimate and adjust experimental parameters of the widely used Molmer-Sorensen entangling gate operation in a trapped ion quantum information processor. The protocol exploits Bayesian parameter estimation methods which includes a stopping criterion based on a desired gate infidelity. We experimentally demonstrate a median gate infidelity of $1.3(1)\cdot10^{-3}$, requiring only $1200\pm500$ experimental cycles, while completing the entire gate calibration procedure in less than one minute. This approach is applicable to other quantum information processor architectures with known or sufficiently characterized theoretical models., Comment: 20 pages, 11 figures; Fixed typo in abstract

Quantum computers can be protected from noise by encoding the logical quantum information redundantly into multiple qubits using error correcting codes. When manipulating the logical quantum states, it is imperative that errors caused by imperfect operations do not spread uncontrollably through the quantum register. This requires that all operations on the quantum register obey a fault-tolerant circuit design which, in general, increases the complexity of the implementation. Here, we demonstrate a fault-tolerant universal set of gates on two logical qubits in a trapped-ion quantum computer. In particular, we make use of the recently introduced paradigm of flag fault tolerance, where the absence or presence of dangerous errors is heralded by usage of few ancillary 'flag' qubits. We perform a logical two-qubit CNOT-gate between two instances of the seven qubit color code, and we also fault-tolerantly prepare a logical magic state. We then realize a fault-tolerant logical T-gate by injecting the magic state via teleportation from one logical qubit onto the other. We observe the hallmark feature of fault tolerance, a superior performance compared to a non-fault-tolerant implementation. In combination with recently demonstrated repeated quantum error correction cycles these results open the door to error-corrected universal quantum computation., Comment: v3 with updated acknowledgements, 14 pages, 7 figures

In quantum information processing quantum operations are often processed alongside measurements which result in classical data. Due to the information gain of classical measurement outputs non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution. Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states. Here we present a general recipe to characterize quantum instruments alongside its experimental implementation and analysis. Thereby, the full dynamics of a quantum instrument can be captured, exhibiting details of the quantum dynamics that would be overlooked with common tomography techniques. For illustration, we apply our characterization technique to a quantum instrument used for the detection of qubit loss and leakage, which was recently implemented as a building block in a quantum error correction (QEC) experiment (Nature 585, 207-210 (2020)). Our analysis reveals unexpected and in-depth information about the failure modes of the implementation of the quantum instrument. We then numerically study the implications of these experimental failure modes on QEC performance, when the instrument is employed as a building block in QEC protocols on a logical qubit. Our results highlight the importance of careful characterization and modelling of failure modes in quantum instruments, as compared to simplistic hardware-agnostic phenomenological noise models, which fail to predict the undesired behavior of faulty quantum instruments. The presented methods and results are directly applicable to generic quantum instruments., Comment: 28 pages, 21 figures

Today's quantum computers operate with a binary encoding that is the quantum analog of classical bits. Yet, the underlying quantum hardware consists of information carriers that are not necessarily binary, but typically exhibit a rich multilevel structure, which is artificially restricted to two dimensions. A wide range of applications from quantum chemistry to quantum simulation, on the other hand, would benefit from access to higher-dimensional Hilbert spaces, which conventional quantum computers can only emulate. Here we demonstrate a universal qudit quantum processor using trapped ions with a local Hilbert space dimension of up to 7. With a performance similar to qubit quantum processors, this approach enables native simulation of high-dimensional quantum systems, as well as more efficient implementation of qubit-based algorithms., Comment: 5+9 pages, many figures

Quantum sensors are an established technology that has created new opportunities for precision sensing across the breadth of science. Using entanglement for quantum-enhancement will allow us to construct the next generation of sensors that can approach the fundamental limits of precision allowed by quantum physics. However, determining how state-of-the-art sensing platforms may be used to converge to these ultimate limits is an outstanding challenge. In this work we merge concepts from the field of quantum information processing with metrology, and successfully implement experimentally a *programmable quantum sensor* operating close to the fundamental limits imposed by the laws of quantum mechanics. We achieve this by using low-depth, parametrized quantum circuits implementing optimal input states and measurement operators for a sensing task on a trapped ion experiment. With 26 ions, we approach the fundamental sensing limit up to a factor of 1.45(1), outperforming conventional spin-squeezing with a factor of 1.87(3). Our approach reduces the number of averages to reach a given Allan deviation by a factor of 1.59(6) compared to traditional methods not employing entanglement-enabled protocols. We further perform on-device quantum-classical feedback optimization to `self-calibrate' the programmable quantum sensor with comparable performance. This ability illustrates that this next generation of quantum sensor can be employed without prior knowledge of the device or its noise environment., Comment: Main: 10 pages including Methods, 4 figures. Supplementary Material: 6 pages, 2 figures, separate references

Scaling up trapped-ion quantum computers requires new trap materials to be explored. Here, we present experiments with a surface ion trap made from the high-temperature superconductor YBCO, a promising material for future trap designs. We show that voltage noise from superconducting electrode leads is negligible within the sensitivity $S_V=9\times 10^{-20}\,\mathrm{V}^2\mathrm{Hz}^{-1}$ of our setup, and for lead dimensions typical for advanced trap designs. Furthermore, we investigate the frequency and temperature dependence of electric field noise above a YBCO surface. We find a $1/f$ spectral dependence of the noise and a non-trivial temperature dependence, with a plateau in the noise stretching over roughly $60\,\mathrm{K}$. The onset of the plateau coincides with the superconducting transition, indicating a connection between the dominant noise and the YBCO trap material. We exclude the YBCO bulk as origin of the noise and suggest further experiments to decide between the two remaining options explaining the observed temperature dependence: noise screening within the superconducting phase, or surface noise activated by the YBCO bulk through some unknown mechanism., Comment: 15 pages, 12 figures

We investigate the energy dynamics of non-crystallized (melted) ions, confined in a Paul trap. The non-periodic Coulomb interaction experienced by melted ions forms a medium for non-conservative energy transfer from the radio-frequency (rf) field to the ions, a process known as rf heating. We study rf heating by analyzing numerical simulations of non-crystallized ion motion in Paul trap potentials, in which the energy of the ions' secular motion changes at discrete intervals, corresponding to ion-ion collisions. The analysis of these collisions is used as a basis to derive a simplified model of rf heating energy dynamics, from which we conclude that the rf heating rate is predominantly dependent on the rf field strength. We confirm the predictability of the model experimentally: Two trapped $^{40}$Ca$^{+}$ ions are deterministically driven to melt, and their fluorescence rate is used to infer the ions' energy. From simulation and experimental results, we generalize which experimental parameters are required for efficient recrystallization of melted trapped ions.

Electric-field noise due to surfaces disturbs the motion of nearby trapped ions, compromising the fidelity of gate operations that are the basis for quantum computing algorithms. We present a method that predicts the effect of dielectric materials on the ion's motion. Such dielectrics are integral components of ion traps. Quantitative agreement is found between a model with no free parameters and measurements of a trapped ion in proximity to dielectric mirrors. We expect that this approach can be used to optimize the design of ion-trap-based quantum computers and network nodes.

Quantum information processing is steadily progressing from a purely academic discipline towards applications throughout science and industry. Transitioning from lab-based, proof-of-concept experiments to robust, integrated realizations of quantum information processing hardware is an important step in this process. However, the nature of traditional laboratory setups does not offer itself readily to scaling up system sizes or allow for applications outside of laboratory-grade environments. This transition requires overcoming challenges in engineering and integration without sacrificing the state-of-the-art performance of laboratory implementations. Here, we present a 19-inch rack quantum computing demonstrator based on $^{40}\textrm{Ca}^+$ optical qubits in a linear Paul trap to address many of these challenges. We outline the mechanical, optical, and electrical subsystems. Further, we describe the automation and remote access components of the quantum computing stack. We conclude by describing characterization measurements relevant to digital quantum computing including entangling operations mediated by the Molmer-Sorenson interaction. Using this setup we produce maximally-entangled Greenberger-Horne-Zeilinger states with up to 24 ions without the use of post-selection or error mitigation techniques; on par with well-established conventional laboratory setups.

Quantum error correction procedures have the potential to enable faithful operation of large-scale quantum computers. They protect information from environmental decoherence by storing it in logical qubits, built from ensembles of entangled physical qubits according to suitably tailored quantum error correcting encodings. To date, no generally accepted framework to characterise the behaviour of logical qubits as quantum memories has been developed. In this work, we show that generalisations of well-established figures of merit of physical qubits, such as relaxation times, to logical qubits fail and do not capture dynamics of logical qubits. We experimentally illustrate that, in particular, spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. We show that a suitable set of observables, formed by code space population and logical operators within the code space, allows one to track and characterize the dynamical behaviour of logical qubits. Awareness of these effects and the efficient characterisation tools used in this work will help to guide and benchmark experimental implementations of logical qubits., Comment: 15 pages, 6 figures

Trapped-ion quantum computers have demonstrated high-performance gate operations in registers of about ten qubits. However, scaling up and parallelizing quantum computations with long one-dimensional (1D) ion strings is an outstanding challenge due to the global nature of the motional modes of the ions which mediate qubit-qubit couplings. Here, we devise methods to implement scalable and parallel entangling gates by using engineered localized phonon modes. We propose to tailor such localized modes by tuning the local potential of individual ions with programmable optical tweezers. Localized modes of small subsets of qubits form the basis to perform entangling gates on these subsets in parallel. We demonstrate the inherent scalability of this approach by presenting analytical and numerical results for long 1D ion chains and even for infinite chains of uniformly spaced ions. Furthermore, we show that combining our methods with optimal coherent control techniques allows to realize maximally dense universal parallelized quantum circuits., Comment: 24 pages, 12 figures

Future quantum computers will require quantum error correction for faithful operation. The correction capabilities come with an overhead for performing fault-tolerant logical operations on the encoded qubits. One of the most resource efficient ways to implement logical operations is lattice surgery, where groups of physical qubits, arranged on lattices, can be merged and split to realize entangling gates and teleport logical information. Here, we report on the experimental realization of lattice surgery between two topologically encoded qubits in a 10-qubit ion trap quantum information processor. In particular, we demonstrate entanglement between two logical qubits and we implement logical state teleportation., Comment: 6+9 pages, 10 figures, 3 tables

The loss of qubits - the elementary carriers of quantum information - poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. In this work, we experimentally demonstrate a complete toolbox and the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code. This includes a quantum non-demolition measurement of a qubit loss event that conditionally triggers a restoration procedure, mapping the logical qubit onto a new encoding on the remaining qubits. The demonstrated methods, implemented here in a trapped-ion quantum processor, are applicable to other quantum computing architectures and codes, including leading 2D and 3D topological quantum error correcting codes. These tools complement previously demonstrated techniques to correct computational errors, and in combination constitute essential building blocks for complete and scalable quantum error correction., Comment: 13 pages, 8 figures, 3 tables

We describe, realize, and experimentally investigate a method to perform physical rotations of ion chains, trapped in a segmented surface Paul trap, as a building block for large scale quantum computational sequences. Control of trapping potentials is achieved by parametrizing electrode voltages in terms of spherical harmonic potentials. Voltage sequences that enable crystal rotations are numerically obtained by optimizing time-dependent ion positions and motional frequencies, taking into account the effect of electrical filters in our set-up. We minimize rotation-induced heating by expanding the sequences into Fourier components, and optimizing the resulting parameters with a machine-learning approach. Optimized sequences rotate $^{40}$Ca$^+$ - $^{40}$Ca$^+$ crystals with axial heating rates of $\Delta\bar{n}_{com}=0.6^{(+3)}_{(-2)}$ and $\Delta\bar{n}_{str}=3.9(5)$ phonons per rotation for the common and stretch modes, at mode frequencies of 1.24 and 2.15 MHz. Qubit coherence loss is 0.2(2)$\%$ per rotation. We also investigate rotations of mixed species crystals ($^{40}$Ca$^+$ - $^{88}$Sr$^+$) and achieve unity success rate.

Lidar sensors are frequently used in environment perception for autonomous vehicles and mobile robotics to complement camera, radar, and ultrasonic sensors. Adverse weather conditions are significantly impacting the performance of lidar-based scene understanding by causing undesired measurement points that in turn effect missing detections and false positives. In heavy rain or dense fog, water drops could be misinterpreted as objects in front of the vehicle which brings a mobile robot to a full stop. In this paper, we present the first CNN-based approach to understand and filter out such adverse weather effects in point cloud data. Using a large data set obtained in controlled weather environments, we demonstrate a significant performance improvement of our method over state-of-the-art involving geometric filtering. Data is available at https://github.com/rheinzler/PointCloudDeNoising.

Lidar sensors are often used in mobile robots and autonomous vehicles to complement camera, radar and ultrasonic sensors for environment perception. Typically, perception algorithms are trained to only detect moving and static objects as well as ground estimation, but intentionally ignore weather effects to reduce false detections. In this work, we present an in-depth analysis of automotive lidar performance under harsh weather conditions, i.e. heavy rain and dense fog. An extensive data set has been recorded for various fog and rain conditions, which is the basis for the conducted in-depth analysis of the point cloud under changing environmental conditions. In addition, we introduce a novel approach to detect and classify rain or fog with lidar sensors only and achieve an mean union over intersection of 97.14 % for a data set in controlled environments. The analysis of weather influences on the performance of lidar sensors and the weather detection are important steps towards improving safety levels for autonomous driving in adverse weather conditions by providing reliable information to adapt vehicle behavior., Comment: 8 pages, will be published in the IEEE IV 2019 Proceedings

Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the various errors that accumulate during an algorithm running on large-scale processors. Current characterization techniques are unable to adequately account for the exponentially large set of potential errors, including cross-talk and other correlated noise sources. Here we develop cycle benchmarking, a rigorous and practically scalable protocol for characterizing local and global errors across multi-qubit quantum processors. We experimentally demonstrate its practicality by quantifying such errors in non-entangling and entangling operations on an ion-trap quantum computer with up to 10 qubits, with total process fidelities for multi-qubit entangling gates ranging from 99.6(1)% for 2 qubits to 86(2)% for 10 qubits. Furthermore, cycle benchmarking data validates that the error rate per single-qubit gate and per two-qubit coupling does not increase with increasing system size., Comment: The main text consists of 6 pages, 3 figures and 1 table. The supplementary information consists of 6 pages, 2 figures and 3 tables