Quantum Physics Paper Analysis

This paper investigates certified upper bounds on the minimum distance of an explicit family of Calderbank-Shor-Steane quantum LDPC codes constructed from affine permutation matrices. All codes considered here have active Tanner graphs of girth eight. Rather than attempting to prove a general lower bound for the full code distance, we focus on constructing low-weight non-stabilizer logical representatives, which yield valid upper bounds once they are verified to lie in the opposite parity-check kernel and outside the stabilizer row space. We develop a unified framework for such witnesses arising from latent row relations, restricted-lift subspaces including block-compressed, selected-fiber, and CRT-stripe constructions, cycle- 8 elementary trapping-set structures, and decoder-failure residuals. In every case, search is used only to generate candidates; the reported bounds begin only after explicit kernel and row-space exclusion tests have been passed. For the latent part, we also identify a block-compression criterion under which the certification becomes exact. Applying these methods to representative APM-LDPC codes sharpens previously reported upper bounds and provides concrete certified values across the explored parameter range.

Quantum state purification, which operates not by identifying and correcting specific errors but by repeatedly projecting multiple noisy copies onto special subspaces, provides a syndrome-free alternative to quantum error correction. Existing purification protocols, however, generally assume unconstrained operations and thus overlook the energetic restrictions inherent in realistic quantum devices. Here, we establish a general framework for universal state purification under energy-conservation constraints for depolarizing noise. We derive a necessary and sufficient condition for the nonexistence of universal energy-preserving purification and, whenever such purification is feasible, analytically determine the optimal performance and the corresponding protocols. We further show how the optimal protocols can be systematically implemented using only energy-preserving operations. Numerical results confirm the effectiveness of the proposed scheme. Our framework recovers the standard purification setting as a special case and naturally extends to scenarios assisted by external energy resources. These results identify fundamental physical limits on state distillation and provide an energy-efficient route to quantum error mitigation.

Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $\mathrm{CNOT}$ circuit can be implemented with a physical permutation, a property that has the potential to greatly reduce the depth of compiled circuits. Here we show that phantomness comes at the cost of low encoding rate. Specifically, we prove that any binary phantom code encoding $k$ logical qubits into $n$ physical qubits with distance $d\geq 2$ obeys the bound $k\leq \log_2(n+1)$ for all $k\neq 4$. For $k=4$ we explicitly construct a nonstabiliser $(\!(8, 2^4, 2)\!)$ phantom code that violates the bound and has a transversal non-Clifford gate. We further show that, within the class of nontrivial CSS phantom codes with $k\neq 4$, there is a unique family of codes saturating this bound. In addition, we prove that this logarithmic ceiling cannot be circumvented by permitting additional local unitary gates, or by making use of subsystem codes: any subspace or subsystem code admitting a $\mathrm{SWAP}$-transversal implementation of every logical $\mathrm{CNOT}$ circuit is constrained to satisfy the same bound. These bounds follow from a general theorem relating the length of a quantum code to the structure of its automorphism group, a result which may find applications beyond phantom codes.

Toward the large-scale, practical realization of quantum computing, quantum error correction is essential. Among various quantum error-correcting codes, the surface code stands out as a leading candidate, and lattice surgery based on surface codes has emerged as a promising technique for fault-tolerant quantum computation (FTQC). However, implementing quantum algorithms using lattice surgery introduces both resource and time overhead. Existing approaches typically focus on large layout designs, with compiler passes aimed primarily at optimizing time overhead. This often overlooks the trade-off between rotation bottlenecks and movement distance, which leads to inefficient resource utilization and prevents further reduction of the quantum computation failure rate. To address these challenges, we introduce O3LS, a framework for optimizing lattice surgery through automatic layout search and loose scheduling. O3LS achieves an optimal balance by automatically generating squeezed data layouts to reduce space requirements and employing loose scheduling algorithms combined with circuit synthesis techniques to reduce time overhead, thereby effectively minimizing overall logical error rates. Numerical results indicate that O3LS can reduce space overhead by 28.0% over standard layouts and 46.7% over sparse layouts without increasing the number of time steps, leading to suppression of logical error rates by up to 16% relative to larger data layout designs. O3LS can also achieve time overhead reductions of 36.07% and 24.76% in compact and standard data layout designs, respectively. It suppresses logical error rates by up to an order of magnitude compared to prior compilers that focus primarily on maximizing parallelism.

The classical simulation of universal quantum circuits is crucial both fundamentally and practically for quantum computation. We propose SyQMA, a simulator with several convenient features, particularly suited for quantum error correction (QEC). SyQMA simulates universal quantum circuits with incoherent Pauli noise and computes exact expectation values and measurement probabilities as symbolic functions of circuit parameters: rotation angles, measurement outcomes, and noise rates. This simulator can sample measurement outcomes, enabling the simulation of dynamic quantum programs where circuit composition depends on prior measurement outputs. For QEC, it performs circuit-level maximum-likelihood decoding, provides exact symbolic expressions for logical error rates, and verifies the fault distance of fault-tolerant (FT) stabiliser and magic state preparation protocols. These features are enabled by an intuitive extension of stabiliser simulators, where each non-Clifford Pauli rotation and incoherent Pauli channel is compactly represented via auxiliary qubits and a modified trace. Representing the state requires only polynomial memory and time, while computing expectation values and measurement probabilities takes exponential time in the number of non-Clifford rotations and deterministic measurements, but only polynomial memory. The FT preparation of stabiliser and magic states, including the first stage of magic state cultivation, is analysed without approximations. We also exactly convert the disjoint error probabilities of a general multi-qubit Pauli channel to independent ones, a key step for creating and sampling from detector error models. The code is publicly available and open-source.

Partial quantum error correction and quantum error mitigation are expected to coexist in the pre-fault-tolerant regime, yet the resource advantage of combining them remains insufficiently quantified. We study zero-noise extrapolation constructed from mixed datasets that contain a small number of error-corrected data points together with data obtained without error correction. The low-noise logical points anchor the extrapolation, while the higher-noise physical points enlarge the noise baseline at a much smaller runtime cost. Under a simple model in which error correction suppresses the effective gate error rate from p to $γ$p, we derive the variance of the zero-noise estimator and compare the physical runtime required to reach a target precision. For Richardson extrapolation, the mixed-data strategy reduces variance amplification and can lower the required physical runtime by several orders of magnitude when $γ\leq 0.1$. As a proof of principle, we apply the method to digital quantum simulation of a six-spin transverse-field Ising model and find that mixed physical/logical datasets yield lower-variance zero-noise estimates and outperform extrapolation based only on error-corrected data in the parameter regime studied here. These results identify hybrid error correction and error mitigation as a practical route to resource-efficient quantum computation before full fault tolerance.

Light's intrinsic carrier frequency of hundreds of terahertz theoretically enables information processing at terahertz clock rates. In optical quantum computing, continuous-variable quantum teleportation is the fundamental building block for deterministic logic operations. This protocol transfers unknown quantum states between nodes using quantum entanglement and real-time feedforward of measurement outcomes. However, electrical feedforward bottlenecks currently restrict operational bandwidths to approximately 100 megahertz, preventing the exploitation of light's ultimate speed. Here we show 1-terahertz-bandwidth all-optical quantum teleportation, completely bypassing this electronic limitation. By transferring Bell measurement outcomes optically, we successfully teleported vacuum states across the terahertz band and real-time random coherent wavepackets with a 42-picosecond temporal width. Evaluating the intrinsic state transfer quality, we achieved teleportation fidelities of $\mathcal{F}=0.784$ for the broadband vacuum states and $\mathcal{F}=0.770$ for the dynamic coherent wavepackets. Both results strictly surpass the classical limit of $\mathcal{F}=0.5$, demonstrating genuine quantum teleportation at ultrafast speeds. Our results establish that optical quantum processing speeds are constrained solely by the nonlinear medium's 1-picosecond-scale response, rather than classical electrical interfaces. This methodology provides a cornerstone for terahertz-clock quantum computers capable of overcoming Moore's law, and paves the way for a high-capacity, telecom-compatible quantum internet.

Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an optimal code sequence. We automate this choice by estimating the effective noise channel after each level and selecting the next code accordingly. In particular, we use learning-based methods to tailor small, non-additive encoders when the noise exhibits sufficient structure, then switch to standard codes once the noise is nearly uniform. In simulations, this level-wise adaptation achieves a target logical error rate with far fewer qubits than concatenating stabilizer codes alone--reducing qubit counts by up to two orders of magnitude for strongly structured noise. Therefore, this hybrid, learning-based strategy offers a promising tool for early fault-tolerant quantum computing.

The Quantum Leading-Zero/One Counter (QLZOC) is a fundamental component in quantum arithmetic, playing a critical role in normalization, floating-point units, dynamic range scaling, and logarithmic approximations. Conventional designs primarily rely on direct Boolean-to-quantum mapping, which results in inefficient resource utilization such as irregular gate growth and width-dependent resource overhead. In this work, we propose a scalable, modular, and resource efficient architecture for QLZOC by reformulating the counting process into a sequence of systematic conditional bit-flip operations. Moreover, our design achieves functional polymorphism so that the same design can be easily toggled between zero and one detection, while ensuring seamless scalability to any bit-width without manual re-tuning. We further introduce a Parallel QLZOC (PQLZOC) variant and a Fan-Out optimized (FO-PQLZOC) design. In this work, we evaluate resource efficiency based on the classic criteria about T gates, including the number of total T gates being used (T-count) and the number of sequential T gate layers (T-depth). By exploiting the properties of all-zero/one qubit blocks and a hierarchical merge strategy, the proposed FO-PQLZOC reduces the T-depth from O(m) to O(log m), where m is the input size. Comparative analysis demonstrates that our optimized architecture achieves a 40% reduction in T-count and a 60% reduction in T-depth over state-of-the-art designs, providing a high-performance, T-gate efficient solution for general-purpose quantum arithmetic processors.

Quantum coherence plays a central role in Grover's search algorithm. We study the Tsallis relative $α$ entropy of coherence dynamics of the evolved state in Grover's search algorithm. We prove that the Tsallis relative $α$ entropy of coherence decreases with the increase of the success probability, and derive the complementarity relations between the coherence and the success probability. We show that the operator coherence of the first $H^{\otimes n}$ relies on the size of the database $N$, the success probability and the target states. Moreover, we illustrate the relationships between coherence and entanglement of the superposition state of targets, as well as the production and deletion of coherence in Grover iterations.

Distributed quantum computing (DQC) is a promising proposal for overcoming the scalability challenges of quantum computing. However, the evaluation of DQC hardware and software is difficult due to the relative dearth of classical simulation tools available for DQC devices. In this work, we introduce dqc_simulator, a novel simulation toolkit, written in Python, which automates many of the most challenging aspects of the DQC simulation workflow. dqc_simulator enables the easy simulation of both hardware and software, making it easy to create realistic and robust tests and benchmarks for the full DQC stack.

Quantum circuit optimization is a central task in Quantum Computing, as current Noisy Intermediate Scale Quantum devices suffer from error propagation that often scales with the number of operations. Among quantum operations, the CNOT gate is of fundamental importance, being the only 2-qubit gate in the universal Clifford+T set. The problem of CNOT gates minimization has been addressed by heuristic algorithms such as the well-known Patel-Markov-Hayes (PMH) for linear reversible synthesis (i.e., CNOT minimization with no topological constraints), and more recently by Reinforcement Learning (RL) based strategies in the more complex case of topology-aware synthesis, where each CNOT can act on a subset of all qubits pairs. In this work we introduce AlphaCNOT, a RL framework based on Monte Carlo Tree Search (MCTS) that address effectively the CNOT minimization problem by modeling it as a planning problem. In contrast to other RL- based solution, our method is model-based, i.e. it can leverage lookahead search to evaluate future trajectories, thus finding more efficient sequences of CNOTs. Our method achieves a reduction of up to 32% in CNOT gate count compared to PMH baseline on linear reversible synthesis, while in the constraint version we report a consistent gate count reduction on a variety of topologies with up to 8 qubits, with respect to state-of-the-art RL-based solutions. Our results suggest the combination of RL with search-based strategies can be applied to different circuit optimization tasks, such as Clifford minimization, thus fostering the transition toward the "quantum utility" era.

Spin qubits have emerged as a leading platform for quantum information processing due to their long coherence times, small footprint, and compatibility with the existing semiconductor industry. We first provide an introduction to the different qubit implementations currently being investigated, including single electron-spin qubits, hole-spin qubits, donor qubits, and multispin encodings. We discuss how the confinement and strain present in semiconductor heterostructures produce addressable levels whose spin degree of freedom can be used to encode a qubit. A large emphasis is placed on reviewing the theoretical foundations and recent experimental demonstrations of proposed mechanisms for long-range coupling, including hybrid approaches based on circuit QED and Andreev qubits, as well as spin shuttling. Finally, we review a recent proposal for linking spin qubits using topological spin textures.

The logical S gate implemented via twist defect braiding in the surface code is one of the major sources of overhead in fault-tolerant quantum computing, since an S-gate correction is required in every logical T-gate teleportation. Existing logical S-gate implementations require spacetime volumes of \(2d \times 2d \times d\) or \(2d \times 1.5d \times d\), where $d$ is the code distance of the surface code. To the best of our knowledge, their circuit-level implementations have not yet been shown, hindering quantitative comparisons of fault distances and logical error rates. In this work, we provide these missing circuit-level implementations. Additionally, we propose a novel twist defect braiding protocol that reduces the spacetime volume to \(2d \times d \times d\). First, we construct an implementation of the proposed method using constant-length non-local gates, and then refine it to utilize only nearest-neighbor two-qubit gates on a square grid, without requiring additional two-qubit gate depth beyond that of standard syndrome extraction circuits. Through numerical simulations, we evaluate the fault distances and logical error rates for both existing and proposed methods. Our results show that, although the proposed method reduces the fault distance by one or three, its logical error rates remain comparable to those of existing methods at large code distances (\(d \ge 5\)) and at physical error rates near \(p = 10^{-3}\). This demonstrates that the proposed method is promising for near-term fault-tolerant quantum computing.

We propose and analyze an experimentally accessible Lindblad master equation for a quantum harmonic oscillator, simplifying a previous proposal to alleviate implementation constraints. It approximately stabilizes periodic grid states introduced in 2001 by Gottesman, Kitaev and Preskill (GKP), with applications for quantum error correction and quantum metrology. We obtain explicit estimates for the energy of the solutions of the Lindblad master equation. We estimate the convergence rate to the codespace when stabilizing a GKP qubit, and numerically study the effect of noise. We then present simulations illustrating how a modification of parameters allows preparing states of metrological interest in steady-state.

In recent years, the growing scale of programmable neutral-atom arrays has led to an increasing demand for higher-power Rydberg excitation light. Although pulsed amplifiers deliver higher peak power than continuous-wave lasers, their use for efficient coherent Rydberg excitation of single atoms in arrays has been limited by challenges such as pulse distortion, synchronization with excitation sequences, and spectral linewidth broadening. Here, we address these issues using a fiber-based master-oscillator power-amplifier system. We demonstrate efficient coherent Rydberg excitation of single atoms in a rubidium atom array, achieving performance comparable to continuous-wave methods. This study provides a potentially new technical pathway toward future large-scale quantum simulation and computation with Rydberg atom arrays.

The emergence of Cryptographically Relevant Quantum Computers (CRQCs) presents a critical threat to classical cryptographic systems, particularly widely adopted protocols such as RSA, Diffie-Hellman (DH), and Elliptic Curve Cryptography (ECC). Given their extensive use in the financial sector, the advent of quantum adversaries compels banking institutions to proactively develop and adopt quantum-safe communication mechanisms. This paper introduces a hybrid quantum-safe architecture, orchestrated via Software-Defined Networking (SDN) key distribution. The proposed framework enables the early integration of Classical Cryptography (CC), Quantum Key Distribution (QKD), and Post-Quantum Cryptography (PQC) within a Dynamic Multipoint Virtual Private Network (DMVPN) environment, providing highly scalable, full-mesh, site-to-site encrypted communications for enterprise networks. This is particularly relevant at a time when PQC algorithms have not yet been incorporated into finalized IPsec standards. The architecture has been validated across a five-node testbed comprising three physical nodes within a campus network in Madrid and two private-cloud nodes located in the north of Spain and Mexico. The deployment leverages a heterogeneous mix of physical and virtual devices, diverse technology providers, Discrete Variable QKD (DV-QKD) and Continuous Variable QKD (CV-QKD) implementations, and mutually incompatible key-delivery interfaces (ETSI004, ETSI014 and Cisco SKIP), demonstrating flexibility, scalability, and interoperability across environments. Through this framework, we demonstrate that quantum-safe communication in financial networks is not only technically feasible but also scalable, interoperable, and resilient. The proposed architecture establishes a robust, flexible, and future-proof foundation for secure financial communications in the era of quantum computing.

Fast, scalable decoding architectures that operate in a block-wise parallel fashion across space and time are essential for real-time fault-tolerant quantum computing. We introduce a scalable AI-based pre-decoder for the surface code that performs local, parallel error correction with low decoding runtimes, removing the majority of physical errors before passing residual syndromes to a downstream global decoder. This modular architecture is backend-agnostic and composes with arbitrary global decoding algorithms designed for surface codes, and our implementation is completely open source. Integrated with uncorrelated PyMatching, the pipeline achieves end-to-end decoding runtimes of order $\mathcal{O}(1 μ\text{s})$ per round at large code distances on NVIDIA GB300 GPUs while reducing logical error rates (LERs) relative to global decoding alone. In a block-wise parallel decoding scheme with access to multiple GPUs, the decoding runtime can be reduced to well below $\mathcal{O}(1 μ\text{s})$ per round. We observe further LER improvements by training a larger model, outperforming correlated PyMatching up to distance-13. We additionally introduce a noise-learning architecture that infers decoding weights directly from experimentally accessible syndrome statistics without requiring an explicit circuit-level noise model. We show that purely data-driven graph weight estimation can nearly match uncorrelated PyMatching and exceed correlated PyMatching in certain regimes, enabling highly-optimized decoding when hardware noise models are unknown or time-varying, as well as training pre-decoders with realistic noise models. Together, these results establish a practical, modular, and high-throughput decoding framework suitable for large-distance surface-code implementations.

Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework for stabilizer codes that relaxes these constraints while preserving the symplectic commutation structure on the binary symplectic space $\mathbb{F}_{2}^{2}$. The approach permits controlled overlap between X- and Z-check supports, leading to quasi-orthogonal Pauli operators and a generalized notion of effective distance defined via induced anti-commutation with logical operators. This relaxation expands the stabilizer design space, enabling codes that approach the Gilbert-Varshamov regime with improved logical rates at moderate distances. Finite-length constructions, including quasi-orthogonal variants of the $[[8,3,\approx 3]]$, $[[10,4,\approx 3]]$, $[[13,1,5]]$, and $[[29,1,11]]$ codes, demonstrate consistent improvements over strictly orthogonal counterparts. Under depolarizing noise with error rates up to $p=0.30$, logical error rates, fidelities, and trace distances improve by up to two orders of magnitude. These improvements reflect the increased connectivity of the underlying stabilizer geometry while remaining compatible with standard decoding schemes. The proposed framework offers a principled extension of stabilizer code design through quasi-orthogonal geometric structures.

Fault-tolerant quantum computers (FTQCs) based on surface codes and lattice surgery have been widely studied, and there is strong demand for a framework that can identify logical operations with low space-time cost, verify their functionality and fault tolerance, and demonstrate their optimality within a given search space, much like electronic design automation (EDA) in classical circuit design. In this paper, we propose KOVAL-Q, an EDA kernel that verifies and optimizes surface-code logical operations by formulating them as a satisfiability (SAT) problem. Compared with existing SAT-based frameworks such as LaSsynth, our method can handle logical qubits with more flexible surface-code encodings, both as target configurations and as intermediate states. This extension enables the optimization of advanced layouts, such as fast blocks, and broadens the search space for logical operations. We demonstrate that KOVAL-Q can determine the minimum execution time of fundamental logical operations in given spatial layouts, such as $d$-cycle logical CNOTs and $2d$-cycle patch rotations. Their use reduces the execution time of widely studied FTQC applications by about 10% under a simplified scheduling model. KOVAL-Q consists of three subkernels corresponding to different types of constraints, which facilitates its integration as a submodule into scalable heuristic frameworks. Thus, our proposal provides an essential framework for optimizing and validating core FTQC subroutines.

We demonstrate the Parity Architecture on quantum hardware, using the quantum Fourier transform (QFT) as a benchmark. As a result, a record performance in both fidelity and qubit count is achieved using quantum processors with a native CZ-based instruction set. On the IBM Heron r3 chip, a process fidelity of the QFT algorithm of ${F \approx 10^{-2}}$ for ${N=50}$ qubits is achieved. The scaling of the speedup compared to previous swap-based methods is super-exponential $\mathcal{O}(\exp(N^2))$. Furthermore, we show that the scaling can be improved further by including iSWAP gates in the instruction set.

Implementation of high-dimensional (HD) quantum gates shows very promising perspectives for HD quantum computation. A bipartite quantum system with arbitrary dimensions $n$ and $m$ is termed a quNit-quMit. Here we propose a synthesis scheme to construct the quantum circuit for general quNit-quMit gates with controlled increment (CINC) gates and local gates. This shows that CINC gates combined with local gates form a universal gate set for HD quantum computation. An upper bound of $O(n^2)$ CINC gates is achieved for arbitrary quNit-quMit gate implementation in the proposed scheme, which is the best known result. Especially for the controlled quNit-quMit gates, our scheme requires only 2 CINC gates, whereas the previous scheme required $2n$.

Krylov subspace methods are among the most extensively studied early fault-tolerant quantum algorithms for estimating ground-state energies of quantum systems. However, the rapid onset of ill-conditioning might make accurate energies difficult or even impossible to retrieve. In this communication, we analyse the numerical stability and statistical problems of these methods using numerical simulations both in the presence and absence of sampling noise. While in ideal numerical simulations the generalized eigenvalue problem indeed becomes unstable with increased Krylov subspace size, we find that, in realistic noisy settings, these methods do not primarily suffer from ill-conditioning. Instead, statistical fluctuations dominate and can prevent reliable solution extraction unless appropriate regularization or filtering techniques are employed. We consequently introduce two new metrics, the imaginary and unitary filters, that successfully assess the reliability of the obtained solutions without any knowledge of the true eigenspectrum.

The efficient execution of fault-tolerant quantum algorithms is fundamentally limited by the production rate of magic states required for non-Clifford operations. While circuit optimization typically targets T-depth, static T-depth does not reliably predict executable performance under bounded T-state delivery. We introduce a model that captures demand-supply imbalance using two key quantities: slack ratio, a structural indicator of scheduling flexibility, and Delta_max, a measure of cumulative demand surplus. We show that Delta_max is a strong schedule-level indicator of execution slowdown and yields a provable lower bound on executable makespan for a fixed schedule. Empirical evaluation on constructed directed acyclic graph (DAG) families, with arithmetic circuits and exact quantum Fourier transform (QFT) traces providing additional grounding, shows that slack ratio is a stronger structural predictor than T-depth for stall and inversion risk, while Delta_max is the strongest predictor of slowdown. Across 4,904 instances, the lower bound shows zero violations, with 88.9% of cases within one cycle. These results highlight the importance of explicitly modeling delivery constraints in fault-tolerant quantum compilation.

