Papers

Multimode circuits provide an avenue for flexible control of single and multi-qubit gates. In this work we implement a multimode circuit known as a trimon integrated in a planar geometry. The trimon features three transmon-like modes with strong all-to-all $ZZ$ coupling. We demonstrate high fidelity operations on the trimon, achieving flexible control of its rich state space. This includes qubit rotations conditioned on one or both other qubits, unconditional single-qubit rotations, and both excitation-conserving and double-excitation two-qubit entangling gates. Through multi-tone driving we are able to implement all 16 two-qubit Pauli operators in the two-qubit space. We further demonstrate using the trimon as a qudit with up to 8 states and higher coherence than typical transmon-based implementations. Our results show a compact, highly controllable device that can potentially replace transmons in standard superconducting processor architectures.

The promise of quantum computing is closer to reality today than ever before, thanks to rapid progress in the development of quantum hardware. Even as qubit lifetimes and gate fidelities continue to improve, realizing robust, fault-tolerant quantum computers is contingent upon the successful implementation of quantum error correction (QEC). Conventional QEC schemes have rather high resource overheads and low threshold requirements, making them challenging to implement on present day hardware. Here, we use a recently developed noise-adapted 3-qubit QEC scheme to demonstrate break-even performance against native amplitude-damping (AD) noise on IBM quantum hardware. We use variational quantum circuits to construct hardware-efficient encoding and decoding circuits. This scheme is probabilistic due to the non-unitary nature of the recovery operators, which are implemented via the block-encoding technique. We demonstrate logical qubit lifetimes exceeding those of the physical qubits by performing multiple rounds of QEC. To further protect the qubits from dephasing due to crosstalk, we incorporate dynamical decoupling into our noise-adapted QEC scheme in a seamless fashion. To account for the post-selection overhead, we define a measure of gain, that allows for faithful performance benchmarking of the protocol. Our analysis suggests that the performance of our protocol is limited primarily by the measurement readout fidelity, and is bound to improve with successive generations of quantum processors.

Semi- and quasi-classical (SC) theories can handle arbitrary interatomic interactions and are thus well-suited to predict quantum dynamics in condensed phases that encode energy and charge transport, spectroscopic responses, and chemical reactivity. However, SC theories can be computationally expensive and inaccurate. When combined with generalized quantum master equations (GQMEs), the resulting SC-GQMEs have been observed to enhance the efficiency and accuracy of SC dynamics. Yet, while the mechanism responsible for improved efficiency is clear, the underlying improved accuracy remains elusive. What is worse, SC-GQMEs can yield unphysical dynamics in challenging parameter regimes – a shortcoming that might be avoided if the mechanism of accuracy improvement were understood. Here, we uncover this mechanism. We leverage short-time analyses to prove that exact, "left-handed" time-derivatives delay the onset of SC inaccuracy, and show that their numerical integration yields dynamics with improved accuracy, even without the GQME. We find, however, that these derivatives are a double-edged sword: while offering greater short-time accuracy, they become unphysical in challenging parameter regimes. Because short-lived memory kernels can leverage short-time accuracy while circumventing long-time instability, we develop a protocol to unambiguously determine the memory kernel cutoff, even in challenging regimes where previous treatments had failed. Our insights into accuracy improvement and kernel cutoff protocol can be expected to apply to complex systems that go beyond simple models.

Atomic frequency standards have achieved steadily increasing precision over the past seventy years, enabled in part by feedback mechanisms that stabilise their output. In parallel, the timekeeping capabilities of quantum systems have been explored within the recently developed ticking-clock framework, which models clocks as dynamical systems producing a stochastic sequence of ticks. However, a theoretical description that unifies these perspectives and incorporates feedback into autonomous quantum clocks has been lacking. We introduce a framework for feedback-controlled clockworks in which classical information extracted from the tick sequence is used to influence the subsequent dynamics of the clock. We show that such feedback preserves the core structural features of self-timing and clockwork independence that characterise autonomous ticking clocks. We further identify the signal-to-noise ratio $\mathfrak{S}$ as the fundamental figure of merit for assessing the performance of feedback-controlled clocks. Applying our framework to two representative architectures, we prove that classical clockworks cannot surpass the optimal signal-to-noise ratio achievable without feedback. In contrast, for quantum clockworks we present numerical evidence that feedback can provide a genuine and robust performance enhancement, improving the maximal attainable signal-to-noise ratio. We provide additional numerical evidence, suggesting that the magnitude of the improvement strongly depends on the amount and type of the stored, classical information. These results establish feedback as a potentially essential ingredient in pushing the fundamental limits of timekeeping in the quantum regime.

