Papers

We prove that the second-moment Hamiltonian of the open qubit eSWAP chain has a diffusive spectral gap, resolving a conjecture of Li, Zheng, Liu, Jiang, and Liu. We also characterise the ground space on every connected interaction graph with at least five vertices and prove a uniform lower bound for the unnormalised complete-graph gap. We apply these results to sequential and brickwork circuits and prove that the periodic chain also has a diffusive spectral gap.

Variational quantum algorithms (VQAs) generally rely on classical optimization to train parameterized quantum circuits. This training seeks to minimize an objective function, and its efficiency is central to the practical success of these algorithms. However, globally minimizing such training objectives over the circuit parameters is known to be $\mathsf{NP}$-hard, limiting the prospect of general guarantees for efficient training. In this Letter, we prove that even the weaker task of finding a local minimum of such VQA training objectives is strongly $\mathsf{NP}$-hard, including when the objective admits efficient classical evaluation. Moreover, we show that this hardness persists even for the task of finding a parameter vector within $\ell_p$-distance strictly less than $\pi/2$ of some local minimizer, for every $p\geq 1$. Our central technical result is that approximating a local minimizer of a Hermitian trigonometric polynomial is strongly $\mathsf{NP}$-hard. By explicitly constructing quantum circuits whose training objectives reproduce these hard instances, we obtain a polynomial-time reduction to VQA training. Our results establish a fundamental computational barrier to variational quantum training: even reaching the vicinity of a local minimum remains hard in the worst case.

Sampling-based quantum advantage raises a basic resource question: how much non-Gaussianity is needed to reproduce the random-matrix statistics often associated with quantum chaos? Passive fermionic linear optics preserves Gaussian structure, and even Haar-random mode mixing fails to anticoncentrate for Slater inputs. We show that overcoming this obstruction requires an extensive input resource. For any pure half-filled input state, the one-body defect $\nu$, defined as the summed occupation variance of the natural orbitals, must scale linearly with system size. For products of bounded-size blocks on $4N$ modes, this condition is also sufficient, with normalized collision moment asymptotic to $2N/\nu$, compared with the Porter-Thomas value 2. For four-mode products, the full Porter-Thomas moment hierarchy is recovered precisely when the defect density tends to its maximum. Assuming average-case hardness, approximate classical sampling remains hard near maximal density, with an error tolerance that increases with the density. Two-copy number fluctuations measure $\nu$ directly, and the same quantity lower-bounds the combined cost of non-Gaussian resource modes and parity-preserving local gates in deterministic exact preparation. Fermionic randomness therefore carries an extensive magic cost, with a quantitative link between sampling statistics, preparation resources, and an experimentally accessible witness.

Classical simulation supports the development and validation of quantum algorithms through full-state inspection, controlled noise models and backpropagation, albeit for small quantum systems. Existing frameworks offer gate-level execution, differentiable pulse-level dynamics or optimised hardware execution. Just another quantum simulator (JAQSI) combines gate- and pulse-level simulation in one differentiable circuit model built upon JAX. Circuits are represented as pure functions of numerical inputs which support vectorised batches and JIT compilation. Within a single circuit, matrix-defined operations, gates synthesised from Hamiltonian time evolution and noise channels can be composed freely. For a fast simulation, gate and channel fusion reduces passes over the state, while adjoint differentiation computes expectation-value gradients with a constant number of statevectors. At pulse level, JAQSI reduces evolution under single-term Hamiltonians to a scalar pulse-area integral and reuses cached execution plans and compiled solvers. In a benchmark we compare JAQSI with PennyLane, Qiskit, Qibo, Qulacs, QuTiP and dynamiqs. At gate level, we observe performance either on par or an order of magnitude faster across statevector, density, noise and gradient simulation than the compared simulators up to 12 qubits. Beyond 18 qubits, JAQSI is on par with PennyLane Lightning in both statevector and gradient simulation. In the statevector and noisy density-matrix pulse benchmarks, it is at least 5 times faster than the other simulators, even with its closed-form solve disabled. Disabling the latter increases its runtime by at most a factor of 1.5. We provide JAQSI as open-source software on GitHub and PyPI.

