Papers

I formulate unresolved soft-photon sector of QED as open quantum system. Resolved charged particles and hard photons form the system, unresolved soft photons form the environment, and basic object is the reduced density matrix. A resolved outcome $f$ of multiple hard particles and photons has probability $P_{f}(i) =\sum_n|\langle f,n|S|i,0\rangle|^2=\langle i|F_f|i\rangle$, with Kraus operators $K_n= {}_{\rm soft} \langle n|S|0 \rangle_{\rm soft}$ and effect $F_f=\sum_nK_n^\dagger\Pi_fK_n$. The SK formulation places unresolved virtual and real terms in one doubled-contour expansion. At one loop they carry the same on-shell eikonal kernel with opposite signs. This elegantly organizes the QED probability: for the same observable, perturbative order, diagrams, and phase space, the OQS gives the same infrared-finite terms as the full-QED. The soft-photon evolution is a unitary coherent-state displacement driven by the scattering current. The equal-history identity of influence functional exactly normalizes this soft evolution; together with the soft-photon theorem it removes the IR divergent leading-soft factor from inclusive probability. I also derive explicit leading-soft QED realization of scale-parametrized Lindblad evolution on a fixed hard-branch space. Tracing an infinitesimal soft-photon shell produces diagonal jump operators whose entries are fixed by the corresponding eikonal emission amplitudes. The finite-shell map is a completely positive unital Schur channel and, in the sharp scale-invariant leading-soft regime, a dephasing semigroup of a completely-positive-divisible scale flow. The resulting logarithmic visibility slope and monotonic purity loss are off-diagonal predictions of the reduced-state description. The same controlled-displacement dilation gives the Sudakov probability, Poisson soft-photon multiplicities, and the bremsstrahlung number spectrum.

The method of types is a fundamental tool in classical information theory, with applications ranging from composite hypothesis testing and universal source coding to the capacity of arbitrarily varying channels. In this work we introduce an empirical operator acting as a quantum analog of the empirical distribution. We show that this empirical operator satisfies combinatorial and large-deviation bounds, which in combination describe a quantum method of types. As an application, we use our method to prove a universal achievability result for composite quantum hypothesis testing.

Photonic quantum metrology has demonstrated advantages in precision and resource efficiency for a wide range of applications, with several schemes approaching the fundamental quantum Cramér-Rao precision bound (QCRB). However, the intrinsic incompatibility of quantum measurements represents a hurdle in extending these advantages to the simultaneous estimation of multiple parameters. In this paper, we present an experimental protocol approaching the QCRB simultaneously in two polarisation parameters, across a wide range of the parameter space, with as few as $\sim 200$ photon pairs, offering advantages for polarimetric sensing for dim sources such as in X-ray astronomy or photosensitive samples.

Non-Hermitian Hamiltonians are a fascinating class of many-body models that describe the effective dynamics of quantum systems interacting with the environment through particle, energy, or information exchange. Although their theoretical framework is well established, the controlled engineering of such Hamiltonians in the context of quantum simulations remains challenging, even more so when the non-Hermitian part describes a $k$-body interaction. Qudit quantum simulators offer a compelling framework to implement such models. We theoretically investigate the dynamics of a one-dimensional chain of qudits undergoing hybrid unitary-projective evolution, where suitably designed measurements constrain the dynamics to a Zeno subspace. As we illustrate for the case of qutrits, within the Zeno subspace the dynamics is governed by an effective non-Hermitian Hamiltonian for an ensemble of pseudo-spins $1/2$, which can inherit non-Hermitian two-body interactions with the same connectivity as the full qutrit chain. We derive an analytical relation linking the monitored qutrits' evolution to a desired target non-Hermitian Hamiltonian and validate the effective description through numerical simulations of a representative model. Our scheme provides a constructive route for the realization of a large class of interacting non-Hermitian many-body Hamiltonians in experimentally relevant multilevel quantum platforms, including trapped ions and superconducting circuits.

