The implementation of high-fidelity quantum gates for spin qubits requires accurate control of exchange interactions between electrons confined in quantum dots, but pulse distortions can limit this control accuracy. Although linear-dynamical distortions can be compensated for by appropriately convolving the control signal, determining the necessary convolution requires detailed knowledge of the distortion's transfer function, and therefore the calibration of numerous parameters. Alternatively, control pulses can be designed to have a net-zero time integral canceling out linear-dynamical pulse distortions. We generalize net-zero pulse designs to quasi-zero pulses allowing net-positive but reduced time integrals. Using these pulse designs, we systematically develop complete gate sets for exchange-only qubits, and study the resulting tradeoffs between pulse duration, fidelity, and the required number of tunable parameters, both in simulation and experiment. We benchmark the optimized gate pulses on Intel's Tunnel Falls six-dot device and show they achieve fidelities similar to those obtained with a full filtering approach, with identical pulse durations and fewer tuning parameters. This reduction in complexity opens the door to fast and easily automated calibration schemes compatible with large-scale commercial quantum devices.

We give a general framework for tomography of states that have bounded-extent with respect to a structured class of states. Let $\textsf{C}$ be a family of $n$-qubit states such that: $(i)$ $\textsf{C}$ is succinctly representable and $(ii)$ there is a weak agnostic learner of $\textsf{C}$. We give a tomography protocol for an unknown state $|ψ\rangle$ that is promised to admit a decomposition of the form $|ψ\rangle = \sum_i c_i |ϕ_i\rangle$, where $|ϕ_i\rangle \in \textsf{C}$ with bounded $\ell_1$-norm of the coefficients (which we call extent). Our main contribution is to show that a weak agnostic learner for $\textsf{C}$ can be boosted into a tomography algorithm for states with bounded extent with respect to $\textsf{C}$. Our reduction is black-box and applies broadly across model classes. As an application, when $\textsf{C}$ is the class of stabilizer states, we obtain tomography algorithms for states with stabilizer extent $ξ$ up to trace distance $\varepsilon$, in time $\textsf{poly}(n,(ξ/\varepsilon)^{\log(ξ/\varepsilon)})$, which is improvable to $ \textsf{poly}(n,ξ,1/\varepsilon)$ assuming the algorithmic polynomial Freiman-Ruzsa conjecture in the high-doubling regime. When the unknown state $|ψ\rangle$ is arbitrary, we give an algorithmic decomposition result in the spirit of a weak regularity lemma for quantum states with respect to $\textsf{C}$ and show that the structure in $|ψ\rangle$ that is explainable by $\textsf{C}$ can be efficiently learned. Our main conceptual message is that agnostic learning of a structured base class automatically yields learnability of its low-complexity linear span.

While damped spin dynamics is important for the understanding of magnetic materials, clear signatures of \emph{quantum corrections} to the Gilbert damping mechanism remain elusive. We propose a route to distinguish quantum and classical Gilbert spin damping using ferroelectric control of a magnetic dimer. Ab initio calculations for dimers on ferroelectric substrates show that polarization reversal switches the inter-spin exchange between ferromagnetic and antiferromagnetic regimes. We formulate a magnetization-based diagnostic that relates magnetization traces to entanglement dynamics, which enables ferroelectrical on/off control of dimer entanglement. Material-informed quantum Landau-Lifshitz-Gilbert simulations illustrate how the signature of magnetization dynamics can, in principle, be used to infer the existence of quantum Gilbert spin damping. This minimal and non-volatile platform connects first-principles modeling to experimentally accessible observables and provides a starting point for voltage-controlled quantum entanglement in magnetic spin networks.

