Papers

Optical tweezer arrays trapping ultracold atoms and molecules are a versatile quantum science platform with broad impact in quantum simulation, quantum computation, and quantum metrology. The polarization dependence of anisotropic vector and tensor light shifts offers a degree of freedom for precise quantum state engineering of trapped particles. Similarly, state-selective operations depend on the polarization of the addressing light through the atom–light coupling strength. Yet, methods for controlling the polarization of individual tweezers or local addressing beams remain an experimental challenge. Here, we demonstrate independent, site-resolved linear polarization rotation across an optical tweezer array by exploiting the local birefringence tunability of a spatial light modulator. Applying this capability to an array of $^{88}\rm{Sr}$ atoms, we homogenize differential light shifts imparted by the 813-nm tweezers to the narrow ${^1{\rm S}_0}\leftrightarrow{^3{\rm P}_1}$ transition, enabling sideband cooling under a magic-angle condition. Furthermore, we show dynamic transport of trapped atoms across distinct polarization zones with high survival and preserved coherence. Finally, we characterize tweezer polarization noise and demonstrate closed-loop stabilization referenced to the atomic transition frequency, reaching mrad-level stability. Our work establishes a technique for manipulating polarization-sensitive atomic and molecular transitions in tweezer architectures, with immediate applications to optical tweezer clocks and multi-zone quantum processors.

Early fault-tolerant quantum algorithms are a key step in scalable quantum computing, but are ultimately constrained by residual, uncorrectable logical errors. Logical quantum error mitigation can eliminate this bias, however its standard requirements include prior noise characterization, more complex experiments, and substantial sampling overhead. Although no mitigation technique can simultaneously overcome all three constraints, we demonstrate that the first two—noise learning and need for modified circuits—can be completely bypassed for logical circuits by leveraging only syndrome records. Specifically, we introduce virtual error cancellation: a method that, unlike previous bias-free approaches, operates entirely in classical post-processing on universal quantum circuits. We develop and numerically test end-to-end protocols that reduce the sampling overhead beyond fundamental limitations of existing syndrome-aware mitigation techniques, including syndrome-based postselection. In particular, we propose a scheme that pairs the low-latency decoder used in the experiment with a high-complexity decoder run in post-processing. In numerical simulations of a distance-7 rotated surface code, we show that our full-stack dual-decoder algorithm exhibits an error that diminishes as the number of samples increases, capable of reaching more than three orders of magnitude of suppression compared to the decoded logical error rate in an experimentally achievable setting. These results establish syndrome records as a resource for correcting universal computational estimates after quantum execution.

We determine the two-way quantum and secret-key capacities of the pure-loss channel under an average input photon-number constraint. For transmissivity $\eta$ and photon budget $N$, both capacities equal $g(N)-g((1-\eta)N)$, where $g$ is the entropy of a thermal state. This coincides with the rate achieved by the known reverse coherent information of a two-mode squeezed vacuum. Our result provides the last missing capacity formula for the celebrated pure-loss channel, completing the picture of bosonic quantum communication under pure loss.

We study two problems: Local Leakage Resilience (LLR) for Shamir secret sharing, and worst-case Optimal Polynomial Intersection (OPI). Both problems concern polynomials $Q(X)$ of degree less than $k$, over a prime-order finite field $\mathbb{F}_p$. In LLR for Shamir secret sharing, one asks how much one can learn about $Q(0)$ given a few bits leaked from each of $Q(\alpha_1), \ldots, Q(\alpha_n)$, for distinct non-zero evaluation points $\alpha_i \in \mathbb{F}_p$. In OPI, one is given input list $S_1, \ldots, S_n \subset \mathbb{F}_p$, and wants to find a polynomial $Q(X)$ of degree less than $k$ so that $Q(\alpha_i) \in S_i$ for as many $i$ as possible. Leveraging recent connection between these two problems due to (Sun, Wootters 2026), we improve the state-of-the-art for both problems. For LLR, we show that there is some constant $\delta > 0$ so that, as long as $R := k/n \geq 1/2 - \delta$, Shamir secret-sharing is one-bit locally leakage resilient (meaning that one can learn only a negligible amount about $Q(0)$). This is the first result to break the so-called "one-half barrier" for LLR, and improves over the previous best known result, requiring $R \geq 0.668$ (Kasser, 2025). For OPI, we give a quantum algorithm that finds a polynomial $Q(X)$ that agrees with at least a $\mathsf{SCL}_\rho(R)-\varepsilon$ fraction of the lists in expectation, for every fixed $\varepsilon>0$, where $\mathsf{SCL}_\rho$ is the semicircle law of (Jordan et al., 2025). This improves previous algorithmic (and existential) results of (Jo, 2026) and (Horinaga, Yamakawa, 2026). We also give further improved existential results. We also adapt the hardness result of (Yamakawa, Zhandry, 2024) to apply to OPI (rather than a folded version); over large fields, this gives an unconditional separation between the quantum and classical hardness of OPI relative to a membership oracle.

