We discuss a tensor network method for constructing the adiabatic gauge potential—the generator of adiabatic transformations—as a matrix product operator, which allows us to adiabatically transport matrix product states. Adiabatic evolution of tensor networks offers a wide range of applications, of which two are explored in this paper: improving tensor network optimization and scanning phase diagrams. By efficiently transporting eigenstates to quantum criticality and performing intermediary density-matrix renormalization group (DMRG) optimizations along the way, we demonstrate that we can compute ground and low-lying excited states faster and more reliably than a standard DMRG method at or near quantum criticality. We demonstrate a simple automated step size adjustment and detection of the critical point based on the norm of the adiabatic gauge potential. Remarkably, we are able to reliably transport states through the critical point of the models we study.

We consider the ${\mathbb{Z}}_2$ toric code, surface code, and Floquet code defined on a nonorientable surface, which can be considered as families of codes extending Shor’s nine-qubit code. We investigate the fault-tolerant logical gates of the ${\mathbb{Z}}_2$ toric code in this setup, which corresponds to $e\leftrightarrow m$ exchanging symmetry of the underlying ${\mathbb{Z}}_2$ gauge theory. We find that nonorientable geometry provides a new way for the emergent symmetry to act on the code space, and discover the new realization of the fault-tolerant Hadamard gate of the two-dimensional surface code with a single cross cap connecting the vertices nonlocally along a slit, dubbed a nonorientable surface code. This Hadamard gate can be realized by a constant-depth local unitary circuit modulo nonlocality caused by a cross cap. Via folding, the nonorientable surface code can be turned into a bilayer local quantum code, where the folded cross cap is equivalent to a bilayer twist terminated on a gapped boundary and the logical Hadamard only contains local gates with intralayer couplings when being away from the cross cap, as opposed to the interlayer couplings on each site needed in the case of the folded surface code. We further obtain the complete logical Clifford gate set for a stack of nonorientable surface codes and similarly for codes defined on Klein-bottle geometries. We then construct the honeycomb Floquet code in the presence of a single cross cap, and find that the period of the sequential Pauli measurements acts as a $HZ$ logical gate on the single logical qubit, where the cross cap enriches the dynamics compared with the orientable case. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the ${\mathbb{Z}}_2$ gauge theory, and illustrate the exotic dynamics of our code in terms of a condensation operator supported at a nonorientable surface.

A noiseless linear amplifier (NLA) performs the highest-quality amplification allowable under the rules of quantum physics. Unfortunately, these same rules conspire against us via the no-cloning theorem, which constrains NLA operations to the domain of probabilistic processes. Nevertheless, they are useful for a wide variety of quantum protocols, with numerous proposals assuming access to an optimal NLA device that performs with the maximum possible success probability. Here we propose the first linear-optics NLA protocol that asymptotically achieves this success probability bound by modifying the Knill-Laflamme-Milburn near-deterministic teleporter into an amplifier.

Quantum gases of doubly polar molecules represent appealing frameworks for a variety of cross-disciplinary applications, encompassing quantum simulation and computation, controlled quantum chemistry, and precision measurements. Through a joint experimental and theoretical study, here we explore a novel class of ultracold paramagnetic polar molecules combining lithium alkali and chromium transition metal elements. Focusing on the specific bosonic isotopologue ${}^6{\mathrm{Li}}^{53}\mathrm{Cr}$, leveraging on the Fermi statistics of the parent atomic mixture and on suitable Feshbach resonances recently discovered, we produce up to $50\times {10}^3$ ultracold $\mathrm{Li}\mathrm{Cr}$ molecules at peak phase-space densities exceeding 0.1, prepared within the least bound rotationless level of the $\mathrm{Li}\mathrm{Cr}$ electronic sextet ground state $X{}^6{\mathrm{\Sigma }}^{+}$. By also developing new probing methods, we thoroughly characterize the molecular gas, demonstrating the paramagnetic nature of $\mathrm{Li}\mathrm{Cr}$ dimers and the precise control of their quantum state. We investigate their stability against inelastic processes and identify a parameter region where pure $\mathrm{Li}\mathrm{Cr}$ samples exhibit lifetimes exceeding 0.2 s. Parallel to this, we employ state-of-the-art quantum chemical calculations to accurately predict the properties of $\mathrm{Li}\mathrm{Cr}$ ground and excited electronic states. This ab initio model, able to reproduce the experimental $\mathrm{Li}$-$\mathrm{Cr}$ high-spin, octet scattering length, allows us to identify both efficient paths to coherently transfer weakly bound $\mathrm{Li}\mathrm{Cr}$ dimers to their absolute ground state, and suitable transitions for their subsequent optical manipulation. Our studies establish $\mathrm{Li}$-$\mathrm{Cr}$ as a prime candidate to realize ultracold gases of doubly polar molecules with significant electric (3.3 D) and magnetic ($5{\mu }_B$) dipole moments.

