Papers

Quantum sensing increasingly demands materials combining room-temperature optical spin addressability and coherent control with rapid, accessible fabrication. Yet semiconductor platforms require costly materials and specialized processing, while molecular systems often depend on bespoke synthesis or involved crystal growth. Here we apply microspacing in-air sublimation (MAS) to rapidly fabricate quantum-sensing materials within minutes. Microgram quantities of commercially available precursors crystallize on glass, in air and without vacuum or inert-gas handling. Monitored in situ, growth yields optically clear, stoichiometric single crystals of excellent quality, including plates and needles with intrinsic optical waveguiding. Donor-acceptor charge-transfer co-crystals pairing anthracene or biphenyl with tetracyanobenzene, together with localized-exciton pentacene:pentacenequinone (P:PQ), exhibit room-temperature optically detected magnetic resonance (ODMR). Charge-transfer ODMR resonances reach linewidths below $4\mathrm{MHz}$, consistent with motional narrowing of mobile triplet excitons, while P:PQ supports coherent ensemble spin control with $T_2=0.56\mu\mathrm{s}$. Functionality across chemically and electronically distinct pairs establishes MAS as an accessible screen for molecular quantum-sensing materials, connecting molecular crystal engineering with low-cost, chemically tunable thin triplet-spin layers and waveguiding sensor geometries for quantum sensing and microscopy.

We simulate three-flavor neutrino oscillations on two-qubit quantum circuits. The flavor space is embedded as $\ket{00}=\nu_e$, $\ket{01}=\nu_\mu$, $\ket{10}=\nu_\tau$ with the $\ket{11}$ channel kept inert, and the input mixing parameters (NuFIT~5.3, normal ordering, with SK-atm) follow the global fit. We verify three physical settings against analytic or exact references: vacuum propagation, reproduced by a mass-eigenstate phase circuit to $\sim 10^{-16}$; constant-density Mikheev–Smirnov–Wolfenstein (MSW) matter effects, showing resonant flavor conversion when the matter potential $A$ crosses $\Delta m^2_{31}$; and varying-density (supernova shock-shell) propagation by slicing plus second-order Suzuki–Trotter splitting, with per-slice Trotter error $\sim 10^{-6}$ and total accuracy $\sim 10^{-4}$ against the continuous profile. We report a Suzuki–Trotter precision–resource calibration varying order, step number, and matrix/probability error. It delimits brute-force Trotterization on solar baselines: we quantify both standard alternatives, coherence averaging and adiabatic MSW. We also compute quantum-information diagnostics from the same model parameters, namely mode entanglement and the CP asymmetry. Finally, we extend the framework to open quantum systems via a Lindblad master equation with dephasing and absorptive channels. These results provide a reproducible link between low-energy oscillation observables and quantum-information measures.

Received optical power determines photon arrival flux, but photon arrival flux does not certify a quantum key. This paper gives a deployment-independent interface from a classical free-space optical (FSO) link budget to phase-randomized weak coherent pulse BB84, decoy-state estimation, and composable finite-key postprocessing. The channel interface separates geometric collection, atmospheric extinction, residual pointing, and detector efficiency, and states when common geometric and pointing expressions are approximations. The finite-key output follows the decoy-state analysis of Lim et al., with key- and test-basis counts estimated separately and an infinite-decoy asymptotic reference. The numerical study covers a five-level attenuation sweep, basis- and vacuum-probability sensitivities, a conditional Chernoff comparison, and integer-count Monte Carlo. For $3.33 \times 10^8$ emitted pulses, the Hoeffding-based predicted one-kilobit-per-second distance limits are 2.727, 1.883, 1.472, 1.236, and 0.962 km from very clear to dense-fog parameterizations. These are conditional performance predictions, not experimental security certificates. Satellite, drone, high-altitude-platform, terrestrial, and train links enter through the same interface but require their own propagation, acquisition, and device inputs. The framework integrates established security tools into an engineering procedure without claiming a new security proof or a universal range.

