We report superconducting fluxonium qubits with coherence times largely limited by energy relaxation and reproducibly satisfying $T_2>100\mu \mathrm{s}$ ($T_2>400\mu \mathrm{s}$ in one device). Moreover, given the state-of-the-art values of the surface loss tangent and the $1/f$ flux-noise amplitude, the coherence time can be further improved beyond 1 ms. Our results violate a common viewpoint that the number of Josephson junctions in a superconducting circuit—over $10^2$ here—must be minimized for best qubit coherence. We outline how the unique to fluxonium combination of long coherence time and large anharmonicity can benefit both gate-based and adiabatic quantum computing.

Realization of long-distance quantum communication through the quantum repeater network requires a combination of some key elements, including a multiplexed quantum memory for storage of entanglement and a telecom photon for propagation of information through the fiber. Although impressive experimental advances have demonstrated the individual elements, combining these key capabilities together and realizing them in a single experimental system remains a significant challenge. Here, we report an experimental realization of long-distance entanglement between a multiplexed quantum memory with 49 individually accessible memory cells and a telecom photon after transmission in a 10-km optical fiber. Excitation of an atomic ensemble generates narrow-band polarization entanglement between a telecom photon of 1530-nm wavelength and another photon of 780-nm wavelength, which is then stored into a memory cell of a multiplexed atomic quantum memory and read out after a controllable delay. The entanglement is verified through quantum-state tomography after quantum storage in the atomic memory and fiber transmission of the telecom photon. This experiment demonstrates an important step towards realization of long-distance quantum communication networks.

The surface code, with a simple modification, exhibits ultrahigh error-correction thresholds when the noise is biased toward dephasing. Here, we identify features of the surface code responsible for these ultrahigh thresholds. We provide strong evidence that the threshold error rate of the surface code tracks the hashing bound exactly for all biases and show how to exploit these features to achieve significant improvement in the logical failure rate. First, we consider the infinite bias limit, meaning pure dephasing. We prove that the error threshold of the modified surface code for pure dephasing noise is 50%, i.e., that all qubits are fully dephased, and this threshold can be achieved by a polynomial time-decoding algorithm. We demonstrate that the subthreshold behavior of the code depends critically on the precise shape and boundary conditions of the code. That is, for rectangular surface codes with standard rough or smooth open boundaries, it is controlled by the parameter $g=\gcd (j,k)$, where $j$ and $k$ are dimensions of the surface code lattice. We demonstrate a significant improvement in the logical failure rate with pure dephasing for coprime codes that have $g=1$ and closely related rotated codes, which have a modified boundary. The effect is dramatic: The same logical failure rate achievable with a square surface code and $n$ physical qubits can be obtained with a coprime or rotated surface code using only $O(\sqrt{n})$ physical qubits. Finally, we use approximate maximum-likelihood decoding to demonstrate that this improvement persists for a general Pauli noise biased toward dephasing. In particular, comparing with a square surface code, we observe a significant improvement in the logical failure rate against biased noise using a rotated surface code with approximately half the number of physical qubits.

We introduce the problem of unsupervised classification of quantum data, namely, of systems whose quantum states are unknown. We derive the optimal single-shot protocol for the binary case, where the states in a disordered input array are of two types. Our protocol is universal and able to automatically sort the input under minimal assumptions, yet partially preserves information contained in the states. We quantify analytically its performance for an arbitrary size and dimension of the data. We contrast it with the performance of its classical counterpart, which clusters data that have been sampled from two unknown probability distributions. We find that the quantum protocol fully exploits the dimensionality of the quantum data to achieve a much higher performance, provided the data are at least three dimensional. For the sake of comparison, we discuss the optimal protocol when the classical and quantum states are known.