We present a foundational reinterpretation of quantum dynamics based on the standard von Neumann formalism, positing a structural logical bipartition between a classical observational environment and a quantum observed system. Against universalist frameworks, we argue that theoretical consistency requires distinct propositional logics: Boolean logic governs the environment, while non-Boolean logic applies to the observed system. Within this framework, an ideal classical clock is represented as an open system whose energy spectrum is uniformly discretized. The dynamics follow from the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) master equation under the constraint that the Hamiltonian remains observable. Although the clock's temporal evolution is driven by dissipative coupling to the measurement apparatus, it admits a deterministic solution corresponding to information-preserving cyclic dynamics. This deterministic regime may emerge as a logical attractor, stabilized by the Boolean structure inherent to the measurement interaction. Ultimately, $\hbar$ is derived as a fundamental scaling parameter from the classical clock's action operator, revealing that the quantum of action reflects the discrete logical structure underlying classical temporality. Furthermore, this framework establishes an exact mapping with 't Hooft's cellular automaton formalism, offering an alternative ontological interpretation that not require hidden variables and superdeterministic assumptions. The resulting distinction between quantum dynamics (as potential recontextualization) and classical dynamics (as temporal actualization) provides a novel logical approach to the measurement problem.

We study recoverable entanglement in a four-qubit cluster-state register whose two detector qubits couple to a scalar field. A local preparation phase leaves the initial reference–register entanglement and detector marginal unchanged, but controls protection under collective noise. At the optimal phase, a fixed decoder recovers a Bell pair after any channel preserving the singlet and triplet sectors. For uniformly accelerated detectors at finite separation, an exact trace-norm formula shows that the same phase is optimal at every time within the secular weak-coupling dynamics. Small separation produces a slow decay, whose rate and phase-dependent amplitude we derive. Matching the local response to an inertial thermal bath gives an analytic optimum time for the entanglement contrast. A detector measurement and conditional phase correction recover a two-qubit teleportation resource. Spatial smearing and an ordered weak-coupling then small-separation limit specify the microscopic scope of the lifetime prediction.

We study the transverse-field axial next-nearest-neighbor Ising (ANNNI) model on the square lattice and on a bilayer. At the classical multiphase point $\kappa=J_2/J_0=1/2$, every configuration of straight domain walls that separates domains of at least two sites is a ground state. The walls are rigid, so perturbation theory in the transverse field $g=\Gamma/J_0$ can be carried out for each configuration separately, and we take it to order $g^8$. Quantum fluctuations select $\langle 3\rangle$ ($\uparrow\uparrow\uparrow\downarrow\downarrow\downarrow$) at order $g^2$, because spins next to a wall gain the most energy from virtual flips. The structures $\langle 23\rangle$, $\langle 223\rangle$ and $\langle 2223\rangle$ then open between $\langle 3\rangle$ and the antiphase $\langle 2\rangle$ at orders $g^4$, $g^6$ and $g^8$, in the order of the Fisher-Selke sequence of the classical three-dimensional model. A second layer suppresses each successive phase more strongly, beyond the stiffening of the local fields. We test the two widest phases with stochastic series expansion quantum Monte Carlo, comparing the free energies of the competing ordered states by thermodynamic integration, since annealing freezes in the modulation that forms at the ordering transition. The simulations reproduce the $\langle 3\rangle$ wedge to about 1%, and in a pre-registered test $\langle 23\rangle$ is stable at six of seven points, with the seventh resolved by post-hoc runs.

Process tensors in matrix product operator representation (PT-MPOs) are a powerful tool to calculate the temporal evolution and multi-time correlations of open quantum systems. While much progress has been made in making the calculation of process tensors for larger system dimensions possible, the numerical cost of the subsequent propagation of the system typically scales as $\mathcal{O}(d^6)$, which renders PT-MPO methods prohibitively expensive for system dimensions above several dozens. Here, we show how PT-MPO methods can be used efficiently when only some of the system states couple to the environment, and how combination with a Taylor expansion method allows for a reduction of the numerical complexity down to $\mathcal{O}(d^3)$. We show that these methods enable efficient simulations of systems with several hundreds of states. This is particularly relevant for solid-state cavity-QED systems with multiple modes, or when calculating frequency-filtered correlation functions by coupling sensor systems to the system of interest.

