Papers

Quantum error-correcting codes (QECCs) sit between noisy quantum hardware and reliable computation, so the code parameters used in practice must be trustworthy. The single number that summarizes a code's strength is its distance, yet certifying a distance lower bound is NP-hard in general, placing it beyond the reach of pen-and-paper proofs as well as direct proof-assistant scripting. As a result, distance values in the literature come either from non-scaling hand proofs, or from unverified solvers that leave a trust gap exactly where the code is supposed to provide a guarantee. We present Lean-QEC, the first Lean 4 formalization of stabilizer-code theory that delivers end-to-end, machine-checked distance certificates at industrial code sizes. Lean-QEC formalizes the linear algebra of qubit states, the Pauli group, stabilizer codes, the binary symplectic representation, classical coding theory, and the CSS and Bivariate Bicycle families. To break the combinatorial barrier, Lean-QEC translates the distance condition into a Boolean satisfiability formula through a verified reduction. The pipeline scales through a BitVec-flattened encoding that replaces Lean's Matrix representation, and an error-location encoding that reduces the variable count from $n$ to $k\lceil \log_2 n\rceil$. With these, we obtain automatically-generated Lean-checked distance proofs for a large range of industrially viable qLDPC codes within the Bivariate Bicycle and Generalized Bicycle families, including [[90, 8, 10]] and [[70, 6, 9]] BB codes, with the formulation scaling up to 144 qubits when performed outside the Lean kernel. The resulting library is reusable and is designed to plug into broader Lean-based efforts toward end-to-end verification of fault-tolerant quantum computation.

We examine the correspondence principle for an equiprobable superposition of high-energy eigenstates of the infinite square well using a fully analytical Fourier-based approach. We derive a closed-form asymptotic expression for the interference terms $\rho_{\alpha}^{\text{a}}(x)$ by expanding them into a geometric series of quantum Fourier coefficients. We show these terms act as functional envelopes that do not vanish individually but become asymptotically equivalent in the large-$n$ limit. Furthermore, we prove the total probability density for a superposition of $2\Delta+1$ states converges exactly to the uniform classical distribution as $\Delta \to \infty$. Dynamically, the expectation value of position reproduces the classical triangular trajectory asymptotically. Residual quantum deviations remain confined to boundary layers whose relative width vanishes under macroscopic resolution. These results establish a rigorous asymptotic realization of the classical limit for isolated bound systems in both static and dynamical contexts.

We present Quokka#, a versatile, open-source Python library for quantum circuit analysis. Quokka# reduces various simulation, verification, and synthesis tasks to weighted model counting (#SAT). It supports universal quantum circuits and a wide variety of gates. Quokka# provides multiple encodings based on different algebraic bases and equivalence-checking methods, enabling key performance trade-offs. Moreover, the new version of Quokka# adds approximate equivalence checking, which is crucial in its synthesis algorithms, since it enables translation between arbitrary gate sets. Its synthesis engine is depth-optimal, making it well-suited to real-world quantum computing. This paper demonstrates the design, extensibility, and use of Quokka#.

The generalized quantum Stein's lemma provides an explicit expression for the optimal error exponent when distinguishing many independent and identically distributed (iid) copies of a given bipartite state from the set of separable bipartite states. Here we prove that this result is robust, in the sense that the iid assumption can be relaxed to almost-iid. In particular, our result shows that the original argument of Brandão and Plenio, which contains a logical gap, can be made rigorous. Our proof relies on a novel continuity bound for the relative entropy of entanglement with respect to the quantum Wasserstein distance. Combined with a recent insight that almost-iid states and their exact iid counterparts are asymptotically close in this distance, the bound implies that their relative entropies of entanglement coincide asymptotically.

Open quantum systems can host dark or subradiant states whose decay is highly suppressed. While these states have been extensively studied in the few-excitation regime, their impact on the many-body dynamics remains largely unexplored. Here, we study a spin chain subject to correlated dissipation on neighboring sites, which admits a single-particle dark state at zero momentum. We show that the single-particle dark state qualitatively alters the many-body dynamics at long times, and identify its distinct universal behavior. While the zero-momentum mode is dark at the single-particle level, it decays slowly as $1/\log t$ as it becomes dressed by other modes through a dissipation-induced nonlinearity. We demonstrate that the momentum distribution takes a universal scaling form in $k\sqrt{t}$, and the total density decays as $1/\sqrt{t}\log t$. Our results further elucidate the origin of the conflicting results in recent works. Finally, we corroborate the analytics with matrix product state simulations and show that the same universal behavior persists for soft-core interactions, underscoring the universality of the emergent dynamics.