Magic state distillation is a widely considered primitive in fault-tolerant quantum computation for the preparation of high-fidelity non-Clifford resources. The most commonly considered class of such protocols are generalised triorthogonal codes; these distil $n$ noisy input $\mathrm{T}$ states into purified third-level diagonal magic states. Extensive prior work has searched this space of protocols, often using heuristic methods that do not guarantee optimality. Existing classification work is limited to protocols distilling $k$ output $\mathrm{T}$ states with $n+k\leq 38$ (Nezami and Haah, Phys. Rev. A 106, 012437 (2022)). In this work, we significantly expand this classification to all protocols with lengths $n\leq 54$. We restrict to distance $d\geq 3$ to keep the classification to a sensible size, and because efficient searches are well understood at distance $2$ (Singh et al., arXiv:2606.28518). Moreover, our results are complementary to synthillation (Campbell and Howard, Phys. Rev. A 95, 022316 (2017)), which can distil third-level states from $\mathrm{T}$ states, but only at distance $2$. Under optimality in terms of input count, space footprint, and distance for a given output, we find $74$ optimal generalised triorthogonal protocols in our range, $65$ of which are new to the literature. To achieve our classification, we extend the classification of unital triorthogonal spaces of Nezami and Haah from length $38$ to $54$ using a directional derivative method. Using these as the stabiliser spaces, we add logical rows that satisfy the triorthogonality constraints to create full protocols.

We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.

We study the tri-partite genuine Rényi multi-entropy of fully symmetric Gaussian states as a function of the squeezing parameter for different total number of bosonic modes under different subsystem configurations. Exact results for a few modes are obtained, and we conjecture an asymptotic formula at the limit of large squeezing parameter as a function of the replica index $n$, while also finding subleading subsystem-size dependent terms for $n=3$ under a specific tripartition. We analytically show that the genuine $n=2$ Rényi multi-entropy of any pure bosonic Gaussian states is zero for any number of modes and for any tripartition. Furthermore, to investigate the dependence on subsystem size, we plot the curve of genuine Rényi multi-entropy as a function of the number of modes in the subsystems while keeping the total number of modes fixed. We discuss differences and similarities between this result and studies of the multi-entropy curve for Haar random states. In particular, we identify a subsystem size configuration related with the multi-entropy time in an evaporating black hole for which the behavior of the genuine multi-entropy changes.

We ask whether Kochen-Specker contextuality is Lorentz invariant. On the full Hilbert space, it is, since boosts act unitarily. Restricted to spin, it is not: momentum acts as an environment applying momentum-dependent Wigner rotations, leaving spin observables unsharp and breaking the operator identities behind state-independent contextuality. For spin $1/2$ one scalar governs the loss, the packet average $\Delta$ of $\sin^2(\theta_W/2)$ (where $\theta_W$ is the Wigner angle); for any spin, a ray degrades at a rate set by its spin variance transverse to the boost. In the spin-only account, the Free Will Theorem's SPIN axiom fails for every $\Delta>0$; the Yu-Oh set loses contextuality between $\Delta\approx0.008$ and $0.016$, with state independence going first; the Peres-Mermin square loses contextuality at $\Delta\approx0.059$ or $0.074$ by orientation; singlet CHSH loses nonlocality for $\Delta\geq0.159$; and a GHZ-state OR gate loses Raussendorf's contextuality certificate at $\Delta\approx0.206$. A $q$-plate implements the channel exactly on photon polarisation, with a retardation in place of the rapidity, so the nonlocality, GHZ and aimed-source results are testable without motion.

The sample complexity of identifying an unknown pure stabilizer state has been a longstanding problem in quantum information. In this paper, we resolve the entire exact critical crossover for the uniform ensemble of pure $n$-qubit stabilizer states under arbitrary collective measurements and without side information. For $k=n+c$, with fixed integer $c$, the optimal success probability converges to an explicit positive series $P_{\infty}(c)$. In particular, $P_{\infty}(0)=0.1760837896\ldots$, while its two tails obey a quadratic-exponential law below threshold and $1-P_{\infty}(c)\sim2^{-c}$ above threshold. The pretty-good measurement is exactly optimal for every finite $n$ and $k$. The proof diagonalizes the stabilizer Gram operator through Clifford tensor-power duality and a defect filtration, including the exceptional binary sectors. The resulting integer-scale law quantifies the $n+O(1)$ copy threshold.

