Quantum Physics Paper Analysis

Quantum generative learning based on instantaneous quantum polynomial-time (IQP) circuits can benefit from efficient classical training strategies. A recent latent adaptation framework for IQP-based generative modeling transfers shared circuit parameters across instances of the same task with different hyperparameters while adapting only a low-dimensional latent variable for each new instance. However, existing approaches initialize this latent variable randomly, which can limit optimization efficiency and performance. In this work, we introduce a physics-informed latent initialization scheme for IQP generative learning to improve upon existing random initialization schemes. Motivated by the platonic representation hypothesis, we use latent representations extracted from a classical physics-informed neural network (PINN) surrogate to initialize the latent variables of the quantum model for the solution of the Burgers' equation. The initialized IQP model is then adapted on a higher-resolution solution domain. We find that this structured initialization consistently outperforms random latent initialization, yielding improved adaptation behavior and stronger generative accuracy across multiple viscosity settings. These results show that classical surrogate representations can provide useful inductive bias for quantum generative models and offer a practical route to improved initialization in IQP-based learning.

Roadside units (RSUs) supporting connected and autonomous vehicle corridors need compact models to decide when cooperative maneuvers should be rewarded, deferred, or disabled. Raw sensor streams and neural network weight checkpoints are poorly suited to bandwidth-limited, privacy-sensitive roadside learning. This paper presents $\texttt{FedQML-Edge}$, a federated quantum feature-sketching pipeline for traffic-stability gating. Each RSU constructs a traffic-state summary and sends circuit inputs to a quantum computer; Pauli expectations form a nonlinear sketch processed by a logistic classifier. Only classifier updates are shared with an aggregator, whose head supports reward gating. Raw observations, vehicle records, event traces, and quantum sketches remain private. We evaluate the method using NGSIM trajectories, SUMO predictive gating with sensing noise, and IBM Quantum hardware. On NGSIM, the Pauli sketch reduces test log loss by $14.4\%$ relative to the strongest matched classical sketch. On SUMO, it approaches larger MLPs in stable-window recall while using $7-28$ times less communication per round.

Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode remains a challenge. We introduce mitten codes, a family of qLDPC processor codes of encoding rate $20\%$ and check weight $9$, based on non-abelian groups. Their non-abelian structure evades distance bounds constraining abelian counterparts, allowing mitten codes to reach distance $18$ and beyond with just a few hundred data qubits. The logical operators of a mitten code are related by the group action, yielding a modular, low-overhead logical toolkit: full Clifford operations follow from bridging two reusable seed surgery gadgets or from a single fixed extractor. Furthermore, qLDPC processors based on mitten codes support high-rate surgery that executes many logical measurements in parallel, and parallel magic-state injection into all logical qubits at once. Under circuit-level noise, with our fast decoder, the $[\![300,60,14]\!]$ mitten code achieves, without extrapolation, a block logical error rate of ${\sim}10^{-11}$ per round at $0.1\%$ physical error rate (PER), while the $[\![ 975,195,\leq 24 ]\!]$ code reaches ${\sim}10^{-8}$ at $0.4\%$ PER. Decoding $15$ billion surgery experiments on the $[\![540,108,18]\!]$ code at $0.1\%$ PER, we observe only two logical failures, demonstrating a qLDPC processor capable of running ${\sim}10^{10}$ logical operations. Our decoder is compatible with sub-millisecond average latency per logical cycle, sufficient for real-time decoding on neutral atom hardware. Discovered by an end-to-end design pipeline built on sQetch, a distance estimator orders of magnitude faster than existing tools, and mapping efficiently onto near-term neutral atom and superconducting hardware, mitten codes open a practical path toward fault-tolerant quantum computation.

Lifted product (LP) codes form an important class of quantum error correcting codes with favorable code parameters. We introduce a systematic construction of LP code families based on group extensions and graph lifts. The construction increases the code size while preserving the local structure of the Tanner graph, and relates code parameters, logical operators, and fault-tolerant logical-operation gadgets within the families through chain and cochain maps. As a first application, we obtain LP codes with better code parameters than previously reported ones. We then demonstrate that code-surgery gadgets can be transferred across the selected finite lifts through chain maps and, in several cases, implemented with lower space overhead. We also develop parallel product surgery for lifted clustered cyclic codes. Finally, we propose lifting as a systematic first step toward defining thermodynamic families for algebraically defined qLDPC codes without an underlying Euclidean lattice. For several base codes and selected lifts, coherent information exhibits finite-size crossings, while our results also indicate that additional conditions are needed to determine a unique family.

Preparation of optimal measurement states is a key requirement in quantum metrology utilizing squeezed states. We discuss a geometric framework that transforms an initially misaligned squeezed input into a measurement-optimal state in SU(2)-symmetric systems. Within this framework, the orientation of the squeezing ellipse constitutes an additional geometric degree of freedom and evolves as the mean state follows a controlled trajectory on the unit sphere. The resulting rotation of the ellipse is determined by the geometry of the path and, for the relevant class of transformations, depends on the solid angle enclosed by the trajectory, establishing a connection with the geometric phase. The discussed framework is applicable to different physical platforms. As a particular example, we consider polarization-squeezed light and outline a possible implementation using a continuously varying birefringent element.

We study the problem of learning an unknown Markovian open-system generator from access to its physical time evolution. This generator, called a Lindbladian, contains Hamiltonian and dissipative coefficients indexed by an exponentially large family of possible Pauli terms. We propose an efficient algorithm that learns arbitrary Lindbladians from time evolution under minimal assumptions. For a Lindbladian of dynamical strength at most $Λ$, the algorithm estimates every coefficient to error $ε$ using $\widetilde O(Λ^2/ε^2)$ experiments and $\widetilde O(Λ/ε^2)$ total evolution time, together with polynomial classical running time. The algorithm consists of two nonadaptive, ancilla-free, and control-free stages: 1. The support-learning stage outputs a candidate support of size $\mathrm{poly}(Λ/η)$ that contains every Hamiltonian and dissipative coordinate of magnitude at least $η$, using $\widetilde O(Λ^2/η^2)$ experiments with preparations of product Pauli eigenstates and single-qubit Pauli measurements. 2.The coefficient-learning stage estimates all coefficients in any candidate support of size $M$ to error $ε$, using $\widetilde O(Λ^2\log M/ε^{2})$ experiments with preparations of random stabilizer states and measurements in random Clifford bases. Composing the two stages identifies and estimates every coefficient of an arbitrary Lindbladian in polynomial time. The experiment-count and total-evolution-time scalings match the lower bounds up to logarithmic factors, so the algorithm is nearly optimal for learning arbitrary Lindbladians.

High-rate quantum low-density parity-check (qLDPC) codes encode many logical qubits with low physical-qubit overhead, but realizing efficient fault-tolerant computation on such dense encodings remains a major challenge. Generic, code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes whose structure is left unexploited. Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of \emph{canonical} lifted-product (LP) codes with cyclic symmetry. We show that these codes admit a \emph{canonical logical basis}, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes, analogous to the structure that makes hypergraph-product codes so tractable. This canonical basis unlocks a complete logical instruction set, including constant-depth automorphism and fold-transversal Clifford gates, modular graph code surgeries built from a constant number of reusable seed surgery gadgets or a compact canonical extractor, highly parallel logical Pauli-product measurements, and parallel magic-state injection. For example, a $[[1122,148,\leq\!20]]$ (resp. $[[4350,1224,\leq\!20]]$) LP code requires only two (resp. four) seed surgery gadgets, while arbitrary high-weight logical measurements can be implemented using a full extractor smaller than half of the data code block. These results advance the frontier of fault-tolerant quantum computation on ultra-high-rate quantum architectures.

The unclonable bit question asks whether quantum encryption can prevent an adversary from producing two systems that both reveal the plaintext once the key is disclosed. We introduce and study Pauli Encodings, a simple class of one-bit encryption schemes whose ciphertexts are normalized eigenspace projectors of Pauli strings. For every Pauli Encoding with K Pauli strings, we prove a universal lower bound $1/2+1/(2\sqrt{K})$ on the optimal monogamy-of-entanglement winning probability, together with sharper bounds for several structured families. We then establish two limitations of natural approaches to unclonable security. First, if the Pauli strings are restricted to strings of X and Z of length n, the encoding is not secure. Second, we identify a universal 3/4 obstruction showing that arguments based only on pairwise guessing marginals cannot establish unclonable-indistinguishable security. When the Pauli strings all pairwise anticommute, the protocol becomes the one studied in [Quantum 10, 2157 (2026)]. We exploit the symmetry of this protocol to solve the third level of the natural semidefinite programming relaxation obtaining an asymptotic upper bound of approximately 0.5556 on the winning probability. Finally, we prove strong unclonable-indistinguishable security against bounded-local-dimension adversaries and strong indistinguishability security for several efficient Pauli families. First-level NPA computations provide additional numerical evidence towards the strong unclonable-indistinguishable security.

Fault-tolerant protocols often consist largely of stabilizer subcircuits, yet the non-Clifford operations required for universality make exact sampling costly. We present SymFT, a high-throughput simulator for Clifford-dominated circuits with Pauli rotations, stochastic Pauli noise, mid-circuit Pauli measurements, and measurement-record-controlled Pauli feedback. It combines two ideas. First, symbolic Clifford--Pauli frame factorization reduces branch-probability sampling to Pauli rotations and measurement projectors, with noise and feedback represented by symbolic signs. Since the residual Clifford and Pauli frames are unitary, they do not affect branch probabilities and need not be applied in every shot. Second, adaptive stabilizer-coordinate planning uses a shared stabilizer--destabilizer tableau to define the basis and stores only the active non-stabilizer degrees of freedom in a dynamically sized dense active-state vector. It resolves basis changes once and emits direct multi-coordinate sampling instructions, thereby avoiding per-shot tableau updates and localization-induced Clifford transformations of the dense vector. Across the tested pure-Clifford and near-Clifford circuits, SymFT achieves state-of-the-art sampling performance. On a single CPU core, it is $2.51\text{--}2.56\times$ faster than Stim for surface-code circuits and $1.86\text{--}3.51\times$ faster than Clifft for magic-state cultivation and distillation circuits. For the tested cultivation circuits, its sampling throughput also exceeds that of our previous simulator, SOFT, by more than two orders of magnitude.

In this article, we present an explicit family of invertible $n\times n$ matrices over $\mathbb Z_2$ whose CNOT and row complexity is at least $4n-\text{o}(n)$; equivalently, reducing these matrices to the identity requires at least $4n-\text{o}(n)$ elementary row operations. Moreover, the same complexity lower bound holds in the stronger computational model where the CNOT gates are replaced by arbitrary local linear logic gates, namely arbitrary invertible linear transformations acting on pairs of coordinates. Let $G_n$ denote the permutation group generated by local logic gates acting on the set of binary strings of length $n$. We prove that $G_n$ is naturally isomorphic to the group of all invertible affine transformations of the vector space $\mathbb Z_2^n$, thus reducing the problem of estimating the quantum complexity of permutations in $G_n$ to the row reduction complexity of invertible matrices over $\mathbb Z_2$. As an application, we show that the permutations associated with our explicit matrices have quantum complexity at least $4n-\text{o}(n)$.

The physics of quantum chaos and diffusive transport is typically studied in settings with microscopic disorder or many-body interactions. In this Letter, we demonstrate that these phenomena can arise purely from geometric randomness. By studying non-interacting quantum particles on random locally tree-like layered graphs with uniform couplings, we show that the geometric randomness and effective graph dimensionality dictates the presence of chaotic dynamics or lack thereof. These graphs can be considered as structurally disordered generalisations of regular square lattices or ladders, or equivalently as multi-component one-dimensional chains with random links between the components. We find that an extensive layer size yields robust quantum chaos, level repulsion, and diffusive transport. Conversely, in the quasi-one-dimensional limit, we find the coexistence of extensive number of localised and delocalised states -- this leads to suppressed level repulsion accompanied by the latter driving ballistic transport. These results establish geometric randomness as a fundamental and independent mechanism for generating and tuning quantum chaos.

Cloud-accessible quantum computing has made hardware comparison not only a physics benchmark but also a practical purchasing decision. Cost-aware comparison of quantum computers remains underexplored and is difficult to do under the heterogeneous billing models offered by various cloud-based quantum computing providers. This paper makes two main contributions to enable price-aware comparison of quantum computers. First, this work presents a cross-provider measurement study of quantum circuit execution fidelity spanning 14 cloud QPU access-path entries (12 distinct physical QPUs) across four cloud access paths: Amazon Web Services (AWS) cloud, IBM Quantum Runtime (IBM) cloud, IQM Resonance (IQM) cloud, and Oxford Quantum Circuits (OQC) cloud. Second, this work proposes and analyzes a cost-aware score, Quantum Fidelity-per-Cost (QFC), which combines Kullback--Leibler (KL) divergence from an ideal output distribution, shot count, and monetary cost into one possible metric under a documented billing model. The main empirical observation from this work is that cost-aware ranking can differ from purely fidelity-based evaluation of quantum computers, and that users may select different quantum computing backends when they consider price in their selection, as opposed to selection based on fidelity alone. This work shows that the ranking is stable under reweighting of the metric, and that a device's billing model, not its hardware, governs how its score scales with shot count. Reported QFC values change as new machines come online or as providers revise their prices.

As quantum computing matures, it is critical to benchmark its real-world problem solving performance against competitive classical methods, such as tensor networks. In this work, we leverage the Density Matrix Renormalization Group (DMRG) algorithm to compute ground state energies of the Lipkin Meshkov Glick (LMG) model as a comparative benchmark against popular noisy intermediate-scale (NISQ) algorithms like the Variational Quantum Eigensolver (VQE) and Sample-Based Quantum Diagonalization (SQD) method. By running DMRG on the NERSC Perlmutter supercomputer, we provide one of the largest LMG ground state energy datasets in literature, containing accurate ground state energies for systems up to 1400 particles. We compare these results with VQE and SQD implementations on an IBM Eagle quantum computer for comparison. VQE achieved results within 1 percent error for 6 particles, while exceeding that threshold for all other values while SQD extended that range to 17 particles, suggesting that in a noisy intermediate scale quantum era, subspace-based approaches may strike the best balance between accuracy, circuit depth, and noise resilience.

Unconditional uncloneable encryption of a single bit with efficient encryption and decryption is now possible. However, whether the extension to messages of arbitrary length achieves statistical security remains to be known. Using the fact that the encoding bases for the single-bit scheme known to be secure consist of a subset of the Clifford unitaries, we show that this scheme can be upgraded to achieve unconditional uncloneable encryption for messages of arbitrary length, with encoding time polynomial in the message length and security parameter. This establishes that one-time uncloneable encryption of arbitrary messages enjoys statistical security.

We demonstrate a quantum-classical workflow for ab initio molecular dynamics (AIMD) in which quantum measurements from a chemistry-inspired LUCJ ansatz are post-processed using Sample-based Quantum Diagonalization (SQD) to recover determinant subspaces and deliver energies and analytical nuclear gradients for dynamics. As an exact benchmark, we use full configuration interaction (FCI) in the STO-3G basis, enabling a direct assessment of the accuracy of SQD. In gas-phase benchmarks, SQD reproduces FCI energies and gradients to within 1 kcal mol$^{-1}$ of the FCI reference and yields stable AIMD trajectories. In explicit-solvent QM/MM simulations, SQD retains this agreement, matching FCI energy fluctuations and RMS gradient profiles and reproducing solute-solvent structure as quantified by radial distribution functions. Overall, these benchmarks establish LUCJ+SQD as a practical route for integrating current quantum hardware into QM/MM molecular dynamics and provide an early demonstration of condensed-phase QM/MM dynamics driven by a quantum electronic-structure engine.

We develop a hybrid qubit--qumode algorithm for nonlinear ordinary differential equations of the form $\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x})$ with drift of polynomial degree~$L$. Following the Fokker--Planck route of Tennie and Magri, the algorithm propagates the state density and returns the deterministic trajectory as the peak of that density in the small-noise limit. The discretised generator is carried into a parametrised family of Schrödinger equations by the warped-phase transformation of Jin, Liu, and Yu, and the Fourier-mode parameter of that family is placed on a single continuous-variable qumode. Our central structural result is that the Hermitian parts $H_{1}$ and $H_{2}$ of the discretised generator admit a bipartite Pauli decomposition that sorts the non-zero Pauli strings into $\mathcal{O}(\log N)$ mutually commuting families and factorises each family into a diagonal of degree at most $L$ tensored with a fixed rank-two bond operator. The factorisation renders each family exponential an exact product of $\mathcal{O}(n^{L})$ monomial-controlled momentum displacements, with no intra-family Trotter error. On a $d$-dimensional grid of $N=2^{n}$ points per axis the circuit costs $\mathcal{O}(d^{L+1}n^{L+2})$ gates per Trotter step. No sparse-access oracle and no block encoding is invoked: every gate is fixed in closed form by the polynomial coefficients of the drift. We also prove a bound on the numerical abscissa $λ_{\max}(H_{1})$ that fixes the recovery domain of the warped-phase transform and the post-selection cost. A classical simulation on two nonlinear benchmarks confirms the structural theorems, the shifted recovery, and the accuracy-per-resource advantage of the continuous-variable coupling over a discretised mode register.