Quantum teleportation have a central role in quantum information science and allows transferring of an unknown quantum state through entanglement and classical communication. Unfortunately, the interaction with external and internal noise severely affects the quality of teleportation and poses limitations on practical applications of quantum communication networks. In this work, instead of conventional Bell teleportation, we introduce a Machine Learned adaptive protocol for optimizing multiple components of Quantum Teleportation in order to achieve higher fidelity in various noise environments. In order to demonstrate the performance of the proposed scheme, we study three different noise models, including bit-flip, amplitude damping, and depolarizing noise, both in case of single-qubit and two-qubit channels. As a result, we observe substantial improvement in the teleportation fidelity in comparison to the classical Bell-state teleportation protocol in certain noise conditions. Furthermore, the machine-learned protocol reveals a nontrivial strategy for compensation of decoherence and information losses. In addition, obtained results indicate the flexibility and reliability of the proposed framework for implementing various adaptive quantum communications while shedding light on possibilities of discovery of optimal quantum algorithms by means of automated approache

Traditional entanglement distillation follows a post-processing paradigm, a noisy quantum state, after full transmission through a noisy channel, is treated as a static resource to be purified via LOCC (local operations and classical communication). This work demonstrates a fundamentally different paradigm,pre-channel entanglement shaping (PES) – actively engineering the system-environment coupling before or during channel transmission – achieves a level of purification capability that is physically unattainable by any post-distillation protocol. We prove this separation using the framework of geometric entropy (quantum relative entropy to separable states). In post-distillation, the protocol can only select low-entropy sub-ensembles from a fixed mixed state, leaving the global geometric entropy unchanged or increased. In contrast, PES suppresses the rate of geometric entropy production during channel evolution, resulting in a final state whose relative entropy of entanglement strictly exceeds the maximum achievable by post-distillation from the same channel. We provide explicit qubit channel examples, numerical simulations (with complete code in Appendix), and a geometric interpretation on the state manifold. Our result establishes pre-channel entanglement shaping as a distinct operational resource class, with immediate implications for quantum repeaters and entanglement-assisted communication. Very recently, Li et al. experimentally demonstrated that preprocessing the entangling channel with optimally tailored local unitaries achieves entanglement fidelities unreachable by any postprocessing, revealing an intrinsic temporal asymmetry in entanglement distillation~\cite{Li2025}.

Interference and entanglement are among the most fundamental properties of quantum mechanics. In this work, we investigate the power of interference in the role of detecting entanglement in the context of quantum Merlin-Arthur verification. In particular, we show that unentanglement gives no additional power to stoquastic Merlin-Arthur proof systems, whose restriction to a classical gate set results in entrywise non-negative acceptance operators and non-negative optimal witnesses, therein removing destructive interference from the verification process. Our results show that for any polynomial number of unentangled witnesses $k = k(n)$, \[ \mathsf{StoqMA}(k) = \mathsf{StoqMA}. \] The analytic core of this result is a new non-negative de Finetti theorem for separately bosonic states. If a mixed state $\rho$ is supported on the tensor product of symmetric subspaces of $\mathcal{H}_1^{\otimes R} \otimes \mathcal{H}_2^{\otimes R} \otimes \cdots \otimes \mathcal{H}_k^{\otimes R}$ then there exists a separable state $\tau$ on $\mathcal{H}_1 \otimes \cdots \otimes \mathcal{H}_k$ such that \[ \mathrm{Tr}\big(M(\rho_{\mathcal{H}_1 \otimes \cdots \otimes \mathcal{H}_k} - \tau)\big) \le 2 \sqrt{\frac{k\, \log_2\dim(\mathcal{H}_1 \otimes \cdots \otimes \mathcal{H}_k)}{R-1}}, \] simultaneously for all non-negative effects $M$. For any such operator $M$, one can define the separately symmetric lift $\mathrm{SS}_R(M)$ whose largest eigenvalue approximates the maximum acceptance probability of $M$ over product states within the same error bound. Such a lift can be approximated by a stoquastic verifier, giving that product-state constraint of $\mathsf{StoqMA}(k)$ verifiers can be absorbed into a polynomially larger one-witness $\mathsf{StoqMA}$ verification, while preserving an inverse polynomial completeness-soundness gap.