Infrared singularities of gapless Goldstone modes preclude magnetic long-range order at finite temperature in conventional two-dimensional systems. By studying the spin-$S$ Heisenberg model on regular tilings of the hyperbolic plane, we show that this obstruction is absent in negatively curved space. Using spin-wave theory, we find that the zero-energy collective modes required by symmetry carry vanishing local spectral weight and are separated from the thermodynamic bulk magnon continuum by a finite gap in the bulk local spectral density. As a result, local transverse correlations remain short ranged, with a finite correlation length, despite the presence of Goldstone modes associated with the broken SO(3) spin-rotation symmetry. Stronger negative curvature is found to suppress quantum fluctuations in bulk thermodynamic quantities, pushing the ordered state toward "mean-field-like" behavior. We further estimate the ordering temperature from the thermal spin-wave correction to the ordered moment. These results establish hyperbolic geometry as a route to finite-temperature magnetic order that circumvents the Mermin-Wagner obstruction without breaking or modifying the continuous symmetry.

Superconductor digital electronics and quantum computing with superconducting qubits are promising next-generation computing technologies. When cooled down or operated in the presence of a nonzero background magnetic field $B_r$, superconducting thin films comprising the circuits can trap magnetic vortices that can degrade circuit or qubit performance. In this work, we report a practical solution for eliminating flux trapped during cooldown in ambient magnetic fields, $B_r\leq 60$ $\upmu$T, based on controlled local thermal gradients and moats, etched holes in the superconducting films of the circuit. Thermal gradients created by integrated on-chip resistive heaters move vortices towards the moats, where they become trapped away from circuitry regions and pinning sites. Using magnetic imaging and electrical circuit readout, we demonstrate that this approach is capable of removing magnetic flux trapped during field cooling and magnetic flux nucleated by circuit operation. If used in an environment with basic magnetic shielding, this solution is capable of suppressing all magnetic flux in a large-scale circuit, overcoming one of the long-standing challenges preventing high-performance scalable computing using superconductors.

We study a quantum autoencoder (QAE) for compression-driven anomaly detection in brain MRI data. The approach leverages angle encoding to map image patches into quantum states, followed by a variational encoder-decoder architecture trained to discard information via auxiliary trash qubits. Anomaly scores reflect the degree to which inputs resist compression relative to normal data, with higher scores corresponding to deviations from the learned normal manifold. Evaluated on publicly available brain MRI DICOM datasets, the method achieves a slice-level ROC-AUC of approximately 0.95 and a patch-level ROC-AUC of approximately 0.813, outperforming classical autoencoder and PCA baselines. Analysis of the learned parameters reveals a pronounced encoder-decoder asymmetry, where effective anomaly detection arises from structured information compression within the encoder rather than increased parameter magnitude or decoder expressivity. This results in a controlled compression-reconstruction trade-off with a clear operating regime that supports principled threshold selection. Qualitative evaluation further shows that the QAE produces spatially localized anomaly heatmaps aligned with tumorous regions. The results, supported by promising baseline performances, demonstrate that quantum autoencoders provide an interpretable and controllable mechanism for anomaly detection based on incompressibility with respect to a learned latent representation. This work highlights the potential of quantum autoencoders as a principled tool for studying compression dynamics in quantum machine learning, with promising implications for decision support in medical imaging workflows.

A quantum battery charged through a lossy intermediate state faces a structural trade-off between charging speed and dissipation. We show that an exact algebraic cancellation removes it in a driven three-level cell: the radiatively decaying state is fed by a single bright amplitude, and a counterdiabatic field annuls the lone residual source that drives it, holding the lossy state identically empty. Charging is then lossless – not one photon is emitted through the bridge – at any one-photon detuning, coupling, linewidth, and speed down to the rotating-wave limit, with no adiabatic elimination, so the charging power is bounded by the drive amplitude (a quantum speed limit) rather than by dissipation. Crucially, this losslessness is independent of the reservoir: because the dark sector never engages the system-bath coupling, the emission vanishes exactly for an arbitrary spectral density, Markovian or not, as an exact damped-pseudomode treatment confirms to machine precision across all memory times. The entire non-Hermitian structure – a Markovian second-order exceptional point that reservoir memory promotes to a third-order one, and the attendant dissipation phase diagram – lives in the bright sector, from which the protocol is by construction exempt. This inverts dissipation-engineered charging, where an exceptional point or reservoir memory is a resource; here the lossy sector is never populated at all. The same dark-state structure protects the stored charge, converting fast radiative self-discharge into the slow metastable lifetime, with residuals quadratic in the control error. We detail experimental requirements and representative parameters for neutral alkaline-earth atoms, trapped ions, transmons, and defect centers.