The spectral weight with which a many-body eigenstate contributes to a given channel is not fixed by the smooth one-point ETH envelope, and its higher-order correlations—the connected cumulants of three and more channel-resolved spectral functions—have lacked a systematic organization. We construct one. In random free fermions, where every channel overlap is a squared Slater minor of a Haar-orthogonal one-body eigenvector matrix, the $r$-resolvent moment admits an exact replica-sector decomposition: a sum over the double-coset sectors of the orthogonal Weingarten algebra, in which the permutation sectors are the replica contraction classes and each sector value is determined by the overlap pattern of the channels and of the eigenstates. The sector coefficients follow from an exact occupancy-matrix assembly—a signed convolution over the slot permutations, a decomposition into connected blocks, and a finite-state chain transfer matrix whose local transition rules are independent of $r$ and $k$—so the sector theorem holds at arbitrary finite multiplicity, realized exactly at $r=3$ ($k=2,3,4$), $r=4$ and $r=5$ ($k=2$). The structure carries the physical hierarchy: the fully coincident sector is the projection that yields the Selberg moment ratios $q_r$, the levels are nested by exact marginalization, and the sectors are the multi-energy spectral cumulants behind the resolvent cumulants, with the irreducible self-energy vertices of the Feshbach ladder as the connected kernel. The multi-resolvent correlations of random free fermions are therefore organized, level by level, by one replica-sector algebra—an exact microscopic benchmark for the higher-order fluctuation sector of eigenstate thermalization, with its microscopic sector geometry made explicit.

Quantum physics underpins the emerging quantum technology era, yet its counterintuitive principles remain challenging for beginners. Video games offer a promising medium to make these principles accessible through an interactive experience. Conventional gameplay, even when featuring extraordinary abilities of the protagonist, largely draws on classical intuition, shaping the player's reflexes through familiar expectations of motion, action, and consequence. Here, we propose extending these reflexes into the quantum domain by embedding superposition, unitary evolution, quantum gates, and measurement into the game. Central to this approach is a new controller action, the Gate of Fate, which allows players to engage in quantum operations through their gaming decisions. We demonstrate the concept in a Tetris-based prototype, with progressively structured levels that introduce quantum operations and their consequences. We also outline extensions to role playing games, in which the behavior and difficulty of antagonists can respond to player's developing quantum gaming reflexes. By turning abstract quantum concepts into actionable game mechanics, this approach aims to cultivate quantum intuition through play, offering opportunities for both quantum pedagogy and more sophisticated game design.

We propose a new $q$-derivative operator built directly from Jackson's $q$-number formulation, designed to preserve the structural properties of standard differential calculus while incorporating deformation effects. By analyzing $q$-deformed Heisenberg algebras, we demonstrate that this formulation maintains the consistency of thermodynamic quantities-such as internal energy, particle number, and specific heat-in dilute gas limits without requiring ad-hoc chain-rule modifications. Furthermore, we explore the physical implications of algebraic deformation using the Biedenharn-Macfarlane realization, showing how $q$-deformation induces intrinsic anharmonicity in quantum oscillator spectra and affects multi-level quantum systems ($d \ge 3$). Applying this algebraic scheme to superconducting transmon qubits, we derive analytical pulse-shaping corrections that generalize the Derivative Removal by Adiabatic Gate (DRAG) technique, offering a robust method to suppress computational leakage in ultra-fast quantum logic operations.