Softmax and related normalized response functions are widely used in choice theory, machine learning, and cognitive science. In non-Boolean event structures with overlapping contexts, however, local normalization does not automatically yield a global probability weight. We show that imposing single-valuedness on shared atoms – equivalently, no-disturbance or consistent connectedness – collapses generalized softmax rules to coordinate parametrizations of the strictly positive part of the admissible-weight polytope. Any strictly positive admissible weight can be represented in this way, while boundary weights arise as limits. Exotic weights that exceed classical or quantum bounds are therefore properties of the event structure and the chosen weight, not of the normalizing link. The resulting hierarchy separates local normalization, cross-context gluing, Cauchy–Gleason linearity, and physical or cognitive realizability.

The Boolean Satisfiability (SAT) problem is a canonical NP-complete problem and a natural candidate for quantum acceleration via search-based algorithms. In Grover-based quantum SAT solvers, the dominant computational cost stems from the construction of a reversible oracle that evaluates the Boolean formula, rendering the choice of SAT encoding crucial for overall quantum resource efficiency. Although SAT instances are conventionally expressed in Conjunctive Normal Form (CNF), such encodings typically translate into quantum circuits with significant qubit overhead and high non-Clifford gate complexity. In this work, we investigate an Exclusive-Sum-of-Products (ESOP)-based CNF (e-CNF) representation tailored for quantum SAT solving and analyze its impact on oracle construction. We derive tighter upper bounds on qubit requirements and Clifford+$T$ gate counts for Grover-based SAT solvers when e-CNF encodings are employed in place of standard CNF. In addition, we propose a scalable transformation from Boolean formulas to e-CNF and present a systematic procedure for interpreting e-CNF representations as reversible quantum circuits suitable for oracle implementation. Experimental evaluation on representative SAT benchmarks demonstrates that the proposed e-CNF-based approach yields substantial and consistent reductions in quantum resources, including qubit count, T-gate complexity, and circuit depth, when compared to CNF-based oracle constructions. These results establish e-CNF as an effective quantum-aware SAT encoding that significantly improves the practicality of oracle-based quantum SAT solving.

We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity $\widetilde{\mathcal{O}}(\nu \mathcal{L} t/\epsilon)$, where the constant $\nu$ depends on the problem parameters, $\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $\epsilon$ is the error. In particular, $\nu \mathcal{L}$ is linear in $t$ for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of $\Omega(\nu \mathcal{L} t/\epsilon)$ for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.

We present a quantum algorithm for solving algebraic Riccati equations, with applications to quantum-chemical random-phase approximation (RPA) and higher-order RPA theories. Our method block-encodes stabilizing Riccati solutions via Riesz projectors onto invariant subspaces of an associated non-normal matrix, implemented using contour-integral resolvents and quantum singular value transformations. Applied to $m$-particle, $m$-hole RPA, our algorithm yields a block-encoding of the amplitude solution and estimates the electronic correlation-energy density with it. Under localized-orbital sparsity assumptions, the end-to-end cost scales linearly with system size and polynomially with excitation rank $m$, suggesting an exponential advantage in $m$ over plausible classical local-correlation heuristics. More broadly, this work provides a framework for quantum algorithms for nonlinear matrix equations in quantum chemistry and opens a possible route toward developing quantum algorithms for coupled-cluster theory.

We find solutions to consistent truncations of supergravity where some real scalars are analytically extended to imaginary values, ensuring the metric remains real-valued. Among the solutions there are Lorentzian traversable wormholes connecting two asymptotically Anti-de Sitter spacetimes and flows that have a real metric also when uplifted to ten or eleven dimensions. We argue that the holographic duals are pseudo-Hermitian and $PT$-symmetric theories. Wormhole solutions also admit an interpretation as the low-energy theory of two stacks of branes and antibranes after tachyon condensation. The wormhole is then dual to an entangled state of two copies of the theory that lives on a stack of branes. We present some evidence by computing the mutual information between the theories at each boundary and by identifying the Goldstone bosons associated to the breaking of the two copies of Poincaré symmetry to their diagonal subgroup.