We introduce a surface-code cultivation protocol for reusable logical catalyst states that implement exact fine dyadic phase gates $Z^{2^{-b}}$ by phase kickback. The catalyst is an eigenstate of a high-period Clifford circuit $U$, with a direct construction supported on $O(2^b)$ logical qubits. Once cultivated, each invocation implements the target phase through a controlled-$U$ gadget, removing Clifford+$T$ synthesis approximation error from the online gate and making the online non-Clifford depth independent of the target logical accuracy. As a concrete demonstration, we construct a catalyst for $\sqrt{T}=Z^{1/8}$, where $U$ is a nine-qubit brickwork Clifford circuit and controlled-$U$ consists of eight controlled-CNOTs. Starting from nine distance-three rotated-surface-code blocks, we cultivate the catalyst through logical-$U$ checks, syndrome extraction and postselection, code growth, and complementary-gap decoding. Due to the intrinsic fault tolerance of the phase read-out, a single verification round already reaches the leading error-corrected scaling, in contrast to the repeated logical checks required when cultivating single-qubit magic states. A hybrid tensor-network and stabilizer simulation shows that, at physical error rate $p=10^{-3}$, the postselected catalyst can be grown to distance-seven rotated-surface-code blocks with logical leakage rate $\sim 10^{-6}$ using around seven expected attempts, and can be suppressed further with stronger postselection. Compared with existing protocols, our approach trades offline, phase-specific catalyst cultivation for exactness, reusability, and constant-depth online implementation of fixed fine dyadic phases in codes with restricted transversal gate sets.

The dynamics of local subsystems in a thermodynamically large quantum many-body system can be understood as effectively open as the system produces its own effective bath. The action of this bath can be characterised in terms of the so-called influence matrices. In generic situations, the complexity of these objects grows unfavourably with time, however, there exist solvable cases where influence matrices can be characterised exactly even in the presence of non-trivial interactions. Here we show that Rule 201, a deterministic version of the Floquet-PXP model, is one of these solvable instances. Indeed, it admits influence matrices given by a finite-dimensional matrix-product operator (MPO) that solves a finite set of algebraic conditions. We provide the solution, and characterise multi-time autocorrelation functions.

Fermionic time-reversal-invariant insulators in two dimensions–class AII in the Kitaev table–come in two topological phases. These phases are characterized by a $\mathbb{Z}_2$-valued invariant, the Fu-Kane-Mele index. We prove a geometric bulk-edge correspondence for curved interfaces: if two such insulators occupy complementary regions separated by a curved boundary, then the $\mathbb{Z}_2$ edge index of the interface system is the product, modulo two, of the difference of the two bulk $\mathbb{Z}_2$ indices and a geometric intersection number associated with the boundary and the measurement region. The argument is a $\mathbb{Z}_2$ analogue of the curved-interface connection formula proved for Hall insulators in \cite{DZ24}.