We develop a framework to construct large decoherence-free subspaces with a non-trivial structure. The construction is based on hybrid quantum systems in which quantum matter is coupled to a dissipative bosonic mode. Dissipation imposes a global constraint on the matter by selecting the matter null states in the long-time limit. The decoherence-free subspaces spanned by matter null states can exhibit exotic quantum properties and emergent symmetries that do not characterize the full Liouvillian dynamics. We show how to construct many-body operators with physically interesting null states by employing representation theory of Lie algebras. This approach allows us to choose models based on their underlying algebraic structure. We consider explicitly the example of coupling a lossy optical cavity to the directed tunneling operator of quantum particles in one-dimension. In this case, the symmetries of the decoherence-free subspace originate in an $\mathfrak{sl}(2,\mathbb{C})$ algebra, leading to an exponentially large number of steady states. We characterize the null states for both fermionic and bosonic particles, employing analytical and numerical methods. The states exhibit several properties that underline their complex quantum nature: long-range kinetic correlations and volume-law entanglement. The nonreciprocal nature of the directed tunneling dynamics leads to the emergence in the many-body regime of a symmetry-constrained Liouvillian skin effect. The open light-matter system exhibits a strong symmetry stemming from spinless $\eta$-pairing algebras. We show how the non-trivial properties of the long-times states emerge in the dissipative dynamics from generic initial states, by performing time-dependent matrix product state simulations. Our framework opens avenues for dissipatively engineering complex quantum correlations and harnessing nonreciprocity in a controlled manner.

Dense-neutrino flavor evolution is a quantum many-body problem whose fully correlated treatment becomes rapidly more expensive with increasing particle number and spatial structure. We develop a QCNO quantum simulation code that maps a inhomogeneous forward-scattering neutrino Hamiltonian with advection and finite-range interactions to TEBD2 product-formula quantum circuits, and connects ideal many-body simulation, backend-aware execution, and fault-tolerant resource estimation within the same physical model. We reproduce the exact many-body evolution of the suppressed mean-field-like transverse fast flavor instability through $N=30$ and show that even a single open-boundary interaction generates Rënyi entanglement and non-stabilizer magic, although noisy backends still produce polarization RMSEs of order $0.1$–$0.3$. The restricted active interaction graph of this problem allows us to estimate the circuit depth and $T$ gate cost through $N=50$ for both NISQ and fault-tolerant approaches. The measured TEBD2 error in our fiducial ideal simulation of order $10^{-3}$ motivates a synthesis tolerance $\varepsilon_{\rm syn}\sim10^{-7}$, corresponding to about $70$ $T$ gates per $R_Z$ rotation. The generated circuit contains $1.4\times10^4$ $T$ gates per qubit for open boundaries (twice that for closed boundaries), requiring an application-level logical-$T$ error target of order $10^{-7}$ for early fault-tolerant architectures.

Full Pauli-basis tomography of an arbitrary $n$-qubit state uses the expectation values of all nonidentity Pauli observables. For multiqubit systems, prior knowledge that the state is pure allows some of these observables to be omitted while retaining uniqueness. We study two resulting notions of uniqueness: whether every pure state is uniquely determined among pure states (UDP), and whether every pure state is uniquely determined among all states, including mixed states (UDA). We derive quartic uniqueness certificates from the fourth elementary symmetric polynomial of operators in the real span of the omitted Pauli observables. An exact quartic identity shows that, for $n$-qubit systems with $n\geq 3$, every pure state is UDA whenever the omitted Pauli observables contain no four distinct operators that commute pairwise and multiply to $\pm I$. For three qubits, this condition is also necessary for UDP, yielding an exact characterization of both UDP and UDA. We further prove that UDP and UDA coincide for any number of qubits whenever the omitted Pauli observables commute pairwise. These results provide directly checkable structural criteria for certifying pure-state tomography from restricted Pauli measurements.