Quantum measurements can be incompatible, i.e., they can fail to be jointly measurable. Recently, a weaker notion of joint-measurability, called partial joint-measurability, was proposed by Masini et al. in [Quantum 8, 1574 (2024)]. In this work, we further generalize this notion to the setting where only a subset of the outcomes of each measurement is required to be jointly determined by classical variables. We provide two mathematical formulations of partial joint-measurability and show that, like full joint-measurability, it can be decided by solving a single semidefinite program. We prove that in the case of an untrusted measurement device, an adversary Eve, limited to classical side information, can perfectly guess the outcomes of the measurement device if and only if the set of measurements is partially jointly measurable. We derive analytical thresholds on the detection efficiency below which generic measurements become partially jointly measurable. Such bounds directly yield limits on the robustness of device-independent and semi-device-independent quantum cryptographic protocols against detection inefficiency. In particular, our results highlight the importance of a careful treatment of postselection in security analyses.

We consider the quantum creation of a closed universe within the Euclidean path-integral formalism. An analytical expression for the tunneling probability is derived, including both the exponential suppression and the exact Gaussian prefactor due to quadratic fluctuations around the instanton. The calculation is performed in a fixed-interval minisuperspace formulation, where the Hamiltonian constraint is imposed at the level of the classical instanton, while the full lapse integration is not included beyond the leading semiclassical approximation. The result provides a transparent and self-consistent semiclassical estimate of the nucleation rate, refining previous analyses with the inclusion of Gaussian fluctuations.

A reason is discussed (may be not the only one) for why we do not see any superposition of macroscopic states in the real world. Under the general assumption that quantum macrostates are statistical ensembles of microstates, it is shown that any superposition of macrostates is reduced in a very short time by the unitary dynamics of the ordinary Schrödinger equation, deducing the Born rule without having to postulate it. In more detail, the macroscopic and microscopic degrees of freedom are decoupled in the Schrödinger equation, yielding an effective stochastic equation for the macroscopic variables, with the ensemble average of the microscopic amplitudes that acts as a self-generated internal white noise. The stochastic equation is shown to be a reducing Itô equation if some general causality conditions are met, predicting a very quick collapse of any macroscopic superposition upon formation, with probabilities which satisfy the Born rule. In the context of the von Neumann measurement scheme, the relevance of the result is discussed as a simple dynamical solution of the measurement problem.

Inter-core skew (ICS), the differential group delay between cores of a multicore fiber (MCF), is a critical parameter for both classical space-division multiplexed communications and quantum photonic networks. We present a high-precision measurement of ICS in a commercially available four-core fiber using two-photon Hong–Ou–Mandel (HOM) interference in a fiber-integrated $4\times4$ multiport beam splitter. By extracting the center position of HOM interference dips and peaks across all twelve core-pair combinations, we obtain individual ICS values with a demonstrated precision of $\pm0.11\,$ps, limited by the delay-stage positioning uncertainty. The root-mean-square ICS grows as $\sigma_\tau(L) = \kappa\sqrt{L}+c$ with $\kappa = 48.7 \pm 2.5\,\mathrm{ps}/\!\sqrt{\mathrm{km}}$ and $c = 9.76 \pm 1.2\,$ps, over fiber lengths from $7.7\,$m to $1300\,$m. This first direct validation of the stochastic random-walk scaling across a length range spanning laboratory to field-deployed scales was made possible by HOM's immunity to first-order path fluctuations, which renders classical interferometric methods impractical for long installed fibers. The demonstrated $\pm0.11\,$ps precision represents a $\sim\!180$-fold improvement over correlation optical time-domain reflectometry (C-OTDR), the standard method for long-fiber ICS characterization. Fisher information analysis establishes a fundamental Cramér–Rao precision limit in the femtosecond range, indicating further improvement is achievable with better delay control. These results establish a practical platform for characterising timing uniformity in MCF-based networks for both quantum and classical space-division multiplexed applications.

