Papers

The detection loophole is a well-known loophole in Bell nonlocality motivated by the inefficiency of detectors used in Bell experiments. However, this inefficiency is actually a ubiquitous feature of any photonic platform for quantum networks since photons are readily absorbed by the surrounding environment. When the quantum system, usually a photon, is lost, what should the parties output? The most natural choice is to fall back to a deterministic strategy where each party produces an output via a function of her local input. In this paper, we study how to choose such a fallback strategy for general Bell inequalities with respect to different efficiencies $\eta$ to maximize the possible violation. We mathematically prove that for the CHSH inequality, there exists a fallback strategy that is optimal for all $\eta$. However, in general, we find that the optimal fallback strategy can vary with $\eta$, sometimes in surprising ways. For example, we find an example of a Bell inequality where the optimal fallback strategy near the threshold efficiency is not an optimal deterministic strategy in the lossless setting. Our results can reduce the efficiency requirements for closing the detection loophole and thus are useful for applications of Bell inequality violation, such as quantum telepathy or device-independent quantum key distribution.

Integer factorization is a central computational problem with important applications in public-key cryptography. Here, we demonstrate a quantum factorization protocol using a superconducting circuit. Microwave drives are used to engineer a highly tunable effective two-level Hamiltonian whose eigenvalues can be measured spectroscopically. The target integer \(N\) and each candidate factor pair (\(p\),\(q\)) are encoded into the amplitudes, frequencies, and phases of the applied microwave fields. By scanning the candidate pairs while monitoring the spectral response at zero energy, we identify the factor pairs of integers up to six digits. The protocol requires neither two-qubit gates nor quantum entanglement. Its performance is currently limited by the precision of microwave control and the finite linewidth of the spectroscopic response. Improved control accuracy and longer coherence times would extend the accessible range of integers.

Crosstalk is one of the major issues for scalability of superconducting quantum processors. But it can also be used by threat actors to intentionally sabotage computations and steal information. This paper analyzes data leakage due to crosstalk during qubit measurement. Prior research yielded an accuracy of 96% in classifying measurement of one qubit in IBM quantum computers. When evaluated on superconducting hardware from VTT, we achieved an accuracy of 71.68% with similar framework. Our extended framework with additional labels yields an accuracy of 76.30% for classifying measurement of one qubit and 53.37% for measurement of two qubits using Support Vector Machine (SVM). Experimental results indicate that measurement operation on a qubit can affect the probability of measuring adjacent qubits. The impact on the target qubit is dependent on the number of neighboring qubits measured and also the measurement outcome.

We show that for positive semidefinite $A$ and $B$ the relative entropy can be written as $D(A\|B)=2\int a\log(a/b)\,\mathrm{d}\mu_{A,B}(a,b)$, where $\mu_{A,B}$ denotes Heinävaara's tracial joint spectral measure. This allows us to obtain a unified derivation of several known integral representations of relative entropy from scalar equalities. Scalar inequalities can be used in the same way to derive Pinsker-type bounds. We further show that the testing curve $t\mapsto \mathrm{tr}[A-tB]_+$ is piecewise affine exactly when $A$ and $B$ commute, which is equivalent to their testing region being a polygon. This gives a characterization of noncommutativity through the curvature. As further applications, we derive inequalities for relative entropy variance and the loss of relative entropy under positive trace-preserving maps.

The Wigner's friend thought experiment raises the question of whether quantum theory can be applied consistently to systems that include observers. Extended Wigner's Friend Scenarios develop this question by considering several observers who may assign different descriptions to the same experiment. In the Local Friendliness (LF) framework, these scenarios lead to experimentally testable inequalities derived from assumptions such as Absoluteness of Observed Events and Local Agency. Motivated by the "Thoughtful" version of the Local Friendliness no-go theorem, which points towards future LF tests with human-level artificial agents implemented on quantum computers, this work implements the "friend" with explicit agent-like functionality within a reversible quantum circuit. Drawing from the literature on Artificial Intelligence, we construct rudimentary agent-like systems and embed them into a one-friend Extended Wigner's Friend Scenario. These agents store measurement outcomes, condition later operations on stored information, and, in the most structured case, use Born-rule probabilities to bet on the outcomes of their own future observations based on past observations. The circuits are simulated ideally and with an IBM-device noise model and executed on ibm_marrakesh. Ideal simulations reproduce the maximal quantum violation of a Local Friendliness inequality up to finite-shot fluctuations, while hardware runs show positive LF violations for all implemented agents. These results provide a first step towards more structured agent-like friend models in LF experiments on quantum computers.