Trapped-ion quantum simulators are powerful platforms for exploring many-body physics, yet engineering of arbitrary interaction graphs remains a central challenge. To leverage the intrinsic structure of native motional modes and thereby enhance programmability, a residual-guided optimization protocol is introduced for the systematic design of multi-tone global drive spectra. While the achievable interaction fidelity is fundamentally bounded by the available motional modes, this adaptive strategy converges on the theoretical limit using a number of laser tones that scales nearly linearly with system size. The versatility of this method enables the synthesis of both long-range and traditionally difficult short-range coupling topologies. Additionally, by incorporating a penalty for residual motional excitation, the algorithm effectively mitigates errors associated with incomplete closure of phase-space trajectories. Overall, this scalable framework significantly expands the programmable capabilities of trapped-ion architectures while maintaining low computational overhead and high potential for experimental implementation.

Witnessing entanglement between electrons propagating in quantum circuits requires accessing their two-electron coherences, which encode the two-particle quantum correlations generated by Coulomb interactions. Yet, experimental reconstruction of two-electron coherence remains a major challenge. We introduce photo-assisted two-electron tomography, a quantum coherence reconstruction protocol from dc-currents and time-averaged current correlations, routinely measured in electron quantum optics experiments. Driving an energy filter with a small rf tone encodes off-diagonal coherences in the frequency domain into the dc-current response, enabling single-electron tomography without resorting to current-noise measurements. Extending it to two channels, current correlations after two photo-assisted filters reconstruct the two-electron Wigner distribution and isolate its irreducible two-body part. When applied to Coulomb-coupled quantum Hall edge channels, the protocol reveals interaction-induced energy entanglement. Signatures of this entanglement are visible through the violation of an entanglement witness based on Cauchy-Schwarz inequalities, as well as Wigner function negativities, which remain resolved above the thermal background for realistic device parameters. A generalized Franson geometry further extends the approach to intra-channel two-electron coherences. This opens a direct pathway to detect and characterize electronic entanglement in ballistic quantum circuits.

Establishing the microscopic origin of localized emission in two-dimensional materials through consistent agreement between experiment and theory remains challenging. Recent STM/STS-STML measurements assigned an emission near 1.8 eV in monolayer MoS$_2$/hBN(2L)/graphene to the negatively charged CH$_\mathrm{S}^{-}$ defect. However, a comprehensive theoretical description of this emitter is still lacking. Here, we develop such a description and systematically investigate the photophysical properties of CH$_\mathrm{S}^{-}$ in monolayer MoS$_2$, two bilayer configurations, and a MoS$_2$/hBN heterostructure. The defect retains a similar local geometry and favors a singlet ground state in all four environments, whereas its electronic transition, zero-phonon line, electron-phonon coupling, radiative lifetime, and transition-dipole orientation depend strongly on the surrounding layers. The isolated-monolayer model exhibits substantial structural reorganization and produces a broad, dominant phonon sideband that is inconsistent with experiment. Adding an adjacent layer, either MoS$_2$ or hBN, substantially suppresses the phonon sideband, with only a minor dependence on the defect position in bilayer MoS$_2$. In particular, the MoS$_2$/hBN model yields a weak phonon sideband and closely reproduces the experimental photoluminescence lineshape. Our results thus provide the first theoretical agreement of CH$_\mathrm{S}^{-}$ emission and further reveal the role of adjacent layers in determining the electronic, vibronic, and optical properties of the quantum emitters in two-dimensional materials.