In this paper, we introduce a novel two-way quantum key distribution (QKD) protocol in which the sender (Alice) and receiver (Bob) employ one qubit of a maximally entangled Bell state as the quantum channel for key exchange. The protocol incorporates a new security mechanism based on a scrambling operator. Unlike conventional two-way QKD protocols, all sifting operations and eavesdropper detection procedures are postponed until the completion of the quantum communication stage and are performed exclusively by Bob. Since the control mode is never publicly announced, attacks that rely on mode-dependent adaptations or attempt to remain hidden within the control mode are inherently prevented. Furthermore, the traveling qubit does not directly encode key information, substantially limiting the information that can be extracted from attacks targeting the quantum channel alone. An additional distinctive feature of the protocol is that rounds that would ordinarily be discarded can instead be utilized to detect the presence of an eavesdropper. We analyze a broad class of ancilla-based attacks, in which an eavesdropper couples an ancillary system to the transmitted qubit in an attempt to gain information about the key, and show that such attacks are detectable in their most general form.

Trapped vortices determine fundamental properties of superconductors and play an important role in many practical applications such as magnetic levitation, however their complex dynamics remain poorly understood. Here, we use the mechanical motion of micron-scale levitated magnetic particles to probe the dynamics of individual vortices. Specifically, we show that the dynamics of levitated magnets are strongly influenced by vortices trapped in the YBCO superconducting film. We observe random telegraph signals in the mechanical frequency, dissipation rate, and energy of levitated particles, which we attribute to random tunneling of individual vortices. The nonlinearity of vortex-defect interaction manifests as non-exponential decay in ringdown measurements, revealing a complex underlying potential landscape. Our results provide insights into elusive dissipation mechanisms in superconducting levitated systems, open new avenues for using levitated magnets as sensitive probes of static and dynamic properties of individual vortices in superconductors and their interactions with material disorder, and point toward novel routes for using magnetic particles as highly coherent mechanical transducers.

Conventional stellar interferometry reconstructs incoherent sources from pairwise mutual coherences between telescopes. Are such pairwise measurements sufficient for quantum-limited subdiffraction imaging with a telescope array? We show that for generic image-moment estimation, they are not. We consider weak incoherent light from a generic extended source observed by an array of telescopes, each supporting a single optical mode. For an N-telescope array, we derive the quantum Fisher information (QFI) scaling of image moments up to the cutoff 2N-2 and prove that arbitrary measurements restricted to telescope pairs attain the full-array QFI scaling only up to second order. Thus, estimating higher-order moments at the quantum limit requires genuinely multi-telescope interference. Inspired by spatial-mode demultiplexing (SPADE) from single-aperture subdiffraction imaging, we construct array-SPADE measurements that attain the optimal QFI scaling up to the finite-array cutoff. Finally, we show that these measurements can, in principle, be embedded in ancilla- and memory-assisted quantum-network architectures for long-baseline telescopy.

Trapped-ion systems have emerged as a leading platform for scalable quantum information processing owing to their high-fidelity operations and long-range entangling capabilities. As the number of ions in a trap increases, the growing density of collective motional modes makes the synthesis of multimode entangling gates increasingly challenging. Designing large-scale gates requires simultaneously realizing the desired spin-spin interactions, suppressing residual spin-motion entanglement, and limiting experimental control resources, leading to a high-dimensional non-convex optimization problem. Here we develop a numerical framework for multi-tone gate synthesis that directly searches for control fields satisfying these competing requirements. By employing an alternating-minimization strategy, the framework improves numerical stability and remains effective for large systems with many motional modes and target interactions. As representative demonstrations, we synthesize gates implementing all-to-all and nearest-neighbor interaction patterns in ion chains of up to N = 1000, using only global laser control. Across the parameter regimes explored here, the control resources required to maintain high-fidelity interactions do not exhibit rapid growth with system size. We extend the framework to individual addressing using a structured qLDPC target at N = 512 as an example. These results identify multimode gate synthesis as a viable route toward programmable interaction engineering in large-scale trapped-ion quantum processors.

