Papers

We develop a normal-ordered perturbative expansion method to compute the reduced dynamics of a matter system interacting with a general continuous-mode photon field state. In this expansion, all field correlation functions are automatically normal-ordered, while the free evolution is modified by spontaneous emission. Our normal-ordered expansion elucidates the physical meaning of non-normal-ordered correlation terms in the conventional expansion. Furthermore, under intermediate coupling strengths, the normal-ordered expansion converges significantly faster than the conventional expansion, allowing one to extend the applicability of perturbative expansion to much larger matter-light coupling strengths. Interestingly, given an $m$-photon Fock state input, the normal-ordered expansion truncates exactly at the $2m$-th order. For special classes of input states, we show the normal-ordered expansion is consistent with the corresponding master equations. We demonstrate the normal-ordered expansion numerically for a two-level system interacting with coherent state, $m$-photon Fock state, and cat state inputs.

Imaginary-time evolution can be reconstructed from real-time quantum simulations using exact integral transforms. We identify the construction of Guo, Shibu, Lin, and Zhao as a continuous linear combination of Hamiltonian simulations and show that its slow $1/t_{\rm cut}$ convergence arises from a redundant kernel component. We extend the construction from pure-state matrix elements to thermal traces and correlators. One real-time dataset then reconstructs targeted inverse temperatures, Euclidean separations, and chemical potentials through classical post-processing, bringing finite-$(T,\theta,\mu)$ physics within reach of real-time quantum simulation without thermal-state preparation. We benchmark the method on one- and two-flavor lattice Schwinger models, including circuit-level simulations with depolarizing noise.

Matter-wave interferometers are sensitive probes of low energy physics and have been used for precise tests of gravity and quantum mechanics. These applications would benefit from interfering particles of higher mass, but observing the interference of a large particle is challenging due to the need to control its initial state and to avoid decoherence. Here we propose to demonstrate matter-wave interference of a microparticle with an embedded rare-earth ion. Optical transitions of the rare-earth ion will impart momentum to the microparticle's center of mass. The use of a time-symmetric interferometer geometry and a rare-earth ion state with angular momentum $J = 1/2$ will eliminate sensitivity to the initial conditions of the microparticle. We show that the rates of all relevant external decoherence mechanisms either decrease or remain constant as the microparticle mass is increased, allowing decoherence to be avoided by using sufficiently large particles. An apparatus at moderate vacuum levels will support microparticle interferometry with up to $10^3$ photons per beam splitter and millisecond coherence time. This demonstration will establish microparticle interferometry as a new platform for quantum sensing, improving searches for minimal modifications of quantum mechanics by up to three orders of magnitude in the near term and laying the foundation for future gravitational tests.

We develop an input-output formulation of quantum light spectroscopy (QLS) by combining the input-output theory, commonly used in quantum optics, with the perturbative expansion method for nonlinear spectroscopy, commonly used in chemical physics. The use of the input-output relation provides physical intuition for how matter systems alter the photon input field. As examples, we consider linear spectroscopy, fluorescence, intra-beam $G^{(2)}$, and Hong-Ou-Mandel correlation. For certain initial photon states, we show that signal expectation values can be evaluated non-perturbatively. For general initial photon states, the signals can be computed via a perturbative expansion of the input-output relation. The input-output relation reduces the work needed to perturbatively expand the optical signal, allowing for cleaner derivations and clearer physical interpretations.