The performance of quantum error correction (QEC) codes is limited by the underlying physical noise. Theoretical studies show that coherent and stochastic noise have different effects when performing QEC with either surface or repetition codes. We use the bitflip repetition code, realized in a transmon quantum processor, as a testbed to experimentally study the impact of injecting coherent versus stochastic errors on the logical performance. We adapt a scalable free-fermion simulator to simulate the experiments and we modify a subset sampling technique to efficiently sample stochastic noise in the quantum circuit. In the experiment, we do not observe the difference in logical fidelity predicted by simulation for either the distance-3 or distance-5 repetition codes. We hypothesize that this discrepancy could be explained by small drifts in qubit frequencies, which introduce phase-coherent noise that `stochastifies' the injected coherent errors. Our work contributes to advancing an understanding of how coherent errors affect experimental QEC.

In this work, we present constructions of quantum circuits to implement general measurements on quantum hardware. Firstly, we investigate a quantum circuit ansatz by following the Naimark extension with a universal set of gates, such as controlled-NOT and single-qubit gates; we call it a Naimark quantum measurement. We present a circuit ansatz framed by the Naimark extension, leaving single-qubit gates with parameters, and apply a classical optimizer to determine their parameters to approximate a desired quantum measurement. Secondly, we relax the Naimark measurement with quantum neural-network (QNN) circuits, employing parameterized quantum circuits. We present hybrid Naimark-QNN measurements by incorporating QNN circuits into Naimark measurements. Thirdly, we also consider fully QNN measurements with shallow parameterized circuits. Then, we compare the constructed measurement circuits, Naimark, hybrid Naimark-QNN, and fully QNN measurements, for strategies of state discrimination, such as minimum-error and maximum-confidence measurements. We demonstrate that QNN circuits can efficiently and effectively achieve near-optimal quantum measurements with fewer training iterations.

Constructor theory is a proposal to extend quantum information theory beyond both quantum theory and computation, to cover more general machines than programmable computers -- called constructors. It consists of newly conjectured physical principles that can be expressed as constraints on what tasks are possible, what are impossible, and why. These principles also determine the repertoire of the universal constructor, which is a programmable machine that can perform all physically possible tasks. The principles of constructor theory have novel physical content that supplements current dynamical laws, leading to new predictions for experimental tests. In this paper, we review the main experimental proposals to test the principles of constructor theory and discuss their implications for existing theories of physics and for their successors.

Quasiparticle poisoning bottlenecks superconducting qubits, limiting coherence and the scalability of quantum processors. In this work, we systematically investigate quasiparticle poisoning in superconducting qubits under three infrared (IR) shielding configurations, ranging from a dedicated multi-layer design to a simplified implementation. By measuring quasiparticle-induced parity switching, we demonstrate a suppression of the switching rate by over four orders of magnitude via the implementation of improved shielding. In the best configuration, the rate decreases over time following cooldown and reaches 0.069$\,$Hz on day 34, corresponding to an anticipated quasiparticle density per Cooper pair of $1.88\times10^{-11}$. To our knowledge, this represents the lowest quasiparticle density reported in the literature to date. The remaining quasiparticle population is likely dominated by sporadic phonon bursts stemming from mechanical stress release in the on-chip films, as well as from the surrounding environment. The effective qubit temperature follows the phonon bath down to 17$\,$mK, enabling initialization errors of $\sim 0.01\%$ for 3$\,$GHz qubits. These results demonstrate that proper IR shielding and thermalization are essential for suppressing quasiparticle poisoning and enabling high-coherence, scalable superconducting qubit systems.

Ising machines are a promising approach to solve combinatorial optimization problems. They map these problems onto the Ising model and search for low-energy configurations. However, navigating the rugged energy landscapes of these systems remains difficult. To improve this navigation, classical adiabatic annealing has been proposed in the literature as a heuristic optimization method for classical Ising machines. Using this technique, the Hamiltonian of the Ising machine is gradually transformed from an easily solvable Hamiltonian to the target Hamiltonian. However, its purported effectiveness is primarily motivated by an analogy to quantum adiabatic annealing, and systematic benchmarking has remained limited. In this work, we analyze the classical adiabatic annealing technique using continuation methods. Motivated by insights from this analysis, we propose an optimized annealing strategy we refer to as hybrid classical adiabatic annealing. We benchmark our proposed strategy using MaxCut instances with up to 800 spins and problems with external fields, for which it achieves a marginal improvement for a limited set of problems. We conclude that, although theoretically motivated and occasionally beneficial, the hybrid strategy does not offer a sufficient practical advantage over simpler, existing techniques.

The traveling salesman problem (TSP) is a significant classical NP-hard combinatorial optimization problem. In this work, we demonstrate that combining classical dynamic programming with quantum search can yield an achievable quantum advantage for TSP on the basis of excellent work by the authors of~\cite{ambainis2019quantum}. We design the quantum divide and conquer strategy to provide a parameterized spectrum for this combination. The hybrid algorithm proposed in~\cite{ambainis2019quantum} corresponds to a specific case in this spectrum, while the two extremes of the spectrum represent the purely classical Held-Karp and the purely quantum search algorithm, respectively. Within our parameterized spectrum, we prove that the optimal query complexity is $O^*(1.865666\ldots^n)$, achieved with the 4-subset scheme, while the counting in~\cite{ambainis2019quantum} overlooked half of the recursive branches. The correct query complexity of their algorithm is $O^*(2.225880\ldots^n)$ at their chosen parameter ($α\approx0.055362$), and cannot fall below $O^*(2^n)$ for any $α$ - meaning their $8$-subset scheme, correctly analyzed, never surpasses the classical Held-Karp bound. Furthermore, in previous studies on quantum advantages for NP-hard combinatorial optimization problems, researchers focused only on improvements in query complexity. Our work, however, points out that the quantum advantage stems not only from the quadratic speedup of quantum search but also from the structured quantum state preparation. We argue that structured state preparation is indispensable for realizing the oracle operator while maintaining the total time complexity of $O^*(1.865666\ldots^n)$. Therefore, we design an elegant method for preparing the set partition state, which makes our TSP solver practically executable.

This study investigates the analytical solvability of the Klein-Gordon and Duffin-Kemmer-Petiau (DKP) equations for a scalar particle interacting with a transcendental $α$-attractor-type potential, $V(x) = V_0 e^{a \tanh(bx)}$. We first address the problem of integrability within the framework of Picard-Vessiot theory. By analyzing the differential field extensions associated with the system, we demonstrated that the differential Galois group is the full special linear group $SL(2, \mathbb{C})$. Given that this group is not solvable, we provide rigorous proof for the non-existence of Liouvillian solutions, effectively ruling out any expression in terms of primitives and elementary functions. Building upon this result, we further establish that wavefunctions cannot be represented as finite compositions or transformations of classical special functions, such as those of the Bessel, Whittaker, or Heun families. This second conclusion is supported by the ``double-transcendence'' of the potential; we prove via the Hermite-Lindemann theorem that no rational coordinate transformation $z(x)$ exists that could map the physical equation into an ordinary differential equations(ODE) with rational coefficients. Consequently, the $α$-attractor potential is strictly non-integrable and lies entirely outside the landscape of solvable relativistic quantum systems.

We examine the non-Markovian dynamics and the generation of quantum coherence and entanglement within a triple-layer graphene (TLG) system embedded in a planar microcavity. Using time-dependent perturbation theory, we derive an exact analytic solution for the system and demonstrate how the confined electromagnetic field mediates quantum correlations between the graphene layers. We employ three complementary measures; the relative entropy of coherence (REC) to quantify quantum coherence, the tangle to assess tripartite entanglement, and a non-Markovianity measure derived from the REC to characterize quantum memory effects. Our analysis reveals that these quantum resources exhibit remarkable sensitivity to various control parameters. Specifically, we demonstrate that the number of cutoff modes, the spatial positioning of the layers, the momentum parameter, and the interlayer rotation angles provide effective control over coherence, entanglement, and memory effects. We further show that these measures exhibit an exceptional sensitivity to the rotation angle between the layers. Ultimately, our results establish cavity-confined TLG as a highly tunable platform for exploring vacuum-mediated quantum phenomena, providing a framework for the precise manipulation of quantum correlations in graphene-based photonic and optoelectronic devices.

The characterization of the quantum critical properties of genuine non-Hermitian many-body systems remains ambiguous as neither the state considered nor the definition of expectation values is unique. In this work, we investigate the quantum critical properties of two models of non-Hermitian XY spin chains with magnetic field. Using exact solutions, we systematically investigate the parameter dependence of the energy, the magnetization as well as the long-distance asymptotic behavior of static correlation functions. We compute expectation values within the standard formalism of quantum mechanics as well as within biorthogonal quantum mechanics and take two different states which one might reasonably consider to be the analog of the ground state of a Hermitian model. The critical properties, including such fundamental characteristics as the phase diagram, depend on both the formalism used as well as the state considered. We provide arguments in favor of the use of standard quantum mechanics. Which state to be taken in computations, depends on the (hypothetical) experimental preparation of the system.

In this work we show that long-range interactions can be significantly beneficial for implementing shortcuts to adiabaticity (STA) in many-body open quantum critical systems driven out of equilibrium, as well as for charging quantum batteries in the presence of dissipation. In sharp contrast to short range interactions where passage through criticality may demand STA control with non-zero interactions between infinitely distant spins, using the example of a Kitaev chain with long-range couplings, we find that the corresponding control may involve involve interaction strength with decays algebraically with distance. In case of non-unitary control, the advantage of long-range interactions manifest through reduction in the cost of STA. We further propose a modified STA technique aimed at charging a quantum battery in the presence of dissipation, in which case long-range interactions may enhance the resultant ergotropy. Our results establish long-range interactions as a valuable resource for quantum control, with direct implications for quantum technologies.

Continuous-variable quantum key distribution (CV-QKD), which uses quadratures of the electromagnetic field, enables practical quantum communication using standard telecommunication technologies. Unidimensional CV-QKD (UD-CVQKD) simplifies the implementation by restricting modulation to a single quadrature. In this work, we experimentally demonstrate a free-space Gaussian-modulated UD-CVQKD system operating under a high detector electronic-noise regime (1.4 shot-noise units). The system employs polarized coherent states with signal and local oscillator co-propagating in the same spatial mode in orthogonal polarizations, ensuring stable interference. System security is analyzed under both untrusted (UTD) and trusted (TD) detector noise models. While no positive secret key rate is obtained under the UTD model, the TD model enables secure key generation over a finite range of modulation variances, highlighting the critical role of detector trust in high-noise conditions. A maximum secret key rate of 270 kbps is achieved at an optimal modulation variance of 11.57. Furthermore, secure operation requires high-transmittance (low-loss) channels under such noise conditions. This study demonstrates the practical feasibility of free-space UD-CVQKD in realistic high electronic-noise detection constraints and highlights detector electronic noise as a key limiting factor in practical systems.

Continuous-time Quantum Annealing (QA) is a strategy for preparing the ground state of nontrivial many-body systems. In its standard form, the dynamics is generated by a time-dependent interpolation between a simple driving Hamiltonian and the target problem Hamiltonian, usually implemented through a linear schedule. This approach faces the crucial bottleneck of small spectral gaps, which may require exponentially long annealing times to ensure adiabaticity. Here, we show how to implement quantum control over the annealing schedule in a frustrated Ising ring, one of the simplest models exhibiting an exponentially small bottleneck gap. By optimizing smooth continuous-time annealing schedules with a dressed-CRAB approach, and using a digitized representation of the dynamics to efficiently evaluate gradients, we construct protocols that strongly outperform standard fixed schedules. The optimized dynamics bypasses the bottleneck through a strongly nonadiabatic mechanism, leading to efficient ground-state preparation despite the exponentially small minimum gap. In particular, the annealing time required to reach a fixed residual-energy threshold is found to grow linearly with system size rather than exponentially. We further examine a lowest-order variational counter-diabatic correction and find that, once schedule optimization is allowed, it does not lead to any improvement.

We experimentally demonstrate an improved optical biasing scheme for superconducting nanowire single-photon detectors (SNSPDs), which employs a cryogenic InGaAs-InP photodiode (PD) as a local bias source. It is found that, under illumination from a stable external light source, this PD generates a stable photocurrent in a cryogenic environment (~2.3 K), with fluctuations in the photocurrent primarily attributed to fluctuations in the incident optical power. Furthermore, by screening and effectively blocking stray photons leaking from the PD, which give rise to background dark counts, we have achieved an SNSPD exhibiting an ultra-low intrinsic dark count rate of 1e-4 cps. Utilizing this improved optical biasing technique, our SNSPD achieved performance comparable to that obtained under conventional electrical biasing: a system detection efficiency of 80.7%, a background dark count rate of 32.6 cps, and a minimum timing jitter of 57.5 ps. These results indicate that cryogenic-PD-based optical biasing serves as a viable, low-noise, and low-jitter alternative to traditional electrical biasing. Moreover, this work offers useful design guidance for the future development of PD-based low-noise bias sources and for the construction of all-photonic SNSPD systems tailored for high-precision quantum photonics applications.

Quantum computing offers several algorithms to compute the ground state of a problem Hamiltonian. The most desirable algorithms belong to the Fault Tolerant QuantumComputing (FTQC) regime, such as quantum algorithms with repetitive structure like Quantum Phase Estimation (QPE) and Quantum Signal Processing (QSP). However, in the Noisy In-termediate Scale Quantum (NISQ) regime, the most realistic approaches involve Variational Quantum Eigensolver (VQE) algorithms and their variants. VQE is an algorithm that searches for a parametrized unitary matrix called an ansatz whose purposeis to transform an easily prepared initial state into the groundstate of a given Hamiltonian. Adaptive Derivative-AssembledPseudo-Trotter (ADAPT)-VQE is a variant of VQE that im-proves this approach by constructing the ansatz iteratively so that the associated quantum circuit is as shallow as possible. A major difference between FTQC (i.e. not variational) algorithms and VQE is that FTQC algorithms do not construct a state transitiondirectly. Instead, they construct a projector that identifies the ground state using ancillary qubits that flag the good solution. The desired state is then obtained via amplitude amplification orpost-selection. In this work, we propose a VQE ansatz whose structure is more similar to that of an FTQC algorithm. Depending on its parametrization, this ansatz can be equivalent to either an Intermediate Scale Quantum (ISQ)-QSP or to an ADAPT-VQE quantum circuit structure. Our experimental results show that this first proposal of Projector Variational Ansatz (PVA) converges with a shallower ansatz than the usual ADAPT-VQE.

We study thermal quantum correlations and coherence in Heisenberg $XY$ model with anisotropic interactions under a uniform magnetic field $ B $. Using concurrence $C$, local quantum uncertainty (LQU), Bell-Clauser-Horne-Shimony-Holt (CHSH) nonlocality $ \mathbb{B}$, and coherence $C_l$ as quantifiers, we analyze how magnetic anisotropy $ δ_m $, coupling anisotropy $ δ_c $, Dzyaloshinskii-Moriya (DM) interaction $ D $, temperature $ T $, and magnetic field $ B $ modulate quantum resources. At low temperatures and relevant magnetic fields, the entanglement is maximized, but exhibits sudden death for $ δ_m = 0 $, which turns into a smooth decay as $ δ_m $ increases, highlighting its stabilizing role. LQU shows that stronger anisotropy suppresses quantum correlations, while $ \mathbb{B} $ induces a non-monotonic response peaking at a critical field $ B_c $. Bell-CHSH nonlocality violations ($ \mathbb{B} > 2 $) persist below $ B_c $, but thermal noise ($ T \geq 1 $) suppresses them. Coherence $ C_l $ is most robust to thermal fluctuations, especially for high \( δ_m \), which also dampens abrupt quantum phase transitions. The DM interaction is essential for entanglement generation, with $ D $ and anisotropy synergistically enhancing correlation resilience. We identify a hierarchy of thermal degradation: nonlocality ($ \mathbb{B} $) vanishes first, followed by entanglement ($ C $), then general quantum correlations (LQU), while coherence $ C_l $ persists the longest. These results demonstrate tunable control of quantum resources via anisotropy and external parameters, providing insights for the design of robust spin-based quantum technologies.

Multipartite entanglement forms the core of many networking applications. In the near-term future, it is expected that multipartite distribution will be achieved first through star topologies, making it important to understand the noise incurred during the distribution process. In such networks, elementary links are created stochastically and successful links must be stored while waiting for the remaining links, causing memory decoherence that depends on the random waiting times. We derive analytical expressions for both the average noise and its distribution, when distributing GHZ states under memory dephasing in star networks. We study and compare two distribution protocols: the factory and piecemaker protocol. Furthermore, we find expressions for the case of a global cut-off (allowing fast optimization of the cut-off without requiring Monte Carlo simulations) and extend the analysis for the factory protocol to depolarizing noise for arbitrary states.

We investigate the emergence of chaotic Bohmian trajectories in a three-mode superposition of the ground and first excited states of a two-dimensional anisotropic harmonic oscillator. The analysis focuses on the interference-induced phase structure of the wavefunction, which determines the Bohmian velocity field through its phase gradient. We show that the spatial extent of chaotic motion is controlled by the temporal coherence of the interference pattern, set by the detuning between oscillator modes. Near resonance, slow beating generates long-lived phase-gradient structures that repeatedly stretch and fold nearby trajectories, leading to more spatially extended chaotic regions. In contrast, strong detuning produces rapid temporal decorrelation of the phase field and confines chaotic dynamics to localized regions of configuration space. To quantify this behavior, we use a dimensionless coherence parameter comparing the beating time scale with a characteristic transport time. The results identify temporal coherence of the interference-induced phase field as a useful diagnostic for chaotic transport in low-dimensional Bohmian systems.

The nonlinear dynamics of a mechanical resonator in an optomechanical system with linear, quadratic and cubic photon-vibration interactions (with respect to mechanical displacements) in a modulated driving field under conditions of adiabatic elimination of the optical field is studied. Based on the constructed bifurcation diagrams of the mechanical coordinate and the largest Lyapunov exponent as a function of the modulation amplitude, as well as power spectra, phase portraits and Poincare sections, regions of regular and chaotic dynamics of the optomechanical system are identified. It is also shown that for a certain modulation amplitude in the presence of all three types of interactions, chaotic dynamics of the mechanical resonator (oscillator) is realized, which is replaced by quasi-periodic oscillations in the absence of cubic interaction, and the system returns to chaotic behavior if only linear interaction remains. This non-monotonic dependence of chaotic dynamics on the order of nonlinearity originates from the interplay between parametric driving and effective potential reshaping and manifests that nonlinearity does not always enhance chaos. For an optomechanical system in a membrane-in-the-middle configuration, where only quadratic photon-vibration interaction is present, it is demonstrated that at small modulation amplitudes the mechanical oscillator exhibits quasi-periodic motion in each of the wells of a symmetric two-minimum potential, whereas large modulation amplitudes lead to chaotic motion, involving interwell transitions.

Nonreciprocal transmission (classical nonreciprocity) in optomechanical systems based on asymmetric Fabry-Perot (F-P) cavities has been theoretically proposed and experimentally demonstrated. However, nonreciprocal quantum effects, particularly nonreciprocal quantum entanglement, remain unexplored in such systems. Here, we propose to generate nonreciprocal optomechanical entanglement in an asymmetric F-P cavity and discuss the connection between the nonreciprocal transmission and nonreciprocal quantum entanglement. We reproduce the nonreciprocal transmission spectra by solving the quantum Langevin equations, and then discuss the optimal parameters to achieve nonreciprocal optomechanical entanglement in the system. We show that a greater and more robust optomechanical entanglement can be approached in the asymmetric F-P cavities, in comparing with the symmetric cavities. Furthermore, we find that the degrees of classical and quantum nonreciprocities do not exhibit positive correlation as expected. Our work shows that the classical and quantum nonreciprocities can be realized simultaneously in the asymmetric F-P cavities, which provide a platform to explore the connection between classical and quantum nonreciprocities.

Superconducting circuit devices require electrical interconnects between different circuit elements on the chip, for which conventional device architectures use a combination of two structural elements: \textit{airbridges} to connect non-adjacent elements in the base layer, and \textit{bandages} to connect the electrodes forming the Josephson junctions to the base layer. Bandages introduce unwanted parasitic material interfaces and increase the manufacturing complexity. Here, we overcome the limitations imposed by \emph{bandages} by establishing \textit{all} electrical interconnects with airbridges of varying size fabricated in a single step. The airbridges show a high yield and mechanical stability over a wide range of sizes from $0.5\,μ\mathrm{m}$ to $4\,μ\mathrm{m}$ in width and from $5\,μ\mathrm{m}$ to $40\,μ\mathrm{m}$ in length, and show low loss when integrated in coplanar waveguide resonators and transmon qubits. Measured relaxation times up to more than $250\,μ\mathrm{s}$ in standard transmon geometries show that the process achieves high coherence while substantially easing and accelerating device fabrication.

Quantum simulation requires highly accurate input states. Gutzwiller-projected Bardeen-Cooper-Schrieffer (BCS) states provide physically motivated input states for solving strongly correlated lattice models, but their preparation on a quantum computer is hindered by the non-trivial nature of the Gutzwiller projection. We construct scalable quantum algorithms for this task by combining a circuit construction for arbitrary BCS states with the amplitude amplification for Gutzwiller projection (AAGP) procedure. AAGP yields a quadratic reduction in the number of projection queries compared with measurement-based postselection and leads to substantially improved fault-tolerant resource scaling. For projected BCS states optimized for the square-lattice $t$-$J$ model, we find that the projected-state weight decreases exponentially with system size, but the quadratic improvement is still large enough at physically relevant finite sizes to make a decisive practical difference. In particular, for a 100-site benchmark, AAGP reduces the required number of projection queries by about seven orders of magnitude. These results establish AAGP as an enabling input-state preparation protocol for projected BCS states in quantum simulation.

Ladder operators, found in the quantum harmonic oscillator and other quantized systems, provide an elegant approach to solving or understanding otherwise intricate physics problems. In this Letter, we discuss cyclic ladder operators in both Hermitian and non-Hermitian systems with a finite Hilbert space, with the highest (lowest) level directly descending (ascending) to the lowest (highest) level via a single raising (lowering) operation. We show that an equally spaced energy ladder emerges when these systems have an underlying Weyl-Heisenberg commutation relation, with the cyclic ladder operators and the temporal evolution operator behaving as the generators of the Weyl-Heisenberg group. We further illustrate such a system using a one-dimensional Floquet lattice, where the cyclic ladder operators become diagonal and the temporal evolution simplifies to a permutation matrix after a Floquet period. Our findings reveal a hidden relation between non-trivial dynamics and algebraic principles in Floquet systems, which may exist for other quantum numbers as well besides the energy levels.

Optical nanofibers provide a way of coupling quantum information in cold atoms across large distances, however, this coupling requires atoms to reside close to the nanofiber surface. Atoms can be trapped close to the surface using a two-color dipole trap. Here we present our experimental realization of a two-color dipole trap. We optimize the number of trapped atoms using a machine learning algorithm and measure the optical density via the transmission. We estimate the number of atoms in the trap to be approximately 1400 and the lifetime of the atoms in the trap to be 28 ms. Machine-learning optimization improved the on-resonance optical depth from 0.5 in the initial optimization stage to optical depths exceeding 15.

The quantum speed limit establishes a bound on the minimal time required for a quantum system to evolve from a given initial state to a final state. When the mean energy variance is fixed this limitation is captured by the Mandelstam--Tamm bound. The fastest quantum evolution saturating this bound follows a geodesic arc connecting the two states. Such geodesics in the manifold of quantum states are explicitly known when the states are pure (Fubini-Study geodesics) and when they are mixed and given by faithful density matrices (Bures geodesics). In this article we obtain the explicit form of the Bures geodesic arcs joining two non-faithful density matrices, which may have different ranks. For pure states one recovers the Fubini-Study geodesics. A necessary and sufficient condition for the uniqueness of the shortest geodesic arc is given. When the condition is not fulfilled there are infinitely many such arcs, all having length equal to the arccos Bures distance between the two states, in analogy with the arcs of great circles connecting the two poles of a sphere. We discuss the implications of our results for the quantum speed limit.

A linear optical medium can delay, mix, and superpose light, but never make two pulses multiply: multiplication is nonlinear, and a linear system has no such operation. This roots a sharp limit on continuous-variable quantum reservoir computers (QRCs) built from Gaussian optics. Within the reservoir they cannot form genuine products of the input at different past times, the cross-time nonlinear correlations many temporal computations require; they can only fake them by storing each past input separately and multiplying in the readout, forcing an exponentially harder high-order measurement. We show that a single Kerr (intensity-dependent phase) element in a time-delayed feedback loop removes this limit. The Kerr effect makes phase depend on intensity, a true multiplication inside the medium; feedback makes the light revisit that element repeatedly, so one mode mixes its own history against itself once per round-trip. Feedback turns time into space: D passes through one nonlinear mode replace D parallel linear modes. We prove an unbounded resource separation (Theorem 3, Corollary 2): an N-mode Gaussian reservoir reaches cross-time nonlinear rank at most 2N, a hardware ceiling, while a single Kerr mode reaches rank equal to its feedback depth D, costing no extra modes. For every N, one Kerr mode performs a computation no N-mode linear reservoir can. Loss is the counterintuitive ingredient: each round-trip dims the light, so the nonlinear phase differs pass to pass, giving every echo its own fingerprint; without loss the passes would be redundant. We confirm activation on an exact open-system simulation and ground the separation in nonlinear channel equalization. Achievable D is 30 to 230 on integrated platforms, so one nonlinear mode replaces up to about 100 linear ones, at the price of measurement time.

A quantum system can restore a broken symmetry faster the more strongly it initially breaks it, an anomaly known as the quantum Mpemba effect. Whether this effect survives once conservation laws fragment the Hilbert space into exponentially many disconnected Krylov sectors has remained open. We address this question for circuits and Hamiltonians with simultaneous charge and dipole conservation, the paradigmatic setting for strong Hilbert-space fragmentation. Combining a replica tensor-network formulation for charge and dipole-conserving gates, which reaches the annealed Rényi-2 entanglement asymmetry up to $L=128$, with Hamiltonian simulations and an exactly solvable dissipative model, we uncover a higher-order symmetric quantum Mpemba effect: the charge and dipole asymmetries each display Mpemba-like crossings on parametrically distinct timescales. Resolving the state into frozen and active Krylov sectors reveals the mechanism: frozen fragments retain a finite asymmetry that obstructs full restoration, while active fragments host the relaxation responsible for the crossings. Fragmentation thus does not preclude the quantum Mpemba effect but reshapes it into frozen memory and active-fragment relaxation, providing a framework for the Mpemba phenomenology of higher-moment symmetries.

We study a bosonic analog of the paradigmatic Dicke model of superradiance, comprising interacting bosonic modes subject to fully symmetric collective decay. Depending on the interaction strength, we uncover qualitatively distinct regimes of emission. For strong interactions, the emission closely resembles Dicke superradiance, with perturbative corrections arising from the presence of additional levels. For weaker interactions, the bosonic statistics qualitatively changes the dynamics, leading to a crossover to subradiant emission. Remarkably, we show that the dynamics in this regime can be described by rate equations analogous to those of the Dicke model despite the large accessible bosonic Hilbert space. Our findings are based on a combination of analytical arguments and large-scale numerics enabled by the permutational symmetry of the problem and may be probed in circuit QED experiments.