Public access to pulse-level and control-electronics interfaces in commercial quantum computing has bifurcated. The largest superconducting cloud platforms have closed access at this layer, with IBM removing pulse-level control from all production QPUs in February 2025; mid-tier superconducting vendors and the more open neutral-atom platforms have moved in the opposite direction. We survey thirteen commercial vendors across superconducting, trapped-ion, neutral-atom, and photonic modalities, grading each on six axes of openness at what we call the control plane: the layer between gate-level circuit specification and physical control electronics. The catalog ships as a separate machine-readable artifact under CC-BY-4.0 (DOI: this https URL). The bifurcation is documented row by row, with implications for reproducibility, hardware-aware research, and cross-vendor benchmarking. We do not propose an architecture or a reference implementation; we describe what the field has lost as the access landscape has shifted, and what minimally open access at this layer would have to look like.

This letter proposes a novel hybrid key distribution architecture that jointly exploits quantum key distribution (QKD) and Kirchhoff-law-Johnson-noise (KLJN) statistical-physical key exchange. In the proposed system, an optical BB84-type QKD link operates in coordination with a parallel wired KLJN link, which is used for secure basis handling and, in selected protocols, additional raw key generation. Three novel KLJN-assisted QKD protocols are introduced to eliminate public basis disclosure messages and bit sifting, extract basis-derived key bits, or generate raw key bits under ideal KLJN assumptions. Analytical expressions for the normalized key rate and absolute throughput are derived by accounting for optical channel penalties, KLJN bandwidth constraints, and synchronization bottlenecks. Numerical results show that the proposed hybrid architecture can improve key generation efficiency and throughput in short-haul infrastructures, including metropolitan area networks (MANs) and data center interconnects.

Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of efficient general-state encoding circuits an important problem, particularly with respect to two-qubit gate count and circuit depth. Yet the synthesis of such encoders has been studied less extensively than general Clifford circuit synthesis or the preparation of specific logical Pauli-eigenstates. In this work, we develop methods for synthesizing efficient encoders for arbitrary stabilizer codes. We formulate encoder synthesis as a search over stabilizer tableaus and introduce greedy and rollout-based algorithms that exploit the freedom among stabilizer-equivalent realizations of the same encoding isometry. For code families with a modular structure, such as generalized concatenated and holographic codes, we show how large encoders can be assembled from optimized local constituent encoders, and we use SMT-based exact synthesis to obtain optimal local circuits for small instances. We further evaluate the proposed methods on a broad set of stabilizer codes, including holographic and quantum low-density parity-check (qLDPC) codes, and compare them against recent encoder-synthesis methods and existing constructions from the literature, obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth. Our results support the optimization of encoded-state preparation in several fault-tolerant quantum-computing schemes, and all methods are openly available as part of the Munich Quantum Toolkit.

Quantum simulation is widely regarded as one of the most promising routes to genuine quantum advantage, yet most existing approaches to quantum chemistry are formulated in terms of closed-system, unitary dynamics and ground-state preparation within the Born--Oppenheimer approximation. In this review, we discuss a broader perspective motivated by the observation that naturally occurring quantum systems are rarely isolated and often reach physically relevant states only through relaxation, decoherence, and thermalization. We first examine what is and is not known about exponential quantum advantage in chemistry, emphasizing that coherent Hamiltonian simulation provides the clearest formal case for speed-up, while many open questions remain for realistic problems. We then discuss how dissipation might ideally be integrated into quantum chemistry on a fault-tolerant quantum computer, using recent proposals for chemically motivated dynamical simulation as a guiding vision. More generally, we highlight the practical appeal of this approach to enhancing the robustness of quantum algorithms.

We present an architecture-algorithm co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware. Analyzing the OQFT structure, particularly its reliance on phase-gradient resources and small-scale blocks, highlights architectural requirements for resource mobility and parallel execution. Guided by that, we introduce a hot-zone architecture that decouples data storage from processing and dynamically routes mobile resource packages (magic-state factories, bridge qubits, and phase-gradient registers) to stationary data regions. To expose dominant costs, we route rotation insertions via catalytic phase-gradient addition and heuristically micro-schedule ripple-carry adders to patch-level moves. Under this model, leading Gidney~\cite{Gidney2018halvingcostof} and Cuccaro~\cite{cuccaro2004} adders have similar space-time volume but require different levels of parallelism. At the algorithm level, the five-layer OQFT shows a tunable parallelism/latency trade-off: two hot zones match serial-QFT latency, four hot zones roughly halve runtime, and additional hot zones asymptotically approach constant-time execution at substantial resource cost. Across 256-2048-bit instances, the requirements for half-time performance converge to about 500 additional logical ancillae and a peak parallelism of 128 logical qubits. We also identify broader algorithm-architecture bottlenecks, including endianness mismatches between phase-gradient and data registers, addressed via cyclic phase-gradient swaps and alternating QFT reflections. Scoped to surface codes and cultivation-only magic-state factories, our analysis identifies reaction-limited operation and parallelism demand as primary drivers of resource estimation and establishes a generalizable foundation for primitive-based architectural studies.

We introduce energy-space quantum walks as a minimal framework to investigate equilibration, thermalization, and irreversibility from an effective-dynamics perspective. By mapping the configuration space of a walk onto a ladder of energy eigenlevels, we reinterpret thermalization as transport in energy space, independently of microscopic system--bath details. At the classical level, the resulting birth--death--lazy dynamics leads to equilibration of the energy distribution and, under suitable conditions, to a Gibbs stationary state. We then embed this dynamics into a unitary, collision-assisted model in which coherence is controlled by a single parameter. A central result is a structural decoupling between population dynamics and coherence generation: while the populations evolve according to the classical process and relax to the Gibbs distribution, the full quantum state exhibits a persistent coherence-induced deviation from the thermal manifold. This establishes a minimal scenario of thermalization without state convergence, where equilibration occurs at the level of populations but not at the level of the full density operator. We quantify this effect using the thermal distance to the Gibbs state and derive perturbative bounds that relate the long-time deviation to classical transport properties. Our results show that coherence acts as a controllable and quantitatively bounded source of nonthermal behavior, providing a clear separation between classical equilibration and genuinely quantum corrections.

We develop an error-corrected quantum computation scheme based on concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code. The approach skates a thin line: it is explicitly not fault tolerant, risking higher logical error rates, and it relies on selective filtering to prepare encoded states for error correction, risking significant overhead. Yet, at realistic simulated noise rates, the scheme is reliable and resource efficient. It forges a practical path toward scalable quantum computation.

Applying single-qubit Clifford unitaries to a Pauli stabilizer code produces a Clifford-deformed variant whose stabilizers remain Pauli operators, but with locally rotated Pauli axes. Such deformations provide a simple way to tailor a fixed code to anisotropic noise, and have enabled unusually high thresholds under strongly biased dephasing. In this work, we discuss zero-rate quantum low-density parity-check (LDPC) codes, for which there exist Clifford-deformed variants where the number of biased logical operators scales slower than the distance, or there exists a basis of logical operators whose overlap satisfies certain scaling conditions; in this case, the code-capacity threshold for the Clifford-deformed variant under i.i.d. pure dephasing noise approaches 50%. This property provably explains previously known code examples with 50% biased noise thresholds, such as XY surface code, XZZX surface code, color code, as well as some 3D Clifford-deformed codes. As a concrete new example, we study Clifford deformations of the tile codes of Ref. [1]. Similar to the phase diagram of 50% thresholds for random Clifford deformations of the surface code in Ref. [2], we find a similar phase diagram for the tile codes. We also construct several translationally invariant deformations of the tile code with 50% thresholds, and present numerical evidence for improved performance at finite bias and under circuit-level noise. In the circuit-level setting, performance is governed by the residual bias after a full syndrome-extraction cycle, linking our simulations to phenomenological models commonly used to study Clifford-deformed codes. We estimate this residual bias for different qubit platforms by modeling microscopic implementations of tile-code syndrome extraction.

We present hybrid quantum-classical pipelines for solving the Duffing equation that leverage Carleman linearization and the Variational Quantum Linear Solver (VQLS). First, we demonstrate that Carleman linearization accurately approximates the weakly nonlinear Duffing equation, with errors diminishing as the truncation order increases. Next, across IBM and Xanadu platforms, we deploy VQLS with symmetry-grouped Hadamard Test evaluations under both global and local cost formulations, compare distinct Hermitianization within a common cost framework, and benchmark hardware-efficient ansatz architectures under a fixed Hermitianization. Across block-banded test cases, each method achieves near-unity fidelity and vanishing relative residuals. These results show that topology-agnostic ansatz, optimized Hermitianization, and efficient cost formulation enable VQLS to recover quantum states proportional to classical solutions for Carleman-structured systems, providing a portable recipe for quantum-in-the-loop simulation of nonlinear dynamics.

Accurate salt-body delineation is essential for seismic interpretation because salt structures distort wave propagation, complicate velocity-model building, obscure reservoir geometry, and increase uncertainty in exploration and drilling decisions. Although hybrid quantum-classical models have shown competitive performance on small-scale image-classification tasks, their value for dense, pixel-level geophysical prediction remains largely untested. This work introduces quantum feature gating, a hybrid segmentation architecture that embeds a parameterized quantum circuit (PQC) at feature-fusion points within an encoder-decoder pipeline. A 4-qubit, 2-layer PQC with data re-uploading computes a learned convex combination of lateral and top-down features at each Feature Pyramid Network merge point. A global-average-pooling layer maps encoder features to a fixed 4-dimensional quantum input, decoupling the 72-parameter quantum budget from backbone size and image resolution. The method is evaluated on the 2018 TGS Salt Identification Challenge using 4,000 seismic images at 101 x 101 resolution, across two integration topologies, eight circuit variants, and six encoders with 8M to 118M parameters under five-fold cross-validation. In a controlled EfficientNetV2-L ablation at 256 x 256 resolution, replacing the three Quantum FPN Gates with element-wise addition while holding the encoder, loss schedule, splits, and threshold search fixed reduces mean IoU from 0.9389 to 0.8404, a 9.85 percentage-point gap. Inserting the same circuit as skip-connection attention in a custom U-Net improves IoU by 0.88 points over the SolidUNet baseline, showing that the PQC contribution depends on where and what it gates. These results provide controlled evidence that quantum feature fusion can improve dense seismic segmentation.