Encrypted training relies on keeping server-side updates low-degree. This constraint traditionally excludes models whose weights inhabit a compact Lie group (notably variational quantum circuits, where every trainable weight is an $\mathrm{SU(2)}$ rotation). Expressed in Euler angles or discrete alphabets, these updates appear transcendental, historically demanding prohibitive costs: one client–server round per gate, or upwards of $25{,}000$ operations per weight. This penalty is strictly an artefact of coordinates. In the unit-quaternion (spin) chart, group composition is exactly bilinear (degree two, with coefficients in $\{-1,0,+1\}$). Consequently, encrypted rotation updates cost one multiplicative level and federated averaging costs zero in any levelled homomorphic scheme, completely eliminating bootstrapping. This implementation-independent algebraic property is confirmed across two cryptographic backends, introducing only $0.0$ and $-2.0\times10^{-12}$ rad of aggregation error. Leveraging this reduction yields a non-interactive protocol for encrypted federated training of hybrid quantum–classical networks. It includes correctness proofs for aggregation and sign handling, plus a compilation lemma proving parameterised entanglers add only constant-factor overhead without altering the depth class. Empirically, a paired five-seed study confirms zero measurable utility tax ($\Delta=+9\times10^{-6}$ MSE, $p=0.92$), and a noise-budget ablation falsifies the hypothesis that encryption noise regularises. These convergence trends replicate across datasets and scale to $20$ clients. Finally, hardware validation on a $156$-qubit processor achieves $0.9918$ fidelity against a $0.99957$ unencrypted control.

Existing quantum simulations of the two-flavor Schwinger model have run at a single lattice size, and it is not known how far the variational approach can be pushed or which weakness stops it first. Following the model from N = 2 to 6 staggered lattice sites, we find that the binding constraint at reachable sizes is hardware noise rather than circuit expressibility or trainability, and identify N = 3 as the immediately viable extension of existing trapped-ion experiments. The energy error of a charge-conserving ansatz collapses onto one function of p/d, the ratio of variational parameters to physical-sector dimension, and falls by more than two orders of magnitude as p/d rises through order unity, giving the expressibility condition L(4N - 1) >= binom(2N,N) for L circuit layers. The condition is local in chemical potential: at N = 3 the layer count sufficient at zero chemical potential leaves a 74.38% error near the first-order boundary, while one further layer reaches 0.08%. Charge conservation also protects trainability and prevents charge-sector leakage: as the qubit count doubles from 4 to 8, the normalized gradient variance falls to 1/3.56 of its starting value for the constrained ansatz, versus 1/13.57 for an unconstrained circuit. Comparing a global contraction with per-gate local noise, a fixed-parameter control shows that the noise model, not whether the optimizer runs inside the noisy loop, sets how strongly noise degrades the first-order transition. At N = 4, a noiseless control reaches 0.12% mean error, whereas the same circuit at 1.00% depolarizing noise reaches 25.69 to 52.81%.

In this paper, we define directed partial join graphs with signed couplings and construct discrete-time quantum-walk transition operators for these graphs using the shunt-decomposition framework. The resulting transition operators apply to several important graph families, including complete graphs with loops, circulant partial joins, complete bipartite graphs, tensor powers of complete bipartite graphs, all with signed couplings. For each family, we identify the corresponding structure of the transition operator and derive necessary and sufficient conditions for periodicity and perfect state transfer (PST), when one of the two directed regular graphs admits PST. Based on these results, we identify two types of state transfer; internal PST, which occurs between vertices within the same graph, and coupling PST, which occurs between two components of join graphs. We further develop a double-cover construction for directed partial join graphs and derive conditions for periodicity and PST when the associated transition operators do not necessarily commute. Using this construction, we establish PST results for double covers of complete graphs with loops. In particular, we provide an example in which the complete graph \(K_n\) does not exhibit PST for \(n\geq4\), whereas a suitable partial join of \(K_n\) exhibits PST when \(n=2^m\), \(m\geq2\). Hence, these results extend the class of graph families admitting PST in shunt-decomposition-based quantum walks and provide a unified framework for studying quantum state transfer in graph joins, products, and covers.

We study planar openbooks obtained by lifting braids through branched covers of D^2, together with the quantum operations in the Ising representation. We give a criterion for the Stein fillings to be Calabi-Yau (CY). Among positive factorizations of a fixed monodromy, a CY one has minimal length and its filling minimizes \chi and b_2. Applied to Baykur's recent examples, this gives a planar contact 3-manifold with infinitely many non-homeomorphic CY fillings, the cover there having degree \ge 6. At degree 4 a single CY filling forces every filling to be CY, and in one case the filling is unique; at degree \le 3 it is unique, and CY under a mild condition. Admissible cuts of D^2 decompose the openbook into subopenbooks. Every positive factorization then localizes, and the CY condition holds exactly when it holds locally. The state space is then a direct sum of tensor products indexed by the compatible parity choices, with at most two qubits per factor when the pieces have degree $\le 4$, the same range in which the CY condition depends only on the monodromy. For one degree 4 cover, the points, lines and flags of the two-qubit doily are realized by its subopenbooks. Fifteen liftable braids there share the same quantum operation and Stein filling, and are separated only by the subopenbook systems they admit. A choice of tensor-product structure is thus carried by the lift, not by the braid group representation, suggesting a link between contact topology and quantum entanglement.