Dicke superradiance by an ensemble of quantum emitters produces a collective burst of radiation, but no entanglement in the mixed state of the emitters. We show that adding a local kinetic constraint between the emitters generates extensive mixed-state entanglement, while otherwise preserving all key features of Dicke superradiance. Specifically, for any local Boolean constraint, we analytically derive a lower bound for the emission rate which implies a peak intensity $\propto N^2$ and a peak time $\propto (\log N)/N$ with number of spins $N$. This effect enables the superradiantly accelerated preparation of entangled dark states. Hereby, Hilbert-space fragmentation of the Dicke ladder leads to an exponentially branching decay tree that generates a hierarchy of dark states. Importantly, these disconnected manifolds include exponentially many long-range entangled singlet dark states. The explored kinetic constraints and superradiant dynamics can be realized in neutral-atom arrays coupled to an optical cavity, and we suggest a simple and accessible witness to detect the predicted mixed-state entanglement in such experiments. Moreover, we show that entanglement generation is robust against atomic decay and collective dephasing, and should be observable under recently reported experimental conditions. Our results, thereby, offer a general framework and experimentally viable approach for the dissipative engineering of entangled dark states enhanced by superradiance.

Measurement is an important scientific activity. In most of science, including classical physics, is may be understood as a way of finding out about the physical world and representing the results numerically. No-go theorems show that measurement of quantum observables is not like that: the recorded outcome is typically created rather than revealed in a quantum measurement, in which case there is no objective fact about the observable's prior value. Other no-go theorems show that unitary quantum theory can generally neither explain nor even represent a unique recorded outcome, thereby threatening that outcome's objectivity. Methodological norms inherent in quantum physical practice nevertheless institute the objectivity, not only of unique recorded outcomes of quantum measurements, but also of non-quantum features of the world that physicists and other scientists take their models to represent.

Quantum mechanics enables information-processing advantages even at the level of a single qubit. A paradigmatic example is the 2$\to$1 random access code (RAC), where a qubit outperforms a classical bit in retrieving encoded information. In the standard form, however, this quantum advantage is restricted to a single receiver, since decoding measurements inevitably destroy the encoded information. Contrary to this, we address how long the information encoded in a single qubit remains accessible even after multiple decoding, each with a quantum advantage. Introducing preparation distinguishability as an operational resource associated with the sender, we show that its interplay with measurement incompatibility on the receiver's side can mitigate measurement-induced disturbance, thereby enabling an arbitrarily long sequence of receivers to each retain a quantum advantage. Our results show that, even under repeated measurements, the information encoded in a qubit need not be entirely exhausted, revealing a stronger communication feature than previously recognised.

Order finding is the core subroutine of Shor's algorithm. On NISQ hardware, phase estimation output distributions are often distorted by noise, making correct order recovery difficult. We study recoverability in noisy order finding: given a measured precision-register distribution, when does standard classical post-processing still return the true order? We analyze 680 distributions from IBM quantum systems across problem instances and circuit settings. For each distribution, we apply continued-fraction post-processing with modular verification and define recoverability as whether the recovered order equals the true one. We characterize each distribution using four features: autocorrelation peak strength, normalized entropy, dominant verified mass fraction, and verified margin fraction. We evaluate these quantities using marginal feature comparisons, single-feature AUROC analysis, and multivariate tree-based classifiers. We use random-forest permutation importance to assess which quantities contribute distinct predictive information once the other features are known. To make classification behavior interpretable, we train a decision tree that exposes threshold rules for recoverable and non-recoverable distributions. We find that recoverability is strongly associated with residual comb-like structure in the measured distribution and the way verified probability mass is organized across candidate denominators. The dominant verified mass fraction is the strongest single-feature indicator of recoverability, and tree-based analysis shows it also provides the primary split in an interpretable threshold description. Some highly distorted distributions remain recoverable when one verified denominator dominates the post-processing mass, while some visibly structured distributions fail because classical post-processing favors an incorrect verified denominator.

Mutually unbiased bases (MUBs) are central finite structures in quantum information. We ask whether complete MUB systems have an extremal probing property beyond their projective \(2\)-design identities. For an isotropic Gaussian traceless Hamiltonian, we prove that, among labeled unions of \(d+1\) orthonormal bases, a complete MUB union has the stochastically largest sampled maximum. Each basis induces the same regular-simplex Gaussian block; mutual unbiasedness eliminates cross-block covariance, joint Gaussianity yields independence, and a centered-convex Gaussian correlation inequality makes this independent coupling extremal. We also derive a radial-mixture extension and prove exact MUB-family collapse for fully matched diagonal-cost constructions.