Many existing quantum supervised learning (SL) schemes consider data given a priori in a classical description. With only noisy intermediate-scale quantum (NISQ) devices available in the near future, their quantum speedup awaits the development of quantum random access memories (qRAMs) and fault-tolerant quantum computing. However, there also exist a multitude of SL tasks whose data are acquired by sensors, e.g., pattern classification based on data produced by imaging sensors. Solving such SL tasks naturally requires an integrated approach harnessing tools from both quantum sensing and quantum computing. We introduce supervised learning assisted by an entangled sensor network (SLAEN) as a means to carry out SL tasks at the physical layer. The entanglement shared by the sensors in SLAEN boosts the performance of extracting global features of the object under investigation. We leverage SLAEN to construct an entanglement-assisted support-vector machine for data classification and entanglement-assisted principal component analyzer for data compression. In both schemes, variational circuits are employed to seek the optimum entangled probe states and measurement settings to maximize the entanglement-enabled enhancement. We observe that SLAEN enjoys an appreciable entanglement-enabled performance gain, even in the presence of loss, over conventional strategies in which classical data are acquired by separable sensors and subsequently processed by classical SL algorithms. SLAEN is realizable with available technology, opening a viable route toward building NISQ devices that offer unmatched performance beyond what the optimum classical device is able to afford.

Stochastic processes underlie a vast range of natural and social phenomena. Some processes such as atomic decay feature intrinsic randomness, whereas other complex processes, e.g., traffic congestion, are effectively probabilistic because we cannot track all relevant variables. To simulate a stochastic system’s future behavior, information about its past must be stored, and thus memory is a key resource. Quantum information processing promises a memory advantage for stochastic simulation. Here, we report the first experimental demonstration that a quantum stochastic simulator can encode the required information in fewer dimensions than any classical simulator, thereby achieving a quantum advantage in minimal memory requirements using an individual simulator. This advantage is in contrast to recent proof-of-concept experiments, where the memory saving would only become accessible in the limit of a large number of parallel simulations. In those examples, the minimal memory registers of individual quantum simulators had the same dimensionality as their classical counterparts. Our photonic experiment thus establishes the potential of new, practical resource savings in the simulation of complex systems.

Measurement-device-independent quantum key distribution (MDI-QKD) can eliminate detector side channels and prevent all attacks on detectors. The future of MDI-QKD is a quantum network that provides service to many users over untrusted relay nodes. In a real quantum network, the losses of various channels are different and users are added and deleted over time. To adapt to these features, we propose a type of protocol that allows users to independently choose their optimal intensity settings to compensate for different channel losses. Such a protocol enables a scalable high-rate MDI-QKD network that can easily be applied for channels of different losses and allows users to be dynamically added or deleted at any time without affecting the performance of existing users.

In quantum error correction, information is encoded in a high-dimensional system to protect it from the environment. A crucial step is to use natural, two-body operations with an ancilla to extract information about errors without causing backaction on the encoded information. Essentially, ancilla errors must not propagate to the encoded system and induce errors beyond those which can be corrected. The current schemes for achieving this fault tolerance to ancilla errors come at the cost of increased overhead requirements. An efficient way to extract error syndromes in a fault-tolerant manner is by using a single ancilla with a strongly biased noise channel. Typically, however, required elementary operations can become challenging when the noise is extremely biased. We propose to overcome this shortcoming by using a bosonic-cat ancilla in a parametrically driven nonlinear oscillator. Such a cat qubit experiences only bit-flip noise, while the phase flips are exponentially suppressed. To highlight the flexibility of this approach, we illustrate the syndrome extraction process in a variety of codes such as qubit-based toric, bosonic-cat, and Gottesman-Kitaev-Preskill codes. Our results open a path for realizing hardware-efficient, fault-tolerant error syndrome extraction.