Rare-earth orthochromites exhibit rich, chemically tunable magnetic behavior, making them attractive for temperature sensing and temperature-dependent switching applications. Realizing this potential requires understanding how synthesis conditions and particle morphology influence the underlying Cr$^{3+}$ magnetic ordering. Orthochromite magnetism has traditionally been characterized by ensemble techniques such as neutron diffraction and SQUID magnetometry, which report only averaged magnetic properties and cannot access particle-level information. Here we use widefield nitrogen-vacancy (NV) magnetometry to image the stray magnetic fields of individual LaCrO$_3$ microcrystals produced via molten salt synthesis, resolving the antiferromagnetic Néel transition in single particles. Of the 18 particles measured between 278 and 298 K, five show a clear onset of magnetization near the ensemble Néel temperature, four show no measurable magnetic signal, and nine display temperature-independent signatures consistent with localized magnetic impurities undetected by ensemble measurements. Below the Néel temperature, particle magnetization remains fixed under a rotating in-plane field, consistent with canted antiferromagnetic ordering rather than paramagnetism, while repeated thermal cycling shows that the magnetic field pattern varies between cooldowns with certain features recurring at the same locations, consistent with micron-scale structurally pinned antiferromagnetic domains in which the sign of the weak ferromagnetic moment is set independently each time they pass through the Néel transition. These results establish single-particle NV magnetometry as a sensitive probe of magnetic ordering and domain structure in individual microcrystals, a key step toward correlating individual particle morphology and defect structure with magnetic ordering in orthochromites.

Probing multiple properties of ground states is central to understanding quantum matter, yet conventional readout can be prohibitively costly because it consumes many independently prepared copies. Here, in copy-scarce regimes, we establish optimal trade-offs between the number of initial ground-state copies and elapsed Hamiltonian-evolution time required for estimating multiple observables or reconstructing a full classical description of a unique gapped ground state. We derive a unifying inequality that quantifies how well ground states can be distinguished using initial copies and controlled dynamics, even when all copies may be consumed. It yields worst-case lower bounds on elapsed Hamiltonian time that any protocol must incur to perform either task. We construct parallel catalytic readouts that return all initial copies nearly unchanged while attaining these bounds up to poly-logarithmic factors. Our protocols require no coherent preparation circuit or its inverse, and their elapsed Hamiltonian time depends only logarithmically on the inverse of the desired return error. Thus, optimal copy–dynamics trade-offs can be attained together with catalytic return. Numerical benchmarks further show substantial reductions in end-to-end elapsed Hamiltonian time relative to a task-specialized copy-consuming protocol, even under an optimistic preparation-cost model. Our results reveal a copy–dynamics resource landscape connecting copy-scarce learning to copy-only endpoints realized by known protocols for shadow tomography and pure-state tomography.

Near-field wavefront curvature enables joint angle-range localization, but exploiting it entails repeated covariance-eigenspace tests over a two-dimensional spherical manifold. We propose a quantum subspace-projection algorithm (Q-SPARSE) for super-resolution estimation of parameters in the near field, employing spectral signature similar to MUSIC. Q-SPARSE prepares each spherical steering hypothesis as a quantum state, applies quantum phase estimation (QPE) to covariance-generated evolution, and converts the resolved spectral mass into a localization spectrum. The proposed method does not need the full classical preparation of the eigenstates, which is a major bottleneck of the QPE algorithm, the main subroutine in quantum variants of MUSIC algorithms. Under an ideal signal-noise partition, its score equals the classical signal-subspace overlap exactly and thus preserves the maximizer of normalized near-field MUSIC. For a finite q number of qubit phase registers, we derive the score from the complete QPE kernel, and propose a nearest-bin selection scheme with soft-thresholding based on Marchenko-Pastur-calibrated logistic weighting decision criteria. Numerical results on IBM's QISKIT software platform are demonstrated for near-field array processing.

Efficient models for secure computation often rely on offline preprocessed correlations, which subsequently enable private online computation from minimal assumptions. Within these models, the study of secure non-interactive reductions (SNIR) formalizes when one classical correlation can be non-interactively transformed into another, while guaranteeing information-theoretic simulation-based privacy. In this work, we introduce quantum secure non-interactive reductions (QSNIR), a natural extension of SNIR, in which the source and target resource are each a bipartite quantum state. Specifically, when the target resource is classical, our framework enables us to analyze the problem of disseminating private correlations from entanglement, in addition to classical resources. Our primary technical result is that QSNIR privacy in this context can be computed exactly via a semidefinite program (SDP) pair that quantifies an error operationally rooted in a simulation-based cheating advantage. We prove that QSNIR privacy is lower-bounded by a decision problem related to minimum-error state discrimination (MED), and use both definitions to compute exact one-shot privacy errors for universal two-party computation (2PC) preprocessing correlations.