Gate-based quantum generative models have been limited to small images, because their quantum resources grow with the size of the data. The Quantum Feature Amplification Network (QFAN) removes this limit. It reuses a single few-qubit circuit to generate the data block by block, each block conditioned on a compact summary of those before it, with the circuit's measurement outcomes as the source of randomness. The number of qubits is set by the block rather than by the data, and the number of circuits per training step does not grow with the data either. In simulations with only four qubits, QFAN generates full-resolution calorimeter showers from the CaloChallenge Dataset~1 benchmark, 368 voxels each, and learns their correlations and shower-to-shower fluctuations. A three-qubit version generates 12- and 25-pixel images on IBM quantum hardware. This brings high-dimensional scientific data within reach of near-term quantum generative models.

Dynamical quantum phase transitions (DQPTs) occur at times when a quantum state exhibits a nonanalytic change in its return probability. This can be viewed as the probability of collapsing the evolved state to the initial state by quantum measurement. However, the initial wave function usually has exponentially small amplitude in the late time evolved state. Here we perform statistical characterization for all the possible post-measurement states distributed according to the Born's rule, by sampling a one-dimensional quantum Ising chain after a quantum quench dynamics. The statistical ensemble can also be viewed as a mixed state when the time evolved state is subjected to maximally dephasing noise in a certain basis. We map the distribution to a statistical model and characterize its effective "energy" spectrum, and introduce the average dynamical free energy, establishing a framework for the statistical DQPTs. We show the recovering of DQPT under high-moment average and a delocalized level distribution following critical times. Through analytic continuation into the complex time plane, we demonstrate the vanishing of Yang-Lee-Fisher zeros and the emergent level crossing near critical times. Finally, we propose a measurement-based quantum computation protocol to simulate the unitary evolution via single-qubit measurements on a two-dimensional cluster state. Our results provide a way for experimentally investigating statistical DQPTs in quantum devices, shedding light on the structured circuit sampling with insights from DQPT and generalizing the understanding of mixed state due to decoherence beyond equilibrium.

Starting from a thorough analysis of the conjugate $\overline{H}$ of a complex Hilbert space $H$, including its significant importance regarding a representation of the tensor product of two complex Hilbert spaces and its impact to the theorem of Fréchet-Riesz over to a revisit of applications of nuclear and absolutely $p$-summing operators in algebraic quantum field theory (AQFT) in the sense of Araki, Haag and Kastler ($p=2$) and more recently in the framework of general probabilistic spaces ($p=1$), we will outline that Banach operator ideals in the sense of Pietsch, or equivalently tensor products of Banach spaces in the sense of Grothendieck are even lurking in the foundations and philosophy of quantum physics and quantum information theory. In particular, we concentrate on their importance in AQFT (Theorem 5.27). In doing so, we revisit the role of trace-class operators in quantum theory and construct the enveloping $\tup{C}^\adj$-algebra, corresponding to an arbitrarily given normed operator ideal (Proposition 5.3 and Theorem 5.5). Applications are presented, including a purely linear algebraic description of the quantum teleportation process, thereby showing a link to quantum information theory, also due to the emergence of the Hadamard-Walsh transform and the controlled NOT gate (Example 4.18). All Hilbert spaces discussed in this paper may be nonseparable (and hence infinite-dimensional).