The AND gate is not reversible$\unicode{x2014}$on qubits. However, it is reversible on qutrits, making it a building block for efficient simulation of qubit computation using qutrits. We first observe that there are multiple two-qutrit Clifford+T unitaries that realize the AND gate with T-count 3, and its generalizations to $n$ qubits with T-count $3n-3$. Our main result is the construction of a novel qutrit $\mathopen{[\![} 6,2,2 \mathclose{]\!]}$ quantum error-correcting code with a transversal implementation of the AND gate. The key insight in our approach is that a symmetric T-depth one circuit decomposition$\unicode{x2014}$composed of a CX circuit, T and T dagger gates, followed by the CX circuit in reverse$\unicode{x2014}$of a given unitary can be interpreted as a CSS code. We can increase the code distance by augmenting the code circuit with additional stabilizers while preserving the logical gate. This results in a code with a "built-in" transversal implementation of the original unitary, which can be further concatenated to attain a $\mathopen{[\![} 48,2,4 \mathclose{]\!]}$ code with the same transversal logical gate. Furthermore, we present several protocols for mixed qubit-qutrit codes which we call Qubit Subspace Codes, and for magic state distillation and injection.

Recent years have seen rapid development in the subject of quantum coding theory, with breakthroughs on many exciting classes of codes, including quantum LDPC codes, quantum locally testable codes, and quantum codes with interesting transversal gates. However, a natural class of quantum codes, which has been well-studied classically, has not yet been treated: those which can be quickly encoded and decoded. This problem concerns the channel capacity setting, where a noise channel sits between perfect encoding and unencoding/decoding operations; this is the setting that is relevant for communication between fault-tolerant quantum computers. In this work, we construct asymptotically good quantum codes that can be encoded and unencoded by quantum circuits of logarithmic depth and consisting of a linear total number of gates. The classical decoding algorithms also run in logarithmic depth and use $\mathcal{O}(n \log n)$ gates, or alternatively a linear number of gates but with higher depth. We further construct explicit and asymptotically good quantum codes whose encoding, unencoding and decoding all use a linear number of gates, and additionally whose encoding and unencoding may be run in logarithmic depth.

We establish tight inapproximability bounds for max-LINSAT, the problem of maximizing the number of satisfied linear constraints over the finite field $\mathbb{F}_q$, where each constraint accepts $r$ values. Specifically, we prove by a direct reduction from Håstad's theorem that no polynomial-time algorithm can exceed the random-assignment ratio $r/q$ by any constant, assuming $\mathsf{P} \neq \mathsf{NP}$. This threshold coincides with the $\ell/m \to 0$ limit of the semicircle law governing decoded quantum interferometry (DQI), where $\ell$ is the decoding radius of the underlying code. Together, these observations delineate the boundary between worst-case hardness and potential quantum advantage, showing that any algorithm surpassing $r/q$ must exploit instance structure beyond what is present in the hard instances produced by PCP reductions.

A system of spins coupled to a bath is a traditional setup in open quantum systems. Through Heisenberg's equation, the spin dynamics can be modeled by a set of first-order differential equations. Interpreting the terms as colored noise and non-Markovian damping, one can write them as quantummechanical Heisenberg-Langevin (HL) equations. These are notoriously difficult to solve because of the high dimensionality of the Hilbert space. Classical generalized Langevin equations, involving non-Markovian damping and colored noise, are well understood and can be treated numerically with relative ease. Thus, a classical ansatz can be made by substituting quantum expectation values with classical functions. This allows the application of standard methods developed for classical stochastic dynamical systems to tackle spin dynamics. However, this approach is uncontrolled and should be benchmarked against known quantum dynamics. In this investigation, a Hamiltonian for spin dynamics is modified to obtain a setup analogous to the Weisskopf-Wigner (WW) theory of spontaneous emission, enabling a comparison of the results. This will be compared for T = 0 and with a slight adaptation in the high-temperature limit.