Graph states are a fundamental resource for measurement and fusion-based quantum computing, quantum networks, and sensing. Preparing them in a photonic system deterministically is, in principle, possible, but finding efficient schemes to prepare them was a long-standing problem addressed recently. Additionally, heuristic optimization schemes for reducing the required number of two-qubit gates were developed. However, the problem of reducing the number of emitters by optimizing the emission ordering was not addressed, due to its computational complexity, as it is connected to a well-known NP-hard problem from graph theory, the linear rank width computation. In this work, we focus on developing heuristic polynomial algorithms to reduce the number of emitters required. In total, we propose four distinct algorithms, which demonstrate up to $30\%$ emitter reduction on random graphs. Furthermore, we provide numerical and statistical evidence that the combination of our optimization schemes with the preexisting algorithms for optimizing the two-qubit gates of the preparation protocol can further reduce them by around $20\%$. Finally, we examine the developed algorithms for various useful graph state families, such as graphs useful for measurement-based quantum algorithms, and cluster states and graph codes used for quantum error correction, to determine the performance of each algorithm.

The encoding of 3-uniform edge-ordered weighted hypergraphs into multiqubit quantum states is proposed. We derive an analytical expression for the geometric measure of entanglement of hypergraph quantum states and establish its relation to hypergraph properties. The results establish a direct connection between the local structure of hypergraphs, hyperedge weights, and the entanglement of the corresponding quantum states. For equally weighted hypergraphs, it is shown that the entanglement depends explicitly on the vertex degree. The dependence of entanglement on hypergraph parameters is studied analytically and using quantum computing. Hypergraph states associated with chain, star, regular lattice, and binary-tree hypergraphs are examined, and their entanglement is quantified using quantum computing. These results open up the possibility of studying hypergraph properties with quantum programming.

The most general strategy for estimating parameters of a quantum channel is to probe the channel many times sequentially with the help of coherent ancillary systems. However, finding the strategy that minimizes the mean-squared error (MSE) is a notoriously hard problem, requiring optimization over the initial probe state, intermediate evolutions, final measurement, and classical postprocessing. In this work, we study how the minimum attainable MSE can be bounded from below in this setting. We propose a lower bound for the MSE of any physically implementable sequential sensing strategy that applies to estimating parameters of any physical quantum evolution, including quantum channels probed over multiple time steps under temporally correlated noise and general temporally correlated quantum processes. We show that this lower bound can be formulated as a semidefinite program (SDP). Our bound generalizes the Nagaoka-Hayashi lower bound (that applies to parameter estimation tasks with separable measurements) to the regime where the quantum channel can be accessed sequentially multiple times. For regular finite-dimensional single-parameter sequential estimation tasks admitting an optimal strategy, we show that our SDP bound is tight and provide a procedure to obtain a locally optimal strategy from the SDP optimizer. Using our optimization bound, we compute the MSE lower bound and derive new protocols for several other physically motivated problems including error-corrected quantum sensing under an unknown correlated noise model, multiparameter estimation, and estimation with qudit systems.