At high temperature, quantum Gibbs states retain several classical features of the maximally mixed state: the absence of entanglement, the absence of magic, analyticity of the partition function, correlation decay, and algorithmic tractability. We prove new and sharp bounds showing that these features persist down to finite temperatures independent of system size, but fail at distinct inverse-temperature scales, forming a hierarchy of classical-to-quantum transitions. Our results hold for long-range Pauli interactions with bounded strength at every site. Despite such all-to-all interactions, we show that the death of entanglement occurs at constant temperature, resolving an open question of Rouze, Franca and Alhambra (STOC'25). We give a polynomial-time classical algorithm that prepares Gibbs states up to the death of entanglement transition. Notably, this is asymptotically colder than temperatures at which quantum Gibbs samplers are known to mix quickly, as well as the original separability temperature of Bakshi et al. (FOCS'24), which we improve to be tight up to constants. At asymptotically even colder temperatures, we show that the Gibbs state remains in the thermodynamic infinite-temperature phase. This leads to polynomial-time classical algorithms for estimating thermal expectations despite both entanglement and magic, and the resolution of a correlation decay conjecture of Harrow, Mehraban and Soleimanifar (STOC'20).

We give a quantum signal processing (QSP) algorithm for the overlap fermion Hamiltonian which preserves the Ginsparg-Wilson relation up to a controllable error $ε_e$. Quantum simulations of Dirac fermions with exact chiral symmetry are thus nearly free: applying the overlap Hamiltonian costs only a factor logarithmic in $ε_e$ more than the Wilson-Dirac Hamiltonian. Comparing to domain-wall fermions, a mild overhead is found in circuit complexity while reducing qubit costs. We show how QSP effectively constructs an extra dimension when simulating the overlap operator, illustrating that the scaling of quantum algorithms reflects the deeper physics of overlap fermions arising at the boundary of domain-wall fermions.

We prove that every ironed two-qubit gadget whose KAK-derived parameter satisfies $a=5/9$ has, on the complete graph $K_n$ with $n\geqslant 5$, the same second-moment spectral gap as the iSWAP gadget. The central step is a representation-theoretic localisation theorem: the largest strictly negative eigenvalue of the associated $\mathfrak S_n$-invariant operator always occurs in the highest-spin $\mathrm{SU}(2)$ summand. A local positive-semidefinite decomposition separates every spin sector except the two highest. This settles a conjecture of Kong, Li, and Liu.

Fault-tolerant quantum computing requires system-level coordination of logical primitives. Here, we establish a logical compilation framework for the color code, grounded in its topological structure and supporting universal logical operations. Based on its anyon-condensation and domain-wall structure, we introduce a spacetime block-diagram representation capturing logical patches and operations and derive the rules governing block assembly. A correspondence with ZX diagrams further identifies the logical semantics of this representation and enables transformations that preserve the represented computation. Moreover, we develop a code-derived compilation strategy that converts ZX representations of logical computations into valid color-code spacetime layouts. In this strategy, edge-decorated ZX diagrams tailor the logical representation to the color code under the block-assembly constraints, and fusion-region-aware routing exploits semantic equivalence during geometric embedding. We automate the complete logical compilation process and demonstrate successful compilation across a broad range of algorithms. Our work advances color-code architecture from individual primitives to the automated synthesis of logical computations, marking a significant step toward its full-stack quantum computing.

Wave equations provide a natural testbed for near-term quantum simulation of partial differential equations, but hardware demonstrations have remained limited in spatial dimension, equation class, system size, and physically meaningful output. We develop and benchmark structure-preserving, Fourier-based quantum circuits for the one- and two dimensional acoustic wave equations and Dirac dynamics with variable mass on the Quantinuum H2-2 trapped-ion processor. The experiments include one-dimensional grids with up to \(1024\) points and \(32\times32\) two-dimensional grids, corresponding to an encoded state-space dimension of up to \(4096\). Rather than reconstructing the full fields, we estimate subdomain kinetic energies directly from measurement samples. Across all tested acoustic and Dirac dynamics problems, the H2-2 results track the classical kinetic-energy dynamics with mean absolute errors between \(5.9\times10^{-3}\) and \(2.4\times10^{-2}\). At fixed retained bandwidth, the compiled gate counts grow approximately quadratically with the number of grid qubits; the acoustic circuit sizes are essentially independent of evolution time, whereas the cost also grows with the number of product-formula steps. These results provide hardware-level evidence that accurate observable dynamics can remain resolvable for structured wave problems with thousands of encoded degrees of freedom on a present-day trapped-ion processor.

Broadband squeezed light functioning as a Markovian reservoir can exponentially enhance light-matter interactions, benefiting quantum technologies. However, conventional single-cavity sources face a trade-off between squeezing depth and spectral bandwidth. We propose a scalable scheme for generating broadband squeezed vacuum using a cascade of parametric microring resonators coupled to a common bus waveguide. By analyzing the output, we identify the specific conditions that yield a broad, flat-topped squeezing spectrum, even under realistic intracavity pump attenuation. We demonstrate that this architecture is robust against fabrication imperfections, including inhomogeneous resonator frequencies and component failures. We show that the flat-topped spectrum converges to the Markovian limit significantly faster than a single-cavity Lorentzian profile. An array of as few as $N=5$ coupled resonators with an intrinsic loss ratio of $κ_I/κ= 0.1$ reduces the required bandwidth to a quarter of that needed by a single cavity to achieve same squeezing. This rapid convergence relaxes the low-$Q$ and high-gain constraints of single broadband cavities, distributing the squeezing process across moderately pumped resonators to provide a practical route for engineering squeezed reservoirs on mature integrated photonic platforms.

In the original Hayden--Preskill recovery, the post-injection scrambler and initial state are {\it not related}. We extend this setup in two ways: by using a SWAP gate so that the scrambler and initial state are {\it related}, and by considering recovery at {\it finite} temperature. For this modified protocol, we show that the information is successfully recovered in the sense that the postselection probability is non-negligible and the conditional fidelity is large. We find that both the postselection probability and the conditional fidelity are proportional to temperature, reflecting the reduced entanglement of the initial state at lower temperatures. We also derive their late-time analytic estimates under the assumption of uniform operator spreading and show that they agree well with the numerical results. This demonstrates that strong scrambling is important for successful information recovery. Implementing the protocol on an IBM superconducting processor using a binary sparse SYK Hamiltonian with $N = 8$ Majoranas, we observe that the data retain the qualitative recovery dynamics and that a SWAP-based error-mitigation scheme improves both the postselection probability and the conditional fidelity.

Single T centers in silicon have emerged as promising optically active spins for quantum networking applications. One of the major obstacles to advancing the system is their broad optical linewidth due to spectral diffusion, which is two orders of magnitude larger than their cavity-enhanced radiative linewidth. We tackle this issue by utilizing above-band optical excitation delivered via a laser scanning microscope to device-coupled single T centers, achieving up to 70% optical linewidth reduction. We attribute the linewidth narrowing effect to the filling of nearby charge traps by photo-generated free carriers. We analyze charge stabilization dynamics by exploiting pulsed above-band excitation and develop a rate equation model to describe the dynamics and to explain the observed linewidth narrowing and center shift. This work provides an effective pathway to control and reduce the optical linewidth for single T centers, clearing one of the major roadblocks to advance the single T center spin platform for quantum information and networking applications.

We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry. Using a tensor-network-based approach, we quantify how amplitude-damping and dephasing channels degrade the flow of quantum information along the ladder and the fidelity of one- and two-qubit gate operations. We then demonstrate that shaping the global drive compresses the gate sequences by an order of magnitude in time, restoring high gate fidelities. We stress that this mitigation is far from trivial: in a globally driven processor, dissipation acts on every physical qubit---including those outside the logical register that sustain the surrounding ordered phases---so its impact cannot be suppressed by protecting an isolated subsystem, and is instead overcome purely through the temporal shaping of the global drive.

We investigate quantum steering and nonlocal correlations between two electrons in a two-dimensional electron gas (2DEG) as functions of Rashba spin-orbit interaction (RSOI) strength and inter-electron separation. We focus particularly on the Bi/Ag(111) system characterized by its strong RSOI ($α_0 = 3.05\times10^{-11}$ eV~m), and we explore the influence of tuning intensity of RSOI and inter-electron distance on the dynamics of Bell nonlocality, uncertainty-induced nonlocality and steering. We find that, although increasing $α_R$ initially suppresses quantum correlations, all three metrics exhibit a non-monotonic recovery as functions of $α_R$, peaking near an optimal coupling strength $α_R = 4.32\times10^{-11}$~eV~m across the range of inter-electron separations considered. This finding establishes RSOI as a critical control parameter for stabilizing quantum properties in two-dimensional electron gases against the decay of quantum correlations with inter-electron separation, and shows that the suppression and recovery of quantum resources within the Bi/Ag(111) system can be controlled by adjusting the inter-electron distance and carefully tuning the RSOI strength.

Fourier-based methods are among the most widely used techniques for pricing European options when the characteristic function of the underlying asset process is available. Their applicability to increasingly fine discretizations, however, is limited by the rapidly growing memory requirements of classical Fourier transforms, which become a computational bottleneck for large-scale pricing problems. In this work, we overcome this limitation by reformulating the Carr-Madan pricing framework using tensor networks. Specifically, we employ the Superfast Fourier Transform (SFFT), a compressed Tensor Train representation of the Quantum Fourier Transform (QFT), and apply it directly to tensorized option pricing without ever explicitly constructing exponentially large vectors or Fourier operators. This formulation also enables a direct comparison between the classical tensor network algorithm and its quantum counterpart through QFT-based option pricing on quantum simulators and quantum hardware. Numerical experiments for European call options demonstrate that the proposed SFFT method maintains pricing accuracy while substantially reducing memory requirements and achieving subexponential computational scaling compared with conventional FFT-based pricing. The accompanying quantum simulations and hardware executions enable a direct comparison between the classical tensor network formulation and its QFT-based quantum counterpart, showing that both approaches avoid the exponential scaling of conventional Fourier implementations and provide complementary perspectives on large-scale option pricing. Together, these results establish a unified framework connecting classical Fourier pricing, tensor network algorithms, and quantum computing approaches, demonstrating how tensorized Fourier methods can provide scalable alternatives for high-dimensional financial computations.

We extend the regime of convergence of Carleman-embedded quantum algorithms that solve the Vlasov-Poisson equations from kinetic plasma physics. We establish convergence, using both analytical and numerical lower bounds, for physically reasonable collision frequencies using a Fourier-Hermite expansion of the shifted phase-space distribution function. We also show that for a large class of basis functions, the convergence of the Carleman-embedded Vlasov-Poisson system requires increasing collision frequency strength with velocity resolution. The complexity of the quantum algorithm depends strongly on whether we seek time-averaged or -resolved outputs.

Quantum oracle of Boolean functions is one of the central bridges between classical and quantum algorithms, but the study focusing at quantum circuit optimization of such oracle is yet closed. In this paper, we propose nearly optimal tradeoffs among circuit size, circuit depth and ancilla count, for quantum oracles of three kinds of Boolean functions: general total Boolean functions with output size $b$: with $1\le m\leΘ\left(\frac{2^n}{n}\right)$ ancilla, size $\mathcal{O}\left(\frac{b2^n}{\log(n+m)}\right)$, depth $\mathcal{O}\left(\frac{b2^n}{n+m}\right)$; partial Boolean functions of effective support size $d$ and output size $b$: with $Θ\left(\log d\right)\le m\le Θ\left(d\right)$ ancilla, size $\mathcal{O}\left(n\log d+bd\right)$, depth $\mathcal{O}\left(\frac{n\log n\log d}{n+m}+\log n+\frac{d(\log d+b\log m)}{m}\right)$; sparse Boolean functions of true input size $d$: with $Θ\left(\log n+\log d\right)\le m\leΘ\left(\frac{nd}{\log d}\right)$ ancilla, size $\mathcal{O}\left(n^2\log d+\frac{nd}{\log(\log d+m/n)}\right)$, depth $\mathcal{O}\left(\frac{n^2\log n\log d}{n+m}+\log n+\frac{nd}{m}\right)$. All the size and depth bounds are asymptotically optimal up to logarithmic factors in the corresponding ancilla count regions. We hope these results find applications in scenarios where classical procedures are needed to be embedded into quantum circuits, such as QROM implementation and quantum algorithm design.

Counterdiabatic (CD) driving accelerates adiabatic protocols by prescribing auxiliary control fields, but often fails to map them to physically available operations. We derive a general formalism for such a mapping. We formulate CD driving in a variational dressed frame, where an unconstrained auxiliary generator reshapes the effective adiabatic problem while simultaneously forcing the applied correction to stay restricted to the native laboratory controls. This yields a laboratory-frame commutator equation that can be solved without constructing instantaneous eigenstates or the adiabatic and dressed-frame unitaries. The additional dressed-frame freedom reveals solutions that are inaccessible in the conventional adiabatic frame. We illustrate this mechanism in three settings: suppression of spectator errors in a multi-qubit chain driven by a single quadrature, an analytical acceleration of adiabatic Bell-state preparation with a fixed entangling interaction, and implementation of a fast adiabatic holonomic gate in a degenerate tripod manifold with correction pulses confined to the native couplings. Our results provide a systematic nonperturbative framework for constructing implementable counterdiabatic protocols beyond the conventional adiabatic frame.

We study a one-dimensional frustrated spin chain, which combines cluster-Ising and anisotropic next-nearest neighbor Ising models. We first offer a historical perspective that justifies the studied model. Then we study in detail the two quantum phases and prove that they are separated by a first order quantum phase transition. On one side, the ground state corresponds to a ferromagnetic phase, shows the presence of macroscopic cat states, and a small gap that closes in the thermodynamic limit. On the other phase, competing interactions avoid the establishment of a topological phase, though it conserves large incommensurate quantum correlations. We prove it is fundamentally distinct from a simple paramagnet, and we name it an incommensurate phase. This is a gapped phase, which gap does not close in the thermodynamic limit. While in the ferromagnetic phase there are two dominant Schmidt coefficients, in the incommensurate phase there are four. This corresponds to four distinct bipartite entanglement channels contributing substantially to the ground state. Finally, we discuss the utility of the macroscopic cat states for quantum metrology applications and the experimental feasibility of the system.

The performance of scientific software often determines the scale of problems that can be solved in practice. As multiple implementations of the same algorithm emerge, systematic evaluation is needed to compare their strengths and limitations. The density matrix renormalization group (DMRG) algorithm, widely used to study quantum systems, has over 50 software implementations. These implementations vary in multiple aspects that can strongly affect performance. However, despite the need, performance evaluations of these implementations are scarce and lack a consistent standard; many existing evaluations are either too incomplete to enable meaningful comparisons or focus on objectives other than direct performance comparisons, thereby limiting understanding of how the implementations compare. Here, we present a performance-oriented benchmarking framework to facilitate meaningful comparisons of DMRG implementations, and we apply it to quantify the performance of eight implementations, highlighting similarities and differences among them. Furthermore, we examine multiple parameter settings, optimization strategies, and implementation-specific features to demonstrate how parameter configuration can affect performance and how systematic evaluation can reveal non-obvious trade-offs. The results show significant performance differences, up to two orders of magnitude in some cases, not only between different implementations when aligning parameters, but also within the same implementation when comparing different parameter configurations. Hence, our results demonstrate the significant value and insight that can be gained from conducting rigorous performance evaluations. Using our results and framework as a starting point, more rigorous benchmarking will ultimately help users and developers make informed decisions and support future development efforts to build better, more efficient software.

Analog quantum processors based on Rydberg atom arrays are a powerful platform for many-body quantum simulation, combinatorial optimization, and graph machine learning. As these devices become increasingly accessible, establishing confidence in their outputs requires predictive models that quantitatively connect microscopic hardware imperfections to empirical results. Here, we present a noise-aware emulation framework that propagates the dominant noise mechanisms throughout the full computation cycle to predict device behavior. We validate the framework by benchmarking two representative protocols, quantum annealing and post-quench dynamics, on three Pasqal quantum processors where classical simulations still provide ground truth. Across all three devices, the measured observables fall within the uncertainty envelopes predicted by the emulator. Beyond reproducing the data, the framework isolates which physical mechanism dominates in each operating regime, provides quantitative guidance for algorithm design and hardware improvements, and establishes a foundation for verifying analog processors in regimes beyond classical reach.

Coupling-based quantum optimal transport generalizes classical optimal transport by representing transport plans as bipartite states with prescribed marginals and evaluating their cost as the expectation of a fixed Hermitian operator. Friedland et al. [Phys. Rev. Lett. 129, 110402 (2022)] conjectured that the square root of the optimal cost associated with the SWAP projector is a metric in every dimension and that this property persists for nearby quantum cost matrices. Miller [arXiv:2607.07764] disproved both conjectures by constructing explicit diagonal qutrit counterexamples. Building on his analysis, we prove a uniform no-go theorem for standard couplings. In every dimension $d\geq3$, no fixed cost operator makes either the optimal cost or its square root a metric, with violations occurring already among commuting states. The obstruction persists under stabilization of the SWAP cost. For channel-induced couplings, global nonnegativity and vanishing self-cost force the cost operator to be zero, precluding point separation when $d\geq2$. Taken together, these no-go results show that fixed-cost coupling formulations do not lead to metrics on the full quantum state space.

We study continuous-time quantum walks (CTQWs) on cycles. In particular, we prove that the cycle $C_9$ does not admit uniform mixing at any time via algebraic geometry and Gröbner basis techniques to rule out all cyclic 9-roots.

Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the $T$ count of sparse QROM, in which only $s$ of the $2^n$ addresses store nonzero data. We prove asymptotically optimal $T$-count bounds $Θ(\sqrt{sm} + \sqrt{sn})$ with square-root dependence on the support size $s$ and message length $m$. Our upper bounds use a multilevel hashing scheme, while our lower bounds reduce sparse QROM to state preparation and use counting arguments for adaptive Clifford+$T$ circuits. The lower bounds thus hold even when mid-circuit measurements and classically controlled operations are allowed. As applications, we obtain matching $T$-count bounds $Θ(\sqrt{sn} + \sqrt{s\log(1/\varepsilon)} + \log(1/\varepsilon))$ for $s$-sparse state preparation and $Θ( \sqrt{2^n sn} + \sqrt{2^n s\log(s/\varepsilon_{\mathrm{BE}})} + \log(s/\varepsilon_{\mathrm{BE}}))$ for block encoding of $s$-sparse matrices, where $\varepsilon$ and $\varepsilon_{\mathrm{BE}}$ are the precision of state preparation and block encoding, respectively.

We introduce and solve the Interacting Quantum Symmetric Exclusion Process (IQSEP), a family of models describing the stochastic quantum hopping of charged particles along the edges of a lattice, with hopping amplitudes that depend on the occupations of neighbouring sites. In the absence of interactions, they reduce to the standard quantum simple symmetric exclusion process, exhibiting coherent diffusive transport. For interactions of order one, they capture incoherent diffusive transport and its fluctuations, characterized by density-dependent diffusivity and mobility, making contact with the macroscopic fluctuation theory. By rescaling the interaction strength appropriately with the lattice mesh, we define a mesoscopic scaling regime that retains a finite coherence length in the continuous thermodynamic limit. This regime interpolates between coherent behavior at small length scales and incoherent behavior at large scales. The resulting scaling theory accounts for fluctuations of quantum coherences in interacting diffusive systems, going beyond the scope of standard fluctuating hydrodynamics.

The four laws by Arago and Fresnel distinguish the coplanarity of two light beams to determine their capacity of interference, laying the historic milestone for conceptualizing the polarization of light. Equipped with modern descriptions of non-classical states, we re-investigate the macroscopic Arago-Fresnel interference producible by photon helicities. To this end, we compute the Stokes parameter of a polarized beam combined from a regular coherent state (displaced from the vacuum) and a displaced single-photon spin state (displaced from either a left- or right-spin state of photon). The spin orientation, together with its relative asymmetry with respect to the polarizing orientation of the displacing coherent state, produces distinguishing parameter dependences and thus distict interference fringes. Conversely, this quantum interferometry establishes a purely optical method to determine the spin of an unknown incident photon.

Motivated by the importance of the purification principle in quantum theory and generalized probabilistic theories, we study purifications using only the geometry of a finite-dimensional proper convex cone. We prove an existence theorem for indecomposable cones and intermediate tensor cones containing the maximally entangled state; in particular, every interior point of an indecomposable homogeneous cone admits a purification. This applies to Lorentz cones, for example. We also give a criterion for uniqueness up to local automorphisms. On the boundary, we show that if every proper face of $C$ is simplicial, then only pure points can admit purifications, and we demonstrate that this conclusion fails in the presence of non-simplicial faces. Examples involving positive semidefinite cones, Lorentz cones, $k$-positive maps, PPT tensors, and polyhedral cones illustrate both existence and non-uniqueness phenomena.

Promising implementations of first generation quantum repeaters are predicted to require atomic-based quantum memory systems interfaced with photonic sources. Integrated photonics provides a promising solution for fibre-based, field-deployed operation of quantum repeaters, however many leading quantum memory platforms require narrow-bandwidth photons that are challenging to generate with integrated photonics. Narrowband photons also present significant technical challenges when implementing entanglement-swapping, particularly with regards to systems-level stabilisation. This work addresses some of these fundamental and technical challenges, by demonstrating entanglement-swapping using state-of-the-art integrated photon sources with bandwidths compatible with multiple atomic-based quantum memory platforms. We obtained a background-subtracted (net) HOM visibility of 0.99$\,\pm\,$0.01, showing high photon indistinguishability and purity, with a net swapped state visibility of $\mathcal{V}$=0.88$\,\pm\,$0.06 demonstrating that the final entanglement would be sufficient to violate a Bell inequality. The experiment used independent pump lasers for each photon pair source, with highly different frequencies to mimic entanglement swapping between different repeater nodes or platforms. Phase and frequency stabilisation spanning 1.6 THz was achieved using all-fibre, commercially-available components. These results address important challenges in implementing field-deployed quantum repeaters, from the integrated photonic solutions for narrowband photon pairs, to systems-level stabilisation between independent quantum repeater nodes.

Neutral-atom quantum computers offer arbitrary connectivity enabled by atom transport. Some logical operations can then be simplified or reduced entirely to geometric rearrangements of the atoms. Minimizing the duration of these movements is therefore essential for high logical throughput. We introduce new primitives to shear, rotate and reflect 2D arrays of atoms in a static lattice using sweeps of a single dynamic crossed acousto-optic deflector (AOD) pair. Using (nega-)binary and geometric decompositions, we achieve an AOD stroke count scaling logarithmically in the linear size of the array. In one example, we use the Paeth decomposition to implement a $90^{\circ}$ rotation for a transversal Hadamard gate in a rotated surface code of distance $d$ in $3\lfloor\log_2(d-1)\rfloor + 4$ AOD strokes and $O(d^{1/3})$ constant-jerk time, against $O(d^2)$ strokes and $O(d^{7/3})$ time for atom-by-atom rearrangement.

Optimization problems are among the leading candidates for industrially relevant quantum advantage. Decoded quantum interferometry (DQI) has been proposed to tackle approximate optimization, establishing a connection to classical decoding problems. While previous work has primarily focused on the theoretical complexity of DQI, comparatively little is known about its empirical performance relative to classical algorithms. In this work, we shed further light on the complexity of DQI and investigate numerically whether classical sampling methods can emulate the optimization capabilities of DQI. We first present a simplified analytical characterization of DQI that connects its expected performance to binomial statistics, and we identify concrete obstacles in further studying the complexity of DQI. Exploiting the fact that DQI output probabilities are efficiently computable, we apply Markov chain Monte Carlo (MCMC) techniques, particularly block-Gibbs sampling, to sample from the induced distribution. We study the runtime scaling of these methods for two optimization problems called max-XORSAT, where we reach beyond $1000$ effective qubits; and OPI, where we reach beyond $150$ effective qubits. Our results show that MCMC algorithms can reliably attain the approximation ratios expected from DQI across a broad range of problem sizes. In OPI, in the regime where a super-polynomial advantage is claimed for DQI, we observe an empirical runtime for MCMC that scales approximately as $1.1^{n}$, indicating exponential growth with a comparatively small base. Our findings do not refute existing quantum advantage claims but provide new empirical evidence that classical sampling algorithms can closely match DQI's optimization performance, offering a more nuanced perspective on the practical advantage of DQI.

Quantum key distribution (QKD) is secure in principle, but practical security can be undermined by discrepancies between real devices and the idealized models assumed in security proofs. Source side channels, including those exploited by Trojan-horse attacks, are particularly detrimental: neglecting them compromises implementation security, whereas accounting for them reduces performance. Here we propose a QKD source that is intrinsically robust against side-channel attacks. Unlike existing passive and modulator-free schemes, it requires neither post-selection of the emitted pulses nor devices with a perfect extinction ratio to suppress side channels, and it does not introduce correlations between the intensity and the encoded bit or basis. Consequently, simpler security proofs apply directly, yielding substantially higher key rates. Our proposal appears to be within reach of current technology and therefore provides a clear and practical path toward implementation-secure QKD.

Several classical majorization relations for sums or products of matrices involve a majorizing vector of perfectly aligned eigenvalues or singular values. By relaxing the order of alignment to a partial order, we show that the majorization can be strengthened, provided the change-of-basis matrices admit an LU-approximation with respect to this partial order. In this way, we obtain refined versions of Ky Fan's majorization relations, Horn's log-majorization relation, and von Neumann's trace inequality. As an application, we give a short proof of the separable Ky Fan majorization relation for an arbitrary number of tensor factors and extend it to a sum of tensor products of arbitrary matrices. Further applications concern majorization relations for sums of (anti-)symmetric powers and for products of Kronecker sums.

Rare-earth-doped crystals are promising candidates for quantum storage, yet their performance in free-space configurations is fundamentally restricted by low optical depth. Here, we demonstrate high-efficiency quantum storage in a stoichiometric EuCl$_3 \cdot$ 6D$_2$O crystal, which intrinsically provides high optical density without the complexity of cavity implementation. We show that in this high-density regime, the system exhibits significant slow-light-like effects, including dispersion-induced echo delays and finesse-dependent echo intensity modulation. We develop a unified theoretical framework showing how absorption and dispersion work in concert to mediate echo generation. We achieve storage efficiencies of 42.9% for classical light and 34.4% for weak coherent pulses, alongside 90% efficiency for slow-light storage. These findings validate EuCl$_3 \cdot$ 6D$_2$O as a robust platform, establishing a viable pathway for scalable solid-state quantum memory.

The survival of many-body coherence depends on the competition between correlation buildup and decoherence. In Dicke superradiance, collective emission builds up correlations, producing a peak intensity scaling as $N^2$ for $N$ emitters. We develop a scaling theory including local dephasing and spontaneous emission and obtain fully collective, partially collective, and independent-emitter scaling regimes. The boundary of the fully collective regime defines a continuous phase transition in a transient observable. Local decoherence can prevent $N^2$ scaling despite increasing $N$.

Many properties of classical graphs are defined in terms of subsets of the vertex set. Examples include connected components, which are subsets $X \subseteq V(G)$ such that $X \times X^c$ and $E(G)$ are disjoint, or independent sets, for which $X \times X$ and $E(G)$ are disjoint. Direct generalisations of these definitions to quantum graphs are difficult to achieve, since the natural notion of subsets of a quantum set is much too rigid. As a consequence, approaches to generalising these classical properties to the quantum setting have been eclectic. In some cases, multiple inequivalent definitions of the same notion are in use. We introduce a natural and well-motivated alternative definition of subsets of a quantum set. Building on this, we propose unified definitions of quantum graph properties as straightforward generalisations of the classical definitions. We recover this way the established notions of colourings and connected components. For independent sets and cliques, our approach suggests variations that diverge from existing definitions, but address some of their counterintuitive properties. We nevertheless show how to recover an important existing definition of independent sets in our framework.

A Moiré time crystal is a non-equilibrium quantum phase emerging from the coherent interference of two distinct frequencies, at least one being the intrinsic oscillation of a symmetry-broken time crystal. Its hallmark is an ultra-long beat period, reflecting a time-domain mapping of the Moiré fringes that arise from mismatched spatial lattices. However, to date, no experimental realization of such a Moiré time crystal has been reported. In this work, by applying a bichromatic driving field with two distinct frequencies, we demonstrate that the interplay between long-range Rydberg interactions and dissipation gives rise to a unique comb-like Moiré pattern characterized by a beat-note comb, which superimposes subharmonic periodicity and fundamental frequencies. This Moiré pattern formed by two mismatched drives is staggered in the spectrum as the frequency of one driver changes. We experimentally map the phase diagram of the system and identify a robust region where the Moiré temporal order persists against perturbations in laser detuning. The reported Moiré time crystal not only provides a controllable platform for exploring emergent slow-fast dynamics and synthetic space-time symmetries but also opens avenues for engineering complex temporal order in driven quantum many-body systems.

Recent advances in quantum information and quantum thermodynamics have reshaped the understanding of energy storage at the microscopic scale, paving the way toward protocols for storing and transferring energy in quantum devices. These systems, known as quantum batteries, offer a conceptual alternative to conventional macroscopic chemical batteries by exploiting quantum coherence, correlations, and many-body dynamics. By navigating the landscape of established spin-based quantum batteries, we review existing charging and work-extraction protocols, as well as the impact of external factors on their performance. Motivated by Floquet-engineered proposals, we further establish a connection between continuously and periodically driven spin chains as platforms for quantum energy storage. Finally, we survey experimental realizations and proposals, highlighting their implementability and scalability in current and near-term quantum technologies.

The coexistence of quantum and classical signals in optical fiber infrastructures represents a major challenge for large-scale quantum networks, as noise sources such as Raman scattering can significantly impact entanglement distribution, and the quantum protocols based on it. In this work, we analyze Raman scattering in the C-band, used for entanglement distribution, generated by a classical the O-band signal. The main contribution of this study lays in investigating these effects in a real metropolitan-fiber network, moving beyond controlled laboratory experiments to deployed telecommunication environments. Measurements are performed over a 7 km metropolitan fiber link using commercial sources and narrowband lasers. The experimental results shows good agreement between the measurements taken under laboratory conditions, although, within the metropolitan-scale loop, localized spectral anomalies are observed in the deployed fibers. Therefore, our results show that, whenever a quantum signal propagates in the C-band alongside an O-band classical channel within the same fiber, careful selection of the operating frequency is required, as Raman scattering and other real-world noise sources can significantly affect the quality and stability of the quantum transmission. In particular, we identify spectral regions that are less affected by Raman noise, thereby providing practical guidelines for optimal quantum channel allocation. We demonstrate that Raman-induced noise constitutes a dominant contribution to the quantum signal-to-noise ratio (SNR) in realistic deployments, beyond background and detector noise. Overall, our findings offer practical insights for deploying quantum communication systems over existing fiber networks, supporting the development of robust and scalable quantum infrastructures.

We establish an exponential communication advantage enabled by multipartite quantum entanglement. Building on the bipartite Hidden Matching problem, we introduce a communication task involving multiple spatially separated senders and a single receiver. We show that a shared Greenberger-Horne-Zeilinger state enables completion of this task using only logarithmically many bits of classical communication from each sender. In contrast, without preshared entanglement, any protocol achieving high success probability requires polynomial communication from at least one sender, even when \emph{quantum} communication is allowed. Thus, classical communication assisted by multipartite entanglement can be exponentially more powerful than quantum communication without preshared entanglement. As a cryptographic application, we construct a seeded two-source randomness extractor and establish an exponential separation between entangled and unentangled quantum side-information. Specifically, compromising the extractor with two unentangled quantum states storing information about the two sources, respectively, requires polynomial-size memory, whereas exponentially smaller quantum memory suffices in the presence of a small amount of shared entanglement.

In the NISQ era, limited qubit resources make it difficult to execute large quantum circuits directly on real hardware. Quantum circuit cutting mitigates this limitation by decomposing a large circuit into smaller subcircuits, but it shifts substantial overhead to classical post-processing. As circuit size, complexity, and cut count increase, reconstruction becomes a major computational and storage bottleneck. This paper presents a CPU+DCU heterogeneous parallel framework for circuit-cutting post-processing reconstruction. Instead of constructing a dense $2^n$-dimensional probability vector or returning only high-probability states, the framework reconstructs the nonzero-probability states in the original output distribution from subcircuit measurement results. It combines heterogeneous CPU+DCU execution with a high/low-word integer representation for global basis-state indices beyond 64 bits and a three-level cooperative storage mechanism spanning device memory, host memory, and out-of-core storage. Experiments on the Songshan supercomputer show that the framework maintains high reconstruction fidelity while achieving up to $259\times$ speedup over an optimized serial baseline on linear-cluster states and up to $4\times$ speedup over a homogeneous CPU-parallel method on random circuits. The framework can also complete reconstruction tasks at the hundred-qubit scale. These results demonstrate that HPC-oriented heterogeneous reconstruction can effectively alleviate the classical post-processing bottleneck and improve reconstruction scalability.

Sequence models must decide what to write into memory and what to retain. In quantum and quantum-inspired sequence learning, nonlinear recurrent updates often require repeated circuit evaluations and sequential backpropagation through time, making long contexts costly. Gated fast-weight programmers (FWPs) based on quantum-inspired Kolmogorov-Arnold networks (QKANs) alleviate this bottleneck by storing context in time-varying fast parameters. However, their scalar gate applies one retention-write balance to every fast-state coordinate, forcing all parameters to share a memory timescale. We introduce Self-Modulating QKAN-based FWPs, which replace this broadcast gate with low-rank-generated element-wise modulation of the new-proposal branch, a bounded old-state branch, or both. We further propose Complementary Matrix Gating (CMG), which uses one sigmoid matrix gate to retain the old state and its complement to write the new proposal. CMG provides coordinate-wise memory control while preserving the bounded convex update and affine prefix-scan structure of scalar gating, at the modulation-head cost of a single-branch rule. We compare four self-modulating rules with scalar gating across four FWP architectures combining classical and QKAN-based slow and fast programmers. Across seven single-step forecasting benchmarks and five sequence lengths, CMG gives the most consistent improvements for architectures whose fast programmer incorporates a QKAN-based module. In direct multi-step forecasting of Jaynes-Cummings and transmon-resonator dynamics simulated with CUDA-Q Dynamics, CMG models maintain mean-squared errors on the order of 0.001 or lower across forecasting horizons of 4, 8, and 16 steps, while improving on their scalar-gated counterparts by at least 91.2%. These results establish coordinate-wise complementary modulation as a stable and effective update for QKAN-based FWPs.

Topological data analysis (TDA) provides a powerful framework for extracting information about the shape of complex, unstructured data, but the classical cost of computing high dimensional topological features limits its application. Quantum algorithms for TDA offer a route around this bottleneck, yet existing approaches typically focus on exact or high precision Betti number estimation, making the regime for practical quantum advantage appear narrow. Here, we instead frame quantum TDA as a feature-extraction method for downstream data analysis by extracting low-order spectral information from the combinatorial Laplacian as a proxy for high-dimensional topology. We support this perspective from both the application and algorithmic sides. First, we show that higher-order TDA features improve predictive performance in two time-series applications: functional MRI analysis for neurodegenerative disease classification and financial time-series analysis for identifying market instability. Second, we develop a moment-based quantum algorithm and show that low-order moments, including the relative trace, are strongly correlated with high-dimensional Betti information, even when the relative Betti number is small. Finally, we present circuit constructions, resource estimates, quantum-classical crossover projections, and experimental results from a Barium development system similar to the forthcoming IonQ Tempo line, extracting Laplacian-derived observables from graph instances and quantitatively comparing them with exact Betti information. Together, these results establish quantum TDA as a practical approach for extracting topological features from classically challenging data

Modular quantum computing is a leading paradigm for scaling quantum computation beyond the resource limitations of monolithic devices. In this architecture, multiple quantum processing units (QPUs), employing identical or distinct qubit modalities, are interconnected via shared entanglement. Here, we investigate how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code. Going beyond the logical-memory benchmark, we perform circuit-level simulations of fault-tolerant nonlocal CNOT gates implemented via lattice surgery between QPUs connected by noisy Bell pairs, and analyze the resulting logical error rates. Our results show that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold. We further develop an efficient protocol for preparing distributed fault-tolerant logical GHZ states, reducing ancilla overhead, time, and nonlocal Bell-pair consumption. We show that ancilla minimization in this setting is equivalent to a vertex-cover problem on an associated graph, and introduce a polynomial-time heuristic algorithm for finding low-overhead solutions. Our results provide quantitative evidence that distributed quantum error correction can enable scalable, fault-tolerant quantum computation in modular architectures.

The manipulation of quantum entanglement is fundamentally irreversible: some mixed entangled states require pure entanglement for their preparation, although no pure entanglement can be recovered from them by local operations and classical communication. This irreversibility is known to persist even under the maximal class of operations that do not generate entanglement, revealing a fundamental distinction between entanglement theory and thermodynamics. We construct cases for which any attempt to restore reversibility necessarily incurs an error that increases exponentially with the number of copies. Technically, we demonstrate a strict separation between the exponential strong-converse distillable entanglement and the exponential strong-converse entanglement cost. Our result resolves a conjecture posed by Lami and Regula (Nat. Phys. 19, 184-189 (2023)) and strengthens it by showing that the irreversibility of entanglement persists even at the level of polynomially (in the number of copies) growing error. We further derive a semidefinite-programming lower bound on the exponential strong-converse cost under non-entangling operations. Finally, for the class of completely PPT-preserving operations, we construct analytically solvable families of antisymmetric states exhibiting the exponential strong-converse irreversibility. Remarkably, to our knowledge, no analogous separation between exponential strong converse cost and the analogous distillable entanglement is currently known even under the more restrictive class of LOCC operations.

We study the Sachdev-Ye-Kitaev (SYK) Hamiltonian $H_{\operatorname{SYK}}$ on $n$ Majorana modes with $k$-body interactions, and prove that $\mathbb{E}\|H_{\operatorname{SYK}}\|_{\operatorname{op}} = (1 - o(1))\cdot\sqrt{2n}/k$ for super-constant $k\leq o(\sqrt{n})$, where the expectation is over the disorder variables in the Hamiltonian. This confirms the predictions due to Garcia-Garcia, Jia and Verbaarschot'18 and answers a question posed in Feng, Tian and Wei'19. Our results extend to the sparse SYK Hamiltonian. As a corollary, we obtain that the dissipative quantum algorithm of Basso, Chen and Dalzell'24 provably computes the ground state energy of the SYK Hamiltonian up to an $O(1)$-multiplicative factor for all $k < \sqrt{n}/4$. Our key technical idea is identifying an explicit, deterministic linear operator $\mathsf{x}$ such that a fixed quadratic form of $\mathsf{x}^{2\ell}$ exactly equals the expected trace moments of the SYK Hamiltonian for every $n$ and $k$. This linear operator can be naturally viewed as a \emph{twisted} model of bosons on the space of hyperedges of a hypergraph. The problem thus reduces to identifying the spectral edge of $\mathsf{x}$, which we show is dominated by the spectrum of a natural ${n \choose k}$-dimensional matrix from the \emph{Johnson} scheme and is straightforward to compute using known results. To show that our bound is sharp, we construct a witness state with a large quadratic form on $\mathsf{x}$ and transform it into a certificate of a lower bound on the largest quadratic form on $H_{\operatorname{SYK}}$.

We show that nonadaptive single-qubit Pauli measurements suffice to test whether an unknown $n$-qubit state $ρ$ is $\varepsilon$-close to or $O(\varepsilon)$-far from an ideal target state $|ψ\rangle$, for all but a $2^{-Ω(n)}$ fraction of target states. The test uses $O(\varepsilon^{-2}\log(1/δ))$ copies of $ρ$ to achieve confidence $1-δ$, which is information-theoretically optimal even among protocols with arbitrary joint measurements. The main technical innovation is an uncertainty principle for weighted generalizations of the total influence of Boolean functions. As a simple example, the unweighted variant states that $\mathbf{Inf}[f]+\mathbf{Inf}[\widehat{f}] = Ω(n)$, which is a natural hypercube analogue of the Heisenberg uncertainty principle (here $\widehat{\,\cdot\,}$ denotes the $2^{-n/2}$-normalized Fourier transform). The weighted case generalizes $\mathbf{Inf}[\,\cdot\,]$ and $\mathbf{Inf}[\,\widehat{\,\cdot\,}\,]$ to Dirichlet energies associated with Glauber dynamics for certain dual measures on the cube.

Demonstrating a practical quantum advantage remains a central goal in quantum information science. While quantum computational supremacy is still technologically demanding, communication complexity offers a promising route to showcase quantum advantage with current photonic platforms. Here we introduce a reconfigurable optical platform for one-way quantum communication complexity based on multimode fibers and wavefront shaping. We experimentally validate it by implementing a genuine one-way quantum communication complexity problem for which an exponential quantum--classical communication separation is known. Complementary numerical simulations show that the same reconfigurable decoding architecture can support more general one-way communication tasks with comparable performance, while also offering a route to higher-dimensional implementations without increasing hardware complexity. Together, these results establish multimode-fiber wavefront shaping as a versatile hardware platform for one-way quantum communication complexity and provide a concrete roadmap toward more demanding protocols, where stronger quantum--classical separations could enable practical demonstrations of quantum advantage.

Spin is the hidden engine behind the zoo of MacWilliams transforms in weight enumerator theories - not only for qubits and qudits, but even for classical codes. From nothing more than a split into trivial and nontrivial errors, we kinematically derive the MacWilliams transform as a Wigner-$D$ rotation between two canonical bases. Within each classical and quantum theory, changing the length $n$ leaves the rotation untouched: the same element simply reappears at spin $n/2$. And at fixed $n$, changing the rotation axis simply moves between the various classical and quantum theories.

Quantum query is a basic subroutine in many quantum algorithms, and Quantum Random Access Memory (QRAM) provides a natural way to realize such coherent query access. In delegated settings, however, a standard QRAM query interface can expose sensitive information to the server. This paper introduces oblivious QRAM, a cryptographic abstraction for privacy-preserving delegated coherent query access. The protocol consists of an offline refresh phase and an online protected query phase. The database is stored in an encrypted and shuffled layout, and each query is protected by coherent address masking using either a quantum-secure pseudorandom permutation (qPRP) based method or a quantum one-time pad (qOTP) based method. In the adopted client model, the online protection adds only modest quantum overhead beyond the query register, avoiding the exponential quantum resources that would otherwise be required by an equivalent local QRAM construction. The qPRP-based variant also supports multi-query use by distributing database refresh across multiple queries to reduce classical communication. To address malicious servers, decoy checks are further incorporated to strengthen privacy protection and enable probabilistic tampering detection. Compared with fully blind quantum computing, this framework provides a lighter abstraction tailored to private delegated QRAM access, significantly reducing quantum resource requirements on both the client and server sides and achieving an exponential reduction in quantum communication.

The Non-Equilibrium Green's Function (NEGF) is the standard formalism for nano-scale electron transport. By recasting the NEGF scattering problem as a linear system of equations whose solution encodes the transmission and reflection amplitudes, we present the first quantum computerized implementation of NEGF. We apply both the Harrow--Hassidim--Lloyd and Variational Quantum Linear Solver algorithms to compute the transmission coefficient $T(E)$ of quantum dragon nanodevices within the single-band tight-binding model. Quantum dragon devices exhibit perfect transmission across the full conducting band regardless of internal disorder. The problem maps onto compact circuits of 3 and 4 total physical qubits for the 2-site and 6-site dragon devices, respectively. A similarity transformation block-diagonalizes the NEGF linear system reducing the Pauli decomposition of the block-encoded matrix. We demonstrate the feasibility of quantum computation by performing ideal and noise-aware simulations and computations on physical IBM quantum processor.

One of the central challenges in quantum error correction is determining the performance of a code in the low-error regimes needed to implement utility-scale computations. While performance at these error rates is not amenable to direct Monte Carlo simulation, it can be extrapolated from simulations at higher logical error rates, assuming the logical error rate scales predictably with increasing distance or decreasing physical error rate. However, the expected scaling depends sensitively on the minimum weight of uncorrectable error patterns. In many cases, the minimum weight is unknown since it depends not only on the theoretical code distance, but also on details of the implementation. Markov chain Monte Carlo (MCMC) methods, as adapted to quantum error correction by Bravyi and Vargo, provide a way to estimate logical failure rates in these low-error regimes via simulation. While offering significant gains over Monte Carlo, the described Metropolis algorithm makes small changes to the current logical failure patterns which results in slow convergence. In this paper, we argue that typical failure patterns include a large number of easily correctable errors that coexist alongside a malignant core. This observation motivates two new approaches to better evaluate code performance. First, we describe a pruning algorithm designed to obviate these correctable errors and focus on the problematic low-weight core. Second, we develop a novel family of Metropolis-Hastings algorithms, referred to as subregion MCMC. This technique is parameterized by the fraction of the error pattern that is resampled at each step, effectively interpolating between Monte Carlo and single step MCMC. We show that a judicious choice of this parameter results in far faster convergence than prior work.

Multi-degree-of-freedom photonic quantum processing requires routing between degree-of-freedom (DOF) qubit encodings on a single photon. A SWAP between polarization and time-bin qubits is Multi-degree-of-freedom photonic quantum processing requires routing between degree-of-freedom (DOF) qubit encodings on a single photon. A SWAP between polarization and time-bin qubits is an advantageous primitive for such architectures, however conventional early/late time-bin encoding does not support bidirectional logical time-bin flips from late to early which limits the ability to implement certain quantum operations. We introduce a parity-based time-bin encoding in which logical $\vert 0 \rangle_T$ and $\vert 1 \rangle_T$ correspond to even and odd multiples of a spacing $Δt$, so that a physical delay of $Δt$ implements $\vert 0 \rangle_T \leftrightarrow \vert 1 \rangle_T$. This encoding is the enabling ingredient that makes a polarization-controlled delay line implement $\mathrm{CNOT}_{P \rightarrow T}$ and aligns naturally with periodic refractive index modulation for $\mathrm{CNOT}_{T \rightarrow P}$. Composing three such CNOT operations sequentially results in a deterministic SWAP between polarization and time-bin degrees of freedom. We analyze field-based modulation polarization-rotation error probability and timing-resolution constraints set by both EOM drive electronics and photon detection.

Erasure-error detection can improve the efficiency of quantum error correction by revealing the times and locations of their error events. In this work, we demonstrate erasure conversions and mid-circuit erasure detections in a single integer fluxonium, in which the states $\mathrm{|g\rangle, |f\rangle}$ encode the logical states and $\mathrm{|e\rangle}$ encodes the erasure state. The integer fluxonium suppresses direct $|\mathrm{f} \rangle \rightarrow |\mathrm{g} \rangle$ transitions and allows the dominant $|\mathrm{f} \rangle \rightarrow |\mathrm{e}\rangle$ transitions to be converted into detectable erasures. Furthermore, we identified a design space that nullifies the resonant-frequency shift between the two logical states, enabling ancilla-free mid-circuit erasure checks using the same resonator employed for final readout. By discarding the detected erasure events, we achieved an 8.4-fold increase in the $|\mathrm{f}\rangle$ state lifetime, a 1.38-fold increase in the Hahn-echo time, and a reduction of single-qubit gate error from 0.061(2)% to 0.030(5)%. Our results establish integer fluxonium as a hardware-efficient platform for erasure-error detection and conversion, while identifying the improvements required to realize an effective erasure qubit with high erasure bias.

We give an algorithm which, given $n = O(d^2 \cdot (\log\log(d)/\log(d))^2)$ copies of $ρ$, estimates the eigenvalues of $ρ$ to constant error in total variation distance. Thus, we can learn the eigenvalues of a quantum state with fewer copies than the $Θ(d^2)$ needed to run full state tomography. This is the first improvement to spectrum estimation over the influential Keyl-Werner algorithm, which uses $n = Θ(d^2)$ copies, thereby resolving a question raised by Keyl and Werner in 2001 and refuting a 2016 conjecture of Wright. Our main technical tool is a new tomography guarantee, where the error of tomography in a particular direction $|w\rangle$ scales with $\langle w | ρ|w\rangle$ for all directions simultaneously. From this stronger "relative-error" bound, we recover better algorithms for principal component analysis in Bures distance and tomography in $χ^2$-divergence as corollaries.

We provide a short proof of a Ky Fan-type majorization relation for the singular values of a sum of binary tensor products of matrices. This generalizes Alhejji's result (arXiv:2410.18254) from two summands to arbitrary sums and from positive matrices to arbitrary matrices. As an application, we show a majorization relation between the singular values of a completely positive map and those of its Kraus operators.

High-fidelity quantum control relies on accurate models of driven dynamics. We examine this re- quirement for single-qubit gates in superconducting transmons by comparing control pulses derived from the standard Duffing approximation and from a Hamiltonian constructed by diagonalizing the transmon eigenbasis. Using the same correction-pulse construction for both models, we show that correction fields derived from the Duffing approximation can substantially reduce the gate error pre- dicted by that model while remaining less effective when combined with an independently calibrated baseline pulse in the diagonalized-transmon model. In the fast-gate regime, such transferred correc- tions can even fail to improve over the uncorrected diagonalized-transmon baseline. We show that small model-dependent differences in both the energy spectrum and the representation of the drive operator can compound during driven evolution, resulting in different predicted error generators and correction pulses. A mismatch in the accumulated AC Stark phase provides one illustrative di- agnostic of this dynamical model dependence. We further demonstrate that the model Hamiltonian informs the choice of control framework: Omitting relevant leakage pathways or higher-order error channels can lead to an overly restricted correction strategy. Including these channels motivates an extended correction framework that improves the gate performance using the same physical control resources.

Native multi-qubit gates could reduce the overhead associated with decompositions into single- and two-qubit operations, but whether they can simultaneously provide high fidelity, simple control and robustness against parasitic interactions in scalable architectures remains unclear. Here we experimentally realize a 65-ns native controlled-controlled-phase operation, locally equivalent to the Toffoli gate, with a fidelity of 99.39(5)% in a three-qubit processor unit based on fluxonium qubits coupled via a microwave-driven transmon coupler. The implemented operation would require CZ fidelities of approximately 99.94% if realized through a conventional decomposition. The gate is implemented with a single control pulse, that relies on a simple calibration procedure yielding coherence-limited performance. This processor unit naturally extends to scalable two-dimensional layouts with low parasitic interactions. Altogether, these results establish native multi-qubit gates as a viable hardware-efficient primitive for scalable superconducting quantum processors.

We present an exact amplitude simulator for Clifford+T quantum circuits that combines a Feynman path sum across a balanced qubit bipartition with stabilizer-frame simulation on each half. The construction extends prior stabilizer-based Schrödinger-Feynman methods in three directions: recursive multilevel bipartition into a binary tree, automatic fallback to dense state-vector simulation when a leaf's stabilizer frame would exceed its memory ceiling, and a cost-model-driven partition selector that replaces the standard cut-count minimization heuristic. We show cut-count minimization is an unreliable proxy in practice: a globally cleaner partition can reduce cross-cut count yet increase wall-clock time, because it imbalances T-gate density across halves and inflates per-half stabilizer-frame size. Our cost model substitutes the stabilizer-frame bound 2w for the dense 2n ceiling per side and explicitly models per-amplitude readout cost; isolating that term uncovered a quadratic-asymptotic inefficiency in the leaf simulator's end-of-path amplitude extraction, fixed by replacing it with an existing O(F * s * n) single-amplitude inner product. On a structured hierarchical n=16 benchmark the recursive simulator beats monolithic stabilizer-frame simulation by 92x to 17,645x, wins by 79x per path against a dense half-state-vector baseline under an identical cut, and beats a production state-vector simulator end to end by up to 47.9x (median ~5x). On adversarial random Clifford+T circuits the dense state vector wins past a crossover near n/2 cross-cut gates -- the regime the cost model identifies. The dominant cost, the cross-cut Feynman sum, is embarrassingly parallel with constant inter-worker communication, unlike recent matrix-product-state stabilizer-tensor methods whose inner contraction loop is sequential.

Singlet-triplet qubits offer an attractive encoding for semiconductor quantum computing, combining ancilla-free readout, reduced sensitivity to common-mode noise, and baseband voltage control. However, the Zeeman energy difference $ΔE_\mathrm{Z}$ is typically fixed by local magnetic field gradients or $g$-factor inhomogeneities, leaving the exchange interaction $J$ as the only dynamically tunable parameter. This always-on $ΔE_\mathrm{Z}$ precludes orthogonal control of the qubit's rotation axes and introduces unwanted state rotations during idling. Here we demonstrate all-electrical orthogonal control of a degenerate singlet-triplet (DST) qubit formed by two hole spins in a germanium double quantum dot. Exploiting the electrically tunable anisotropic $g$-factors of the two spins, we identify a regime where both $ΔE_\mathrm{Z}$ and $J$ vanish, making the $S$ and $T_0$ states degenerate at the idle point. By applying only baseband voltage pulses, we independently control both $J$ and $ΔE_\mathrm{Z}$, enabling fully orthogonal $Z$- and $X$-axis rotations. Randomized benchmarking yields an average physical single-qubit gate fidelity of 99.53\% for a gate duration of approximately 100 ns. Finally, we electrically tune the degenerate point across a wide range of magnetic field orientations, enabling operation in a regime of enhanced coherence time and offering a route towards multi-qubit scaling under a shared global magnetic field.

Simulating an open quantum system on a digital quantum computer often involves the use of Trotter-Suzuki (TS) Product Formulas (PF) to approximate the system's time evolution. Precise estimates for the required number of Trotter steps (and hence the overall gate count) can be crucial for minimising the computational cost of these methods. Building on established theoretical guarantees, we derive analytic bounds for the First- and Second-Order Deterministic and Randomised TS-PF, directly relating the number of Trotter steps to the model parameters, evolution time and precision. These bounds enable concrete resource estimation for each method. We then present a computationally efficient classical algorithm that uses diamond norm estimates of individual Liouvillian terms and a binary search to significantly reduce the Trotter steps required for a target precision. Our numerical results on two prototypical models - an XX-Spin Chain with boundary driving and local dephasing, and a Transverse-Field Ising Model - show that the theoretical (analytic) bounds are often overly conservative, whereas the empirical (optimised) bounds yield a significantly smaller number of Trotter steps for the same precision. Among the methods investigated, the Second-Order Randomised TS-PF typically achieves the lowest resource demands, especially for larger systems. These findings emphasise the significance of empirical bounding strategies in achieving more resource-efficient simulations of Markovian open quantum systems.

We use Diagonal Adaptive Non-local Observables (DANO) as a canonical decomposition for studying Variational Quantum Circuit model evolution. Separating each learned observable into a diagonal spectrum and a unitary basis gives a quasi-polar description: the spectral weights are viewed as radial coordinates, while the unitary circuit serves as angular coordinates through Lie group identifications. This turns the training process into a trajectory in spectral and Lie-algebra space. Experiments on two classification tasks show that DANO radial spectral expansion correlates with accuracy. DANO angle coordinates reveal a dominant accuracy-correlated component. The framework provides a different perspective to characterize quantum model behavior.

Temporal interference patterns can be detected with stroboscopic monitoring that treats the back action of measurements and the unitary dynamics. Previous work established that the mean detected recurrence time is integer-quantized and given by a topological invariant, a winding number $w$. When measurement periods are at resonance with the system's timescales, the winding number can abruptly change. We focus on a generic quantum system and the transition $w\to w-2$, signified by the creation of two dark states in Hilbert space, whose corresponding modes are responsible for the interference pattern. Close to the transition an extremely slow decay of the amplitude of first detection is found, superimposed by oscillations, in contrast to the monotonically exponential decay close to the case $w\to w-1$. We show how these oscillations are obtained from the symmetry of the system and find the conditions for optimal observations of the phenomenon.

Understanding the boundaries between quantum thermalization and localization in many-body systems remains a central frontier of condensed matter and quantum information science. In this work, we investigate the dynamics and spectral properties of a generic model with long-range three-body-interaction, namely, a system with non-local three-wave-mixing. This model has been realized recently with a microwave Fabry-Perot cavity terminated on one end by a superconducting qubit mirror. Utilizing exact diagonalization techniques, we uncover a striking paradox: the global energy level spacing statistics show integrability, even though all dynamic observables and inverse participation ratios of the eigenstates indicate ergodicity and delocalization. We show that this behavior is a hallmark of strong Hilbert space fragmentation driven by kinematic constraints rather than an explicit global symmetry. Inside these sectors, dynamics scramble rapidly, as evidenced by the out-of-time-ordered correlator (OTOC), while global transport is heavily bottlenecked, resulting in a logarithmic relaxation to equilibrium. This picture is further confirmed by fluctuations in eigenstate entanglement entropy at the same energy. Finally, we demonstrate that the late time OTOC average scales with system size, providing a distinct experimentally accessible signature of the underlying three-body kinetic bottlenecks.

We propose and analyze a novel quantum random-number generator based on a tripartite quantum system in which two subsystems act as detectors. Within a quantum non-demolition measurement scheme, one detector is used to certify the presence of genuine quantum effects in the system's evolution, while the second generates random numbers from a distribution that can be optimized to maximize their entropy. Using one two-level system and two three-level systems, we generate random numbers from a nearly uniform three-outcome distribution, yielding close-to-maximal entropy and therefore near-optimal randomness generation. A key feature of the protocol is that randomness generation and certification occur simultaneously. Moreover, certification does not rely on spacelike separation between detectors, removing a major constraint of device-independent approaches. This property enables practical implementation and facilitates the miniaturization of the device, making the protocol a promising candidate for scalable quantum technologies.

In this paper, we introduce a novel mixed-order Rényi divergence and investigate its fundamental properties. Using this divergence, we define a family of mixed-order order-two Rényi mutual information and Rényi conditional entropy. We derive exact reliability functions of quantum soft covering and privacy amplification under the sandwiched Rényi divergence with order $α\in[2,\infty)$. The former is jointly characterized by the sandwiched and mixed-order order-two Rényi mutual information quantities, while the latter is characterized by the corresponding conditional entropies. These results provide operational interpretations of the proposed mixed-order Rényi divergence. To the best of our knowledge, this is the first exact characterization of the reliability function for quantum soft covering.

We calculate the probabilities $p_{\{n\}}$ of the measured bitstrings $\{n\}$ for the vacuum of Rydberg ladders with $N_q$ atoms. As $N_q$ increases, the $p_{\{n\}}$ decrease but become more dense in the low $p$ region raising the possibility that their smallness could be compensated by their large number. The importance of the low probability states can be estimated from the cumulative probability distribution $Σ(p_Λ,N_q)$, which is the probability to observe any state having a probability $p\leq p_Λ$. For not too large values of $p_Λ$, it is possible to approximately collapse the $Σ(p_Λ,N_q)$ for successive $N_q$ into a function resembling the Fermi function when plotted as a function of $-\ln(p_Λ)$. We show that the number of shots necessary to reduce $Σ(p_Λ,N_q)$ to some low enough value grows exponentially with $N_q$. We discuss the implications for calculating observables associated with the vacuum.

Predictive simulations of catalytic interfaces require correlated electronic-structure treatments that describe localized chemical transformations while retaining the influence of the extended metallic environment. We introduce QC-DFET, a quantum-computing density-functional embedding framework that maps surface-reaction active spaces to compact, environment-aware qubit Hamiltonians. A reaction-consistent active-space protocol preserves orbital continuity along reaction coordinates, while quantum-selected configuration interaction based on measurements from the Zuchongzhi superconducting quantum processor and strongly contracted perturbation theory capture static and dynamic correlation. On Cu(111), QC-DFET treats active spaces up to 28 qubits and is validated through a hierarchy of experimentally constrained surface-chemistry challenges. H2 dissociation/desorption tests balanced bond breaking and recombination barriers, CO adsorption tests site selectivity and metal-adsorbate bonding, and formate hydrogenation tests competing hydrogenation branches with different kinetic and thermodynamic signatures. Across these cases, QC-DFET reproduces bidirectional H2 barriers, recovers the observed top-site preference and adsorption strength of CO, and reconciles the experimentally benchmarked H2COO* reverse barrier with the lower forward barrier to HCOOH*. These results establish embedded quantum computing as a practical route to correlated surface-reaction energetics.

Conditioning on both past and future assigns intermediate-time properties a causal observer does not; these time-symmetric assignments obey exact symmetry theorems and are measurable from trajectories. We use two-state generator extended dynamic mode decomposition (gEDMD): because weak values obey $dA_w/dt=i\langle[H,A]\rangle_w$ exactly, generator extraction, with an exact-derivative baseline, applies unchanged to them. First, a reflection involution on the pre-/post-selected ensemble splits every window-fitted friction uniquely as $γ_{fwd}=γ_A+γ_S$: $γ_A$, antisymmetric about the midpoint, carries the modes' boundary-condition physics; $γ_S$, symmetric, comes from the differencing scheme; both follow from the same data as $(γ_{fwd}\pmγ_{bwd})/2$. At a fixed inference resolution the arrow of time has two layers: the coherent-mode arrow reverses at the midpoint, the fluctuation-level one does not, $γ_S$ dominating $γ_A$ at every size and class. The difference is one of degree: $γ_S$ is 34 times larger there than at the mode layer, and with the exact derivative both layers reverse: immunity belongs to the inference, not the ensemble. Second, in a lattice interferometer conditioned only at its ports, the quantum Cheshire-cat structure emerges unimposed: particle and polarization obey separate continuity equations, and a local field in the polarization-carrying arm rotates that phase alone, at exactly twice the field strength, entering the generator as a rigid imaginary shift, while the particle's weak density stays invariant to machine precision. We verify the sample-level identity and the two layers from $2^8$ to $2^{20}$ dimensions: $|γ_A|/γ_S=0.09$ to $0.27$ across five classes; self-averaging makes it insensitive to class among those sharing a boundary modulation, removing the $2^{-N/2}$ overlap obstruction for $N$ qubits.

Arrays of circular Rydberg atoms provide a promising platform for quantum simulation and computation; however, their preparation in the presence of interatomic interactions remains a major challenge. While optimal control methods have enabled the design of fast and accurate radio-frequency pulses for the circularization of a single atom and of an atom pair, the extension to more atoms is fundamentally limited by the exponential growth of the Hilbert space, which renders numerical simulations computationally infeasible. Here, we introduce an effective model that treats interactions within a mean-field approximation, thereby enabling the simulation of large atomic systems. Our model further enables the adaptation of pulses optimized for non-interacting atoms to interacting systems, based on the computation of a single time evolution. For two interacting $^{87}\mathrm{Rb}$ atoms, we demonstrate that the error of our method remains below $1 \, \%$ and that our adapted pulses recover the initial performance of optimal pulses in the regime of weak to moderate interaction strengths.

In this study, we investigate as-grown InAsP/InP quantum dots emitting in the third telecommunication window under detuned quasi-resonant excitation. A large excitation-emission detuning of 32 meV enables efficient suppression of scattered laser light while retaining several advantages of near-resonant excitation. The single-photon nature of the emission is confirmed by a Hanbury Brown and Twiss experiment, yielding a raw second-order autocorrelation value of $g_{\mathrm{raw}}^{(2)}(0)=0.076(6)$. Hong-Ou-Mandel measurement is used to determine the degree of indistinguishability of single photons and reveal as measured visibilities of $V=0.094(4)$ and $V=0.106(5)$ for excitation pulse separations of 13.1 ns and 5.3 ns, respectively. These results demonstrate the potential of as-grown InAsP/InP quantum dots grown via molecular beam epitaxy under not experimentally demanding detuned excitation for generating indistinguishable telecom single photons. Further improvements are to be achieved through Purcell enhancement in optical cavities.

We propose a sparse computational-basis encoding of voxelized molecular geometries that converts molecular reconstruction from full-state tomography into support recovery by computational-basis sampling. To realize the encoding scheme, the molecular space is discretized into a 3D grid, and each atom's position and chemical species is mapped to a single computational basis state. This discretization introduces spatial quantization at the voxel-resolution scale. The molecule is then encoded as an equal superposition over this sparse set of occupied states, where we assume that a suitable state preparation method exists. In contrast to full state tomography, which requires on the order of $\mathcal{O}(3^n \times 10^{2\text{--}3})$ measurement shots, where $n$ is the number of qubits, our proposed encoding scheme reduces to a coupon-collector sampling problem in the computational basis. Complete recovery of an $A$-atom molecule requires $\mathcal{O}(A\log A)$ shots on noise-free hardware. On noisy hardware, the required number of shots increases. We demonstrate the method on the 156-qubit IBM Kingston device using 8-qubit circuits to reconstruct the discretized geometry of a 10-atom ethylamine molecule with high mean reconstruction recall using only $\mathcal{O}(10^2)$ shots despite substantial hardware noise. These results demonstrate that our proposed encoding scheme is a practical, readout-efficient representation for molecular geometries on near-term devices.

The quantum Fisher information (QFI) of the vacuum of three quantum field theories is evaluated with respect to the mass parameter of each theory. All field theories are considered on a $(d+1)$-dimensional Euclidean spacetime. We consider the Klein-Gordon field, a quartic interaction ($φ^4$) field theory, and the free Dirac field. In the case of the quartic interaction theory, the QFI is given perturbatively to first order in the interaction constant. For the free KG case, we find a $m^{d-2}$ dependence of the QFI, and thus no dependence for $d=2$, in agreement with the holographic duality characterizing the theory. The introduction of a quartic interaction is shown to lead to a QFI divergence in $d=3$ and to reduce the available information in the $d=0$ system. The vacuum QFI with respect to the free Dirac field mass is shown to be UV-divergent for $d=2$ and $d=3$, mass-dependent for $d=1$, and zero for $d=0$.

The coexistence of quantum and classical signals in the same optical fiber is a critical challenge for the deployment of quantum networks. Indeed, selecting an optimal channel for quantum signal transmission is crucial to minimize noise arising from co-propagating classical signals. This work experimentally investigates spontaneous Raman scattering (SpRS), a major source of noise in signals transmitted along the same fiber. Unlike most previous studies relying on narrow-linewidth laboratory lasers or architectures based on spatial or temporal multiplexing of quantum and classical signals, we employ commercial SFP optical transceivers and standard single-core single-mode fiber for the transmission of quantum and classical signals in the same fiber, reflecting conditions typical of deployed urban fiber infrastructures. Building on these measurements, we derive a compact and predictive model that captures the Raman scattering profile, enabling accurate estimation of SpRS noise as a function of source power, wavelength, and fiber length. A key outcome of this work is that the proposed model is independent of the specific optical source used, demonstrating its generality and robustness. The model can therefore be used for the identification of optimal C-band channels for quantum signal allocation, namely those least affected by SpRS noise generated by co-propagating O-band classical traffic. These results pave the way for a parameter-robust description of Raman scattering applicable to diverse fiber-based systems.

Structural asymmetry combined with optical nonlinearity often leads to nonreciprocal light transport. We explore the mechanism by which 1-photon interference effects can revive reciprocity in such nonlinear models. To this end, we study correlated 2-photon scattering where an artificial atom is asymmetrically (a) side-coupled to an infinite waveguide at two spatially separated points, and (b) direct-coupled to two semi-infinite waveguides. The setup (a) gives robust reciprocal transport for the two photons. However, the setup (b) shows a transition from a nonreciprocal to a reciprocal regime by tuning the interference effect via an additional tunneling path for photons between the two waveguides.

We construct a pressure-consistent operator-and-readout interface for Born, adjoint, and Gauss--Newton actions in constant-density acoustic full-waveform inversion (FWI) using Schrödingerised propagation. The energy variables $π=c^{-1}\partial_t u$ and $q=\nabla u$ yield an auxiliary-space Hamiltonian, while physical pressure $p=cπ$ depends explicitly on wavespeed. Its derivative $D(cπ)[c_0](δc)=c_0δπ+δc\,π_0$ combines propagated wavefield sensitivity with a direct receiver-calibration term. Duhamel and receiver-row differentiation retain both contributions in the Born map, its adjoint, and the Gauss--Newton normal action. We prove a conditional consistency estimate with a periodic second-order finite-difference specialization and give a resource model for state preparation, normalization, quadrature, and selected-output measurement. A compiled nine-qubit instance realizes structured preparation, product-formula propagation, a derivative-LCU block, and calibrated pressure-overlap measurements. Bernoulli samples from ideal-circuit probabilities drive a four-parameter hybrid inversion. A two-qubit VQLS circuit represents the normalized update direction, while normal-system assembly, line search, and model refresh remain classical. Finite differences, tangent and reverse-adjoint recurrences, autodiff JVP/VJP evaluations, and explicit Jacobians verify the discrete Born, adjoint, and normal actions. Smooth periodic refinement confirms second-order convergence, whereas omitting receiver calibration leaves an order-one Born error and substantially changes the regularized Gauss--Newton direction. All ten predeclared finite-shot runs reduce the initial model error. These results specify the physical-pressure derivative and selected-output measurements needed to connect Schrödingerised propagation to a local FWI update.

The open-loop optimization of quantum dynamics using gradient-based quantum optimal control methods involves calculating the time-ordered propagator and its gradient. In this Letter, we present a unifying framework for gradient-based quantum optimal control with respect to any general pulse parameterization by deriving the formal solution from first principles. For the case of unitary propagators, we derive a series expansion involving time-independent commutators and time-dependent coefficients, significantly reducing the number of matrix exponentials needed to compute the gradient. The expansion highlights the connection between derivatives of the propagator and operator evolution in the Heisenberg picture. The method is particularly suited for simulating optimal control tasks in quantum systems with local interactions, which is a common situation in large multi-qubit platforms. We compare the computational cost required for the series with the Gradient Optimization of Analytic conTrols (GOAT) method, and, focusing on the problem of preparation of a GHZ state, demonstrate more than an order of magnitude speedup for a qubit ladder and a chain geometry.

The coherent one-way (COW) protocol is a quantum key distribution scheme that has attracted significant attention, leading to the development and commercialization of practical implementations. Despite this progress, the security of the COW protocol has remained a fundamental challenge since its introduction. Numerous studies have investigated its security, and several security proofs have been proposed over the years. More recently, a number of works have questioned the security of this protocol. In particular, one of the latest studies introduced an attack that severely limits the security of COW-QKD and reported a maximum secure distance of less than 20km. In this work, we introduce minimal alteration to the COW protocol that can enhance its security. Specifically, instead of monitoring the coherence between successive pulses, we propose to monitor quantum correlations through the violation of Bell inequalities. This approach enables the detection of a broader class of potential attacks. Our simulation results indicate that, by employing this method, the maximum secure distance of the protocol can be extended to approximately 259km.

Many security proofs for quantum key distribution (QKD) require Bob's measurement to have a tensor-product structure across protocol rounds, with some techniques requiring the stronger independent-and-identically-distributed (IID) condition. Time-bin encoded protocols often rely on interferometers whose detector outcomes depend on the interference between optical modes from neighbouring rounds, obstructing the direct application of such proofs. We show that classical post-processing of Bob's measurement data --- specifically, discarding the outcomes of detectors sensitive to inter-round coherence --- is sufficient to recover a product measurement positive operator-valued measure (POVM) (which is IID when the same single-round setup is used in every round). Applied to the Mach-Zehnder interferometer and the IID variant of the COW detection setup, this removes the need for the additional vacuum pulse introduced in prior analyses to establish tensor product structure of the measurement POVM, recovering better key rates without placing any restriction on Eve's attack.

We demonstrate an end-to-end hybrid quantum-classical optimisation framework based on Benders decomposition, capable of solving mixed-integer linear programming (MILP) problems. The framework builds on a previously presented hybrid quantum-classical end-to-end pipeline based on Multiple Cuts via Multiple Solutions (MCMS) Benders decomposition where the cut selection step was performed on quantum annealing hardware. We extend this with gate-based QAOA implementations for both tensor network emulators and superconducting quantum hardware. The Vehicle Routing Problem (VRP) is used as a representative case study and we run the pipeline end-to-end on 10 permutations of a standardised benchmarking instance (20 customers and 4 vehicles from QOptLib) with a classical solver performing the cut selection step. We find that for our instances, only a small fraction of the compute in classical MCMS Benders decomposition is spent on the cut selection step. For a full hybrid end-to-end assessment, we run the pipeline for a toy problem with MPS-JuliQAOA, a powerful tensor network emulator, to execute QAOA. Here, the majority of the time is spent on the cut selection step, deeming quantum advantage of this framework unlikely at problems of this size. This highlights the need for more large-scale benchmarking research when more powerful (QPU) QUBO solvers are available.

This thesis explores the role of modes, states, and symmetries in quantum optics, within the context of quantum information and quantum metrology. It proposes a unified framework to analyze how the modal structure of photonic fields, the statistical nature of states, and their symmetry properties determine the physical resources that can be exploited for quantum information processing and quantum parameter estimation. A first line of investigation develops a description of time-frequency degrees of freedom as continuous quantum variables, highlighting their richness for encoding and manipulating information. A second axis studies entanglement and collective variables, clarifying the link between physical resources and metrological gains, particularly in reaching ultimate precision limits. Interferometric scenarios of the Hong-Ou-Mandel type are then analyzed, and a general formalism centered on the notion of symmetry is developed. This framework enables the analysis of a broad range of situations and leads to several generalizations. Finally, the thesis examines the symmetries imposed by optical superselection rules and their consequences for the structure of quantum states and their operational performance, with the aim of providing a deeper understanding of the foundations of quantum optics.

Randomized compiling (RC) is the standard technique for converting coherent (systematic) gate errors into stochastic noise. The prevailing view is that the twirl destroys coherent-error information. An exact Fisher-information conservation law shows the opposite: the coherent-error information RC removes from the averaged output is preserved in full in the twirl labels -- the per-shot random gate choices that standard RC discards. Retaining the labels and forming a label-outcome correlation recovers the coherent error parameters at the quantum Fisher-information limit, unbiased under all standard incoherent channels, at zero additional circuit cost. Two theorems are proved, the conservation law is verified to machine precision across 12 circuit families, and recovery is confirmed on a 127-qubit IBM Quantum processor (ibm_marrakesh). The labeled estimator recovers injected coherent phases to within 0.0063 rad of the true value across all depths tested, while the standard marginal estimator returns near-zero signal at every depth.

We propose a rapid adiabatic passage (RAP) scheme based on level-crossing-free pulses for deterministic generation of multiqubit entangled states in Rydberg atom systems. Unlike conventional RAP protocols that rely on level crossings, our approach uses an antisymmetric Rabi frequency and an even-symmetric detuning, enabling robust population transfer without passing through any level crossing. By exploiting the Rydberg blockade effect, the protocol prepares entangled states directly from an initial product state. Specifically, two sequential RAP pulses separated by a pi_g pulse generate two-qubit Bell states, three-qubit W states, four-qubit GHZ states, and six-qubit honeycomb W states. Numerical simulations show that the fidelities exceed 0.9997 for the Bell and three-qubit W states, reach 0.997 for the four-qubit GHZ state, and surpass 0.9995 for the six-qubit honeycomb W state. The scheme demonstrates excellent robustness against pulse parameter fluctuations, with fidelities remaining above 0.99 under +/-5% parameter variations. This work provides a simple, efficient, and robust method for entangled-state preparation in neutral-atom quantum information processing.

Spins in condensed matter, especially well-isolated nuclear spins, offer attractive quantum degrees of freedom for computing, sensing, and networking because of their long coherence times. The possibility of electric-field control is an important feature for practical scalable quantum technologies, but, typically, nuclear spins couple only weakly to electric fields in conventional semiconductor hosts, limiting operation efficiency. Here we show that a choice of a highly polarizable oxide host can overcome this bottleneck. In Mn2+ doped ZnO, electric-field modulation of the spin Hamiltonian is amplified by hyperfine-coupled electron spins, and offers efficient electric-field manipulation of an I = 5/2 nuclear spin qudit, in a manner analogous to the hyperfine enhancement of conventional nuclear magnetic resonance. We demonstrate both resonant and non-resonant coherent manipulation using a single uniaxial electric field applied along the crystalline c-axis, the polarization axis of ZnO. This approach allows universal single-qudit gate operations with efficiencies comparable to or exceeding those of conventional magnetic-field driving. These results support the deployment of doped oxides as active host materials for electrically controllable spin qubits, highlighting the importance of materials design in developing scalable quantum technologies.

Quantum generative modelling casts sampling as a generative task: a parametrised quantum circuit is trained such that sampling reproduces a target probability distribution. Instantaneous Quantum Polynomial-time (IQP) circuits combine structural simplicity with complexity-theoretic evidence for quantum advantage. Yet their practical value depends not only on expressivity, but on how efficiently they consume genuinely quantum resources. We study this question through the lens of magic, or non-stabiliserness, as a resource for quantum generative modelling. We show that established fidelity- and geodesic-based notions of computational progress in a projective Hilbert space are ill-suited to generative models, since operational performance is determined by output probability distributions rather than quantum states themselves. We evaluate magic-consumption directly on the probability simplex, using changes in Jensen-Shannon divergence to quantify progress. Applying this framework to trained random γ-sparse IQP circuits shows signatures of efficient magic use, with the dominant contribution arising from two-qubit gates. As IQP circuits produce remarkably low intermediate magic relative to phase-randomised states with the same sampling distributions, this renders IQP-based quantum generative models as promising candidates for resource-efficient demonstrations of quantum advantage on early fault-tolerant architectures.

We investigate microscopic mechanisms underlying decoherence-induced transitions between topologically ordered states. As a first case study, we analyze the color code using topological entanglement negativity (TEN) and a disorder parameter associated with 1-form symmetry. We interpret these quantities as first- and zeroth-dimensional simplicial homological objects, respectively, and show that the transition can be understood in terms of decoherence percolation. To resolve its local structure, we introduce quasi-local TEN (QLTEN), which visualizes the spatial distribution of local topological properties and the growth of decohered regions. We further introduce explosive percolation (EP), corresponding here to biased decoherence that suppresses the formation of large decohered clusters. As a second case study, we consider the toric code on a triangular lattice under external-field-type decoherence. Numerical results show that QLTEN faithfully captures the emergence of Higgs regions and the survival of logical qubits. Although global TEN, QLTEN clusters, and string operators are strongly correlated in both models, the color code and toric code respond differently to EP patterns. This difference indicates that a universal microscopic description of decoherence-induced topological phase transitions remains challenging even for closely related systems.

Relational quantum causal processes formulate finite operational contexts as normal positive functionals on local completely positive maps. Response differences generate an influence algebra, and its central projections define jointly readable Boolean events. We develop this starting point through a sequence of exact and controlled models. Fresh-environment unitary collision circuits produce dephasing-exchange kinetics with an exact charge-center fixed algebra, a uniform finite-step limit at fixed response order, and graph-controlled metastable Markov dynamics. An absorbing-state model exhibits a sharp transition between non-Abelian quantum memory and Boolean records. A reversal-covariant defect dynamics generates a locally finite partial order on a restricted graph family without assuming a Lyapunov time. Conditional on a certified order, a positive additive record measure, compactness, and identifiability, we prove subsequential convergence to a Lorentzian metric-measure space, finite reconstruction bounds, and uniqueness of admissible smooth limits. Complementary finite regulators provide controlled tests of modular-to-boost response, null tomography, same-update variational identities, induced quadratic gravity, and compatible common-refinement limits. These results are exact or controlled within their stated models, but they do not yet constitute a single background-independent microscopic law that jointly generates adjacency, time, volume normalization, dimension, signature, nonlinear Einstein constraints, and quantum matter. We therefore present RQCP-QG as a theorem-indexed framework that separates established mechanisms, conditional compositions, and open assumptions.

We propose a novel approach to numerically derive approximate reduced dynamical models for Markovian quantum open systems without perturbative iterations, projecting the evolution to the subspace associated to their slowest degrees of freedom. The two algorithms we develop are based on Oja's continuous-time principal component flow: the first returns the optimal reduction to the slowest decaying operator-subspace, and is extended to time-dependent dynamics, while the second one is designed to reduce the dynamics on a subspace of the system's Hilbert space, and thus preserve conditional complete positivity. The methods represent a non-perturbative alternative to well-established Adiabatic Elimination (AE) methods, and the second can be used to find noise-protected subspace codes for quantum information processing. Both are tested on a paradigmatic central spin model.

Using a non-perturbative quantum kinetic framework, we develop a unified description of the far-from-equilibrium dynamics of three-dimensional Bose gases following cooling quenches across the Bose-Einstein condensation transition. By tracking the spatio-temporal evolution of the momentum distribution, we show that the equilibrium condensation threshold simultaneously acts as a dynamical critical point, separating distinct far-from-equilibrium universality classes governed by different non-equilibrium attractors. While quenches above the transition exhibit a single-timescale relaxation toward a thermal fixed point, quenches below the transition display a crossover from a transient weak-turbulence regime to a coarsening fixed point governed by the diffusive recombination of vortex lines. Quenches directly to the condensation threshold, finally, are controlled by a previously unidentified critical fixed point characterized by the superdiffusive spreading of critical fluctuations and a distinct set of dynamical exponents. Together, these dynamical scaling laws establish a far-from-equilibrium counterpart of the condensation phase transition, in which the equilibrium critical point also organizes the long-time non-equilibrium dynamics.

Quantum Noise Stream Cipher (QNSC) has emerged as a physical-layer encryption technique that exploits quantum noise and non-orthogonal coherent-state modulation to secure optical communication. However, the security of QNSC relies exceedingly on the secrecy and freshness of its seed key. Quantum Key Distribution (QKD), on the other hand, provides information-theoretically secure key exchange rooted in the laws of quantum mechanics. The convergence of these two paradigms, i.e., integrated QKD-QNSC architectures, offers a compelling solution to each of their limitations. In such integrated systems, QKD continuously supplies and refreshes the secret seed key that governs QNSC modulation. Thus, governing a unified security framework that couples provably secure key establishment with high-speed quantum-enhanced physical-layer encryption. This work presents a comprehensive review of QNSC systems, examining their operating principles, security models under various attacks, and their integration with QKD systems. We analyze the security interplay between the key generation and encryption layers and survey experimental demonstrations and architectural progress toward practical deployment. Furthermore, we identify the open challenges and future research directions that must be addressed to realize fully integrated, quantum-secured optical communication networks at a practical scale.

Erasures are more favorable for quantum sensing than unflagged errors such as Pauli errors. However, realistic sensing noise does not usually appear as erasures; it often acts within the same sensing Hilbert space as the signal, making it difficult to identify and mitigate. For such noise, we establish a noise-model-agnostic necessary and sufficient condition for erasure conversion, identifying the noise components that can be converted into erasures and removed without damaging the signal. For components satisfying the condition, conversion can be realized by a passive dimension-lifted scheme requiring neither detailed noise knowledge nor active control. Theoretically, the protocol remains effective over a broad range of noise strengths and approaches the corresponding precision limit. Experimentally, in single-photon phase sensing, we recover standard-quantum-limit precision in a Pauli-noise channel with erasure-convertible weight 0.5, using orbital angular momentum as the ancilla. These results provide a practical route to robust quantum sensing under realistic noise.

Generating high-speed, verifiable random numbers is a fundamental requirement for cryptography, large-scale stochastic simulations, and secure quantum communication. Here, we present a robust quantum random number generator that utilizes the spatial distribution of quantum fluctuations captured by an electron-multiplying charge-coupled device operated in high-speed kinetic mode. Through rigorous detector calibration and shot-noise analysis, we characterize the spatial quantum noise obtained from the spatial intensity fluctuations of the coherent states of light. Such quantum noise serves as a high-entropy source, enabling an instantaneous random bit generation rate of 5.92 Gbps without algorithmic randomness extraction in the present configuration. The sustained output rate is, however, limited to 7.5 Mbps by the bandwidth of the serial electronic readout. The generated sequences successfully pass the NIST SP 800-22 and Marsaglia Diehard statistical test suites, confirming the high quality and unpredictability of the entropy source.

Phase-space approaches such as the truncated Wigner approximation (TWA) provide an efficient semiclassical framework for performing approximate simulations of the dynamics of open quantum many-body systems outside the reach of exact numerical methods but beyond the mean-field level. For bosonic systems, TWA is known to be equivalent to a Keldysh path-integral formulation truncated at second order in the so-called quantum fluctuations. This semiclassical approach provides an alternative transparent route towards approximate stochastic equations of motion, which can be efficiently solved. Here we establish the corresponding path-integral formulation for interacting open spin-$1/2$ systems using the continuous $\mathrm{SU}(2)$ phase space. We show, in particular, that a consistent treatment of dissipation requires correctly mapping operator products onto the curved spin phase space, leading to stochastic equations that coincide with those obtained from the continuous TWA formulation and thus reproduce the exact dynamics of a single dissipative spin. Our results provide a unified field-theoretic foundation for the TWA to dissipative spin dynamics and offer a systematic starting point for extensions beyond the semiclassical approximation.

A nonempty subfamily of a $k$-uniform hypergraph is an \emph{even cover} if every vertex lies in an even number of its hyperedges; for $k=2$ these are edge-disjoint unions of cycles, so the minimum size of an even cover is the natural hypergraph analogue of girth. We prove Feige's 2008 conjecture on the hypergraph Moore bound: there are absolute constants $A$ and $C$ (independent of $k$) such that for every $k\ge3$ and every $1\le\ell\le n$, any $k$-uniform hypergraph on $n$ vertices with more than $C\,n^{k/2}/\ell^{k/2-1}$ hyperedges contains an even cover of size at most $A\,\ell\log(en/\ell)$. Our proof is based on sharp spectral bounds for Kikuchi matrices, which we expect to be of independent interest; we apply them to the refutation of random constraint satisfaction problems in a companion paper.

The dynamics of a nuclear spin bath generates magnetic noise that is a key contributor to the decoherence of electron spin qubits in electrostatically-defined quantum dots. In this paper, we extend the cluster correlation expansion (CCE) technique, which has proven useful for predicting solid-state qubit coherence times across various settings but is limited to shorter time scales, to incorporate stochastic treatments of cluster dynamics in order to efficiently predict slow drifting Overhauser fields over longer time scales. This approach combines quantum evolution with classical rate matrices to enable simulation across a wide range of temporal regimes required to simulate, for example, the long-time convergence of the ergodic $T_2^*$ from Ramsey experiments. Our methodology is validated against experimental data from various silicon spin qubit systems, demonstrating a strong agreement between simulation and measurement of Ramsey experiments presented in the form of $T_2^*$ versus averaging time, autocorrelation functions, as well as power spectral densities. Furthermore, we demonstrate significant back-action effects through modeling and experiment; specifically, the dynamics of the nuclear spin bath depends upon the electron spin occupation schedule. Finally, our modeling quantitatively predicts the benefits from compensating for the slow drift of Overhauser fields in qubit operations. Our findings indicate that compensating for an Overhauser rotation measured $Δt$ in the past results in an effective $T_2^*$, which we denote $\tilde{T}_2^*(Δt)$ for clarity, under certain scenarios of interest, can be one or two orders of magnitude larger than the ergodic $T_2^*$ if the Overhauser rotation is re-characterized every 100 milliseconds; that is, $\tilde{T}_2^*(Δt = 100~{\rm ms})$ can be $10$ to $100$ times larger than $T_2^*$.

We introduce Krylov-space memory cores as stationary, depth-resolved structures that reveal how anomalous initial-state memory is organized inside the Krylov space of otherwise thermalizing nonintegrable systems. The stationary occupation profile identifies where late-time probability is concentrated along the Krylov chain, while complementary diagnostics of residual equilibration fluctuations, deviation from the Gibbs reference, and long-time Krylov-current fluctuations determine the physical character of that region. Across weak thermalization, confinement-induced anomalous dynamics, and many-body scarring, anomalous initial states develop compact low-depth memory cores that carry appreciable residual fluctuations, Gibbs mismatch, and persistent current-fluctuation activity. These cores are often embedded within substantially broader stationary occupation halos. Generic reference states, by contrast, do not exhibit a comparable combination of signal strength and spatial compactness. An auxiliary integrable comparison further shows that compact Krylov memory is state selective rather than a generic consequence of integrability. Krylov-space memory cores therefore provide a stationary framework for identifying where structured quantum memory resides and how it remains dynamically encoded.

The predictive success of quantum mechanics underpins many areas of modern science, even as the exact simulation of large, interacting quantum systems remains beyond the reach of classical computation. This success has been enabled by the remarkable advancement of scalable numerical approximation methods, which often demonstrate practical accuracy despite the absence of formal guarantees. As quantum simulation pushes into regimes where these approximations struggle, a fundamental challenge arises: How can quantum outcomes be trusted when reliable classical benchmarks are unavailable? Here, we establish a framework for the independent validation of quantum estimates in this setting and present evidence that they provide the most credible result among several considered methods, in the absence of an immediately accessible ground-truth solution. We apply our framework to the semi-scrambling dynamics of a physical model that strains several leading classical simulation methods yet remains experimentally accessible, in part through our introduction of the \textit{operator Loschmidt echo}. We systematically design a series of experiments using quantum heuristics that, taken together, test the underlying assumptions and provide strong confidence in the observable estimates obtained from the quantum computer. We then show how this framework can be extended to place accuracy bounds on quantum estimates via careful characterization and manipulation of the device noise, transforming the problem of validating the observable estimation to validating the noise model. These results establish a route towards trusted quantum computation for scientific discovery, independent of classical verification.

Influence matrices encode the action exerted on local subsystems by the rest of an extended quantum many-body system during their evolution. Thus, knowledge of the influence matrix facilitates computationally efficient simulations of local dynamics. Here we propose a new systematic approach to generating quantum circuits with complex dynamics for which the influence matrices can be written down exactly. In contrast to previous frameworks of this kind, such as dual-unitary circuits, the resulting influence matrices are non-Markovian, exhibiting nontrivial temporal correlations. We explicitly construct a broad family of circuits of this kind, based on dressing free-fermion (matchgate) circuits with appropriately chosen interaction terms. We show that, contrary to previous solvable instances, these circuits produce patterns of correlations that closely resemble that of typical many-body systems. Our approach can be directly interpreted in terms of an error correction scheme where the terms breaking the solvability of the influence matrices play the role of errors.

Absolutely maximally entangled states represent a highly constrained form of multipartite entanglement and play an important role in quantum information theory. We investigate a weaker form of uniformity of entanglement for four-party systems of local dimension $d>2$ that requires the three balanced bipartitions to have equal but not necessarily maximal linear entropy. We introduce a linear map $Ξ$ that enforces exact equality of entropies under reshuffling and partial transposition. The transformation arises as the asymptotic limit of an iterative averaging procedure and admits a group-theoretic description in terms of permutations of tensor indices. For Haar-random unitary inputs, a leading-moment analysis supported by numerical simulations predicts highly entangled outputs whose common entropy approaches the maximal value as the local dimension grows. We characterize the algebraic structure, fixed points, and asymptotic behavior of this map and its relation to two-unitary matrices and orthogonal Latin squares.

Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine their complexity-theoretic hardness with two capabilities needed for scalable quantum computing more generally: suppressing hardware errors, and verifying the quantum computation itself. Here we address both issues by introducing structured circuits, which, in addition to provable hardness guarantees, admit an encoding in a quantum code. This allows us to simultaneously reach high fidelities at high circuit depths, and to certify an experimental fidelity via the circuit structure and measurement of code syndromes. The resulting certificate is device dependent, but requires substantially weaker noise assumptions than existing fidelity proxy benchmarks. We demonstrate our proposal with a $70$-qubit, depth-$70$ Clifford circuit doped with $468$ $T$ gates. We use a total of $97$ physical qubits to encode this computation in spacetime codes, effectively suppressing gate error rates by $10\times$ after syndrome post-selection, and yielding a state with a fidelity lower bound of $0.284$ with $95\%$ confidence. Our construction is a systematic method for promoting a stabilizer state to a magic state while keeping an error-detected fidelity certificate.

We study the non-equilibrium dynamics of spinless fermions with dephasing noise in the framework of a many-particle Lindblad equation. Using a mapping to the exactly solvable one-dimensional Hubbard model with purely imaginary tunneling amplitude we analyze the Heisenberg-picture dynamics of operators quartic in fermions and determine their hydrodynamic projections. We construct the relevant diffusive eigenoperators explicitly and show that, in the quartic sector, they can be interpreted as interacting pairs of bilinear hydrodynamic modes. As a consequence, translationally invariant quartic operators generically exhibit non-vanishing diffusive late-time tails, unlike translationally invariant bilinears. Our results show that the hydrodynamic tails of microscopic operators cannot in general be inferred from symmetry constraints or coarse-grained fluctuating hydrodynamics alone; they also depend crucially on the spatial structure and effective size of the hydrodynamic eigenoperators.

We generalize the Abramsky--Brandenburger sheaf-theoretic treatment of contextuality by replacing probability distributions with distributions valued in a convex effect algebra \(A\). This yields a notion of \(A\)-valued measurement model encompassing probabilistic, deterministic, and quantum measurement structures within a single framework. States \(σ:A\to[0,1]\) induce ordinary empirical models, allowing observable behaviour to be viewed as arising from effect-valued measurement data. This leads to a distinction between internal contextuality of \(A\)-models and observable contextuality after state evaluation. We analyze the relationship between these notions and identify coherence conditions under which observable classical explanations assemble into internal ones. Using the ordered-vector-space representation of effect modules, we show that non-contextuality is characterized by feasibility of an associated cone program, generalizing the linear-programming formulation of contextuality in the probabilistic case. We also introduce an effect-valued contextual fraction and study its relation to observable contextuality witnesses. We show how cone duality leads to a notion of Bell witnesses for contextuality as a direct generalization of Bell inequalities. Finally, we analyze sharp realizability and uniform dilation for measurement models, clarifying the relationship between general POVMs and projective measurements, and show how resource-indexed effect structures induce graded monads generalizing the quantum monad.

Determining whether multiple record-conditioned quantum descriptions admit a single underlying process is a central consistency problem for quantum states over spacetime (QSOSTs) and relational quantum descriptions. Yet causally agnostic interferometry accesses only a lower-dimensional QSOST projection, which inevitably leaves some process degrees of freedom unresolved. We combine branch-resolved QSOST interferometry with positive-process lifting and semidefinite convex duality to characterize this gluing problem. We prove that every positive-weight QSOST branch has a unique least positive lift and reduce both settingwise and common-process realizability to deterministic-process domination. Using this criterion, we construct a minimal bipartite-qubit example with two record settings and two outcomes in the definite causal order $A\prec B$: each setting is separately realizable, and both share the same complete unconditional QSOST, yet no single deterministic process realizes them jointly. The separation has the exact visibility threshold $η=1/\sqrt{2}$ , admits a sparse witness involving eight interferometric quadratures, and persists for full-rank processes. These results establish an operational boundary between QSOST consistency and global process consistency, and provide a practical framework for testing whether multiple quantum perspectives can share one standard-quantum process.

Quantum error correction (QEC) is indispensable for scalable fault-tolerant quantum computing. However, discovering QEC codes that remain effective is challenging, as logical performance depends on the interplay between code structure, hardware, syndrome extraction, and decoding, which often impose competing requirements. Here we introduce OmniQEC, an efficient AI scientist for discovering QEC codes suited to deployment on modern quantum processors. OmniQEC formulates QEC design as an iterative discovery process in which an orchestrator, implemented by advanced large language models (LLMs), coordinates code generation, code-level screening, syndrome-extraction synthesis, and decoder-based circuit evaluation. At its core, OmniQEC combines a self-evolving reasoning mechanism with a slow--fast synergistic workflow: a fast loop explores candidates using inexpensive code-level proxies, whereas a slow loop performs physically grounded circuit-level evaluation and feeds the resulting evidence back into the search. We evaluate OmniQEC across four qLDPC construction families, three LLM backends, and $14$ total-physical-qubit budgets per backend. The discovered codes show steadily improving logical-error suppression with increasing physical-qubit budgets and outperform the BB codes with $[\![72,12,6]\!]$ and $[\![144,12,12]\!]$ under complete-implementation budgets of 98 and 240 physical qubits, respectively. The discovered codes are hardware-friendly and may be of independent interest for practical QEC implementation. These findings pave the way towards LLM-assisted QEC discovery grounded in physically informed code--circuit--decoder co-design.

Bound entanglement is an extreme irreversibility of quantum theory: certain states cost entanglement to create, yet no singlet can be distilled from them. Twenty-five years ago, Gisin and Wolf asked whether classical cryptography admits the same phenomenon. Are there correlations, shared by two parties and an eavesdropper, that cost secret bits to create although none can be extracted? We show that such bound information exists and give an explicit example, a distribution of two bits and a trit. The proof exploits a gap between two ways of comparing eavesdroppers: one can be better informed than another in every mutual-information comparison and nevertheless unable to simulate the other's data. We further prove that the distributions which motivated the conjecture, standard-basis measurements of bound-entangled qutrit states, are not themselves examples: a secret key is extractable from them whenever their creation costs any secrecy. Other measurements of their purifications, in contrast, do yield bound information, even for the separable states among them. The analogy is thus one of resources, not of individual states and their measurement outcomes.

Quantum computers are moving from research laboratories to industrial machines accessible via the cloud and integrated into high-performance computing facilities. However, translating theoretical quantum protocols into hardware experiments remains a major bottleneck, requiring expertise across protocol design, compilation, simulation, and cloud execution. Here, we introduce an agentic workflow that automates this pipeline on neutral-atom quantum processors (here two Pasqal QPUs available on the cloud) while keeping the researcher in the loop for critical validation. In three case studies from many-body physics and optimization, the agent went from published paper or patent to a QPU campaign run overnight. In particular, human intervention was crucial to ensure scientific validity: the agent selected an inadequate observable in one experiment and constructed a plausible but incorrect hardware diagnosis in another, with both failures detected only through domain-expert review. Finally, we use a second agent to classify a corpus of 633 Rydberg-array arXiv papers and show that nearly half are implementable on present-day QPUs while identifying specific hardware upgrades needed for the rest. Together, these results demonstrate that agentic workflows provide a practical bridge between theoretical ideas and physical hardware, opening quantum experimentation to a much broader scientific community.

It is obtained the $κ$-Poincare Casimir from the de Sitter geometry of momentum space and employed as the dynamical constraint governing charged particles within the framework of Poisson gauge theory. The resulting formalism is applied to investigate both scalar and spin-1/2 particles in a constant magnetic field. Exact energy spectra are obtained, including all orders in the deformation parameter $1/κ$. The curvature of momentum space implies a maximal invariant momentum, which in turn leads to a finite Landau spectrum characterized by the existence of a Highest Landau Level (HLL). In the fermionic case, the truncation becomes spin dependent, resulting in a polarized HLL. Possible implications of this ultraviolet truncation and its relation to anomaly-related phenomena are briefly discussed.

We discover two complementary linear-combination-of-Hermitian-matrices (LCHM) formulations to achieve a general non-normal matrix eigenvalue transformation $g(A)$. Firstly, for $A=L+\mathrm{i} H$ with Hermitian $L$ and $H$, the vanilla LCHM formula represents $g(A)$ as a kernel integral of $g(\mathrm{i}(H+kL))$, and it contains linear-combination-of-Hamiltonian-simulation (LCHS) [An, Liu, Lin, Phys. Rev. Lett. 2023] as the special case for matrix exponentials. Secondly, for the angular Hermitian $X_θ= \cosθL+\sinθH$, the Weyl LCHM formula expresses $g(A)$ via integrating $g(\mathrm{e}^{\mathrm{i}θ} (X_θ\pm\mathrm{i}(I-X_θ^2)^{1/2}))$. For the matrix power $g(A)=A^m$, the Fourier projection of Weyl LCHM gives \[ A^m=\frac{2}π\int_0^π\text{e}^{\text{i} mθ}T_m(X_θ) \text{d}θ= \frac{2}{N}\sum_{j=0}^{N-1} \text{e}^{\text{i} mθ_j}T_m(X_{θ_j}),\quadθ_j=\frac{πj}{N},\quad \text{for every } N>m \] with Chebyshev polynomial of Hermitian $T_m(X_θ)$ and $N$ samples. The discrete formula is exact, introduces no truncation and angular quadrature error, and offers $\mathcal{O}(1)$ post-selection weights. LCHM formulas lead to new quantum eigenvalue transformation (QET) algorithms. For a degree-$d$ polynomial $p_d(A)$ on $|ψ\rangle$, our QET algorithm can achieve optimal $Θ(d)$ circuit depth and optimal $\mathcal{O}(||p_d||_{\infty}/||p_d(A)|ψ\rangle||)$ post-selection repetitions. LCHM-based QETs unify various quantum linear algebraic problems with near-optimal $\mathcal{\widetilde O}(d\log(d/ε))$ Clifford$+T$ gates, including driven ODEs (reduced to standard LCHS), iterative methods, resolvents, $\log(I+A)$, $(λI+A)^ν$, Sign and ReLU transforms, and Faber approximation on noncircular domains.

By means of a simple and systematic normalization method we show that some apparently different potentials based on exponential functions are equivalent. Present normalization method only requires that the potential exhibits a minimum and is finite when the radial variable tends to infinity.

Learning the generator of an open many-body system is more challenging than Hamiltonian learning: local responses, which can directly reveal coherent interaction terms in closed-system dynamics, may also contain dissipative contributions in open-system dynamics. In this paper, we address this challenge by developing an efficient Lindbladian learning framework for a known local candidate generator dictionary with bounded dissipative support and either bounded dual-interaction-graph degree or bounded unweighted local strength. The framework resolves the coherent-dissipative ambiguity by treating local Pauli responses as a linear system over both types of generator terms. Inverting this response system separates their contributions and makes the individual Lindbladian coefficients accessible from local response data in a fixed short-time window. Within this framework, we develop two efficient learning algorithms: Chebyshev--Lobatto response interpolation, which uses logarithmically many short evolution times and has a post-mean cost linear in $M$, with the stated dependence on $ε$, and Single-time projected response contraction, which uses a single fixed evolution time and globally inverts a truncated response function. Both procedures estimate $M$ candidate coefficients to entrywise accuracy $ε$ using $\widetilde{\mathcal{O}}(M/ε^2)$ sample and classical post-processing complexity. Our theoretical results establish local response inversion as a scalable paradigm for learning, calibrating, and diagnosing complex quantum systems from experimentally accessible short-time data.

Molecular tweezer arrays offer great prospects for quantum simulation, sensing, and computing, and would benefit from methods that enhance loading efficiency. Whereas light-assisted collisions underpin enhanced loading methods for atomic tweezer arrays, this approach cannot be directly extended to molecular arrays due to collisional loss. We show how this collisional loss can be suppressed by shelving molecules in rotationally or vibrationally excited states, so that a shelved molecule interacts with a newly loaded molecule through a repulsive van der Waals interaction. By introducing microwave assisted collisions, we show how to control the final states and the energy released in a collision between a pair of molecules. Following this controlled collision, one of the two molecules can be ejected, and we explore several strategies for ensuring deterministic ejection. Our schemes rely on currently available techniques for laser-coolable molecules, and we predict achievable filling fractions up to 96%, paving the way for scalable molecular arrays.

We prove an exponential variant of the Gaussian de Finetti theorem: the subsystems of permutation-invariant, free-fermionic Gaussian states are well-approximated by convex combinations of almost-i.i.d. states that are Gaussian on subsets of their parts. Our result provides an error bound between the original state and its approximants that decays exponentially in the number of unconstrained parts, becoming super-exponential when the subsystem under consideration is small. The dimensional penalty of our bound is polylogarithmic in the local Hilbert space dimension, an exponential improvement over the standard de Finetti theorem of [Nat. Phys. 3, 645-649]. In the fully i.i.d. limit, our bound recovers the Gaussian de Finetti theorem of [arXiv:2603.12392]. Previous works considered Gaussian-symmetric states, which are supported on the trivial irrep of the tensor matchgate representation. We extend these to a broader class of Gaussian-invariant states containing, for example, i.i.d. copies of single-replica mixed Gaussian states. We show that Gaussian-invariant states are precisely the partial traces of Gaussian-symmetric states on locally enlarged replicas, and always admit a purification into a larger Gaussian-symmetric state. This extends de Finetti theorems to the full set of Gaussian-invariant states, with only a polynomial overhead in the dimensional penalty of the error bound.

We propose encoding a pseudo-spin-$1/2$ system in the ground ($v=0$) and first excited ($v=1$) vibrational states of polar molecules. Double microwave shielding simultaneously shields molecules in both states, suppressing two-body losses by orders of magnitude while strictly avoiding three-body recombination. The microwave dressing is state-dependent and results in highly tunable, long-range dipolar Ising exchange ($J_z$), density-density ($V$), and spin-density ($W$) interactions. These interaction length scales readily exceed the typical interparticle spacing, pushing the molecules deep into the strongly interacting regime. In bulk gases, this enables the exploration of itinerant quantum magnetism and quantum droplets with novel anisotropic spin textures; in optical lattices, it naturally realizes extended Hubbard and $t$-$J_z$ models, opening new directions in quantum simulation.

We describe the ro-vibrational van der Waals interaction between ultracold polar molecules. This interaction is strong, leading to fast elastic collisions and orders of magnitude suppression of collisional loss. This enables evaporative cooling of Fermi mixtures of molecules in different ro-vibrational states, without active shielding by applying external fields. The scheme is compatible with microwave shielding, where it enables controlled state dependent interactions, opening up new opportunities for quantum simulation and impurity physics. The interaction can also be used to stabilize fermionic molecules in optical lattices, to control interactions in synthetic dimensions, for enhanced tweezer loading, and direct infrared shielding.

We investigate a hybrid quantum-classical approach to quantum error mitigation. We propose Classically Augmented Zero-Noise Extrapolation, a hybrid error-mitigation method in which high-noise Richardson extrapolation nodes are replaced by classically simulated estimates. These classical nodes have negligible sampling variance but introduce deterministic simulation bias. We derive the resulting variance reduction under optimal shot allocation and show that, for linear node spacings and fixed index cutoff, the coefficient-level reduction can be exponential. We validate the prediction numerically using Pauli-propagation simulations and demonstrate a reduction in mean-squared error when the truncation bias is sufficiently small.

Quantum error mitigation (QEM) is an essential tool for mitigating hardware noise without incurring space overhead. Yet, its reliability depends on modeling, calibration, and implementation, leaving end-to-end security on untrusted quantum hardware unresolved. We address this problem by introducing verifiable blind probabilistic error cancellation (VBPEC), the first secure verification protocol against a fully malicious adversary that integrates QEM. VBPEC brings probabilistic error cancellation (PEC), a widely studied QEM technique, within the scope of composable security by formalizing delegated mitigation as a cryptographic resource in the abstract cryptography framework. The protocol performs PEC with perfect blindness and an exponentially small security error. VBPEC retains the absence of quantum-space overhead from recent statistically-secure verified quantum computation protocols and from PEC. The only overhead takes the form of additional repetitions due to the QEM procedure. To achieve this, we extend trap-based verification from deterministic pass/fail checks to statistical tests that benefit from QEM and develop a new proof technique that integrates the corresponding additional deviation sources. Rather than merely tolerating honest noise below a fixed threshold, VBPEC actively cancels it, enabling correctly mitigated estimates to be accepted with high probability without compromising security. Our framework thus establishes an essential route towards secure, reliable, and practical delegated quantum computation on near-future quantum hardware: VBPEC fundamentally improves the practicality of verification.

The choice of optical receiver determines which properties of the transmitted states remain visible in the observed data and therefore affects the performance of different quantum protocols. We compare continuous-variable, photon-counting and hybrid receivers within the same prepare-and-measure framework, using semi-device-independent randomness generation as the main case study. The measurement device is left uncharacterised, while the source is described by the Gram matrix of its pure signal states using an energy-derived overlap constraint, a magnitude-Gram benchmark or the full complex Gram matrix of a certified coherent phase-shift-keyed constellation. Within this framework, the observed receiver statistics are used to bound $H_{\min}(B|X,Λ)$ against classical side information correlated with the measurement device but independent of the input. For a fixed Gram matrix, this bound is obtained from an exact semidefinite program, with complex multi-input cases treated in block-real form and checked through the corresponding dual certificate. Photon counting alone is phase blind for fixed-modulus phase encoding and therefore certifies no worst-case randomness. Continuous-variable receivers give the highest certified entropy at moderate energy, while under the nominal source calibration a hybrid receiver performs better at low energy when the beacon-region label is retained in the output. The same receiver statistics also provide receiver-level comparisons for discrete-modulated continuous-variable quantum key distribution, quantum reading, covert communication and quantum-signature verification, without replacing the full security analysis required for each protocol.

Interaction-free measurement infers the presence of an absorbing object from a photon that, in the counterfactual sense, never interacted with it, and is widely described as a route to minimally invasive sensing. We ask what it actually buys, in estimation-theoretic terms. Written as a channel-estimation problem, the Elitzur-Vaidman interferometer carries exactly half the Fisher information about the object's transmissivity that direct transmission probing does, and the two schemes deliver identical Fisher information per absorbed photon. For measuring how transparent something is, the interferometer buys nothing. The advantage lies in discrimination, and we show that what it requires is not that the object be opaque but that the competing hypothesis be the object's absence. Against empty space the Chernoff information per absorbed photon grows almost linearly, as the number of Zeno cycles times its logarithm, even for a weakly absorbing object; between two partial transparencies it does not grow at all. Parasitic loss in the cycle caps the advantage. The number of conclusive interrogations per absorbed photon reaches a maximum inversely proportional to the loss per cycle, at an optimal cycle number that is likewise inversely proportional to it, which identifies the loss per cycle as the figure of merit governing how far interaction-free sensing can be pushed. Finally, the negative result is not special to the interferometer. For a single photon meeting a memoryless, non-dispersive object any number of times through arbitrary fixed optics, the accessible quantum Fisher information never exceeds that of the same incident flux spent on independent single-pass probes, and is generically far below it. This recovers the bound of Massar, Mitchison and Pironio for this class, by a short argument that also identifies when it is tight.

We study the quantum mechanics of a charged particle confined to the surface of a cube enclosing a magnetic monopole. The magnetic field is chosen to have a constant magnitude on each face and to point along the outward normal, preserving the rotational symmetry of the cube. We formulate the continuum problem using two gauge patches on the cube surface and show that consistency of the wavefunction gives the Dirac quantization condition. Since an explicit vector potential does not remain invariant under ordinary rotations, we construct gauge-modified rotation operators and use them to classify the eigenstates. Even monopole charges are described by the irreducible representations of the cubic rotation group O, while odd monopole charges require the spinorial representations of the binary octahedral group 2O. We compute the spectrum with a gauge-covariant finite-difference discretization and find Landau-level-like manifolds whose degeneracies are split by the discrete cubic symmetry. We also study the corresponding tight-binding Hofstadter problem on the discretized cube. The resulting spectrum contains the usual magnetic subband structure together with additional gap states localized near the cube corners.

Controlling heat flow in small quantum systems is a central goal of quantum thermodynamics and nanoscale transport. A key challenge is to achieve strong thermal rectification without suppressing the transmitted heat current, a tradeoff that often arises in static diode configurations. We establish a Floquet-control mechanism in a minimal quantum thermal diode formed by two longitudinally modulated Ising-coupled qubits, each coupled to an independent thermal reservoir. From a microscopic system--bath model, we derive a Floquet--LGKS master equation that resolves the drive-assisted transition channels. The resonant undriven device with left--right symmetric bath couplings serves as the reciprocal benchmark, while static detuning provides a rectifying reference with reduced heat current. Single-side driving breaks this reciprocal structure by creating a Floquet-dressed contact opposite a purely thermal contact. For this configuration, we obtain a compact steady-state current formula and an exact blocking condition for suppressing one bias direction while retaining finite transport in the opposite direction. In the weak sinusoidal-drive regime, rectification begins quadratically in the modulation amplitude. Dual-side driving adds a Floquet pumping contribution to the interaction-mediated current, so complete blocking requires cancellation of both contributions. These results establish contact-selective Floquet dressing as a design principle for controllable heat-flow asymmetry in minimal quantum thermal devices.

We present a numerical study of subsystem distance decay following a global quantum quench in the infinite one-dimensional transverse-field Ising chain, using the mathematically rigorous Bures distance $B_A(t)$ to quantify the deviation of the time-evolved reduced density matrix from its stationary generalized Gibbs ensemble state. We show that the late-time decay follows a discrete power law $B_A(t) \sim t^{-λ}$, with the exponent $λ$ confined to discrete values: $1$, $5/4$, $3/2$, $7/4$, $2$, $5/2$, and potentially further values. The specific exponent is jointly determined by the pre- and post-quench transverse fields, as well as by properties of the symmetric excitation-fraction function $m_S(\varphi)$, defined on $\varphi\in[0,π]$ to characterize the pre-quench Hamiltonian eigenstates, including continuity, boundary values, and first-derivative boundary values, among others. The previously established $t^{-3/2}$ decay for the initial ground state of the pre-quench Hamiltonian is naturally recovered as a special case of this general classification. Our results reveal a universal discrete structure governing local equilibration dynamics in integrable quantum systems.

As quantum computing continually improves, ensuring the reliability and correctness of quantum libraries has become increasingly critical. To this end, many LLM-based fuzzing approaches towards quantum libraries have been proposed to uncover potential bugs. However, these methods still suffer from limitations such as insufficient flexibility and low efficiency, which hinder the progress of the quantum computing field. To address these challenges, we propose KQFuzz, a novel knowledge-guided fuzzer for quantum libraries. It leverages comprehensive codebase knowledge to ground LLM-based test generation, synergizing this with fitness-guided evaluation and two-level mutations to explore complex execution paths and trigger potential bugs. Firstly, KQFuzz introduces a novel prompting scheme tailored to quantum programs, which strategically incorporates knowledge of the codebase to efficiently generate high-quality quantum seed programs. Moreover, we develop evaluation and mutation strategies to handle the generated seed programs, facilitating efficient fuzzing execution while further enriching the diversity of the resulting test cases. We implement KQFuzz and conduct fuzzing on three popular quantum libraries, including Qiskit, PennyLane, and Cirq. Experimental results demonstrate that our approach significantly outperforms other state-of-the-art methods, with coverage improved by up to 18.44%. During the development of KQFuzz, we discovered 13 bugs, all of which have been confirmed and 12 have already been fixed by the developers.

The quantum superpositions of coherent states offer an alternative to the conventional qubit-based encodings by harnessing the large Hilbert space available in bosonic modes, including those realised in microwave and optical cavities, magnons, and mechanical resonators. Beyond their advantages for local information processing, establishing long-distance quantum networks for such bosonic states is crucial for scalable quantum communication and distributed quantum computation. In this work, we propose an entanglement-swapping-based protocol to generate a bipartite magnonic cat state shared between spatially separated subsystems. Each subsystem comprises a hybrid architecture consisting of a superconducting transmon qubit coupled to a yttrium iron garnet (YIG) sphere that supports magnon modes. By performing a projective Bell-state measurement on the qubits, the initially established magnon-qubit entanglement is coherently transferred to the remote magnon modes, resulting in a nonlocal magnonic cat state. For experimental characterisation of the gener- ated states, we perform quantum state tomography through reconstruction of the Wigner function using joint displaced parity measurements of the magnon modes. Our scheme provides a feasible route towards realising long-distance magnonic entanglement and contributes to the advancement of hybrid quantum network architectures.

Collective excitations in ordered subwavelength atomic arrays can exhibit strongly suppressed radiative decay due to interference between light scattered by neighboring emitters. These so-called subradiant states make these systems a promising platform for storing and manipulating photonic excitations. The external geometry of the array, combined with dynamical control of the atomic dipole orientation, enables localized trapping and coherent transport of these subradiant excitations. Here, we theoretically demonstrate these capabilities in ring-shaped atomic arrays. Specifically, we show adiabatic transport of a localized excitation around a single ring, coherent transfer of a single excitation between two neighboring rings with geometry-controlled selectivity, and interaction-induced conditional phase shifts between two simultaneously trapped excitations in neighboring rings. The latter can be interpreted as effective controlled-phase operations between stored excitations. Together, these results demonstrate the potential of ordered atomic arrays as a platform for coherent photonic quantum information processing with dissipation-protected collective excitations.

A quantum wave packet in a linear potential, i.e., under a constant force such as gravity, accumulates a cubic-in-time phase that is universal across Schrodinger-type platforms and naturally realized by Airy eigenstates. Because the classical action is quadratic in the force, this phase comprises exactly three contributions: intrinsic, force-induced, and a cross term. The force-induced contribution alone is shape-independent, whereas the Airy eigenstate renders the shape-dependent contributions non-dispersing. An eigenstate-based nondimensionalization identifies the eigenforce, namely the intrinsic force underlying the packet's acceleration in the absence of an applied force, as a natural parameter. As a function of both forces, the cubic coefficient takes an analytically closed and physically interpretable form that factors along two zero lines: the static Airy eigenstate and a nontrivial zero at which the phase cancels without stationarity. This exposes the eigenforce as an effective antagonist to the applied force, not only in the caustic's self-acceleration but also within the phase, while leaving the centroid unaffected in accordance with Ehrenfest's theorem. Spatially uniform within each packet, the phase cannot be measured directly and is accessible only through the relative phase of two colliding packets, each evolving in its own potential. The general relative cubic coefficient, forbidden by symmetry for identical packets and activated by preparation asymmetry, therefore provides a designable signal. Extracted through heterodyne demodulation of the simulated interference between two Airy packets, its central value agrees with the prediction to sub-percent accuracy within the fitting uncertainty. The analysis spans ultracold-atom condensates, paraxial optics, and surface-gravity water waves.

The entanglement asymmetry measures how strongly a symmetry is broken inside a subsystem. Analytic results at equilibrium have so far covered free theories and, perturbatively, the critical XXZ chain. We compute the Rényi entanglement asymmetries of a large interval in the gapped, $U(1)$-breaking phase of the interacting XYZ chain. The calculation combines three ingredients. A charged-moment identity, which we prove for fermionic Gaussian and for injective matrix-product ground states, ties the asymmetry to the static susceptibility of the broken charge. A non-conservation sum rule then evaluates the susceptibility from sine-Gordon form factors, its two-kink and one-breather channels providing a lower bound on the universal amplitude. The Baxter--Johnson--Krinsky--McCoy solution supplies the kink mass for different couplings. Infinite-system density-matrix renormalization group simulations built on these masses reproduce the master formula.

We have introduced PT-symmetry to a central spin model by adding a PT-symmetric interaction with a tunable hermiticity parameter $γ$. Using the pseudo-Hermitian formalism, we applied a Dyson map to transform the non-Hermitian Hamiltonian to its Hermitian representation. We have found that the decoherence slows down as $γ$ increases, eventually ceasing at $γ=1$. We define a pseudo-Hermitian observable that commutes with the metric operator to add as the self-Hamiltonian. Einselection gradually forced the system to select the eigenstates of the self-Hamiltonian as $γ\rightarrow1$. The steady-state purity of the central spin states in the strong environment regime exhibits a paradoxical decrease as $γ$ increases. However, a turning point (minimum) corresponding to a maximum information dissipation to the spin bath is found. Finally, the Breuer-Laine-Piilo (BLP) measure, which is used to quantify the non-Markovianity of a quantum system, was evaluated for a finite time. The BLP measure in the strong environment regime exhibited similar turning point behavior, which means that the information backflow reaches a saturation point before declining. This decline signifies the point where PT-symmetry starts shielding the central spin from the environment.

We explore how collective states of light and matter differ when the multi-level nature of the quantum emitters is fully taken into account. For closely spaced emitters, interferences between near-resonant transitions completely change the character of the collective states compared to two-level approximations. In particular, we find a lower bound on the emitter separation for superradiance to occur which does not exist for two-level emitters. By contrast, for larger separations between the emitters, the collective states resemble those obtained within the widely used two-level approximation of the emitters. Both regimes may be realized by molecules trapped in optical lattices. We therefore propose molecular candidates and describe experimental signatures of emerging multi-level interference.

Entangled states of light lie at the heart of photonic quantum technologies, from distributed quantum communication to quantum-enhanced measurement and information processing. Their practical generation, however, remains constrained by the weak interactions between photons, which make the deterministic assembly of large multiphoton entangled states a central challenge in quantum optics. In this work, we use AI techniques to discover heralded linear-optical schemes for path-entangled states and show that the resulting solutions can be elevated from individual circuits to a new scalable family. This family contains previously known constructions as special cases while generally providing exponential and super-exponential improvements over those, and its extension to broader classes of target states shows how automated discovery can reveal transferable physical understanding. By presenting compact experimental proposals for large path-entangled states, our results provide both a theoretical advance in photonic heralding and a route towards a substantial leap in experimentally accessible multiphoton entanglement.

Deterministic spatial inhomogeneity has become increasingly relevant in experimentally engineered quantum many-body systems, where interaction gradients can strongly influence nonequilibrium dynamics. Motivated by this, we investigate out-of-time-ordered correlators (OTOCs) and their connection to the eigenstate thermalization hypothesis (ETH) in inhomogeneous XXZ spin chains. Using a deterministic spatially varying interaction profile, we show that finite interaction gradients ($δ>0$) induce a pronounced left--right asymmetry in information scrambling, as quantified by OTOCs. This asymmetry persists even when the system exhibits spectral signatures of quantum chaos, with operators on the strongly interacting side exhibiting suppressed scrambling. To elucidate the origin of the asymmetric finite-size long-time saturation value of OTOCs, we employ two complementary approaches. First, we analyze the diagonal matrix elements of the OTOC observables in the energy eigenbasis within the ETH framework. Second, we derive an analytical expression for the finite-size saturation value based on the overlap between the Hamiltonian and the OTOC observables, which explicitly incorporates the spatial interaction profile. The analytical prediction is fully consistent with the numerical results and provides a microscopic explanation for how deterministic interaction gradients generate the observed asymmetry in the long-time saturation of OTOCs.

The problem of finding lower and upper bounds on multivariate homogeneous polynomials is both difficult and important given its applications to questions ranging from dynamical stability in complex potential landscapes to data analysis. From the standpoint of tensor eigenvalue theory, the question is equivalent to finding the smallest and the largest eigenvalues of the coefficient tensor corresponding to the given polynomial. Standard approaches outlined in the literature amount to running nonlinear iterations in search for the optimal rays along which the growth of the polynomial is fastest or slowest. Unlike the case of matrices (or their corresponding multivariate quadratic forms) convergence of such algorithms for higher-rank tensors is capricious due to the complex topography of polynomial objective functions. In this essay, a very different strategy, inspired by quantum-mechanical variational methods, is introduced for finding bounds on polynomials. The original polynomial is replaced by an operator acting in a suitably chosen (large) space of states, such that in an appropriate "classical" limit this operator approaches the original polynomial expression made of commutative variables. As a result, approximating the smallest and largest eigenvalues of the coefficient tensor, and thus finding bounds on polynomials, amounts to diagonalizing the resulting quantum operator, represented as a large matrix, and then inspecting the smallest and largest eigenvalues of this matrix. This approach is then successfully applied to standard test examples from tensor eigenvalue literature and other problems of interest in mathematical physics including Strichartz-type inequalities.

Driven by contributions from academia, industry, and open-source communities, the quantum software ecosystem is rapidly growing. Across this ecosystem, new concepts often emerge through software artefacts accompanying scientific publications as well as through sustained development in larger communities. However, many repositories receive development efforts only over a limited period of time, raising the question whether their concepts persist beyond individual repositories. In this paper, we apply established empirical software engineering techniques to analyse a set of foundational quantum software repositories. We combine cross-repository activity with contributor relationships to study the evolution of communities. Our analysis provides empirical evidence of contributor migration patterns and indications of cross-project knowledge transfer. We observe multiple development paths: projects may evolve into sustained communities, contributors may integrate concepts into established ecosystems, or activity may continue through new and follow-up software artefacts. Our observations provide an initial empirical perspective on how concepts and influence persist across repository boundaries in quantum software ecosystems.

We challenge the widespread consensus that mean-field theory fails to describe long-range open quantum systems in the presence of symmetry breaking and/or when starting from strongly correlated states (e.g., macroscopic superpositions). While recent literature relies on cumulant expansions to capture such systems, this approach rests on truncations with no clear justification. Here, we show that it is, at best, conceptually redundant in the strong long-range regime. We show that the evolution can be decomposed into, and fully reconstructed from, independent mean-field dynamics. This decomposition generates the entire hierarchy of cumulants and, as a byproduct, identifies---to our knowledge, for the first time---a regime in which cumulant expansions exactly predict low-order cumulants. We illustrate the power of our findings with two applications: we compute the moment generating function for nonequilibrium $\mathcal{Z}_2$ symmetry breaking, and construct states restoring time-translation symmetry in time crystals. In both cases, our method fully reproduces the exact many-body dynamics, which is out of reach of cumulant expansions. Our results reclaim the exactness of mean-field theory, offering a transparent framework for large-scale open quantum systems.

The numerical simulation of non-Markovian open quantum systems based on the non-Markovian quantum state diffusion (NMQSD) equation is complicated by functional derivatives with respect to the stochastic process. A general numerical framework that directly treats these functional derivatives without relying on prescribed decompositions of the bath correlation function is still lacking. In this work, we derive an analytical solution of the linear NMQSD equation that reveals three elementary structures of the non-Markovian stochastic dynamics: stochastic propagation, functional-derivative insertion, and memory pairing. Based on this structure, we construct a general auxiliary-state framework for arbitrary bath correlation functions. The framework separates the numerical construction into time discretization, memory quadrature, and hierarchy truncation. We then construct first- and second-order schemes and provide diagrammatic transition rules for their explicit implementation. Numerical results verify the expected temporal accuracy and demonstrate the applicability of the proposed methods to different bath correlation functions and multi-level quantum systems.

Quantum networks play a pivotal role in quantum information science, which not only provide a secure communication platform for remote access to quantum computers but also serve as the strategic core for achieving large-scale quantum information processing, forming the foundational infrastructure for the future global-scale quantum internet. Quantum teleportation, which enables the transmission of unknown quantum states over long distances by employing quantum entanglement together with classical communication, is essential for the distribution of quantum resources in the construction of the global-scale quantum internet. To realize a global-scale quantum internet, quantum repeater protocols represent one of the most promising approaches for enabling quantum communication between any nodes. This concise review presents representative experimental demonstrations of quantum teleportation for constructing quantum networks across different physical platforms. Along this trajectory, the review discusses current challenges, open issues, and future perspectives toward scalable and practical quantum internet.

Quantum cloud platforms need to dynamically orchestrate workloads across heterogeneous quantum computation backends whose noise profiles, qubit topologies, and queues vary over time. Existing orchestrators use noise-agnostic heuristics that ignore backend-specific errors, causing reduced execution fidelity, load imbalance, and frequent rescheduling. To address these challenges, we propose QCOEM - a Quantum Cloud Orchestration framework that leverages Evolutionary algorithms for Multi-objective optimization of quantum task scheduling. We compare NSGA-II and NSGA-III for jointly minimizing mean completion time, execution error rate, and load imbalance. To select schedules from a non-convex Pareto front, we apply an Augmented Achievement Scalarization Function (AASF) as a preference-based decision rule that maps the Pareto set to a single dispatchable schedule aligned with user priorities. Our extensive performance evaluation in a heterogeneous quantum cloud environment shows zero task rescheduling and about 30% higher mean fidelity than noise-agnostic heuristics, while maintaining bounded scheduling overhead. The experiment results indicate that our QCOEM framework can deliver stable, high-fidelity execution and lightweight resource management for quantum cloud computing.

When a photon and one member of an entangled photon pair are jointly projected onto a Bell-state measurement (BSM), the quantum state of the photon can be transferred to the distant partner of the pair without physically transmitting this information carrier. In real-world deployment, however, teleportation performance is fundamentally bottlenecked by quantum channel impairments, such as loss, noise, and fluctuations, which induce severe decoherence and degrade fidelity. This vulnerability is further exacerbated in scenarios with intense classical data traffic or background light. Realizing scalable quantum networks, therefore, hinges on developing advanced channel architectures capable of supporting both high-fidelity quantum operations and high-capacity classical communications within a shared infrastructure. Towards this end, hollow core fibre (HCF) offers a promising quantum channel resource by combining free-space-like weak light-matter interaction with the stability of fibre-based systems. Here, utilizing a field-deployed metropolitan HCF network spanning three spatially separated nodes in Chengdu, we achieve quantum teleportation with an intermediate BSM under co-propagating classical traffic. Crucially, the HCF links preserve the long-term indistinguishability of photonic qubits without active stabilization, and exhibit a Raman noise approximately three orders of magnitude lower than that of standard solid-core counterparts. This noise suppression enables robust quantum teleportation even alongside classical launch powers up to 160 mW. Our findings establish a classical-data-compatible framework for quantum networking over deployed fibre infrastructure and offer a wavelength-agnostic, plug-and-play, and free-running pathway toward the quantum internet.

Mapping quantum phase diagrams through classical simulation is notoriously resource-intensive, as even small systems far from the thermodynamic limit demand prohibitive computational effort. The variational quantum eigensolver (VQE) offers a compelling alternative, exploiting approximate ground states to distinguish phases. An appealing proposal, dubbed as Delta-VQE, determines critical points by contrasting variational energies optimized from reference states of distinct phases. Intriguingly, the diagnostic sharpens as circuit depth decreases, highlighting its promise as a resource-conscious probe of quantum criticality. To probe the broader applicability and underlying mechanisms of this approach, we investigate the one-dimensional transverse-field Ising model with a three-spin cluster interaction, a setting in which the Ising transitions are generally situated beyond the self-dual line. We demonstrate that, whenever dual ansätze are employed, Delta-VQE invariably detects the self-dual points rather than the true criticality. In contrast, when ansätze are carefully tailored to embody the competing phases across the boundary, the genuine Ising critical point can be successfully identified with only minor finite-size effects. Our results establish that, while Delta-VQE provides a resource-efficient probe of quantum criticality without requiring precise ground-state preparation, its diagnostic power is fundamentally contingent upon the judicious selection of physically representative ansätze.

We propose a method to enhance Coulomb interaction between charged macroscopic mechanical oscillators by placing a conducting structure in their vicinity. We derive the effective motional dynamics of the two oscillators using macroscopic quantum electrodynamics and show that image charges induced in the conductor fundamentally modify the range of the electrostatic interaction. For the specific case of a cylindrical wire, we predict that the coherent motional coupling changes from the free-space scaling $1/D^3$ to an asymptotic $1/(D\ln^2 D)$ dependence on the separation $D$ between the oscillators, at the cost of only negligible additional decoherence for low-frequency oscillators. We further show that, when combined with continuous position measurements, the enhanced interaction enables the generation of steady-state motional entanglement between the oscillators over significantly larger distances than achievable in free space. For experimentally realistic milligram-scale oscillators, we predict observable entanglement at separations of several hundred microns -- more than an order of magnitude beyond free-space capabilities -- with improvements approaching two orders of magnitude in future systems. These results identify conductor-assisted Coulomb interactions as a resource for quantum control of massive objects and for the exploration of entanglement generated by fundamental central forces.

The coexistence of quantum information and classical signals in a single fiber is essential for future quantum networks that leverage the well-established optical fiber infrastructure. Although multiplexing technologies can separate quantum and classical signals, pure silica core fibers (PSCFs) remain fundamentally limited by the high nonlinearity, which generates substantial Raman scattering and four-wave mixing noise. Hollow-core fibers (HCFs), guiding light predominantly in air, offer an attractive solution with intrinsically ultra-low nonlinearity and strongly suppressed nonlinear noise. In this work, we demonstrate the entanglement-based key coexisting with data over an 18-km HCF link. We achieve time-encoded high-dimensional quantum key distribution (HD-QKD) carrying 0 dBm of bidirectional received power, corresponding to a theoretical data capacity of up to 2.3 Tbps. During 24 hours of continuous operation, an average secret key rate (SKR) of 10.56 kbps is obtained. Theoretical analysis further predicts SKRs above 135 kbps over transmission distances exceeding 200 km using state-of-the-art low-loss HCFs. These results show significantly improved performance compared with PSCF-based systems and highlight the potential of HCFs for scalable quantum-classical coexistence compatible with the architectures of established fiber-optic networks.

We develop a record-based account of internal time in quantum mechanics, where the formation of a stable record is represented as conditioning on actualized information, and along a history the accumulated record algebras are ordered by inclusion. If the duration of a realized outcome depends only on its conditional Born probability, composes additively under sequential conditioning, and is continuous and calibrated, then the actualization of each outcome contributes an internal duration equal to its surprisal, the negative logarithm of that probability, so that a certain outcome contributes no duration, whereas less likely outcomes contribute larger increments. The ensemble mean of the accumulated clock is the Shannon entropy of the record process, its moment-generating function is fixed by the Rényi entropy spectrum, and the realized clock admits a Doob decomposition into a predictable entropic compensator and a martingale of clock fluctuations, so that each increment is the information gain of the corresponding actualization. Records are characterized by graded criteria of distinguishability, decoherence, and stability. We also clarify the multiple-clock problem: in one fixed context, additivity of two surprisal clocks is equivalent to factorization of the Born distribution in that context, whereas for a pure bipartite state, additivity in every pair of local contexts is equivalent to rank-one factorization of the joint state and to the vanishing of all its $2\times2$ minors.

We show that internal loss and survival conditioning can activate anomalous generalized bunching in passive linear optical circuits. We introduce a conditional bunching probability that all photons occupy a target region of accessible output modes, given that all photons survive. For two-photon inputs, we prove that this probability is always monotonic for any circuit size and loss configuration, although a multimode target region can reverse the monotonic direction. For three-photon inputs in a minimal three-mode lossy interferometer, we find a nonmonotonic anomaly in which the conditional bunching probability is maximized for partially distinguishable photons. This behavior is forbidden for the corresponding unconditioned target-region probability, demonstrating that survival-conditioned loss changes the minimal hierarchy of generalized bunching.

Here we analyze the creation of quantum simulacra: phenomena that emerge from treating a Hermitian or non-Hermitian quantum system in metrics other than the standard $L^{2}$. Changing the metric redefines the set of system observables and thus the experimental arrangement for their measurement, making quantum contextuality and microscopic reality metric-dependent. The simulacra therefore consist, on the one hand, of a resizing of the status of quantum measurement, which has always occupied a central role in quantum mechanics: beyond the connection between quantum and classical dynamics, measurements performed in an appropriate metric can emulate a microscopic reality distinct from that prescribed by the Hamiltonian. On the other hand, simulacra provide a route to implementing quantum operations that lie beyond the reach of the $L^2$ metric. Quantum simulacra offer, as an example, an explanation for the recent observation of the violation of Bell inequalities with unentangled photons [Sci. Adv. \textbf{11}, eadr1794 (2025)]: photons that are separable in $L^2$ metric, become entangled when analyzed within a new metric framework. Simulacrum comes at the cost of implementing measurements of the metric-redefined observables; to address this challenge, we propose a scheme combining positive operator-valued measures with postselected subensembles.

Passive linear optics is a restricted model of quantum computation, with complexity-theoretic evidence of quantum advantage for sampling tasks and low losses that make it attractive for near-term algorithms. In qubit architectures, a body of work has revealed a close connection between barren plateaus and classical simulability. Whether an analogous tradeoff exists for bosonic systems remains largely unexplored. Building on a recently developed representation-theoretic framework for moments of random passive linear-optical circuits, we characterize the concentration of expectation values for relevant families of particle-number-preserving observables by evaluating their projections into irreducible representations of the unitary group and analyzing their asymptotic scaling. We show that concentration is governed by the misalignment of the projections into irreducible representations of the input state and the observable, giving a unified representation-theoretic interpretation of generalized entanglement and locality in the bosonic setting. We further relate these concentration properties to existing classical simulation techniques, identifying broad classes of trainable observables that admit efficient classical simulation. Conversely, we identify Fock-state inputs and observables that appear to evade exponential concentration while retaining a polynomially large signal component not accessible to known efficient classical simulation methods. The separation is only partial: most of the signal remains classically tractable, and the residual part, while not exponentially suppressed, is small enough that a truncation serves as a classical surrogate with polynomially small error. Our framework nonetheless provides a systematic route for searching for regimes that unambiguously combine the absence of exponential concentration and lies beyond known efficient classical simulation methods.

Optimal control problems arise in a wide range of scientific disciplines, but the corresponding optimization algorithms often display a strong dependence on hyperparameters that significantly influence performance and convergence. For the optimal implementation of quantum algorithms, these challenges are further amplified by high-dimensional control landscapes and the need for high-fidelity operations. Here, we propose an algorithm for optimal control problems in quantum computing to efficiently generate high-fidelity control protocols for multi-qubit systems in a hyperparameter and gradient free manner. The method, referred to as Pulse Engineering via Projection of response functions at infinite nonlinear order (PEPRino), leverages the framework of response theory to navigate the control landscape to find high-fidelity implementations. This is achieved by determining the control landscape via response functions to infinite order, efficiently evaluated by resummation in terms of the first and second order response function. To demonstrate the approach, we apply it to quantum systems consisting of two and three qubits for the optimal implementation of the Quantum Fourier Transform (QFT). We benchmark the proposed algorithm against the Chopped Random Basis (CRAB) algorithm utilizing the Nelder-Mead method, focusing on the 2-qubit scenario. The results indicate faster convergence regarding iteration steps and computational time, highlighting the advantages of our approach.

Variational quantum algorithms offer a promising route to combinatorial optimization, but their applicability is limited by the challenge of encoding large-scale problems within restricted qubit resources. In this work, we introduce a scalable variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization. Binary variables are represented through expectation values of Pauli correlation operators, which encode multi-body correlations of the quantum state and provide a continuous relaxation enabling compact representations with few qubits. We further propose a two-stage hybrid formulation, in which a time-averaged problem provides initialization for a time-resolved optimization. Numerical simulations demonstrate near-optimal performance across problem sizes ranging from $m$=18 to 10,296, with normalized cost gaps on the order of $10^{-4}$ relative to solutions with certified optimality. We show that the performance is governed by the interplay between continuous relaxation and discretization: the effective resolution of the correlator representation determines how reliably improvements in the continuous loss translate into better discrete solutions, with larger systems exhibiting more consistent behavior. Finally, we demonstrate robustness on a trapped-ion quantum processor, where high-quality solutions are obtained despite noise and finite sampling. These results establish PCE as a physically motivated and qubit-efficient framework for large-scale combinatorial optimization.

Using stimulated emission, a photon pair source can be characterized by seeding the signal mode with a bright classical beam and measuring the stimulated idler field, thus replacing two-photon coincidence counting with classical intensity detection. We apply this approach to the continuous transverse spatial degrees of freedom of a down conversion source and show that it is possible to certify spatial entanglement with only intensity measurements. We demonstrate this capability through variance-based entanglement and steering witnesses, as well as the Fedorov ratio. This method is useful for studying entanglement properties of photon pair sources in conditions where alignment and photon counting measurements are difficult and time-consuming.

Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the full Python code of shuttling compilers from written specifications. We start with a compiler for (i) a linear segmented trap, extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are seeded with code from the previous ones. We benchmark the LLM-generated compilers against state-of-the-art hand-crafted ones using a common suite of quantum circuits. The number of shuttling timesteps is reduced by up to 76% for (i) and up to 39% for (ii). For the broad case (iii) of freely connected architectures, we find large variations in the required number of shuttling timesteps, depending on the connectivity. A densely connected, junction-rich architecture yields an order-of-magnitude reduction in shuttling timesteps compared to a corridor-like one. Repeating the complete generation and evaluation with a second frontier LLM, Claude Fable 5, reproduces these findings, with the Fable 5 compilers surpassing the hand-crafted ones more often on the largest circuits. Our results show that an unmodified frontier LLM can produce working, correct, and competitive shuttling compilers without additional manual algorithmic engineering, thus reducing the development time for new architectures from several months to a few days.

Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate $n$ copies of a given resourceful state $ρ$ from all free (i.e., resourceless) states; key instances for applications are entanglement testing and quantum magic testing. The asymptotic characterisation relies on the recently proven generalised quantum Stein's lemma, which establishes the rate of decay of the false negative error probability for a fixed false positive error probability. This result, however, is intrinsically asymptotic and thus can provide no finite-resource guarantees, which makes its practical implications unclear. Here, we establish the first rigorous finite-$n$ bounds on quantum resource testing and hence quantum resource manipulation, providing explicit estimates on the number of copies needed to achieve a prescribed performance. As notable consequences, we obtain (a) the convergence of the regularised Rényi relative entropies of a resource, which settles the important open problem from [Fang/Hayashi, IEEE ToIT 72:6, 2026]; and (b) the first sample-complexity bound for asymmetric resource testing: for any fixed false positive error probability, a false negative error probability of at most $δ$ can be achieved with $n=O\left(\frac{\log(1/δ)}{D^\infty(ρ\|F)}\right)$ copies of $ρ$, in the limit where $δ\to 0$.

Any algorithm execution on quantum computers requires several repeated and costly executions (known as shots) to obtain reliable results. In this work, we propose a closed-form accurate analytical expression to determine optimal number of shots required for reliable execution of any algorithm on a quantum computer. We also present a theoretically grounded technique to distribute fixed shot budget across different partitions in a quantum circuit minimizing the total error. Our proposed analytical model helps to reduce the shots associated with reliable execution of quantum algorithms by about 58\% compared to current practice, in turn reducing the energy consumption by upto 62\%. Furthermore, our proposed optimal shot allocation technique across different partitions reduces total error by up to 73\% compared to conventional approaches.

We establish a connection between Hardy's paradox and nonlocality sharing in sequential bipartite scenarios, where each subsystem is measured in turn by a chain of observers. We show that any correlations exhibiting a Hardy paradox in the two-input two-output scenario enable sequential violations of the CHSH inequality between arbitrarily many pairs of observers, using only projective measurements and the assistance of a small local ancilla system. Since almost all pure entangled states, with the only exception of the maximally entangled one, admit Hardy correlations, our protocol applies generically: almost all pure entangled states, if assisted by a local ancilla, allow for nonlocality sharing between arbitrarily many observer pairs using only projective measurements.

We show an explicit qutrit channel whose private and quantum capacities both vanish, although it is neither antidegradable nor positive under partial transposition (PPT). This resolves two longstanding open problems in quantum information theory: whether zero quantum capacity can occur outside the PPT and antidegradable classes, and whether antidegradability is the only nontrivial mechanism that forces the private capacity to vanish. For qutrit systems $A$ and $B$, the channel is \[ Λ_{A\to B}(X)= \frac{1}{2}X+\frac{1}{4}\left(\operatorname{Tr}(X)\mathbb{1}_{B}-X^{\mathsf T} \right). \] We prove that, for every tensor power and every finite-dimensional quantum reference system, the complementary output dominates the receiver output in relative entropy. Consequently, we show that the optimized private and coherent information vanish at every blocklength, and hence $P(Λ)=Q(Λ)=0$. The proof uses a nonpositive, adjoint-preserving signed lift whose weighted defect admits an exact rank-three completely positive factorization. Applying established Bogoliubov--Kubo--Mori/relative-entropy comparison results and complete less-noisy tensorization results then yields the stated order at every tensor power, leading to zero quantum and private capacities. Meanwhile, we show that the channel is neither PPT nor antidegradable. The channel therefore realizes exact quantum and private incapacity beyond the standard PPT-based bound-entanglement mechanism and the no-cloning mechanism.

Fluctuation theorems for work provide universal constraints on nonequilibrium fluctuations, yet their quantum generalizations often rely on externally prescribed classical driving protocols. While for classical systems, fluctuation theorems have been extended to autonomous work, where the dynamics of the work source is subject to the backaction of the system, their generalization to the quantum regime is constrained by the uncertainty principle. Here, we extend fluctuation theorems for autonomous work from the classical regime to the quantum regime. By performing successive projective measurements over the work source and the system, we derive Jarzynski-type and Crooks-type fluctuation theorems for autonomous inclusive work from initial mixed thermal states. These relations are analogous to fluctuation theorems for autonomous work in the classical regime and explicitly incorporate the fluctuations of the work source. However, quantum noncommutativity prevents a consistent reduction to the nonautonomous counterparts, even in the limit of a large work source and correspondingly negligible backaction. By contrast, under the exclusive work definition, the nonautonomous limit is recovered when the measured observable of the work source commutes with its bare Hamiltonian and the backaction of the system on the work source is negligible. Our results are illustrated with the Dicke model, where a single-mode radiation field and an ensemble of two-level atoms act as the system of interest and the work source, respectively.

We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most $δ$ and $d=\dim A$, the optimal dimension-only modulus of continuity is $h_2(δ)+δ\log(d^2-1)$ up to $δ=1-d^{-2}$ and $2\log d$ thereafter, where $h_2$ denotes the binary entropy. When $\dim B\ge d$, this bound is tight for every $δ\in[0,1]$. The key proof idea was developed with the assistance of ChatGPT 5.6 Sol, building on and adapting the tight classical proof of Alhejji \& Smith [IEEE ISIT (2020)], which follows a conceptually different approach.

Variational quantum circuits have been central to many proposed near-term applications of quantum computing, but a growing body of evidence suggests that trainability and quantum advantage are fundamentally at odds: ansätze expressive enough to resist efficient classical simulation tend to exhibit barren plateaus, while structures that provably rule out barren plateaus typically render them classically simulable. We propose a stacked linear combination of unitaries (S-LCU) as a variational ansatz which provides a tunable trade-off between barren plateaus and classical simulability. Using a diagrammatic analysis, we bound the loss-landscape variance of the Free Fermion S-LCU, whose elements are fermionic Gaussian unitaries. We prove a variance lower bound of $Ω(1/(n k^{3l}))$, with a simulation cost of $O(k^{2l} n^3)$ using the best known classical algorithm, compared to a quantum gate complexity of only $O(lkn^2)$. The number of layers $l$ serves as a single dial that trades computational complexity against the rate of cost concentration. This offers practitioners a systematic method for constructing ansätze with a complexity-trainability trade-off that best suits their application and hardware.

Completely positive (CP) matrices are ubiquitous in modern science and technology with applications in optimization, graph theory, and quantum entanglement. Recently, Johnston \emph{et al.} [Linear Algebra and its Applications, 2022] have cast CP matrices into the framework of quantum resource theories, where CP states serve as free states and CP-preserving channels act as free operations. This work addresses several questions raised in their work. Specifically, we provide the necessary and sufficient conditions of CP-preserving channels in small dimensions, which are necessary in higher dimensions, and discuss the resource quantification via the trace distance of non-negativity. By constructing an explicit counterexample, we demonstrate that the trace-distance measure of non-negativity violates strong monotonicity. We also provide an alternative proof that every CPDNN channel $Φ:\MM_n\to \MM_2$ is CPCP. Additionally, we show that any unital CPDNN map $Φ:\MM_2\to \MM_n$ is also CPCP.

Grover's algorithm provides a quadratic speedup for searching unstructured databases and is traditionally implemented with qubits in Hilbert spaces whose dimensions are powers of two. With the advent of quantum platforms utilizing qudits---quantum systems with more than two levels---there is a need to generalize Grover search to these architectures, including heterogeneous systems with qudits of varying dimensions. Here, we present a unified framework for qudit-based Grover search, detailing the construction of oracles and diffusion operators with and without ancilla qubits and generalizing deterministic and fixed-point search variants that ensure exact or bounded success probabilities. We analyze phase-matching techniques and provide explicit circuit decompositions suitable for diverse hardware platforms. We also compare the corresponding trajectories on the Bloch sphere to provide an intuitive visualization of how the different phase choices amplify the target state. These results facilitate flexible, hardware-oriented protocols for implementing Grover search on qudit processors, potentially reducing circuit depth and enhancing success probabilities, thereby offering a practical toolkit for quantum computation and sensing applications leveraging multilevel quantum systems.

The simultaneous estimation of multiple parameters is a central task in quantum metrology, distributed sensing, and the calibration of large photonic interferometers. A fundamental question is how many independent parameter combinations can inherit Heisenberg scaling from a given number of squeezed probes in a multimode Gaussian network. Here, we answer this question for arbitrary passive linear optical networks. For a $p$-parameter, $M$-channel interferometer probed by $k$ single-mode squeezed states and at least one coherent state in the remaining channels, we show that the rank of the Heisenberg-scaling coefficient of the quantum Fisher information matrix is bounded by $n_{\rm HS}\le \min\{p,k(k+3)/2\}$, which corresponds to the maximum number of independent combinations of parameters that can be estimated with Heisenberg-scaling sensitivity. The bound separates into two geometrically distinct contributions. The covariance contribution of the quantum Fisher information, which describes squeezing-enhanced fluctuations, provides at most $k(k+1)/2$ parameter combinations estimable at Heisenberg-scaling sensitivity, while the first-moment contribution provides at most $k$ additional independent parameter combinations with Heisenberg-scaling sensitivity. We identify the conditions for saturating these bounds and construct a passive family of interferometers that saturates these bounds.

Residual dispersion breaks temporal-mode matching in photon-starved coherent links. For equiprobable $M$-ary PSK coherent states in a known spectral mode, with unknown symbols and carrier phase, we establish the quantum limit for blind joint estimation of group delay and second-order dispersion: after eliminating the common phase, it is $4N_s\mathbf{C}$, set by the covariance of the centered generators alone. A multi-output quantum pulse gate with photon-number-resolving detection locally attains it and supports reception below the standard quantum limit under turbulent fading.

Quantum networks can enable distributed computing and sensing. To realize these capabilities securely, quantum identity authentication is essential. Without authentication at the quantum layer, malicious repeaters may retain entanglement instead of performing swapping, enabling man-in-the-middle attacks (MitM) between communicating parties. Authentication mitigates this threat by embedding authentication qubits within data qubits at positions and bases based on a secret key shared a priori. While prior work analyzes security and MitM detection guarantees, physical layer side channel analysis remains unexplored. If an attacker infers protocol stages, it can avoid authentication qubits and extract data qubits, rendering authentication ineffective. To this end, we carry out experimental studies using a quantum communication testbed. A beam splitter is used to tap a portion of the optical signal, allowing the observer to collect side channel data without disrupting the quantum state. We evaluate two sampling settings, where 30% or 10% of the signal is diverted. The collected side channel data includes photon arrival timing and optical power data obtained using a single-photon detector and a power meter. Using this dataset, we extract and engineer features that capture both timing dynamics and signal intensity variations. We then train machine learning models to classify protocol stages based solely on side channel observations. Our results show that protocol-stage inference is feasible with high accuracy, reaching 98% (F1-score 97%) at 30% sampling and 96% (F1-score 94%) at 10% sampling. These findings reveal an overlooked vulnerability and highlight the need for robust designs against side channel inference attacks.

We use Krylov complexity as a typical diagnostic of quantum many body dynamics in the context of BMN matrix model at large mass gap. We calculate several physical entities, for example, the moments and return amplitudes at large mass deformation. We calculate them for both spread complexity of states as well as Krylov growth of operators in the matrix model. We propose a general expression for the moments at any given order $n$. We also discuss orthogonal polynomials for spread as well as operator Krylov complexity. In the context of the Krylov operator growth we further compute the spectral function and the density of states. A careful analysis of the spectral function near the resonance reveals various IR divergences in addition to the physical collective modes. These collective modes appear to be exceptionally stable due to large mass gap. On the other hand, the UV of the theory appears to be extremely damped due to higher scattering rates. We carefully diagnose these IR divergences near resonance which reveals that these collective modes are in fact non-propagating and should be thought of as diffusion modes or relaxation modes with infinite relaxation time. We also calculate the Krylov variance and Krylov entropy for the matrix model and in particular at early time. The linear early time growth of the Krylov entropy confirms the onset of quantum chaos in the matrix model at large mass gap.

Quantum communication is a key enabler of next-generation networks, leveraging quantum entanglement to enable a new class of information exchange. While prior work has focused on the theoretical analysis of communication protocols, their exposure to physical layer side channel analysis remains largely unexplored. In classical systems, side channel analysis has been shown to reveal sensitive information without accessing the underlying data, raising the question of whether similar risks exist in quantum networks. In this work, we investigate whether different quantum communication protocols exhibit distinguishable signatures that can be inferred through passive side channel observations. We consider a threat model in which an observer accesses only a fraction of the optical signal without directly measuring the encoded quantum states. Under this setting, we experimentally examine four representative protocols, namely entanglement distribution, quantum gate sequences, heralded quantum key distribution, and quantum identity authentication, realized on a polarization entangled photon link. Observable physical layer features, including single photon detection statistics and optical power measurements, are collected and used to construct protocol fingerprints. We develop a data-driven framework for protocol identification based on these observations. Our results show that protocol identity can be inferred with accuracy reaching up to 96% under 30:70 sampling configuration/optical tapping, while remaining distinguishable at 10:90 with accuracy ranging from 70-89%. Bell inequality measurements confirm that the sampling/tapping process preserves entanglement, validating the non-destructive nature of the observation model. These findings demonstrate that side channel analysis can expose protocol-level information without disrupting quantum correlations, introducing new security considerations.

Electronic decay processes provide a fascinating window into correlated electronic rearrangements occurring on ultrafast timescales. Following these dynamics in real time has become increasingly accessible experimentally, but extracting the underlying electronic dynamics from measured spectra requires understanding how nuclear motion shapes the observable signal. Here, we extend an analytical description of time-resolved electronic decay spectra to include dissociative nuclear dynamics and apply it to Interparticle Coulombic Decay (ICD) in the neon dimer. The resulting spectra reproduce the experimentally observed spectral shape and reveal an unexpectedly important role of interference between pathways involving different vibronic resonance states. We further establish a clear connection between the temporal build-up of the spectral structure and the nuclear wavepacket dynamics in the decaying electronic state. Most strikingly, our analytical expressions reveal that the time-dependent integrated ICD signal contains contributions proportional to both $\exp(-t/τ)$ and $\exp[-t/(2τ)]$. Nevertheless, a conventional mono-exponential fit can describe the temporal signal remarkably well while yielding a decay lifetime that differs substantially from the underlying value. Applying the theoretically derived fitting model to experimental data for the neon dimer yields an ICD lifetime $τ$ of 73 fs, rather than the previously extracted 150(50) fs, placing the experimental value within the range of previous theoretical predictions. Since the underlying temporal structure is common to electronic decay processes, our findings have implications for extracting lifetimes from time-resolved decay spectra well beyond ICD.

The Traveling Salesman Problem is a classical NP-hard problem with significant implications in logistics, circuit design, and operations research. This paper presents a comparative study of four approaches to solving the Traveling Salesman Problem: brute-force enumeration, a 2-approximation algorithm using minimum spanning trees, simulated annealing, and the Quantum Approximate Optimization Algorithm. We implement each technique and evaluate them on graphs of varying sizes to analyze performance, solution quality, and scalability. In doing so, we have also developed an open-source framework that allows researchers and practitioners to explore, test and extend these methods.

Entanglement distillation and entanglement swapping have been extensively studied assuming perfect quantum memories. However, near-term quantum networks will be fundamentally limited by quantum memories with a finite coherence time, resulting in complex choices for the timing and ordering of these operations. In this work, we study entanglement distillation and entanglement swapping at the level of the elementary building blocks of noisy quantum repeater networks, with the goal of elucidating the fundamental tradeoffs induced by memory decoherence. First, we focus on a minimal one-hop setting, where we analytically compare ``distill-as-soon-as-possible'' and ``distill-as-late-as-possible'' strategies against a baseline strategy that simply discards the older entangled state. We find that in the low memory coherence time regime, discarding the older entangled state achieves higher expected output fidelity, while in the high coherence time regime, delaying distillation until the end achieves the highest expected output fidelity and, over most of the deadline range, the highest weighted coherent information, at the expense of a lower success probability. We then extend our analysis to two-hop repeater chains using Monte Carlo simulation. In this setting, we find that the highest weighted coherent information is achieved by strategies that defer distillation to the end of the time window, with \textsf{Distill-ALAP-then-Swap-ALAP} and \textsf{Swap-ASAP-then-Distill-ALAP} leading at different operating points, while \textsf{Discard-Oldest-then-Swap} never reaches positive weighted coherent information in any regime tested. Together, these results clarify how decoherence reshapes the optimal operation timing in quantum networks and provide instructive insights into the link-level principles that govern larger-scale architectures.

We investigate thermal quantum correlations in a system of two coupled superconducting spin qubits described by an effective Andreev spin-qubit Hamiltonian in the presence of spin-orbit interaction. Using Local Quantum Fisher Information (LQFI) and Local Quantum Uncertainty (LQU) as quantum-correlation quantifiers, we analyze the effects of the superconducting phase difference, tunneling amplitude, spin-orbit coupling, and temperature on the nonclassical properties of the system. Analytical expressions for the thermal density matrix are obtained and employed to evaluate both quantities. Our results show that quantum correlations decrease monotonically with increasing temperature, while stronger tunneling and spin-orbit interaction significantly enhance their robustness. Moreover, the superconducting phase introduces a pronounced periodic behavior through the modulation of the effective exchange couplings, leading to constructive and destructive interference regimes that strongly influence the correlations. By analyzing the energy spectrum of the effective Hamiltonian, we demonstrate that the enhancement of quantum correlations is closely associated with an increased energy gap between the ground and first excited states, which suppresses thermal excitations and stabilizes the correlated ground state. Furthermore, LQFI is consistently larger than LQU throughout the investigated parameter space, reflecting its higher sensitivity to quantum fluctuations and local parameter estimation. These findings reveal the microscopic mechanism governing thermal quantum correlations in Andreev spin qubits and highlight the important roles of phase engineering, spin-orbit interaction, and tunneling in protecting quantum resources in hybrid superconducting quantum devices.

To achieve translational symmetry for the computation of the band structure of a lattice model, one can either consider an infinite lattice or impose periodic boundary conditions. While in sys- tems with short-range couplings these two approaches are equivalent, we show that for long-range couplings one can obtain considerably different results. We compare the two methods on the basis of one-dimensional quantum emitter chains both in free space and when coupled to a waveguide. The latter system allows for asymmetric couplings enabling the non-Hermitian skin effect, which we analyze using the two different band-structure calculation methods. We find that only periodic boundary conditions lead to physically and mathematically robust results, while the infinite-chain approach entails convergence issues and is unable to satisfyingly explain the emergence of the non- Hermitian skin effect in the waveguide system. In addition, the waveguide system yields unusual findings like a non-star shaped generalized Brillouin zone and strongly localized eigenstates with zero winding number.

We study the task of estimating a $d-$dimensional quantum state $ρ$ under the constraint that the measurement is $α-$gentle. Such measurements $M$ do not collapse the state; they issue both a random variable $R^M = ω$ containing statistical information and a post-measurement state $ρ_{M \to ω}$ such that $\|ρ_{M\to ω} - ρ\|_{Tr} \leq α$. We describe gentle measurements and their connection to quantum differential privacy. Our results show that the optimal minimax estimation rate in Frobenius norm is of order $d^3/(n α^2)$, instead of $d^2/n$ for general measurements. Moreover, for rank $r$ states with $r\leq d$ we prove that the optimal minimax rate is $rd^2/(n α^2)$, instead of $rd/n$. Very surprisingly, the loss for gentleness $d/α^2$ scales with the ambient dimension of the Hilbert space, rather than the number of parameters $rd$, typically seen in classical differential privacy. We propose optimal gentle measurements and indicate how they can be physically implemented using an ancillary state and a CNOT gate to entangle it with the initial state. We notice that the resulting random variable has a likelihood that satisfies local differential privacy. Lower bounds are proven through a new quantum information-theoretic inequality applied to well chosen families of states in the manifold of (small-rank) quantum states.

I construct a Bohmian version of a 2-state quantum system, where in addition to the quantum state, the system is characterized by a definite physical state which changes stochastically under the guidance of the quantum state. I argue that the probabilities produced by this process are well-defined, contrary to claims in "Why quantum mechanics cannot be formulated as a Markov process" by D. Gillespie (1994) about a related model.

We solve the two-copy distillability problem for Werner states in every local dimension. Our main matrix result is a sharp, dimension-free inequality: for every rank-at-most-two operator, the sum of the squared Hilbert--Schmidt norms of its two partial traces is bounded by twice its squared Hilbert--Schmidt norm plus one half of the squared modulus of its trace. This implies that a Werner state $ρ_α$ is two-copy distillable if and only if $α<-1/2$. In particular, the two-ququart state $ρ^{(4)}_{-1/2}$ is two-copy undistillable, resolving Problem 5 of Horodecki, Rudnicki, and Życzkowski. For an arbitrary finite number $k$ of copies, we give three exact formulations of the remaining problem. At the endpoint $α=-1/2$, undistillability is equivalent to nonnegativity of the endpoint partial-trace form on every rank-at-most-two operator. We also derive an equivalent hierarchy of operator inequalities $H_k(ψ)\succeq0$ for pure states with a maximally mixed qubit marginal. The two-copy proof does not formally induct, because partial trace can increase rank and $2$-positivity is not generally preserved by tensor products. We prove two rigorous many-copy extensions. First, the quadratic form factorizes exactly on tensor-factorized witnesses; for any such decomposition, the endpoint inequality holds if its possible rank-two factor is supported on a block containing at most two copies. Second, we construct explicit constants $γ_k>0$ such that $α\ge-γ_k$ implies $k$-copy undistillability in every dimension. The initial proofs were generated by ChatGPT 5.6 Sol; the authors have verified and rewritten them to enhance readability and provide additional context.

The physical foundation of the mathematical formalism of quantum theory is still an iffy mystery. Here it is presumed that a physically reasonable mathematical model needs only three basic features. The first one are the transition probabilities, which are so typical of quantum theory. The other two constitute a variation of the postulate that continuous reversible dynamical processes exist and act transitively on the underlying space. One class of mathematical models with these features arises from the atomic JBW factors, which include the atomic von Neumann factors and become identical with the Jordan matrix algebras, when the dimension is finite. A further model is known, on which the exceptional Lie group E6 acts transitively. Interestingly, E6 is sometimes considered a candidate for internal symmetries in particle physics, but many familiar features of quantum theory get lost in this case (particularly the general existence of post-measurement states). The paper concludes with some open issues, concerning this problem and the classification of the mathematical structures with the three features.

We propose an average-current interferometer for the directional causal response of fractional quantum Hall edges. Three coherent quantum point contacts (QPCs) form a flux-enclosing loop, so the leading Aharonov-Bohm harmonic is cubic in tunneling. Interference between a direct transfer and a coherent two-step path resolves downstream and upstream propagation. For a local Laughlin edge at $ν=1/m$, the upstream coefficient vanishes exactly, while the downstream amplitude scales as $E^{3ν-2}$. A weak finite-range nonlocal density interaction spanning the tunneling points activates the upstream coefficient without creating an upstream mode. At low temperature and unresolved delay, its amplitude scales as $E^{2ν-1}$ and its aligned phase relative to the downstream reference is $-π(1-ν)/2+χ_a$ modulo $2π$, with $χ_a=0$ or $π$. Opposite cyclic voltage orderings isolate the two directions, while a folded same-filling Laughlin edge with a neutral weak link realizes a sign-tunable bridge. For a general Abelian edge, the device probes the directional content of the selected tunneling vertex. If $δ_\pm$ are its downstream and upstream weights, its nonzero directional amplitudes scale as $E^{3Δ_\ell-2}$, with $Δ_\ell=δ_++δ_-$, and obey $A^u_\ell/A^d_\ell=|\sin(πδ_-)/\sin(πδ_+)|$. When both are nonzero, positive-flux alignment gives, after removal of a known fixed sign, the relative phase $πΔ_\ell=2πh_\ell$. In the same-vertex coherent unresolved-flight regime, the scaling dimension and directional ratio determine the exchange angle $θ_\ell=π(δ_+-δ_-)$ modulo $2π$. The Aharonov-Bohm flux frequency additionally gives the charge, enabling separate extraction of quasiparticle charge, scaling dimension, and exchange angle.

Recent work introduced Interval Quantum Mechanics (IQM), a finite-precision framework in which physical information is represented by sets of possible states rather than exact states. We extend this approach to algebraic quantum field theory (AQFT) by introducing Interval Algebraic Quantum Field Theory (IAQFT), whose basic objects are quantum parcels: weak* open convex regions of state space encoding finite-precision information obtained from finitely many local observations. We develop parcel reduction and measurement update, establish finite-dimensional information-contraction results, and formulate locality through compatible parcel nets. Major structural features of AQFT are recast in parcel-theoretic terms, including the Reeh--Schlieder property, Haag's theorem, modular theory, the KMS condition, and the Unruh effect. We show that spacelike vacuum correlations and strict Bell violations persist under finite precision, and that lattice approximations are compatible with the parcel framework. Finally, we recover the Murray--von Neumann classification of factors together with the trace and projection equivalence in Type~$\mathrm{II}_1$ factors from the geometry of limiting parcels. IAQFT thus provides a unified finite-precision formulation of the operational, modular, and operator-algebraic structures of relativistic quantum theory.

We study the metrological properties of a continuously monitored Kitaev chain in the presence of imperfect detection. The system is conditioned on a no-click record, while each emitted fermion is registered only with probability $0\leq q\leq 1$. Because the conditional dynamics remains Gaussian, the steady state is fully characterized by the fermionic correlation matrix. This allows a direct evaluation of the quantum Fisher information and of the mean Uhlmann curvature. For perfect detection, the monitored steady state retains a singular critical structure and the quantum Fisher information with respect to the chemical potential becomes super-extensive. For any $q<1$, imperfect detection introduces a finite smoothing length that rounds the singularity and restores extensive scaling. The detector efficiency behaves instead as a compatible mixed-state estimation parameter, as signaled by the vanishing mean Uhlmann curvature. These results show that incomplete trajectory information destroys the metrological enhancement associated with monitored criticality through a mechanism that differs from ordinary thermal smearing.

Full-counting statistics (FCS) provides a systematic framework for characterising current fluctuations in quantum transport, quantum optics, and open quantum systems. We introduce QuantumFCS.jl, an open-source Julia package for efficient and flexible numerical FCS calculations. The package defines currents through monitored jump operators and weights, allowing particle, electric, and heat currents to be treated within the same workflow. It implements a recursive cumulant algorithm with dense, sparse, and iterative solver backends, making it suitable for models that are challenging for direct dense methods. We demonstrate the package on photon counting in a driven-dissipative Jaynes-Cummings system near the blockade-breakdown phase transition and on heat-current fluctuations in a non-linear circuit-QED heat engine. These examples show how higher cumulants reveal intermittency between bright and dim emission, antibunching, and provide probes of thermodynamic uncertainty relations. Benchmarks against an existing FCS implementation show substantial speed-ups.

We study the dynamics of open quantum systems driven by an external time-periodic force. Combining Floquet theory and the time-convolutionless projection operator technique we derive a time-local quantum master equation which exactly takes into account the periodic driving, while treating the system-environment interaction within second order in the coupling strength without performing the Markov approximation. The resulting equation of motion for the reduced density matrix is called Floquet time-convolutionless master equation. Employing the example of the driven spin-boson system, we demonstrate that this master equation is capable of describing strong non-Markovian effects, while yielding the Floquet-Lindblad master equation in the Markovian limit. A characteristic feature of memory effects in such driven dissipative systems is the emergence of sharp peaks of the trace-distance based non-Markovianity measure as a function of the driving amplitude, which can be traced back to quasienergy crossings leading to almost decoherence-protected subspaces through a quasienergy-induced dissipative decoupling mechanism.

We present a compact and unified framework for quantum-information diagnostics of time-dependent two-mode bosonic systems based on the Bogoliubov ratio $λ_k(η) \equiv β_k(η)/α_k(η)$. For a general time-dependent quadratic two-mode Hamiltonian, the state dynamics is exactly reduced to a single complex Riccati equation for $λ_k$. Upon tracing out one partner mode, the spectrum of the one-mode reduced density matrix is determined entirely by the squared magnitude $q_k(η) = \vert{}λ_k(η)\vert{}^2$. Consequently, we could construct the explicit, model-independent formula for the for the reduced-state purity, linear entropy, Rényi-2 entropy, and von Neumann entropy without reconstructing and diagonalizing the reduced density matrix on a model-by-model basis using coupled squeezing parameters ($r_k, φ_k$). We demonstrate the utility of this framework in two distinct non-stationary setups: primordial cosmological perturbations and a chirped-pulse nondegenerate optical parametric amplifier. In the cosmological context, our formulation clarifies how background-induced phase rotation and frequency softening regulate squeezing growth and state mixedness; in the optical domain, it captures the delayed onset, suppression of squeezing accumulation, and late-time entropy saturation induced by finite pump duration and frequency chirp. By cleanly factorizing model-dependent driving protocols from universal information-theoretic metrics, this framework offers an efficient, standardized diagnostic tool for a broad class of parametrically driven quadratic bosonic systems.

Multivariate time series forecasting (MTSF) predicts future values of multiple variables from historical data. While quantum neural networks have been increasingly applied to this task, they typically rely on fixed local measurements, which restrict their expressivity. We propose MTSF-ANO, a simple hybrid model for MTSF that integrates variational quantum circuits with adaptive non-local observables (ANO). On the four ETT datasets, MTSF-ANO ranks first or second in MSE in 17 of 20 settings, improving over the strongest baseline by up to 20% on ETTh1, and outperforms or matches its fixed local observable counterpart across all settings. Our ablations show how the quantum circuit design and ANO non-locality affect performance. These results suggest that ANO is a promising direction for quantum time series forecasting.

We explore the use of waiting-time statistics in a quantum electron shuttle for electric-field sensing. Electron shuttles convert nanomechanical motion into charge transport, showing a noise-broadened crossover between stochastic tunneling and mechanically assisted charge transfer. This allows investigation of how transport fluctuations encode electromechanical parameters. Using a single-level quantum shuttle in strong-Coulomb-blockade and high-bias regimes with a Markovian quantum master equation, we analyze stationary dynamics in phase space and waiting time distributions. By estimating the electromechanical coupling, proportional to the electric field, we evaluate the classical Fisher information in waiting times and compare it with the quantum Fisher information of the stationary state. We relate the metrological response to mean waiting time, variance, and Fano factor. Our results show that the crossover from tunneling to shuttling is characterized by enhanced fluctuations and increased parameter sensitivity, leading to a pronounced enhancement of the Fisher information.

We propose a fast laser pulse sequence for the generation of non-thermal Fock state mixtures of the motion of a trapped ion, targeted at displacement metrology beyond the standard quantum limit. Using a polaron-frame description of the ion-laser interaction, we identify a resonant operating point-zero detuning and a Rabi frequency matching the trap frequency-at which selective population trapping survives strong driving, enabling preparation speeds beyond the weak-driving limit of previous protocols without requiring ground-state cooling. We trace the residual infidelity at large Lamb-Dicke parameter $η$ to a single coherent process, the counter-rotating blue-sideband term neglected in the rotating-wave approximation, and show that it is suppressed by two routine calibrations: a percent-level refocusing of the pulse duration and a small compensating Bloch-Siegert detuning. Numerical simulations of the full sequence show that this refinement keeps the preparation error at or below the $10\%$ level up to $η\approx0.5$ and restores the displacement-sensing Fisher information that the uncorrected protocol loses at strong coupling, recovering up to 9 dB relative to the nominal sequence.

Problem 5 in {\it Five Open Problems in Quantum Information Theory} [PRX Quantum 3, 010101 (2022)], asks whether the two-ququart Werner state $\varrho(4,-\tfrac12)$ is two-copy distillable, where $\varrho(d,α)=(I+αF)/(d^2+αd)$. We answer it in the negative. To this end, we show the following stronger statement: for all $C\in M_{d_1d_2}(\mathbb{C})$ of rank at most $r \le d_1 d_2$, $\mathrm{tr}_1(C)\|_F^2+\|\mathrm{tr}_2(C)\|_F^2 \le r\|C\|_F^2+\frac{1}{r}|\mathrm{tr}(C)|^2$. A result by Costa Rico on the equivalence of this inequality with two-copy undistillability at $r = 2$ then settles Problem 5: $\varrho(4,-\tfrac{1}{2})$ is not two-copy distillable. Furthermore, we show that $\varrho(d,α)$ is two-copy undistillable for every $d\ge2$, if and only if $α\ge-\tfrac{1}{2}$. Thus, the one and two-copy distillability regions of $\varrho(d,α)$ coincide. These results have been found and written up with AI tools, pointing towards a structural change affecting the field of quantum information and computation.

We present an all-to-all quantum-level crosstalk characterization of a commercial 16x16 MEMS optical switch for multi-user quantum communications using SNSPDs, correlating experimental data with a theoretical impact analysis on the decoy-state BB84 QKD protocol.

Quadratic unconstrained binary optimization (QUBO) has emerged as a powerful framework for medical computing problems. Binary decision variables naturally represent clinical choices, making QUBO formulations well-suited for quantum annealing hardware. However, a fundamental scalability challenge limits practical deployment: problem size grows rapidly with input dimensionality, creating computational bottlenecks that restrict applications to simplified scenarios. This paper addresses this challenge through hierarchical problem reduction, as demonstrated in medical image segmentation, where pixel-level QUBO formulations create over 65,000 variables for a 256x256 image, forcing existing approaches to downsample to 42x42 resolution and discard 97% of pixel information. A superpixel-based QUBO framework is proposed using simple linear iterative clustering (SLIC) to group pixels into perceptually meaningful regions, then formulate segmentation as QUBO over a region adjacency graph (RAG) combining min-cut and smoothness objectives. Validation on INbreast mammography breast cancer images demonstrates a 4.2% improvement in segmentation quality (mean IoU 0.76 vs 0.73) with 33 computational speedup (0.67s vs 21.97s) and a 97.3% reduction in problem size (1764 to 48 variables), all achieved while processing full-resolution images rather than downsampled versions. The reduced problem size also fits well within current quantum annealer connectivity limits, removing the embedding overhead that has historically blocked direct deployment of pixel-level QUBO segmentation on quantum hardware.

Pre- and post-selection (PPS) paradoxes are striking demonstrations of quantum nonclassicality. Logical PPS paradoxes, where inferences made with the Aharonov-Bergmann-Lebowitz (ABL) rule are exactly 0 or 1, are linked to contextuality. Non-logical paradoxes lack this strong signature. In this work, we analyse more general, non-logical PPS scenarios involving mixed pre- and post-selected states. We show that two such scenarios, the $N$-box and quantum pigeonhole paradoxes, require coherence of both pre- and post-selected states in the basis of the intermediate measurement. This is done by showing each paradox holds if and only if there is weak-value anomaly for a single, paradox-specific operator, together with the fact that weak-value anomaly requires coherence. This clarifies the role of different notions of nonclassicality in these scenarios, highlighting the required quantitative departures from (strictly) classical explanations provided by incoherent sub-theories of quantum theory.

Quantum computers are more widely available than ever, making the field more accessible and widespread. Practitioners are coming from a wide range of domains, conducting experiments and research using quantum computing approaches across a variety of problems. The current literature suggests that developers follow certain methodologies in quantum software development, often with a matching set of tools provided. Yet with the novel paradigm, there are areas that remain unaddressed in practices and tools. In this article, we go into the details of experiment tracking in quantum software development. We explain the basic concept of experiment tracking and detail how, in essence, quantum computing sets demands on tracking practices. Given the experimental state of hardware and the constantly evolving software, quantum execution must be monitored, marginal gains aggregated for the best outcome, and error sources detected. In our case study, quantum reservoir computing for chaotic time series data prediction with error mitigation, we present a detailed quantum software development process and describe how experiments can be tracked throughout development. We then generalize this knowledge into the broader quantum development process.

The development of techniques for simulating quantum systems using classical computers is a paramount task for two primary reasons: i) there exist configurations for which classical computers are remarkably effective and will continue to be so, and ii) exploring the limits of classical computation facilitates the identification of the regimes of competence for quantum computers. In this work, we present MPStab, a quantum circuit simulator based on a hybrid formalism combining stabilizers and tensor networks, recently introduced in Ref. [1]. We present the package, its core functionalities, and explore its performances in a few interesting simulation regimes.