Superconducting quantum computing is advancing toward the thousand- and even million-qubit regime, making wafer-scale fabrication an essential pathway for achieving large-scale, cost-effective quantum processors. This manufacturing paradigm imposes new requirements on quantum-chip electronic design automation (Q-EDA): design tools must not only generate layouts (GDSII files) that satisfy quantum-circuit physical constraints but also ensure that the design data can be seamlessly converted into a complete set of manufacturing files executable by a wafer foundry, thereby enabling reliable translation from design intent to physical chip. This paper focuses on this critical data-conversion pipeline and presents a systematic treatment of the Q-EDA technology stack for wafer-scale fabrication. Starting from GDSII as the single authoritative data source, we analyze the key stages including process-design-kit (PDK)-based design rule checking (DRC), layout-versus-schematic (LVS) verification, design for manufacturability (DFM) optimization, wafer layout planning, and mask data preparation (MDP). We describe the concrete architecture of a Q-EDA system, present nine quantum-specific DRC rules together with their physical underpinnings and a multi-layer process stack model, and benchmark the manufacturing data-flow coverage of mainstream Q-EDA tools. Finally, we discuss the core challenges and future directions in this field.

We present an analytical theory of greedy peeling decoding for bivariate bicycle (BB) codes under circuit-level noise. The deferred greedy decoder achieves 330x latency reduction over belief propagation (BP) at p = 10^{-3} while maintaining identical logical error rate. Our main theoretical contribution is a closed-form collision resolution factor A_0 = |true collisions| / |birthday collisions|, derived from XOR syndrome analysis with no free parameters, that quantifies the fraction of detector-sharing fault pairs genuinely blocking iterative peeling. For the [[144,12,12]] Gross code, A_0 = 0.8685 (within 0.5% of the empirical value), with shared-2 pairs (4-cycles) always resolving under peeling. We show A_0 depends on the mean fault-graph degree d-bar rather than code size: A_0 = 0.87 for d-bar = 52 (Gross family) versus A_0 = 0.76 for d-bar = 17 ([[32,8,6]]). We establish a syndrome code stopping distance d_S = n/4.5 for the Gross family and demonstrate that [[32,8,6]] (d_S = 4) enables two-shot streaming decoding: T = 2 rounds achieve 89% peeling success with 1.29 +/- 0.03 LER ratio versus T = 12, at estimated latency ~50 ns. The full formula P_peel = exp(-A_0 * gamma_analytic * exp(-BTp) * n * p^2) is validated across five BB codes, four noise levels, and four values of T with R^2 = 0.86. Cross-platform reproduction of the Kunlun [[18,4,4]] experiment matches their hardware LER within 0.73 percentage points.

We propose a novel measurement-free scheme for stabilizing a spin-oscillator hybrid qubit via autonomous quantum error correction. The engineered Lindbladian renders the code space into an attractive steady-state subspace, realized by coupling the storage mode to a rapidly cooled bath through a controlled beam-splitter and spin-dependent displacement interactions. The continuous variable-discrete variable hybrid approach to autonomous quantum error correction preserves the hardware efficiency of conventional dissipation engineering while simplifying the required system-bath coupling. The construction is compatible with simple logical gates and leverages primitives already demonstrated in experimental platforms, such as trapped-ion systems, suggesting a practical route to hardware-efficient, noise-biased logical qubits without repeated syndrome measurements and feedforward.

The quantum computing community is increasingly positioning quantum processors as accelerators within classical HPC workflows, analogous to GPUs and TPUs. However, many real-world applications require scaling to hundreds or thousands of physical qubits to realize logical qubits via error correction. To reach these scales, hardware vendors employing diverse technologies -- such as trapped ions, photonics, neutral atoms, and superconducting circuits -- are moving beyond single, monolithic QPUs toward modular architectures connected via interconnects. For example, IonQ has proposed photonic links for scaling, while IBM has demonstrated a modular QPU architecture by classically linking two 127-qubit devices. Using dynamic circuits, Bell-pair-based teleportation, and circuit cutting, they have shown how to execute a large quantum circuit that cannot fit on a single QPU. As interest in quantum computing grows, cloud providers must ensure fair and efficient resource allocation for multiple users sharing such modular systems. Classical interconnection of QPUs introduces new scheduling challenges, particularly when multiple jobs execute in parallel. In this work, we develop a multi-programmable scheduler for modular quantum systems that jointly considers qubit mapping, parallel circuit execution, measurement synchronization across subcircuits, and teleportation operations between QPUs using dynamic circuits.

We present a directional-transport (DT)-based remote CZ gate and compiler for zoned neutral-atom arrays that overcomes movement-bound entanglement limitations. Current AOD-based shuttling faces row/column non-crossing constraints, device-speed limits, and hardware-restricted range - bottlenecks for long-distance connectivity. Our approach reserves AODs for channel setup and micro-tuning while making DT the default for remote entanglement. Under antiblockade, a detuning-modulated pi-pulse sequence drives directional transport of a Rydberg excitation along a dynamic and resettable ancilla corridor, realizing a CZ gate between stationary, non-adjacent qubits. This cuts entangling-stage duration by approximately 50 to 90 percent versus AOD-only baselines and enables long-distance connectivity beyond objective-limited shuttling.

A standard approach to generate random pure quantum states relies on sampling from the Haar measure. However, the entanglement properties of such states present a fundamental challenge for their general applicability. Here, we introduce the $σ$-ensembles $\unicode{x2013}$ a family of random quantum states with only a single control parameter. Crucially, these states are designed such that they can be tuned between volume-law and area-law behavior, which has been a major obstacle thus far. We construct representatives of this ensemble by imposing a probability distribution on the eigenvalues of the successive subsystems, and subsequently reconstructing a compatible global state using the matrix product state (MPS) formalism. Due to their area-law entanglement, our approach circumvents the intractability of Haar-random pure states in classical simulations of quantum systems and is more representative of typical Hamiltonian ground states.

An $n$-qubit Dicke state of weight $k$, is the uniform superposition over all $n$-bit strings of Hamming weight $k$. Dicke states are an entanglement resource with important practical applications in the NISQ era and, for instance, play a central role in Decoded Quantum Interferometry (DQI). Furthermore, any symmetric state can be expressed as a superposition of Dicke states. First, we give explicit constant-depth circuits that prepare $n$-qubit Dicke states for all $k \leq \text{polylog}(n)$, using only multi-qubit Toffoli gates and single-qubit unitaries. This gives the first $\text{QAC}^0$ construction of super-constant weight Dicke states. Previous constant-depth constructions for any super-constant $k$ required the FANOUT$_n$ gate, while $\text{QAC}^0$ is only known to implement FANOUT$_k$ for $k$ up to $\text{polylog}(n)$. Moreover, we show that any weight-$k$ Dicke state can be constructed with access to FANOUT$_{\min(k,n-k)}$, rather than FANOUT$_n$. Combined with recent hardness results, this yields a tight characterization: for $k \leq n/2$, weight-$k$ Dicke states can be prepared in $\text{QAC}^0$ if and only if FANOUT$_k \in \text{QAC}^0$. We further extend our techniques to show that, in fact, \emph{any} superposition of $n$-qubit Dicke states of weight at most $k$ can be prepared in $\text{QAC}^0$ with access to FANOUT$_k$. Taking $k = n$, we obtain the first $O(1)$-depth unitary construction for arbitrary symmetric states. In particular, any symmetric state can be prepared in constant depth on quantum hardware architectures that support FANOUT$_n$, such as trapped ions with native global entangling operations.

We theoretically investigate the generation of non-Gaussian quantum states, specifically Schrödinger cat-like states (SCLSs), via degenerate dual-pump spontaneous four-wave mixing in a $χ^{(3)}$-based microring resonator. By introducing a unitary transformation that exactly decouples the self-phase modulation (SPM) and cross-phase modulation (XPM) terms, we reduce the full nonlinear Hamiltonian to an effective three-mode interaction. The resulting dynamics (decoupled and full Hamiltonians) are studied using the Lindblad master equation, accounting for cavity losses. Unlike semiclassical or parametric approximations, our full quantum mechanical approach explicitly includes quantum pump depletion, which enables the emergence and observation of non-Gaussian features. We compute the Wigner function, photon number distributions, quadrature variances, Fano factor, Schmidt number, and fidelity to characterize the generated states. For the non-dissipative case, we find that the signal mode $\hat{b}_3$ or $\hat{a}_3$ exhibits clear non-Gaussian features with a structured Wigner function and even-dominated photon number distribution, characteristic of an even coherent state. In the presence of dissipation ($γ_j = 0.2$), the interference fringes become faint, odd photon numbers appear, and the fidelity with the ideal state remains high ($>0.9$), indicating robustness. The pump mode $\hat{b}_1$ or $\hat{a}_1$ remains Gaussian, while both modes display super-Poissonian statistics and entanglement ($>2$). Our results demonstrate that degenerate dual-pump spontaneous four-wave mixing in microring resonators is a promising platform for generating and controlling cat-like states under dissipative conditions.

Node embeddings act as the information interface for graph neural networks, yet their empirical impact is often reported under mismatched backbones, splits, and training budgets. This paper provides a controlled benchmark of embedding choices for graph classification, comparing classical baselines with quantum-oriented node representations under a unified pipeline. We evaluate two classical baselines alongside quantum-oriented alternatives, including a circuit-defined variational embedding and quantum-inspired embeddings computed via graph operators and linear-algebraic constructions. All variants are trained and tested with the same backbone, stratified splits, identical optimization and early stopping, and consistent metrics. Experiments on five different TU datasets and on QM9 converted to classification via target binning show clear dataset dependence: quantum-oriented embeddings yield the most consistent gains on structure-driven benchmarks, while social graphs with limited node attributes remain well served by classical baselines. The study highlights practical trade-offs between inductive bias, trainability, and stability under a fixed training budget, and offers a reproducible reference point for selecting quantum-oriented embeddings in graph learning.

The impossibility of simultaneously cloning non-orthogonal states lies at the foundations of quantum theory. Even when allowing for approximation errors, cloning an arbitrary unknown pure state requires as many initial copies as needed to fully learn the state. Rather than arbitrary unknown states, modern quantum learning theory often considers structured classes of states and exploits such structure to develop learning algorithms that outperform general-state tomography. This raises the question: How do the sample complexities of learning and cloning relate for such structured classes? We answer this question for an important class of states. Namely, for $n$-qubit stabilizer states, we show that the optimal sample complexity of cloning is $Θ(n)$. Thus, also for this structured class of states, cloning is as hard as learning. To prove these results, we use representation-theoretic tools in the recently proposed Abelian State Hidden Subgroup framework and a new structured version of the recently introduced random purification channel to relate stabilizer state cloning to a variant of the sample amplification problem for probability distributions that was recently introduced in classical learning theory. This allows us to obtain our cloning lower bounds by proving new sample amplification lower bounds for classes of distributions with an underlying linear structure. Our results provide a more fine-grained perspective on No-Cloning theorems, opening up connections from foundations to quantum learning theory and quantum cryptography.

We introduce a systematic framework to construct nonlocal observables with extensive quantum Fisher information (QFI) density in stabilizer codes. The construction maps stabilizer generators to dual Ising spins whose correlators equal string order parameters, converting hidden nonlocal order into a metrologically accessible observable. Applying this to monitored cluster codes and the toric code, we identify transitions in the QFI scaling from an extensive regime, where long-range string order prevails, to an intensive one driven by competing single-site measurements.

We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperature. These systems lie beyond the reach of existing methods due to their singular interactions and infinite-dimensional Hilbert space structure. First, we show that the free energy of the full many-body Hamiltonian can be approximated by that of the same Hamiltonian with a finite-rank low-energy truncation of the interaction, with an explicit error bound polynomial in the particle number. This reduces the problem to a controlled finite-rank perturbation problem. Second, we introduce a quantum Gibbs sampling scheme tailored to this truncated system, based on a class of quantum Markov semigroups. Our main analytical result establishes that the associated generator has a strictly positive spectral gap for every truncation, implying exponential convergence to the target Gibbs state. This provides, to our knowledge, the first rigorous mixing-time guarantee for Gibbs sampling in a Coulomb interacting continuous-variable quantum system. Finally, we give an explicit quantum circuit implementation of the dynamics and derive an end-to-end complexity bound for approximating the free energy and the Gibbs state itself. Our results provide a mathematically rigorous route to quantum algorithms for free energy estimation in interacting quantum systems, without relying on classical approximations such as the Born-Oppenheimer reduction.

Photonic architectures are one of the leading platforms for demonstrating quantum computational advantage, with Boson Sampling and Gaussian Boson Sampling as the primary schemes. Yet, we lack for these photonic primitives a systematic theoretical understanding of linear cross-entropy benchmarking (LXEB), which is a central tool for testing quantum advantage proposals. In this work, we develop a representation-theoretic framework for the classical computation of average LXEB scores and second moments of output probability distributions, covering a range of quantum advantage experiments based on scattering $n$-photon states through $m$-mode Haar-random interferometers. Our methods apply in any regime, including the saturated regime, where the (expected) number of photons is comparable to the number of optical modes. The same second-moment techniques also allow us to prove anticoncentration for traditional Fock-state Boson Sampling in the saturated regime. Interestingly, for Gaussian Boson Sampling second moments are not sufficient to establish a meaningful anticoncentration statement. The technical core of our approach rests on decomposing two copies of the $n$-particle bosonic space $\mathrm{Sym}^n(\mathbb{C}^m)$ into irreducible representations of $\mathrm{U}(m)$. This reduces two-copy Haar averages to computing purities of initial states after partial traces over particles, highlighting the role that particle entanglement plays for LXEB and anticoncentration.

The 2-Forrelation problem provides an optimal separation between classical and quantum query complexity and is also the problem used for separating $\mathsf{BQP}$ and $\mathsf{PH}$ relative to an oracle. A natural question is therefore to ask what are the minimal quantum resources needed to solve this problem. We show that 2-Forrelation can be solved using Instantaneous Quantum Polynomial-time ($\mathsf{IQP}$) circuits, a restricted model of quantum computation in which all gates commute. Concretely, two $\mathsf{IQP}$ circuits with two quantum queries and efficient classical processing suffice. For the signed variant of 2-Forrelation, even a single $\mathsf{IQP}$ circuit and query suffices. This answers a recent open question of Girish (arXiv:2510.06385) on the power of commuting quantum computations. We use this to show that $(\mathsf{BPP}^{\mathsf{IQP}})^O \not\subseteq \mathsf{PH}^O$ relative to an oracle $O$, strengthening the result of Raz and Tal (STOC 2019). Our results show that $\mathsf{IQP}$ circuits can be used for classically hard decision problems, thus providing a new route for showing quantum advantage with $\mathsf{IQP}$ circuits, avoiding the verification difficulties associated with sampling tasks. We also prove Fourier growth bounds for $\mathsf{IQP}$ circuits in terms of the size of their accepting set. The key ingredient is an algebraic identity of the quadratic function $Q(x) = \sum_{i < j} x_ix_j$ that allows extracting inner-product phases within an $\mathsf{IQP}$ circuit.

Quantum kernel methods are among the leading candidates for achieving quantum advantage in supervised learning. A key bottleneck is the cost of inference: evaluating a trained model on new data requires estimating a weighted sum $\sum_{i=1}^N α_i k(x,x_i)$ of $N$ kernel values to additive precision $\varepsilon$, where $α$ is the vector of trained coefficients. The standard approach estimates each term independently via sampling, yielding a query complexity of $O(N\lVertα\rVert_2^2/\varepsilon^2)$. In this work, we identify two independent axes for improvement: (1) How individual kernel values are estimated (sampling versus quantum amplitude estimation), and (2) how the sum is approximated (term-by-term versus via a single observable), and systematically analyze all combinations thereof. The query-optimal combination, encoding the full inference sum as the expectation value of a single observable and applying quantum amplitude estimation, achieves a query complexity of $O(\lVertα\rVert_1/\varepsilon)$, removing the dependence on $N$ from the query count and yielding a quadratic improvement in both $\lVertα\rVert_1$ and $\varepsilon$. We prove a matching lower bound of $Ω(\lVertα\rVert_1/\varepsilon)$, establishing query-optimality of our approach up to logarithmic factors. Beyond query complexity, we also analyze how these improvements translate into gate costs and show that the query-optimal strategy is not always optimal in practice from the perspective of gate complexity. Our results provide both a query-optimal algorithm and a practically optimal choice of strategy depending on hardware capabilities, along with a complete landscape of intermediate methods to guide practitioners. All algorithms require only amplitude estimation as a subroutine and are thus natural candidates for early-fault-tolerant implementations.

We explore the expected performance of a semiconducting spin cQED quantum processor for Multiple Hypothesis Tracking (MHT) algorithm via a quantum annealing procedure. From two different benchmarking scenarios we evaluate this type of quantum annealer on a quantum emulator in which we incorporated both dynamical coherent errors and incoherent errors. From estimate of the reset, measurement and annealing time of the processor, we find that cQED-spin processors could reach a total run time of around 50 ms. This makes this technology promising for potential real time application such as radar tracking.

We investigate the generation of quantum states for precision metrology in noisy two-level systems. These states are obtained by optimizing a variational quantum circuit to maximize the quantum Fisher information (QFI) of the output state for a given decoherence rate and interaction Hamiltonian. The circuit architecture, inspired by twist-and-turn schemes, features a sequence of $n$ entangling layers, each consisting of entangling gates followed by a global rotation. We observe notable improvements in the QFI as the circuit layer depth increases, even for appreciable noise rates, demonstrating that our entangle-rotate architecture expands the accessible state space under realistic noise conditions. Our approach thus provides a general and efficient framework for generating quantum-enhanced sensing states. Our analysis extends to systems of power-law interactions spanning from all-to-all to nearest-neighbor interactions. We also analyze the capabilities of our circuit to prepare states for system sizes greater than $8$ qubits.

The Metropolis-Hastings algorithm is a cornerstone of Markov Chain Monte Carlo methods, underpinning a wide range of applications in computational physics, Bayesian inference, and machine learning. Quantum variants of Metropolis-Hastings promise accelerated mixing through quantum walks, but their practical realisation remains challenging. In this work, we construct and simulate an explicit circuit level implementation of a quantum Metropolis-Hastings algorithm based on the framework introduced by Claudon \emph{et al.} (arXiv:2506.11576). We present the full quantum workflow required to prepare a stationary distribution, including a number of modifications required to make the algorithm implementable in a realistic quantum circuit model. Our results demonstrate that these modifications are essential to recover the correct stationary behaviour and highlight both the potential and current limitations of quantum Metropolis-Hastings algorithms, which are expected to become practically relevant in the fault tolerant quantum computing regime.

In the context of waves in space time modulated materials, we ask two questions how much energy does it cost to break time reversal symmetry and transition to a PT symmetric state. and can a PT symmetric system have a ground state in the sense that no photons are present. Our model system is a periodic metamaterial set in virtual motion with velocity cg to become a space-time crystal. We find that the expectation of energy content is always increased on breaking symmetry. At the same time breaking T symmetry introduces photon-pairs even when we start from a T symmetric ground state empty of photons, except in certain pathological examples which we describe. For a range of velocities, PT symmetry is broken so that energy must be continuously invested to preserve motion, creating a trail of photon pairs. Here energy must be continuously invested to preserve motion. We make an analogy with acoustic radiation generated from breaking the sound barrier.

We propose a coherent-control scheme for engineering quantum correlations in a cavity optomechanical (COM) system consisting of a driven optical cavity with an embedded nonlinear medium and a membrane, assisted by a coherent feedback loop. The nonlinear medium and the membrane are pumped to implement optical and mechanical parametric amplifications with controllable modulation frequencies and pump amplitudes. Through the combined modulation of the two parametric amplifications and the coherent feedback loop, we engineer the effective cavity decay rate and the distribution of quantum fluctuations, thereby strengthening quantum correlations and improving their robustness against thermal noise. Our scheme provides an efficient route to realizing highly tunable, strong, thermally robust quantum correlations in COM systems, which is promising for the protection of fragile quantum resources.

We present a minimal implementation of SU($N$) pure Yang-Mills theory in $3+1$ dimensions for digital quantum simulation, designed to enable quantum advantage. Building on the orbifold lattice simulation protocol with logarithmic scaling in the local Hilbert-space truncation, we introduce further simplified Hamiltonians. Furthermore, we test simple methods that improve the convergence to the infinite mass limit, thereby removing the requirement of a large scalar mass to obtain the Kogut-Susskind Hamiltonian. For the SU(2) theory, we can cut the resource requirement further by utilizing the embedding of $\mathrm{SU}(2)\cong\mathrm{S}^3$ into $\mathbb{R}^4$. Monte Carlo simulations of the Euclidean path integral were used to benchmark the accuracy of these new analytical improvements to the theory. These results provide further support for the noncompact-variable-based approach as a practical framework for quantum simulation of non-Abelian gauge theories.

We present a systematic study of static solutions to the source-free SU(2) Yang-Mills equations, in which the gauge potential explicitly depends on spin operators. By employing the \emph{vector potential extraction approach} (VPEA) -- which requires the total angular momentum operator (orbital plus spin) to satisfy the standard angular momentum algebra -- we derive the most general form of the spin vector potential. This leads to the static ansatz $\{ \vec{A} = [k_1(\hat{r}\times\vecΓ) + k_2\vecΓ + k_3(\vecΓ\cdot\hat{r})\hat{r}]/r, \varphi = f_1(r)\,(\vecΓ\cdot\hat{r}) + f_2(r)\}$, parametrized by three constants $\{k_1, k_2, k_3\}$ and two radial functions $\{f_1(r), f_2(r)\}$. Substituting this ansatz into the Yang-Mills equations and imposing the angular momentum constraints from the VPEA yields a set of consistency equations. Solving these equations provides a complete classification of static solutions, including both real and complex families. Known simple SU(2) static solutions are recovered as special cases. Our classification reveals new static configurations that could be valuable for non-perturbative studies and for models where spin degrees of freedom couple to non-Abelian gauge fields.

We present a framework based on the determinantal geometry of two-qubit gates. Combining the Weyl chamber representation with operator Schmidt theory, we interpret gate synthesis as a distance problem to determinantal varieties. This gives an operational geometry to the Weyl chamber, quantifying nonlocal complexity. We show that the square root iSWAP gate is the closest perfect entangler to the variety of local operations, and that no perfect entangler can be approximated by a local gate with average gate fidelity above 79.8%. The three different determinantal costs form a synthesis-adapted coordinate system that encodes nonlocal complexity and generally reconstructs the Weyl chamber.

To address the urgent need in the NISQ era for high-performance, scalable quantum compilers and to advance the integration of classical and quantum computing, we present QLLVM, an advanced Quantum-Classical co-compilation framework built on LLVM. To our knowledge, QLLVM delivers an end-to-end, LLVM-based compilation workflow that unifies the build of classical high-performance programs, including CUDA, MPI, and C++, together with quantum programs into a single executable. For quantum program compilation, QLLVM adopts a three-stage design: high-level optimizations are implemented in the MLIR Quantum dialect and then lowered to QIR, an LLVM IR-based representation, for low-level optimization and hardware mapping. Its extensible architecture and seamless interoperability with classical high-performance computing provide an efficient, flexible, industrial-grade compilation infrastructure for future quantum software development. Experimental results show that, on the MQTBench benchmark suite, QLLVM reduces circuit depth and gate counts compared with state-of-the-art compilers and demonstrates clear advantages in compiling hybrid classical-quantum programs.