Establishing a complete set of gates across spatially separated quantum nodes is fundamental for distributed quantum computation and communication networks. One of the approaches to do so consists of employing a superconducting device as a universal quantum node that is capable of storing and processing quantum information, and traveling microwave photons as means of communication. In this work, we realize an entangling gate across a primitive two-node superconducting circuit QED network consisting of two dilution cryostats, A and B, connected via a 30-m-long cryogenic quantum link. We perform a bidirectional photon transfer protocol, where a microwave photon emitted by the communication qubit at A acquires a conditional phase based on the state of qubit B. We vary the communication photon frequency, hence tuning the conditional phase acquired during the reflection off the remote node, effectively implementing an arbitrary-phase CZ gate. We use this entangling operation to perform single-shot readout of the qubit in node B from node A. An interesting feature of our scheme is that it does not require precise synchronization of the active node with the remote node; in particular, remote readout can be performed without any active participation by the remote node. These protocols add to the quantum communication toolbox with superconducting circuits and provide a way of realizing basic distributed quantum computing operations.

Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision $\varepsilon$ using $O(1/\varepsilon)$ total evolution time. However, in Hamiltonian property testing, the best known algorithms have $O(1/\varepsilon^2)$ total evolution time, unless it is possible to $\textit{reverse}$ the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.

We propose a protocol for the remote implementation of an arbitrary two-qubit unitary operation using pre-shared entanglement. In our protocol, Bob possesses an unknown two-qubit state, while Alice implements the required operations using calibrated black-box devices. Alice does not need to know the parameters of these operations, and Bob's unknown state never leaves his laboratory. The protocol is based on the Euler decomposition of single-qubit unitary operations and the Cartan decomposition of two-qubit unitary operations. First, we construct protocols for the remote implementation of the single-qubit operation $U = R_z(\gamma)R_x(\beta)R_z(\alpha)$ using pre-shared Bell states. We then construct a protocol for the two-qubit operation $R_{zz}(\theta)$ using a single pre-shared Bell state and extend it to $R_{xx}(\theta)$ and $R_{yy}(\theta)$ through local unitary transformations. These elementary protocols are finally combined to implement an arbitrary two-qubit unitary operation. A third party, Charlie, determines the required decomposition and provides Alice with the corresponding black-box devices before the protocol begins. Thus, neither Alice nor Bob requires the classical description of the unitary operation.

Estimating the volume of a high-dimensional convex body is a fundamental problem in theoretical computer science. Given a quantum membership oracle for a convex body $K\subset\mathbb{R}^d$, we show that estimating $\mathrm{vol}(K)$ to relative error $\varepsilon$ takes $\widetilde O(d^{5/2}+d^{3/2}/\varepsilon)$ queries. This improves the previous quantum upper bound $\widetilde O(d^3+d^{9/4}/\varepsilon)$ of Chakrabarti et al. (ACM TQC 2023) and Cornelissen–Hamoudi (SODA 2023), and achieves a larger quantum speedup over the currently best classical upper bound $\widetilde O(d^{7/2}+d^3/\varepsilon^2)$ of Jia et al. (JACM 2026). Our quantum algorithm combines two new ingredients: an input-dependent effective spectral-gap analysis of quantum walks based on uniform classical warm-start mixing bounds, and a single quantum estimator for products of normalizer ratios in simulated annealing based on classical bridge sampling. We also prove an $\Omega(d)$ quantum query lower bound for constant relative error, improving the previous $\Omega(\sqrt d)$ lower bound.

Optimization in machine learning is usually expressed through iterative rules that update model parameters using information from the loss landscape. In this work, we study an alternative viewpoint in which parameter optimization is treated as the evolution of a dissipative dynamical system. The model parameters are regarded as generalized coordinates, the loss acts as a potential energy, and a positive-definite metric defines the local kinetic geometry of parameter space. Starting from a variational formulation, we derive the corresponding Hamiltonian dynamics, the geometric force generated by a position-dependent metric, and a metric-compatible Rayleigh dissipation law. The resulting continuous system satisfies a monotonic energy-dissipation relation, while its discrete form allows the influence of curvature on the optimization trajectory to be studied directly. We illustrate the framework using a controlled CIFAR-10 image-reconstruction problem for which the optimum is known analytically. With the image Hessian used as the metric, the curvature dependence of the quadratic modal dynamics is removed. We then reparameterize the same image as a matrix product state, producing a genuinely position-dependent metric and a nonzero geometric force. Poincaré return maps provide a complementary phase-space view of the resulting contraction dynamics. These examples establish HAMLET as a geometric, energy-based framework for studying optimization as dissipative motion in parameter space. On a five-seed MNIST MLP benchmark, HAMLET attains the highest mean test accuracy (97.95%) and the lowest mean test negative log-likelihood (0.0696) among the three evaluated optimizers.