Combining tensor network techniques with quantum autoregressive moving average models, we quantify the effects of time-correlated noise on quantum algorithms and predict their performance at scale. As a paradigmatic test case, we examine the quantum Fourier transformation. Building on our first technical result, which shows how stochastic tensor network calculations capture frequency correlations, our second result is the revelation that infidelity exponents (scaling from diffuse, to superdiffuse) are determined by the spectral features of the noise. This numerical result rigorously quantifies the common belief that the temporal correlation scale is a key predictive feature of noise's deleterious impact on multi-qubit circuits. To highlight prospects for predicting algorithmic performance, our third result quantifies how infidelity scaling exponents – which are fits determined by training data at moderate scales (40-80 qubits) – can be used to predict more computationally expensive simulation at larger scales (100-128 qubits). Aside from highlighting the scalability of our methods, this workflow feeds into our last result, which is the proposal of predictive benchmarking protocols connecting simulations to experiments. Our work paves the way for large-scale algorithmic simulations and performance prediction under hardware-relevant noise conditions informed by realistic device characteristics.

We consider the evolution of open quantum systems coupled to one or more Gaussian environments. We demonstrate that such systems can be described by a Markovian quantum master equation (MQME) up to a correction that decreases exponentially with the inverse system-bath coupling strength. We provide an explicit expression for this MQME, along with rigorous bounds on its residual correction, and numerically benchmark it for an exactly solvable model. The MQME is obtained via a generalized Born-Markov approximation that can be iterated to arbitrary orders in the system-bath coupling; our error bound converges asymptotically to zero with the iteration order. Our results thus demonstrate that the non-Markovian component in the evolution of an open quantum system, while possibly inevitable, can be exponentially suppressed at weak coupling.

Characterizing the ultimate rates of entanglement distribution is essential for both foundational research and the practical deployment of quantum technologies. To investigate these limits, we introduce an erasure-Pauli channel model describing the distribution of polarization entanglement in optical fiber. For this channel, we derive bounds on the rates of entanglement distribution and related quantum resources under optimal local operations and two-way classical communication (two-way assisted capacities). This framework allows us to determine the optimal repeaterless performance achievable over realistic optical fibers affected by polarization mode dispersion, thereby providing a rigorous benchmark for long-distance polarization-based quantum communication. Finally, we show that both our model and capacity bounds remain robust under the inclusion of detector dark counts.

The preparation and certification of quantum states is a fundamental challenge across quantum information technology. We introduce a tomography-free state certification method that lower-bounds the fidelity by estimating expectation values of engineered parent-Hamiltonian terms from local measurement data. We apply this framework to construct a parent Hamiltonian that enables certification and variational optimization across the Dicke-state family, which includes the single-excitation $W_n$ state. We experimentally validate the framework on IBM quantum hardware, certifying genuine multipartite entanglement for $W_n$ states up to six qubits and establishing positive lower bounds on the state fidelity up to thirteen qubits. For Dicke states with two- and three-excitations, we certify genuine multipartite entanglement up to seven qubits. Within this stringent certification framework, these results constitute among the largest witness-certified demonstrations of such states on a programmable quantum processor.

We propose a concrete realization of a triangular ladder for ultracold atoms, which simultaneously hosts geometric frustration and unusual two-body interactions, and in particular controllable pair hopping and density-induced tunneling. This is done by means of a spin-dependent Kronig-Penney lattice created using a spatially-dependent tripod-type atom-light coupling. We apply density matrix renormalization group (DMRG) calculations to derive the quantum phase diagram. We find that pair tunneling stabilizes a robust pair superfluid, characterized by power-law decay of pair correlations. Additionally, a chiral superfluid arises from frustration induced by competing nearest neighbor (NN) and next-nearest neighbor (NNN) tunnelings. Finally, in the high barrier regime, we map our system onto the XXZ spin model and find the exact phase transition points.