We consider the problem of learning expectation values of particle-preserving operators with respect to an unknown $\eta$-particle $n$-mode fermionic state via classical shadows. Our main application is to estimating overlaps with arbitrary Slater determinant states: While it is known that such overlaps can, in the average case, be learnt to a fixed additive precision with a constant number of samples, the best-known worst case bound is $\mathcal{O}(\sqrt n \log n)$; here we improve this to $\mathcal{O}(\eta\log\eta)$, achieving a mode-independent sample cost. Our procedure is also computationally efficient, requiring only classical post-processing which for a generic dense orbital runs in time $\mathcal{O}(n\eta^2)$. For the task of estimating the expectation value of a general particle-preserving quadratic fermionic observable $h$, we prove a sample complexity bound of $\mathcal{O}(\eta \|h_0\|_2^2)$, where $h_0$ is the traceless component of $h$; the associated classical post-processing scales as $\mathcal{O}(n^2\eta )$. Finally, we discuss implementation of the required randomization: in a first-quantized encoding, approximate unitary designs give circuit depths polylogarithmic in the number of modes, contrasting with linear-depth requirements for nearest-neighbor second-quantized matchgate implementations. On the technical side, our proof reduces the extremal shadow variance to harmonic analysis on the AIII symmetric space $U(n)/(U(\eta)\times U(n-\eta))$ and evaluates the resulting integral using techniques from the theories of Jacobi ensembles and orthogonal polynomials, in a calculation which may be of independent interest.

We propose a quantum computer architecture based on ions confined in optical tweezer arrays, combining the long coherence times of trapped-ion qubits with the reconfigurability and parallel operation enabled by tweezer platforms. Selected ions are transported to local interaction zones, where excitation to an auxiliary state with a displaced optical potential generates a controllable effective electric dipole. We develop and analyze entangling-gate mechanisms mediated by the Coulomb interaction between such effective dipoles, and show that they enable precise, temperature-robust closure of the center-of-mass and relative motional trajectories, leaving no residual entanglement between the qubits and the motion. We further outline a concrete implementation with barium ions based on state-selective polarizability, and study the suppression of cross-talk during parallel gate execution, with relevance to transversal gates in quantum error correction. Our results thereby establish a realistic route toward scalable ion-tweezer quantum processors.

Large-language-model (LLM) agents can write and run experimental control code. This allows laboratory work to be conducted autonomously. However, this autonomy raises a safety problem that prior work has not addressed. Unchecked code can damage the apparatus, and there is no formal, per-operation boundary between human authorization/supervision, and agent decisions. We present a control system that places an LLM agent in the loop of a trapped-ion experiment while enforcing such a boundary. The agent controls the existing Advanced Real-Time Infrastructure for Quantum physics (ARTIQ) stack through tools provided by a Model Context Protocol (MCP) server. No tool call reaches the hardware unless it carries an authorization token bound to its exact contents. Tokens are issued in one of two ways: automatically, by running the agent's proposed script in an isolated hardware simulation (dax.sim) and checking every operation against preset per-device bounds, or manually by a human operator for sensitive actions. Within this boundary the agent develops its own experiments, rather than only calling pre-built routines. We deploy the system on a co-trapped $^{40}$Ca$^{+}$/$^{40}$CaOH$^{+}$ crystal, where the agent autonomously builds a full calibration stack and, with targeted operator guidance, closes a cross-instrument magnetic-field-stabilization loop. On a separate, independent $^{171}$Yb$^{+}$ platform, we confirm interface-level portability. We systematically test token-authorization mechanism with adversarial scripts that attempt to bypass it, mapping the precise boundary of its protection and prioritizing where to strengthen it next. Analyzing where the agent still requires human guidance, we find that its limits lie in metacognitive control, namely recognizing when a problem must be re-framed, rather than in domain knowledge.

Quantum Max Cut, also known as the anti-ferromagnetic Heisenberg Hamiltonian, is a QMA-complete problem which serves as a benchmark for approximation algorithms in quantum physics. Here we develop a hybrid approximation algorithm to quantum Max Cut, which uses the natural quantum dynamics of Rydberg atom systems in combination with semidefinite programming and randomized rounding. It achieves a conditional approximation ratio of $0.651$, compared to the best-known ratio of $0.614$ that relies on semidefinite programming alone. The algorithm is robust in the sense that the advantage persists even if the annealing procedure of the Rydberg atom system obtains a state whose energy is only $89\%$ of its true ground state energy. Our approach opens a new route for hybrid quantum-classical algorithms that combine quantum with classical optimization methods.