Extracting operationally meaningful quantities such as von Neumann entropy and mutual information is central to characterizing many-body quantum systems, yet experiments and numerics often provide direct access only to integer Rényi entropies. Whereas conventional extrapolation relies on a prescribed fitting ansatz, in PRL 137, 100202 we introduced an alternative approach based on stabilized analytic continuation (SAC), which avoids such an ansatz and is inherently robust to noise. Here, we further develop this framework in the noiseless setting and benchmark its performance across several nontrivial many-body problems. We first show that, besides the intrinsic ambiguity of reconstructing the von Neumann entropy from finitely many Rényi samples, analytic continuation can also fail because of genuine nonanalyticities in the Rényi function arising from zeros of $\text{Tr}\rho^z$. We derive universal zero-free domains for $\text{Tr}\rho^z$ and systematically sharpen these bounds using additional spectral information about $\rho$. We then benchmark the performance of SAC in three settings: ($i$) extracting topological entanglement entropy from DMRG Rényi data for the toric code and Kagome Heisenberg models; ($ii$) reconstructing the mutual information between disjoint intervals in a $(1+1)d$ compact-boson CFT; and ($iii$) recovering finite-time ballistic growth of the von Neumann entropy from integer Rényi entropies that cross over toward subballistic growth in diffusive quantum dynamics. In the latter setting, analytic continuation is expected to fail in the long time limit. We illustrate this mechanism with a physically motivated two-sector model, where the asymptotic separation between von Neumann and higher-Rényi growth is accompanied by a zero of $\text{Tr}\rho^z$ pinching the real axis at $z=1$, thereby producing a first-order Rényi phase transition.

Haar randomness is the standard null model for quantum typicality, scrambling, and random-matrix formulations of thermalization. In many physical settings, however, randomness is naturally constrained to subspaces of Hilbert space. This structure arises, in particular, both in systems with symmetry-resolved sectors and in the Eigenstate Thermalization Hypothesis (ETH), where mesoscopic energy windows define subspaces in which nearby energy eigenstates are mixed. Motivated by these settings, we consider a Block-Unitary Ensemble consisting of independently Haar-random unitaries acting on each subspace. We develop a constructive Weingarten Calculus for this ensemble, providing a unified framework across quantum information and many-body physics. This construction reveals a symmetry-resolved Schur-Weyl duality, where the relevant commutant is not the ordinary permutation algebra, but the one of color-preserving permutations. We apply this framework to quantum states under symmetry constraints and to energy-resolved ensembles for ETH.

Decoherence-induced phase transitions (DIPTs) are associated with singular changes in a quantum system's entanglement structure as the decoherence strength varies. In many cases, their critical strengths depend monotonically on the Rényi index of the entanglement diagnostic, forming a Rényi hierarchy. We identify a general mechanism for this hierarchy based on correlation inequalities in replicated statistical models that describe these DIPTs. We demonstrate it in $\mathbb{Z}_2$ topological stabilizer codes subject to independent phase-flip decoherence on each qubit and in a decohered rotor model with strong $\text{U}(1)$ symmetry. When the relevant correlations diagnose the DIPTs, these inequalities imply that the critical decoherence strength is nondecreasing with integer Rényi index $R\geq2$. We show that this mechanism also applies to a class of models with correlated decoherence.

Quantum resources can dramatically reduce the data required to learn physical systems, with exponential improvements in sample complexity demonstrated in several quantum learning tasks. However, these advantages have typically relied on quantum resources that scale with problem complexity, most notably increasing system dimension or entanglement. This raises a fundamental question: can exponential quantum learning advantages arise within a fixed, unentangled quantum system? In this paper, we address this question by considering the learning of an unknown random-displacement distribution whose complexity is determined not by the dimensionality of the physical system, but by the Fourier resolution of its features. We show that the quantum-limited noise of vacuum probes progressively obscures high-frequency features, leading to an exponential growth in sample complexity. We establish an information-theoretic lower bound for arbitrary classical-state probes and show that squeezing overcomes this classical limit by extending the accessible Fourier bandwidth. Experimentally, we demonstrate an exponential reduction in sample complexity using squeezed vacuum probes for both binary hypothesis testing and characteristic-function reconstruction. Our results show that a single bosonic mode can exhibit exponential quantum learning advantages without entanglement or an increase in system size, identifying accessible Fourier bandwidth as a fundamentally distinct resource for quantum-enhanced learning.