Secure position verification certifies that a remote prover occupies a claimed location, a task that is provably impossible with classical resources alone against colluding adversaries. Most existing quantum position verification schemes require transmitting quantum states between verifiers and provers, and the resulting photon loss makes long-distance verification impractical. Classical verifier position verification (CVPV) schemes with classical verifier-prover communication exist, but rely on complex quantum processes that generate certifiable randomness, placing them outside the reach of near-term hardware. Here we introduce a general compiler that maps any complete-support non-local game with the required quantum advantage into a multi-prover CVPV protocol. This addresses both limitations, with entirely classical verifier-prover communication and all quantum resources confined to shared entanglement and local measurements on the prover devices. Instantiating with the CHSH game enables near-term implementation on existing experimental platforms. We prove finite-size security in the quantum random oracle model for both simultaneous verification of multiple provers and verification of a single prover with multiple prover devices. Notably, security in the multi-prover setting is governed not by the certified randomness of the joint provers' outputs, but by certified blind local randomness that depends critically on the spatial arrangement of provers and verifiers.

Whether quantum computation can reduce the amount of data sampled from an unknown probability distribution required to learn a prediction rule is a fundamental question in quantum machine learning. Quantum PAC learning studies this question using quantum data as a quantum state whose squared amplitudes encode the unknown distribution from which classical learning data are sampled. With only copies of such quantum data, the optimal worst-case sample complexity asymptotically matches that of classical PAC learning. In contrast, access to both a state-preparation unitary for this state and its inverse can improve the query-complexity dependence on the accuracy parameter in realizable learning. However, it has remained unclear whether forward-only access allows such an improvement. In this work, taking the worst case over compatible state-preparation unitaries and their finite ambient dimensions, we show that the optimal forward-only query complexities of realizable and agnostic learning are, respectively, $\Theta((d+\log(1/\delta))/\varepsilon)$ and $\Theta((d+\log(1/\delta))/\varepsilon^2)$, where $d$ is the VC dimension of the concept class, $\varepsilon$ the accuracy parameter, and $\delta$ the failure probability. These bounds match the optimal sample complexities with classical data or quantum data copies. To prove them, we establish a reduction using $q$ copies of the prepared state to approximate the Haar-averaged output of any $q$-query forward-only algorithm. These results show that forward-only access cannot provide an asymptotic query-complexity advantage over learning from classical data or quantum data copies in this worst-case setting, and establish the essential role of inverse access in the known realizable-setting improvement. Our reduction also provides a new framework for analyzing limitations of forward state-preparation access via state-copy lower bounds.

An important open question in quantum cryptography is the construction of publicly-verifiable NIZKs for QMA. Classically, one can construct NIZKs for NP in the random oracle model (and sometimes in the standard model) by compiling an honest-verifier ZK (HVZK) $\Sigma$-protocol for NP using the Fiat-Shamir transformation. Broadbent and Grilo introduced a quantum analog of a $\Sigma$-protocol (which they call a $\Xi$-protocol) in which the prover's first message is quantum, and show that HVZK $\Xi$-protocols exist for QMA. However, it is not clear how to compile such protocols into NIZKs in the (Q)ROM, because the Fiat-Shamir transformation seems to be incompatible with quantum messages. In this work we give formal evidence that this is indeed the case: we show that if generic "Fiat-Shamir-like" compilers for quantum protocols exist in the QROM (with small completeness and soundness error) then QMA = BQP.

Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delays as a secondary concern, leaving fidelity vulnerable to congestion-induced decoherence. We present a coherence-aware routing protocol that integrates decoherence constraints into path selection via a priority-modulated aging model derived analytically from Weighted Fair Queueing theory, where high-priority traffic receives compressed effective queue delay. We build a custom discrete-event simulator verified against NetSquid (across 104 states), and evaluate across two structurally diverse topology classes under identical physical parameters, isolating topology structure as the sole independent variable. In all experiments, our protocol is benchmarked against loss-only Dijkstra routing and FIFO scheduling as baselines. On topologies, P2 traffic achieves 96.08% fidelity under a 9x load increase with only 0.04 percentage point degradation, versus a 13.51 percentage point collapse for the loss-only baseline; P2 tail latency holds stable at 0.055 ms while Dijkstra degrades 5.5x. On Barabasi-Albert scale-free topologies, our protocol delivers a +4.12 percentage point fidelity advantage with 97.8% higher aggregate throughput at operational loads over the baseline, with a clearly characterized hub-saturation boundary at 160k QPS. FIFO scheduling provides negligible priority differentiation on both topology classes, providing strong evidence that coherence-aware routing-not scheduling alone is responsible for the observed QoS gains.