We introduce a framework based on classical quasi group codes to define a class of quantum CSS codes, called quantum group codes, supporting transversal multi-control-$Z$ gates which are both addressable and parallelizable, thus allowing to efficiently implement circuits composed of non-Clifford gates at the logical level. Building on this, we use a lifting procedure of classical AG codes established from class field theory to construct good quantum group codes with improved decoding complexity and logical multi-control-$Z$ gate parallelizability. More precisely, on input a good quantum AG code over the alphabet $\mathbb F_q$ with transversal $\mathsf{C}^m\mathsf Z$ gate, we apply this lifting procedure to its underlying classical AG code and obtain a quantum group code over the alphabet $\mathbb F_{q^2}$ supporting a transversal $\mathsf{C}^m\mathsf Z$ gate as well as addressable and parallelizable $\mathsf{C}^{m-1}\mathsf Z$ gates. In addition, this quantum code admits a quasi-quadratic time decoder with a linear decoding radius. This is to be compared with the previous quantum AG codes which have a cubic-time decoder. Hence, our work implies a decrease of the time complexity of state-of-the-art magic-state distillation protocols by an almost linear factor.

Coherent control of interacting spin systems under time-periodic driving is a central challenge in spin-based quantum technologies. Here we demonstrate the applicability of a full Floquet-space formalism, adapted from Nuclear Magnetic Resonance (NMR) methodologies, to model the dynamics of driven coupled electron spins in the presence of a static magnetic field B0 and a transverse oscillating field B1. The framework explicitly includes isotropic exchange coupling J and the chiral Dzyaloshinskii-Moriya antisymmetric exchange interaction (DMI), and its numerical convergence is systematically validated with respect to Fourier-space truncation. In the non-interacting limit, the expected driven-spin dynamics is recovered, with the oscillation periodicity governed by B1. Exchange coupling alone does not modify the collective spin expectation values under the chosen initial condition, consistent with symmetry considerations. In contrast, increasing DMI generates a finite Sy component, suppresses Sz, and produces tilted, elliptical Bloch-sphere trajectories, reflecting the emergence of chiral spin-spin correlations. These effects are pronounced for open boundary conditions, while remaining nearly negligible in the periodic boundary case. When exchange coupling and DMI coexist, the dynamics becomes strongly perturbed and multi-frequency in nature. Together, these results demonstrate that full Floquet-space modeling provides a robust and predictive framework for analyzing and engineering coherent dynamics in driven interacting spin systems beyond simple coherent-rotation regimes.

We investigate the preparation of frequency-tunable photonic Fock states in a hybrid cavity system consisting of a nonlinear medium and a two-level system. Employing a gradient-based optimization approach, we construct multipulse driving protocols that control the system dynamics through pulse amplitudes, phases, and inter-pulse delays. Assuming unitary dynamics, the optimized sequences enable near-deterministic preparation of low-photon-number Fock states. We extend the optimization framework to open-system dynamics by modeling atomic decay and photon loss within the Lindblad master equation. This allows us to identify pulse sequences that exhibit enhanced robustness against dissipation compared to those optimized under idealized assumptions. Furthermore, we find that optimal pulse sequences obey strict constraints on relative phases, which are limited to values of 0 or $\pi$. These phase restrictions are supported by an analytical study that investigates a simple two-pulse sequence treating the second pulse perturbatively.