Collective spin systems -- spin ensembles coupled to a common reservoir and effectively described by a single macrospin -- play an important role in both atomic and solid-state physics. Their intrinsic nonlinearity gives rise to multiple long-lived metastable states that ultimately relax to a unique most probable state. This dominant state can change with a control parameter, leading to first-order phase transitions. We develop a real-time instanton approach based on quantum quasiprobability dynamics that captures the stationary state in the large-spin limit and the asymptotic scaling of relaxation rates. We further show that these features are not accurately described by the previously applied semiclassical Wigner approach due to its neglect of non-Gaussian fluctuations.

We report a hardware validation of the DAGI (Directed Acyclic Graph Information) framework on IBM Quantum hardware using a small, controlled experiment whose ideal output distribution is constrained to a low-dimensional modular manifold (a "ridge"). For two $n$-bit registers $(u,v)$ with $n=4$ (modulus 16), each key instance $k$ induces an ideal relation $v \equiv k \cdot u \pmod{16}$, producing a visually distinct ridge in the joint $(u, v)$ distribution. Executed on ibm\_torino in a single Sampler V2 job (8 keys, 1024 shots/key, $N=8192$ total shots), the ridge persists under hardware noise with ridge-hit probability $p_{hit} = 0.1830$ (uniform baseline $1/16$), corresponding to a ridge contrast of $2.93\times$ (95\% bootstrap CI [2.80, 3.06]). Key recovery exceeds chance: per-shot accuracy 0.1689 (chance 0.125, 95\% Wilson CI [0.1610, 0.1772]), and per-group dictionary recovery 0.375 (chance 0.125). To test the central DAGI hypothesis -- that recoverable key information is predominantly high-order/synergistic rather than visible in low-order marginals -- we compute a Möbius-based information decomposition of $I(K;D_S)$ over detector-bit subsets $S$ via a Möbius inversion pipeline and evaluate targeted positive synergy $CPS_K$ at order $k_{max}=3$. We observe $CPS_K(k=3) = 0.08788$ with significance under label-shuffle permutation tests (accuracy $p=0.001996$, $CPS_K$ $p=0.004975$). Uniformity diagnostics show near-uniform single-bit marginals while correlation concentrates in specific low-order pairs, and a bootstrap reliability sweep confirms order-3 targeted synergy remains statistically reliable at the full 1024-shot target budget. These results support the claim that DAGI detects and quantifies nontrivial, hardware-resilient, higher-order information structure associated with a known global algebraic constraint.

Hybrid Quantum Neural Networks (HQNNs) combine classical learning with parameterized quantum circuits, but their practical performance is often limited by (i) the noise of Noisy Intermediate-Scale Quantum (NISQ) devices and (ii) the large, discrete design space of quantum circuit architectures. Moreover, HQNNs are commonly trained using a fixed circuit and a single backend, even though deployment frequently targets heterogeneous backends where compilation and execution characteristics may differ. To address these challenges, we propose GAT-QNN, a genetic algorithm (GA)-based framework that trains a macroCircuit (search space) by iteratively sampling microCircuits (subcircuits), training them, and reintegrating their learned parameters into the macroCircuit. After training, we run an independent GA-driven inference stage that evaluates candidate microCircuits using the trained macroCircuit weights and selects top-performing architectures for deployment. This two-stage approach enables backend-aware microCircuit selection without retraining each candidate architecture and can also reduce computational resources (gate count) by deploying smaller microCircuits derived from the macroCircuit. We validate the approach on MNIST classification (four classes) and report consistent 22-23% test accuracy gains for GA-driven inference across multiple backends.

We present a novel lackadaisical alternating quantum walk (LAQW) algorithm whose circuit depth scales as $\mathcal{O}(n^2+nt)$ for a $n\times n$ lattice over $t$ time steps. We show that this is a significant depth reduction compared to the existing controlled alternating quantum walk (CAQW) model, which has a circuit depth that scales as $\mathcal{O}(n^2t)$ (Li et al., 2017, arXiv:1707.07389). This makes the implementation of the LAQW viable for Noisy Intermediate-scale Quantum (NISQ) devices. We then showcase the applicability of the LAQW algorithm by proposing a chaos-based symmetric-key generation scheme. Our approach uses the LAQW as a quantum entropy source from which reproducible random bitstring sequences are generated using the underlying probability distribution and subsequent post-processing methods. We provide a comprehensive evaluation of the LAQW algorithm and demonstrate the reproducibility of 128-bit keys under simulated quantum noise provided by IBM's FakeTorino backend. A direct comparison with the CAQW model, which has been used in image encryption and hash function schemes (Li et al., 2017, arXiv:1707.07389; Abd EL-Latif et al., 2020, ScienceDirect; Abd El-Latif, Abd El-Atty, and Venegas-Andraca, 2020, ScienceDirect), highlights the potential and usefulness of the LAQW model in cryptographic applications.

The certification of quantum systems is essential for emerging quantum technologies, particularly in quantum communication, networks, and distributed computing, where maintaining a common reference frame across distant nodes poses significant challenges. Reference frame independent approaches, such as randomized measurement schemes, offer a promising route by reducing experimental demands while granting access to basis-independent quantities, including entanglement. However, the efficiency of such schemes in measuring such local invariants has remained unclear. In this work, we determine the minimal number of measurement settings required to access all two-qubit invariants. We further demonstrate that entanglement certification necessarily involves the most demanding invariants, establishing it as a maximally difficult task. Our results reveal a fundamental hierarchy among invariants, with direct implications for experimental feasibility and theoretical understanding of quantum certification. Finally, we extend our analysis beyond bipartite systems by applying it to the Kempe invariant in three-qubit systems, improving known measurement protocols and providing a first step toward uncovering similar hierarchies in higher dimensions.

Where is the true boundary of the quantum advantage region of decoded quantum interferometry (DQI)? The best existing answer is provided by Theorem 10.1 of Jordan et al., yet we show that this answer systematically underestimates the extent of quantum advantage. On the standard partial-win LDPC benchmark instance, there exist 26 consecutive parameter points (l in [642, 667]) at which Jordan's analysis declares no quantum advantage (<s>/m < 0.5), while quantum advantage is in fact present with an approximation ratio reaching 0.66. The root cause is that Jordan's bound penalizes the entire system with the worst-case Hamming-layer decoding failure rate epsilon = max_k epsilon_k, discarding the spectral structure of the DQI tridiagonal matrix. Exploiting the concentration of the Perron eigenvector, we replace the uniform penalty with the weighted average epsilon_bar = sum_k epsilon_k w_k^2 and establish a unified lower bound (Master Theorem) valid over arbitrary finite fields F_q, proving that it strictly improves upon the original bound from three independent sources.

While the geometry of equilibrium states and driven non-equilibrium processes is clearly understood, a geometric description for relaxation towards equilibrium is still lacking. Here, we propose a thermo-geometric measure based on the Rayleigh quotient, reformulating relaxation as a fundamental competition between entropic stiffness and frictional dissipation. Taking a van der Waals gas with two dissipation channels as an example, we explicitly demonstrate its relaxation landscape. Particularly, we find that upon approaching the critical temperature $T_c$, the slow-mode relaxation rate vanishes linearly as $λ_s \propto (T-T_c)/T_c$, indicating critical slowing down. This study completes the thermodynamic geometry framework, providing a general tool for characterizing the relaxation dynamics of complex systems.

Mechanically isolated defect centers in hexagonal boron nitride are promising coherent quantum emitters, yet spectral instabilities persist, and their spin-related nature remains unclear. Here we investigate a single mechanically isolated quantum emitter in hBN integrated onto a coplanar waveguide. The emitter exhibits exceptionally bright resonant fluorescence with saturation count rates exceeding $10\,\mathrm{Mc/s}$. High-resolution spectroscopy reveals two closely spaced zero-phonon-line transitions originating from the same defect complex. Time-resolved spectroscopy shows that these transitions exhibit markedly different spectral diffusion dynamics, consistent with distinct donor-acceptor-pair-like recombination pathways with different sensitivities to local electrostatic fluctuations. Off-resonant blue illumination redistributes emission between the two transitions and increases the emission duty cycle without significantly modifying the dominant spectral diffusion rates at low temperature, indicating repumping from long-lived shelving states. Magnetic-field-dependent photoluminescence, optically detected magnetic resonance, and pump-probe measurements reveal millisecond-scale relaxation dynamics and magnetic-field-dependent fluorescence contrast, demonstrating spin-dependent population dynamics in the metastable shelving state. These results clarify how charge-driven spectral fluctuations and spin-dependent shelving jointly shape the optical cycling dynamics.

We study the time it takes for all states of a finite quantum system to return simultaneously to their original configuration. In particular, we define the recurrence time for a quantum system to be the time at which all time-evolved states are close to their initial configuration, and at least one state has deviated significantly during this interval. Considering finite-dimensional quantum systems evolving unitarily, we find bounds on this notion of recurrence time, for continuous time and discrete time, by using Dirichlet's approximation theorem. We show how the problem of finding a bound on recurrence time can be related to approximating the difference of real numbers by rationals. We present a mathematical result on the latter, which we then use to obtain tighter bounds on recurrence time.

Near-infrared (NIR) emitters operating in the 650-900 nm range are highly attractive for imaging and sensing in turbid media; however, cadmium-free InP-based quantum dots (QDs) often suffer from limited brightness due to nonradiative pathways and inefficient photon outcoupling. In particular, heterostructured InP QDs can exhibit band alignments that induce partial spatial separation of charge carriers, leading to reduced electron-hole wavefunction overlap. This modifies intrinsic recombination dynamics and enhances the sensitivity of their emission to the surrounding photonic environment. Here, we investigate silver toroidal plasmonic nanoantenna dimers (Ag TPNDs) through finite-difference-time-domain (FDTD) simulations as a geometry-tunable platform for enhancing NIR emission of heterostructured InP-based QDs. The coupled toroidal geometry supports strongly confined bonding modes that generate intense nanogap hotspots, while its resonance can be systematically tuned through the toroid aspect ratio. By spectrally aligning the antenna response with QD emission bands (675-845 nm), we achieve large Purcell enhancements together with high quantum efficiencies, demonstrating efficient conversion of enhanced decay rates into radiative emission. We further show that nanometer-scale variations in emitter-antenna separation strongly modulate the radiative rates and spectral response. These results establish toroidal plasmonic nanodimers as a topology-driven platform for controlling emission in NIR quantum emitters and for advancing NIR nanophotonic applications.

We demonstrate unconventional photon blockade in a symmetric Kerr dimer driven with equal-amplitude fields at a $90^\circ$ phase difference. The minimum inter-cavity coupling is $J_{\min} = γ/4$ at a Kerr nonlinearity $U \ll γ$ achievable in standard photonic molecules. The quadrature-driven site emits strongly antibunched light with a smooth, oscillation-free second-order correlator directly resolvable with standard detectors. The scheme operates under continuous-wave and pulsed excitation, and fabrication disorder can be fully compensated by re-tuning the drive phase, removing the need for post-fabrication cavity trimming.

As quantum computing (QC) technologies mature, their integration into established high-performance computing (HPC) infrastructures is becoming a central objective for next-generation computing systems. However, unlocking the potential of hybrid platforms for computationally demanding workloads remains challenging. The mismatch between quantum and classical programming models, the limited maturity of quantum software stacks, and the scarcity of quantum processing units (QPUs) above all, necessitate scheduling strategies that go beyond standard HPC mechanisms to manage such heterogeneous and constrained resources. To address this issue, we investigate three distinct methodologies for HPC-QC resource scheduling: time-based multiplexing, dynamic resource management, and workflow decomposition. Experimental validation on production HPC clusters and real quantum hardware demonstrates the effectiveness of these approaches under different workload scenarios. Malleability and workflow strategies significantly optimize classical resource utilization, reducing consumption by up to 45.7% and 64% respectively, proving to be best fitted for hybrid jobs where quantum and classical workloads are evenly balanced. Conversely, time-multiplexing enhances QPU utilization and reduces execution time at the cluster level, making it the optimal strategy for the opposite context, which is characterized by high classical-quantum workload imbalances. These findings underscore the practical viability of tailored scheduling strategies for hybrid HPC-QC environments and highlight their complementarity in building efficient, scalable software stacks for next-generation quantum-accelerated facilities.

Levitated mesoscopic particles hold the promise of revolutionizing gravity sensing by using quantum effects. However, conventional quantum gravimeters based on such systems fail to harness the intrinsic large-mass advantage of the particles, because their commonly utilized auxiliary quantum systems counteract the role of mass as a resource. To overcome this limitation, we propose a quantum gravimetry by directly using the mechanical qubit (QM) formed by a levitated particle as the gravity sensor. Without resorting to the auxiliary quantum system, our scheme enables a straightforward readout of the particle's motion under gravitational influence. The obtained sensitivity behaves as a $m^{-1/2}$-scaling with the mass $m$. We also generalize our scheme to the \textit{mechanical cat qubit} as the gravity sensor. The sensitivity further scales as $N^{-1/2}$ with the mean phonon number $N$. In the experimentally realizable parameter regime, a sensitivity on the order of $0.1~ \text{\textmu}\text{Gal}/\sqrt{\text{Hz}}$ can be achieved, which outperforms the traditional schemes by two orders of magnitude. Reaching the \textit{double standard quantum limits} with $m$ and $N$ simultaneously, our scheme provides a feasible route toward compact high-sensitivity quantum gravimetry.

Floquet dynamical quantum phase transitions (FDQPTs) reveal many nonequilibrium critical phenomena in periodically driven quantum systems, and their underlying mechanisms have attracted deep attention in recent years. In this paper, we consider an extended XY spin chain under a periodic flux-quench protocol, and demonstrate the effect of the flux difference within each micromotion period on the emergence of FDQPTs, by analyzing physical quantities such as the Loschmidt echo, rate function, and dynamical topological order parameter (DTOP), etc. We also generalize the concept of quench fidelity to periodically driven systems, i.e., Floquet quench fidelity, and discuss the necessary and sufficient conditions for FDQPTs. In contrast to conventional single-quench scenarios, the occurrence of FDQPTs is determined by the requirement of Floquet fidelity condition and segment duration. Our framework may be applied generally to arbitrary periodically driven parameters, providing fundamental insights into how periodic protocols control nonequilibrium phase transitions in quantum many-body systems.

In a quantum LiDAR system, to achieve a better resolution and sensitivity, detection scheme plays an important role. We propose a novel detection scheme in which the photo detector considers only the $4n$ number of photons, where $n \in \mathbb{N}$, as a click and the rest of them as a no-click. Similar to the $Z$-detection scheme, where we get a click for any number of photons, we termed this measurement as $Z_{4n}$-detection scheme. By employing superposition of four coherent states (SFCS) and vacuum as input we investigate the performance of Mach-Zehnder interferometer (MZI) based quantum LiDAR systems. We found a significant enhancement in resolution and broader working point for the phase sensitivity in comparison to the $Z$-detection scheme. Our findings highlight the advantages of our approach and suggest promising advancements in the field of quantum LiDAR sensing technology, providing a pathway for more accurate and sensitive measurement capabilities.

We present a hardware demonstration and resource analysis of split-evolution quantum phase estimation (SE-QPE) on a Quantinuum System Model H2 quantum computer. SE-QPE is a modification to canonical QPE for particle-conserving Hamiltonians in which controlled time evolution is replaced by CSWAP-based interference between a target register and a reference register. For factorizations of time evolution with a shared eigenbasis, SE-QPE preserves the phase-register outcome distribution of canonical QPE and, unlike with compute--uncompute substitutions, it remains compatible with non-exact eigenstates. The substitution removes controlled-simulation overhead and enables parallel evolution on two registers, reducing the depth of each phase-kickback block. Resource analysis for Trotterized double-factorized chemistry Hamiltonians shows that the substitution becomes increasingly favorable at higher phase powers, as such combining QPE and SE-QPE implementations can be a useful option. Over a range of FeMoco active spaces, SE-QPE reduces time evolution resources, with asymptotic reductions of about 33% in CX count, 25% in $T$ count, and an asymptotic depth ratio of $3/N$ for CX layers. On Quantinuum H2-2, a four-qubit model ethylene demonstration with explicit inverse QFT and repeated phase-kickback steps up to 6 phase bits yields distinct energies and shows the auxiliary registers provide useful error detection filters.

We investigate the non-monotonic temperature sensitivity of a coherently driven two-level quantum system coupled to an Ohmic phonon environment. By employing a unitary polaron transformation, we account for phonon-induced renormalization effects that go beyond the standard weak-coupling approximations. Our analysis reveals that the Quantum Fisher Information (QFI) exhibits a prominent peak at an intermediate system-environment coupling strength, identifying an optimal regime for thermal sensing. This behavior emerges from a fundamental competition between environment-induced dissipation enhancement and the exponential suppression of system parameters due to phonon dressing. We demonstrate that while thermometric precision vanishes in both the ultra-weak and strong coupling limits, a properly tuned nonequilibrium steady state can significantly enhance sensitivity. These results suggest that environmental interactions, often viewed as detrimental decoherence sources, can be engineered as a resource to optimize the performance of solid-state quantum thermometers.

We present a time-dependent extension of logarithmic perturbation theory for nonrelativistic quantum dynamics governed by the Schrödinger equation, in which the logarithm of the wave function is expanded in powers of a coupling constant. The resulting hierarchy of equations defining the perturbative corrections is governed by a gauge-rotated Hamiltonian of the unperturbed system and leads to closed-integral expressions for the time-dependent corrections based on Duhamel's formula. This closed-integral structure of corrections is a hallmark of time-independent logarithmic perturbation theory and is preserved in the present extension. This structure, in particular, provides a computable expression for the instantaneous energy shift. Furthermore, dynamic energy shifts arise naturally within this framework in the form of time-averaged expectation values of pseudopotentials and can be related, for example, to AC Stark shifts and electric polarizabilities. As an illustration, we apply the method to the harmonic oscillator and the hydrogen atom, both driven by a time-dependent laser field. The harmonic oscillator provides a proof of principle for which the exact solution is recovered, while the hydrogen atom illustrates the method applied to atomic systems. Supported by numerical simulations, we demonstrate the applicability to obtain relevant physical observables with high accuracy. The present approach offers a promising alternative for analytical studies of time-dependent multi-photon processes in the perturbative regime.

Quantum coherence is a fundamental issue in quantum mechanics and quantum information processing. We explore the coherence dynamics of the evolved states in HHL quantum algorithm for solving the linear system of equation $A\overrightarrow{x}=\overrightarrow{b}$. By using the Tsallis relative $α$ entropy of coherence and the $l_{1,p}$ norm of coherence, we show that the operator coherence of the phase estimation $P$ relies on the coefficients $β_{i}$ obtained by decomposing $|b\rangle$ in the eigenbasis of $A$. We prove that the operator coherence of the inverse phase estimation $\widetilde{P}$ relies on the coefficients $β_{i}$, eigenvalues of $A$ and the success probability $P_{s}$, and it decreases with the increase of the probability when $α\in(1,2]$. Moreover, the variations of coherence deplete with the increase of the success probability and rely on the eigenvalues of $A$ as well as the success probability.

We demonstrate that the Ising all-to-all (ATA) model exhibits a range of dynamics, from integrable to chaotic, including mixed behaviour across symmetry blocks within a single system. While other works have explored the dynamics of all-to-all systems by varying parameters, we analyse a fixed set of parameters and examine the dynamics within different blocks. In addition to investigating the dynamical properties, we show that the system remains resilient to noise when the norm of the Hamiltonian representing the noise is close to 1. Our results are presented by mapping each symmetry sector of the system to a kicked top (KT) and observing that KT parameters for each sector depend on its dimension. This system, similar to the Bunimovich billiard for classical chaos, provides a new platform for studying dynamics determined by the symmetry sector, advancing quantum chaos research.

The plethora of possible ground states of spinor bosons placed in an external lattice and a cavity is revisited. We discuss the simplest case when the external lattice nodes coincide with the antinodes of the cavity field. We analyze the problem within the grand-canonical mean-field approach, considering both the homogeneous system and the nonhomogeneous case with a harmonic trapping potential. Due to the spin degree of freedom, in the homogeneous case we treat the system in a twofold manner: we impose the physically relevant total-magnetization constraint, while also discussing the minimization landscape for the full unconstrained problem. In the latter, by combining analytical arguments with numerical calculations based on the Gutzwiller ansatz, we show that the system exhibits two types of magnetic phases: an antiferromagnetic Mott insulator (AFM) and a ferromagnetic density wave (FDW). In addition, three distinct supersolid phases emerge, characterized by different patterns of spin and density imbalances. In case of the zero total magnetization, only two of the three supersolid regimes survive, and the FDW phases are replaced by entangled density waves (EDW). These new ground states present density-modulated superpositions of the underlying spin components of the bosons. Finally, we present the phase diagram of the trapped system, which is directly relevant for future experiments.

We introduce a general witness-based framework for quantifying and operationally activating continuous-variable (CV) resources into discrete-variable (DV) bipartite entanglement or Einstein- Podolsky-Rosen (EPR) steering. For the three standard CV resource theories associated with Wigner negativity (WN), genuine non-Gaussianity (GNG), and standard non-Gaussianity (SNG), we define infinite families of bounded-witness monotones indexed by box constraints on the witness operators. For closed convex free sets, these monotones are faithful, strongly monotonic under free instruments, Lipschitz continuous, and convex. For closed nonconvex free sets, we show that faithfulness requires a two-copy lift and formulate the corresponding strong-monotonicity statement in the lifted theory. We further construct witness-dependent completely positive trace-preserving (CPTP) measure-and-prepare channels whose outputs are two-qubit Werner states. For the representative case n = m = 1, the optimal entanglement and EPR steering attainable within this witness-dependent activation family are exactly proportional to the underlying monotones. We illustrate the framework with odd-parity states, pure-loss single-photon states, and Gottesman- Kitaev-Preskill (GKP) states, and derive explicit lower bounds for pure-state GNG and SNG. More broadly, our results show that closed CV free sets admit witness-based quantifiers with a direct operational interpretation in terms of experimentally accessible DV correlations.

The quantum Mpemba effect (QMpE) describes an anomalous thermalization phenomenon in which quantum states initially far from equilibrium can approach thermal equilibrium faster than states that begin closer to it. While this effect has been extensively studied in various frameworks, its practical implications for quantum information processing remain largely unexplored. We investigate the relationship between QMpE and quantum thermometry, focusing on non-equilibrium scenarios where measurements are performed during early-stage thermalization. In a Markovian model, we rigorously prove that the initial states that are optimal for thermometry exhibit QMpE with high probability and thermalize faster than most initial states. Our results reveal a fundamental connection between quantum thermodynamics and thermometry, suggesting that QMpE can be harnessed to enhance temperature estimation with quantum probes.