Quantum neural networks (QNNs), one of the fundamental algorithms in quantum machine learning, have been widely used in classification and identification tasks. However, the capabilities of QNNs are constrained by their size, which is determined by the dimension of the Hilbert space of the underlying quantum processor. Multi-level quantum digits (qudits) offer access to a higher-dimensional Hilbert space compared to two-level qubits, enabling the construction of more expressive QNNs. In this work, we report an experimental demonstration of qudit-based QNN using a trapped $\rm ^{40}Ca^+$ ion. We train the QNN using a hybrid quantum-classical implementation of backpropagation and achieve an experimental classification accuracy of $95.7\%$ on a test image set. This demonstration highlights the potential of qudit-based processors to QNN architectures and provides a framework for implementing qudit-based QNNs across various quantum devices.

We propose a tensor-network Monte Carlo (TNMC) approach for unitary evolution following the compression sequence of the time-evolving block decimation (TEBD) algorithm. In the TNMC approach, the obtained results contain evaluable statistical errors rather than truncation errors, unlike ordinary singular-value-decomposition-based methods such as the TEBD algorithm. Consequently, one can estimate unbiased expectation values within statistical errors even with a finite bond dimension. Since the sampling scheme is introduced in the simulations of unitary evolution, the proposed Monte Carlo scheme may suffer from a sign problem. We observe that the sign problem can be mitigated by increasing the bond dimension. We apply the proposed TNMC approach to the Hamiltonian and the Floquet dynamics. Numerical experiments show that the TNMC approach can estimate accurate expectation values of observables even when the TEBD method with the same bond dimension cannot. The proposed approach can be a new direction for improving the classical simulatability of unitary evolution.

Quasi-exactly solvable (QES) deformations of harmonic and singular oscillators have been widely studied via a range of approaches. In this paper, we obtain families of new QES deformations of solvable quantum systems associated with exceptional orthogonal polynomials (EOPs). The construction builds upon the theory of Darboux-Crum transformations and the classification of exactly solvable quantum systems associated with EOPs of Hermite type. It is shown that the deformations break the exact solvability of the undeformed systems and introduce model parameters into the deformed systems that permit the existence of a finite number of polynomial solutions whose roots satisfy systems of algebraic equations. The new families presented and studied consist of deformations of quantum systems related to Hermite EOPs of type III with arbitrary codimensions. We present polynomial and rational deformations and analyze, in each case, the conditions for quasi-exact solvability in terms of Bethe ansatz equations and parameter constraints. In general, the structures of the underlying polynomial solutions are no longer associated with well-known classical orthogonal polynomials. So for the general cases, we mainly focus on presenting the new approach as well as the Bethe ansatz equations and the constraints for model parameters. As applications, we construct particular families of QES deformations related to solvable models allowing one, two, and up to four gaps, and obtain the closed form expressions for their wavefunctions and spectra. We analyze the existence of QES solutions in the spaces of model parameters, providing information on the number of solutions for given parameters.

To prove the quantum soundness of the classical low-individual-degree test, the authors of \cite{JNVWY20LID} defined three subtests, namely the axis-parallel lines test, the self-consistency test, and the diagonal-lines test. An interesting question is whether the diagonal-lines test can be removed. In this paper, we show that the diagonal-lines test cannot simply be removed without another compatibility mechanism. Consequently, replacing the "conditional linear functions" by "coordinate deletion functions" in the proof of MIP*=RE, as mentioned in \cite{JNVWY20LID}, does not by itself preserve the required soundness. The authors of \cite{JNVWY20LID} found an example that requires the diagonal-lines test when \((m, d, q) = (2, 2, 4)\); we give an example when \((m, d) = (2, 2)\) and \(q\) is any odd prime.