The product formula, commonly known as Trotter decomposition, is a central tool for digital quantum simulation, whose performance depends critically on how the Hamiltonian is partitioned into tractable blocks. Standard decompositions typically rely on direct commutativity among Hamiltonian terms in a chosen operator representation, which can lead to large residual errors and deep circuits for complex, practically relevant many-body quantum systems. We address this fundamental bottleneck by introducing a new decomposition principle that goes beyond commutativity, grouping Hamiltonian terms into local three-site clusters according to the underlying SU(2) symmetry of the local dynamics. We show that three-site generators fall into at most four SU(2)-symmetry classes, each admitting an effective two-qubit SU(4) representation with exact and efficient implementations. By reducing the number of clusters, this decomposition principle substantially suppresses commutator-induced errors and circuit overhead while preserving underlying physical structures that commutativity-based decompositions may violate. We demonstrate the proposed method on several physically relevant spin-lattice models, where the reduced cluster structure can even realise the second-order product formula without doubling the circuit depth, as would be required by conventional decompositions. Numerical simulations of a Kagome Heisenberg model with triangular spin-chirality interactions show that the proposed method reduces both state infidelity and average spin-chirality bias by more than three orders of magnitude compared with conventional decompositions, while using substantially fewer gates. These results establish local symmetry as a flexible and practical design principle for product-formula simulation, opening a route to more accurate and hardware-efficient simulations of broader classes of many-body systems.

A fault-tolerant quantum computer is expected to require thousands of qubits. Trapped ion architectures provide a modular approach where the quantum register is divided into multiple subregisters connected by physically moving the corresponding ions. Transporting ions at scale comes with several challenges such as the need to connect thousands of control lines to an ion trap chip. Multiplexing the required control voltages from few input signals to multiple electrodes offers a solution to this wiring challenge. Here we demonstrate a quantum processing unit that combines a surface ion trap with a time multiplexer via a sample-and-hold technique that initially charges electrodes to fixed voltages and disconnects them during qubit operations. We characterize the unit's performance by measuring motional heating rates below one phonon per second in both open and closed switch configurations. We further characterize the sample and hold process and find that sampling intervals below 50 ms are sufficient to keep expected gate errors from decaying charges during the hold phase below $10^{-4}$. Our results indicate that the multiplexing scheme is compatible with high-fidelity operations.

We analyze the autonomous stabilization of remote entanglement by driving two distant qubits with the output of a correlated photon source. By treating the qubits as idealized entanglement detectors, we develop a general framework to quantify the maximum amount of entanglement that can be remotely stabilized in this way with a given photon source. We then apply this approach to evaluate the suitability of a single driven two-level system as a minimal resource for autonomous entanglement distribution schemes. While our analysis confirms the presence of distributable entanglement in the Mollow sidebands of a bare two-level system, we show that stabilizing close to maximally entangled states requires additional filter cavities that enhance the relevant correlated emission events compared to other processes. We identify optimized driving and cavity parameters and explain the achievable amount of entanglement in different regimes in terms of an effective two-mode squeezing model. These insights are particularly relevant for quantum networks based on photons or phonons in solid-state systems, where isolated spins, impurity centers, or other two-level defects are readily available, while alternative sources of correlated photons are difficult to realize.

Scaling up superconducting quantum processors remains a central challenge for realizing fault-tolerant quantum computation. Although distributed architectures based on optical photons offer a promising route to scalability, they require an efficient microwave-to-optical quantum transducer that operates at cryogenic temperatures. Existing approaches typically rely on strong optical pumping, which induces undesirable heating and degrades single-photon coherence. Here, we propose a microwave-to-optical quantum transducer based on resonant scattering at a single color center embedded in a diamond optomechanical resonator. We show that strong coupling between the color center and the optical cavity enables coherent conversion at extremely weak pump powers on the order of 10 pW. The proposed scheme enables remote entanglement generation at a kilohertz-scale rate with a fidelity exceeding 0.9, demonstrating a viable pathway toward ultra-weak-pump and high-efficiency quantum transducers based on a solid-state defect.

We introduce thermodynamic networks, a general framework for autonomous, physics-based computation using non-equilibrium steady states. These networks are modeled as a collection of finite-size reservoirs that exchange conserved quantities–such as electric charge or molecular number–while relaxing to a non-equilibrium steady state, which encodes the solution of a computational problem. We identify Negative Differential Conductance (NDC) as the critical physical property governing the computational expressivity of the thermodynamic network. While networks lacking NDC are restricted to computing monotonic functions, the presence of NDC enables universal function approximation. For the training of the network, we use protocols that take advantage of the natural tendency of the system to equilibrate. We illustrate the versatility of our approach via two different platforms: quantum dot networks and enzymatic reaction networks. Both systems can be engineered to have NDC, enabling high performance in standard benchmarks, including sine function approximation and MNIST digit classification. Overall, our work establishes a rigorous link between non-equilibrium steady states and computational expressivity.