We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes. Such codes naturally live in symmetric power representations, where the relevant error sectors are determined by the irreducible decomposition of the conjugation action on the associated operator space. Using the multiplicity-free structure of this decomposition and the corresponding intertwiner algebra, we identify the intrinsic MacWilliams matrix with a finite Racah transform. The entries are given by a terminating hypergeometric series, and the rows of the matrix are Racah orthogonal polynomials with parameters determined explicitly by the block length and local dimension. Computing the spectrum of the degree-one twirl reveals that this spectrum lies on an affine quadratic lattice. Then we derive a tridiagonal multiplication rule from the representation theory of the adjoint sector. As consequences, we obtain closed-form orthogonality, detailed-balance, and involutivity identities for the transform. The resulting formula supplies an explicit MacWilliams matrix for computing linear programming bounds on permutation-invariant qudit codes.

We introduce an ultrafast, bright, entangled twin-beam source generated by type-0 parametric down-conversion in periodically-poled lithium niobate at MHz repetition rate, with continuously tunable Schmidt number $K$ set by the pump pulse duration. Photon-number statistics characterization via $g^{(2)}(0)$ and singular-value decomposition of the signal spectral density matrix yield $K\simeq1.05$ and $K\simeq1.03$, respectively, maintained over multiple orders of magnitude in brightness. Group-delay dispersion of the pump drives a continuous transition from single-mode operation to a controlled multimode regime, consistent with the temporal gain window departing from the inverse phase-matching bandwidth. Strong non-degeneracy of the source (signal at 1.37 um, idler at 4.0 um, $\sim 100$ fs duration) decouples a mid-infrared interaction wavelength, which overlaps with molecular vibrational resonances, from a near-infrared detection band, establishing a practical platform for quantum-enhanced metrology, nonlinear interferometry, and mid-infrared spectroscopic sensing. We show that in the bright few-mode limit, the total entanglement resource is clearly separated between modal and occupational degrees of freedom, and that our source allocates up to 95-97% of that resource to the occupational sector.

Adaptive Non-local Observables (ANOs) have shown that making quantum observables dynamic can substantially enlarge the function space of Variational Quantum Algorithms, partly shifting hardware demands from circuit synthesis to measurement design. However, this advantage is accompanied by a steep increase in the number of parameters, as well as the classical optimization cost for varying general Hermitian observables. We propose a special form of ANO that significantly reduces this burden by considering only diagonal observables paired with quantum circuits. Mathematically, this is equivalent to the full ANO of a large parameter space since diagonal matrices are canonical representatives of the ANO space modulo unitary similarity. As a result, Diagonal ANO retains the same capability of full ANO while reducing $k$-local observable complexity from $O(4^k)$ to $O(2^k)$ and lowering the corresponding measurement-side classical computation. In this sense, diagonal ANO preserves much of the benefit of full ANO while encompassing conventional VQCs as a special case.

We construct coherent states for the quantized electromagnetic field that correspond to the classical non-null torus knot solutions of Maxwell's equations in vacuum. We derive the displacement operators from the general relation between classical fields and coherent state amplitudes and verify the defining properties of coherent states through direct computation. We determine the observables of the model: field expectation values, energy density, Poynting vector, helicity, photon number, quadrature uncertainties, and correlation functions, and calculate their expectation values in the knotted coherent states in terms of the integer parameters $(n,m,l,s)$ of the classical solutions. As an example, we particularize the construction in the case of the Hopfion coherent state. These results establish the quantum-classical correspondence for this type of vacuum topological electromagnetic systems.

Entanglement in continuous-variable Gaussian systems is a key resource, and common reservoirs can both suppress and generate correlations. Existing work focused on pre-entangled states or Markovian baths, leaving open whether separable squeezed inputs entangle in structured environments or under modulation. We study two bosonic modes coupled to a common reservoir, each initialized in a separable squeezed vacuum. Dynamics are analyzed utilizing Gaussian covariance methods, evolved under approximate Non-Markovian quantum state diffusion (QSD), finite-temperature pseudomode embeddings, and Bures-based non-Markovian diagnostics. We identify three mechanisms absent in Markovian dynamics: (1) A detuning condition that freezes entanglement trajectories across reservoir correlation times; (2) birth, death, and revival of entanglement from orthogonal inputs; and (3) integer-locked beating with square-wave oscillations produced by periodic detuning. All mechanisms persist at finite temperature, with deviations bounded within 5% in cryogenic regimes and 20% at moderate occupations. These deviation bounds align with cryogenic cavity, phononic, and optomechanical platforms, where structured spectral densities and detuning modulation are already accessible. Structured reservoirs are shown to emerge as tunable entanglement resources for continuous-variable quantum technologies.