We show that the small value of the neutrino cross-section rules out superradiance in the laboratory.

In this work, a QCD-inspired effective model describes dark-state interference in a confined three-state system with two low-energy $Q\overline{Q}$ states, $|1\rangle$ and $|2\rangle$, and a gluon-excited hybrid state, $|H\rangle$. A stationary chromoelectric flux-tube background enters the unperturbed Hamiltonian, while a time-dependent chromoelectric perturbation couples $|1\rangle$ and $|2\rangle$ to $|H\rangle$ in a $\Lambda$-type configuration. Under two-photon\footnote{We retain standard terms like “two-photon” from the EIT literature only by mathematical analogy, but they do not refer to electromagnetic photons but to the effective frequencies and energy mismatches of chromoelectric perturbations and gluonic excitations that connect confined states.} resonance and within a Markovian Gorini-Kossakowski-Sudarshan-Lindblad master equation, the system forms a coherent superposition that decouples from $|H\rangle$, strongly suppressing the steady-state probe susceptibility $\operatorname{Im}\chi_{\text{CE}}$ as lower-state decoherence vanishes. A phenomenological non-Abelian correction to the hybrid energy mainly shifts and reshapes the transparency window rather than creating the interference itself. The model is not a first-principles QCD calculation of medium opacity but a controlled effective link between dark-state interference in quantum optics and reduced confined color dynamics.

The Variational Quantum Eigensolver (VQE) requires a large number of measurements to evaluate molecular Hamiltonians. Expressing a molecular Hamiltonian as a linear combination of Pauli strings creates a measurement bottleneck: non-commuting Pauli strings cannot be measured simultaneously. Consequently, mutually commuting Pauli strings must be grouped and measured together to minimise the number of quantum-state preparations. This task maps to the minimum clique cover problem on a commutativity graph, an NP-hard problem typically addressed using classical heuristics. Although an Ising-model formulation has recently been explored on fully connected CMOS Ising machines and demonstrated on physical quantum annealers only at small scale, the embedding cost that governs its behaviour on hardware with sparse connectivity, where each logical variable must be represented by a chain of physical qubits, has not been characterised. In this work, we formulate the Pauli-grouping problem as a standard QUBO colouring model and study its scalability on a D-Wave quantum annealer. Across a series of molecular systems and for both qubit-wise and full commutativity, we quantify the growth in the number of logical variables and the QUBO interaction density, characterise the physical-qubit and chain-length overhead required for embedding on the Zephyr topology, and compare the annealer's time-to-solution and solution quality with those of heuristic classical baselines. This analysis identifies the threshold of molecular complexity beyond which hardware connectivity prevents viable embedding, and shows that a second, practical limit is reached earlier. The threshold therefore measures how far current annealers are from the regime in which pre-optimising a VQE measurement scheme on hardware would be worth considering.

Positive Wigner functions can have less Shannon entropy than the vacuum, even arbitrarily close to the vacuum state. We construct physical counterexamples and identify the competition that controls their entropy: the relative entropy to the vacuum phase-space density can exceed twice the mean photon number. A two-level family exhibits a finite window in which coherence lowers entropy while preserving global Wigner positivity. A complementary construction repairs a remote negative tail with an exponentially small thermal admixture; an explicit mixing weight of $2\times10^{-21}$ preserves a rigorously established entropy decrease. Optimisation over all one-mode Wigner-nonnegative states gives the sharp low-energy scale $E^\gamma/[\ln(1/E)]^\beta$, with $\gamma\simeq0.7412$ and $\beta\simeq0.5861$. Because $\gamma<1$, tensor products can have vanishing total energy and trace distance from vacuum while their entropy deficit diverges. We derive the exact half-transmission threshold for universal Shannon-entropy recovery and connect it to companion results showing residual non-Gaussian structure. The counterexamples reveal distinct controls on entropy: coherence sets the local descent, mode number amplifies it, and loss restores the vacuum bound.