Reset performance in superconducting qubits is often summarized by the population that remains at the end of the pulse. This is an important number, but it does not describe what happens during the reset itself. A protocol may reach a small final residual while keeping the qubit in a leakage state for a comparatively long part of the trajectory. In this work, we therefore use time-integrated leakage, together with the usual endpoint population, to study a multi-mode dissipative reset model under flux-frequency control. We examine finite thermal occupation, parameter sweeps, frequency disorder, an auxiliary-chain ablation, and a literature-based rate benchmark. At the representative ablation point, adding the auxiliary chain reduces Lf from 8.56 to 0.78 ns and shifts the sustained Pf less-than- 10-2 crossing from 39.5 to 9.8 ns. Interestingly, the configuration without the chain still reaches the smaller long-time residual. The two metrics can therefore favor different reset configurations. For the same 300 ns analysis window, an effective rate model built from the f-ket and e-ket decay rates reported by Zhou et al. gives Lf is 108.0 ns, while the complete simulated configuration gives 0.783 ns. We use this only as a kinetic reference and not as a reproduction of the experiment. In the wider set of simulations, thermal occupation is the main source of degradation, while the frequency disorder considered here has a much weaker effect. The results suggest that time-integrated leakage is a useful quantity to report alongside endpoint residuals, especially when reset is part of repeated quantum-error-correction cycles.

Topology under non-Hermitian dynamics is encoded in the phase of the bulk evolution, yet strong dissipation suppresses the amplitudes carrying it. We resolve this using a programmable photonic integrated circuit that implements such dynamics in synthetic momentum space through unitary dilation, with the phase recovered by phase-shifted interferometry. For the non-Hermitian Su-Schrieffer-Heeger model, the method distinguishes trivial and non-trivial Zak phases and yields a coherence winding $q=\pm 1$ induced by an exceptional point. Extending to a synthetic torus via a Rice-Mele pump gives the first Chern number $\mathrm{Ch}_1=0,1$ for trivial and non-trivial cycles, showing a programmable route to momentum-space topology under strongly dissipative non-Hermitian dynamics.

Collective non-equilibrium phenomena in many-body systems are strongly influenced by fluctuations, particularly in the vicinity of phase transitions, where the interplay between classical and quantum effects can alter cooperative behavior. Here, we investigate this classical-quantum competition in a kinetically constrained spin chain, the dissipative far-East model. In absence of fluctuations, the system exhibits emergent collective dynamics, resulting in phase coexistence. We find that this phenomenon is robust to quantum fluctuations, which further stabilize it, whereas classical fluctuations suppress phase coexistence at long times. We map out the steady-state phase diagram using a cluster mean-field approach and characterize the dynamics with stochastic tensor-network methods. Within the bistable phase we identify signatures of dynamical heterogeneity in both the local magnetization and the entanglement dynamics. This highlights how competing quantum fluctuations and classical kinetic constraints shape the relaxation dynamics and the phase structure of many-body systems.