The quantum PCP conjecture is one of the major open problems in quantum complexity theory. It has resisted attack in part because many primitives used in the proof of the classical PCP theorem, such as locality-preserving gap amplification and alphabet reduction, have no obvious quantum analogues due to quantum no-cloning. Locality-preserving gap amplification is a procedure that takes as input a local Hamiltonian problem instance and produces a new instance with a larger promise gap, without increasing the locality of the Hamiltonian, and instead moderately increasing its local qudit dimension. Obtaining this kind of control over the locality during gap amplification is critical to the success of many known strategies for proving the classical PCP theorem. In this work, we put forth the first known viable template for quantum locality-preserving gap amplification, and we prove that our procedure amplifies the combinatorial gap of local Hamiltonians. Our work introduces a new framework for reasoning about quantum gap amplification in terms of fault-tolerant computation, and illuminates a route toward importing one of the central ingredients in classical PCPs into the quantum setting. In particular, we build upon ideas from the recent classical PCP of Bafna–Minzer–Vyas based on high-dimensional expanders, and the circuit-to-Hamiltonian construction of Anshu–Breuckmann–Nguyen, in addition to several recent advances in quantum coding theory.

Basis-independent coherence of a quantum multistate is fixed by whether its constituent states commute, and for qubits it is detected by pairwise state overlaps alone. What governs its deterministic transformation has been open. We give the exact resource-conversion theory of quantum multistates under common commutativity-preserving operations (CPOs). For qubits, pairwise Bargmann invariants determine the singular values of the unique candidate channel, while a single third-order Bargmann phase determines its orientation. Complete positivity then yields a necessary and sufficient criterion for exact conversion. The criterion identifies a chirality-sensitive shell $\mathcal C_{\rm chir}$, within which targets with identical pairwise geometry can differ in convertibility solely by the sign of their cubic invariant. This yields an order separation, $k_{\rm detect}=2<3=k_{\rm convert}$, for qubit multistates of every size $n\geqslant3$. The chirality-sensitive shell occupies exactly one third of the singular-value simplex, while mirror reflection obstructs two thirds of the admissible orientation-preserving transformations by volume. For $d\geqslant3$, by contrast, the structure is rigid: every resourceful conversion is realized by either an isotropic depolarizing or a transpose-depolarizing channel. Convertibility is then decided by centered Bargmann invariants of degree at most $d^2$.

Inequality constraints in combinatorial optimization are conventionally handled by introducing slack variables and quadratic penalties, which increase the qubit count and distort the optimization landscape. Slack-free formulations instead apply a nonlinear custom penalty function directly to the constraint, which are difficult to be implemented in quantum approximate optimization algorithm (QAOA). We show that the Walsh–Hadamard transform (WHT) removes this obstruction for any penalty function: a penalty applied to a linear constraint is exactly a weighted sum of Pauli-$Z$ strings. We propose this framework as the Walsh custom penalty QAOA (WCP-QAOA). Truncating the expansion at Walsh degree $k$ costs $\mathcal{O}(n^k)$ Pauli terms and leaves the qubit count untouched. The truncation is the optimal degree-$k$ approximation of the penalty in $L^2$, and we give a condition on the discarded Walsh coefficients under which the truncated Hamiltonian still ranks every feasible solution below every infeasible one. Since evaluating a Walsh coefficient from its definition requires all $2^n$ penalty values, we give an algorithm that returns any coefficient in sub-exponential time, so that the degree-$k$ Hamiltonian is obtained in time polynomial in $n$ for fixed $k$. We show that for the exponential penalty, there exists a closed product form of WHT, and hence a closed form expression to calculate the Walsh coefficients. We identify structural shortcuts that shorten the exact spectrum. We also tested WCP-QAOA in solving a 6-qubit knapsack problem.