We introduce an improved one-shot characterisation of randomness extraction against quantum side information (privacy amplification), strengthening known one-shot bounds and providing a unified derivation of the tightest known asymptotic constraints. Our main tool is a new class of smooth conditional entropies defined by lifting classical smooth divergences through measurements. A key role is played by the measured smooth Rényi relative entropy of order 2, which we show to admit an equivalent variational form: it can be understood as allowing for smoothing over not only states, but also non-positive Hermitian operators. Building on this, we establish a tightened leftover hash lemma, significantly improving over all known smooth min-entropy bounds on extractable randomness and recovering the sharpest classical achievability results. We extend these methods to decoupling, the coherent analogue of privacy amplification, obtaining a corresponding improved one-shot bound. Relaxing our smooth entropy bounds leads to one-shot achievability results in terms of measured Rényi divergences, tightening the bounds of [Dupuis, arXiv:2105.05342] and recovering state-of-the-art asymptotic i.i.d. error exponents. We show an approximate optimality of our results by giving a matching one-shot converse bound up to additive logarithmic terms. This yields an optimal second-order asymptotic expansion of privacy amplification under trace distance, establishing a significantly tighter one-shot achievability result than previously shown in [Shen et al., arXiv:2202.11590] and proving its optimality for all hash functions.

The concept of multi-gap topology has recently been shown to give rise to uncharted phases beyond conventional single-gap classifications. These phases relate to band nodes with non-Abelian quaternion charges and momentum-space braiding processes characterized by new invariants such as paradigmatic Euler class, phenomena that intrinsically require at least two spatial dimensions. Extending such phases into the non-equilibrium regime is predicted to unlock even richer multi-gap topologies beyond static settings, yet their experimental realization has remained elusive due to the stringent requirements on dimensionality, symmetry, and dynamical control. Here, we theoretically demonstrate and, for the first time, experimentally realize two-dimensional (2D) Floquet non-Abelian band topology in photonic scattering networks. Within this platform, we uncover a sequence of topological phenomena unique to 2D multi-gap systems far from equilibrium, including anomalous multi-gap phases interconnected by band nodes, Floquet Euler transfer, gapped phases with anomalous Dirac string configurations, and Floquet-induced non-Abelian braiding of band nodes. In addition, we observe Floquet-periodic anomalous edge states across multiple gaps, providing experimental signatures of these sought-after 2D multi-gap Floquet topological phases. Our results establish photonic scattering networks as a practical and versatile route to non-Abelian Floquet systems, opening avenues for dynamical topological physics with braiding capability and robust photonic functionalities.

Developing measures of quantum ergodicity and chaos stands as a foundational task in the study of quantum many-body systems. In this work, we propose metrics for these effects based on Hamiltonian learning that unify multiple advantages of existing metrics. In particular, we show how ergodicity and chaos improve the robustness of Hamiltonian learning to small errors and furthermore demonstrate that this robustness can be used as a metric for such phenomena. We analytically and numerically show that our metrics not only distinguish between integrable and ergodic regimes in various spin chains but also quantify chaos and ergodicity, allowing us to locate regions of parameter space displaying maximal ergodicity and maximal sensitivity to local perturbations. Our approach not only provides conceptual ways to study quantum chaos and ergodicity but also presents viable experimental methods for quantum simulators.

We present a theoretical framework for biexciton dynamics in molecular aggregates that explicitly treats populations and coherences across excitation manifolds within a reduced density-matrix formalism. By extending kinetic descriptions beyond the weak-coupling limit, the approach captures the influence of exciton delocalization and exciton-exciton annihilation while remaining computationally tractable within a Markovian description of environmental relaxation. Using this framework, we investigate how the spatial profile and momentum composition of the initial biexciton state govern fluorescence decay and transport. Incoherent initial conditions lead to strongly non-exponential relaxation and time-dependent diffusion driven by nonlinear population kinetics. In contrast, coherently prepared biexciton states exhibit pronounced early-time coherent transport, whose character depends sensitively on whether the initial state is prepared as a standing-wave or traveling-wave superposition of single-exciton modes. Despite nearly identical emission dynamics for J and H aggregate, biexciton transport properties differ markedly due to band structure-dependent interference effect. Our results demonstrate that biexciton dynamics remains strongly influenced by initial-state coherence and momentum composition. Besides initial-state preparation, the coherent-to-incoherent crossover and the diffusive spreading of the exciton density are sensitive to internal conversion processes such as exciton fusion and the decay to the first excited state. The present work establishes initial-state preparation as a key control parameter for many-exciton transport in excitonic systems and provides a general framework for interpreting nonlinear optical experiments beyond population-based descriptions.