Exact synthesis is a useful tool in quantum compilation by providing optimal alternative implementations of small circuit shards and is widely used as a circuit re-synthesis optimization kernel. However, existing exact synthesis methods suffer from encoding overhead, poor parallel scalability, and memory bottlenecks. This paper introduces a parallel exact synthesis framework for CNOT and phase polynomial circuits, which is based on the semi-tensor product (STP) theory of matrices. By enumerating undirected partial-gate topologies and solving the missing gate directions separately, we are able to parallelize both stages and achieve a parallel speedup of up to $12.8\times$ with 32 workers on this NP-hard problem. More specifically, for each topology, the circuit semantics are converted into canonical STP formulas, and feasibility is decided by a right-to-left factorization procedure that removes infeasible direction assignments. On randomly generated synthesis targets, STP is typically $100\times-1000\times$ faster than the SAT-based baseline on small instances, and remains competitive for more difficult instances. When integrated in a real-world circuit optimization workflow, our algorithm outperforms the SAT-based approach on 89% of cases in QASMBench, and achieves a median speedup of $1.91\times$.

We propose a four-terminal, X-shaped chiral Majorana interferometer with a central floating superconducting island, enabling the direct detection of the non-Abelian statistics of Ising anyons via the linear-response DC conductance tensor in charge transport experiments. Here, Ising anyons are realizable as edge vortices nucleated at Josephson line junctions defining the superconducting island, where both edge-vortex and Majorana-fermion tunneling processes can occur. We show that in such a multi-terminal Majorana interferometer, both the vacuum and the fermionic fusion channel for Ising anyons are possible. This is in contrast to two-arm interferometers, where only the vacuum fusion channel is accessible and the DC conductance contribution from edge vortices always vanishes. Using a low-energy effective theory derived via chiral bosonization, we find that in the X-shaped interferometer, the DC conductance tensor is completely isotropic, yielding a non-zero conductance when simultaneous edge-vortex and Majorana tunneling activates the fermionic fusion channel. Apart from conductance oscillations in a gate-tunable charge parameter, which display an offset related to the anyon topological spin, measuring a finite conductance can already provide direct evidence for non-Abelian statistics in this geometry.