The entanglement structure of a bipartite pure state is characterized by its entanglement spectrum, or equivalently, by the family of Rényi-$k$ entanglement entropies with integer $k$. Taking the difference of two such entropies defines a quantity known as an entanglement spread, that is monotonous under local operations, and that vanishes if and only if the entanglement spectrum of the state is flat. We introduce a multipartite generalization of this notion which, for a fixed number $D\geq 3$ of parties, results in a collection of maps indexed by pairs of $D$-edge-colored graphs (obeying some condition). Each member of this collection takes the form of a difference of two multipartite Rényi entanglement entropies, each associated to a local unitary polynomial invariant (known in this context as a trace-invariant), and is shown to be monotonous under local operations. We then argue that a previously introduced family of so-called hypergraph-tensor (HT) states can be understood as a multipartite counterpart to the family of flat bipartite states. Indeed, we first prove that, when $D=3$, a tripartite pure state is HT if and only if it minimizes a particular (infinite) family of entanglement spreads. Second, we embed the set of HT states into the much larger family of spectral hypergraph-tensor (SHT) states, defined by a new Ansatz we introduce. We then prove that HT states can be uniquely characterized as the minimizers of some fixed entanglement spread among SHT states, for arbitrary $D\geq 3$. We also investigate SHT states in their own right: in particular, we characterize their orbits under local unitary transformations. Finally, along the way, the asymptotic large-$N$ expectation values of a number of entanglement spreads are computed in the Haar-random state of local dimension $N$.

We propose and experimentally demonstrate an asymmetric key-generation scheme in which public and private keys are derived from a six-qubit photonic entangled state. A six-qubit entangled state is generated from two photons, each carrying one polarization and two path qubits. The state is prepared in an equal superposition of eight of the sixty-four six-qubit basis states, in which each photon's three qubits form a codeword of the classical [3,2,2] even-parity code, and are distributed between the two parties, Alice and Bob. This ensures, each triple is a uniformly random codeword and the two codewords are locked together through the correlation. The parity constraint is a local stabilizer, so each party verifies it on its own data every round, and eliminates the bit flip errors arising from imperfections, detector dark counts and multiple occupancy before it enters the raw key. A single publicly announced bit, chosen at random from either of the path qubits, allows each party to reconstruct the other's full triple while leaking no information to third party. We realize the desired six-qubit state using a Sagnac-based type-II SPDC source, reporting a Bell-CHSH parameter S = 2.798 +/- 0.008, by implementing gate operation on polarization and path degree's of freedom. This approach provides a physics-based alternative to public-key cryptosystems built on computational hardness assumptions. A t-bit string generated from multiple rounds for encryption will be intrinsically random. Without the private key, one needs at least O(2^t) runs on an t-qubit quantum system to find the matching bit to decrypt.

Superconducting quantum circuits underpin large-scale quantum processors and are increasingly interfaced with optical systems, yet they are vulnerable to quasiparticle poisoning from high-energy radiation and optical fields. Gap engineering of Josephson junctions suppresses quasiparticle-induced relaxation, but quasiparticles near the junction can still shift the qubit frequency and cause phase errors. Here, we extend gap engineering beyond the junction using a flux-tunable transmon with a gold-on-niobium ground plane and island and strongly gap-engineered aluminum junctions designed to keep quasiparticles away from the junction leads. Compared with an all-aluminum transmon with nominally identical junctions, we demonstrate that the niobium device withstands more than an order of magnitude higher near-infrared optical power before excess relaxation appears. The Nb transmon shows no resolvable quasiparticle-induced frequency shift over the same power range. At the same time, we observe that dephasing and state-preparation-and-measurement infidelity increase with optical power even while relaxation remains protected. These results suggest that engineering the quasiparticle energy landscape beyond the junction can substantially increase qubit resilience, not only to radiation-induced error bursts, but also to nearby optical fields.

Quantum networking represents the future of secure communication, enabling fundamentally new capabilities through quantum information exchange. However, these networks require secure, high-fidelity quantum communication channels, and they require every participating node to be a genuine quantum device. Currently, there is no reliable method to verify whether clients entering a quantum network truly possess quantum computational capability and are connecting over robust channels. In this work, we introduce a client-validation protocol that functions as a proof-of-quantum-capability handshake. Our protocol secures a quantum network against classical spoofers, noisy quantum computers, and genuine quantum devices connecting with the network over noisy or insecure channels. We validate the efficacy of this protocol through numerical simulations under erasure, dephasing, and depolarizing noise models.