Hybrid continuous-variable (CV)-discrete-variable (DV) quantum systems present a promising direction for quantum computing by combining the high dimensional encoding capabilities of qumodes with the control offered by DV qubits on the coupled qumodes. There have been exciting recent progresses on hybrid CV-DV quantum computing, including variational algorithms, error correction, compiler-level optimizations for Hamiltonian simulation, etc. However, there is a lack of a standardized CV-DV benchmark suite for assessing various emerging hardware platforms and evaluating software optimizations on hybrid CV-DV circuits. In this work, we introduce a simulation and benchmarking framework for hybrid CV-DV circuits, implemented using Bosonic Qiskit-a tool specifically designed to model CV-DV systems, along with QuTip for functional correctness verification. We construct and characterize representative CV-DV benchmarks, including cat state generation, GKP state generation, CV-DV state transfers, hybrid quantum Fourier transform, variational quantum algorithms, Hamiltonian simulation, and Shor's algorithm. To assess circuit complexity and scalability, we define a feature map organized into two categories: general features (e.g., qubit/qumode count, gate counts) and CV-DV-specific features (e.g., Wigner negativity, energy, truncation cost). These metrics enable evaluation of both classical simulability and hardware resource requirements. Our results, including one benchmark on real hardware, demonstrate that hybrid CV-DV architectures are not only viable but well-suited for a range of computational tasks, from optimization to Hamiltonian simulation. This framework lays the groundwork for systematic evaluation and future development of hybrid quantum systems.

As quantum computing hardware rapidly advances, objectively evaluating the capabilities and error rates of new processors remains a critical challenge for the field. A clear and realistic understanding of current quantum performance is essential for guiding research priorities and driving meaningful progress. In this work, we apply and extend a protocol-based benchmarking methodology (Meirom, Mor, Weinstein Arxiv 2505.12441) that utilizes well-defined \underline{quantumness} thresholds. By evaluating performance at protocol level rather than the gate level, this approach provides a transparent and intuitive assessment of whether specific quantum processors, or isolated sub-chips within them, can demonstrate a practical quantum advantage. To illustrate the utility of this method, we compare two generations of IBM quantum computers: the older Eagle architecture and the newer Heron architecture. Our findings reveal the genuine operational strengths and limitations of these devices, demonstrating substantial performance improvements in the newer Heron generation. This work was made possible by IBM Quantum policies that enable independent and objective assessment of its quantum computers and sub-chips. We strongly encourage other companies to emulate the independent qubit availability and the fair pricing that allow researchers to perform such assessments.

Hermiticity is usually treated as a foundational axiom of quantum mechanics, guaranteeing real spectra and unitary time evolution. In this work we argue that Hermiticity is more naturally understood as a symmetry law arising from the global conservation of an inner product current. We show that in spacetimes admitting complete Cauchy surfaces without boundary flux this conservation reduces to the familiar Hermiticity condition of the canonical inner product. However, in the presence of causal horizons, most strikingly in black hole geometries, this conservation law becomes obstructed for restricted observers. Tracing over inaccessible degrees of freedom then inevitably yields completely positive trace preserving dynamics with an effective non-Hermitian generator. Using quantum thermodynamics and the monotonicity of relative entropy, we demonstrate that the generalized second law may be reinterpreted as an entropy balance that compensates precisely for the flux of inner product charge through the horizon. The structure of Einstein equations, through the Bianchi identity and the Raychaudhuri focusing equation, provides the geometric mechanism underlying this balance. We also show that black hole ringdown can serve as a realistic observational probe of this idea and may provide quantitative upper bounds on the strength of horizon-induced inner product flux. In this way gravity, entropy production, and effective non-Hermiticity are unified under a single structural principle, with Hermiticity emerging as the special case of globally conserved inner product symmetry.