Non-Hermitian band descriptions capture how loss, gain, and environmental coupling reshape quantum matter, yet most experimental tests rely on wave-based or dynamical probes. Here we establish a new equilibrium route to exceptional physics in Dirac materials: in the weakly non-Hermitian regime, the thermodynamic density of states and the quantum capacitance exhibit a universal equilibrium approach to the exceptional point. In our minimal non-reciprocal graphene model, the hopping imbalance reduces the Dirac velocity as $v_F=v\sqrt{1-β^2}$, implying that the low-energy density of states, the thermodynamic density of states, and the quantum capacitance all scale as $(1-β^2)^{-1}$ as $|β|\to 1^-$. Consequently, at charge neutrality the quantum capacitance remains linear in temperature but with a diverging prefactor, while the inverse response softens linearly on approaching the exceptional point. In a magnetic field, this manifests as a collapse of the Landau-level spacing and a corresponding crowding of thermally active levels. Complementarily, the biorthogonal Bloch states exhibit a Petermann factor $K=(1-β^2)^{-1}$, which isolates the irreducibly non-Hermitian effect of eigenvector non-orthogonality. These results identify quantum capacitance as an experimentally accessible bulk equilibrium probe of effective non-Hermiticity in Dirac materials.

We construct upper bounds on entanglement entropies of many-body quantum states that have fixed energy expectation values with respect to geometrically local Hamiltonians. Our focus is on entanglement entropies of subsystems that make up approximately half of the full system. The upper bound on the von Neumann entanglement entropy is half the sum of the thermal entropies of two fictitious systems at the same temperature as one another, with an additional area-law contribution in some systems. The effective temperature is chosen such that the sum of the thermal energies of the two fictitious systems matches the constraint on the energy of the state in the original problem; at subextensive energies, this temperature decreases with increasing system size. Our upper bounds on Rényi entanglement entropies take an analogous form. As a first application we show that ground-state Schmidt ranks in frustration-free (FF) systems are upper bounded by the ground-state degeneracies of Hamiltonians acting on subsystems. Ground-state von Neumann and Rényi entanglement entropies therefore follow an area law when the zero-temperature thermal entropies of subsystems scale with surface areas, rather than with subsystem volumes. This result holds independently of the spectral gap. For physical models of quantum matter, which have well-defined specific heat capacities (and are not necessarily FF), our bounds provide a way to convert this thermodynamic data into constraints on pure-state entanglement at both subextensive and extensive energies. We also show that our upper bounds on half-system entanglement entropies are optimal, up to subleading corrections, in wide varieties of systems. Our results relate physical thermodynamic properties to the structure of many-body Hilbert space at low energies.

A mode sorter separates a set of M orthogonal spatial modes in a shared input channel into M different output channels. Here we present an analytic derivation and experimental validation of a single plane device for sorting spatial modes from a diverse variety of mode families, including Hermite-Gaussian (HG), Laguerre-Gaussian (LG), Bessel-Gaussian (BG), with almost no cross-talk. This sorting capability is required for a wide range of applications that employ classical or quantum light. We also show that applying this design in order to sort a set of Orbital Angular Momentum (OAM) modes with zero radial index reproduces the well-known Fork grating configuration. Furthermore, by taking the limit of M -> inf, we present an analytical expression for sorting all the modes of a given family. By operating this device in reverse, it can be used to generate arbitrary modes, by illuminating it with a Gaussian beam. The power transmission coefficient for this sorter goes as 1/M and we provide a mathematical proof that this is optimal for any typical arrangement of the detector positions. We further study the sorter sensitivity to wavelength and random phase noise.

We study quantum light-matter interfaces based on bilayer atomic arrays in free space, considering interlayer spacings $a_z$ that may deviate from the Bragg-symmetric condition, $a_z\in \mathrm{integer}\times λ/2$ with $λ$ the light wavelength. Mapping the problem to a one-dimensional model, we show that the interface efficiency is fully determined by simple scattering observables $-$ reflection and transmission $-$ providing a direct, experimentally accessible characterization. This reveals new opportunities for optimizing light-matter coupling by operating beyond the Bragg symmetry. In particular, we identify configurations that suppress diffraction losses via destructive interference, enabling substantially improved interface efficiencies compared to Bragg-constrained designs. In addition, we introduce a new quantum memory scheme based on a collective dark state whose coupling to light is continuously controlled by tuning the interlayer spacing. More broadly, our results establish non-symmetric atomic arrays as a flexible platform for efficient quantum interfaces in free space.

Quantum metrology promises precision beyond classical limits but environmental noise, unless properly controlled, reduces the quantum advantage to at most a constant improvement. A key challenge is therefore to design quantum control strategies that suppress noise while preserving sensitivity to the targeted signal. Here, we suggest to use dressed states generated by static fields to achieve this goal and show that success of this strategy depends on the spectral properties of the environment. For low-temperature noise, we show that Heisenberg scaling can be achieved if and only if the signal generator lies outside the linear span of the system-environment coupling operators. This implies that the proper dressed states may enable Heisenberg scaling even in cases where the well-known Hamiltonian-not-in-Lindblad-span criterion, evaluated without dressing, would forbid it. We illustrate dressed state metrology for the example of NV-center thermometry under magnetic-field fluctuations, with the framework readily applicable to other platforms.

Matrix models are an important class of systems in string theory and theoretical physics, with applications to random matrix theory, quantum chaos, and black holes. Hamiltonian Monte Carlo simulations and gauge/gravity duality have been used to study these systems at thermal equilibrium, and the bootstrap program has been used to efficiently determine operator expectation values by imposing positivity constraints. However, simulating real-time, non-equilibrium dynamics remains a fundamental challenge. In this work, we present the first digital quantum simulation of a bosonic matrix model, executed on the Quantinuum System Model H2 trapped-ion quantum computer. We focus on an $\mathrm{SU}(2)$ gauge theory with a quartic potential as it is simple enough to validate against exact classical solutions and yet complex enough to reflect the non-local structure of larger theories. Using the Loschmidt echo as our primary dynamical observable, we systematically decompose simulation errors into three distinct sources: Hilbert space truncation, Trotterization, and hardware noise. We demonstrate a new post-selection scheme that detects and discards gauge-symmetry violations in the Fock basis and show that at small scales it, along with zero-noise extrapolation, can give modest improvements in fidelity. These approaches struggle to scale to larger system sizes in their current implementations, emphasizing the need to move beyond them and to focus on depth reduction through improved compilation and unitary synthesis, and run-time error handling such as additional error suppression, error detection, as well as error correction approaches. This work establishes a foundation for extending digital quantum simulation to more complex matrix models -- revealing that fundamental challenges in qubit resources and circuit depth remain formidable obstacles for scaling to holographically interesting regimes.

Grover's algorithm accelerates unstructured database search quadratically compared to classical algorithms. In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise. In this paper, an algorithm for constructing query operators for subfunctions is proposed. By dividing the target string of the search problem into several substrings and integrating the query operator of each subfunction, a low-depth distributed exact quantum search algorithm is designed. The contributions of this paper are as follows: (1) The proposed distributed algorithm has a lower circuit depth and can mitigate error accumulation compared to distributed quantum search algorithms; (2) The target can be accurately located by the proposed distributed algorithm; (3) Experiments conducted with the quantum software MindQuantum confirm the effectiveness and feasibility of the proposed distributed algorithm. Moreover, the introduction of noise to the circuit during these experiments indicates that the algorithm possesses an inherent capacity for noise resistance.

We propose quantum algorithms for complex-valued nonlinear partial differential equations in the strongly nonlinear regime, where the dynamics is governed by vortex cores, phase singularities, and nonlinear vortex interactions. Examples include the complex-valued nonlinear Schrödinger equation, as well as nonlinear heat and wave equations with Ginzburg--Landau-type nonlinearity. In the strongly nonlinear regime, the solutions to these equations are asymptotically governed by, in leading order, linear elliptic equations, coupled with low-dimensional vortex dynamics, where the vortex cores correspond to topological defects in superconductors. Our hybrid quantum-classical algorithms utilize this asymptotic property, in which the vortex dynamic is advanced classically while the boundary-value problem of linear elliptic equation is handled by quantum algorithms. For the two-dimensional nonlinear Schrödinger equation, we also combine quantum BPX preconditioning with Schrödingerization to estimate physically relevant observables in the small-output regime. This yields, already in two dimensions, an {\it exponential} improvement in the dependence on the spatial problem size, while the dependence on the target accuracy remains essentially linear up to polylogarithmic factors. We further show that the same principle extends to dissipative Ginzburg--Landau vortex dynamics and to vortex filaments in three-dimensional superconductivity. Numerical results support the validity of this PDE reduction and the effectiveness of the proposed approach.

Recently, Dunjko et al.(PRL, 2018) proposed an algorithm for accelerating the solution of 3-satisfiability problems using a small-scale quantum computer. In this paper, we design a distributed quantum-classical hybrid algorithm for solving K-satisfiability problems. Under resource-constrained conditions, our algorithm achieves a significant acceleration in the core term of the exponential time complexity. The proposed algorithm is a generalization of the algorithm by Dunjko et al. Compared with their algorithm, our algorithm requires a smaller number of qubits. More importantly, the proposed algorithm does not rely on any quantum communication.

We define 2-indexed $(q,p)$-Schatten quasi-norms for any $q,p > 0$ on operators on a tensor product of Hilbert spaces, naturally extending the norms defined by Pisier's theory of operator-valued Schatten spaces. We establish several desirable properties of these quasi-norms, such as relational consistency and the behavior on block diagonal operators, assuming that $|\frac{1}{q} - \frac{1}{p}| \leq 1$. In fact, we show that this condition is essentially necessary for natural properties to hold. Furthermore, for linear maps between spaces of such quasi-norms, we introduce completely bounded quasi-norms and co-quasi-norms. We prove that the $q \to p$ completely bounded co-quasi-norm is super-multiplicative for tensor products of quantum channels for $q \geq p>0$, extending an influential result of [Devetak, Junge, King, Ruskai, 2006]. Our proofs rely on elementary matrix analysis and operator convexity tools and do not require operator space theory. On the applications side, we demonstrate that these quasi-norms can be used to express relevant quantum information measures such as Rényi conditional entropies for $α\geq \frac{1}{2}$ or the Sandwiched Rényi Umlaut information for $α< 1$. Our multiplicativity results imply a tensorizing notion of reverse hypercontractivity, additivity of the completely bounded minimum output Rényi-$α$-entropy for $α\geq\frac{1}{2}$ extending another important result of [Devetak, Junge, King, Ruskai, 2006], and additivity of the maximum output Rényi-$α$ entropy for $α\geq \frac{1}{2}$.

We study $\mathbb{Z}_3$-symmetric Rabi model that describes a three-level system coupled to two bosonic modes. We derive a mapping of the two-mode $\mathbb{Z}_3$ Rabi model onto a qubit-boson ring. This mapping allows us to formulate a realistic implementation of the $\mathbb{Z}_3$ Rabi model based on superconducting qubits. It also provides context for the previously proposed optomechanical implementation of the $\mathbb{Z}_3$ Rabi model. In addition, we propose a physical implementation of the $\mathbb{Z}_3$ Potts model via a coupled chain of $\mathbb{Z}_3$ Rabi models.

Semiclassical methods have been applied very successfully to describe the nontrivial transition from the quantum to the classical regime in $\textit{single}$-particle or at least $\textit{few}$-particle systems. Challenges on the way to an extension to $\textit{many}$-body systems result from the exponential proliferation of the number of classical orbits in chaotic systems and the exponential growth of the quantum Hilbert-space dimension with the particle number. To circumvent these problems, we apply here our recently developed duality relation. Considering the kicked spin chain as example for a many-body system, we show how the duality relation can be used to extract the classical orbits from the quantum spectrum. For coupled cat maps, we analyze the spectral statistics of chaotic many-body systems and discuss the double limit of large semiclassical parameter and large particle number.

The quantum Internet envisions a network where information is transmitted through entanglement, with Einstein-Podolsky-Rosen (EPR) pairs serving as one of the fundamental carriers. In this work, we propose a framework for dimensioning quantum memories capable of storing distilled EPR pairs useful to transmitting and manage quantum error correcting codes. Using a Markov chain model, we capture the stochastic evolution of stored entangled states in quantum memories, linking memory performance to system parameters such as technology characteristics and initial entanglement fidelity. Building on this framework, we provide analytical tools and design principles for optimizing memory architectures that preserve high-fidelity entanglement over time, ensuring the availability of encoded quantum resources necessary for several operations in future quantum Internet infrastructures transmitting EPR packets.

This study evaluates colorectal risk factors and compares classical models against Quantum Neural Networks (QNNs) for anastomotic leak prediction. Analyzing clinical data with 14\% leak prevalence, we tested ZZFeatureMap encodings with RealAmplitudes and EfficientSU2 ansatze under simulated noise. $F_β$-optimized quantum configurations yielded significantly higher sensitivity (83.3\%) than classical baselines (66.7\%). This demonstrates that quantum feature spaces better prioritize minority class identification, which is critical for low-prevalence clinical risk prediction. Our work explores various optimizers under noisy conditions, highlighting key trade-offs and future directions for hardware deployment.

We study a Su-Schrieffer-Heeger chain coupled to a single mode photonic cavity. Considering an off-resonant regime we use the high-frequency expansion in order to obtain an effective fermionic Hamiltonian with cavity-mediated interactions. We characterize the effects of the cavity on topology in a finite size chain by studying three different markers adapted for interacting systems: correlation functions between edges in a chain with open boundary conditions, and a winding number based on the single-particle Green's function and bulk electric polarization via the many-body formula by Resta for a chain with periodic boundary conditions. There is excellent agreement between the winding number and polarization approaches to compute the phase diagram, with the presence of the edge states being confirmed through the calculations of the two-point correlation function. Our approach provides an alternative perspective on cavity-modified topological phases through a study of an effective interacting electronic Hamiltonian and complements methods that treat the full light-matter Hamiltonian directly.

We present a Krylov space based theoretical framework for modeling inhomogeneous spin ensembles with arbitrary distributions of spin frequencies and couplings. The framework is then used to asymptotically large spin ensemble. In the single-excitation subspace, the Krylov construction allows for to derive exact expressions for the Lieb-Robinson velocity and quantum speed limit, and figure of merit such as Krylov complexity. Our work reveals a strong dependence of the speed of information flow on the statistical distribution of resonance frequencies in the spin ensemble with immediate implications for the design of components for quantum technologies, realized for example with nitrogen vacancy centers, nuclear spins or ultracold atoms.

The storage of quantum information in spin-ensembles is limited by practically unavoidable inhomogeneous broadening, and the macroscopic number of spins in such an ensemble makes the design of control solutions to increase the coherence time a challenging task. Together with a concurrently developed Krylov theory that allows us to treat the control problem efficiently, we design optimal cavity modulation for such spin ensembles that achieve an order of magnitude enhancement in qubit lifetime compared to the losses due to inhomogeneity and cavity decay.

The Off-Resonant Cascaded Absorption (ORCA) protocol in warm atomic vapors offers a scalable platform for high-bandwidth, low noise quantum memories, but its coherence time is fundamentally limited by Doppler-induced dephasing. We introduce and experimentally demonstrate a dynamic rephasing protocol that counteracts Doppler dephasing in a telecom-band ORCA quantum memory. By transferring the stored excitation to an auxiliary shelving state, we effectively reverse the accumulated Doppler phase and extend the storage time by a factor of 50 while preserving the memory's GHz bandwidth and low noise. Using this protocol, we then demonstrate on-demand storage and retrieval of four independent time-bin modes within a single warm vapor memory -- showing that Doppler dephasing can alternatively be harnessed for high-dimensional temporal mode processing. Our results establish rephasing in warm atomic vapors as a viable route toward high-bandwidth, temporally multiplexed quantum memories operating at room temperature.

This paper introduces the concept of the wandering range of a robust symmetry $S$ of a Hamiltonian $H$. This quantity measures how the perturbed time evolution $\mathrm{e}^{\mathrm{i}t(H+\varepsilon V)} S \mathrm{e}^{-\mathrm{i} t(H+\varepsilon V)}$ deviates from its unperturbed counterpart $\mathrm{e}^{\mathrm{i} tH} S\mathrm{e}^{-\mathrm{i} tH} = S$. Although the wandering range does not necessarily scale linearly with the perturbation strength $\varepsilon$, we identify conditions under which this linear behavior is recovered and we obtain explicit nonperturbative bounds.

Quantum-limited parametric amplifiers are essential components for many quantum technologies operating in the microwave domain. Achieving both high gain and broad bandwidth, however, remains challenging due to trade-offs between gain and bandwidth, pump efficiency, and dynamic range. Moreover, high-gain broadband amplifiers become increasingly sensitive to their external electromagnetic environment, which can distort their gain spectra and hinder reliable operation. Here, we present an accurate theoretical model and a systematic design methodology for a flux-driven, lumped-element Josephson parametric amplifier based on a SQUID array. Our device achieves near-quantum-limited, phase-preserving amplification with a net gain of 20 (maximally 44) dB and a 3-dB bandwidth of $\sim$50 ($\lesssim$0.2) MHz. We further show that the gain spectra exhibit pronounced sensitivity to weak reflections in the input-output waveguide caused by impedance mismatches in the microwave environment. By incorporating Fabry-Pérot-type interference into a quantum input-output model, we analytically reproduce these complex spectral features and identify how they depend on the physical parameters of the environment. More generally, our results provide a practical framework for separating the intrinsic dynamics of parametric amplifiers from environmental effects. This approach enables reliable characterization and optimization of amplifier performance while providing a systematic strategy for diagnosing microwave reflections and engineering environmental interference to shape amplifier gain spectra, thereby offering a pathway toward robust, reproducible, and truly quantum-limited microwave amplification.

We propose Scalable Quantum Molecular Generation (SQMG), a variational quantum-circuit for sampling molecular graphs using chemical priors on atoms and bonds. SQMG assigns a fixed 3-qubit register to each heavy atom and reuses a single 2-qubit bond register to generate bonds sequentially, yielding an ''atom no-reuse, bond reuse'' architecture with linear qubit scaling. Measurement results are mapped to molecular graphs via lightweight classical decoding with structural constraints. In CUDA-Q, we benchmark the state-vector simulation (CPU/GPU) and the tensor-network simulation (GPU). At $N=8$ heavy atoms, the state-vector simulator (GPU) and the tensor-network simulator (GPU) achieve speeds of up to $4.5\times 10^{4}$ and $2.2\times 10^{3}$ over the state-vector (CPU) baseline, respectively. Crucially, tensor-network simulation extends exact simulation to $N=40$ heavy atoms, where state-vector methods become memory-limited. For training, Bayesian optimization outperforms COBYLA on a Validity$\times$Uniqueness objective, and the same architecture supports \textit{de novo} generation, scaffold decoration, and linker design. Overall, SQMG provides a scalable, reproducible testbed for evaluating accelerated tensor-network simulation and future quantum molecular generation algorithms.

We study transient entanglement generation between two quantum nodes coupled through a chiral one-dimensional channel. In an emitter-only Born-Markov description, we show that continuous driving and an initial ground state can raise the maximum transient concurrence above the undriven $2/e$ benchmark associated with the effectively single-excitation model. We then consider a more microscopic XX spin-chain channel with triangular plaquette couplings and compare a nonsecular time-convolutionless master equation (TCL-ME) with matrix-product-state (MPS) simulations. In the optimal driven regime, the nonsecular TCL-2 treatment reproduces the concurrence envelope and first transient peak qualitatively, while the remaining discrepancy is mainly attributable to beyond-Born system-bath correlations. The enhancement is traced to the failure of the secular approximation under strong driving, where nearby dressed transitions are not well separated on the dissipative timescale and nonsecular terms mix dressed-state coherences. Finally, we examine within TCL-2 the sensitivity of the protocol to positional disorder, imperfect chirality, and loss into nonguided modes. These results clarify when the familiar $2/e$ limitation ceases to apply and separate the roles of secular breakdown, Born-factorization error, and reduced-state memory in driven chiral entanglement generation; we believe that our study contributes to one of the first studies where the breakdown of the secular approximation is useful rather than detrimental.

Quantum simulation with controllable many-body platforms offers a powerful route to exploring complex phases and dynamics that are difficult to access in natural materials. Among these, topological spin textures such as skyrmions are central to modern condensed-matter physics and play a key role in chiral quantum many-body systems. Their controlled realisation in large, programmable quantum platforms, however, remains an outstanding challenge. Here, we report deterministic generation and site-resolved reconstruction of topological spin textures in a two-dimensional crystal of more than 150 trapped ions. Using globally applied spin-dependent forces, we generate skyrmion configurations and reconstruct the full vector spin field with single-ion resolution, obtaining a winding number of 0.99$\pm$0.02 and a mean local fidelity of 0.87$\pm$0.04. In addition, we implement single-ion-resolved control to deterministically prepare domain-wall states, extending our approach to a broader class of non-uniform spin textures. These results establish trapped-ion crystals as a platform for engineering complex spin textures and open the door to exploring topology-dependent nonequilibrium dynamics in long-range interacting quantum systems.

We study bipartite entanglement harvesting from the quantum vacuum of a massless scalar field between two subsystems, each composed of a finite number of Unruh-DeWitt detectors. Using perturbation theory, we show that the leading-order negativity is fully determined by a submatrix of the reduced density matrix, with the submatrix dimension scaling only linearly with the number of detectors. Within this framework, we analyze how the detectors' spatial arrangement influences harvesting. For all three-detector configurations and several symmetric four-detector configurations, we derive analytic expressions for the negativity and identify the configurations that maximize it. For a linear chain, we find that the harvested entanglement scales linearly with the number of detectors. These results clarify how to arrange multiple detectors to optimize harvesting and show that increasing their number broadens the ranges of energy gaps and separations over which entanglement can be extracted from the field.

The strong dipole-dipole interaction of trapped Rydberg ions offers the possibility of sub-microsecond entanglement gates. For example a two-qubit Control-Phase gate in 88 Sr + ions can be realized, by simultaneous excitation to the Rydberg states via stimulated Raman adiabatic passage (STIRAP) with simultaneous microwave induced dipole-dipole interaction. We show that this excitation protocol distorts the dark-state of the STIRAP stage and is prone to decay from the intermediate state. Here, we propose a novel pulse ordering, in which the STIRAP and the microwave dressing of the Rydberg states occurs in separate stages, preventing mutual interference effects that are detrimental to the gate fidelity. We show that, for experimentally feasible parameters, the proposed excitation scheme can achieve a fidelity of 99.93%, surpassing the experimentally demonstrated gate. In addition, we demonstrate a non-adiabatic speed-up to 400 ns by employing asymmetric pulse shapes in the STIRAP stage. The entangling phase is then controlled solely through the interaction strength by nonresonant asymmetric chirping of the microwave field.

Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the network functioning. In this paper, we proposed a novel entanglement-driven routing framework that exploits multipartite entanglement complementation for enabling simultaneous 1-hop connectivity among all non-adjacent source-destination pairs. This changes the notion of ``remoteness'' in the entanglement graph, activated by entanglement. We extend this framework to inter-domain quantum networks and design a polynomial-time algorithm. Such an algorithm allows to select and parallelize multiple requests, bypassing NP-complete path discovery. Performance analysis shows the proposed routing strategy achieves up to $60\%$ hop reduction, with the algorithm enabling efficient parallelism and strong scalability in inter-domain quantum networks.