Cooling a quantum state presents a challenge as the external control in active protocols can induce detrimental heating in the system. Passive cooling processes offer a valuable alternative: Here, we present a simple quench protocol to cool a set of qubits with access to an ancillary spin chain. We show that excitations can be transported out of the qubits as quasi-particles, taking the form of magnons in a ferromagnetic ancilla and triplons in a dimerized antiferromagnetic ancilla. This quasi-particle transport mechanism enables cooling towards both individual and highly entangled two-qubit target states. We demonstrate that this cooling mechanism remains robust starting from thermal states and with finite quench ramp times.

Dissipation has been recently demonstrated as a powerful primitive for designing quantum algorithms. We apply this viewpoint directly to linear-system solving, $Ax=b$. We construct a simple purely dissipative Lindbladian whose unique fixed point encodes the linear-system solution. We prove dimension-independent trace-distance mixing in $\Theta(\kappa^2\log(1/\eps))$ time. We then show how to run this Lindbladian on digital quantum computers via collective block encoding and Lindbladian simulation, resulting in an $O\!\left(\kappa^2\log(1/\eps) \frac{\log(\kappa/\eps)}{\log\log(\kappa/\eps)}\right)$ query complexity for both $U_A$, the block encoding of $A$, and $U_b$, the $|b\rangle$ state preparation unitary.

Matching-based decoding is widely used in quantum error correction, and accelerating it is key to enabling fast and scalable fault-tolerant quantum computation. Minimum-weight perfect matching (MWPM) decoding provides rigorous guarantees for error suppression, while sparse blossom enables its practical implementation at modest problem sizes. However, the runtime of existing sparse-blossom implementations unavoidably increases with problem size, motivating a rigorous parallelization framework that guarantees correctness and a runtime shorter than the syndrome-extraction timescale. Here, we present such a framework and prove that the resulting parallel sparse-blossom algorithm produces the same correction as the original, non-parallel sparse blossom. For the rotated surface code with code distance $d$ and physical error rates below a finite threshold, we prove that the average parallel runtime of decoding for $O(d)$ rounds of syndrome extraction is upper bounded by a quasi-polylogarithmic function of $d$. For a $d$-round decoding window, this implies that the average parallel runtime per round is $o(1)$. We also perform numerical simulation to identify conditions under which the parallel runtime per round decreases with increasing code distance. These results suggest that increasing code distance need not lead to longer parallel decoding times, providing a foundation for scalable parallel matching-based decoding.

We introduce a keyless coding/cryptographic primitive that asks for two guarantees at once: the receiver is never fooled into accepting a message other than the one sent, and the adversary learns nothing about the message unless the receiver aborts. Neither the sender nor the receiver holds a secret key, and no computational hardness is assumed. The only restriction is on the adversary's online computation: the receiver aborts if nothing arrives by a fixed deadline, so the adversary must forward something before it, and her map in that window is computed by a circuit of size (or depth) at most $p$; before and after, she is unbounded. For every polynomial $p$ we construct such an efficient quantum scheme, encoding $k$-bit messages into $n = O(k)$ qubits with circuits of size $\mathrm{poly}(n,p)$. No classical scheme achieves this type of everlasting security, at any choice of parameters. Our techniques also resolve open questions about universal tamper detection against families restricted in cardinality rather than in circuit size. We settle a question of Broadbent, Kapshikar and Rochette on relaxed tamper detection. As a corollary, we obtain the first efficient non-malleable code secure against global quantum tampering, with no split-state restriction, whereas the current constructions in the literature require the codeword to be split into non-communicating shares.