Quantum programming requires concepts and intuition that differ substantially from those used in traditional programming languages. Multiple quantum programming frameworks address these requirements through different abstractions and execution models, creating tradeoffs in programmability, portability, and performance. Because quantum software is less prevalent in the training data available to large language models, autonomous coding agents might be expected to face additional challenges when working with these frameworks. We present a case study in autonomous migration of the QED-C Application-Oriented Benchmarks from Qiskit to CUDA-Q. Opus, GPT, and Gemini models were each tasked with porting thirteen benchmark methods spanning foundational algorithms, amplitude estimation, Monte Carlo methods, variational optimization, linear-system solving, and factoring. In all cases, the models were able to generate satisfactory ports with little direct coding help and there was a drastic reduction in the time required compared to a human engineer. However, in all cases, the agents resorted to shortcuts when implementation challenges surfaced and multiple prompts were required to force appropriate coding directions. Assessment of the generated implementations showed that no single model consistently produced the best port across all benchmarks, indicating that multi-agent ensemble strategies could mitigate challenges associated with quantum software. The effort resulted in publicly available, near-complete CUDA-Q support in the QED-C benchmarks along with model-generated skills designed to improve agent performance when implementing CUDA-Q applications. When tested on an unseen benchmark, these skills reduced the required model turns by up to 85% and token usage by up to 96%. We conclude by distilling lessons from the case study.

Which pure states give uniform outcomes in several mutually unbiased measurements, and when can they form another measurement basis? We distinguish common unbiased states, their orthonormal completion, and further extension. For a displayed phase-deformed Fourier pair in dimension $2m$, a clock symmetry and skew antiunitary complete every prescribed common unbiased state to an explicit orthonormal basis. In dimension six, an amplitude-profile obstruction proves strong unextendibility of a given mutually unbiased triple when its original third-basis rays are invariant under the ternary clock. We give an exact nonproduct example and an application to a companion whose columns are localized at single Fourier frequencies. For every exact Hadamard matrix in a specified closed entrywise neighborhood of a fixed reference matrix, the coordinate and Hadamard bases have exactly 48 common unbiased rays but no third measurement basis, with a quantitative lower bound on the squared Gram defect of every six-column candidate. We also study auxiliary complex equations for common states, retaining algebraic multiplicities. For a flat unitary of order six with all $3\times3$ minors nonzero, the projective ray scheme is finite; each singular two-minor contributes two reduced isolated boundary points, and the affine coordinate algebra is finite-dimensional over $\mathbb{C}$. In every order, a critical-algebra identity preserves multiplicities; in dimension six it gives finiteness for a fixed phase fibre. Specialization over a discrete valuation ring controls complete reciprocal-orthogonal collections. A nonphysical Tao/Potts collection separates algebraic from physical solutions. These results do not determine the global maximum number of mutually unbiased bases or classify all triples.

Quantum machine learning, and quantum neural networks (QNNs) in particular, are advancing fields with growing potential. Although systematic comparisons of QNN configurations have been explored primarily for classification tasks, comparatively little attention has been given to regression problems, particularly financial time series forecasting. This study presents a large-scale systematic comparative evaluation of QNN component configurations for financial time series forecasting, using the GBP/USD spot exchange rate as a case study. A grid search across encoding methods, ansatz designs, qubit counts, layer depths, and cost functions yields 1,368 distinct model configurations, each evaluated in terms of prediction accuracy, computational cost, and convergence behaviour. The results reveal unique insights into how the choice of methods influences performance, such as that gate selection and arrangement are more critical to model success than raw parameter count, and that entanglement is a system-level property of the full circuit rather than solely at the ansatz level. The best-performing QNN configuration achieves an $R^2$ score of 0.985, outperforming a classical BiLSTM baseline. Additionally, the impact of real quantum hardware noise is assessed through execution on the IQM Emerald device, revealing that gate errors and decoherence represent a significant barrier to practical deployment, with gate selection and circuit depth identified as key determinants of hardware noise resilience. Overall, the findings provide practical architectural guidance for QNN design and establish a baseline characterisation of QNN noise sensitivity on near-term quantum devices.