Fault-tolerant quantum computation requires qubit measurements to be both high fidelity and fast to ensure that idling qubits do not generate more errors during the measurement of ancilla qubits than can be corrected. Towards this goal, we demonstrate single-shot readout of semiconductor spin qubits with 97% fidelity in $1.5\mu \mathrm{s}$. In particular, we show that we can engineer donor-based single-electron transistors (SETs) in silicon with atomic precision to measure single spins much faster than the spin decoherence times in isotopically purified silicon ($270\mu \mathrm{s}$). By designing the SET to have a large capacitive coupling between the SET and target charge, we can optimally operate in the “strong-response” regime to ensure maximal signal contrast. We demonstrate single-charge detection with a signal-to-noise ratio (SNR) of 12.7 at 10 MHz bandwidth, corresponding to a SET charge sensitivity (integration time for $\mathrm{SNR}=2$) of 2.5 ns. We present a theory of the shot-noise sensitivity limit for the strong-response regime which predicts that the present sensitivity is about one order of magnitude above the shot-noise limit. By reducing cold amplification noise to reach the shot-noise limit, it should be theoretically possible to achieve high-fidelity, single-shot readout of an electron spin in silicon with a total readout time of approximately 36 ns.

We establish an operational characterization of general convex resource theories—describing the resource content of not only states but also measurements and channels, both within quantum mechanics and in general probabilistic theories (GPTs)—in the context of state and channel discrimination. We find that discrimination tasks provide a unified operational description for quantification and manipulation of resources by showing that the family of robustness measures can be understood as the maximum advantage provided by any physical resource in several different discrimination tasks, as well as establishing that such discrimination problems can fully characterize the allowed transformations within the given resource theory. Specifically, we introduce a quantifier of resourcefulness of a measurement in any GPT, the generalized robustness of measurement, and show that it admits an operational interpretation as the maximum advantage that a given measurement provides over resourceless measurements in all state discrimination tasks. In the special case of quantum mechanics, we connect discrimination problems with single-shot information theory by showing that the generalized robustness of any measurement can be alternatively understood as the maximal increase in one-shot accessible information when compared to free measurements. We introduce two different approaches to quantifying the resource content of a physical channel based on the generalized robustness measures and show that they quantify the maximum advantage that a resourceful channel can provide in several classes of state and channel discrimination tasks. Furthermore, we endow another measure of resourcefulness of states, the standard robustness, with an operational meaning in general GPTs as the exact quantifier of the maximum advantage that a state can provide in binary channel discrimination tasks. Finally, we establish that several classes of channel and state discrimination tasks form complete families of monotones fully characterizing the transformations of states and measurements, respectively, under general classes of free operations. Our results establish a fundamental connection between the operational tasks of discrimination and core concepts of resource theories—the geometric quantification of resources and resource manipulation—valid for all physical theories beyond quantum mechanics with no additional assumptions about the structure of the GPT required.

The nitrogen-vacancy (NV) center in diamond exhibits spin-dependent fluorescence and long spin coherence times under ambient conditions, enabling applications in quantum information processing and sensing. NV centers near the surface can have strong interactions with external materials and spins, enabling new forms of nanoscale spectroscopy. However, NV spin coherence degrades within 100 nm of the surface, suggesting that diamond surfaces are plagued with ubiquitous defects. Prior work on characterizing near-surface noise has primarily relied on using NV centers themselves as probes; while this has the advantage of exquisite sensitivity, it provides only indirect information about the origin of the noise. Here we demonstrate that surface spectroscopy methods and single-spin measurements can be used as complementary diagnostics to understand sources of noise. We find that surface morphology is crucial for realizing reproducible chemical termination, and use this insight to achieve a highly ordered, oxygen-terminated surface with suppressed noise. We observe NV centers within 10 nm of the surface with coherence times extended by an order of magnitude.