We investigate the propagation of two-point density correlations in the one-dimensional Bose-Hubbard Hamiltonian in the thermodynamic limit in terms of the correlation transport distance (CTD), an experimentally measurable magnitude that characterizes the spatial spreading of correlations in time. We confirm that the integrable limits of the model exhibit CTD ballistic growth, while the onset of the chaotic phase leads to the emergence of a pronounced sub-ballistic regime, in agreement with previous results for finite systems. By a meticulous analysis of the spatio-temporal correlation profiles, we show that the correlation front nonetheless propagates ballistically for all interaction strengths, and that the chaos-induced slowdown of the CTD originates from the emergence of long-time distance-dependent correlation tails, together with an enhanced decay of the correlation front amplitude. Our results thus provide a detailed characterization of correlation transport that goes beyond a simple light-cone picture.

This paper focuses on error thresholds for Pauli channels. We numerically compute lower bounds for the thresholds using the analytic framework of coset weight enumerators pioneered by DiVincenzo, Shor and Smolin in 1998. In particular, we study potential non-additivity of a variety of small stabilizer codes and their concatenations, and report several new concatenated stabilizer codes of small length that show significant non-additivity. We also give a closed form expression of coset weight enumerators of concatenated phase and bit flip repetition codes. Using insights from this formalism, we estimate the threshold for concatenated repetition codes of large lengths. Finally, for several concatenations of small stabilizer codes we optimize for channels which lead to maximal non-additivity at the hashing point of the corresponding channel. We supplement these results with a discussion on the performance of various stabilizer codes from the perspective of the non-additivity and threshold problem. We report both positive and negative results, and highlight some counterintuitive observations, to support subsequent work on lower bounds for error thresholds.

Quantum simulations on current NISQ hardware are limited by its noisy nature, making efficient quantum error mitigation methods highly demanded. In this paper we introduce a novel mitigation scheme, applicable to arbitrary quantum simulations of time-dependent Hamiltonian dynamics on NISQ devices. The scheme uses a polynomial subset of extended qubit Bogoliubov-Born-Green-Kirkwood-Yvon (BBGKY) hierarchy equations as a sampling criterion of possible mitigated candidates for the quantum observables. We show that for favorable Hamiltonians the polynomial subset of BBGKY hierarchy equations leads to a polynomial overhead in both classical and quantum resources. We employ the method to mitigate simulations of the chiral magnetic effect (CME), a chiral feature of the Schwinger model. We empirically show the effectiveness of our scheme at recovering the real-time dynamics of the CME from noisy quantum simulations of the Schwinger model, for a range of different parameter values of the model. We numerically demonstrate a systematic reduction of quantum noise, together with an increasing noise reduction capability as the amount of BBGKY constraints grows.

The modified Langevin noise formalism (MLNF) models the interaction of the quantized electromagnetic field with an arbitrary lossy magneto-dielectric object placed in vacuum using three types of non-interacting bosonic polaritons: scattering, electric, and magnetic. These respectively represent free-space photons scattered by the object, and photons radiated by quantized electric and magnetic dipolar sources embedded within its volume. Recently [A. Ciattoni, Phys. Rev. A 110, 013707 (2024)], this formalism was justified from the canonical quantization of macroscopic electromagnetism (CQME) [Philbin, New J. Phys. 12, 123008 (2010)] in the Heisenberg picture. This was achieved by identifying the polariton operators within the formal solution of the macroscopic Maxwell equations, assuming they obey bosonic commutation relations to retrieve the canonical ones, and showing they diagonalize the CQME Hamiltonian. However, the explicit functional dependence of these polaritons on the underlying canonical field operators remained undetermined. In this paper, we derive the exact analytical expressions for the polariton operators in terms of the canonical CQME field operators. Using these mappings, we provide a direct and rigorous derivation of the MLNF from the canonical theory in the Schrödinger picture. Our derivation is structured in three foundational steps: 1) adopting the derived analytical expressions as the constitutive definitions of the polariton operators; 2) mathematically proving that these operators are strictly bosonic as a direct consequence of the canonical commutation relations; and 3) demonstrating that they exactly diagonalize the macroscopic CQME Hamiltonian.