Network operators migrating distributed systems to post-quantum and quantum-safe cryptography face a resource-management problem: quantum key distribution (QKD) gives the strongest guarantee available but is hardware-scarce and costly, so only a fraction of a deployment's links can receive it. Default practice – ranking links by traffic or centrality and upgrading the top scorers – optimizes each link in isolation, while a distributed job's real security is set by whichever active link ends up weakest. We present WLPA (Weakest-Link Posture Assignment), an implementation-ready decision framework and algorithm for allocating scarce quantum-safe postures under hardware, latency, and compliance constraints. WLPA computes the optimal weakest-link posture in closed form and returns an assignment in O(|E| log |E|) time – 125 ms for a 20,000-link network on a laptop – with a breach-aware refinement matching an exact integer program under common conditions. Our central contribution is a dichotomy telling operators exactly when existing per-link heuristics already match this optimum and when they systematically fail: under constant upgrade cost and uniform traffic-driven risk the two coincide exactly; once costs vary or an adversary concentrates on weak targets, heuristics leave the weakest link unprotected, unboundedly. We validate WLPA across 19 experiments: four microservice topologies, a real enterprise network (SNAP email-Eu-core), a post-quantum latency benchmark, a Qiskit BB84 simulation and a real-hardware BB84 run on IBM's ibm_marrakesh processor, checks against real production traffic traces, a CVE-calibrated correlated-compromise study, Bayesian uncertainty quantification, and seven baseline methods. A concrete-security reduction grounds the framework as theoretical foundation, not primary contribution.

The fate of quantum coherence following photoexcitation is a central problem in nonequilibrium condensed-matter physics, especially in low-dimensional solids where electronic, structural and many-body energy scales are strongly coupled. Here, we investigate this interplay in ferroelectric $\alpha$-In$_{2}$Se$_{3}$ using broadband transient-grating spectroscopy with $\sim$5 fs laser pulses. Photoexcitation launches pronounced oscillations dominated by a $\sim$104 cm$^{-1}$ mode that persists for several picoseconds. Measurements from 10 to 300 K show that its frequency remains nearly unchanged while its coherence is progressively suppressed, distinguishing the lattice coordinate from thermally activated dephasing. Varying excitation energy reveals a distinct crossover in which increasing photoexcitation progressively modifies and damps the coherent response. First-principles calculations assign the dominant oscillation to a 101.47 cm$^{-1}$ $\Gamma$-point optical phonon involving collective In-Se displacement, while quantum-dynamical simulations reproduce the main transient-grating oscillations. These results establish $\alpha$-In$_{2}$Se$_{3}$ as a model system for independently probing lattice coherence, thermal fluctuations and carrier-density-dependent interactions, revealing how a polar van der Waals semiconductor evolves from coherent lattice motion toward an incoherent many-body state after ultrafast excitation.

We introduce a quantum coding framework for discrete small-shift noise, in which errors on qudits are modeled as low-weight $X$- and $Z$-type Pauli shifts, analogous to small phase-space displacements in continuous-variable systems. This structure is approximately respected by nuclear-spin noise and captured by the Lee metric, motivating a quantum extension of classical Lee-metric coding theory. We develop such a formalism for stabilizer codes over $\mathbb{Z}_q$ for arbitrary $q$, using joint and separate Lee metrics for the $X$- and $Z$-components of errors. For qubits, the joint metric counts $Y$ errors twice and can yield codes that detect and correct $X$ and $Z$ errors with fewer physical qubits than codes designed for the conventional Hamming metric. We discuss Lee-weight spreading under Clifford gates and qubitize codes over $\mathbb{Z}_4$ via the Gray map, finding codes with two-fold transversal non-qubit-Clifford gates. For quantum CSS Lee-LDPC codes on $n$ qudits, we prove that the Lee distance cannot exceed $O(n)$, uniformly in $q$, demonstrating an unexpected obstruction to using the large internal Hilbert space of a large-$q$ qudit to make high-Lee-distance codes. Under local Metropolis dynamics, certain classical $q$-ary “helical repetition codes” have exponentially long memory times at fixed temperature for sufficiently large $q$ (that grows with system length), which can be understood as spontaneous symmetry breaking at finite temperature, even in local one-dimensional models. Hypergraph products of these helical repetition codes provide local two-dimensional quantum codes that inherit self-correction for $Z$ errors, but self-correction for $X$ errors remains an open question.