Accurately estimating high-order moments of quantum states is an elementary precondition for many crucial tasks in quantum computing, such as entanglement spectroscopy, entropy estimation, spectrum estimation, and predicting nonlinear features from quantum states. But in reality, inevitable quantum noise prevents us from accessing the desired value. In this paper, we address this issue by systematically analyzing the feasibility and efficiency of extracting high-order moments from noisy states. We first show that there exists a quantum protocol capable of accomplishing this task if and only if the underlying noise channel is invertible. We then establish a method for deriving protocols that attain optimal sample complexity using quantum operations and classical postprocessing only. Our protocols, in contrast to conventional ones, incur lower overheads and avoid sampling different quantum operations due to a novel technique called the “‘observable shift method,” making the protocols strong candidates for practical use on current quantum devices. The proposed method also indicates the power of entangled protocols in retrieving high-order information, whereas in the existing methods, entanglement does not help. We further construct the protocol for large quantum systems to retrieve the depolarizing channels, making the proposed method scalable. Our work contributes to a deeper understanding of how quantum noise could affect high-order information extraction and provides guidance on how to tackle it.

Dynamical decoupling of spin qubits in silicon can increase fidelity and can be used to extract the frequency spectra of noise processes. We demonstrate a full-permutation dynamical decoupling technique that cyclically exchanges the spins in a triple-quantum-dot qubit. This sequence not only suppresses both low-frequency charge-noise-induced and magnetic-noise-induced errors; it also refocuses leakage errors to first order, which is particularly interesting for encoded exchange-only qubits. For a specific construction, which we call “NZ1y,” the qubit is isolated from error sources to such a degree that we measure a remarkable exchange pulse error of $2.8\times {10}^{-5}$. This sequence maintains a quantum state for roughly 18,000 exchange pulses, extending the qubit coherence from $T_2^{\ast }=2\text{μ}\mathrm{s}$ to $T_2=720\text{μ}\mathrm{s}$. We experimentally validate an error model that includes $1/f$ charge noise and $1/f$ magnetic noise in two ways: by direct exchange-qubit simulation and by integration of the assumed noise spectra with derived filter functions, both of which reproduce the measured error and leakage with respect to a change of the repetition rate.

Quantum master equations are an invaluable tool to model the dynamics of a plethora of microscopic systems, ranging from quantum optics and quantum information processing to energy and charge transport, electronic and nuclear spin resonance, photochemistry, and more. This tutorial offers a concise and pedagogical introduction to quantum master equations, accessible to a broad, cross-disciplinary audience. The reader is guided through the basics of quantum dynamics with hands-on examples that increase in complexity. The tutorial covers essential methods such as the use of the Lindblad master equation, Redfield relaxation, and Floquet theory, as well as techniques such as Suzuki-Trotter expansion and numerical approaches for sparse solvers. These methods are illustrated with code snippets implemented in python and other languages, which can be used as a starting point for generalization and more sophisticated implementations.