We reformulate the Rényi entanglement of purification as a constrained minimum output Rényi entropy problem. Equivalently, for $p>1$, this formulation can be expressed in terms of a constrained maximal output Schatten $p$-norm. More precisely, for a completely positive map $\Omega:L(B')\to L(A)$, we consider the quantity $\upsilon_p(\Omega)$ defined by optimizing $\|(\Omega\otimes \mathrm{id}_E)(\sigma^{B'E})\|_p$ over all bipartite states $\sigma^{B'E}$ whose $B'$-marginal is maximally mixed. We focus on the case $p=2$. First, we compute $\upsilon_2$ for the transpose-depolarizing channel and prove that it is multiplicative under tensor powers. We then establish a general multiplicativity criterion: whenever a completely positive map $N:L(B')\to L(A)$ satisfies $N^{\dagger} \mathbin{\circ} N=a\,\mathrm{id}_A+b\,\mathrm{Tr}[\cdot]\,I_d$ for some constants $a,b\ge 0$, where $N^{\dagger}$ denotes the Hilbert-Schmidt adjoint of $N$, the quantity $\upsilon_2(N)$ is multiplicative under tensor powers. Examples of channels satisfying this criterion include the transpose-depolarizing channel, the depolarizing channel, and their respective complementary channels. Furthermore, we show that, for every completely positive map $\Omega$, multiplicativity of $\upsilon_p(\Omega)$ implies multiplicativity for its complementary map. This yields the corresponding additivity statements for the associated Rényi-2 entanglement of purification.

In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. Conventional flows minimize AND count in an {XOR, AND, NOT} basis as a proxy for T, which neglects phase cancellation and can be far from T-optimal. We instead formulate an exact T synthesis problem and canonicalize Boolean functions under Clifford equivalence. By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%.

Dissipation remains a central obstacle to improving superconducting quantum circuits, yet the microscopic origins of loss in widely used materials platforms are not fully understood. Here, we report the observation of interface piezoelectricity-induced dissipation in superconducting qubits fabricated on high-resistivity silicon. Our devices use a transmon qubit with a shunt capacitor that simultaneously serves as an interdigital transducer embedded in a surface acoustic wave resonator. By tuning the qubit transition into resonance with discrete mechanical modes, we observe up to a factor-of-two reduction in qubit lifetime, consistent with energy exchange between the qubit and mechanical modes mediated by piezoelectric coupling at the aluminum-silicon interface. Our findings provide direct evidence for interface piezoelectricity as a distinct loss channel in superconducting qubits. Combined with multiphysics simulations, these findings suggest that interface piezoelectric loss can dominate over loss from two-level systems at sufficiently high frequencies.

We develop a quantum landscape approach to characterize the long-time behavior of wave packet spreading in linear open quantum systems. Instead of treating diffusion, localization, and collapse of the wave packet as separate dynamical phenomena, we show that they originate from the symmetry structure of an underlying landscape in covariance space. The geometry of this landscape determines these distinct long time behaviors. Trapping potentials and bath fluctuations act as distinct symmetry-breaking perturbations, leading to noncommuting long-time limits and abrupt changes in the asymptotic wave-packet width. This geometric picture provides a unified origin for wave-packet diffusion, localization, and collapse in dissipative quantum dynamics.

We develop a rigorous mathematical framework for quantum game theory applied to static 2x2 games, extending classical concepts to the quantum setting where players may employ arbitrary unitary operations (pure strategies) or probability measures over the continuous group SU(2) (mixed strategies). The Eisert-Wilkens-Lewenstein protocol is introduced as the standard implementation of quantum 2x2 games. We prove the existence of Nash equilibria for continuous quantum mixed strategies via a fixed-point argument, generalising the classical Nash theorem to the quantum case.

How many measurements are fundamentally required to capture a signal. Shannon's information theory established the bedrock of this question in 1948, the Nyquist Shannon theorem set the first answer, and compressed sensing (CS) rewrote it in 2006 by reducing the required measurement number to M = O(Klog(N/K)) for a K sparse signal. Here, we propose quantum compressed sensing (QCS), a paradigm that reframes signal acquisition as a unitary quantum evolution. By encoding high dimensional signal information into a single quantum probe state, then introducing domain-alignment evolution,a physically realizable unitary transformation that maps the sparse basis directly onto the measurement basis. QCS executes the support-set search at the quantum level without consuming measurement trials. The logarithmic penalty vanishes, compressing the required measurement number from the classical bound to M =O(K) and reducing reconstruction from ill posed optimization to linear estimation. We experimentally validate QCS using frequency and time domain sparse signals, confirming that the measurement number scales linearly with sparsity and decouples entirely from the signal dimension. Our work provides a physical pathway toward ultimate information acquisition efficiency, with broad implications for sensing, imaging, and communication.

The dynamics of dissipative many-body quantum systems sometimes admit an emergent classical description in terms of a Markov chain even though the corresponding state space contains highly entangled states. In particular, a bad-cavity laser is a paradigm system whose dynamics can be formulated as a Markov chain in a two-dimensional state space spanned by collective angular momentum states. In this article, we investigate the connection between a dissipative phase transition that occurs in the subradiant regime of this system in the large atom number limit, and the properties of the underlying Markov chain. In one of the phases, the Markov chain approaches the detailed-balance condition with increasing atom number $N$ and hence becomes effectively time-reversible. This is caused by a collective atomic emission process that effectively reduces the Markov chain to one dimension. In the other phase, we find the emergence of time-asymmetric probability currents in the two-dimensional state space that signals a breakdown of detailed balance. This is accompanied by a macroscopic internal entropy production rate in the Markov chain that scales extensively with the atom number $N$. An observable consequence of the probability currents is a self-pulsing of the cavity light output in this phase, which can be detected as an anti-correlation dip in the intensity correlation function.

The Nakanishi Fujii Todo (NFT) algorithm, also known as Rotosolve, implements Sequential Minimal Optimization for Variational Quantum Eigensolvers (SMO-VQE) by exploiting the trigonometric dependence of the energy on individual circuit parameters. This enables analytical one-dimensional minimization using only a few , typically two, energy evaluations, but introduces bias in the estimated energy. Although performing additional measurements every few tens of iterations can mitigate bias accumulation, we find that such corrections often degrade optimization performance. In this paper, we analyze the origin and accumulation of bias during the SMO-VQE process. Specifically, we show that the bias can be accurately estimated without additional measurements. Furthermore, we find that bias correction destabilizes optimization along directions with small curvature, whereas the original biased estimator implicitly acts as a regularizer. Based on these insights, we propose a simple regularization method that implements error accumulation while maintaining unbiased energy estimation. The resulting algorithm consistently improves performance across different system sizes, circuit depths, target Hamiltonians, and measurement shots, with minimal hyperparameter tuning.

Non-Hermitian physics enables novel control over open quantum and wave systems, but selectively isolating individual modes without delicate balancing of gain and loss remains challenging. Here we introduce a gauge-engineering method in directed-graph networks that support geometry-protected pure decay modes-eigenstates exhibiting smooth exponential amplitude decay along directed paths. In fully connected configurations, a single dominant mode naturally emerges with a large, tunable energy gap from the rest. By adding synthetic gauge fields via phase-compensated non-reciprocal hopping, we can promote any desired pure decay mode to the dominant position, while preserving its amplitude profile. The approach extends to simultaneous selection of paired modes in half-connected graphs and customizable multi-mode distributions in higher dimensions via orthogonal folding. Our method enables robust, loss/gain-free control over mode profiles, advancing applications in single-mode lasers, sensors, and quantum processing.

The quantum Internet relies on the ability to distribute entangled quantum bits (ebits) between quantum memories at the end nodes, to perform applications like blind or distributed quantum computing that are impossible if end nodes are connected via a classical, i.e., non-quantum network. This need creates new challenges due to the fragile nature of entanglement, which decoheres over short timescales and cannot be amplified, buffered, or retransmitted. Two broad categories of approaches have been proposed in the scientific literature to realize such an entanglement distribution in a given path: one relying on a synchronous time-slotted model, and another one where intermediate nodes interact asynchronously. However, both of them implicitly assume a serial operation, where one ebit is established and made available to the application on end nodes before creating a new one. This is inefficient in long-range networks, with high transmission latencies, if the intermediate nodes have multiple memory qubits that could be used in parallel. To overcome this limitation, in this paper, we study the implications of multiplexing concurrent ebit requests on the same quantum, for both synchronous and asynchronous operation. Furthermore, for the latter, we define a novel distribution protocol, called HOPPER, where the intermediate nodes make autonomous and hop-by-hop decisions on the use of their local resources when establishing an ebit. With numerical simulations, we show that HOPPER is effective in handling multiple ebit requests in parallel, and it exhibits significantly better performance than a synchronous alternative in different scenarios.

Decoherence is usually described as the loss of local quantum coherence after tracing over environmental degrees of freedom. This reduced description, however, hides the reservoir state that carries the lost coherence. Here we show that spin-boson decoherence can write a postselectable nonclassical imprint into a structured bosonic reservoir. We map zero- and finite-temperature reservoirs to one-dimensional chains, evolve the joint qubit-reservoir state with tensor-network dynamics, and reconstruct the Wigner function of a time-adaptive leading collective reservoir coordinate after transverse qubit readout. The conditioned mapped-reservoir coordinate develops Wigner negativity and interference fringes that are strongly suppressed in the unconditional reservoir state. A parameter sweep shows that the spectral exponent and temperature control the visibility of this conditional nonclassicality, the mapped-chain excitation transport, and the degree to which a single collective coordinate captures the imprint. These results provide a branch-resolved phase-space picture of decoherence: the reservoir is not only a sink for qubit coherence, but can carry a measurement-conditioned nonclassical state in a collective mapped coordinate.

We experimentally demonstrate a universal, parameter-independent test for asymmetric source discrimination. The test allows us to discriminate faint sources well beyond the diffraction limit by exploiting spatial mode demultiplexing (SPADE) and single-photon detectors. Our test yields a rate of false negatives well below what can be achieved by diffraction-limited direct imaging. Our tabletop experimental setup is inspired by the problem of exoplanet detection, where one aims at detecting the presence of a faint source in the proximity of a brighter one. We present a complete theory, modelling arbitrary modal crosstalk, and collect data across a range of values for the source separations and intensity ratios. We show that SPADE retains an advantage over direct imaging in the relevant regime of small separations and low intensity ratios. Remarkably, we identify an experimentally accessible crosstalk threshold $C_{\mathrm{th}}\simeq 0.1$ below which the exponential rate of false negatives stays well below that of direct imaging. For example, for crosstalk of $10^{-2}$, SPADE needs up to one order of magnitude fewer photons than direct imaging to achieve the same error rate. These results demonstrate that SPADE offers an effective methodology for subdiffraction asymmetric hypothesis testing, under realistic imperfections and crosstalk, paving the way to photon-starved imaging tasks.

We propose a method for generating collective spin cat states in a cavity-coupled atomic ensemble by exploiting strong light-matter entanglement and anti-squeezing associated with the superradiant phase transition. We numerically and analytically demonstrate that the cat states can be heralded by photon-number measurement on the ground state of the Dicke model. The near-critical regime enhances both the cat-state size and the probability of obtaining larger photon-number outcomes, and outcomes with larger photon numbers yield even larger cat states. We also show that a thermodynamic-limit analysis clarifies the generation mechanism and connects it to a natural light-matter analogue of generalized photon subtraction for optical cat-state generation. These results suggest that exploiting criticality in strongly coupled light-matter systems could open new directions for matter-based many-body quantum technologies.

We consider a quantum system described by a quantum channel $\Phi$ that is applied at every time step and study the time evolution of its information capacities. When $\Phi$ is a GNS-symmetric channel (this includes Pauli channels, for example), we give explicit exponential convergence bounds for the classical and quantum capacities. These bounds are in terms of entropic properties of $\Phi$. We further illustrate how these results help quantify the performance of active versus passive error-correction setups.

Classical transport equations with probabilistic initial conditions can be viewed as quantum systems. In a discrete version they are probabilistic automata. The time-local probabilistic information is encoded in a classical wave function. Its unitary evolution obeys a Schrödinger equation. Statistical observables are represented by operators which do not commute with the ones associated to classical observables. Examples are functions of the quantum energy or the quantum angular momentum. They are important conserved quantities. We construct a complex functional integral for the quantum system which describes the probabilistic classical transport equation. The characteristic features of quantum mechanics, as the superposition of wave functions, interference, the importance of phases, non-commuting operators or a unitary time evolution, are realized by probabilistic classical transport equations.

Density Functional Theory (DFT) is widely used for atomistic simulations. However, its reach stays limited due to several limitations such as lack of accurate exchange-correlation functional, requirement of costly O(N 3) diagonalization etc. Although quantum computing offers paths forward, including variational techniques, embedding strategies, and quantum linear solvers, the discussion remains scattered. Without shared terms or structure, evaluating progress in hybrid quantum-classical DFT efforts becomes challenging. To bring order, we introduce a three-axis scheme based on where the method connects into DFT, whether the quantum part boosts precision or cuts time, alongside intended device type: current noisy machines or future error-corrected ones. Sorting known approaches in this way shows why embedding frameworks fit modern tools better, while faster linear algebra waits for more advanced systems.

Dynamical quantum phase transitions in non-Hermitian systems pose fundamental challenges due to the intrinsic biorthogonality of their eigenstates. In this work, we extend a biorthogonal framework to investigate dynamical quantum phase transitions in non-Hermitian topological superconductors. Taking the non-Hermitian Kitaev chain as a prototypical model, we construct an associated-state formalism and reformulate the Loschmidt rate function, dynamical topological order parameter, and dynamical Fisher zeros. Within this framework, we find that the critical times at which dynamical quantum phase transitions occur differ from those based on the conventional self-normal approaches. We further analyze momentum-resolved subsystems at critical momenta and demonstrate the robustness of the biorthogonal framework. Our work highlights the essential role of biorthogonality in nonequilibrium dynamics and establishes a consistent theoretical framework for dynamical quantum phase transitions in non-Hermitian topological superconductors.

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

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

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

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

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

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

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

Direct-register quantum generative models for calorimeter shower simulation tie the quantum output dimension to the image dimension, so the required register size grows with the full image. Recent quantum-assisted methods reduce this pressure only by moving part of the generative task into hybrid latent-variable models. Consequently, current quantum demonstrations remain far below detector-scale geometries used in high-energy physics. We introduce the Quantum Feature Amplification Network (QFAN), which removes this register-size bottleneck by generating an image as a sequence of blocks. Each block is produced by the same small parameterized quantum circuit, conditioned on a compressed summary of the pixels already generated. Reusing the circuit fixes the qubit requirement by block size rather than full image size, while the per-step quantum processing cost is independent of image size for the Pauli-observable family used here. We derive a conservative worst-case bound on shot-noise propagation through the generation chain and give an empirical decoder-capacity heuristic for the reachable sequential depth. A three-qubit circuit with twelve shared variational parameters, closed-form ridge decoders, and a post-hoc residual sampler reproduces per-pixel intensity distributions, inter-pixel correlations, and total energy distributions of calorimeter showers on both simulator and IBM quantum hardware. At this scale, the hardware-simulator gap is consistent with optimization-budget limits dominating over device noise, although the experiments do not causally separate these effects. The results establish a hardware-compatible proof of principle and motivate, but do not validate, larger-scale extrapolations within this circuit family.

We study mutually unbiased bases (MUBs) as structured finite initialization and adaptation families for variational quantum algorithms. The main theoretical result is that, in every dimension admitting a complete set of MUBs, the complete MUB ensemble maximizes isotropic Gaussian random-Hamiltonian width among all unions of d+1 orthonormal bases in C^d. Equivalently, within this basis-union class, it gives the smallest expected best-of-set minimum for random-Hamiltonian minimization. The proof represents each orthonormal basis as a regular-simplex Gaussian block and uses a centered-convex Gaussian correlation inequality to show that the independent-block case, realized by complete MUBs, is stochastically extremal. We also record a radial extension for Hamiltonians H=RG with R nonnegative and independent, and the unrestricted qubit case, where complete qubit MUBs are globally optimal among arbitrary six-state ensembles by a Bloch-sphere/octahedron mean-width argument. We then separate this coverage theorem from variational training dynamics. For diagonal QUBO costs, the MUB-family dependence of a fully matched construction collapses; for the canonical b=0 label it reduces to ordinary X-mixer QAOA. The empirical method is therefore adaptive MUB-XRot warm-start QAOA rather than canonical matched-mixer MUB-QAOA. In a cross-problem benchmark over MaxCut, weighted MaxCut, MIS, weighted MIS, and knapsack, adaptive MUB-XRot is non-worse than standard QAOA in 80.0% of 1500 paired cases, with win/tie/loss 829/371/300 and mean decoded-ratio improvement +0.1616. A separate QRAO MaxCut study shows that bit-flip MUB-family search reaches mean relaxed ratio 0.921 and improves over the X-variational baseline by +0.0608. The evidence is quality-oriented and incurs substantial runtime overhead; no quantum-advantage claim is made.

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

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

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

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

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

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

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

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

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

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

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

Entanglement and interference are among the most fundamental properties of quantum mechanics. In this work, we investigate the role and power of interference in the context of detecting entanglement. We do so from a computational complexity lens by proving that unentanglement gives no additional power to stoquastic Merlin-Arthur verification. For every polynomial number of provers $k=k(n)$, \[ \text{StoqMa}(k)=\text{StoqMa} . \] Conceptually, the proof separates the role of entanglement from the role of interference: once destructive interference is ruled out by stoquasticity, the product-state constraint can be absorbed into a polynomially larger one-witness stoquastic verification. The main analytic ingredient is a positive, value-based de Finetti theorem for separately symmetric extensions. If $M$ is an entrywise nonnegative positive semidefinite contraction on $A_1\otimes\cdots\otimes A_k$, then the nonnegative product value of $M$ is approximated to additive error $\epsilon$ by the largest eigenvalue of \[ \Pi_R^{<k} (M_{A_{1,1}\cdots A_{k-1,1}A_k}\otimes I) \Pi_R^{<k}, \qquad R=O\!\left(\frac{k^2\sum_i\log\dim A_i}{\epsilon^3}\right), \] where $\Pi_R^{<k}$ is the operator on $A_1^{\otimes R} \otimes \cdots \otimes A_{k-1}^{\otimes R} \otimes A_k$ projecting to the subspace $\mathrm{Sym}^R(A_1) \otimes \cdots \otimes \mathrm{Sym}^{R}(A_{k-1}) \otimes A_k$. The spectral relaxation is then realized as an actual one-witness stoquastic verifier. After replacing the uniform permutation averages in the symmetric projectors by inverse-polynomially close dyadic inverse-invariant averages. Consequently, \[ \text{StoqMa}(k)=\text{StoqMa}\subseteq\text{AM}\cap\text{PP}\subseteq\text{PSPACE} . \] The positive de Finetti theorem is isolated as a standalone technique and may be useful in other nonnegative tensor-optimization and stoquastic-verification settings.

Duality transformations reveal unexpected equivalences between seemingly distinct models. We introduce an out-of-equilibrium generalisation of matrix product operators to implement duality transformations in one-dimensional boundary-driven Markov processes on lattices. In contrast to local dualities associated with generalised symmetries, here the duality operator intertwines two Markov processes via generalised exchange relations and realises the out-of-equilibrium duality globally. We construct these operators exactly for the symmetric simple exclusion process with distinct out-of-equilibrium boundaries. In this case, out-of-equilibrium boundaries are dual to equilibrium boundaries satisfying Liggett's condition, implying that the Gibbs-Boltzmann measure captures out-of-equilibrium physics when leveraging the duality operator. We illustrate this principle through physical applications.

Nanoscale quantum light sources are essential building blocks for integrated quantum photonic systems. Here, we report a wavelength-scale entangled-photon source based on van der Waals-engineered NbOBr$_2$, and benchmark its performance for telecom-wavelength quantum light generation. By exploiting the material's second-order nonlinearity, we generate quantum-correlated photon pairs via spontaneous parametric down-conversion. We then use a 90$^{\circ}$ twisted stacking to induce quantum interference in photon-pair generation, yielding polarization-entangled photons. This approach enables tunability of the quantum optical state via control of the excitation laser polarization. We experimentally obtain entanglement fidelities exceeding 95% for Bell states, along with a high coincidence-to-accidental ratio of $\sim$335, and a brightness approximately one order of magnitude higher than recently reported telecom sources based on transition metal dichalcogenide (TMD) 2D materials. These results establish twisted van der Waals engineering as a powerful platform for highly tunable, high-brightness quantum light sources at telecom wavelengths.

Quantum Gravity remains elusive, largely because its observable effects are suppressed by powers of the Planck scale. Direct detection of single gravitons is widely believed to be impossible. Here we propose a concrete astrophysical mechanism that may overcome this suppression. We show that superradiant axion-like-particle clouds surrounding rotating black holes can generate multimode squeezed states of gravitons containing up to $10^6$ - $10^7$ correlated quanta. Such states exhibit distinctive polarization correlations and quantum-noise signatures that could be detectable in future gravitational-wave interferometers. Observation of these signatures would constitute direct evidence for the quantum nature of gravitational radiation. Conversely, their absence can place constraints on axion-cloud lifetimes. Our approach also provides a test of General Relativity as an effective field theory.

The present work is motivated by the statement that the Ising minimal model $\mathcal{M}(4,3)$ is equivalent, at the level of observables, to the $SU(2)_2$ Chern--Simons theory. At first glance, however, these two theories appear to differ substantially. For instance, the number of irreducible highest-weight representations does not match the number of Ising anyons. For tensor products of low degree, these discrepancies are examined in this work. While representation structure differs, it does not affect the observables underlying topological quantum computation algorithms.

The Rényi quantum null energy condition conjectures that the second null shape variation of the sandwiched Rényi divergence (SRD) of an excited state relative to the vacuum is non-negative in local Poincaré-invariant quantum field theory, giving a one-parameter generalization of the quantum null energy condition (QNEC). We prove Rényi QNEC for all integer Rényi parameters $n\geq 2$ for von Neumann algebras carrying a half-sided modular inclusion structure. The only assumption on the excited state is finiteness of its SRD relative to the vacuum. Concretely, for any $\sigma$-finite von Neumann algebra with such an inclusion, we prove log-convexity, under the associated null-translation semigroup, of the Kosaki $L^n$ norm of any normal positive functional with finite $L^n$ norm.

We show that the covariance matrix of any cylindrically symmetric coherent orbital angular momentum (OAM) eigenmode with quantum number $\ell$ takes a universal form depending only on $\langle r^2\rangle$, $\langle k_r^2\rangle$, and $\ell$, independently of the radial profile, and that this form is identical to the covariance matrix of a twisted Gaussian Schell-model (TGSM) beam.} More specifically, both matrices share the same pattern of zero and nonzero entries, with the off-diagonal blocks proportional to $\ell$ and the TGSM twist parameter $u$, respectively. This result holds for an arbitrary radial profile and provides direct term-by-term identification of parameters between the two sets of beams. We work out the correspondence in detail for three important families: Laguerre--Gaussian (LG), Bessel--Gaussian, and perfect vortex beams (PVBs), and derive the conditions under which each coherent OAM mode maps onto a physically realizable TGSM beam. {Because the covariance matrix governs second-moment evolution under arbitrary ABCD (symplectic) transformations, any two beams sharing the same covariance matrix are second-order indistinguishable at every propagation plane. In particular, the matched TGSM and coherent OAM beams share identical beam-width evolution, far-field divergence, and $M^2$ beam-quality factor.} In particular, the well-developed TGSM propagation toolbox applies directly to the second-order moment evolution of the three coherent families. We further show that within each beam family the covariance matrix uniquely determines the beam parameters, with exact uniqueness established for LG modes. Additional results include cross-family second-moment equivalence conditions and a proof that PVB modes form a complete orthonormal basis in the limit $w\to 0$.

Hybrid carbon nanotube-fullerene architectures provide a controllable platform for studying irreversibility and information flow in structured quantum environments. We analyze entropy generation in a system where paramagnetic endohedral fullerenes, such as N@C$_{60}$ and P@C$_{60}$, are encapsulated inside a suspended carbon nanotube (CNT) resonator, with selected multi-level fullerene spin states forming an effective qubit coupled to quantized CNT flexural modes. Building on prior work on fullerene-filled CNTs, spin-phonon control in suspended nanotubes, and phase-space propagators for damped driven oscillators, we develop a hybrid open-system model combining driven quantum Brownian motion of the CNT with an effective Jaynes-Cummings spin-vibrational interaction. The resonator dynamics are represented by a Wigner function whose evolution is written analytically in terms of the initial Wigner distribution and a Gaussian propagator. This phase-space description separates drive-induced displacement, diffusion, and damping, and connects these processes directly to entropy flow. The coupled spin-mechanical dynamics are embedded in a Lindblad master equation including mechanical damping, spin relaxation, pure dephasing, and thermally activated excitation. Within this framework we derive the entropy balance, identify entropy flux and non-negative entropy production, and examine how spin-vibrational hybridization redistributes irreversibility between coherent exchange and dissipative channels. We show that magnetic-gradient-enhanced spin-phonon coupling, resonant driving, and moderate thermal occupation produce crossovers between oscillator-dominated and spin-dominated entropy-production regimes. The framework provides a basis for using CNT-PEF hybrids as nanoscale platforms to study nonequilibrium quantum thermodynamics, decoherence, and information loss in vibrational environments.

We study the rotation of the polarization due to the gravitational field in the Kerr spacetime and the possibility of estimating the specific angular momentum that parameterizes this metric. Our approach is based on a geodesic interferometer, that is, a Mach-Zehnder interferometer whose arms are defined by null geodesics, and a single photon propagating within it. We show that the detection probability at the output ports of the interferometer is a function of two phase differences, one arising from the gravitational time delay and the other from the polarization rotation, both computed under the slow rotation and weak field approximations. Thereby, the interferometric visibility is a signature of two relativistic effects. Using the detection probability, we obtain an estimate for the specific angular momentum and characterize its uncertainty.

Quantum programs often produce probability distributions rather than deterministic outputs, making verification inherently statistical and increasingly costly on real hardware. In practice, developers still frequently rely on testing with fixed shot budgets on simulators, which are simple but time-consuming and poorly suited to noisy backends. What is missing is a verification approach that is both statistically explicit and budget-aware. This paper formulates Bayesian sequential verification as a reference-based Bayesian hypothesis testing workflow in which priors are derived from explicit reference sources, such as finite-shot reference runs or ideal/statevector-based computation, and verification decisions are updated batch by batch as measurement evidence accumulates. This approach is evaluated in Qiskit on two complementary workloads: Bell-state and QAOA-MaxCut. Across both case studies, the results show that Bayesian sequential verification can substantially reduce measurement costs compared to fixed-budget baselines when the success probability of the program exceeds the target threshold. The findings position Bayesian sequential verification as a practical verification workflow for quantum programs. The approach provides a foundation for future quantum continuous-integration pipelines that require reliable, budget-aware pass/fail decisions and motivates validation on real quantum hardware.

Variational neural network models have achieved remarkable success in solving ground-state problems of quantum many-body systems. However, addressing classical and quantum spin glasses remains challenging, as disorder and energy frustration give rise to an exponentially large number of local energy minima separated by high-energy barriers, hindering the efficiency of conventional Metropolis-based Monte Carlo methods. To bridge this gap, we introduce Deep Boltzmann Quantum States, a class of neural quantum states inspired by deep Boltzmann machines that inherit efficient block Gibbs sampling. We also propose two key advances in the training algorithm. Firstly, we combine natural-gradient updates with state-of-the-art stochastic optimizers. Secondly, we gradually tune the hardness of the problem Hamiltonian by interpolating from an easy to a hard regime, without the need to closely approximate the instantaneous adiabatic state at intermediate times. We match the exact solution or the best available estimate for several instances of classical and quantum Ising spin-glass models with infinite-range interactions and hundreds of spins. We also solve instances of the NP-hard Job Shop Scheduling Problem exceeding the current limitations of quantum annealing hardware. To summarize, deep neural architectures with efficient global update rules and trained within an annealing-like scheme, provide a powerful framework for solving real-world hard combinatorial optimization and for investigating disordered quantum many-body systems.

The Lieb-Schultz-Mattis (LSM) theorem and its higher-dimensional extensions forbid the existence of a unique, symmetric, and gapped ground state at fractional fillings in quantum many-body systems with a conserved particle number (or spin angular momentum) and the conventional translation symmetry of Euclidean lattices. In this work, we propose a generalization of the LSM theorem to quantum many-body systems on hyperbolic lattices, i.e., regular tessellations of two-dimensional negatively curved space. By leveraging concepts from hyperbolic band theory in a many-body setting, we adapt Oshikawa's flux-threading argument to periodic hyperbolic lattices with a non-Euclidean (Fuchsian) translation symmetry and compute a lower-bound to the ground-state degeneracy as a function of filling and lattice geometry. We explore the consequences of LSM constraints for gapped phases of hyperbolic quantum matter and suggest frustrated spin models on hyperbolic analogs of the square and triangular lattices as promising platforms for realizing symmetric spin liquids in hyperbolic space.

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

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

Encoding hard-constrained optimization problems into a variational quantum algorithm often turns out to be a challenging task. In this work, we provide a solution for the class of open-shop scheduling problems (OSSPs), which we achieve by rigorously employing the symmetries of the classical problem. An established approach for encoding the hard constraints of the closely related traveling salesperson problem (TSP) into mixer Hamiltonians was recently given by Hadfield et al.'s Quantum Alternating Operator Ansatz (QAOA). For the OSSP, which contains TSP as a special case, we show that desired properties of similarly constructed mixers can be directly linked to a purely classical object: the group of feasibility-preserving bit value permutations. We also outline a generic way to construct QAOA-like mixers for these problems. We further propose a new variational quantum algorithm that incorporates the underlying group structure more naturally and, as a proof of principle, implement our new algorithm for a small OSSP instance on an IBM Q System One. Unlike the generic QAOA, our algorithm allows for bounding the amount and the domain of parameters necessary to reach every feasible solution from above: Optimizing at most quadratically many parameters should suffice to reach the optimum with certainty.

This work presents a tensor-network formulation of the Traveling Salesman Problem (TSP) and several of its variants. The approach represents candidate tours with tensor-network layers, weights them by Boltzmann factors, and enforces constraints through explicit counting filters. This formalism also yields an explicit tensor-network marginal formula whose zero-temperature, exact-arithmetic limit identifies an optimal feasible tour through a sequential marginal rule. At finite $\tau$ and finite precision, the implemented extraction is a heuristic whose behavior depends on numerical contrast, calibration, and near-degeneracies. We adapt the construction to several generalizations of the TSP and apply it to the Job Reassignment Problem, as a representative industrial integration. The experiments are deliberately small and illustrative; they contextualize the method against exact and heuristic references but do not establish general computational superiority over specialized classical solvers.

We consider the depolarizing channel in $d$ dimension defined as $D_x(\rho)=(1-x)\rho+x\: \textit{tr}({\rho}) \frac{I}{d}$, and explicitly find a quantum channel ${\cal N}_x$ which anti-degrades this, when $x\geq\frac{1}{2}$. This proves that the depolarizing channel $D_x$ has zero capacity when $x\geq\frac{1}{2}$. As a corollary, this implies that any quantum channel when contaminated by white noise stronger than this value loses its capacity completely. Although by arguments based on symmetric-extendibiliy of the Choi matrix, it is known that the channel is anti-degradable when $x\geq \frac{d}{2(d+1)}$, the explicit form of the anti-degrading channel in this larger interval is not known. We also calculate in closed form the capacity of the complenetary channel ${\cal D}_x^c$ in the region $x\geq \frac{1}{2}$. This adds to the existing list of quantum channels for which the quantum capacity has been calculated in closed form.

We show that if a graph has minimum vertex degree at least d and girth at least g, where (d, g) is (3, 6) or (4, 4), then the incidence system of the graph has a (possibly infinite-dimensional) quantum solution over $\mathbb{Z}_p$ for every choice of vertex weights and integer $p \geq 2$. In particular, there are linear systems over $\mathbb{Z}_p$, for $p$ an odd prime, such that the corresponding linear system nonlocal game has a perfect commuting-operator strategy, but no perfect classical strategy.

Classifying phase transitions is a fundamental and complex challenge in condensed matter physics. This work proposes a framework for identifying quantum phase transitions by combining classical shadows with unsupervised machine learning. We use the axial next-nearest neighbor Ising model as our benchmark and extend the analysis to the Kitaev-Heisenberg model on a two-leg ladder. Even with few qubits, we can effectively distinguish between the different phases of the Hamiltonian models. {Furthermore, by relying on a restricted set of local observables, such as pairwise correlations and plaquette operators, the sample complexity of the classical shadows protocol scales logarithmically with the number of measured features. This makes our approach a scalable and efficient tool for studying phase transitions in larger many-body systems where classical verification becomes intractable.

Tensor network formalisms have emerged as powerful tools for simulating quantum state evolution. While widely applied in the study of optical quantum circuits, such as Boson Sampling, existing tensor network approaches fail to address the complexity mismatch between tensor contractions and the calculation of photon-counting probability amplitudes. Here, we present an alternative tensor network framework that exploits the input-output relations of quantum optical circuits encoded in the unitary interferometer matrix. Our approach bridges the complexity gap by enabling the computation of the permanent -- central to Boson Sampling -- with the same computational complexity as the best known classical algorithm based on a graphical representation of the operator-basis MPS that we introduce. Furthermore, we exploit the flexibility of tensor networks to extend our formalism to incorporate partial distinguishability and photon loss, two key imperfections in practical interferometry experiments. This work offers a significant step forward in the simulation of large-scale quantum optical systems and the understanding of their computational complexity.

The renowned Local Friendliness no-go theorem demonstrates the incompatibility of quantum theory with the combined assumptions of Absoluteness of Observed Events - the idea that observed outcomes are singular and objective - and Local Agency - the requirement that the only events correlated with a setting choice are in its future light cone. Granted that the Local Friendliness scenario can be realized, this result is stronger than Bell's theorem because the assumptions of Local Friendliness are weaker than those of Bell's theorem: Local Agency is less restrictive than local causality, and Absoluteness of Observed Events is encompassed within the notion of realism assumed in Bell's theorem. Drawing inspiration from the correspondence between nonlocality proofs in Bell scenarios and generalized contextuality proofs in prepare-and-measure scenarios, we present the Noncontextual Friendliness no-go theorem. This theorem demonstrates the inconsistency of quantum theory with the joint assumptions of Absoluteness of Observed Events and Noncontextual Agency, the latter being a weaker version of noncontextuality, in the same way that Local Agency is a weaker version of local causality. Our result generalizes the Local Friendliness no-go theorem and, granted that the scenario can be realized, is stronger than no-go theorems based on generalized noncontextuality.

The process tensor provides a general representation of a quantum system evolving under repeated interventions and is fundamental for numerical simulations of local many-body dynamics. In this work, we introduce the projected process ensemble, an ensemble of pure output states of a process tensor in a given basis of local interventions, and use it to define increasingly more fine-grained probes of quantum chaos. The first moment of this ensemble encapsulates numerous previously studied chaos quantifiers, including the Alicki-Fannes quantum dynamical entropy, butterfly flutter fidelity, and spatiotemporal entanglement. We discover characteristic entanglement structures within the ensemble's higher moments that can sharply distinguish chaotic from integrable dynamics, overcoming deficiencies of the quantum dynamical and spatiotemporal entropies. These conclusions are supported by extensive numerical simulations of many-body dynamics for a range of spin-chain models, including non-interacting, interacting-integrable, chaotic, and many-body localized regimes. Our work elucidates the fingerprints of chaos on spatiotemporal correlations in quantum stochastic processes, and provides a unified framework for analyzing the complexity of unitary and monitored many-body dynamics.

Neutral atom arrays provide a versatile platform to implement coherent quantum annealing as an approach to solving hard combinatorial optimization problems. Here we present and experimentally demonstrate an efficient encoding scheme based on chains of Rydberg-blockaded atoms, which we call quantum wires, to natively embed maximum weighted independent set (MWIS) and quadratic unconstrained binary optimization (QUBO) problems on a neutral atom architecture. For graphs with quasi-unit-disk connectivity, in which only a few long-range edges are required, our approach requires a significantly lower overhead in the number of ancilla qubits than previous proposals, facilitating the implementation on currently available hardware. To demonstrate the approach, we perform annealing of weighted graphs on a programmable atom array using local light-shifts to encode problem-specific weights across graphs of varying sizes. This approach successfully identifies the solutions to the original MWIS and QUBO graph instances. Our work expands the operational toolkit of near-term neutral atom arrays, enhancing their potential for scalable quantum optimization.

A defining feature of quantum many-body systems is the exponential scaling of the Hilbert space with the number of degrees of freedom. This exponential complexity naïvely renders a complete state characterization, for instance via the complete set of bipartite Renyi entropies for all disjoint regions, a challenging task. Recently, a compact way of storing subregions' purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed. Notably, the entanglement feature can be a simple object even for highly entangled quantum states. However the complexity and practical usage of the entanglement feature for general quantum states has not been explored. In this work, we demonstrate that the entanglement feature can be efficiently learned using only a polynomial amount of samples in the number of degrees of freedom through the so-called tensor cross interpolation (TCI) algorithm, assuming it is expressible as a finite bond dimension MPS. We benchmark this learning process on Haar and random MPS states, confirming analytic expectations. Applying the TCI algorithm to quantum eigenstates of various one dimensional quantum systems, we identify cases where eigenstates have entanglement feature learnable with TCI. We conclude with possible applications of the learned entanglement feature, such as quantifying the distance between different entanglement patterns and finding the optimal one-dimensional ordering of physical indices in a given state, highlighting the potential utility of the proposed purity interpolation method.

Simulating Clifford and near-Clifford circuits using the extended stabilizer formalism has become increasingly popular, particularly in quantum error correction. Compared to the state-vector approach, the extended stabilizer formalism can solve the same problems with fewer computational resources, as it operates on stabilizers rather than full state vectors. Most existing studies on near-Clifford circuits focus on balancing the trade-off between the number of ancilla qubits and simulation accuracy, often overlooking performance considerations. Furthermore, in the presence of high-rank stabilizers, performance is limited by the sequential property of the stabilizer formalism. In this work, we introduce a parallelized version of the extended stabilizer formalism, enabling efficient execution on multi-core devices such as GPU. Experimental results demonstrate that, in certain scenarios, our Python-based implementation outperforms state-of-the-art simulators such as Qiskit and Pennylane.

Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics requiring only finite-sized entangled resource states followed by linear-optics operations and photon measurements. Large-scale implementations have so far been limited due to the access only to probabilistic photon sources, vulnerability to photon loss, and the need for massive multiplexing. Deterministic photon sources offer an alternative and resource-efficient route. By synergistically integrating deterministic photon emission, adaptive repeat-until-success fusions, and an optimised architectural design, we propose a complete blueprint for a photonic quantum computer using quantum dots and linear optics. It features time-bin qubit encoding, reconfigurable entangled-photon sources, and a fusion-based architecture with low optical connectivity, significantly reducing the required optical depth per photon and resource overheads. We present in detail the hardware required for resource-state generation and fusion networking, experimental pulse sequences, and exact resource estimates for preparing a logical qubit. We estimate that one logical clock cycle of error correction can be executed within microseconds, which scales linearly with the code distance. We also simulate error thresholds for fault-tolerance by accounting for a full catalogue of intrinsic error sources found in real-world quantum dot devices. Our work establishes a practical blueprint for a low-optical-depth, emitter-based fault-tolerant photonic quantum computer.

We introduce crystal polaritons, hybrid excitations formed when the collective excitations of a periodic quantum-emitter array strongly couple to the resonant Bloch modes of a metasurface. This realizes a cavity-QED platform in which periodic light and periodic matter are treated on the same footing, allowing strong collective light-matter coupling in an extended, lossy, and dispersive nanophotonic structure. To describe this regime, we develop a reciprocal-space few-mode quantization based on macroscopic quantum electrodynamics, which maps the metasurface resonances seen by the emitter array onto a cavity-QED Hamiltonian at each in-plane momentum. We show that both plasmonic surface-lattice resonances and dielectric bound states in the continuum can enter the strong-coupling regime with a single emitter per unit cell. As a consequence of the resonant nonlinearities of the resulting crystal polaritons, the platform enables quantum light generation with efficiencies orders of magnitude higher than those achieved in conventional nonlinear metasurfaces.

Quantum measurements can be described by operators that assign conditional probabilities to different outcomes while also describing unavoidable physical changes to the system. Here, we point out that operators describing information gain at minimal disturbance can be expanded into a set of unitary operators representing experimentally distinguishable patterns of disturbance. The observable statistics of disturbance defines a tight upper bound on the information gain of the measurement.

We investigate current fluctuations in open quantum systems beyond the weak-coupling and Markovian regimes, focusing on a coherently driven qubit strongly coupled to a structured bosonic environment. By combining full counting statistics with the reaction coordinate mapping, we develop a framework that enables the calculation of steady-state current fluctuations and their temporal correlations in the strong-coupling regime. Our analysis reveals that, unlike in weak coupling, both the average current and its fluctuations exhibit nonmonotonic dependence on the system-environment interaction strength. Notably, we identify a regime where current noise is suppressed below the classical thermodynamic uncertainty bound, coinciding with enhanced anticorrelations in quantum jump trajectories and faster system relaxation. We further show that these features are linked to nonclassical properties of the reaction coordinate mode, such as non-Gaussianity and quantum coherence. Our results provide new insights and design principles for controlling current fluctuations in quantum devices operating beyond the standard weak-coupling paradigm.

Different quantum systems possess different favorable qualities. On the one hand, ensemble-based quantum memories are suited for fast multiplexed long-range entanglement generation. On the other hand, single-atomic systems provide access to gates for processing of information. Both of those can provide advantages for high-rate entanglement generation within quantum networks. We develop a hybrid architecture that takes advantage of these properties by combining trapped-ion nodes and nodes comprised of spontaneous parametric down conversion photon pair sources and absorptive memories based on rare-earth ion ensembles. To this end, we solve the central challenge of matching the different bandwidths of photons emitted by those systems in an initial entanglement-generation step. This enables the parallel execution of multiple probabilistic tasks in the initial stage. As a particular example, we show that our approach can lead to a significant speed-up for the fundamental task of creating ion-ion entanglement over hundreds of kilometers in a quantum network.

We address the nonlinear properties of the double-Morse potential as a resource for single-mode quantum states due to its double-well structure and anharmonicity. We obtain analytical expressions for the ground-state wavefunction and the corresponding ground-state energy, using the inverse barrier-width parameter $\alpha$ as the primary control parameter. We then assess non-Gaussianity and nonclassicality as quantitative signatures of nonlinearity and quantumness, and we find that both increase monotonically with $\alpha$. Furthermore, we analyze the metrological performance of the model for estimating the inverse barrier-width parameter $\alpha$. By evaluating the corresponding Fisher information, we show that position measurements are optimal and can saturate the Cramér-Rao bound. In particular, the estimation of $\alpha$ is most precise in the shallow-well regime, where the quantum Fisher information is largest. For deep wells, enhanced sensitivity is instead obtained for the reparameterized control variable $A=2e^{-\alpha x_0}$, provided that $x_0$ is independently calibrated. These results establish the double-Morse potential as a controllable source of non-Gaussianity and nonclassicality, with a metrological behavior that depends on the chosen estimation parameter. We highlight possible applications of this model in quantum sensing, continuous-variable quantum information, and quantum simulation.

We introduce a qudit-native framework for engineering rich and robust discrete time crystals (DTCs) by leveraging their internal multilevel structure. Unlike in qubit systems, qudit-based DTCs exhibit distinct dynamical mechanisms that arise only in multilevel systems, as supported by a dressed normal-form analysis in the heating-suppression regime. These mechanisms are manifested in representative systems: we show that subspace-selective embedded kicks stabilize higher-order subharmonic responses and suppress thermalization, as demonstrated in spin-1 chains; in spin-3/2 systems, extending embedded kicks to more levels enables different level partitions and reveals that DTC robustness is dictated by the symmetry of the partition; and in spin-2 platforms, we realize concurrent 2T and 3T DTCs under a unified drive. These findings establish a systematic, hardware-efficient methodology for designing stable and multifunctional Floquet phases of matter on modern qudit-based quantum processors.

The aim of this letter is to compute the evolution of some expected values, such as the field operators $a^\pm$, quadratures and atomic inversion, under supersymmetric (SUSY) partner Hamiltonians associated to the Jaynes-Cummings Hamiltonian of quantum optics. This kind of SUSY partners are characterized by having spectra which differ in a finite number of energy levels. We wish to elucidate if the partner connection has any influence on these expected values. In particular, we want also to know in which way the classical and revival times are affected by such SUSY partners.

We study time-optimal state-to-state control for two- and multi-qubit operations motivated by neutral-atom quantum processors within the Rydberg blockade regime. Block-diagonalization of the Hamiltonian simplifies the dynamics and enables the application of a semi-analytic approach to the Pontryagin Maximum Principle to derive optimal laser controls. We provide a general formalism for $N$ qubits. For $N=2$ qubits, we classify normal and abnormal extremals, showcasing examples where abnormal solutions are either absent or suboptimal. For normal extremals, we establish a correspondence between the laser detuning from atomic transitions and the motion of a classical particle in a quartic potential, yielding a reduced, semi-analytic formulation of the control problem. Combining PMP-based insights with numerical optimization, our approach bridges analytic and computational methods for high-fidelity, time-optimal control.

The aim of this exposé is to make explicit the analogy between the classical notion of non-independent probability distribution and the quantum notion of entangled state. To bring that analogy forth, we consider a classical systems with two dependent random variables and a quantum system with two components. In the classical case, afet observing one of the random variables, the underlying sample space and the probability distribution change. In the quantum case, when and event pertaining to one of the components is observed, the post-measurement state captures, both, the change in the state of the system and implicitly the new probability distribution. The predictions after a measurement in the classical case and in the quantum case, have to be computed with the conditional distribution given the value of the observed variable.

We present a non-perturbative, first-principles derivation of renormalization relations for waveguide-QED models, explicitly accounting for the infrared (IR) and ultraviolet (UV) cutoffs that are necessarily introduced in numerical simulations. By formulating the atomic dynamics in the time domain, we obtain explicit expressions linking the bare model parameters to the physically observable atomic frequency and decay rate, and verify their consistency with scattering theory. We further connect these results to standard Feynman diagrams, providing a transparent physical interpretation and ensuring the generality of the approach. Finally, we show how these renormalization relations can be used to parameterize simulations with a minimal frequency bandwidth, simultaneously preserving physical accuracy and reducing computational cost, thereby paving the way for efficient and reliable multi-photon light-matter simulations.

Spin squeezing generated via inter-atom entanglement in multilevel atomic ensembles provides a powerful resource for quantum-enhanced metrology. Existing schemes that harness internal atomic degrees of freedom to boost squeezing typically encode the collective squeezing in complex superpositions of magnetic sublevels, which complicates state control and limits practical applications. Here, we propose a coherent control scheme that simultaneously enhances collective spin squeezing and maps the resulting atom-atom entanglement onto two well-defined magnetic sublevels suitable for subsequent metrology experiments. Our protocol sandwiches a quantum non-demolition measurement between two internal one-axis-twisting interactions arranged in an echo sequence. We show that this approach can optimally leverage internal states to boost the inter-atom entanglement and, at the same time, encode it in two magnetic sublevels, which is readily convertible into metrologically useful spin squeezing. Our results offer a straightforward and efficient strategy for generating highly entangled yet readily accessible quantum states in multilevel atomic systems.

We present and benchmark a type of variational quantum eigensolver (VQE), which we denote $\sigma$-VQE. It is designed to target mid-spectrum eigenstates and prepare quantum many-body scar states. The approach leverages the fact that noisy intermediate-scale quantum devices are limited in their ability to generate generic highly entangled states. This modified VQE pairs a low-depth circuit with an energy-selective objective that explicitly penalizes energy variance around a chosen target energy. The cost function exploits the limited expressibility of the shallow circuit as atypical low-entanglement eigenstates such as scar states are preferentially selected. We validate this mechanism across two complementary families of models that contain many-body scar states: the Shiraishi-Mori embedding approach and a matrix product state parent Hamiltonian construction. We define an unbiased estimation scheme for the nonlinear cost function that is compatible with qubit-wise commuting grouping and bitstring reuse. A proof-of-principle demonstration using a small-system instance was performed on IBM Fez (Heron r2 QPU). These results motivate its use as a practical algorithm for detecting quantum many-body scars and variationally generating states with appreciable scar state overlap.

Large, 3D trapped ion crystals offer improved sensitivity in quantum sensing protocols, and are expected to be implemented as platforms in near-future experiments. However, numerical techniques used to study the laser cooling of such crystals are inefficient as the number of ions, $N$, in the crystal increases. Here we develop a powerful numerical framework to simulate laser cooling of up to $10^5$ ions stored in a Penning trap. We apply this framework to characterize and optimize the cooling of ellipsoidal 3D crystals. We document new pathways to enhanced cooling based on the addition of an axial component to the potential energy-dominated $\boldsymbol{E}\times\boldsymbol{B}$ modes. Furthermore, we observe greatly enhanced cooling of the perpendicular kinetic energy to below 1 mK in prolate ion crystals, enabling a simplified cooling beam setup for such crystals. We propose specific values of trap and laser beam parameters which lead to optimal cooling in a variety of examples. This work illustrates the feasibility of preparing large 3D crystals for high-sensitivity quantum science protocols, motivating their use in future experiments.

We present a formulation of the problem of finding the smallest T -Count circuit that implements a given unitary as a binary search over a sequence of continuous minimization problems, and demonstrate that these problems are numerically solvable in practice. We reproduce best-known results for synthesis of circuits with a small number of qubits, and push the bounds of the largest circuits that can be solved for in this way. Additionally, we show that circuit partitioning can be used to adapt this technique to be used to optimize the T -Count of circuits with large numbers of qubits by breaking the circuit into a series of smaller sub-circuits that can be optimized independently.

Superconducting qubit fabrication innovations continue to be explored to achieve higher performance. Despite improvements to base layer fabrication and processing, resist-based Josephson junction (JJ) schemes have largely remained unchanged. The polymer mask during deposition causes chemical contamination and limits in situ and ex situ surface preparation, junction materials, and scalability. Here, we demonstrate a resist-free approach to junction fabrication based on etched silicon trenches that is CMOS compatible and easily integrated into existing innovations in qubit base layer fabrication and chemical processing. We fabricate Al-AlOx-Al JJs and qubits using this method, measuring median energy relaxation times up to 184 microseconds. We find minimal contamination at the substrate-metal interface and fluctuations of energy relaxation on a 35 hour timescale that are narrow and normally distributed. The method widens the process window for substrate preparation and new materials platforms.

We investigate quantum thermal state preparation algorithms based on system-bath interactions and uncover a surprising phenomenon in the weak-coupling regime. We rigorously prove that, if the system-bath interaction is engineered so that the transition part of the approximate Lindbladian generator satisfies the Kubo--Martin--Schwinger (KMS) detailed balance condition, then the unique fixed point of the dynamics can be made arbitrarily close to the Gibbs state in the weak-coupling limit, regardless of the structure of the Lamb shift term. Importantly, this remains true even when the approximate Lindbladian differs substantially from the ideal Davies generator and the Lamb shift term does not commute with the thermal state. Our result shows that the role of the KMS detailed balance condition extends well beyond standard Lindbladian dynamics, serving as a general principle for a broader class of dissipative systems. Furthermore, by combining this with a general perturbation framework, we bound the mixing time of the dynamics and establish an end-to-end complexity of $\mathcal{O}(\varepsilon^{-1})$ for Gibbs state preparation. These guarantees apply to any Hamiltonian whose associated KMS-detailed-balance Lindbladian is known to be fast mixing.

It is known that the classical information like strings of bits can be copied. In 1982, Wootters and Zurek proposed the quantum no-cloning principle. No-cloning principle says that it is impossible to make an identical copy of an arbitrary unknown quantum pure state by using unitary evolution. In this paper, we call U $|\psi>$, where U is any unitary operator, a U-copy of the state $|{\psi}>$ and show it is impossible to make a U-copy of an arbitrary unknown quantum pure state by using unitary evolution.

Fault-tolerant quantum computing is a promising tool for simulating molecules and materials, but frequently-considered applications require substantial resources, and the gap between hardware capabilities and requirements remains significant. We propose quantum simulation of nanographene $\pi$-systems as relevant and scalable problems to span the gap between early and large-scale fault-tolerant quantum computing. We examine the efficiency of Trotterized quantum simulation, present a detailed analysis of worst-case, average-case and energy eigenvalue Trotter errors, and show that these Trotter error estimates vary by orders of magnitude. Trotter eigenvalue errors are obtained from a novel tensor-network-based approach which allows spectral analysis of product formulas for systems beyond brute-force calculation. Notably, we observe a Trotter error cancellation phenomenon whereby the Trotter error for energy differences between low-lying eigenstates is significantly smaller than the Trotter error for absolute energies, resulting in approximately an order of magnitude circuit depth reduction for quantum phase estimation calculation of energy gaps. This is a significant result because for most chemical applications, only energy differences are of practical relevance. We estimate that calculation of energy gaps to chemical accuracy between the ground- and excited-states within the Pariser--Parr--Pople model for large 2D nanographenes (up to 140 spin orbitals) requires circuits with $< 3.2 \times 10^7$ Toffoli gates. This work shows that considering details of chemically-relevant applications and exploiting error cancellation can lead to substantial reductions in resource requirements.

We study quantum dynamics generated by time-dependent Hamiltonians in Krylov space, the minimal subspace in which the evolution takes place. We establish a direct link between dynamics in the time-dependent Krylov subspace and the underlying Lie-algebraic structure of the Hamiltonian. We develop a general framework in which the dynamics in the time-dependent Krylov subspace is generated by ladder operators of the associated Lie algebra. In particular, we identify the minimal conditions under which the exact time-dependent Krylov dynamics is naturally determined by the interaction-picture Hamiltonian and governed by an embedded $\mathfrak{sl}(2,\mathbb{C})$ subalgebra. We further show that an exact single-exponential representation of the time-evolution operator gives rise to a distinct time-independent Krylov dynamics in a unitarily related basis, from which the exact time-dependent Krylov dynamics can nevertheless be recovered. We also extend the framework to the oscillator algebra as the simplest extension of the nilpotent Heisenberg--Weyl algebra, and provide further examples, including the translated and dilated harmonic oscillator, systems governed by closed Virasoro subalgebras, a spin in a rotating magnetic field, and higher-dimensional generalizations for multi-level systems. In addition, we introduce a new quantum speed limit to the complexity growth rate generated by a time-dependent generator and show that, for evolutions governed by a Lie algebra, it retains the same functional form as in the time-independent case. Remarkably, saturation of this bound is strongly affected by temporal driving and persists only when the Hamiltonian commutes with itself at different times. These results establish a unified framework for characterizing operator growth and Krylov complexity in time-dependent quantum systems with underlying Lie-algebraic structures.

We develop a resource-theoretic framework for quantum coherence directly in continuous basis, with emphasis on the position representation. Since position eigenstates are non-normalizable generalized eigenstates, the standard finite-dimensional dephasing map cannot be transferred directly to normal states. We therefore introduce a physically motivated dephasing channel based on random momentum kicks, equivalently described as the unconditional back-action of a finite-resolution position measurement. This yields a fixed-point notion of incoherence and a natural class of dephasing-covariant free operations. For physically relevant kernels, however, the fixed-point set contains no normal states, showing that continuous-basis coherence is tied to dephasing disturbance rather than to distance from a nonempty set of diagonal states. We study two quantifiers built from the channel action: a relative-entropy dephasing loss and a Hilbert-Schmidt dephasing loss. The former satisfies the main resource-theoretic properties under the free operations considered, while the latter is convex and experimentally transparent but fails monotonicity and strong monotonicity. We also formulate threshold witnesses for certifying coherence above a finite value and connect them, in a two-path setting, with interference visibility. Finally, we illustrate the framework with a Gaussian wavepacket evolving in a gravitational potential. The resulting theory provides a mathematically consistent and physically motivated treatment of coherence in continuous-variable systems.

Nanophotonic quantum memory is a vital component for scalable quantum information processing for quantum computing, networking, and sensing applications. We store single-photon-level telecom-band optical pulses for more than a microsecond using an atomic frequency comb in erbium-doped thin-film lithium niobate, well beyond what is practically feasible via propagation in even the best nanophotonic devices due to propagation losses. We verify the quantum nature of this storage by demonstrating the phase coherence and sub-single-photon noise upon retrieval. We also show the flexibility of our platform by storing up to 20 temporal modes and demonstrating an acceptance bandwidth up to 2.2 GHz. These results establish erbium-doped thin-film lithium niobate as a practical platform for on-chip quantum memory at telecom wavelengths, a key missing element for photonic quantum computing and quantum networking.

In the field of quantum reservoir computing (QRC), many different computational models and architectures have been proposed. From these models, we identify feedback-based models -- which use a feedback mechanism to re-embed classical measurements from the QRC -- and recurrent models -- which use a multi-register approach with memory and readout qubits -- as the two major competing architectures that have been discussed and validated on hardware. In this paper, we advance upon the recurrent architectures, which employ a two register approach to endow the QRC with a fading memory. While these approaches have been validated on hardware and have demonstrated great real-world performance on noisy-intermediate-scale-quantum (NISQ) quantum processing units (QPUs), the exact mechanism through which the memory capacity arises is not completely understood or fully controllable. With this, we augment the recurrent approaches and present a hardware-realizable mechanism, which we call a tunable partial-SWAP, that allows for the direct control of the rate of memory dissipation from a QRN implemented on a gate-based QPU. The theory behind this mechanism is discussed in terms of a controlled amplitude-damping channel and validation experiments using a randomized short-term memory capacity (STMC) recall benchmark and the NARMA-5 dataset are conducted using simulation and IBM QPUs, respectively.

In quantum many-body dynamics, locally encoded information typically scrambles across the entire system, becoming inaccessible to local probes. The upper bound of accessible information of local probes can be characterized by the Holevo information via optimal measurement. In this work, we investigate the information dynamics of quantum scrambling utilizing local randomized probes, quantified by the averaged accessible information (AAI). We derive an analytical expression for the AAI under Haar-random measurements and demonstrate that it is a function of purity of local reduced density matrix. Operationally, we employ the classical shadow protocol, using only single-qubit randomized Pauli measurements, to efficiently extract the AAI across extended subsystems. Through numerical simulations across diverse many-body paradigms, we show that the AAI can reveal distinct scrambling behaviors, resolving phenomena that range from dynamical confinement and ballistic transport to persistent scar revivals and many-body localization. This work highlights a pragmatic paradigm shift--from relying on optimal measurements to utilizing randomized local probes--for the characterization of complex quantum information dynamics.

We show that standard multi-path interferometry, using only pairwise visibility measurements, provides an operational route to tests of preparation noncontextuality. Under ideal symmetric conditions, interference visibility directly encodes state overlaps, without requiring tomography or SWAP tests. For three paths, any jointly diagonalizable (coherence-free) description must satisfy $V_{12}^2+V_{23}^2-V_{13}^2\le 1$, where $V_{ij}$ are two-path visibilities. Pure qubit detector states violate this bound, achieving a maximal value of $5/4$. We generalize to arbitrary $n$-path interferometers and derive the tight qubit bound $S_n^{\max}=n\cos^2(\pi/2n)-1$ for all $n\ge3$, achieved by coplanar pure qubit states with uniform angular separation $\pi/n$. A robustness analysis yields explicit experimental thresholds. Under the operational equivalences used in overlap-based generalized noncontextuality frameworks, violations of these visibility inequalities also witness preparation contextuality. For $n$-cycle inequalities, only the pairwise visibilities appearing in the cycle need to be measured.

We introduce a nonlocal Maxwell demon teleporting ergotropy at finite temperature via classical communication and a shared surface code. The teleported ergotropy is exponentially protected below a topological threshold. We identify a thermodynamic phase transition separating a profitable demon phase from a thermal phase. A quadratic infrastructure cost strictly enforces the second law, imposing a fundamental thermodynamic horizon on separation distance. This establishes quantum error correction as a resource for nonlocal thermodynamics beyond fault-tolerant computation.

Chaotic lattice models at high temperature are generically expected to exhibit diffusive transport of all local conserved charges. Such diffusive transport is usually associated with overdamped relaxation of the associated currents. Here we show that by appropriately tuning the inter-particle interactions, lattice models of chaotic fermions at infinite temperature can be made to cross over from an overdamped regime of diffusion to an underdamped regime of ``hot band sound''. We study a family of one-dimensional spinless fermion chains with long-range density-density interactions, in which the damping time of sound waves can be made arbitrarily long even as an effective interaction strength is held fixed. Our results demonstrate that underdamped sound waves of charge density can arise within a single band, with strong interactions and far from integrability, and at very high temperature.

We propose using highly excited cyclotron states of a trapped electron to detect meV axion and dark photon dark matter, marking a significant improvement over our previous proposal and demonstration [Phys. Rev. Lett. 129, 261801]. When the axion mass matches the cyclotron frequency $\omega_c$, the cyclotron state is resonantly excited, with a transition probability proportional to its initial quantum number, $n_c$. The sensitivity is enhanced by taking $n_c \sim 10^6 \left( \frac{0.1~\text{meV}}{\omega_c} \right)^2$. By optimizing key experimental parameters, we minimize the required averaging time for cyclotron detection to $t_{\text{ave}} \sim 10^{-6} $ seconds, permitting detection of such a highly excited state before its decay. An open-endcap trap design enables the external photon signal to be directed into the trap, rendering our background-free detector compatible with large focusing cavities, such as the BREAD proposal, while capitalizing on their strong magnetic fields. Furthermore, the axion conversion rate can be coherently enhanced by incorporating layers of dielectrics with alternating refractive indices within the cavity. Collectively, these optimizations enable us to probe the QCD axion parameter space from 0.1 meV to 2.3 meV (25-560 GHz), covering a substantial portion of the predicted post-inflationary QCD axion mass range. This sensitivity corresponds to probing the kinetic mixing parameter of the dark photon down to $\epsilon \approx 2 \times 10^{-16}$.

A detection method for high-frequency gravitational waves using two-dimensional ion crystals is investigated. Gravitational waves can resonantly excite the drumhead modes of the ion crystal, particularly the parity-odd modes. In the optical dipole force protocol, entanglement between the drumhead modes and the collective spins transfers the excitation of the drumhead modes to the rotation of the total spin. Furthermore, gravitational wave detection beyond the standard quantum limit becomes possible as a squeezed spin state is generated through this entanglement. The sensitivity gets better with a larger ions crystals as well as a larger number of the ions. Future realization of large ion crystals can significantly improve the sensitivity to gravitational waves in the 10 kHz to 10 MHz region.

Angle-encoded variational quantum circuits admit a truncated Fourier series representation of their output, but approximating functions with maximum frequency $\omega_{\max}$ using fixed unary encoding requires $\mathcal{O}(\omega_{\max})$ encoding gates. Trainable-frequency (TF) circuits promise a reduction by learning the data-encoding prefactors alongside the ansatz parameters, adapting the accessible frequency spectrum to the target during training. We identify a practical barrier that prevents this promise from being realized: the prefactor gradient is suppressed by the spectral gap between the circuit's accessible frequencies and the target spectrum, independently of the ansatz parameters, confining gradient-driven prefactor movement to a narrow neighborhood of initialization. We propose \emph{ternary grid initialization} -- setting prefactors to $\{1, 3, 9, \ldots, 3^{k-1}\}$ -- which resolves this limitation by ensuring every target frequency within $[-\omega_{\max}, \omega_{\max}]$ lies within $\tfrac{1}{2}$ unit of a grid point at initialization, removing the spectral gap suppression by construction. On a synthetic benchmark with target frequencies shifted well beyond the standard initialization range, ternary initialization achieves median $R^2 = 0.997$ versus $0.18$ for unary initialization, with $100\%$ of runs achieving $R^2 > 0.95$ against $0\%$. CMA-ES with $20\times$ the evaluation budget reaches only $25\%$ success, confirming the limitation is a property of the optimization landscape rather than of gradient-based optimization specifically. Real-world validation on two benchmark datasets demonstrates consistent advantages over both fixed and trainable unary baselines.

We develop a comprehensive thermodynamic description for a zero-temperature boson gas in curved spacetime, integrating energy conservation with information-theoretic principles. Using the hydrodynamic Madelung representation within the ADM formalism, we establish two fundamental relationships: an energy balance equation representing the first law of thermodynamics from a spacetime perspective, and an information-theoretic constraint connecting Fisher entropy to the dynamical evolution of the boson density. This dual formulation clearly separates energy transport from information conservation while revealing how quantum information is preserved in curved backgrounds. The introduction of a stochastic velocity provides a bridge between quantum potential effects and underlying spacetime fluctuations. We demonstrate the consistency of our framework through detailed analyses of quantum systems in both Minkowski and Schwarzschild spacetimes. This work provides a unified foundation for studying relativistic bosonic systems, with direct relevance to boson stars and scalar field dark matter models.

Molecular quantum sensors represent a promising frontier for the detection of nuclear magnetic resonance signals and alternating current magnetic fields at the nanoscale, potentially reaching single-proton sensitivity. Although the triplet states of molecular pentacene provide a viable sensing architecture, the triplet pair states produced by singlet fission of pentacene dimers could enable more flexible quantum manipulations through entanglement. In this work, we model the quantum sensing efficacy of a spin-polarized quintet manifold in a photoexcited pentacene dimer generated via intramolecular singlet fission. Using a Lindblad master equation approach, we simulate the evolution of the triplet pair state under standard dynamical decoupling sequences, including spin echo, XY4, and XY8 and provide a direct performance comparison to the traditional pentacene monomer benchmark. While both architectures exhibit comparable sensitivity for isolated single-spin detection, our findings indicate that the dimer architecture provides a superior interaction cross-section for detecting small ensembles of nuclear spins. Analytical expressions derived for fluorescence modulation demonstrate that sensitivity is optimized in the low-magnetic field regime and scales with the number of pulses in the sensing protocol. This study establishes a theoretical baseline for utilizing high-spin multi-excitonic states as chemically tunable, high-sensitivity quantum probes.

The Petz recovery map (1986) provably reverses a noisy quantum channel on a reference state, but its algorithmic relevance to real, dissipation-dominated platforms has remained unclear. Using the open-source \texttt{organic-qc-bench} simulation package, we benchmark a Petz-style covariant-purification quantum error correction (CQEC) protocol across four engineered organic qubit platforms operated \emph{without any magnetic field}: a flavin-nitroxide radical-pair reservoir (P1); perchlorotriphenylmethyl radicals in a covalent organic framework (P2); the SVILC qubit [Wakaura2017] on $\kappa$-(BEDT-TTF)$_2$Cu[N(CN)$_2$]Br (P3, conditional on SVILC confirmation); and a Su-Schrieffer-Heeger soliton on \emph{trans}-polyacetylene (P4). Across five quantum algorithms (QKAN, qDRIFT, control-free QPE, Shor-Regev, Bernstein-Vazirani) and two ML tasks, CQEC gains are significant ($p\!<\!10^{-5}$; Wilcoxon, Bonferroni $\alpha\!=\!0.05/44$) for all sixteen path$\times$algorithm pairs. The central finding is the \emph{$\gamma_c$-peak}: the fidelity gain $\Delta F$ is maximised \emph{at} the entanglement-breaking threshold $\gamma_c$, with $\Delta F_{\rm max}\!=\!+0.303$ at $d\!=\!64$ and a linear $\log_2 d$ scaling over $d=2$-$64$ -- algorithmically confirming the prediction [Wakaura2026LQBH] that Petz recovery preserves coherence beyond this threshold. Bernstein-Vazirani also yields a $7.6$-$31\times$ provable quantum advantage at $n\!=\!3$-$5$, diarylethene-photoswitch CZ fidelities reach $F_{CZ}\!\ge\!0.987$ for P2-P4, and projected manufacturing costs are 10-40$\times$ lower with 10-200$\times$ less operating power than superconducting platforms. The $\gamma_c$-peak establishes Petz-style recovery as a practically relevant primitive at the dissipation-coherence boundary and identifies PTM-COF (P2) as the highest-priority experimental target.