We study entanglement transitions for pairs of disjoint intervals in two-dimensional holographic interface conformal field theories. We consider several holographic models with equal central charges on the two sides of the interface: thin-wall geometries with one and two branes, the Janus solution, and the super-Janus solution. We first discuss the finite interface contribution to the entanglement entropy of a single interval, distinguishing intervals that cross the interface from those that lie entirely on one side. We then use the mutual information to locate the transition between connected and disconnected Ryu–Takayanagi geodesic configurations for two intervals. When the interface lies between the two intervals, increasing the boundary entropy $\log g$, which provides a measure of interface strength in the models considered here, generally decreases the critical separation at which the connected configuration ceases to dominate. When both intervals lie on the same side of the interface, the behavior is model dependent: the connected phase persists to larger separations in the Janus and super-Janus models, while the critical separation is unchanged in the thin-wall models. Thus, as diagnosed by the two-interval transition, the interface weakens correlations across the interface while preserving or enhancing correlations between regions on the same side. We also identify a universal “Silver Blaze” configuration, in which the interface lies inside one of the intervals and the transition occurs at the same location as in a CFT without an interface, independently of the interface parameters and of the holographic model. This universality follows from a cancellation between crossing and non-crossing interface contributions to the mutual information.

Commuting-projector Hamiltonians with integer spectrum such as the 1+1d Ising ferromagnet and the 2+1d toric code may be regarded as the generators of non-on-site $U(1)$ symmetries. In this paper we study whether these symmetries can be made on-site in the presence of finite and infinite-dimensional ancillae. In the finite-dimensional case, we prove that the fractionalized excitations, such as domain walls and anyons, make it impossible to on-site these Hamiltonians. On the other hand, we show that when infinite dimensional ancillae (e.g., rotors) are allowed, both the 1+1d Ising ferromagnet and the 2+1d toric code can be disentangled, yielding on-site symmetries. This is not in contradiction with the non-trivial ground state order of these Hamiltonians, since the ancilla Hamiltonians are no longer bounded from below. Our results indicate agreement between lattice and quantum field theory anomalies in the presence of infinite-dimensional ancillae, while with finite-dimensional ancillae the obstruction to on-siteability may even be non-invertible.

Renormalization group (RG) is a core concept in physics from statistical mechanics to quantum field theory, yet its schemes differ widely between field theory and many-body physics. We formulate the Wilsonian RG as a quantum channel, whose Kraus representation yields pure conditional trajectories for pure inputs and recovers mixed-state flows upon averaging. We then develop an algebraic extension applicable beyond the usual momentum-space, factorized setting: the low-energy algebra is constructed from the one-particle spectrum, and coarse graining is a conditional expectation onto it. We further construct a resource theory of RG whose free states are fixed points. For thermal states, the resulting relative-entropy monotone is proportional to $c-c_{\rm IR}$ to quadratic order along a single stable RG direction near a two-dimensional IR fixed point. We also introduce a complementary measure of the UV information discarded by coarse graining, establish its monotonicity for successive coarse-graining maps, and discuss its holographic realization.

The Yukawa-Sachdev-Ye-Kitaev (YSYK) model, a solvable model of non-Fermi liquids with a proposed cavity-QED realization, couples $N$ complex fermions to $M$ bosons of frequency $\omega_0$ through random Yukawa couplings of strength $g$, and its dynamics depends only on $R\equiv\omega_0/g^{2/3}$. For $R\ll1$ the bosons are slow and act as a static random background in which the fermions are free, while for $R\gg1$ they are only virtually excited and generate a random four-fermion interaction of rank $M$, which is generically chaotic for $M\geq2$. Using exact diagonalization at infinite temperature, we follow the emergence of random-matrix statistics between these limits with unfolded spectral statistics and the Krylov complexity of the thermofield-double state. For complex couplings the level-spacing distribution evolves from Poisson to Gaussian-unitary-ensemble (GUE) statistics, the spectral form factor develops a correlation hole and a ramp, and the Krylov complexity evaluated on the unfolded spectrum develops a peak above its late-time plateau whose height reaches the GUE value. All diagnostics locate the onset around $R\approx0.3$, and adding boson modes moves it to smaller $R$. This delineates the parameter regime in which a cavity-QED realization would display random-matrix spectral correlations. On the other hand, real couplings give the same crossover towards Gaussian-orthogonal-ensemble (GOE) statistics, and along an interpolation between the two the peak height follows the mean gap ratio, so the peak identifies the symmetry class as well as the onset of chaos. Without unfolding the peak stays about 20$\%$ below its random-matrix value in both classes, which we trace to the non-semicircular density of states, and at larger $R$ the boson-number bands slow down the spreading of the state in Krylov space.