We study the problem of tomography for $k$-sparse quantum states. In contrast to classical distribution learning, where tight sample and time complexity bounds in terms of support size are well understood, no non-trivial bounds were previously shown for this problem. We give the first near optimal algorithm for learning $n$-qubit $k$-sparse pure quantum states, obtaining fidelity at least $1-\varepsilon$ with high probability using $\tilde{O}(k/\varepsilon)$ copies of the state and $\tilde{O}(kn/\varepsilon)$ time. Both bounds are optimal up to polylogarithmic factors. As an implication, we also obtain an algorithm with near optimal $\tilde{O}(kr/\varepsilon)$ sample complexity for learning $k$-sparse rank-$r$ mixed states, via the random purification channel technique. Obtaining time complexity nearly matching the sample complexity, for $r>1$, remains an important open question.

Optical decoherence degrades quantum correlations in squeezed states of light, severely limiting the quantum-nondemolition (QND) sensitivity of gravitational-wave detectors. Here, we propose the path-degenerate quantum interferometry scheme that obviates the need for entire optical subsystems—including additional filter cavities, auxiliary parametric amplifiers, and Faraday isolators—thereby drastically reducing spatial mode mismatches while inherently integrating variational output, a long-standing theoretical proposal to further deepen the QND regime. We experimentally demonstrate a core aspect of this scheme, achieving a shot-noise-preserving signal enhancement that directly counteracts the detrimental effects of readout loss. By delivering an improved signal-to-quantum-noise ratio solely through the consolidation and reduction of currently considered optical subsystems, our approach offers a highly optimized route toward enhanced quantum-noise reduction in upcoming LIGO upgrades and next-generation gravitational-wave observatories.

A correlated multichannel computation of the generalized oscillator-strength density for electrons scattering off randomly oriented molecular hydrogen at the internuclear separation of 1.4 $a_0$ is being presented. The numerical procedure features a novel free-boundary method based on configuration interaction of ionic orbitals expanded in B splines using prolate-spheroidal coordinates. Satisfactory agreement between the present and both experimental as well as other theoretical results has been found, thus providing a view on the Bethe surface for energy transfers up to of 558 eV. The systematic and robust convergence behavior of the method further allowed for assessing the validity of the binary-encounter approximation, providing a confirmation of experimentally determined Compton defects for H$_2$ using a single consistent theoretical description. Overall, the present findings are expected to be helpful for calculating highly accurate energy-loss spectra for fast electrons passing through and ionizing molecular hydrogen gas or its isotopologues.

Today's quantum processors have tens to hundreds of physical qubits, but reliable execution of arbitrary circuits remains limited to fewer than 30 entangled qubits across hardware modalities. Building upon prior work, we introduce an error- and topology-aware method for mapping multiple independent circuits onto disjoint regions of a single large-scale QPU for parallel circuit execution. For applications with many similarly sized circuits, such as observable estimation for Hamiltonian simulation, this approach can reduce billed QPU execution time, with ideal speedup proportional to the number of usable partitions. We demonstrate the approach on IBM's 156-qubit ibm_boston processor using standard QED-C benchmark and Hamiltonian-based observable-estimation workloads. Compared with standard sequential execution, parallel execution reduces billed execution time by 3.5-5.5x while retaining 83-92% of the sequential fidelity. We further evaluate the scaling of parallel circuit execution using GPU-accelerated classical simulation, distributing measurement circuits across GPUs via MPI. Using CUDA-Q on the NERSC Perlmutter system, we achieve up to 13.8x speedup on 16 GPUs (86% parallel efficiency) for an H2 electronic-structure simulation, with scaling evaluated across multiple Hamiltonians and circuit counts. These results provide an indication of the performance ceiling that parallel execution on future quantum hardware may eventually approach. Both execution modes are implemented as a runtime option within the QED-C Application-Oriented Benchmark suite. Together, the results show that circuit-level parallelism can reduce execution cost on current quantum hardware and simulation time on GPU clusters, with the potential for greater benefits as device quality and qubit counts increase.