We construct a rate-$2/3$ quantum low-density parity-check (LDPC) code from a $(3,18)$-regular two-branch finite-field base and a circulant-permutation-matrix (CPM) lift of degree $P=101$. The resulting code is a Calderbank–Shor–Steane (CSS) code with parameters $[[34542,23032,18]]$. Its distance is established by a computer-assisted proof: an explicit nontrivial logical operator gives the upper bound, and a complete symmetry-reduced enumeration excludes every nonzero vector of weight below 18 in both parity-check kernels. We also prove that every affine-in-$t$ CPM lift of the same base satisfying CSS orthogonality has distance at most 18 for every prime lift degree $P>19$. The construction has row weight 18 and column weight 3, and the Tanner graphs of $H_X$ and $H_Z$ separately have girth 8. Decoder experiments with log-likelihood-ratio (LLR) joint belief propagation (BP) and deterministic post-processing show no failures in $10^8$ trials at $p=0.01$, and a finite-length frame error rate (FER) sweep estimates the transition near $p=0.029$.

Foundation decoders, a class of high-capacity neural decoders, are leading candidates for fault-tolerant quantum computing, with accurate and efficient decoding at large code distances. However, their construction often faces a steep scaling barrier, as larger code distances rapidly amplify the cost of syndrome generation and neural optimization. To address this bottleneck, here we devise neural transfer unification (NTU), a unified framework for efficient foundation decoders. A central feature of NTU is its ability to align decoding tasks across code distances via algebraic structures shared by scalable code families, which enables knowledge learned on smaller codes to accelerate large-scale decoder training. We instantiate NTU as NTU-Transformer, a transformer-based neural decoder tailored for planar surface codes and bivariate bicycle codes. For planar surface codes under circuit-level noise, NTU-Transformer outperforms correlation-aware matching on the $[\![361,1,19]\!]$ code and further scales to the $[\![625,1,25]\!]$ code, where it exceeds standard matching through transfer adaptation. For the bivariate bicycle code with $[\![72,12,6]\!]$, it surpasses Relay-BP in the low-physical-error regime. These results establish our proposal as a scalable route to amortized cross-distance training of foundation decoders for fault-tolerant quantum processors.

Quantum information science aims to harness different kinds of quantum resources to accomplish specific information-processing tasks. These resources also play an increasingly important role in addressing fundamental questions concerning quantum phases and dynamics. Therefore, developing powerful and practical methods for identifying and detecting quantum resources is of great significance, with applications ranging from benchmarking quantum devices to understanding the fundamental structure of quantum theory. In this work, we propose witness expansion, a unified framework for constructing nonlinear criteria for detecting quantum resources that are associated with a well-defined group of free unitaries. These criteria apply to both pure and mixed quantum states and are based on polynomial functions of the target state, which can be estimated experimentally using multiple copies of the state and evaluated analytically in certain physical models. We show how several well-known resource-detection quantities naturally emerge from our framework, including the $l_2$ norm of coherence, partial-transpose moments for entanglement, stabilizer entropy for nonstabilizerness (quantum magic), and fermionic antiflatness for fermionic non-Gaussianity. Beyond recovering these existing structures, our framework also yields new criteria for detecting qubit and qudit magic states, substantially enhancing witness-based detection capabilities. In addition, it gives, to the best of our knowledge, the first analytical criterion for detecting mixed-state fermionic non-Gaussianity with respect to the convex hull of pure fermionic Gaussian states that remains nontrivial for arbitrary numbers of qubits, demonstrating the broad applicability and conceptual unifying power of the framework.

We study the problem of finding stationary points of non-convex functions when access to the objective is provided only through a comparison oracle that, given two points, outputs which has the larger function value. For a twice differentiable $f\colon\mathbb R^n\to\mathbb R$ with Lipschitz gradient and Hessian, we develop an algorithm that visits an $\epsilon$-stationary point using $\widetilde O(n^2/\epsilon^{1.5})$ queries. Our approach uses a subroutine that estimates the normalized Hessian to accuracy $\delta$ using $\widetilde O(n^2\log(1/\delta))$ queries. We further study this problem with a quantum comparison oracle model where queries can be made in superpositions, and develop the first quantum algorithm that finds an $\epsilon$-stationary point, which takes $\widetilde O(n/\epsilon^{1.5})$ queries.