We construct a fault-tolerant quantum error-correcting protocol based on a qubit encoded in a large spin qudit using a spin-cat code, analogous to the continuous-variable cat encoding. With this, we can correct the dominant error sources, namely processes that can be expressed as error operators that are linear or quadratic in the components of angular momentum. Such codes tailored to dominant error sources can exhibit superior thresholds and lower resource overheads when compared to those designed for unstructured noise models. A key component is the cnot gate that preserves the rank of spherical tensor operators. Categorizing the dominant errors as phase and amplitude errors, we demonstrate how phase errors, analogous to phase-flip errors for qubits, can be effectively corrected. Furthermore, we propose a measurement-free error-correction scheme to address amplitude errors without relying on syndrome measurements. Through an in-depth analysis of logical cnot gate errors, we establish that the fault-tolerant threshold for error correction in the spin-cat encoding surpasses that of standard qubit-based encodings. We consider a specific implementation based on neutral-atom quantum computing, with qudits encoded in the nuclear spin of ${}^{87}\mathrm{Sr}$, and show how to generate the universal gate set, including the rank-preserving cnot gate, using quantum control and the Rydberg blockade. These findings pave the way for encoding a qubit in a large spin with the potential to achieve fault tolerance, high threshold, and reduced resource overhead in quantum information processing.

Dephasing is a prominent noise mechanism that afflicts quantum information carriers, and it is one of the main challenges toward realizing useful quantum computation, communication, and sensing. Here, we consider discrimination and estimation of bosonic dephasing channels, when using the most general adaptive strategies allowed by quantum mechanics. We reduce these difficult quantum problems to simple classical ones based on the probability densities defining the bosonic dephasing channels. By doing so, we rigorously establish the optimal performance of various distinguishability and estimation tasks and construct explicit strategies to achieve this performance. To the best of our knowledge, this is the first example of a non-Gaussian bosonic channel for which there are exact solutions for these tasks.

Shuttling spins with high fidelity is a key requirement to scale up semiconducting quantum computers, enabling qubit entanglement over large distances and favoring the integration of control electronics on-chip. To decouple the spin from the unavoidable charge noise, state-of-the-art spin shuttlers try to minimize the inhomogeneity of the Zeeman field. However, this decoupling is challenging in otherwise promising quantum computing platforms such as hole spin qubits in silicon and germanium, characterized by a large spin-orbit interaction and an electrically tunable qubit frequency. In this work, we show that, surprisingly, the large inhomogeneity of the Zeeman field stabilizes the coherence of a moving spin state, thus also enabling high-fidelity shuttling in these systems. We relate this enhancement in fidelity to the deterministic dynamics of the spin that filters out the dominant low-frequency contributions of the charge noise. By simulating several different scenarios and noise sources, we show that this is a robust phenomenon generally occurring at large field inhomogeneity. By appropriately adjusting the motion of the quantum dot, we also design realistic protocols enabling faster and more coherent spin shuttling. Our findings are generally applicable to a wide range of setups and could pave the way toward large-scale quantum processors.

During time evolution of many-body systems entanglement grows rapidly, limiting exact simulations to small-scale systems or small timescales. Quantum information tends, however, to flow towards larger scales without returning to local scales, such that its detailed large-scale structure does not directly affect local observables. This allows for the removal of large-scale quantum information in a way that preserves all local observables and gives access to large-scale and large-time quantum dynamics. To this end, we use the recently introduced information lattice to organize quantum information into different scales, allowing us to define local information and information currents that we employ to systematically discard long-range quantum correlations in a controlled way. Our approach relies on decomposing the system into subsystems up to a maximum scale and time evolving the subsystem density matrices by solving the subsystem von Neumann equations in parallel. Importantly, the information flow needs to be preserved during the discarding of large-scale information. To achieve this without the need to make assumptions about the microscopic details of the information current, we introduce a second scale at which information is discarded, while using the state at the maximum scale to accurately obtain the information flow. The resulting algorithm, which we call local-information time evolution, is highly versatile and suitable for investigating many-body quantum dynamics in both closed and open quantum systems with diverse hydrodynamic behaviors. We present results for the energy transport in the mixed-field Ising model and the magnetization transport in the $XX$ spin chain with onsite dephasing where we accurately determine the power-law exponent and the diffusion coefficients. Furthermore, the information lattice framework employed here promises to offer insightful results about the spatial and temporal behavior of entanglement in many-body systems.