We establish a rigorous functional-analytic framework for the imaginary component $p_I$ of the complex weak momentum $p_Q = p_R + ip_I = \frac{\hbar}{i}\nabla\ln\psi$. For every wavefunction in the Sobolev space $H^1(\Omega)$, including those with nodal sets, we prove that the expectation value of $p_I$ vanishes identically, as a consequence of the regularity of $\rho = |\psi|^2$ and without appeal to the polar form $\psi = Re^{iS/\hbar}$. We further show that \textnormal{(i)} the Bohm quantum potential arises entirely from $p_I$ and satisfies $\langle V_{\mathrm{qu}}\rangle = \langle p_I^2\rangle/2m$, from which the known Fisher information relation follows as a corollary; \textnormal{(ii)} the group velocity of a Bloch band is the density-weighted average of $p_R/m$, with no contribution from $p_I$; \textnormal{(iii)} the decomposition is gauge-invariant under magnetic minimal coupling, the vector potential acting only on $p_R$; and \textnormal{(iv)} the results extend to curved Riemannian manifolds.

Protecting quantum information from noise is essential for reliable quantum computation and quantum memories. Quantum state purification addresses this challenge by processing multiple noisy copies of an unknown quantum state to produce an output state of higher fidelity. Here we establish nearly tight upper and lower bounds on the non-Clifford resources required to implement the symmetric-projection purification protocol. For $n$ copies of a $d$-dimensional system, we construct a Clifford+T circuit that block-encodes the symmetric projector with operator-norm error at most $\epsilon$ using $\widetilde{O}(n)$ T gates, where the tilde-$O$ notation suppresses polylogarithmic factors in $n$, $d$, and $1/\epsilon$. Conversely, using stabilizer nullity, we prove that any Clifford+T implementation of such a block encoding with error $\epsilon<\frac{1}{2}\sqrt{1-1/n}$ requires at least $2n-2$ T gates, even allowing arbitrary positive normalization and clean stabilizer ancillas. Taken together, these results establish the nearly optimal scaling of non-Clifford cost with the number of copies and uncover the fundamental resource requirements for coherent symmetry projection in quantum state purification.

Developing general-purpose numerical methods for non-Markovian quantum state diffusion has long been a challenge in the simulation of open quantum systems. This paper proposes a deterministic polynomial chaos Galerkin method, which is easy to implement, accurate, and efficient. By combining a low-rank decomposition of bath correlations with Galerkin projection onto a polynomial chaos basis, the method yields a deterministic formulation compatible with standard numerical solvers for partial differential equations. The reduced density matrix is obtained from a single deterministic solve at a cost comparable to that of computing one stochastic hierarchy trajectory. Replacing an ensemble of $N_{\mathrm{traj}}$ trajectories therefore reduces the computational cost by approximately a factor of $N_{\mathrm{traj}}$ and eliminates statistical sampling error. Benchmark comparisons show that the proposed method achieves smaller errors at lower computational cost than the tested stochastic hierarchy methods. Applications involving nonquadratic potentials, diffraction and interference, and coupled three-dimensional dynamics demonstrate its ability to handle challenging problems.

In this work, we theoretically investigate the non-equilibrium evolution of the correlation functions of a quantum scalar field following a mass quantum quench in a finite-size system. The self-consistent equation for the Keldysh (statistical) correlation function is solved numerically in the one-loop approximation. A specific spatio-temporal effect is observed: at a point in time approximately equal to half the system size, the effective mass experiences a strong disturbance. It is shown that this effect is driven by the interference of counter-propagating wave fronts of fluctuations that propagate within the light cone and is induced by periodic boundary conditions.

Quantum fidelity kernels and quantum extreme learning machines share the same basic architecture: a fixed quantum device generates features that are combined through a classically trained linear model. We refer to this broad non-variational setting as quantum linear regression. A defining aspect of these models is that the quantum features are not directly available, but must be estimated from a finite number of shots. We show that finite statistics makes quantum linear regression unavoidably ill-conditioned. Ideal feature vectors are confined to a subspace determined by the dimension of the Hilbert space, whereas finite-shot estimates generically acquire components outside this subspace. Training then attempts to fit directions that disappear in the infinite-statistics limit, making the learned model increasingly sensitive to sampling noise. We analyze this mechanism for quantum extreme learning machines trained on $n_{\rm tr}$ states with $N$ shots per state. Despite the ill-conditioning, predictions remain controlled when the training targets are exact. Finite sampling produces a systematic prediction error that decreases quadratically with $N$, while fluctuations induced by the random training measurements decrease inversely with the total training budget. Thus, unlike in standard linear regression with exactly known features, increasing the dataset size alone cannot remove the error caused by sampling noise. If the training targets are also noisy, due for instance to state-preparation errors, the otherwise hidden directions become active. The test error can then increase with $N$, a behavior that we ascribe to a form of quantum overfitting. Our results expose a fundamental tradeoff between dataset size and per-state statistics in non-variational quantum learning and provide a baseline for resource-aware training and regularization strategies.