We establish exponential strong converse theorems for blind quantum data compression of finite-dimensional mixed-state sources, with and without entanglement assistance. Blind compression is a fundamental quantum information processing task in which the sender aims to transmit quantum states without direct access to the classical label. Strong converse is a notable aspect of data compression: the accuracy of the compression abruptly drops down to zero once the compression rate goes below a threshold. Strong converses for data compression have been established for pure-state sources; however, for mixed-state sources, the optimal compression rate is determined by a structural decomposition of quantum states and can change substantially under small perturbations. This sensitivity makes it difficult to quantitatively analyze the trade-off between compression rate and error. Despite recent progress, whether a strong converse holds at the optimal rate has remained unresolved in general. In this work, we resolve this question affirmatively. For unassisted compression, we show that at every rate below the optimum, the accuracy decays exponentially with the block length for general mixed-state sources without restrictions on protocols. We also prove exponential strong converse for blind compression with unlimited entanglement assistance at its optimal rate. Combining the two strong converse bounds yields exponential decay at every compression-entanglement rate pair outside the complete achievable rate region. Our proof introduces a new overlap quantity based on the structure of quantum states; this quantity connects preservation of the source information to the dimension of the transmitted system. We expect that this approach provides useful tools for converse analyses of other quantum information-processing tasks involving mixed states.

Nonstabilizerness is a critical resource for quantum advantage, but evaluating it, especially for mixed states, requires superexponentially many samples in system size, making the problem NP-hard. While symmetries are known to reduce this complexity, it is unclear whether they also restrict the amount of magic. In this work, we provide an explicit example of such a symmetry by proving that the Robustness of Magic (RoM) for N-qubit X-states is at most $\sqrt{3}$. Leveraging this symmetry constraint, we introduce a computationally efficient method to lower-bound the RoM of arbitrary many-body states, demonstrating its utility on the ground states of a spin-1/2 Hamiltonian with system sizes well beyond the reach of exact evaluation. Furthermore, for Hamiltonians whose equilibrium states are X-states, we analytically derive the critical temperature at which magic emerges. Our work shows why certain symmetries constrain magic while others do not, provides a scalable lower-bounding method, and identifies a nontrivial regime where many-body nonstabilizerness is analytically solvable.

The amount of secret key that can be obtained from a quantum key distribution run depends on both the physically observed error rates and the mathematical bounds used to certify security. For finite datasets, conservative bounds force users to discard a substantial fraction of the potentially available key. Here we further refine and extend the privacy amplification bounds achievable through the recent leftover hash lemma of Regula and Tomamichel [arXiv:2603.04493] and incorporate them into the security analysis of quantum key distribution based on entropic uncertainty relations. This improves on state-of-the-art key rates in finite-block regimes, certifying more secret key from the same experimental data without changes to the protocol, and outperforming techniques based on entropy accumulation. The results illustrate how sharper mathematical estimates can directly increase the usable output of a quantum communication system.

Matchgate circuits describe classically tractable dynamics in a physically relevant setting while nonetheless exhibiting features characteristic of complex quantum systems, such as high amounts of magic. This invites the broader question: to what extent are typical complexity measures saturated under trivial dynamics? Here, we address this by studying the behaviour of different Heisenberg-picture complexity measures in random matchgate ensembles. Our main technical contribution is a tractable and generalisible free-fermionic unitary Weingarten calculus formulated entirely in the Majorana basis. This method is tailored to computing moments of operators, and simplifies to a combinatorics problem which depends on the boundary conditions prescribed by a given operator functional. Using this framework, we derive closed-form expressions for the typical local-operator entanglement, operator stabiliser entropy, and higher-order out-of-time-ordered correlators. For extensive initial Majorana strings, both operator entanglement and stabiliser entropy obey volume laws, even though the underlying circuits remain classically simulable. Out-of-time-ordered correlators can likewise become exponentially small, showing that their late-time saturation value alone does not witness computational hardness and constituting a classically tractable example of emergent free independence. Finally, we relate these separations to operator resource theories, showing how operator entanglement beyond the Gaussian baseline lower-bounds the number of non-Gaussian gates in doped matchgate circuits. Our results present a practical toolbox for computing exact averages over random matchgates, while clarifying the distinction between quantum resources versus simulation complexity, and their dependence on the representation being exploited.