Quantum computing hardware is advancing rapidly toward utility-scale machines that will enable scientific breakthroughs. Many teams are pursuing distinct and difficult-to-compare routes to this goal, using different qubit technologies and logical architectures. Tracking progress toward quantum utility therefore requires rigorous benchmarks that measure computational capability relative to utility-scale challenge problems and enable fair comparison across disparate platforms. Here we demonstrate direct, cross-platform measurement of quantum computational capability using a new benchmark that quantifies the size of the largest computationally relevant quantum circuits that a machine can execute successfully and the speed at which it can execute them. We apply this quantum universal operation performance system (QUOPS) experimentally to leading processors from Quantinuum, Google, and IBM, computing directly on physical qubits. Translating state-of-the-art resource requirements for recognized challenge problems that represent useful quantum computation into effective QUOPS circuit sizes shows that computational capability must grow by 5 orders of magnitude, motivating fault-tolerant approaches. We use the same benchmark to assess the performance of a simple fault-tolerant logical-qubit processor implemented on up to eight [[7,1,3]]-encoded logical qubits using Quantinuum Helios-1, and project the growth of capability across successive generations of fault-tolerant quantum computers to show how QUOPS can track progress toward quantum scientific utility.

In an open, $U(1)$-symmetric Dicke model with chiral atom-cavity couplings, we show that dissipation drives two limit-cycle phases of opposite chirality in the thermodynamic limit, obtaining exact analytical solutions. These phases are separated by a $U(1)$-broken superradiant state, lending the phase diagram a topological character, and persist under $U(1)$-preserving perturbations, making them candidates for chiral continuous time crystals. In addition to stable normal and inverted steady states, the model also exhibits multistability, where the long-time dynamics is set by the initial state. Our results establish dissipation as a resource for inducing chiral dynamical order in light-matter coupled systems.

A previously unexplored scheme is devised for creating and certifying coherent quantum superposition of distinctly separated states of a spin-tagged massive object passing through a confined uniform magnetic field. This results in entangling the spatial and spin parts of a two-component Pauli wavefunction such that the entailed coherence can be conveniently certified by spin measurements alone. The implementability of this scheme is analysed using NV-centre nanodiamonds of masses $\sim 10^{10}$ amu based on the current technological capabilities.

We construct an explicit transition matrix that exactly describes code-adapted basis-population dynamics of stabilizer codes under circuit-level stochastic Pauli noise. The matrix is expressed in a code-adapted basis that captures probability flow between logical-basis labels and syndrome sectors. For quantum error detection (QED), we incorporate post-selection by aggregating rejected outcomes into an absorbing state, so that a single transition matrix represents a full clock cycle of gates, syndrome extraction, and post-selection. Additionally, we characterize when protocol symmetries permit exact lumping to simpler, more interpretable models. The transition matrix framework enables direct application of classical stochastic-matrix techniques to analyze multi-cycle QED protocols. First, we identify a leading-order obstruction to a stationary logical-only accepted-map description, and quantify the accepted leakage injection from QED-check imperfections that causes it. Second, we express leading-order QED efficiency as a function of check frequency in terms of physically meaningful parameters, and prove that less frequent checks improve efficiency to leading order. We evaluate the framework on the $[[4,2,2]]$ and $[[5,1,3]]$ codes under depolarizing gate noise and readout errors: transition-matrix predictions agree with million-shot Stim Monte Carlo at the scale of the reported confidence intervals, and matrix-computed results illustrate the first-cycle transient and interval-dependent efficiency. More broadly, the transition-matrix formalism provides both an analytical foundation for QED analysis and an interpretable tool for understanding code behavior under realistic noise.

Finite-component light-matter systems realize dissipative phase transitions in a single controllable atom-cavity setup, but how atomic dephasing - ubiquitous in real cavity- and circuit-QED devices - affects this criticality remains unknown. We study the anisotropic open Rabi model under cavity decay, spontaneous emission, and atomic dephasing together. We show that when spontaneous emission stabilizes a long-lived metastable superradiant phase, atomic dephasing actively competes with it - eroding its coherence and shortening the lifetime. This direct competition reveals that a dissipation channel's microscopic character, not its strength, controls its nonequilibrium criticality - a distinction directly tunable via independent spontaneous-emission and dephasing rates in circuit-QED and trapped-ion platforms.