Nanoplasmonic modification of scintillation has so far been explored mainly in the weak-coupling regime, where changes in the local density of optical states enhance radiative recombination via Purcell-type rate engineering. By contrast, strong light-matter coupling generates hybrid states that modify emission dynamics beyond simple decay-rate acceleration, but its implications for scintillator nanocrystals (NCs) under ionizing radiation remain poorly understood. All of these effects are beneficial for near-infrared scintillators, which are typically slow and have low brightness. Here, we present a quantum-optical framework to investigate how near-infrared scintillator NCs coupled to nanoplasmonic antennas evolve from weak coupling toward strong light-matter coupling. We compare broad- and narrow-antenna platforms with single and periodic Au nanorods and benchmark them against conductive plasmonic antennas based on indium tin oxide and graphene. As representative emitters, we consider wide-band PbS NCs and narrow-band cubic Lu2O3:Er3+ scintillators. The calculations show that the onset of strong-coupling signatures is jointly governed by emitter dephasing and the antenna linewidth, with narrow-band emitters coupled to spectrally narrow antennas providing the most favorable conditions. Among the platforms considered, graphene gives the lowest threshold (g = 4 meV) for observable coherent exchange owing to its ultranarrow antenna linewidth (\k{appa} = 3.5 meV). These results identify near-infrared conductive nanoantennas, particularly graphene-based ones, as promising platforms for accessing hybrid scintillation regimes relevant to radiation detection.

Spin shuttling has crystalized as a powerful and promising tool for establishing intermediate-range connectivity in semiconductor spin-qubit devices. Although experimental demonstrations have performed exceptionally well on different materials platforms, the question of how to handle areas of low valley splitting in silicon during shuttling remains unresolved. In this work, we explore the possibility of utilizing the valley degree of freedom, particularly in regions of low valley splitting, to allow mobile spin qubits to be shuttled through an occupied stationary quantum dot, thereby leapfrogging over the stationary electron. This not only grants a more enriched mobility for shuttled electrons, as it opens new possible routing paths, but also enables the implementation of an entangling SWAP$^γ$ two-qubit gate operation in the process. Simulating this process for different sets of parameters, we demonstrate the feasibility of such an operation and offer a unique use case for otherwise precarious regions of a quantum processor chip and propose a possible extension to the set of possible operations for silicon spin qubit devices.

This work identifies a necessary condition for any variational quantum approach to reach the exact ground state. Briefly, the norms of the projections of the input and the ground state onto each group module must match, implying that module weights of the solution state have to be known in advance in order to reach the exact ground state. An exemplary case is provided by matchgate circuits applied to problems whose solutions are classical bit strings, since all computational basis states share the same module-wise weights. Combined with the known classical simulability of quantum circuits for which observables lie in a small linear subspace, this implies that certain problems admit a classical surrogate for exact solution with each step taking $O(n^5)$ time. The Maximum Cut problem serves as an illustrative example.

Vortex $γ$ photons in superposition states have important applications in photonuclear, high-energy, and strong-field physics. However, their controlled generation in the $γ$-ray regime remains a great challenge. Here, we put forward a novel method for the generation of vortex $γ$ photon in superposition states, with controllable orbital angular momentum (OAM) separation $Δ\ell^\prime$ and modal weights, via nonlinear Compton scattering driven by multifrequency circularly polarized laser fields. We develop a strong-field quantum electrodynamics (QED) framework to reveal the underlying mechanism and calculate the radiation probabilities. In our method, the superposition arises from interference between energy-degenerate multiphoton pathways carrying distinct OAM. For two-frequency fields, the OAM separation follows $Δ\ell'=ν\mp1$ (upper/lower sign for equal/opposite helicities), and modal weights are tunable by laser intensities, with $ν$ the frequency ratio. Vortex $γ$ photons in controllable superposition states from our method have significant applications in strong-field QED and nuclear photonics.

Accurately modelling many-body quantum transport systems poses a challenge both conceptually and computationally due to the growth of the Hilbert space and the multi-scale nature of the geometries and couplings present in most naturally occurring networks. A compounding complexity of such systems is that the environment typically plays a key role in the transport dynamics. Utilising variational unitary transformations that displace environmental degrees of freedom allows for the deployment of a second-order master equation capable of capturing the dynamics of intermediate and strongly coupled systems, which are ubiquitous in microscopic energy transport systems. However, direct implementations of this approach suffer from fundamental scalability issues due to the complexity of the self-consistent equations required to solve for the variational parameters. Here, we present an efficient partitioning scheme that leverages the inherent multi-scale nature of natural energy transport networks. This enables scaling of the variational polaron framework to quantum energy transport systems, constituting hundreds to thousands of sites. Our work unlocks the physically motivated exploration of large transport networks, for example, those present within light-harvesting complexes and exciton transport in disordered semiconductors.

The Heisenberg position-momentum uncertainty relation is a cornerstone of quantum mechanics. However, its standard formulation is not fully consistent with special relativity. While partial understanding has been achieved in the ultra-relativistic regime, a comprehensive description is still lacking, particularly in the intermediate velocity domain, where particle speeds remain well below the speed of light yet relativistic corrections are expected to become appreciable. This regime constitutes the most promising arena for experimentally probing relativistic modifications of quantum uncertainty. By adopting a variational approach, in this work we derive a relativistic extension of the Heisenberg algebra within the framework of $κ$-deformed Kaniadakis statistics. The latter emerges from the application of the Maximum Entropy Principle to Kaniadakis entropy, a one-parameter generalization of the Boltzmann-Gibbs-Shannon entropy naturally induced by Lorentz transformations. We investigate the physical implications of the resulting uncertainty relation, deriving constraints on the Kaniadakis parameter from precision measurements of the fine-structure constant and confronting our construction with other extensions discussed in the recent literature.

Superconducting microwave quantum networks is a rapidly developing field, enabling distributed quantum computing and holding a promise for hybrid architectures in quantum internet. Quantum secret sharing (QSS) is one of the key protocols for multipartite quantum networks and can provide an unconditionally secure way to share quantum states among $n$ players. Using microwave two-mode squeezed states as an entanglement resource, we experimentally implement a QSS protocol with $n = 3$, where a subset of at least $k = 2$ players must collaborate to faithfully reconstruct the original secret state. We demonstrate reconstructed-state fidelities that surpass the asymptotic no-cloning threshold of $F_\textrm{nc} = 2/3$ and identify a parameter regime that allows for unconditionally secure communication in the presence of an omnipotent dishonest player. Furthermore, we experimentally explore inherent connections between QSS and other important quantum information processing tasks, such as quantum dense coding and elementary quantum error correction of channel erasures. Finally, we discuss extensions of QSS and its relation to the concept of blind quantum computing.

Response theory describes the reaction of observales to perturbations in external fields. We review this formalism for quantum fiels in isolation that have unitary time evolution. An emphasis is put on consequences of causality and the resulting spectral representations for linear and nonlinear response functions, on functional techniques and generating functionals, including the description of the initial state, the evolution, and measurements. We review consequences of time reversal symmetry and relations for the statistics of work, and discuss a large class of quantum correlation functions, and their relation to response functions through fluctuation-dissipation relations. Consequences of conservation laws and gauge symmetries are mentioned briefly.

Multi-task learning (MTL) improves generalization and data efficiency by jointly learning related tasks through shared representations. In the widely used hard-parameter-sharing setting, a shared backbone is combined with task-specific prediction heads. However, task-specific parameters can grow rapidly with the number of tasks. Therefore, designing multi-task heads that preserve task specialization while improving parameter efficiency remains a key challenge. In Quantum Machine Learning (QML), variational quantum circuits (VQCs) provide a compact mechanism for mapping classical data to quantum states residing in high-dimensional Hilbert spaces, enabling expressive representations within constrained parameter budgets. We propose a parameter-efficient quantum multi-task learning (QMTL) framework that replaces conventional task-specific linear heads with a fully quantum prediction head in a hybrid architecture. The model consists of a VQC with a shared, task-independent quantum encoding stage, followed by lightweight task-specific ansatz blocks enabling localized task adaptation while maintaining compact parameterization. Under a controlled and capacity-matched formulation where the shared representation dimension grows with the number of tasks, our parameter-scaling analysis demonstrates that a standard classical head exhibits quadratic growth, whereas the proposed quantum head parameter cost scales linearly. We evaluate QMTL on three multi-task benchmarks spanning natural language processing, medical imaging, and multimodal sarcasm detection, where we achieve performance comparable to, and in some cases exceeding, classical hard-parameter-sharing baselines while consistently outperforming existing hybrid quantum MTL models with substantially fewer head parameters. We further demonstrate QMTL's executability on noisy simulators and real quantum hardware, illustrating its feasibility.

While the quantum regression theorem (QRT) is the standard tool for computing multi-time correlation functions in open quantum systems, it relies on system-bath separability and an environment that remains in equilibrium, assumptions that are violated once dynamical correlations develop. Using the projection operator formalism, we derive an extension to the QRT that explicitly incorporates these correlation-induced corrections. We apply this framework to the variational polaron master equation for the spin-boson model in ohmic and super-ohmic regimes, where the polaron transformation mixes system-bath degrees of freedom to produce a non-thermal effective environment. Benchmarking against numerically exact tensor-network simulations demonstrates quantitative agreement for single- and two-time observables, including linear-response spectra, even at strong coupling. Our approach broadens the reach of analytic master equations to strong-coupling regimes, enabling treatment of multi-time observables where environmental memory effects and system-bath correlations are crucial.

The resource-theoretic approach to quantum thermodynamics assumes complete knowledge of the thermal equilibrium against which thermodynamic resources are defined. In practice, however, this state is determined by the system Hamiltonian and the bath temperature, neither of which is known with perfect precision. We develop a framework in which the equilibrium reference is specified by a set of candidate states reflecting this uncertainty. Under a generic geometric condition, we prove a no-go theorem that sharply limits athermality ``purification'': conversion from an uncertain athermality resource to a definite target is either trivial or impossible, with no room for tradeoff. We then introduce two complementary battery models: a clean battery with a precisely known equilibrium state and a dirty battery with an uncertain one. For both models, we derive exact one-shot entropic characterizations of work extraction and work of formation in terms of standard min- and max-relative entropies and new subspace-constrained variants. In the asymptotic regime, both models exhibit a strong form of thermodynamic irreversibility. In particular, we give a simple and explicit example in which, in the clean-battery model, work is required to form a state but no work can be extracted from it, in direct analogy with bound entanglement, whereas in the dirty-battery model, work can be extracted but formation requires infinite work cost. These phenomena persist even under arbitrarily small uncertainty, showing that equilibrium uncertainty is not a minor perturbation of the standard theory but a qualitatively new ingredient that reshapes the fundamental limits of thermodynamic resource interconversion.