Thermalization of chaotic quantum many-body systems under unitary time evolution is related to the growth in complexity of initially simple Heisenberg operators. Operator growth is a manifestation of information scrambling and can be diagnosed by out-of-time-order correlators (OTOCs). However, the behavior of OTOCs of local operators in generic chaotic local Hamiltonians remains poorly understood, with some semiclassical and large-$N$ models exhibiting exponential growth of OTOCs and a sharp chaos wave front and other random circuit models showing a diffusively broadened wave front. In this paper, we propose a unified physical picture for scrambling in chaotic local Hamiltonians. We construct a random time-dependent Hamiltonian model featuring a large-$N$ limit where the OTOC obeys a Fisher-Kolmogorov-Petrovsky-Piskunov (FKPP) type equation and exhibits exponential growth and a sharp wave front. We show that quantum fluctuations manifest as noise (distinct from the randomness of the couplings in the underlying Hamiltonian) in the FKPP equation and that the noise-averaged OTOC exhibits a crossover to a diffusively broadened wave front. At small $N$, we demonstrate that operator growth dynamics, averaged over the random couplings, can be efficiently simulated for all time using matrix product state techniques. To show that time-dependent randomness is not essential to our conclusions, we push our previous matrix product operator methods to very large size and show that data for a time-independent Hamiltonian model are also consistent with a diffusively broadened wave front.

Spins associated with single defects in solids provide promising qubits for quantum-information processing and quantum networks. Recent experiments have demonstrated long coherence times, high-fidelity operations, and long-range entanglement. However, control has so far been limited to a few qubits, with entangled states of three spins demonstrated. Realizing larger multiqubit registers is challenging due to the need for quantum gates that avoid cross talk and protect the coherence of the complete register. In this paper, we present novel decoherence-protected gates that combine dynamical decoupling of an electron spin with selective phase-controlled driving of nuclear spins. We use these gates to realize a ten-qubit quantum register consisting of the electron spin of a nitrogen-vacancy center and nine nuclear spins in diamond. We show that the register is fully connected by generating entanglement between all 45 possible qubit pairs and realize genuine multipartite entangled states with up to seven qubits. Finally, we investigate the register as a multiqubit memory. We demonstrate the protection of an arbitrary single-qubit state for over 75 s—the longest reported for a single solid-state qubit—and show that two-qubit entanglement can be preserved for over 10 s. Our results enable the control of large quantum registers with long coherence times and therefore open the door to advanced quantum algorithms and quantum networks with solid-state spin qubits.

We establish the general framework of quantum fluctuation theorems by finding the symmetry between the forward and backward transitions of any given quantum channel. The Petz recovery map is adopted as the reverse quantum channel, and the notion of entropy production in thermodynamics is extended to the quantum regime. Our result shows that the fluctuation theorems, which are normally considered for thermodynamic processes, can be a powerful tool to study the detailed statistics of quantum systems as well as the effect of coherence transfer in an arbitrary nonequilibrium quantum process. We introduce a complex-valued entropy production to fully understand the relation between the forward and backward processes through the quantum channel. We find the physical meaning of the imaginary part of entropy production to witness the broken symmetry of the quantum channel. We also show that the imaginary part plays a crucial role in deriving the second law from the quantum fluctuation theorem. The dissipation and fluctuation of various quantum resources including quantum free energy, asymmetry, and entanglement can be coherently understood in our unified framework. Our fluctuation theorem can be applied to a wide range of physical systems and dynamics to query the reversibility of a quantum state for the given quantum processing channel involving coherence and entanglement.

Photon-mediated coupling between distant matter qubits may enable secure communication over long distances, the implementation of distributed quantum computing schemes, and the exploration of new regimes of many-body quantum dynamics. Solid-state quantum emitters coupled to nanophotonic devices represent a promising approach towards these goals, as they combine strong light-matter interaction and high photon collection efficiencies. However, nanostructured environments introduce mismatch and diffusion in optical transition frequencies of emitters, making reliable photon-mediated entanglement generation infeasible. Here we address this long-standing challenge by employing silicon-vacancy color centers embedded in electromechanically deflectable nanophotonic waveguides. This electromechanical strain control enables control and stabilization of optical resonance between two silicon-vacancy centers on the hour timescale. Using this platform, we observe the signature of an entangled, superradiant state arising from quantum interference between two spatially separated emitters in a waveguide. This demonstration and the developed platform constitute a crucial step towards a scalable quantum network with solid-state quantum emitters.