Many problems in quantum information theory can be formulated as optimizations over the sequential outcomes of dynamical systems subject to unpredictable external influences. Such problems include many-body entanglement detection through adaptive measurements, computing the maximum average score of a preparation game over a continuous set of target states, and limiting the behavior of a (quantum) finite-state automaton. In this work, we introduce tractable relaxations of this class of optimization problems. To illustrate their performance, we use them to: (a) compute the probability that a finite-state automaton outputs a given sequence of bits; (b) develop a new many-body entanglement-detection protocol; and (c) let the computer invent an adaptive protocol for magic state detection. As we further show, the maximum score of a sequential problem in the limit of infinitely many time steps is in general incomputable. Nonetheless, we provide general heuristics to bound this quantity and show that they provide useful estimates in relevant scenarios.

The biphoton correlation time, a measure for the conditional uncertainty in the temporal arrival of two photons from a photon pair source, is a key performance identifier for many quantum spectroscopy applications, with shorter correlation times typically yielding better performance. Furthermore, it provides fundamental insight into the effects of dispersion on the biphoton state. Here, we show that a characteristic dependence of the width of the temporal interferogram can be exploited to obtain insights into the amount of second-order dispersion inside the interferometer and to retrieve actual and Fourier-limited ultrashort biphoton correlation times of around $100\text{fs}$. In the presented scheme, we simultaneously measure spectral and temporal interferograms at the output of an $\mathrm{SU}(1,1)$ interferometer based on an integrated broadband parametric down-conversion source in a ${\text{Ti:LiNbO}}_3$ waveguide.

Quantum error correction is crucial for scalable quantum information-processing applications. Traditional discrete-variable quantum codes that use multiple two-level systems to encode logical information can be hardware intensive. An alternative approach is provided by bosonic codes, which use the infinite-dimensional Hilbert space of harmonic oscillators to encode quantum information. Two promising features of bosonic codes are that syndrome measurements are natively analog and that they can be concatenated with discrete-variable codes. In this work, we propose novel decoding methods that explicitly exploit the analog syndrome information obtained from the bosonic qubit readout in a concatenated architecture. Our methods are versatile and can be generally applied to any bosonic code concatenated with a quantum low-density parity-check (QLDPC) code. Furthermore, we introduce the concept of quasi-single shot protocols as a novel approach that significantly reduces the number of repeated syndrome measurements required when decoding under phenomenological noise. To realize the protocol, we present the first implementation of time-domain decoding with the overlapping window method for general QLDPC codes and a novel analog single-shot decoding method. Our results lay the foundation for general decoding algorithms using analog information and demonstrate promising results in the direction of fault-tolerant quantum computation with concatenated bosonic-QLDPC codes.

Reliable randomness is a core ingredient in algorithms and applications ranging from numerical simulations to statistical sampling and cryptography. The outcomes of measurements on entangled quantum states can violate Bell inequalities, thus guaranteeing their intrinsic randomness. This constitutes the basis for certified randomness generation. However, this certification requires spacelike separated devices, making it unfit for a compact apparatus. Here we provide a general method for certified randomness generation on a small-scale application-ready device and perform an integrated photonic demonstration combining a solid-state emitter and a glass chip. In contrast to most existing certification protocols, which in the absence of spacelike separation are vulnerable to loopholes inherent to realistic devices, the protocol we implement accounts for information leakage and is thus compatible with emerging compact scalable devices. We demonstrate a two-qubit photonic device that achieves the highest standard in randomness, yet is cut out for real-world applications. The full 94.5-h-long stabilized process harnesses a bright and stable single-photon quantum-dot-based source, feeding into a reconfigurable photonic chip, with stability in the milliradian range on the implemented phases and consistent indistinguishability of the entangled photons above 93%. Using the contextuality framework, we certify private randomness generation and achieve a rate compatible with randomness expansion secure against quantum adversaries.