We develop entanglement-of-formation potentials for feedback-assisted classical communication and one-way randomness distillation. For a finite-dimensional quantum channel without initial shared entanglement, an exact amortization theorem bounds the increase of message information plus entanglement remaining across the communicating laboratories. This proves a classical-feedback capacity bound using a mixed-convex-roof expression previously studied by Winter and Yang in the context of potential capacities. We determine the capacity of flagged mixtures of noiseless and entanglement-breaking channels, improve a published depolarizing-channel converse, and evaluate the new bound exactly for the amplitude damping channel. A state analogue gives a finite-blocklength upper bound on the net shared randomness obtainable with one-way classical communication. Amplitude-damping Choi states provide exact benchmarks, while a full-rank generalized amplitude-damping Choi state demonstrates a useful improvement where we do not evaluate the operational rate exactly. We also distinguish one-way from two-way randomness distillation: a two-round weak-measurement protocol strictly exceeds the exact one-way rate of every nontrivial qubit isotropic state. The protocol preserves quantum side information during its first decoding and extracts additional randomness in the reverse direction. This shows why the one-way state potential is not a general two-way converse. Together, these results establish a common entanglement-based approach to sharper communication and randomness bounds, while revealing how retained quantum correlations enable two-way distillation to surpass one-way limits.

We report a demonstration of a self-shunted superconducting flux qubit (SSFQ) as an ultracompact, strongly anharmonic, and long-lifetime qubit by using the full epitaxially grown NbN/AlN/NbN Josephson junctions. The NbN-junction-based SSFQ achieved a high anharmonicity of 797 MHz as well as drastically reduced footprint of the qubit compared to capacitively shunted (C-shunt) flux qubits with a large shunt capacitor. The lifetime of the SSFQ reached 13 - 25 $\mu$s, which is comparable to or relatively higher than that of NbN-based C-shunt flux qubits and Al-based flux qubits with more than 10 times smaller junctions. This indicates that the large epitaxial NbN-based junction can be adopted for SSFQ as well as merged-element transmon with the relatively large junctions. The results presented in this work will offer a new choice of the scalable qubits as well as the material platform toward the realization of large-scale superconducting quantum computers.

Epitaxial NbN/AlN/NbN Josephson junctions are promising alternatives to conventional Al/AlO$_x$/Al junctions for superconducting qubits due to their crystalline tunnel barriers and the high transition temperature of NbN. However, their integration into quantum circuits typically requires complex fabrication processes involving amorphous interlayer dielectrics, which can degrade qubit coherence times. To address these issues, we developed sidewall spacer passivated epitaxial NbN/AlN/NbN junctions using a fabrication process that reduces both the volume of amorphous dielectric material and fabrication complexity. The fabricated junctions exhibited a large gap voltage of approximately 5.6 mV and low subgap leakage currents. By varying the thickness of the AlN tunnel barrier, high-quality junctions were fabricated over a wide range of critical current densities ${\it J}_c$, from 0.3 to 10$^4$ A/cm$^2$. In addition, the comparison of the current-voltage characteristics before and after buffered hydrofluoric acid treatment indicated that the wet etching process did not degrade the electrical characteristics of the junctions. These results establish a scalable fabrication process for epitaxial Josephson junctions and provide a promising platform for high-coherence nitride-based superconducting qubits.

Quantum-enhanced sensing typically relies on preparing specific entangled states. However, engineering these states in scalable many-body systems remains challenging due to the difficulty of designing robust preparation protocols and accounting for realistic noise. We show that evolving a simple product state under native time-independent Hamiltonian dynamics in Rydberg atom arrays generates complex many-body correlations that can potentially enable quantum-enhanced parameter estimation reaching the Heisenberg limit (HL). The key challenge is then shifted to extracting the metrological information encoded in spatial correlations of measurement patterns. We introduce a neural correlation learning framework that combines Bayesian inference with neural networks trained on calibration data. Operating in a two-stage calibration-and-sensing protocol, we numerically demonstrate that this framework effectively extracts many-body correlations to saturate the Cramér–Rao bound dictated by the classical Fisher information. Consequently, it achieves quantum-enhanced sensitivity surpassing the standard quantum limit (SQL). Furthermore, the learned estimator is robust to realistic noise, and remains accurate in the absence of rare measurement patterns. Our results establish a hardware-efficient and scalable paradigm for quantum sensing in interacting many-body systems without requiring engineered entangled states.