We propose a quantum-information-based scheme to reduce the temperature of quantum many-body systems and access regimes beyond the current capability of conventional cooling techniques. We show that collective measurements on multiple copies of a system at finite temperature can simulate measurements of the same system at a lower temperature. This idea is illustrated for the example of ultracold atoms in optical lattices, where controlled tunnel coupling and quantum gas microscopy can be naturally combined to realize the required collective measurements to access a lower, virtual temperature. Our protocol is experimentally implemented for a Bose-Hubbard model on up to 12 sites, and we successfully extract expectation values of observables at half the temperature of the physical system. Additionally, we present related techniques that enable the extraction of zero-temperature states directly.

In the context of quantum theories of spacetime, one overarching question is how quantum information in the bulk spacetime is encoded holographically in boundary degrees of freedom. It is particularly interesting to understand the correspondence between bulk subregions and boundary subregions in order to address the emergence of locality in the bulk quantum spacetime. For the AdS/CFT correspondence, it is known that this bulk information is encoded redundantly on the boundary in the form of an error-correcting code. Having access only to a subregion of the boundary is as if part of the holographic code has been damaged by noise and rendered inaccessible. In quantum-information science, the problem of recovering information from a damaged code is addressed by the theory of universal recovery channels. We apply and extend this theory to address the problem of relating bulk and boundary subregions in AdS/CFT, focusing on a conjecture known as entanglement wedge reconstruction. Existing work relies on the exact equivalence between bulk and boundary relative entropies, but these are only approximately equal in bulk effective field theory, and in similar situations it is known that predictions from exact entropic equalities can be qualitatively incorrect. We show that the framework of universal recovery channels provides a robust demonstration of the entanglement wedge reconstruction conjecture as well as new physical insights. Most notably, we find that a bulk operator acting in a given boundary region’s entanglement wedge can be expressed as the response of the boundary region’s modular Hamiltonian to a perturbation of the bulk state in the direction of the bulk operator. This formula can be interpreted as a noncommutative version of Bayes’s rule that attempts to undo the noise induced by restricting to only a portion of the boundary. To reach these conclusions, we extend the theory of universal recovery channels to finite-dimensional operator algebras and demonstrate that recovery channels approximately preserve the multiplicative structure of the operator algebra.

The propagation of information in nonrelativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound. We derive a new Lieb-Robinson bound for systems with interactions that decay with distance $r$ as a power law, $1/r^{\alpha }$. The bound implies an effective light cone tighter than all previous bounds. Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al., FOCS’18. To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish. This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation. In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions. In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when $\alpha >3D$ (where $D$ is the number of dimensions).

We propose and analyze a protocol to study quantum information scrambling using statistical correlations between measurements, which are performed after evolving a quantum system from randomized initial states. We prove that the resulting correlations precisely capture the so-called out-of-time-ordered correlators and can be used to probe chaos in strongly interacting, many-body systems. Our protocol requires neither reversing time evolution nor auxiliary degrees of freedom, and it can be realized in state-of-the-art quantum simulation experiments.

We establish a lower bound on the asymptotic secret key rate of continuous-variable quantum key distribution with a discrete modulation of coherent states. The bound is valid against collective attacks and is obtained by formulating the problem as a semidefinite program. We illustrate our general approach with the quadrature-phase-shift-keying modulation scheme and show that distances over 100 km are achievable for realistic values of noise. We also discuss the application to more complex quadrature-amplitude-modulation schemes. This result opens the way to establishing the full security of continuous-variable protocols with a discrete modulation, and thereby to the large-scale deployment of these protocols for quantum key distribution.