The $2\times3$ magic rectangle is a nonlocal game in which two players match entries subject to incompatible parity constraints. We prove that its quantum value is $(1+\sqrt{2/3})/2$ and classify all optimal strategies in arbitrary finite local dimensions, allowing general measurements. Every optimal strategy contains a maximally entangled pair of four-dimensional systems, with fixed measurements on the local state supports up to local isometries and ancillary systems. The attaining construction was previously known from quantum random access codes. An exact sum-of-squares identity gives the upper bound, and its equality relations determine the measurement algebra needed for the classification. The rectangle determines the largest magic-square score compatible with perfect prediction of Alice's first row by an adversary with quantum side information. We classify all finite-dimensional strategies attaining this score with perfect prediction and show that one minus the best compatible guessing probability has linear order in the score excess above it. The same rigidity theorem classifies all optimal three-bit random access codes that hide the full input parity.

Absolutely positive partial transpose (APPT) states, which remain PPT under every global unitary, provide a spectral relaxation of absolutely separable states, which remain separable under every such transformation. Despite substantial progress, whether these two notions coincide beyond qubit-qudit systems remains unresolved, motivating the study of structured state families in which the APPT spectral constraints and separability can be analyzed exactly. We study this problem for Bell-diagonal states in two settings: the standard two-qutrit Weyl-Heisenberg basis and the two-ququart lattice basis generated by two-qubit Pauli operators. In the two-qutrit case, we show that a linearized necessary condition for APPT defines a polytope of spectra in which every associated Weyl-Heisenberg Bell-diagonal state admits an exact decomposition into explicitly separable states. This yields a separability criterion that applies to a region even larger than the APPT set itself. In the two-ququart lattice Bell-diagonal setting, we show that a state remains PPT under every permutation of its Bell coefficients if and only if its six largest Bell coefficients sum to at most 1/2, and we prove that all such states are separable. Equivalently, every entangled lattice Bell-diagonal state becomes NPT after a suitable coefficient permutation and is therefore not APPT. The proofs combine convex-polytope analysis, affine and symplectic orbit reductions, and exact rational decompositions into separable states supported on affine Lagrangian subsets. Our results rule out entangled APPT states in both Bell-diagonal families, and provide simple spectral inequalities as sufficient criteria for separability in both cases. Being basis-specific, however, they do not by themselves settle whether APPT and absolute separability coincide.

We introduce the unitary-accessible coherence-erasure distance, which measures the minimum unitary-control cost required to transform a quantum state into an incoherent state without changing its spectrum. The target states are restricted to incoherent states on the same unitary orbit, leading to a geometry different from conventional state-space proximity. We establish inequalities relating orbit-restricted quantum transport, Bures geometry, and the unitary-control distance. These quantities coincide for pure states but can differ for mixed states. For qubits, we derive an exact expression and show that, in the nondegenerate case, the coherence-erasure cost depends on the eigenbasis orientation rather than on the eigenvalues. For nondegenerate qutrits, we reduce the problem to an optimization over the monomial unitary group. We derive the tight universal bound $\arccos[(2\sqrt2-1)/4]$ and construct an explicit eigenbasis that attains it. The resulting distance also determines the minimum coherence-erasure time under bounded unitary driving, giving it a direct operational meaning.