Recent experiments suggest that strong light-matter coupling between molecules and cavity modes can significantly modify chemical reaction rates and yields. Despite multiple proposed mechanisms, a clear microscopic understanding of how vibrational strong coupling alters reaction kinetics remains incomplete. Here, we employ a general quantum-dynamical framework for analyzing competing reaction pathways in polaritonic chemistry by considering reaction coordinates with multiple relevant transition frequencies and general harmonic environments. We extend on a tensor-network formulation of the hierarchical equations of motion (HEOM) method to compute probability currents between vibrational states, leveraging a concise formulation for effective spectral densities and a controlled compression of Markovian bath modes into system-level jump operators. This allows us to decompose the resulting state-to-state probability currents, revealing how cavity-induced changes in individual transitions propagate through multistep reaction networks. We find that these local modifications can alter kinetic bottlenecks and selectively redistribute reaction flux between competing pathways, changing branching ratios under irreversible conditions without substantially affecting the equilibrium yield in the reversible regime. Finally, for coupled reaction-coordinate, spectator-mode, and cavity environments, we find structured, asymmetric rate profiles arising from interference between hybridized decay channels. Together, these results provide a mechanistic framework for understanding pathway-specific chemical reactivity under vibrational strong coupling.

We investigate a class of dynamic percolation models on a lattice, in which connections are added and removed by a set of local stochastic rules. In particular, the removal of any connection that can result in one connected cluster becoming two (or more) separate clusters is strictly forbidden. These models include and are inspired by a model for local quantum error correction for a toric code studied by Chirame, et al., PRX Quantum 6, 030363 (2025), who identified a phase transition with first-order characteristics, such as bistability and a discontinuous order parameter. We show numerically that this transition is a hybrid percolation transition (HPT), having characteristics of a continuous percolation transition such as diverging critical clusters while at the same transition having discontinuities like a first-order transition. We then modify this model to be fully isotropic, showing that the HPT remains. In both of these models, the steady state on one side of the HPT is an absorbing state; by turning on additional isotropic local stochastic moves, we remove the absorbing state and strongly suppress or remove the first-order transition, leaving an apparently continuous percolation transition. Curiously, the numerically-observed percolation critical exponents do not change significantly between the models with hybrid transitions and the model with an apparently continuous transition. These exponents are significantly different from known percolation transitions, indicating that this may be a new universality class.

No-signalling constraints on isolated outcome probabilities do not determine whether an apparatus preserves the joint law of its accessible records under repeated readout, network composition, or reuse. We study these extensions through a conditional-record criterion and four explicit models. For a wrapped-Cauchy retrocausal source, protection under two conditionally independent continuous readouts forces an angle-independent response; three readouts suffice without continuity. A finite angular-bandwidth assumption gives a quantitative leakage bound, whereas continuity alone gives no uniform stability. At a specified two-source Bell junction, the required correction matrix has full nonnegative rank on every even uniform angular grid. A Gaussian controller can cancel branch-mass dependence while leaving a distinguishable joint record, for which we derive exact noise and law-change tradeoffs. Finally, a fixed singlet with shared classical noise reproduces the variable-width isolated outcome family, but retained and refreshed controllers generate different temporal statistics. We prove a finite-resource obstruction and construct positive finite-controller approximations. Numerical studies comprising 8.3 million independent simulated histories support the model-specific predictions. Together, the results identify conditions that must accompany marginal no-signalling when extending an apparatus to richer records and interventions.

Quantum communication can outperform classical communication in a variety of information-processing tasks, but such advantages are typically established for a fixed communication network. Here we introduce topology-independent quantum advantage, in which a quantum protocol outperforms every classical protocol subject to the same communication constraint, irrespective of how the classical communication resource is distributed among the parties or which communication topology is employed, even when the parties may share unlimited classical randomness. We first demonstrate this phenomenon through a simple three-party equality task: two senders receive ternary classical inputs, while an input-free receiver determines whether the inputs are equal. We then formulate a general framework for topology-independent communication and completely characterize the corresponding classical correlation polytope in the minimal three-party scenario. Its facet inequalities reveal several instances of topology-independent quantum advantage. Remarkably, one of these inequalities enables the semi-device-independent certification of a nonunitary quantum channel, while another certifies a sequential quantum network topology without any prior assumption about the network configuration. Finally, we extend the framework to four-party networks, characterize the relevant classical communication structures, and identify a communication task exhibiting quantum advantages against all admissible classical topologies. Our results establish topology independence as a genuine and robust form of quantum advantage in communication networks.