Quantum simulation is a cornerstone application of quantum computing, yet how fundamental quantum resources--entanglement and non-stabilizerness (``magic")--shape simulation fidelity remains an open question. In this work, we establish a rigorous connection between these resources and the statistical behavior of algorithmic errors arising in Hamiltonian simulation based on the Trotter-Suzuki formula. By analyzing ensembles of states with fixed entanglement entropy or magic, we make two key discoveries: First, the variance of the Trotter error decreases with increasing entanglement entropy, indicating a stronger concentration of error for entangled states. Moreover, we find that the kurtosis of the error exhibits a negative linear dependence on magic, implying that states with high magic possess lighter-tailed error distributions and thus a reduced probability of large deviations. These findings reveal a subtle phenomenon: quantum resources that obstruct classical emulation may, paradoxically, enhance the intrinsic robustness of quantum simulation, highlighting a constructive interplay between complexity and stability in quantum computation.

Characterizing the quantum state of intense light fields on sub-cycle timescales remains beyond the reach of existing methods. Here, we show that attosecond streaking provides direct, phase-sensitive access to the quantum properties of the driving field through delay-resolved photoelectron spectra. Using a Feynman--Vernon treatment, we decompose the influence of the quantized driving field on the photoelectron into coherent and fluctuation contributions. This yields a simple, moment-based characterization of the light state: the first moment of the photoelectron momentum distribution reveals the coherent displacement, while the second central moment captures the fluctuation contribution and, for squeezed states, exhibits a clear modulation at twice the driving frequency, directly signaling phase-sensitive quantum noise. Time-dependent Schrödinger equation simulations confirm these relations and enable retrieval of the coherent phase, the squeezing phase, and the relative strengths of the coherent and fluctuation contributions from delay-resolved spectra. Taken together, these results establish attosecond streaking as a route to sub-cycle quantum-optical metrology in the strong-field regime.

We theoretically investigate the statistical properties of photon emission of a driven two-level single-molecule system undergoing spectral diffusion induced by nonequilibrium environmental fluctuations. Within the framework of the generating function method and the stochastic Liouville equation, we analyze the influence of the nonequilibrium characteristics of environmental fluctuations respectively governed by nonstationary Ornstein-Uhlenbeck noise and random telegraph noise on the photon counting statistics of the driven single-molecule system. In the slow modulation limit of spectral diffusion, the intensity and statistical fluctuations of photon emission depend on the environmental nonequilibrium characteristics at short time scales, whereas they become independent of the nonequilibrium characteristics of environmental fluctuations in the steady state. In the fast modulation limit of spectral diffusion, neither the line shape nor the Mandel's parameter depends on the environmental nonequilibrium characteristics owing to the rapid relaxation of environmental fluctuations. These findings not only shed light on the role of nonequilibrium environmental fluctuations in shaping the photon emission properties of single-molecule systems but also provide a basis for distinguishing between equilibrium and nonequilibrium characteristics of environmental fluctuations in experimental measurements.

Variational quantum algorithms on bosonic quantum processors are an emerging paradigm for quantum chemistry calculations, exploiting the natural alignment between molecular structure and harmonic oscillator-based hardware. We introduce the qumode-based variational quantum deflation framework (QumVQD) for finding both electronic and vibrational excited state energies on qumode-based architectures. For electronic structure, we incorporated particle number conservation constraints via Fock basis Hamming weight filtering. This symmetry enforcement achieves a significant reduction in computational overhead, scaling the Hilbert space dimension as O$M \choose n_e$ rather than O$(2^M)$ for $M$ spin orbitals and $n_e$ electrons. We validate the approach through electronic structure calculations on H$_{\text{2}}$, achieving agreement with full configuration interaction (FCI) using the STO-3G basis within chemical accuracy across potential energy surfaces. Extending to vibrational structure, we combine QumVQD with Hamiltonian fragmentation based on Bogoliubov transforms, computing CO$_{\text{2}}$ and H$_{\text{2}}$S vibrational eigenstates to spectroscopic accuracy with entangling gate counts 1-2 orders of magnitude lower than analogous qubit-based algorithms. We performed noise characterization using amplitude-damping models and gate-fidelity analysis, which demonstrates enhanced error resilience due to reduced circuit depth compared to qubit-based algorithms. Together, these results highlight the potential of bosonic quantum devices for advancing computational chemistry, particularly in areas where qubit-based devices struggle.

In Si(111) crystals, a strong biaxial tensile strain applied within the (111) plane is considered to shift the lowest energy point of the conduction band from the $Δ$ valley to the L valley. Electrons confined in this L valley experience a splitting of their quadruply degenerate energy levels into an undegenerate single-level ground state (L1) and a triply degenerate excited state (L3). The energy of the single-level ground state is sufficiently low relative to the energies of the L3 valley and the $Δ$ valley, making it optimal as a two-level system for a qubit. Using deformation potential theory and incorporating quantum effects from electron confinement in the SiGe/Si(111)/SiGe structure, we determine the value of the biaxial tensile strain causing the shift of the conduction band energy minimum from the $Δ$ valley to the L valley, along with the corresponding Ge concentration. We also calculate the critical thickness for the plastic relaxation of the Si quantum well under this large biaxial tensile strain and examine the feasibility of realizing it as a SiGe/Si(111)/SiGe heterostructure.

We construct for a Schur concave function $f$ on the set of quantum states a tight upper bound on the difference $f(ρ)-f(σ)$ for a quantum state $ρ$ with finite $f(ρ)$ and any quantum state $σ$ $m$-partially majorized by the state $ρ$ in the sense described in [1]. We also obtain a tight upper bound on this difference under the additional condition $\frac{1}{2}\|ρ-σ\|_1\leq\varepsilon$ and find simple sufficient conditions for vanishing this bound with $\,\min\{\varepsilon,1/m\}\to0\,$. The obtained results are applied to the von Neumann entropy. The concept of $\varepsilon$-sufficient majorization rank of a quantum state with finite entropy is introduced and a tight upper bound on this quantity is derived and applied to the Gibbs states of a quantum oscillator. We also show how the obtained results can be reformulated for Schur concave functions on the set of probability distributions with a finite or countable set of outcomes.

In this work we explore the potential of implementing an optical quantum optimizer using non-linear optics, specifically using sum-frequency generation and/or two photon absorption. This proposal uses Zeno effects to enforce independence constraints and then a linear protocol to find a maximum independent set in a way where the elements of the set can be weighted. Our proposal can either be viewed as an implementation of the entropy computing paradigm presented in [Nguyen et.~al.~Communications Physics 1, 411, 8] which uses real rather than imaginary time evolution, or as quantum annealing within a Zeno constrained subspace. We discuss how such a device could be built, and considerations such as error mitigation, particularly for photon-loss errors. We numerically study aspects of the protocol, including the effect of coherent versus incoherent incarnations of the Zeno effect, finding superior performance from the former.

Many-body cages have very recently emerged as a general route for nonergodic behaviour in quantum matter. Here, we show that new types of many-body cages can be engineered in Floquet circuits with the potential to realize novel nonequilibrium quantum states. For that purpose, we first identify an explicit, general construction of Floquet circuits capable of hosting many-body cages. We then present a generic strategy to engineer and structure Floquet many-body cages. We demonstrate the developed scheme for the quantum hard disk model as a generic constrained model system, realizable for instance in Rydberg atom arrays. We construct Floquet circuits yielding Floquet many-body cages with topological properties and $π$-quasienergy modes, implying `time crystalline' spatiotemporal order. Our results can be directly extended to general quantum circuits, thus providing a new tool to engineer nonequilibrium behaviour in driven systems.

We study the computational complexity of 2-local Hamiltonian problems generated by a positive-weight symmetric interaction term, encompassing many canonical problems in statistical mechanics and optimization. We show these problems belong to one of three complexity phases: QMA-complete, StoqMA-complete, and reducible to a new problem we call EPR*. The phases are physically interpretable, corresponding to the energy level ordering of the local term. The EPR* problem is a simple generalization of the EPR problem of King. Inspired by empirically efficient algorithms for EPR, we conjecture that EPR* is in BPP. If true, this would complete the complexity classification of these problems, and imply EPR* is the transition point between easy and hard local Hamiltonians. Our proofs rely on perturbative gadgets. One simple gadget, when recursed, induces a renormalization-group-like flow on the space of local interaction terms. This gives the correct complexity picture, but does not run in polynomial time. To overcome this, we design a gadget based on a large spin chain, which we analyze via the Jordan-Wigner transformation.

The Energy Conserving Descent (ECD) algorithm was recently proposed (De Luca & Silverstein, 2022) as a global non-convex optimization method. Unlike gradient descent, appropriately configured ECD dynamics escape strict local minima and converge to a global minimum, making it appealing for machine learning optimization. We present the first analytical study of ECD, focusing on the one-dimensional setting for this first installment. We formalize a stochastic ECD dynamics (sECD) with energy-preserving noise, as well as a quantum analog of the ECD Hamiltonian (qECD), providing the foundation for a quantum algorithm through Hamiltonian simulation. For positive double-well objectives, we compute the expected hitting time from a local to the global minimum. We prove that both sECD and qECD yield exponential speedup over respective gradient descent baselines--stochastic gradient descent and its quantization. For objectives with tall barriers, qECD achieves a further speedup over sECD.

Neutrino billiards serve as a model system for the study of aspects of relativistic quantum chaos. These are relativistic quantum billiards consisting of a spin-1/2 particle which is confined to a planar domain by imposing boundary conditions on the spinor components which were proposed in [Berry and Mondragon 1987, {\it Proc. R. Soc.} A {\bf 412} 53) . We review their general features and the properties of neutrino billiards with shapes of billiards with integrable dynamics. Furthermore, we review the features of two neutrino billiards with the shapes of billiards generating a chaotic dynamics, whose nonrelativistic counterpart exhibits particular properties. Finally we briefly discuss possible experimental realizations of relativistic quantium billiards based on graphene billiards, that is, finite size sheets of graphene.

While Quantum Key Distribution (QKD) has been proven in lab environments, large-scale implementation requires integration with existing infrastructure. This paper proposes an opportunistic QKD framework that takes advantage of idle spectral capacity, that is, unused channels in classical fibers, to perform QKD while prioritizing classical traffic. To mitigate crosstalk during the co-propagation of classical and quantum signals, we require a guardband of unused channels between classical and quantum signals. We propose a stochastic traffic model, with a deterministic day-night cycle and fractional Gaussian noise. Monte-Carlo simulations of an 80-channel WDM system with our stochastic traffic model demonstrate that 45-65% of unused spectrum can be repurposed for QKD, depending on the traffic conditions. We also model a key reservoir model, with Available and Recovery states. We define the Reliability Horizon as the 3σ depletion threshold. We find a trade-off between buffer reset levels: increasing the buffer reset level extends the reliability horizon but linearly increases recovery time, resulting in longer service "dark windows". Furthermore, simulations indicate that the first-passage time follows a heavy-tailed distribution, which is accurately characterized by a composite model combining a diurnal trend and a Bihill transition function. This framework enables network operators to optimize buffer parameters for specific Service Level Agreements (SLAs) in real-world environments.

Through semiclassical methods the subject of quantum chaos motivates and depends on Hamiltonian chaos research. Presented here is a selection of Hamiltonian chaos topics that in this way get directly related to any of a variety of quantum chaos research problems. The chapter begins with a description of various useful theoretical and computational tools of chaos research, e.g.~surfaces of section, paradigms of chaos, stability analysis, and symbolic dynamics... This is followed by discussions regarding the geometry of chaos, how chaotic systems respond to perturbations, and the complexification of Hamiltonian dynamics. The emphasis is on intuitive explanations and illustrations of various ideas with the references containing more mathematically rigorous expositions.

The tunable interaction between stationary quantum bits and propagating modes of light allows for the encoding of quantum information in the state of itinerant photons. This ability fulfills a central requirement for quantum networking, enabling quantum state transfer between distant quantum devices. Conventionally, a symmetric envelope of the photon wavepacket is used for such purposes. Yet, the use of alternative \textit{temporal modes} enables multiple applications in waveguide quantum electrodynamics that remain unexplored experimentally. Here, we use superconducting quantum circuits to generate individual itinerant microwave photons shaped in three mutually orthogonal temporal modes. We transfer the created photons across a 30-m cryogenic link, showing that the orthogonality allows us to decide at the receiver which mode to absorb, reflecting the other two with a selectivity ratio of 40. This experimental capability extends the microwave-frequency quantum communication toolbox, enabling a new photonic degree of freedom.

In Hermitian impurity scattering, each isolated late-time exponential is the fingerprint of a bound state. We show that this correspondence breaks down in non-Hermitian bands. For a single impurity in a non-Hermitian lattice, the late-time signal is controlled by isolated complex frequencies selected by the analytic continuation of the Green's function relevant to real-time dynamics, which we term dynamical poles (DPs). DPs need not coincide with static bound states: one may appear without any bound-state counterpart, while a static bound state may be dynamically invisible. The remainder of the signal is an incoherent background set by complex continuum edges. Our results establish that the real-time analytic structure of the Green's function, not the static eigenvalue problem alone, organizes non-Hermitian impurity scattering.

Hilbert space fragmentation refers to exponential growth in the number of dynamically disconnected Krylov sectors with system size. It is taken as evidence of ergodicity breaking, since conventional symmetries generate at most a polynomial number of sectors. However, we demonstrate that generalized symmetries can fragment the Hilbert space. Models with higher-form, subsystem, and gauge symmetries can have exponentially many symmetry sectors. We further prove that non-invertible symmetries can induce additional fragmentation within individual symmetry sectors. Fragmentation in several known models arises from generalized symmetries, and the presence of exponentially many Krylov sectors therefore does not by itself imply ergodicity breaking. Finally, we show that disorder free localization arises naturally from Krylov-restricted thermalization when sectors lack translation invariance, requiring neither ergodicity breaking nor gauge symmetry.

We experimentally observe a new type of quantum-path interference, in two-dimensional(2D-QPI), in high-harmonic generation (HHG) driven by an orthogonally-polarised highly-bichromatic field. This regime is marked by comparable intensities of the two orthogonal colours. In this highly-bichromatic regime, we demonstrate that 2D-QPI is encoded in the measured harmonic intensity modulations with respect to the relative phase of the two-colour field. The modulations of the odd-order harmonics show a monomodal behaviour, whereas the even harmonics are modulated in a bimodal structure. Our calculations using the strong-field approximation and saddle-point method disentangle contributions from multiple quantum orbits in this HHG regime, revealing that the dipole response for both odd and even harmonics inherits the dynamic symmetry of the orthogonally-polarised driving field. This new type of 2D-QPI offers a novel route to HHG spectroscopy of attosecond electron dynamics by lifting up the dimensionality of the quantum paths involved in the interference.

All-optical generation of pure spin current -- the flow of spin in the absence of a corresponding charge flow -- relies on a symmetry based compensation of valley charge. The 2d $d$-wave altermagnets, ideal spintronics materials due to a very low spin-orbit coupling, possess a magnetic point group and highly anisotropic valley manifolds that would appear to preclude such current compensation, excluding them as materials for the ultrafast generation of pure spin current. Here we show that infra-red valley excitation combined with a THz pulse envelope allows the generation of large and nearly 100\% pure spin currents in the altermagnet Cr$_2$SO. Our approach is based on a valley selection rule coupling linearly polarized light to spin opposite valleys, along with the intrinsic momentum shift that a co-occurring THz pulse imbues a valley spin excitation with. These results thus provide a practical and all-optical route to the generation of pure spin current in $d$-wave 2d altermagnets, opening a route to lightwave control of spin in an environment with very low intrinsic spin mixing.

In this article, we find a theorem that gives a relation between the maximal fidelity of teleportation and the concurrence of the inseparable $X$ state used as a quantum channel in this process. Furthermore, we evaluate the concurrence of the output states generated by the local and nonlocal asymmetric broadcasting of entanglement and prove that the concurrence is greater in the case of nonlocal broadcasting. We analyze the possibility of using the output states obtained by the broadcasting of entanglement as quantum channels in quantum teleportation. We prove, with the help of the above-mentioned theorem, that all the inseparable states given by the local and nonlocal asymmetric broadcasting of entanglement are useful for quantum teleportation. Finally, we show that the maximal fidelity of teleportation is greater in the case when the second scenario is used, i.e., when the quantum channel is generated by the nonlocal asymmetric broadcasting of entanglement.

We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements, focusing on locally diagonal orthogonally invariant (LDOI) states -- those invariant under local diagonal orthogonal twirling. This class includes many important families such as Werner states, isotropic states, X-states, and Dicke states. We show that optimal PPT and separable measurements for distinguishing LDOI states can always be taken to be LDOI, and the LOCC supremum can be approached by LDOI LOCC POVMs, enabling a dimensional reduction from $n^4$ to $O(n^2)$ in the associated optimization problems. We establish efficiently computable bounds on the distinguishability of orthonormal LDOI bases and prove that for a broad class of such bases -- including all two-qubit cases -- the LOCC supremum equals the PPT and separable optima. More generally, we show the gap between PPT and LOCC distinguishability is at most $(n-2)/(2n^2)$ for local dimension $n$.

The role of complex numbers in quantum theory extends beyond mathematical convenience, having recently been formalized as a resource under the framework of the resource theory of imaginarity. Operationally, imaginarity translates into using fewer resources in optical setups. In this work, we investigate the operational advantage offered by complex-valued measurements in the entanglement of assistance protocol for three-qubit systems. We demonstrate that employing such measurement bases leads to a significant improvement in the concentration of bipartite entanglement with the aid of the third party. We further analyze a modified entanglement swapping protocol and show that a three-qubit complex measurement bases with certain symmetries outperform the standard GHZ-basis. This is also one example where a three-qubit non-maximally entangled basis surpasses a maximally entangled one in generating entanglement. Construction of the basis also addresses the open problems raised in [Phys. Rev. A. \textbf{108}, 022220 (2023)]. As an intriguing application, we show that using this approach in quantum network percolation on a honeycomb lattice reduces the required bond occupation probability by $22.7\%$ and, requirement of entanglement by $10.6\%$ in each bond.

Recent years have witnessed tremendous progress in developing a fine-grained low-dimensional holographic correspondence, specifically the construction of quantum mechanical boundary theories as holographic duals of two-dimensional gravity. In these developments, quantum chaos played a crucial role, both as source of universality and as a guiding principle for the matching of bulk and boundary signatures of gravity. In this article we review the construction of the chaos-assisted low-dimensional holographic correspondence for non-experts. We open with an introductory discussion of the two main protagonists of the theory, the SYK model and two-dimensional Jackiw-Teitelboim gravity. Within this framework we will discuss two independent 'bridges' between bulk and boundary physics, one pertaining to early time chaotic instabilities, the other to late time quantum chaos up to and including time scales of the order of the gravitational quantum level spacing. We will demonstrate that the resolution of these fine-grained quantum scales requires the extension of semiclassical gravity by elements of string theory. We conclude with an outlook towards higher dimensional generalizations of the chaotic holographic correspondence.

We present a real-time path-integral formulation of the quantum Fisher information for dynamical parameter estimation. For pure states undergoing unitary evolution, we show that the quantum Fisher information can be expressed as a connected symmetrized covariance of a time-integrated action deformation, equivalently as an integrated insertion of $\partial_λS$ in the propagator. This reformulation avoids explicit state reconstruction by rewriting the quantum Fisher information in terms of real-time correlators that are natural targets for many-body methods. We further embed the construction into the Schwinger-Keldysh closed-time-path formalism, identifying the quantum Fisher information with the Keldysh component of an appropriate contour-ordered correlator generated by forward and backward propagating sources. Finally, using the Van Vleck-Gutzwiller approximation we re-derive the compact semiclassical quantum Fisher information expression, clarifying how classical trajectory data control leading-order metrological sensitivity.

Long-range interactions can fundamentally reshape the low-energy properties of low-dimensional quantum matter, altering both continuous symmetry breaking and topological phenomena. However, their impact on the quantum criticality separating these regimes remains poorly understood. We determine the ground-state phase diagram and critical properties of the spin-one Heisenberg chain with single-ion anisotropy and staggered antiferromagnetic power-law interactions, using matrix-product state (MPS) calculations complemented by high-order series expansions (pCUT+MC). Such long-range, non-frustrated interactions circumvent the Hohenberg-Mermin-Wagner theorem, thereby stabilizing continuous symmetry breaking (CSB) phases in direct competition with the Haldane phase. We map out the resulting phase diagram and analyze the entanglement entropy scaling behavior in the U(1) and SU(2) CSB phases, finding logarithmic corrections beyond the short-range, universal contributions expected from linearly dispersed Goldstone modes. We further characterize all critical boundaries through finite-size scaling of either the entanglement entropy or the staggered magnetization. In particular, the large-D-to-U(1)-CSB transition exhibits unconventional, continuously varying critical exponents as a function of the long-range decay exponent with a strong dependence on the imposed boundary conditions leading to distinct finite-size scalings for sufficiently long-range potentials. Remarkably, the Haldane-to-U(1)-CSB transition likewise displays unconventional quantum criticality with distinct continuously varying critical exponents. Our work positions this model as a target for near-term atomic platforms with tunable long-range couplings and exhibiting natural single-ion anisotropy, offering a minimal playground for exploring the interplay between long-range interactions, continuous symmetry breaking, and topology.

In quantum systems with a classical limit, advanced semiclassical methods provide the crucial link between phase-space structures, reflecting the distinction between chaotic, mixed or integrable classical dynamics, and the corresponding quantum properties. Well established techniques dealing with ergodic wave interference in the usual semiclassical limit $\hbar \to 0$, where the classical limit is given by Hamiltonian mechanics of particles, constitute a now standard part of the toolkit of theoretical physics. During the last years, these ideas have been extended into the field theoretical domain of systems composed of $N$ indistinguishable particles, aka quantum fields, displaying a different type of semiclassical limit $\hbar_{\rm eff}=1/N \to 0$ and accounting for genuine many-body quantum interference. The foundational concept behind this idea of many-body interference, the many-body version of the van Vleck-Gutzwillers semiclassical propagator, is explained in detail. Based on this the corresponding semiclassical many-body theory is reviewed. It provides a unified framework for understanding a variety of quantum chaotic phenomena addressed, including random-matrix spectral correlations in many-body systems, the universal morphology of many-body eigenstates, interference effects kin to mesoscopic weak localization, and the key to the scrambling of many-body correlations characterized by out-of-time-order correlators.

Mesoscopic devices, with system sizes in the range of several to several dozens wavelengths, represent paradigmatic model systems for the observation of quantum chaotic behaviour based on semiclassical concepts. Those electronic and photonic billiard cavities are small enough for interference effects not to be ignored. Nonetheless, the classical ray or particle tracing picture can often provide a substantial understanding of the dynamics of the system along the lines of classical-quantum, or ray-wave correspondence. This well-established principle turns out to be particularly useful when applied not only in real space, but by extending it to phase space such that both location and momentum information can contribute to a deeper and more comprehensive understanding of the dynamical behaviour.

Decoherence and dissipation, arising from unavoidable interactions with the environment, can exert a dual influence on transport in physical systems, suppressing coherent propagation while inducing diffusion and mitigating localization in disordered systems. Non-Hermitian physics reveals a qualitatively different scenario, in which structured dissipation can induce directional bulk-to-boundary transport, known as the non-Hermitian skin effect (NHSE), that remains robust against disorder. Whether such transport can persist, be enhanced or hindered under decoherence, remains a largely open question. Here we experimentally address this question using photonic quantum walks with two tunable prototypical decoherence channels, dephasing and amplitude damping. Under dephasing, the NHSE survives up to the fully incoherent regime and is observed to even be enhanced by dephasing, yielding drift velocities that exceed those of coherent dynamics. By contrast, amplitude damping shows a pronounced order dependence: applied before the non-Hermitian loss operator, it suppresses and ultimately eliminates the NHSE in the fully incoherent limit; applied afterward, the NHSE persists and can be enhanced at sufficiently large loss strengths. Our work bridges quantum and classical non-Hermitian dynamics, demonstrates the resilience of the NHSE to decoherence, and opens avenues for harnessing decoherence to enhance directional transport in noisy, nonequilibrium systems.

We propose a method to test whether a photonic 3D QRNG works according to the underlying theory, thereby generating highly incomputable/unpredictable sequences of random digits. The test relies on undoing the unitary evolution realized by the 3D QRNG. The test verifies the unitarity, the magnitude of the noise, and other potential errors, such as photon loss or systematic and reproducible fabrication errors. Therefore, the test can confirm the theoretically proven features of the 3D QRNG, such as strong incomputability and unpredictability, or how one has to correct it, if necessary. In addition, the test ensures that the QRNG is not affected by limits of quantum measurement accuracy, as those described in the Wigner-Araki-Yanase Theorem. The test can be easily incorporated into the QRNG and used as a means of experimental certification.

Ising machines are physical platforms designed to minimize the energy of classical Ising Hamiltonians, yet accessing specific excited states remains an open challenge of both fundamental and practical relevance. In this letter we show that a network of Kerr parametric oscillators (KPOs) naturally implements an Ising selector machine. By tuning the frequency detuning between the parametric pump and the oscillator resonances, the system can be steered to converge close to the ground state, the highest-energy configuration, or targeted intermediate excited states. Beyond mean field, numerical simulations based on the truncated Wigner approximation demonstrate that noise insertion preserves the energetic structure of the landscape. The targeted state emerges with an exponentially enhanced probability over the rest of the Ising spectrum. Our results establish the pump-cavity detuning as a control knob for navigating the full Ising energy landscape, opening a route to applications in Boltzmann sampling, hardness characterization, and spectral analysis of combinatorial problems.

One of the fundamental manifestations of classical chaos is exponential sensitivity to initial conditions that is, two trajectories starting from nearly identical initial states diverge exponentially over time. This behavior is quantified by the Lyapunov exponents. Due to the unitary nature of quantum mechanics, such exponential divergence is elusive in quantum systems. As a result, several alternative quantities have been proposed and studied in recent years to capture analogous behavior. In this article, we present a pedagogical overview of three such quantities that have been the focus of intense research in recent years: the Loschmidt echo, out-of-time-order correlators (OTOCs), and Krylov complexity.

Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schrödinger Hamiltonians on metric graphs, with a focus on results related to quantum chaos, periodic orbit theory and spectral theory. We summarise related seminal results, and give an overview over a few more recent developments.

We investigate the optical response of a conduction electron in a helically twisted mesoscopic medium containing a screw dislocation and a uniform torsional background, in the presence of an axial magnetic field and an Aharonov--Bohm flux. We show that the coupling between longitudinal motion and the geometric background produces an effective in-plane confinement, allowing bound states to emerge without the need for an external radial potential. Exact analytical solutions are obtained for the energy spectrum and radial wave functions, and these results are used to evaluate linear and third-order nonlinear absorption, changes in the refractive index, the photoionization cross section, and the oscillator strength. The combined action of torsion, magnetic field, and topological defect increases the interlevel spacing, compresses the radial electronic distribution, and breaks the dynamical symmetry between opposite angular-momentum channels, leading to strongly asymmetric and state-resolved optical spectra. Under intense optical excitation, the nonlinear contribution can overcome linear absorption, driving the system into a negative-absorption regime and enabling geometry-controlled optical gain. These results establish torsion and defect engineering as effective tools for tuning confinement, resonant energies, and selective amplification in mesoscopic nanophotonic platforms operating in the mid-infrared and terahertz ranges.

Quantum states of light are central resources for quantum communication, networking, and photonic information processing. In many quantum emitters, coherent internal dynamics arising from intrinsic or field-induced level splittings imprint a deterministic, time-dependent phase on the emitted light. When emission times are stochastic and detector timing resolution is finite, this phase evolution becomes effectively unresolved, suppressing observable entanglement. Here, we demonstrate a photonic-compensation protocol that removes this emitter-induced phase evolution directly in the photonic domain. Rather than modifying the emitter, we apply synchronized, time-dependent coherent operations to the emitted photons that reverse the accumulated phase independently of the emission time. Using exciton fine-structure splitting in a semiconductor quantum dot as a model system, we implement dynamic phase modulation and perform time-resolved two-photon polarization tomography. We show that this restores a stationary two-photon polarization state and recovers polarization entanglement without temporal post-selection and independently of detector timing resolution. Our approach provides a scalable route to robust solid-state entangled-photon sources and, more broadly, establishes a strategy for removing the imprint of coherent emitter dynamics on photonic entanglement in integrated platforms.

We demonstrate that quantum light statistics can be used to control strong-field ionization at the tunneling step. Using a bichromatic linearly polarized field composed of a strong coherent driver and a weak bright squeezed vacuum (BSV), we show through simulation that photoelectron momentum distributions (PMDs) exhibit asymmetries that exceed those obtained with classical fields of comparable intensity by orders of magnitude. This enhancement is uniquely linked to the nonclassical statistics of the BSV field. A semiclassical analysis based on the strong-field approximation (SFA) reveals that the effect originates from fluctuations in the instantaneous field amplitude, which strongly modify the tunneling ionization probability while leaving the electron's continuum dynamics essentially unchanged. This selective control enables reconstruction of ionization pathways and provides a robust route to extract sub-cycle dynamics from strong-field observables.

Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the ideal theoretical setting under standard complexity-theoretic assumptions. In noisy implementations, however, this hardness can disappear once circuit depth exceeds a noise-dependent critical threshold. We show that qubit connectivity is a key parameter in this transition, since sparse architectures require additional routing to implement long-range interactions, thereby increasing compiled circuit depth. To make this explicit, we present a connectivity-aware analysis of compiled IQP circuits. For a fixed abstract IQP instance, different hardware connectivity graphs yield different compiled depths and thus different effective positions relative to the noisy-IQP simulatability boundary. We quantify this architecture-dependent shift using the compiled depth overhead and the corresponding simulatability margin. We combine analytic depth estimates for sparse geometries, including the two-dimensional grid, with native-gateset-aware compilation experiments across seven hardware-grounded experimental device models derived from publicly available topologies. To compare these device models under a unified empirical framework, we approximate the effective noise level primarily through reported two-qubit gate error rates. This lets us compare how much effective noise sparse and fully connected architectures can tolerate for the same position relative to the noisy-IQP simulatability boundary. Our results show that sparse connectivity requires a lower effective noise level to sustain the same margin relative to the noisy-IQP simulatability boundary, and they provide a quantitative framework for determining when compiled IQP experiments are likely to remain outside, or instead enter, the classically simulatable regime.

We investigate the mutual information harvesting of two circularly accelerated detectors that interact with the massless scalar fields near a reflecting boundary. We consider that the two detectors share a common rotational axis with the same acceleration and trajectory radius. As the interdetector separation increases, the mutual information may exhibit oscillatory behavior at large acceleration and small radius. For a fixed radius, a larger acceleration leads to a larger peak value of the mutual information. Near the boundary, the mutual information may oscillate and the maximum can be obtained. As the acceleration increases, the mutual information in a small interdetector separation first increases and then decreases. For an intermediate interdetector separation, the mutual information may oscillate with the increase of acceleration. For a not large interdetector separation, when we take large acceleration and small radius, as the energy gap increases, the mutual information first decreases, then oscillates, and finally goes to zero. The combination of large acceleration and small radius corresponds to the fast rotation, which significantly modifies the vacuum fluctuations of the field, leading to the oscillatory behavior. Furthermore, the oscillation intensifies near the boundary, which indicates that it is related to the coherent superposition of boundary reflections.

A time-dependent theory for the interactions between spatially separated lossy cavities in a homogeneous background medium using quantized quasinormal modes (QNMs) is presented. The cavities interact via a bath of traveling photons, described by non-bosonic operators that are orthogonal to the open-cavity QNMs. The retarded (i.e., time-delayed) inter-cavity dynamics are fully described by system-bath correlation functions, in which the emission from one cavity appears as the input field for another. Coupling between quantum emitters (described as two-level systems), placed inside a cavity or embedded in an external medium, and the electromagnetic field (cavity modes and bath photons) is included in the theory, which gives rise to both bath-mediated and QNM-mediated interactions between the emitters.

Quantum key distribution protocols based on the quantum eraser phenomenon offer an operational advantage: automatic identification of matching and mismatching encoding choices through interference, eliminating basis reconciliation over public channels. However, security analysis reveals that binary quantum eraser implementations permit an eavesdropper to correctly identify transmitted quantum states with 85\% probability using optimal measurement strategies. This vulnerability persists regardless of state randomization schemes. We demonstrate that this limitation reflects a fundamental bound on all two-state quantum cryptographic protocols, arising from the geometry of non-orthogonal state discrimination. To overcome this constraint, we introduce a ternary quantum eraser protocol employing three polarization states with $120^\circ$ angular separation, transmitted in three-photon groups with randomized temporal ordering. This extension achieves enhanced security through two complementary mechanisms. First, the reduced distinguishability of symmetrically-arranged quantum states limits single-photon discrimination. Second, the combinatorial complexity of unknown photon ordering constrains multi-photon eavesdropping strategies. Security analysis against individual eavesdropping attacks within the four-dimensional path-polarization Hilbert space establishes that an eavesdropper's maximum success probability is bounded at 54\% substantially below the binary discrimination bound. The protocol maintains a binary-equivalent efficiency of 0.30 bits per photon competitive with established QKD implementations while preserving the operational simplicity inherent to quantum eraser cryptography.

The $p_3$-PPT criterion is an experimentally viable relaxation of the well-known positive partial transposition (PPT) criterion for the certification of quantum entanglement. Recently, it has been generalized to various families of entanglement criteria based on the PT moments $p_k=$Tr$[(ρ^Γ)^k]$, where $ρ^Γ$ denotes the partially transposed density matrix of a quantum state $ρ$. While most of these generalizations are strictly more powerful than the $p_3$-PPT criterion, their $m$-th level versions usually rely on the availability of $p_k$ for all moment orders $k\le m$. Here, we show that one can alternatively compare any three PT moments of orders $k<l<m$, which can significantly reduce experimental overheads. More precisely, we show that any state satisfying $p_l>p_k^xp_m^{1-x} $ must be entangled, where $x=(m-l)/(m-k)$. Using the example of locally depolarized GHZ states, we identify the most promising versions of these three-moment criteria and compare their performance with a broad range of entanglement criteria. In the case of globally depolarized stabilizer states, we prove that having access to $p_k$ for $k \le 5$ is sufficient to reproduce the full PPT criterion. More generally, we show that the Stieltjes-$m$ criterion is as powerful as the PPT criterion whenever $ρ^Γ$ has no more than $(m+1)/2$ distinct eigenvalues. Finally, we introduce a notion of quantum weight enumerators that capture the decay of $p_k$ under local white noise for arbitrary quantum states and illustrate this concept for an AME state. Our results contribute to the growing body of literature on higher-moment PPT relaxations and modern applications of weight enumerators in quantum error correction and information theory.

Feedback-controlled electromigration (FCE) enables precise regulation of atomic migration by carefully optimizing multiple experimental parameters. However, manually fine-tuning these parameters poses significant challenges. This study investigated the feasibility of autonomously fabricating Au atomic junctions through gate-based quantum computing using a noisy intermediate-scale quantum (NISQ) device, which effectively approximates solutions to combinatorial optimization problems. We compared the computational accuracy of the NISQ device against a previously reported D-Wave quantum annealer. The results indicate that the NISQ device achieved lower residual energies and produced higher-quality approximate solutions for large-scale problems than the quantum annealing system.

We investigate electron paring in two-dimensional electron systems mediated by the vacuum fluctuations of a quantized magnetic flux generated by the inductor of an LC resonator. The interaction induces long-range attractive interactions between angular momentum states which lead to pairing in a broad class of materials with critical temperatures of few Kelvin or even higher, depending on the field-covered area. The induced state is a pair-density wave topological chiral superconductor. The proposed platform in circuit QED environment offers a tunable promising tool for engineering electron interactions in two-dimensional systems to create new quantum phases of matter.

We use the configuration-space Faddeev formalism to study scattering of three particles in the double continuum where all particles are free. All scattering processes, starting from and ending in both single and double continua, are collected in a unique matrix. We apply our method to the benchmark system of neutron-deuteron scattering.

The quantum kernel method, a promising quantum machine learning algorithm, possesses substantial potential for demonstrating quantum advantage. Although the majority of the quantum kernel is constructed in the context of gate-based quantum circuits, inspired by the idea of analog quantum computing, here we construct an analog quantum kernel and a hybrid quantum kernel, and show their competitiveness against other kernel methods in a benchmarking task and the practical problem of estimating non-Markovianity from sparse data. Additionally, we also incorporate operational noise into the quantum kernels. Our results reveal that the presence of operational noise can be beneficial to the performance of the developed quantum kernels. We attribute this counterintuitive noise-enhanced performance to the improved expressivity and higher model complexity induced by noise. These results pave the way for practical implementations of quantum kernel methods and provide an efficient approach for estimating non-Markovianity with reduced experimental demands.

We present an introductory review of nonergodic dynamics in interacting many-body quantum systems, focusing on the phenomenon of many-body localization (MBL). We describe aspects of MBL and summarize the evidence for a crossover from the ergodic to the MBL regime in finite systems, using the paradigmatic XXZ model as an example. We then broaden the scope to other models to illustrate the generality of the phenomenon. We briefly touch on the largely unexplored relation between MBL and quantum computing.

We analytically describe the dynamically separated $\mathbb{Z}_{2}$ skin channels (wavepacket evolutions) under periodic boundary condition (PBC) in non-Hermitian systems with anomalous time-reversal symmetry (ATRS), by combining the semiclassical worldline perspective with an enhanced understanding of skin effects. These channels, tied to the initial state and relevant symmetries, exhibit individually exponential-dominated time evolution in momentum space, where their amplitude maxima evolve toward the dominant momenta. In real space, they circulate around the one-dimensional (1D) chain, tracing semiclassical worldlines. Such circulations imply quantum revivals and dynamical quantum phase transitions (DQPTs) regardless of any wavepackets' phase interference, with the latter showing scale-dependent behavior, a feature distinct from conventional DQPTs. This work rigorously demonstrates our previous findings on worldline windings and the winding-control mechanism, confirming that the core physics is shared with the ordinary skin effect.

Model-independent estimation of the properties of quantum states is a central challenge in quantum technologies, as experimental imperfections, drifts, and imprecise models of the actual quantum dynamics inevitably hinder accurate reconstructions. Here, we introduce a training strategy for photonic quantum extreme learning machines in which both the learning stage and the optimization of the measurement settings are performed entirely with classical light, while inference is carried out on genuinely quantum states. The protocol is based on the identity between the normalized output intensities following the evolution of coherent states through a linear optical reservoir, and the output statistics obtained with separable input quantum states. Building on this correspondence, we implemented a model-free, gradient-based optimization of the reservoir measurement projection directly on experimental data, without relying on a prior model of the device transformation. We experimentally show that the resulting classical-to-quantum transfer enables accurate reconstruction of single-qubit Pauli observables for previously unseen single-photon states, and extends to the estimation of a two-qubit entanglement witness for arbitrary bipartite states. Beyond demonstrating a qualitatively distinct form of out-of-distribution generalization across the classical-to-quantum boundary, our results identify a practical route to fast, adaptive, and resource-efficient training of photonic quantum learning devices.

We analyze the Schwarz inequality and its generalizations, as well as inequalities resulting from the Jensen inequality. They are used in quantum theory to derive the Heisenberg-Robertson (HR) and Schroedinger-Robertson (SR) uncertainty relation for two non-commuting observables and their generalizations to three or more non-commuting observables. Jensen's inequality, in turn, is helpful in deriving various the "sum uncertainty relations" for two or more observables. Using these inequalities, we derive various types of generalized uncertainty relations for more than two non--commuting observables and analyze their properties and critical points. We also study the connections between the generalizations of the HR and SR uncertainty relations for two and more observables and the correlations of these observables in the state of the quantum system under study. In this analysis, we pay special attention to the consequences of the generalized SR uncertainty relation for three non--commuting observables on their correlations in a given state of a quantum system and to the connections of this relation with the appropriate correlation matrix, whose matrix elements are the quantum versions of the Pearson coefficient. We show also that the SR uncertainty relation (including the generalized ones) can be written in an equivalent way using these Pearson coefficients.

This chapter gives an overview of transport problems where chaotic dynamics of the system plays a crucial role. We begin with single-particle transport problems and then come to conservative and then dissipative systems of identical particles, which follows the historical way of developing the theory of Quantum Chaos over the past 40 years. We also include brief descriptions of key laboratory experiments on the discussed transport problems.

Linear optical spectra of molecular aggregates are often approximated by classical optics methods such as the discrete-dipole approximation (DDA), coherent exciton scattering (CES), and coherent potential approximation (CPA), where the only quantum-mechanical input to the calculation is the linear susceptibility of the monomers. However, the limits of validity of these classical optics methods remain opaque. Here, starting from a quantum mechanical Hamiltonian for the aggregate, we identify a limit where DDA/CPA/CES is exact: all-to-all coupled permutationally symmetric aggregates of $N \to \infty$ monomers. The permutational symmetry of this molecular version of the Lipkin-Meshkov-Glick model, which is closely related to that of the molecular polariton problem of many identical molecules coupled to a single-cavity mode, allows us to borrow recent techniques developed for the latter. In particular, we identify a $1/N$ expansion that corrects the classical optics limit with finite $N$ corrections to the linear response of the aggregate. These corrections feature as Raman-like transitions of a single monomer. We illustrate these findings with calculations on the very physically-relevant setup of a homodimer. Our findings clarify how quantum optical features that go beyond classical optics can already be present in simple arrays of quantum emitters such as molecular aggregates.

In this paper we reexamine the definition of parafermions and parabosons by means of Green's triple relations, and extend these relations by including a parity operator $P$ which is also determined by means of triple relations. As a consequence, we are dealing with new algebraic structures. It is shown that the algebra underlying a set of $n$ parafermions together with $P$ is the orthogonal Lie algebra $so(2n+2)$. The Fock spaces correspond to particular irreducible representations of $so(2n+2)$, and the action of $P$ in these spaces leads to interesting observations. Next, we show that the algebra underlying a set of $n$ parabosons together with $P$ is the orthosymplectic Lie superalgebra $osp(2|2n)$. In this case, the Fock spaces correspond to certain irreducible infinite-dimensional representations of $osp(2|2n)$. Both for parafermions and parabosons the spectrum of $P$ is closely related to the so-called order of statistics $p$, introduced by Green.

When quantum emitters couple indistinguishably to light, they can synchronize into a collective light matter system with radiative properties profoundly different from those of independent particles. To date, the resulting collective effects have largely been confined to point like or homogeneous ensembles. Here, we open access to a qualitatively new collective regime by realizing geometrically ordered, spatially extended atom arrays with subwavelength spacing. This establishes a fundamentally new platform in which collective emission is no longer confined to a single Dicke mode but instead emerges from an ordered network of photon mediated interactions. We find that 2D atom arrays undergo strong super and subradiant emission. Despite subwavelength spacing, we achieve site resolved imaging and directly observe the buildup of spatial correlations, demonstrating the transformation of cooperative decay into a strongly correlated many-body process. We observe extensive scaling of superradiance, uncover superradiant revivals, and reveal the ferromagnetic nature of superradiance and the antiferromagnetic nature of subradiance. Our results realize a novel programmable platform for exploring and utilizing dissipative many-body quantum physics, opening new possibilities for photon capture, storage, and atom photon entanglement.

As quantum computing systems continue to mature, there is an increasing need for benchmarking methodologies that capture performance in terms of meaningful, application-level metrics. In this work, we present a scalable framework for application-level quantum benchmarking that is designed to support internal system evaluation and cross-platform comparison across technology providers. Our framework is guided by a set of core principles, including measurability, simplicity, scalability, and extensibility. We present 13 benchmark families that reflect realistic workloads across multiple domains. This enables the systematic evaluation of the quality of solutions, the total execution time, total used energy, as well as Time-to-Solution. The benchmarks are designed to be reproducible, interpretable across stakeholder groups, and adaptable to evolving system capabilities. The framework aims to bridge the gap between low-level performance metrics and real-world value, providing a unified approach to assessing quantum systems. The resulting benchmarks support development and validation and contribute to the foundation of industry-wide benchmarking standards.

We present a quantum optimization framework for the Shipment Selection Problem (SSP) in electric freight logistics, developed jointly by IonQ and Einride. Idle gaps arising from stochastic shipment cancellations reduce fleet utilization and revenue; filling them optimally requires solving a combinatorial assignment problem with quadratic inter-gap dependencies. We formulate the SSP as a Mixed-Integer Quadratic Program, map it to an Ising cost Hamiltonian, and solve it using Iterative-QAOA, a non-variational warm-start extension of the Quantum Approximate Optimization Algorithm (QAOA) with a fixed linear-ramp parameter schedule. An end-to-end hybrid workflow integrates Einride's vehicle routing problem (VRP) solver with IonQ's quantum simulations, enabling evaluation on real, anonymized logistics data spanning up to 130 qubits. We assess solution quality through application-level performance metrics, including Shipments Delivered (SD), Schedule Compatibility Score (SCS), and Total Drive Distance (TDD). When the quantum assignment is passed to the classical solver as a warm start, the resulting hybrid workflow achieves improvements of up to 12\% in SD and a reduction of up to 6\% in total drive distance per shipment for specific instances, while total operational cost remains effectively unchanged. These results show that Iterative-QAOA can generate compatibility-aware assignments that become operationally valuable when embedded in a hybrid logistics optimization workflow.

In this paper, we study a system of bosons trapped in a confining potential, interacting with a quantized field of coherent photons in the mean field description of non-relativistic Quantum Electrodynamics (QED) obtained by [N. Leopold and P. Pickl , 2017]. We derive the effective nonlinear cascade equations governing the emission and absorption of coherent photons by the boson subsystem in a combined weak-coupling and kinetic-scaling limit. We demonstrate that solutions to this nonlinear cascade describe a monotone decreasing energy flow in the boson subsystem. Thereby, we prove that a Bose-Einstein condensate (BEC) forms dynamically, under conservation of the total boson $L^2$ mass. We note that this process is crucially different from thermal relaxation to the ground state, and fundamentally depends on the nonlinear nature of the cascade dynamics.

Dynamical decoupling techniques are widely used to characterize and control the environments of solid-state quantum defects, enabling solid-state quantum memories and nanoscale quantum sensors. However, resolution is often limited by the timing granularity of control hardware, which can undersample narrow spectral features and distort extracted parameters. Here, we demonstrate sub-nanosecond timing control on an inexpensive FPGA-based platform by extending the open-source QICK (Quantum Instrumentation Control Kit) framework using a waveform-offset method. This approach achieves an effective timing resolution of 200~ps on an RF system-on-chip device without modification to the underlying hardware. We apply this capability to dynamical decoupling spectroscopy of nitrogen-vacancy centers in diamond, enabling precise extraction of hyperfine couplings of individual $^{13}\mathrm{C}$ nuclear spins and resolving spectral features that are otherwise undersampled. These results demonstrate that high-resolution, device-level characterization of spin-based quantum memories can be achieved using flexible, inexpensive control hardware, providing a scalable alternative to commercial arbitrary waveform generators.

The speed and fidelity of dispersive readout of superconducting qubits should improve by increasing the amplitude of the measurement drive. Experiments show, however, that beyond some drive amplitude there is always a saturation or drop in fidelity, often associated with a decrease in qubit energy relaxation time $T_1$. A simple Lindblad master equation does not capture the latter effect. More involved approaches based on effective master equations rely on strong assumptions about the spectra of the system and the bath and only partially agree with observations. Here, we perform a first-principles simulation of the full unitary dynamics of dispersive readout by considering the circuit QED Hamiltonian coupled to a microscopic model for the measurement transmission line, allowing for its arbitrary spectrum, including filters. Our access to the dynamics of the bath degrees of freedom allows us to investigate the emission spectrum of the system as a function of drive power. We show how the dependence of qubit $T_1$ on readout drive amplitude is sensitive to the details of the bath spectrum. In particular, we find that $T_1$ drops with increasing drive amplitude when a Purcell notch filter is placed at the qubit frequency, and that the Lindblad master equation shows general qualitative defects compared to the first-principles model.

Geometric frustration, arising from competing interactions that prevent simultaneous energy minimization, presents a fundamental challenge for variational quantum algorithms applied to quantum many-body systems. We investigate the transverse-field Ising model on a square lattice with frustrated diagonal coupling and show that geometric frustration leads to strongly inhomogeneous correlations that are difficult to capture using standard Hamiltonian-inspired ansätze with global parameters. As a result, the required circuit depth increases significantly in the intermediate-field regime. We demonstrate that this limitation is not caused by optimization difficulties such as barren plateaus, but instead arises from insufficient expressibility of the ansatz. By introducing bond-resolved variational parameters, we recover accurate results at reduced circuit depth. We also study low-energy excitations and find that near-degenerate spectra in the frustrated regime further challenge variational methods. Our results provide a clear physical explanation for the limitations of variational quantum algorithms in frustrated systems and suggest improved ansatz design strategies for quantum simulation.

This work investigates the performance of a Hybrid Quantum Genetic Algorithm (HQGA) compared to a classical Genetic Algorithm (GA) for solving the portfolio optimization problem. Our results indicate that the HQGA converges faster to the optimal solution than its classical counterpart, while also maintaining a higher level of population diversity throughout the optimization process. In addition, the HQGA requires significantly fewer evaluations-to-solution than a brute-force approach to reach the global optimum.

We present a fast, memory-efficient, unitarity-preserving numerical method beyond the rotating-wave approximation for the closed Tavis-Cummings model in which a multilevel spin system interacts with a cavity mode. This model can describe the interaction of an ensemble of spins with a cavity mode in which the spin frequency and other parameters are time-dependent. The method exploits the fact that, while the Tavis-Cummings model is not tri-diagonal, it can be brought into tri-diagonal form by a change of basis that can be implemented purely by re-indexing (permuting basis elements), which is a fast operation. By truncating the Fock basis of the cavity mode, the computational complexity of the method is linear in the total dimension of the coupled system in both time and memory. The method can be employed to simulate any closed quantum system whose Hamiltonian terms can be brought into tri-diagonal form.

Disorder is ubiquitous in quantum devices including quantum probes designed and fabricated for quantum parameter estimation and sensing. We investigate the robustness of a quantum probe against the presence of glassy disorder. We define a disorder marker quantifying the effect of the disorder by expanding the quantum Fisher information in terms of different orders of the standardized central moments of the disorder-distributions. We classify the quantum probes in terms of the possible values of the disorder marker, and analytically show, for a disorder-sensitive probe with identical and weak disorder on all or a subset of the parameters of the probe-Hamiltonian, that the absolute value of the disorder marker exhibits a quadratic dependence on the disorder strength. We derive a robustness scale intrinsic to the probe that competes with the disorder, and provide a prescription for estimating the maximum disorder strength that the probe can withstand from the disorder-free probe-Hamiltonian for a given initial state of the probe, which can be computed without the disorder averaging. We demonstrate our results in the case of a single-qubit probe under disordered magnetic field, and a multi-qubit probe described by a disordered one-dimensional Kitaev model with nearest-neighbor interactions.

We investigate quantum state transfer on a class of bipartite graphs, namely the butterfly graphs, within the framework of discrete-time quantum walks. These graphs facilitate the construction of scalable quantum networks that enable communication between a sender and a receiver via perfect state transfer. Our analysis demonstrates that state transfer occurs across different butterfly graphs, thereby extending the known families of networks that support high-fidelity quantum state transfer. In addition to the ideal noiseless dynamics, we further investigate the robustness of quantum state transfer in the presence of non-Markovian environmental noise, specifically, random telegraph noise, modified Ornstein-Uhlenbeck noise, which are examples of unital noise and non-Markovian amplitude damping noise, non-unital noise. These noise models capture different types of system-environment interactions and memory effects that influence the coherence of the quantum walk. These findings contribute to the theoretical understanding of how butterfly graph constructions influence quantum transport phenomena.

Hard scattering events in high-energy collisions produce highly virtual partons that subsequently fragment into collimated hadronic cascades. When such partonic showers evolve in a QCD medium, as in deep-inelastic scattering or heavy-ion collisions, the resulting multi-particle distributions encode information about the surrounding matter. Decades of theoretical developments have led to a consistent and order-by-order improvable perturbative description of the shower. This description needs, however, the non-perturbative input that encodes the structure of the hadronic matter. The determination of such input remains challenging within conventional computational approaches, thereby limiting the applicability of the approach. In this work, we develop a framework that employs quantum simulation techniques to compute multi-particle processes in such environments by mapping partonic cross-sections to quantum circuits. As benchmarks, we analyze dipole formation and the QCD antenna radiation pattern at leading order in the strong coupling constant, comparing the results with analytic estimates in simplified limits. The quantum circuit formulation here introduced naturally extends to higher perturbative orders and enables amplitude-level computations in complex matter backgrounds. This provides a systematic foundation for applying quantum information science methods to study multi-particle dynamics in QCD media.

The prequel to this work [Ng et al., Phys. Rev. A 93, 042121 (2016)] proposes the method of spectral photon counting to enhance noise spectroscopy with an optical interferometer. While the predicted enhancement over homodyne detection is promising, the results there are derived by taking an asymptotic limit of infinite observation time; their validity for a finite time remains unclear. To validate the theory, here we perform a numerical study of a finite-time model. Assuming that the signal is an Ornstein--Uhlenbeck process with an unknown variance parameter, we evaluate the Fisher information for homodyne detection, a lower bound on the Fisher information for spectral photon counting, and a quantum upper bound, all without taking the infinite-time limit. To confirm that the Fisher-information quantities are satisfactory precision measures, we also compute the errors of the maximum-likelihood estimator by Monte-Carlo simulations. The results demonstrate that the Fisher-information quantities and the estimation errors all smoothly approach their asymptotic limits, and the advantage of spectral photon counting over homodyne detection can remain substantial for finite times.

First, we consider generalized wave and scattering operators and derive modifications of commutation relations (between scattering operators and unperturbed operators) when the corresponding deviation factors behave as $\exp\{i t {\mathcal C}_{\pm}\}$ for $t\to \pm \infty$. Then, we construct so called secondary generalized scattering operators for the related case of linear divergence in QED, which gives a positive answer (in that case) to the well-known problem of J. R. Oppenheimer regarding scattering operators in QED: "Can the procedure be freed of the expansion in $\varepsilon$ and carried out rigorously?"

Dynamic quantum circuits with mid-circuit measurement and classical feedforward are essential for near-term algorithms such as error mitigation, adaptive phase estimation, and Variational Quantum Eigensolvers (VQE), yet transpiling these programs across frameworks remains challenging due to inconsistent support for control flow and measurement semantics. We present a transpilation pipeline that converts OpenQASM 3.0 programs with classical control structures (conditionals and bounded loops) into optimized CUDA-Q C++ kernels, leveraging CUDA-Q's native mid-circuit measurement and host-language control flow to translate dynamic patterns without static circuit expansion. Our open-source framework is validated on comprehensive test suites derived from IBM Quantum's classical feedforward guide, including conditional reset, if-else branching, multi-bit predicates, and sequential feedforward, and on VQE-style parameterized circuits with runtime parameter optimization. Experiments show that the resulting CUDA-Q kernels reduce circuit depth by avoiding branch duplication, improve execution efficiency via low-latency classical feedback, and enhance code readability by directly mapping OpenQASM 3.0 control structures to C++ control flow, thereby bridging OpenQASM 3.0's portable circuit specification with CUDA-Q's performance-oriented execution model for NISQ-era applications requiring dynamic circuit capabilities.

A spectrally isolated quartet can preserve a local two-qubit description at each point in parameter space while still acquiring a loop holonomy that does not lie in the local subgroup $\U(2)\otimes\U(2)$. We demonstrate this in three localized topological settings: a BHZ ribbon, a spinful SSH chain, and a BBH corner quartet. On a given quartet, changing only the loop moves the transport between almost local and strongly entangling regimes. The clearest contrast appears in BHZ: co-rotating and counter-rotating edge-field loops carry nearly identical eigenphase data, yet the former remains almost local whereas the latter realizes an Ising-like entangler. SSH isolates the controlled-rotation mechanism in a numerically stable setting, while BBH extends the phenomenon to a higher-order corner multiplet. Standard topological diagnostics, including Berry phases, Chern numbers, determinant phases, and eigenphase spectra, do not distinguish these cases. The primary diagnostic is the distance of the loop holonomy to the extracted local subgroup; canonical two-qubit coordinates are introduced only after reduction failure has been established, in order to identify the resulting gate class. In the sense of Ref.[arXiv:2601.13764], these results provide microscopic, loop-resolved manifestations of entangling gluing.

Measurement-based quantum computation (MBQC) is a framework for quantum information processing in which a computational task is carried out through one-qubit measurements on a highly entangled resource state. Due to the indeterminacy of the outcomes of a quantum measurement, the random outcomes of these operations, if not corrected, yield a variational quantum channel family. Traditionally, this randomness is corrected through classical processing in order to ensure deterministic unitary computations. Recently, variational measurement-based quantum computation (VMBQC) has been introduced to exploit this measurement-induced randomness to gain an advantage in generative modeling. A limitation of this approach is that the corresponding channel model has twice as many parameters compared to the unitary model, scaling as $N \times D$, where $N$ is the number of logical qubits (width) and $D$ is the depth of the VMBQC model. This can often make optimization more difficult and may lead to poorly trainable models. In this paper, we present a restricted VMBQC model that extends the unitary setting to a channel-based one using only a single additional trainable parameter. We show, both numerically and algebraically, that this minimal extension is sufficient to generate probability distributions that cannot be learned by the corresponding unitary model.

Near-term quantum machine learning (QML) models operate in environments wherein noise is unavoidable, arising from both imperfect classical data acquisition and the limitations of noisy intermediate-scale quantum (NISQ) hardware. Although most existing studies have focused primarily on quantum circuit noise in isolation, the combined influence of corrupted classical inputs and quantum hardware noise has received comparatively little attention. In this work, we present a systematic experimental study of the robustness of a variational quantum classifier under realistic multi-level noise conditions. Using the Titanic dataset as a benchmark, a range of dataset-level noise models-including speckle noise, impulse noise, quantization noise, and feature dropout are applied to classical features prior to quantum encoding using a ZZ feature map. In parallel, hardware-inspired quantum noise channels such as depolarizing noise, amplitude damping, phase damping, Pauli errors, and readout errors are incorporated at the circuit level using the Qiskit Aer simulator. The experimental results indicate that noise in classical input data can significantly intensify the effects of quantum decoherence, resulting in less stable training and noticeably lower classification accuracy. Together, these observations emphasize the importance of designing and evaluating quantum machine learning pipelines with noise in mind, and highlight the need to consider classical and quantum noise simultaneously when assessing QML performance in the NISQ era

We develop a semiclassical Boltzmann theory for frequency-dependent magneto-optical transport in Weyl semimetals (WSMs), incorporating momentum-dependent relaxation via a scattering matrix approach. The interplay of orbital magnetic moment, Weyl cone tilt, intervalley scattering, and electromagnetic driving is analyzed to obtain the full conductivity tensor in the presence of a static magnetic field. For untilted WSMs with orbital magnetic moment, strong intervalley scattering in the weak ac regime induces a sign reversal of the longitudinal magneto-optical conductivity (LMOC), thereby suppressing the chiral anomaly. In contrast, in the strong ac regime, intervalley scattering fails to neutralize the chiral imbalance within a driving cycle, and no sign reversal is observed. Orbital magnetic moment induces linear magnetic-field contributions, while chiral anomaly yields quadratic response accompanied by expected angular profiles. Tilt direction and orientation strongly affect LMOC such as, transverse tilt gives symmetric non-monotonic behavior, whereas parallel tilt leads to asymmetric, nearly monotonic response. Notably, negative LMOC arises intrinsically for parallel tilt, but requires orbital magnetic moment for transverse tilt. These results highlight frequency-dependent conductivity as a sensitive probe of chiral relaxation in MHz-THz magneto-optical experiments.

The evolution of a charged lepton in the field of an electromagnetic plane wave can be described as a superposition of Volkov states. Here we demonstrate that imposing specific momentum correlations among Volkov states produces a spatiotemporally structured wavepacket whose probability-density peak travels at an arbitrary, tailored velocity. This velocity can be chosen independently of both the field amplitude and the velocity expectation value. The imposed momentum correlations modify the expectation-value trajectory, providing a measurable signature of the arbitrary velocity within a physical observable.

We present a hardware-validated reference dataset for variational ground-state energy calculations of the hydrogen molecule H\(_2\) on several IBM Quantum processors available in 2026. Using a standardized workflow, we benchmark the impact of shot count, backend choice, optimization strategy, and runtime variability on the achievable energy accuracy relative to exact diagonalization. The resulting dataset and analysis provide a transparent baseline for assessing the current capabilities and limitations of IBM Quantum hardware for quantum-chemistry applications, and are meant to ease the entry for new users by providing a comprehensive overview of choices and their effects as well as runtime efforts and costs that can be expected. Across the configurations studied here, circuit simplification through tapered mappings provides the most consistent accuracy gains, resilience level 1 improves accuracy at a substantial cost premium, and session-based execution yields no systematic accuracy advantage over single-job execution despite markedly higher billed time.

The non-Hermitian skin effect (NHSE) refers to the accumulation of an extensive number of eigenstates at system boundaries under open boundary conditions (OBCs). As a dynamical consequence, wave packets in such systems drift and ultimately accumulate at a boundary, giving rise to the dynamical skin effect (DSE). While strong quasiperiodic potentials are known to suppress the DSE by inducing localization, we show that the introduction of Ornstein-Uhlenbeck (OU) noise unexpectedly restores it. Using perturbative analysis, we demonstrate that noise effectively maps the non-Hermitian Schrödinger dynamics onto a non-reciprocal master equation, whose complex spectrum develops a noise-induced point gap. This mechanism enables delocalization, reinstates directional transport, and revives the DSE even in regimes where the static NHSE is absent. Moreover, the relaxation dynamics exhibit a non-monotonic dependence on noise strength, reflecting a competition between noise-assisted delocalization and noise-induced decoherence. Our results uncover a noise-enabled mechanism for resurrecting the DSE and suggest a new route for controlling transport in quasiperiodic, open quantum systems.

Quantum annealing (QA) is a promising approach for solving combinatorial optimization problems; however, it is known to exhibit unfair sampling, in which degenerate ground states are not sampled with equal probability even for sufficiently long annealing times. Fair sampling is important in applications such as solution diversity assessment and combinatorial counting, yet the mechanism of unfair sampling remains poorly understood, particularly in constrained combinatorial optimization problems. In this work, we investigate unfair sampling of QA in weighted graph bipartitioning problems (GBP), a representative constrained optimization problem. We study how the penalty coefficient in the penalty method affects sampling fairness. Through numerical simulations and experiments on the D-Wave Advantage2 system, we show that increasing the penalty coefficient reduces unfair sampling in a representative single instance, and that this qualitative behavior is also observed on actual hardware. A scaling analysis over randomly generated instances with up to 12 spins reveals that, while this trend does not hold universally, more than 70% of instances exhibit monotonically increasing sampling fairness as the penalty coefficient increases, even at the largest system size studied. These results show that increasing the penalty coefficient improves sampling fairness, though at the cost of ground-state probability under practical annealing conditions, and call for a deeper theoretical understanding of unfair sampling in constrained optimization problems.

Device-independent quantum key distribution (DI-QKD) provides the highest level of cryptographic security by certifying secrecy through observed Bell inequality violations, independent of the internal device physics. However, the transition from theory to practice is obstructed by the dual challenge of closing the detection loophole and achieving viable key rates over fiber distances. In this paper, we present a comprehensive theoretical framework for DI-QKD implemented on topological Majorana Zero Mode (MZM) processors. While MZMs offer a native parity-readout basis that simplifies Bell-state measurement, their viability as QKD nodes is fundamentally constrained by the interplay between storage latency and quasiparticle poisoning. We bridge the gap between microscopic hardware noise and macroscopic security by: (i) developing a hardware-native error model that maps MZM-specific processes, including poisoning rates, braid infidelities, and readout anisotropy, directly to the CHSH Bell parameter $S$; (ii) introducing a loss-disciplined protocol that monitors setting-conditional efficiencies to strictly enforce detection-loophole closure in a heralded architecture; and (iii) providing a composable finite-size security proof based on the Entropy Accumulation Theorem (EAT). Our analysis reveals that while topological protection stabilizes the system against calibration drift, the achievable secure distance is strictly bounded by the poisoning-induced visibility collapse during the photonic round-trip time. We identify specific hardware thresholds, particularly the suppression of poisoning rates to $Γ_p τ_{\text{max}} \ll 1$ and high-fidelity sensor integration, as the critical path for viable topological quantum networks.

Recently, conjectured and verified in TIFM model that for a sudden quench within the same physical phase region, the overlap of the initial ground state with the final eigenstates is maximal for the final ground state. We solve this problem exactly for a broad class of translationally invariant free-fermion systems. For Hamiltonians that factorize into independent $2\times2$ sectors, the final ground state is uniquely maximal if and only if the initial and final sector Bloch vectors have positive dot product. This exact criterion proves the conjecture for large classes, but also shows that it is false in general: in Kitaev chains there are same-phase quenches for which the final ground state is not the maximal-overlap state. The same mechanism has a direct dynamical consequence, implying that same-phase quenches can generate DQPTs without crossing an physical phase boundary.

Absence of thermalization after a global quantum quench is a well-established numerical observation in integrable many-body systems, and can be empirically related to a violation of the eigenstate thermalization hypothesis (ETH) in such models. Still, in many of those examples a weaker version of the conventional ETH (wETH) has been numerically reported or even rigorously proven. In this paper we show analytically and illustrate numerically that the absence of thermalization is already possible after a local quench. A closely related finding is a strong violation of the ETH, meaning that not even the wETH is fulfilled anymore. In our analytical explorations we focus on XX-spin-chain models with open boundary conditions, where the local quench is generated by initiating the system in thermal equilibrium and then suddenly switching on (or slightly changing) a single-spin impurity either at the end or in the center of the chain. Numerically we observe qualitatively similar phenomena also for more general XXZ-models in the case of an end-impurity, but not in the case of a central impurity.

Quantum computing is increasingly offering concrete solutions toward the simulation of nuclear structure, with the potential to overcome the exponential scaling that limits classical diagonalization methods in large spaces. A particularly efficient encoding scheme, based on collective like-nucleon pairing modes, reduces the qubit requirements by half and avoids the non-local operator strings of standard fermion-to-qubit mappings. While this quasiparticle framework provides accurate results for semimagic nuclei, it does not adequately describe open-shell systems where proton-neutron correlations become important. In this work, we apply Brillouin-Wigner perturbation theory to systematically improve the quasiparticle description of open-shell nuclei in the $sd$ shell, reaching an energy relative error below $0.2\%$ compared to the nuclear shell model. Furthermore, to make the effective Hamiltonian suitable for quantum simulation, we introduce a mean-field Hartree-Fock approximation of the non-quasiparticle resolvent, achieving ground-state energies typically within $2\%$ of the exact shell-model result. This represents a systematic improvement over the bare quasiparticle Hamiltonian while remaining within the reach of near-term quantum devices.

We present an analytically tractable model of a driven quantum harmonic emitter, such as an oscillating charged dipole, emitting radiation via resonance fluorescence. With this model we are able to characterize the quantum mechanical correlations that are built up at early times between the drive, the resonant emitter, and its fluorescence. We describe detection strategies that can reveal these quantum signatures in experiments by performing joint measurements on the quantum emitter and its fluorescence field. In particular, we show that simultaneous quantum measurements of a driven quantum emitter and its fluorescence can be used to probe the quantum noise of the driving field, relative to the maximally classical coherent state of the driving field, in short-time experiments. We conclude by discussing the applications to quantum sensing in quantum optical, quantum acoustic, and quantum gravitational scenarios of interest.

Two-dimensional materials that exhibit optically active spin and valley degrees of freedom represent one of the most fascinating -- and potentially most technologically useful -- platforms for the ultrafast interaction of light and matter. Here we show, via the example of Cr$_2$SO, that two dimensional altermagnets host valley states controllable by femtosecond laser light: linearly polarized light pulses excite charge at one of two inequivalent valleys, with which valley charge is excited at determined by the polarization vector direction. This underpins a rich spin and valley physics including: (i) valleytronics $-$ the generation of nearly 100$\%$ spin polarized valley currents, as well as (ii) a "ghost Hall" effect $-$ the ultrafast creation of states in which spin and charge currents are orthogonal without invoking Hall physics. Our findings establish 2d altermagents as a platform providing a new route for the control of spin- and charge currents at ultrafast times.

Solid-state platforms are particularly attractive for quantum optics because they facilitate on-chip integration and are compatible with established semiconductor and photonic technologies. However, a major challenge in solid-state quantum optics is the fabrication of arrays of identical emitters, such as quantum dots. In this work, we propose moire superlattices as a novel solid-state platform for manipulating light at the single-photon level. Moire superlattices form arrays of artificial-atom states characterized by nearly identical optical transition energies, tunable spacing, and highly adjustable electronic structures. They naturally operate as atomically thin, scalable, periodic emitters, making them ideal for quantum applications. Additionally, the extensive materials database of moire superlattices offers spectral coverage spanning a broad range of optical wavelengths.

Color centers associated with group-IV dopants in diamond with long-lived nuclear spins have emerged as major candidates for distributed quantum computing nodes and quantum repeaters. Several proof-of-principle experiments have already been demonstrated. A key operation for long-distance entanglement-distribution protocols are fast and robust gates between the electron spin and a nuclear spin. Here, we investigate numerically for an existing experimental platform of a Germanium-vacancy (GeV) center with a strongly-coupled ${}^{13}$C spin, how such gates can be implemented via quantum optimal control. In the presence of realistic noise we investigate different parameter regimes and gate operations and obtain robust two-qubit gates with fidelities exceeding $99.9 \%$. The framework provides a scalable strategy for group-IV quantum nodes and can be adapted to related architectures.

We develop a fidelity-informed neural pulse-compilation framework for a continuous family of single-qubit gates on a three-qubit liquid-state nuclear magnetic resonance (NMR) processor. Instead of decomposing each target unitary into a sequence of calibrated basis gates, the method learns a direct map from the axis-angle parameters of an arbitrary U_2 in SU(2) operation to a piecewise-constant radio-frequency control sequence that implements the desired transformation. Training is performed end-to-end through the time-ordered propagator of the driven Hamiltonian using global-phase-insensitive unitary fidelity as the learning signal. We show numerically that a single model generalizes across a continuous range of gate parameters and experimentally validate representative compiled pulses on a benchtop three-qubit NMR device. In addition, we analyze sensitivity to structured perturbations in Hamiltonian and control parameters by introducing a prescribed uncertainty set and performing a comparative risk-aware redesign based on right-tail Conditional Value-at-Risk (RU-CVaR). This stage produces pulse solutions with broader tolerance margins within the chosen uncertainty model. The results demonstrate continuous pulse-level gate synthesis in an experimentally accessible setting and illustrate a hardware-aware compilation strategy that can be extended to other quantum platforms. While the uncertainty model considered here is tailored to NMR, the neural compilation and risk-aware optimization framework are general and may be useful in architectures where calibration overhead, parameter drift, or control constraints make repeated per-gate optimization costly.

Accessing quantum advantage (QA) is a legitimate task in energy harvesting devices, and it is potentially reshaping thermodynamic concepts. In this respect, the resourceful quantum non-Gaussian (QNG) states are promising candidates that precisely enable universal quantum operations to enhance thermodynamic performance with capabilities beyond what Gaussian states can achieve. We recently proposed [K. Adhikary, D. W. Moore, and R. Filip, {\em Quantum Sci. Technol.} \textbf{10}, 035048 (2025)] the QNG state generation scheme, which serves as the framework for this study and is directly integrated into the battery setting to figure out QA. By leveraging coherence in the engineered QNG states, we aim to optimize the performance of quantum batteries for various Gaussian charger profiles under unitary dynamics. We further exploit the degree of thermal broadening and environmental coupling to the charger, which is capable of fostering stable performance under precise thermal management. This study provides a proof-of-concept for exploiting thermodynamic resources in quantum energy storage units.

We show that quantum computational imaging is advantageous in the setting of low-dose electron microscopy of beam-sensitive specimens. Two qudits placed near the electron beam enable full transfer of quantum information between the electron microscope and a quantum computer in the proposed scheme, providing the specimen is a phase object. We present a quantum algorithm that identifies the correct image among n candidate images, where n is larger than the effective dimension of the Hilbert space of the imaging electron.

The reliable operation of finite-time quantum heat engines is fundamentally limited by control imperfections that induce nonadiabatic phase accumulation and quantum friction, degrading the stability of the thermodynamic cycle. Traditional monitoring relies on energetic observables such as instantaneous cycle work; however, under finite-time driving, these quantities exhibit strong fluctuations, obscuring reliable single-shot fault detection without extensive statistical averaging. Here, we apply a topological data analysis (TDA)-based approach to establish a non-invasive, purely geometric framework for diagnosing control failures in finite-time quantum Otto engines. We construct time-delay embeddings from weak measurements and map the dynamics into persistent homology diagrams. We define a scalar quality index based on Wasserstein and Bottleneck distances that tracks control degradation and anticipates cyclic failure. By encoding topology via persistence images and silhouettes, we achieve highly robust classification of degraded operation across diverse noise profiles. We benchmark the TDA-based approach (topological engine monitor, TEM) against a standard multi-feature statistical baseline (spectral-statistical monitor, SSM) across progressively realistic noise settings, from global timing jitter to correlated adiabatic noise and coherence injection. We find that as noise becomes more localized and realistic, the conventional SSM approach degrades while the TEM remains robust. Finally, a pixel-wise Pearson correlation analysis reveals that the method captures microscopic signatures of quantum friction. Our results demonstrate the potential of topology-based diagnostics for non-ideal quantum thermodynamic devices.

Stationary multi-magnetometer arrays are routinely deployed in geomagnetic observatories, laboratory shielded rooms, and ground-based monitoring stations. The standard analysis pipeline reduces each sensor to an independent power spectrum, discarding any inter-sensor structure that is itself diagnostic of measurement health and of localised magnetic activity. This paper develops a purely theoretical framework for a deliberately simple visualisation that maps the short-time Fourier (STFT) power spectra of three concurrent magnetometers into the red, green, and blue channels of a single image: the \emph{cross-sensor RGB spectrogram}. Inter-sensor coherence appears as neutral grey or white, while spectral energy that is unique to one or two sensors stands out as saturated colour. We formalise the construction of the image, derive its time-frequency resolution properties, give an explicit account of the per-channel normalisation choice, and present a colour-anomaly taxonomy that distinguishes coherent broadband activity, single-sensor faults, asymmetric pairwise sources, and slow temporal drift. A companion long-window variant is described for resolving features in the ultra-low frequency (ULF) band. The construction is presented without reference to any particular dataset or implementation; it is intended as a self-contained methodological building block that can be inserted into any monitoring pipeline whose front end is a synchronously sampled magnetometer triad. Because the construction operates on scalar magnitude time series alone, it applies equally to classical fluxgate sensors and to quantum magnetometers -- optically pumped magnetometers (OPMs), nitrogen-vacancy (NV) centre arrays, and superconducting quantum interference devices (SQUIDs) -- where distinguishing quantum-limited noise from technical artefacts is a central diagnostic challenge.

We analyze a class of one-dimensional quantum systems characterized by a position-dependent kinetic term arising as the continuum limit of an inhomogeneous tight-binding model with spatially varying hopping amplitudes. In this limit, the Schrodinger equation takes the so-called BenDaniel-Duke form with an effective mass, scaling as $m_{eff}(x) = m_{eff}|x|^α$ with $α> 0$, leading to a framework we term sluggish quantum mechanics, where particle motion is progressively suppressed at larger distances. Both without any external potential and with $V_{ext}(x)=\frac{1}{2}m_{eff}ω^2 |x|^{α+2}$, we obtain the eigenfunctions and the quantum propagators exactly. We then investigate the problem of $N$ noninteracting spinless fermions in the trap, determining the many-body ground-state wavefunction and the joint probability density function of the positions of the $N$ fermions. We show that the many-body quantum probability density in the ground state forms a determinantal point process whose correlation kernel can be computed for any $N$, giving access to the average density as well as higher order correlation functions for any finite $N$. Moreover, we analyze the scaling form of this kernel in the large $N$ limit in the bulk, near the edge, and close to the origin. Our results show that the scaled average density profile for large $N$ has a finite support symmetric with respect to the origin, but has a non-monotonic shape with a vanishing minimum at the origin for any $α>0$. One of the key findings of our work is that the scaled kernel near the origin $x=0$ for $α>0$ is neither the Bessel nor the Airy kernel (that are standard for trapped fermions), but is new, and is given by a sum of two Bessel kernels with different indices. Our results thus provide a framework relevant to engineered optical lattices with position-dependent tunneling.

The search for quantum-like wave formulations of the Navier-Stokes (Schrödinger-Navier-Stokes, SNS for short) equations describing classical dissipative fluids has met with increasing attention in the recent years, due to the large portfolio of potential applications in science and engineering. A SNS formulation of classical fluids was first presented in a largely un-noticed paper by Dietrich and Vautherin back in 1985(Journal de Physique). In this paper, we revisit this specific SNS approach and assess its viability for quantum implementations based on Carleman embedding/linearization techniques. Specifically, we i) Clarify in full mathematical detail why the SNS dissipator presents a steep challenge for quantum computers and propose a way out strategy based on the Hamilton-Jacobi (HJ) formulation of fluid dynamics; ii) Develop a corresponding quantum algorithm using a new technique based on a tensor-network representation of Carleman embedding of the HJ equations (CHJ) which permits substantial memory savings; iii) Emulate the CHJ quantum algorithm on a classical computer and analyse its convergence and accuracy for the specific case of Kolmogorov-like flows at moderate Reynolds numbers. To the best of our knowledge, this is the first quantum algorithm based on a quantum-like wave formulation of the genuine Navier-Stokes equations, including pressure, dissipation and vorticity.

We present a strategy for the quantum simulation of many-body lattice models with constrained Hilbert spaces. We focus on lattice gauge theories (LGTs), which underlie a wide range of phenomena in particle physics, condensed matter, and quantum information. In present-day quantum computing platforms, perfect restrictions of the Hilbert space to the desired gauge sectors are beyond reach: for LGTs, violations of the local constraint are unavoidable, posing a formidable challenge for the emulation of the underlying physics. Here, we develop a Floquet-engineering framework that restructures departures from a target sector such that a series of emergent local symmetries occurs hierarchically in time and in a controllable way. This leads to a set of approximate dynamical selection rules that strongly restrict inter-sector couplings, resulting in a pronounced, symmetry-controlled hierarchy of lifetimes for the state population to spread among sectors. Concretely, this protects $U(1)$ LGTs against violations of the {defining} local symmetry. While some sectors remain very long-lived, others are destabilized on shorter timescales. We numerically verify our theory for the one-dimensional $U(1)$ quantum link model. In addition, we reveal that `defects', whose movement accounts for violations of the gauge constraint, are kinetically constrained, becoming mobile only through the assistance of intra-sector dynamics, which we describe using an effective quantum marble model. Our results can thus be used to extend the lifetime, in the spirit of passive error correction, of quantum simulations of complex many-body problems when emergent or desired local symmetries are only implemented approximately.

We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that the entropy is bounded by the logarithm of a weighted sum of multiplicities of irreducible representations of the bipartition-preserving automorphism subgroup. This bound complements the known degeneracy-based bound, with neither universally dominating the other. For the complete graph $K_n$, the new bound yields an exponential improvement from linear to logarithmic scaling in the system size, consistent with the exact value of the entropy.

Most quantum machine learning (QML) pipelines still rely on static encodings such as angle and amplitude maps, and this limits their ability to handle temporal information. To address this limitation, this paper uses spike-based data representation as an effective encoding mechanism that incorporates temporal structure into quantum feature preparation. Specifically, we propose Spiking-Phase Adaptive Temporal Encoding (SPATE), a novel spike-driven temporal encoding method that converts real-valued tabular features into leaky integrate-and-fire spike trains and maps spike statistics to quantum rotations, augmented with a small set of temporal qubits through controlled phase operations. An encoding-centric evaluation protocol is also introduced to assess representation quality independently of the classifier, covering centered kernel-target alignment (CKTA), Fisher-style separability, inter/intra-class distance ratios, silhouette score, normalized entropy, and pairwise total-variation (TVpair) collapse indicators. Under stratified cross-validation, SPATE yields stronger representations across multiple datasets. For example, SPATE reaches a CKTA of 0.966 and a Fisher score of 7.37 on Blobs, compared with a CKTA of 0.632 and a Fisher score of 0.70 using angle encoding, and achieves a CKTA of 0.506 on Moons, compared with 0.015 using angle or amplitude encoding. These gains translate into stronger hybrid quantum neural network performance within a fixed qubit budget across several tasks, including an accuracy of 0.826 and an AUC of 0.978 for Wine, as well as an accuracy of 0.840 and an AUC of 0.923 for Moons. These results demonstrate that SPATE provides a practical spike-to-phase interface for building more informative quantum feature representations under constrained resources.

We construct a class of quantum many-body systems hosting an $\mathfrak{su}(3)$-invariant scar subspace, extending the conventional paradigm of quantum many-body scars beyond equally spaced spectra and single-directional tower structures. Our construction is based on local constraints that realize an algebraic closure within the scar subspace. As a result, the spectrum in the subspace is no longer equally spaced, but instead forms a multidirectional lattice structure parametrized by multiple independent quantum numbers. This leads to qualitatively new dynamical signatures: instead of single-frequency revivals, the system exhibits multifrequency oscillations governed by integer linear combinations of distinct energy scales. Importantly, the stability of the scar subspace does not rely on exact solvability of individual eigenstates. We show that algebraic closure preserves the invariant subspace even under perturbations that render the eigenstates analytically intractable, thereby realizing quantum many-body scars on an unsolvable reference state. Our results identify algebraic closure as a unifying mechanism underlying scar subspaces beyond the conventional $\mathfrak{su}(2)$ paradigm, and open a route toward richer nonthermal dynamics in nonintegrable quantum systems.