We study a dimension-saturating fixed-core ansatz in which four copies of a fixed, non-tunable two-qutrit core $K\in SU(9)$ are interleaved with five adjustable local layers from $L=SU(3)\otimes SU(3)$. Since $\dim SU(9)=80$ and $5\dim L=80$, this is the shortest fixed-core architecture not excluded by parameter counting. We formulate the smooth map $Φ_K:L^5\to SU(9)$ and use its right-trivialized differential to give verifiable certificates for local universality. We construct an explicit Clifford-word core whose Pauli-label splitting makes the identity-point differential an exact isometry, and we classify all 2304 symplectic actions satisfying the same splitting criterion. We also prove a structural obstruction for an important symmetry class: every complex-symmetric core $K=K^{T}$, including every core generated by a time-independent real-symmetric Hamiltonian in the chosen computational basis, has identity-point differential rank at most 78; hence any full-rank certificate for such a core must occur away from that point. We then assess a hardware-motivated superconducting core generated by a noncommuting, temporally asymmetric drive. Direct calculation verifies $K_{\rm sc}\neq K_{\rm sc}^{\mathsf T}$, and the core achieves $F_{\rm avg}\ge 0.999$ for all 1000 Haar-random targets tested under the stated restart protocol. We also report favorable sampled Jacobian-rank, structured-target, and robustness diagnostics. These results establish local universality at the parameter-counting-minimal, dimension-saturating depth, with an exact Clifford certificate complemented by a hardware-motivated numerical case study. Throughout, we separate exact local certificates from numerical evidence for broader synthesis performance.