We address how one can empirically infer properties of quantum states generated by dynamics involving measurements. Our focus is on many-body settings where the number of measurements is extensive, making brute-force approaches based on postselection intractable due to their exponential sample complexity. We introduce a general-purpose scheme that can be used to infer any property of the postmeasurement ensemble of states (e.g., the average entanglement entropy, or frame potential) using a scalable number of experimental repetitions. We first identify a general class of “estimable properties” that can be directly extracted from experimental data. Then, based on empirical observations of such quantities, we show how one can indirectly infer information about any particular given nonestimable quantity of interest through classical postprocessing. Our approach is based on an optimization task, where one asks what are the minimum and maximum values that the desired quantity could possibly take, while ensuring consistency with observations. The true value of this quantity must then lie within a feasible range between these extrema, resulting in two-sided bounds. Narrow feasible ranges can be obtained by using a classical simulation of the device to determine which estimable properties one should measure. Even in cases where this simulation is inaccurate, unambiguous information about the true value of a given quantity realized on the quantum device can be learned. As an immediate application, we show that our method can be used to verify the emergence of quantum state designs in experiments. We identify some fundamental obstructions that in some cases prevent sharp knowledge of a given quantity from being inferred, and discuss what can be learned in cases where classical simulation is too computationally demanding to be feasible. In particular, we prove that any observer who cannot perform a classical simulation cannot distinguish the output states from those sampled from a maximally structureless ensemble.

We propose and analyze deterministic protocols to generate qudit photonic graph states from quantum emitters. We show that our approach can be applied to generate any qudit graph state and we exemplify it by constructing protocols to generate one- and two-dimensional qudit cluster states, absolutely maximally entangled states, and logical states of quantum error-correcting codes. Some of these protocols make use of time-delayed feedback, while others do not. The only additional resource requirement compared to the qubit case is the ability to control multilevel emitters. These results significantly broaden the range of multiphoton entangled states that can be produced deterministically from quantum emitters.

Topological color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Neither a two-dimensional nor a three-dimensional topology, however, can provide a universal gate set {h, t, cnot}, with the t gate missing in the two-dimensional and the h gate in the three-dimensional case. These complementary shortcomings of the isolated topologies may be overcome in a combined approach, by switching between a two- and a three-dimensional code while maintaining the logical state. In this work, we construct resource-optimized deterministic and nondeterministic code-switching protocols for two- and three-dimensional distance-three color codes using fault-tolerant quantum circuits based on flag qubits. Deterministic protocols allow for the fault-tolerant implementation of logical gates on an encoded quantum state, while nondeterministic protocols may be used for the fault-tolerant preparation of magic states. Taking the error rates of state-of-the-art trapped-ion quantum processors as a reference, we find a logical failure probability of 3% for deterministic logical gates, which cannot be realized transversally in the respective code. By replacing the three-dimensional distance-three color code in the protocol for magic state preparation with the morphed code introduced in Vasmer and Kubica [PRX Quantum 3, 030319 (2022)], we reduce the logical failure rates by 2 orders of magnitude, thus rendering it a viable method for magic state preparation on near-term quantum processors. Our results demonstrate that code switching enables the fault-tolerant and deterministic implementation of a universal gate set under realistic conditions, and thereby provide a practical avenue to advance universal, fault-tolerant quantum computing and enable quantum algorithms on first, error-corrected logical qubits.

Polar molecules are a quantum resource with rich internal structure that can be coherently controlled. The structure, however, also makes the state preparation and measurement (SPAM) of molecules challenging. We advance the SPAM of individual molecules assembled from constituent atoms trapped in optical-tweezer arrays. Sites without $\mathrm{Na}\mathrm{Cs}$ molecules are eliminated using high-fidelity $\mathrm{Cs}$ atom detection, increasing the peak molecule filling fraction of the array threefold. We site-selectively initialize the array in a rotational qubit subspace that is insensitive to differential ac Stark shifts from the optical tweezer. Lastly, we detect multiple rotational states per experimental cycle by imaging atoms after sequential state-selective dissociations. These demonstrations extend the SPAM capabilities of molecules for quantum information, simulation, and metrology.

Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed states describing corrupted memories. Here we provide an intrinsic characterization of the breakdown of topological quantum memory, which both gives a bound on the performance of decoding algorithms and provides examples of topologically distinct mixed states. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order, and serve as a definition for topological order in error-corrupted mixed states. We consider the topological contribution to entanglement negativity and two other metrics based on quantum relative entropy and coherent information. In the concrete example of the two-dimensional (2D) Toric code with local bit-flip and phase errors, we map three quantities to observables in 2D classical spin models and analytically show they all undergo a transition at the same error threshold. This threshold is an upper bound on that achieved in any decoding algorithm and is indeed saturated by that in the optimal decoding algorithm for the Toric code.