Open quantum systems generally do not perfectly preserve phase coherence: coupling to uncontrolled environments requires a density-matrix description based on the Liouvillian framework beyond pure-state wave evolution. Realizing and probing such dynamics in a programmable platform is therefore essential for connecting coherent physics to realistic dissipative settings. Here we implement a tunable open-system quantum walk in a photonic mesh lattice, where controlled phase noise produces adjustable dephasing and non-reciprocal gain-loss imbalance provides an independently tunable non-Hermitian drive. This allows us to continuously interpolate between coherent quantum walks and incoherent classical walks, and to observe how directional transport evolves in the Liouvillian regime. Using non-Hermitian skin dynamics as a probe, we measure the center-of-mass drift over both the coherence and non-Hermiticity parameters, revealing a crossover from coherence-enhanced to decoherence-enhanced transport in quantitative agreement with quantum-channel simulations. We further program spatial and temporal interfaces to demonstrate interface accumulation and a long-time drift governed by the instantaneous channel. Our results establish a controllable photonic platform for simulating open quantum dynamics and show that decoherence can actively reshape non-Hermitian transport.

Superconducting transmon processors represent a leading platform for large-scale quantum computing due to their high gate fidelities and scalability. However, conventional qubit-coupler-qubit (QCQ) architectures face critical physical and structural bottlenecks, notably frequency crowding [spectator qubit collisions] during system scaling and inefficient mapping onto the standard surface code.To overcome these limitations, we propose a novel lattice-patch architecture that couples four fixed-frequency transmons to a single fixed-frequency coupler.This design enhances qubit connectivity and maps directly onto the surface-code lattice unit [plaquette], thereby minimizing the compilation overhead associated with logical qubit implementation. Furthermore, utilizing an entirely fixed-frequency design intrinsically eliminates susceptibility to external flux noise, ensuring robust operational stability.Multi-level numerical simulations demonstrate CNOT gate fidelities exceeding 0.98 across all six connectivity directions within the patch. Nevertheless, the complex interaction network of the four-qubit architecture induces unintended residual phase accumulation during cross-resonance driving. This parasitic effect necessitates precise calibration, achievable via virtual $R_z$ gates [software phase updates]. Ultimately, our results establish the lattice-patch architecture as an efficient, robust building block for future fault-tolerant quantum computers.

The Casimir effect in its simplest form describes the attraction of two parallel conducting plates at close distance due to the vacuum fluctuation of the electromagnetic field. Its derivation can be found in many introductory works on quantum optics. Here we return to the original paper by Casimir and find subtle nuances in his derivation that are worth discussing to give a complete picture of a mathematically sound derivation of the effect.

Molecular ground-state energies help determine conformer rankings, reaction energetics, and electronic effects in computational drug discovery, but accurate calculations become difficult when strong correlation or large active spaces are important. Variational quantum eigensolvers estimate these energies by optimizing a parameterized quantum state, making ansatz design central to both accuracy and cost. We study a fixed-topology Givens-exchange ansatz that avoids architecture search. The circuit starts from the computational-basis state with the lowest diagonal Hamiltonian expectation and applies local RY rotations with two ordered all-pair Givens exchange blocks. Parameters are optimized using Hamiltonian expectation values, while exact diagonalization is used only after optimization to compute errors and fidelities. Across six fixed seeds, coefficient-verified LiH-6 and H2O-8 Hamiltonians, together with a BeH2-6 public-specification candidate, are chemically accurate in every run. The corresponding six-seed mean errors are 0.000000124 Hartree, equivalent to 0.000124 milli-Hartree; 0.000128558 Hartree, equivalent to 0.128558 milli-Hartree; and 0.000002152 Hartree, equivalent to 0.002152 milli-Hartree, respectively. On LiH-6 and H2O-8, these mean errors are lower than the published point errors of the compared quantum-architecture-search methods, while the ansatz uses a larger pre-compilation macro budget. The method is therefore an accurate, reproducible, and search-free reference template for molecular variational eigensolvers.