In this article I revisit the frequency interpretation of probability of von Mises, and argue that it contains the key elements of any coherent interpretation of scientific probability - notwithstanding the heavy criticisms von Mises collected from mathematicians and philosophers alike. I propose a modified definition that is not based on von Mises' "infinite collectives" but retains an essential ingredient of his interpretation, namely that probability can only quantitatively be defined for events that are, or can be, repeated in similar conditions and that exhibit frequency stabilisation. New is that the mentioned "conditions" should be "partitioned". Thus, I will partition probabilistic systems into object and environment, or in object, initiating, and probing subsystem, and show that such partitioning solves a series of classic problems. Other consistent interpretations can be unified with frequentism, e.g. Bayesianism à la Jaynes. I explore in detail the tantalising subjective or operationalist touch of probability, and argue that it can be put on objective grounds. One further upshot of the model is that several quantum puzzles can be seen as deriving from an imprecise interpretation of probability.

Entanglement and state distinguishability have long been central topics in quantum foundations. While each has developed into a rich subject in its own right, they can be connected through measurements in complementary bases. This connection provides insights into quantum and classical correlations and underlies many information-processing tasks, most notably quantum error correction (QEC). However, it has remained largely open whether the connection between entanglement and distinguishability extends to general measurements without assuming complementarity. We answer this question in the affirmative: the key is irreducibility induced by measurements, a much more relaxed condition than complementarity. Specifically, for POVMs satisfying an irreducibility condition, we establish a quantitative relation between the infidelity of one-sided local transformation into a maximally entangled state and the failure probability in state discrimination. We then characterize when both errors can vanish simultaneously. Our results have direct applications to entanglement distillation and QEC. Their errors can be certified by estimating classical input-output correlations from experimentally accessible local measurements, without requiring complementarity. The results also extend to quantum measurement theory. We derive novel trade-off relations that bridge two historically distinct approaches: information gain–irreversibility and observable noise–disturbance. Our connection between entanglement and distinguishability via irreducibility thus offers a common framework for entanglement distillation, QEC, and measurement trade-offs.

Quantifying dissipation is essential for controlling quantum noise and characterizing open-system dynamics. In practical experimental settings, residual noise may still persist despite efforts to suppress it, making it important to determine whether the dissipative strength remains within a prescribed tolerance threshold. We study this question for an unknown, time-independent Lindblad generator with bounded strength, where the jump operators are local but with unrestricted overlap, using only memoryless forward-evolution access. The task is to distinguish dissipative strength of at most $\varepsilon_1$ from strength of at least $\varepsilon_2$, for $0 \leq \varepsilon_1 < \varepsilon_2$, measured in the canonical dissipator's normalized Frobenius norm. We give an algorithm that solves this task in total evolution time $O(\varepsilon_2/(\varepsilon_2-\varepsilon_1)^2)$ for all nontrivial thresholds, with constant success probability, and provide a matching lower bound $\Omega(\varepsilon_2/(\varepsilon_2-\varepsilon_1)^2)$ that establishes optimality even for adaptive protocols. This extends dissipation testing to the tolerant setting and eliminates the bounded-degree requirement, making the framework applicable to a broader range of experimentally relevant settings.

In the study of quantum process tomography, it has remained open how to learn a unitary channel in diamond distance with strictly parallel queries as efficiently as with sequential queries. Sequential queries allow one to exploit adaptivity to refine the estimate and adjust the learning strategy accordingly, whereas such adjustments are impossible for parallel queries. From the perspective of higher-order quantum operations, any parallel learning strategy can be simulated by a sequential one, whereas the converse does not hold in general, suggesting that sequential learning strategies are potentially more powerful. Contrary to this intuition, we present a new protocol for learning an unknown $d$-dimensional unitary channel to within $\varepsilon$ in diamond distance using $\mathcal{O}(d^2/\varepsilon)$ parallel queries, matching the lower bound presented in [Haah, Kothari, O'Donnell, and Tang, FOCS '23]. Our protocol thus closes the gap between parallel and sequential strategies for unitary channel tomography. As applications, it achieves optimal query complexity for boundary-regime quantum channel tomography and improves the query efficiency of the best-known protocol for tomography of fermionic linear optics.