Distinguishability is a central concept in information theory and extends naturally to quantum systems. This work shows that, for any two finite-dimensional memoryless quantum channels, parallel, adaptive and general testing strategies achieve the same Stein exponent at every fixed type-I error tolerance $\epsilon\in(0,1)$, namely the regularized channel relative entropy. When this rate is finite, any larger type-II exponent forces the probability of correctly accepting the null hypothesis to decay exponentially. Thus, adaptivity provides no asymptotic advantage. The key step is proving the continuity of the regularized sandwiched Rényi channel divergence at order one. We also derive the exact strong-converse exponent for general testers.

Feature selection is an essential step for reducing complexity of high dimensional data, usually in preparation for developing machine learning models such as computational biomarkers. However, there are limitations associated with feature selection such as for metabolomic data where there are hundreds or even thousands of features per study participant, while the available number of participants in a clinical trials is limited. Classical methods such as exhaustive search require evaluation of all possible feature combinations, making them costly in terms of computation and runtime, or even infeasible, as feature dimensionality increases. In this study, we propose a novel Quadratic Unconstrained Binary Optimization (QUBO) coefficient formulation and pose metabolomic feature selection as a QUBO problem that selects a specified number of features by balancing their relevance against redundancy among the selected variables. To evaluate our proposed QUBO objective function, we conducted a series of experiments using Bias-Field Digitized Counterdiabatic Quantum Optimization (BF-DCQO) and Quantum Approximate Optimization Algorithm (QAOA) on a quantum gate based computer. We also compared the method to several classical methods on three metabolomic datasets associated with Autism Spectrum Disorder (ASD) on a classical computer. Our method reduces runtime compared with exhaustive search and Iterative Tabu Search (ITS) and achieves competitive performance across classifiers compared to classical filter, wrapper, and embedded methods. These results do not claim quantum advantage; rather, they establish hardware feasibility and demonstrate the current capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices.

A key challenge in quantum cryptography is to build quantum one-wayness and pseudorandomness without the use of (quantum computable) one-way functions. So far, this has turned out to be a difficult task, with only a few proposed candidates that are not directly built from one-way functions. Even within these few proposed candidates, we have lacked the techniques to analyze when proposed constructions may inadvertently yield one-way functions. In this work, we introduce efficient NP-aided shadow tomography of quantum states. We prove that collections of computable pure states can be learned via efficient NP-aided shadow tomography, where we say that a state is computable if the amplitude and phase on any computational basis term can be classically efficiently computed given the description of an efficient preparation circuit for the state. We also give new algorithms for NP-aided learning of unitaries given polynomially many queries to the unitary. By building on this, we show that many existing architectures for PRS and PRU, including some that were explicitly introduced for the purposes of avoiding one-way functions (e.g., Hamiltonian Phase States, Bostanci et. al., TQC 2025), actually do imply the existence of one-way functions or imply \(\NP\) hardness. We hope that these no-go results will inform future investigations into building PRS and PRUs from assumptions that are plausibly outside the complexity class NP.

Recent advances in quantum simulation have enabled the discovery of novel forms of universality in quantum many-body dynamics. In this Review, we discuss deep thermalization and Hilbert space ergodicity–two recently discovered phenomena characterized by the emergence of distributions of quantum states that are "maximally random" in a precise sense. They offer a new perspective on how irreversible statistical mechanics arises from reversible unitary quantum dynamics, going beyond conventional theories of quantum thermalization and equilibration. We review a unifying framework, rooted in quantum information theory and principles of maximum entropy, that explains the different forms of ergodicity which arise under various physical constraints. We discuss open questions and active research directions, including generalizations beyond ensembles of pure quantum states, phase transitions in deep thermalization tied to deeper forms of ergodicity-breaking, connections to broader topics in quantum thermalization and ergodicity, and applications in quantum information science, such as for benchmarking or tomography.