Ultracold atomic systems offer a highly controllable platform for investigating quantum state transfer through the precise dynamical manipulation of system parameters. While quantized Thouless pumping has been extensively explored in these systems, adiabatic edge-to-edge transfer of localized quantum states remains largely unexplored. Here, we consider a one-dimensional ultracold atomic gas confined in a bichromatic optical lattice realizing a quasiperiodic Aubry–André–Harper system. We use its edge-localized winding states to implement quantum state transfer between opposite boundaries. Starting from the instantaneous spectral properties of the corresponding tight-binding model, we construct locally adiabatic protocols and extend the approach to higher protocol orders. We then simulate their dynamics under the full continuum bichromatic-lattice Hamiltonian. Our results reveal a tradeoff between edge localization and the minimum spectral gap: strongly localized states require longer transfer times, but can benefit substantially from higher protocol orders. We are also able to capture the main fidelity trends and coherent oscillations over a broad parameter regime using an effective two-level Landau–Zener description. Our results provide practical guidelines for selecting experimentally accessible parameters and tailoring quantum transfer protocols in quasiperiodic ultracold atomic systems.

We study an entanglement transition at logarithmic depth in random hypercube linear optical networks. Starting from an initial Gaussian state with all modes squeezed, we prove that random hypercube linear optical networks on $n$ modes generate ensemble-averaged subsystem entanglement within a constant factor of its maximum in all subsystems at circuit depth $\Theta(\log n)$. Below depth $\log_2n$, there is an extensive subsystem with no entanglement. The entanglement generation in logarithmic depth can be compared to recent progress towards $O(\log n)$ depth average-case sampling hardness for Gaussian boson sampling in a hypercube network.

We study invertible phases protected by non-onsite symmetries carrying nontrivial lattice anomaly indices. While lattice anomalies are usually viewed as obstructions to symmetric short-range-entangled (SRE) states, we show that anomalous lattice symmetries can nevertheless admit invertible phases that are not SRE, and can moreover shift the set of symmetry-compatible invertible phases. In particular, we consider a fermionic $\mathbb Z_4^F$ symmetry in (2+1) dimensions. For an onsite $\mathbb Z_4^F$ symmetry, symmetric invertible phases have integer chiral central charge $c_-\in\mathbb Z$, whereas a non-onsite symmetry with nontrivial lattice anomaly index obstructs all such phases despite having trivial continuum 't Hooft anomaly. We resolve this by constructing an exact exponentially quasi-local $\mathbb Z_4^F$ symmetry of a $p+ip$ superconductor with $c_-=1/2$. We compute its lattice anomaly, and find that the symmetry indeed forbids $c_-\in \mathbb{Z}$ invertible states. The allowed invertible phases are consequently shifted to $c_-\in\mathbb Z+1/2$. By gauging the fermion parity of the $p+ip$ superconductor, one obtains an Ising topological order enriched by a $\mathbb Z_4$ symmetry. We describe the corresponding symmetry structure in terms of a fusion 2-category. We further show that the $p+ip$ state admits an enlarged non-onsite $U(1)^f$ symmetry, providing an analogue of fractional quantum Hall response in an invertible phase. This non-onsite $U(1)^f$ symmetry again forbids Chern insulators carrying $c_-\in\mathbb{Z}$, while being compatible with invertible states with $c_-\in\mathbb{Z}+1/2$. This result motivates a systematic study of new classes of invertible phases and spin liquids enriched by non-onsite symmetries.

A key subtask of quantum error correction is to extract a syndrome that, if nontrivial, signals an error. The number of possible ways to extract a syndrome grows exponentially with the syndrome size, and these implementations vary greatly in fault tolerance, as measured by their logical error rates. This creates a natural search problem: find an implementation with a low logical error rate. Previous work solves this problem but sacrifices either solution quality or scalability. In this paper, we use reinforcement learning and importance sampling to outperform previous work at all scales. Compared with the state of the art automatic scheduling tools AlphaSyndrome and PropHunt, our tool reduces the logical error rate by 25.9% and 71.7% on average, respectively, culminating with a reduction of 97.8% for a surface code with distance 15.