Structural measures such as the clustering coefficient and the average shortest-path length characterise how a network is organised. These measures are typically formulated for real, non-negative edge weights. A class of quantum and photonic architectures has complex edge weights instead, whose phases determine whether alternative routes interfere constructively or destructively. These architectures are also bipartite, so triangles are absent and the smallest closed cycle is a four-node square. Existing measures address complex weights and bipartite structure separately: bipartite clustering coefficients quantify clustering through four-node squares but do not contain phase information, while interferometric coefficients retain phase but are defined on triangles. In this work, we define a clustering coefficient for complex-weighted bipartite networks which reduces to the classical bipartite coefficient when the phases vanish, becomes negative when alternative routes cancel, and can be obtained for all nodes from a single sparse matrix product. We show that the phase accumulated around a square is the smallest gauge-invariant carrier of structural phase information in a bipartite network. The clustering coefficient factorises into a topological contribution and a phase contribution, making a bipartite Watts–Strogatz ensemble analytically tractable. For phases uniformly distributed on $[-\Delta,\Delta]$, the mean phase contribution is $(\sin\Delta/\Delta)^4$, independent of node, degree, and topology. We also derive closed-form expressions for the clustering coefficient, open-path visibility, and phase variance. We numerically verify these predictions and further show that phase disorder increases coherent distance.

We investigate a cavity–atom system beyond the rotating-wave approximation and recast its dynamics as an effective tight-binding problem in the excitation-number basis. The same experimentally relevant light–matter platform exhibits two distinct regimes controlled by the photon number. In the large-photon-number regime, the hopping amplitudes become nearly uniform and the effective lattice reduces to a dimerized SSH-type chain subject to a linear energy gradient. The spectrum then organizes into one or two Wannier–Stark ladders, giving rise to controllable Bloch and Bloch–Zener oscillations and quantitatively explaining the observed revival patterns. In the small-photon-number regime, the intrinsic $\sqrt{\bar n+(\cdots)}$ dependence produces a pronounced hopping deformation, namely dimerized couplings that increase along the excitation-number lattice. This deformation reshapes the density of states, enhances collective localization, and generates an energy-resolved spatial bias of the eigenstates. The corresponding real-time dynamics displays direction-dependent anomalous diffusion together with Bloch-like revivals and beat phenomena in selected parameter windows. Our results show that the same cavity–atom platform can realize both emergent ladder spectra and hopping-induced localization in excitation-number space.

We investigate the redistribution and directional properties of Gaussian tripartite quantum steering in de-Sitter space within the continuous-variable framework. By expressing the Bunch-Davies vacuum in terms of the open-chart modes through a Bogoliubov transformation, we derive the covariance matrix of the resulting multipartite Gaussian state and analyze both one-to-two and two-to-one steering configurations. We find that de-Sitter curvature generally suppresses the steering initially shared among the accessible modes, but its influence depends strongly on the steering direction. In particular, while some steering configurations undergo sudden death at finite curvature, two-to-one steering toward a nongravitational mode remains finite throughout the parameter range considered, demonstrating a robustness of tripartite steering absent in its bipartite counterpart. Remarkably, the maximum steering asymmetry occurs at the critical point at which steering in one direction undergoes sudden death, marking the transition from two-way to one-way steering. We further show that the de-Sitter gravitational field can generate tripartite steering involving modes separated by the cosmological horizon. Depending on the steering partition, this curvature-induced steering exhibits persistent one-way or asymmetric two-way behavior, as well as a sudden-birth transition from one-way to two-way steering. These results demonstrate that de-Sitter curvature not only degrades preexisting quantum correlations but also redistributes and generates directional multipartite steering across causally disconnected regions.

While the Bloch sphere provides a canonical geometric representation for qubits, its generalization to pure qudit states ($d>2$) is not unique. This representation can be extended following two different approaches: increasing the number of points, as in the Majorana representation, or using a single point but in a space of larger dimension, as in the generalized Bloch representation. In this work, we compare these representations of pure qudit states by finding explicit analytical relations between them. In particular, a general formula of the Bloch vector in terms of the Majorana points of a given state is provided. We also analyze some suitable extensions of these representations in the case of pure permutation-symmetric two- and three-qubit states, deriving the corresponding relation between them. These analytical results allow us to study, from a geometric point of view, quantum correlations of special classes of two-qubit states.

In quantum mechanics, among the proposals for how to compute the probability distribution of detection time and place along a given spatial surface or in a given volume, two leading candidates involve absorbing boundary conditions (ABCs) and complex absorbing potentials (CAPs) for the Schrödinger equation. Here, we extend earlier results on how the two are related. It was previously shown that ABCs arise as a limiting case of CAPs, but for that a (reflecting) Neumann boundary condition was assumed at the end of the region with the CAP. Here, we obtain ABCs in a different limit using a Dirichlet boundary condition at the end of the CAP region, which seems more practically relevant and realizable.