The SU$(N)$ matrix-model potential $V=-\tfrac{g^2}{4}\sum_{I,J}Tr[X_I,X_J]^2$, the interaction of the BFSS/BMN family, whose thermal large-$N$ states are dual to black holes, is diagonal in the coordinate basis and is compiled in the literature as a phase polynomial with $O(d^2N^4Q^4)$ rotations per Trotter step. That cost is close to optimal for its gate class: we show that for a generic Trotter step the Walsh support $m_{\min}$ lower-bounds both the rotation count and the two-qubit count of every circuit over $\{CNOT,CZ,CPhase,R_{ZZ},SWAP,X,R_z\}$, ancillas included, and we build a parity network attaining $1.01$–$1.10\,m_{\min}$. Improvement therefore requires a gate outside that class, and the exact factorisation of $V$ into a sum of squared commutator entries supplies one in each era. For NISQ, Hadamard: each squared entry is added into a Fourier register and squared there, $\Theta(d^2N^3Q^3)$ two-qubit gates. For fault tolerance, $T$: reversible arithmetic with one phase-gradient injection per squared entry, $\Theta(d^2N^3Q^2)$ T gates and no arbitrary-angle rotation. Both are built and verified. With a native $R_{ZZ}$ the NISQ circuit uses fewer two-qubit gates than every parity network from $Q=6$ at SU(2) and $Q=2$ at SU(5); the oracle beats a precision-matched Hamming-weight-phasing incumbent at every point built except the smallest, by up to $11.9\times$ in T count and, at equal width, $25.5\times$ in surface-code spacetime. An ablation with the same arithmetic but no factorisation costs up to $21\times$ more and loses to that incumbent at $15$ of $17$ points, so the factorisation, not the arithmetic, produces the win. Both constructions survive the supersymmetric deformation to mini-BMN with fermions, and complete Trotter evolutions on a statevector simulator reproduce the exact product formula to $2\times10^{-12}$.

In this work we study the Bell-CHSH inequality in the vacuum of the free massive Majorana field in $1+1$ dimensions, taking as the dichotomic observables of the two parties even bilinears of smeared fields localized in the right and in the left Rindler wedges. The test functions are generated from seeds in the modular-frequency variable through the Tomita-Takesaki operator of the right wedge and, on the side of the left wedge, through its adjoint multiplied by $i$, which accounts for twisted duality. For seeds supported at positive modular frequency the one-particle overlaps between the two parties do not depend on the modular weights, and we obtain the Bell parameter in closed form. When the seeds are phase rotations of a single compact bump, the bilinears generate a copy of the Pauli algebra in each wedge, and we compute exactly the correlation matrix of the vacuum restricted to the two copies. The optimal settings violate the classical bound up to spectral widths more than twice as large as those reached with planar settings. We also show that the Tsirelson bound is never attained in the wedge vacuum for any choice of dichotomic observables, and that approaching it forces the modular spectral weight of the Bell vectors to concentrate at the spectral point $\lambda=1$ of the modular operator. This establishes in a precise way how the even sector of the free Majorana field realizes the Summers-Werner mechanism.

We develop a theory of stabilizer codes whose stabilizer groups consist of commuting qudit Paulis, oscillator displacements, and/or planar-rotor displacements. We consider codes whose stabilizer groups form generalized lattices in quantum phase space, a condition that guarantees a finite logical dimension. We construct oscillator-rotor, rotor-qudit, and oscillator-rotor-qubit codes that cannot be decomposed into separate subsystems by generalized Clifford transformations. We also introduce an oscillator-qubit code arising from a partially lifted Golay code, where Construction A is applied to half of the Golay code coordinates. We derive analytical forms of logical operators from the symplectic dual lattice, determine Clifford-Gaussian gates from lattice symmetries, show that the code dimension equals the covolume of the stabilizer lattice, and organize the syndrome subspaces into a vector bundle. Our technique builds on earlier non-commutative geometric results by Rieffel, but it can often be interpreted simply as concatenating a given stabilizer code with a Gottesman-Kitaev-Preskill (GKP) code, applying conventional lattice-theoretic results, and unconcatenating. We formulate distances, optimal decoding, and quantum weight enumerators, recovering the Pauli, qudit, and GKP versions together with known MacWilliams identities. We construct finite-energy codewords whose encoding is an isometry up to an error exponentially small in the inverse damping parameter.