Superconducting qubits are an attractive platform for quantum computing since they have demonstrated high-fidelity quantum gates and extensibility to modest system sizes. Nonetheless, an outstanding ...challenge is stabilizing their energy-relaxation times, which can fluctuate unpredictably in frequency and time. Here, we use qubits as spectral and temporal probes of individual two-level-system defects to provide direct evidence that they are responsible for the largest fluctuations. This research lays the foundation for stabilizing qubit performance through calibration, design, and fabrication.
We demonstrate diabatic two-qubit gates with Pauli error rates down to 4.3(2)×10^{-3} in as fast as 18 ns using frequency-tunable superconducting qubits. This is achieved by synchronizing the ...entangling parameters with minima in the leakage channel. The synchronization shows a landscape in gate parameter space that agrees with model predictions and facilitates robust tune-up. We test both iswap-like and cphase gates with cross-entropy benchmarking. The presented approach can be extended to multibody operations as well.
We demonstrate that the spin of optically addressable point defects can be coherently driven with ac electric fields. Based on magnetic-dipole forbidden spin transitions, this scheme enables ...spatially confined spin control, the imaging of GHz-frequency electric fields, and the characterization of defect spin multiplicity. We control defect ensembles in SiC, but our methods apply to spin systems in many semiconductors, including the diamond nitrogen-vacancy center. Electrically driven spin resonance offers a viable route towards scalable quantum control of electron spins in a dense array.
A quantum memory, composed of a long-lived qubit coupled to each processing qubit, is important to building a scalable platform for quantum information science. These two qubits should be connected ...by a fast and high-fidelity operation to store and retrieve coherent quantum states. Here, we demonstrate a room-temperature quantum memory based on the spin of the nitrogen nucleus intrinsic to each nitrogen-vacancy (NV) centre in diamond. We perform coherent storage of a single NV centre electronic spin in a single nitrogen nuclear spin using Landau-Zener transitions across a hyperfine-mediated avoided level crossing. By working outside the asymptotic regime, we demonstrate coherent state transfer in as little as 120 ns with total storage fidelity of 88±6%. This work demonstrates the use of a quantum memory that is compatible with scaling as the nitrogen nucleus is deterministically present in each NV centre defect. PUBLICATION ABSTRACT
Acariformes is the most species-rich and morphologically diverse radiation of chelicerate arthropods, known from the oldest terrestrial ecosystems. It is also a key lineage in understanding the ...evolution of this group, with the most vexing question whether mites, or Acari (Parasitiformes and Acariformes) is monophyletic. Previous molecular studies recovered Acari either as monophyletic or non-monophyletic, albeit with a limited taxon sampling. Similarly, relationships between basal acariform groups (include little-known, deep-soil 'endeostigmatan' mites) and major lineages of Acariformes (Sarcoptiformes, Prostigmata) are virtually unknown. We infer phylogeny of chelicerate arthropods, using a large and representative dataset, comprising all main in- and outgroups (228 taxa). Basal diversity of Acariformes is particularly well sampled. With this dataset, we conduct a series of phylogenetically explicit tests of chelicerate and acariform relationships and present a phylogenetic framework for internal relationships of acariform mites.
Our molecular data strongly support a diphyletic Acari, with Acariformes as the sister group to Solifugae (PP =1.0; BP = 100), the so called Poecilophysidea. Among Acariformes, some representatives of the basal group Endeostigmata (mainly deep-soil mites) were recovered as sister-groups to the remaining Acariformes (i. e., Trombidiformes + and most of Sarcoptiformes). Desmonomatan oribatid mites (soil and litter mites) were recovered as the monophyletic sister group of Astigmata (e. g., stored product mites, house dust mites, mange mites, feather and fur mites). Trombidiformes (Sphaerolichida + Prostigmata) is strongly supported (PP =1.0; BP = 98-100). Labidostommatina was inferred as the basal lineage of Prostigmata. Eleutherengona (e. g., spider mites) and Parasitengona (e. g., chiggers, fresh water mites) were recovered as monophyletic. By contrast, Eupodina (e. g., snout mites and relatives) was not. Marine mites (Halacaridae) were traditionally regarded as the sister-group to Bdelloidea (Eupodina), but our analyses show their close relationships to Parasitengona.
Non-trivial relationships recovered by our analyses with high support (i.e., basal arrangement of endeostigmatid lineages, the position of marine mites, polyphyly of Eupodina) had been proposed by previous underappreciated morphological studies. Thus, we update currently the accepted taxonomic classification to reflect these results: the superfamily Halacaroidea Murray, 1877 is moved from the infraorder Eupodina Krantz, 1978 to Anystina van der Hammen, 1972; and the subfamily Erythracarinae Oudemans, 1936 (formerly in Anystidae Oudemans, 1902) is elevated to family rank, Erythracaridae stat. ressur., leaving Anystidae only with the nominal subfamily. Our study also shows that a clade comprising early derivative Endeostigmata (Alycidae, Nanorchestidae, Nematalycidae, and maybe Alicorhagiidae) should be treated as a taxon with the same rank as Sarcoptiformes and Trombidiformes, and the scope of the superfamily Bdelloidea should be changed. Before turning those findings into nomenclatural changes, however, we consider that our study calls for (i) finding shared apomorphies of the early derivative Endeostigmata clade and the clade including the remaining Acariformes; (ii) a well-supported hypothesis for Alicorhagiidae placement; (iii) sampling the families Proterorhagiidae, Proteonematalycidae and Grandjeanicidae not yet included in molecular analyses; (iv) undertake a denser sampling of clades traditionally placed in Eupodina, Anystina (Trombidiformes) and Palaeosomata (Sarcoptiformes), since consensus networks and Internode certainty (IC) and IC All (ICA) indices indicate high levels of conflict in these tree regions. Our study shows that regions of ambiguous alignment may provide useful phylogenetic signal when secondary structure information is used to guide the alignment procedure and provides an R implementation to the Bayesian Relative Rates test.
The discovery of topological order has revised the understanding of quantum matter and provided the theoretical foundation for many quantum error–correcting codes. Realizing topologically ordered ...states has proven to be challenging in both condensed matter and synthetic quantum systems. We prepared the ground state of the toric code Hamiltonian using an efficient quantum circuit on a superconducting quantum processor. We measured a topological entanglement entropy near the expected value of –ln2 and simulated anyon interferometry to extract the braiding statistics of the emergent excitations. Furthermore, we investigated key aspects of the surface code, including logical state injection and the decay of the nonlocal order parameter. Our results demonstrate the potential for quantum processors to provide insights into topological quantum matter and quantum error correction.
A key step toward demonstrating a quantum system that can address difficult problems in physics and chemistry will be performing a computation beyond the capabilities of any classical computer, thus ...achieving so-called quantum supremacy. In this study, we used nine superconducting qubits to demonstrate a promising path toward quantum supremacy. By individually tuning the qubit parameters, we were able to generate thousands of distinct Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert space. As the number of qubits increases, the system continues to explore the exponentially growing number of states. Extending these results to a system of 50 qubits has the potential to address scientific questions that are beyond the capabilities of any classical computer.
Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit ...within the finite resources offered by existing noisy hardware. Here, taking advantage of the adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a threefold reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic simulation (fSim) gate set. We benchmark the fidelity of the iSWAP-like and controlled-phase gate families as well as 525 other fSim gates spread evenly across the entire fSim (θ, ϕ) parameter space, achieving a purity-limited average two-qubit Pauli error of 3.8 × 10−3 per fSim gate.
Quantum computing can become scalable through error correction, but logical error rates only decrease with system size when physical errors are sufficiently uncorrelated. During computation, unused ...high energy levels of the qubits can become excited, creating leakage states that are long-lived and mobile. Particularly for superconducting transmon qubits, this leakage opens a path to errors that are correlated in space and time. Here, we report a reset protocol that returns a qubit to the ground state from all relevant higher level states. We test its performance with the bit-flip stabilizer code, a simplified version of the surface code for quantum error correction. We investigate the accumulation and dynamics of leakage during error correction. Using this protocol, we find lower rates of logical errors and an improved scaling and stability of error suppression with increasing qubit number. This demonstration provides a key step on the path towards scalable quantum computing.