We determine the exact strong converse exponent for secret-key transmission and generation over general finite-dimensional quantum wiretap channels, measuring reliability and secrecy jointly by squared fidelity to an ideal secret key. We introduce a novel Renyi private information whose regularization characterizes this exponent. An exact integral representation in terms of ordinary private information gives a uniform continuity bound, showing that the regularized quantity converges to private capacity as the Renyi order approaches one. This establishes for any wiretap channel an exponential fidelity decay at every rate above private capacity.

We introduce a local and distributed framework for decoding quantum LDPC codes. Built atop belief propagation (BP), the architecture combines strictly local processing of syndrome information, local feedback, autonomous operation, and highly parallelized decoding. We establish the framework at two complementary levels. First, we show that any code exhibiting a threshold under iterative BP decoding can be promoted to an autonomous local measurement-and-feedback dynamics while preserving that threshold. We then turn to codes for which naive BP does not itself exhibit threshold behavior. Our key observation is that BP can nevertheless provide sufficiently accurate local marginal information: active syndrome defects use these local beliefs to move, pair, and annihilate through asynchronous feedback. We demonstrate numerically that this construction exhibits threshold behavior in the point-like sectors of the two- and three-dimensional toric codes, where conventional BP decoding fails. Exploiting the graph-generality of BP, we then study the inference dynamics on the membrane-like sector of the three-dimensional toric code and in a family of bivariate-bicycle quantum LDPC codes.

Can a symmetry be tested optimally without using the quantum resource naturally associated with it? For parallel subgroup-versus-Haar testing, we derive a quantitative representation-theoretic converse for every protocol with zero type-I error: the excess type-II error is bounded below by the sum of two nonnegative penalties, one for weight on suboptimal subgroup types and one for deviations of within-type Schur profiles from their typewise extremal profiles. At optimality, both penalties vanish, yielding support and weight locking for every optimal system marginal. Disjointness of the resulting locked set and the free marginal set rules out resource-free optimality, whereas overlap alone does not establish attainability. For the diagonal torus in dimension $d\geq 2$, optimal testing without coherence is possible only with a single query. We determine both the exact optimal type-II error over all protocols with incoherent system marginals and the minimum system-marginal coherence required to attain the unrestricted optimum. For the orthogonal subgroup in dimension $d\geq 2$, a real protocol attains the optimum at every query number. For the qutrit Clifford group, Wigner-positive optimal protocols exist at three and four queries but not from five through nine; whether they exist beyond nine queries remains open. Together, these results relate the subgroup- and query-dependent resource requirements of optimal symmetry testing to structural constraints on optimal system marginals.

Multimode optomechanical scattering is ubiquitous in free-space imaging protocols, but its radiation pressure counterpart is challenging to detect with extended objects. Here we demonstrate radiation pressure actuation of a nanomechanical membrane using dynamically structured light from a spatial mode demultiplexer (SPADE). Using single- and two-mode illumination, we directly image the position-dependent intermodal coupling between Hermite-Gauss (HG) modes as mediated by the membrane's motion. As an application, we use multimode radiation pressure feedback to simultaneously cool two nearly degenerate membrane modes. Our results are applicable to diverse mechanical systems and serve as a stepping stone to SPADE-based quantum optomechanics.