We investigate the intrinsic ambiguity in the definition of correlation functions arising from the inevitable invasiveness of quantum measurements. While algebraic correlations defined as expectation values of products of observables are widely used, their relationship to operational ones defined through actual measurement procedures remain unclear. We demonstrate that the differences among various definitions of correlation functions and those among their underlying (quasi-)joint probability distributions are bounded above by a quantitative measure of measurement invasiveness. We further obtain a lower bound on the discrepancy among operational and algebraic (quasi-)joint probability distributions, providing a new form of the uncertainty relation. In addition, we identify an equivalence condition under which operational and algebraic correlations coincide. As an application, we analyze the quantum violation of the Leggett-Garg inequality and clarify the structural origin of the equivalence among different approaches to observing the violation, including sequential projective measurements and weak-measurement. Our results provide an operational foundation for the commonly used algebraic concepts of quantum theory.

Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier copies. However, the prevailing protocols require substantial qubit overhead. We present a distillation protocol based on permutation-invariant gnu codes, as small as two qubits. The two-qubit protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes. Our protocol furthermore distils magic states with arbitrary magic by varying the position of the ideal input states on the Bloch sphere. We achieve this by departing from the usual magic state distillation formalism, allowing the use of non-Clifford gates in the distillation protocol, and allowing the form of the output state to differ from the input state. Our protocol is compatible for use in tandem with existing magic state distillation protocols to enhance their performance.

We study the occurrence of long-lived metastable states in the 4f$^{13}$5d6s electron configuration of Yb$^+$. By optical pumping of a single trapped ion on the $^2F^\text{o}_{7/2}\rightarrow (7/2,0)_{7/2}$ transition at 377.5 nm, we prepare a wide range of metastable electronic states. We use a co-trapped control ion to sympathetically cool the spectroscopy ion, allowing us to accurately time its subsequent decay. We record a strong decay signal corresponding to a lifetime of 0.92(8) s, a weaker decay signal with lifetime 9.8(+2.9, -2.0) s, and find evidence for a much longer lifetime, $>$ 30 s. We identify the metastable states with these lifetimes qualitatively, and corroborate our results with atomic structure calculations that support the observed lifetimes and decay paths. These long-lived states provide new opportunities in qubit and qudit state detection and optical clocks.

We highlight recent progress in the study of artificial flat band systems with a threefold focus. First, we discuss single-particle flat band physics, which has advanced through the design of various flat band generators. These generators rely on the classification of flat bands in terms of compact localized states - their fundamental building blocks. A related development is the complete real-space description of flat band projectors. Next, we review studies on perturbations of flat bands, which provide new insights into the effects of disorder and, more importantly, the intricate interplay between many-body interactions and flat band physics. Finally, we survey the growing number of experimental realizations of flat bands across diverse physical platforms.

All utility-scale quantum computers will require some form of Quantum Error Correction in which logical qubits are encoded in a larger number of physical qubits. One promising encoding is known as the colour code which has broad applicability across all qubit types and can decisively reduce the overhead of certain logical operations when compared to other two-dimensional topological codes such as the surface code. However, whereas the surface code decoding problem can be solved exactly in polynomial time by finding minimum weight matchings in a graph, prior to this work, it was not known whether exact and efficient colour code decoding was possible. Optimism in this area, stemming from the colour code's significant structure and well understood similarities to the surface code, fanned this uncertainty. In this paper we resolve this, proving that exact decoding of the colour code is NP-hard – that is, there does not exist a polynomial time algorithm unless P=NP. This highlights a notable contrast to some of the colour code's key competitors, such as the surface code, and motivates continued work in the narrower space of heuristic and approximate algorithms for fast, accurate and scalable colour code decoding.

Coherent control of motional degrees of freedom of ultracold atoms in optical lattices offers a promising route towards programmable quantum dynamics with massive particles. We propose and analyze a scheme for implementing coherent rearrangement of ultracold atoms, corresponding to arbitrary unitary transformations on single-particle motional states. Exploiting an analogy between dynamics in optical superlattices and discrete linear optics, we employ the Clements scheme to systematically construct any global $N$-dimensional single-particle unitary from tunneling and phase shifts in arrays of double wells. Tunneling is controlled globally, while local operations are achieved through site-resolved potential shifts. We numerically investigate the susceptibility of the scheme to intensity noise and addressing crosstalk. We identify key subroutines enabled by this unitary construction, including the Discrete Fourier Transform and the implementation of non-native Hamiltonians. Extending the scheme to two dimensions enables all-to-all atomic rearrangement with a circuit depth that scales sublinearly with the atom number, providing a high-density and highly scalable approach to atom rearrangement.