It is shown that Shannon entropy, Fisher information, and quantum-mechanical kinetic energy may all be viewed as measures of correlation. We begin with a fundamental correlation-destroying map: a joint probability density $\rho(x,y)$ is replaced by $\rho_x(x)\rho_y(y)$, the product of its marginal distributions. In the discrete case, Shannon's entropy is nondecreasing under this map. For continuous distributions, this fundamental map leads to a well-behaved, coordinate-invariant correlation measure, analogous to the discrete Shannon entropy: \[ I[\rho] = h[\rho_x] + h[\rho_y] - h[\rho]. \] In the continuous case, however, another measure appears: Fisher information. The relative Fisher information $J(\rho\|\rho_x\rho_y)$ behaves similarly under the fundamental map. For a normalized real quantum wavefunction, this decrease is exactly proportional to the decrease in mean kinetic energy, \[ \langle T\rangle_\psi - \langle T\rangle_\Phi = \frac{\hbar^2}{8m} J(\rho\|\rho_x\rho_y), \qquad \Phi = \sqrt{\rho_x \rho_y}. \] In Jaynes's language, the result supports a principle of minimum justified correlation: given physical constraints and a set of possible distributions or related amplitudes satisfying those constraints, select from that set those with the least correlation. This is Part I of a two-part paper. Here we develop the entropy, Fisher-information, and kinetic-energy identities above, and state the principle they support. Part II addresses questions which Part I raises but leaves unanswered: multiple solutions, time dependence, the role of spin, a route to the Schrödinger equation itself, and a proposed experimental test. AI has been used.

Suppose a Hamiltonian $H$ has a unique ground state $|\psi_0\rangle$ with an eigenvalue $E_0$, and we have an estimate $\tilde{E}_0$ such that $|\tilde{E}_0-E_0|\leq\delta$, and there is a gap of at least $3\delta$ between $E_0$ and all other eigenvalues. Suppose we have a unitary $A$ available that can produce a "guiding state'" $A|0\rangle$ that has overlap at least $\gamma$ with $|\psi_0\rangle$. We show how to obtain an $\eta$-approximation of $|\psi_0\rangle$ with probability at least $1-\varepsilon$ using $O(\log(1/\varepsilon)/\gamma\delta + \log(1/\eta)/\delta)$ applications of $U=e^{iH}$ its inverse, and $O(\log(1/\varepsilon)/\gamma)$ applications of $A$ and its inverse. We give two different algorithms, one based on interleaving amplitude amplification and error-reduction in the style of [HMdW03], and one using the composition of transducers. This paper is the state-preparation follow-up to our two recent ground-state-energy estimation papers [JW26,SdW26]. Combined with the optimal energy-estimation of [JW26], our results show the claimed upper bound for ground-state preparation. The bound is optimal up to a constant factor in terms of the number of applications of $U$ and $U^\dagger$ if $\varepsilon=\eta$, as follows from [SdW26]. In one of our approaches to ground state preparation, we construct transducers for amplitude amplification and LCU that might be of independent interest.

Quantum algorithms are powerful tools for finding symmetries of classical objects, most famously through Shor's algorithm and the Hidden Subgroup Problem (HSP). In this work, we study quantum algorithms for learning symmetries of quantum objects. Existing work in this area centres on the recently introduced State Hidden Subgroup Problem (StateHSP), a quantum generalisation of HSP in which the task is to learn the symmetry subgroup of a quantum state. We develop efficient quantum algorithms for non-abelian StateHSP when the hidden subgroup is normal and the ambient group belongs to a broad class of non-abelian groups, extending the previous general theory beyond the abelian setting. StateHSP learns Bose symmetries, under which a state must be invariant exactly under the action of the symmetry group. In quantum mechanics, however, physically equivalent pure states are defined only up to global phase. Motivated by this, we introduce a natural notion of Anyonic state symmetry learning, based on invariance up to global phase. We give an efficient quantum algorithm by reducing the problem to StateHSP, where the reduction rests on a new correspondence between linearisations of projective representations and linear error-correcting codes. As an application, we obtain an improved algorithm for learning stabiliser groups of mixed qudit states of arbitrary local dimension. Finally, we introduce symmetry learning problems for other quantum objects, including unitaries, Hamiltonians, and finite collections of states, and give efficient algorithms for them by reduction to state symmetry learning. Together, these results broaden the scope of state symmetry learning as a common algorithmic primitive for learning quantum symmetries.