Papers

Transversal CNOTs are ubiquitous for entangling logical qubits of identical CSS codes pairwise. For distinct codes, the options are much more limited, and are typically known only for structurally related code families. We introduce an automated framework for synthesising inter-code logical CNOT circuits between arbitrary CSS codes using chain maps. Given a prescribed bipartite logical CNOT network between these codes, our method constructs the affine space of chain maps realising the desired logical action, and then searches this space for shallow and sparse physical circuit candidates. We benchmark this method on a range of heterogeneous CSS code pairs, recovering known transversal constructions, and finding new low-depth solutions, including distance-preserving and partially distance-preserving examples, which we demonstrate can be promoted to the full code distance using additional flag measurements. We discuss applications to code switching, magic-state injection, Pauli product measurements, and operations on concatenated codes, where bespoke chain maps offer favourable spacetime tradeoffs for logical interfaces tailored to heterogeneous architectures. Finally, we show how our framework straightforwardly extends to targeted logical CZ gates.

Characterizing noise in quantum circuits is fundamentally limited by gauge degrees of freedom; certain parameters, such as the individual contributions of state preparation and measurement (SPAM) errors, are in principle unlearnable from any experiment within the gate set. Here, we show that the physical structure of realistic noise processes imposes approximate symmetry constraints on the Pauli fidelities of gate noise channels. These symmetries relate the fidelity of a Pauli $P$ and its gate-conjugate $U_g P U_g ^{\dagger}$, and can be used to fix the gauge using only knowledge of the error type and not its magnitude. Using Lindbladian perturbation theory, we analyze a broad class of Clifford gates, including $ZZ_{\pi/2}$, CZ, CNOT, iSWAP, and SWAP, and demonstrate that coherent errors do not induce first-order asymmetry, while only a restricted set of predominantly off-diagonal dissipative errors can break the symmetry at first order, for which we derive simple selection rules. Notably, common single-qubit noise sources such as $T_1$-relaxation and $T_{2\phi}$-pure-dephasing can only cause asymmetry at second order. Leveraging these symmetries to fix the gauge enables systematic identification of SPAM errors, simplifying error characterization and mitigation. We validate our results numerically and experimentally on IBM Kingston.

We investigate the integrability-to-chaos transition and information scrambling in Ising spin networks via a graph-theoretic formulation. Modeling spins as vertices and interactions as edges encoded by adjacency matrices across path, Erdos-Renyi, and Watts-Strogatz topologies, we demonstrate that long-range couplings and heterogeneous degree distributions markedly accelerate quantum information propagation. The Hamiltonian comprises local and normalized non-local interactions; tuning the non-local coupling and field heterogeneity drives integrability breaking. To quantify scrambling, we employ bipartite mutual and tripartite information. Increasing non-local interactions drives tripartite information to large negative values, signaling deep information scrambling. The squared commutators constructed from out-of-time-order correlators (OTOCs) exhibit early-time exponential growth; equivalently, the OTOC four-point functions themselves decay exponentially, yielding quantum Lyapunov exponents that scale systematically with parameters governing the chaotic regime. Complementing this, Krylov complexity reveals rapid operator growth in the chaotic phase, synchronizing with OTOC and mutual information dynamics. Spectrally, the transition manifests as a shift from Poissonian to Wigner-Dyson level spacing statistics. The spectral form factor (SFF) exhibits the characteristic slope-dip-ramp-plateau structure, enabling the extraction of Thouless and Heisenberg times. Crucially, a reduced Thouless time strongly correlates with accelerated information and operator scrambling. Ultimately, this work establishes a unified framework bridging network topology with information-theoretic, operator, and spectral diagnostics, offering insights into thermalization and non-equilibrium dynamics in quantum many-body systems.

The dynamics of a quantum system encode signatures of whether the underlying Hamiltonian is integrable or chaotic, giving rise to the concept of quantum information scrambling through the properties of the resulting dynamical states or operators. We introduce an information-theoretic framework based on the Haar-averaged sum of total correlations (aSTC), together with average genuine multipartite entanglement generated dynamically from initially fully separable states, as robust probes of quantum information scrambling. Using the long-range quantum XYZ spin model in transverse and longitudinal magnetic fields, whose integrable limit is the nearest-neighbor transverse XY model, we demonstrate that the long-time average and, more importantly, the temporal fluctuations of the aSTC provide a faithful and system-size-independent signature of integrable and chaotic dynamics, similar to the conventional measure of scrambling, out-of-time-ordered correlator (OTOC). When the system is in contact with the thermal reservoir and system-bath coupling follows Markovianity, we find that the fluctuations of the aSTC and OTOC continue to distinguish integrable and chaotic dynamics only at intermediate times. However, we observe that in the non-Markovian domain, information backflow restores the scrambling dynamics, enabling the aSTC to retain its distinguishing power even at long times. Interestingly, we exhibit that, under Markovian amplitude damping and non-Markovian dephasing noise, the temporal fluctuations of the aSTC can discriminate between integrability and non-integrability in the weak Markovian regime, even when OTOC fails to do so.

We introduce a graph-theoretic framework for representing color-ordered maximally helicity violating (MHV) scattering amplitudes in quantum chromodynamics using coined quantum walks on permutation trees. Each root-to-terminal path corresponds to a distinct color ordering of the external gluons, while local transition amplitudes are assigned according to the spinor-product structure of the Parke–Taylor amplitudes. The walk evolves in coherent superpositions over permutation sectors, giving a dynamical picture of the underlying combinatorics. A quantum-channel formulation based on Kraus operators is also introduced to describe sector-resolved contributions, while a weighted collection operator coherently combines the terminal sectors at a common reference node. A quantum Fourier transform on the coin space is then employed to combine the encoded contributions into the corresponding color-decomposed amplitude. Together, these constructions establish a unified graph-based framework connecting permutation trees, quantum walks, and open quantum systems providing a framework for quantum algorithms to simulate scattering processes in quantum field theory. As an example, numerical results for low-point gluon amplitudes demonstrate that the proposed representation faithfully captures the characteristic Parke–Taylor structure and is consistent with analytical results.

We study stabilizer state testing and learning with limited coherent quantum memory. Here an algorithm sequentially receives copies of an unknown $n$-qubit state, but may keep only $k$ qubits of coherent quantum memory between measurements. With unrestricted memory, seminal work of Gross, Nezami and Walter showed how to test $n$-qubit stabilizer states using $6$ copies, which is dimension independent, unlike the learning complexity of $\Theta(n)$. We show that this testing-vs-learning separation is lost under memory constraints. More concretely we show that (1) The sample complexity of testing stabilizer states in the $k$-qubit memory framework is $\Theta(n-k)$. Our upper bound goes via a novel connection to the hidden shift problem and the lower bound is proven using a novel approach to average case bounds on likelihood ratios via combinatorics of the stochastic orthogonal group. (2) The sample complexity of learning stabilizer states with $k$ qubits of memory, in the non-adaptive framework, is $\Theta(n^2/k)$. As a further application of our techniques, we prove an exponential lower bound for purity testing even when the memory may be left coherent throughout the protocol. Our main results identify coherent quantum memory as the resource enabling the usual separation between stabilizer testing and learning. In particular, even with $k=0.99n$ qubits of memory, there is no constant-copy stabilizer tester; furthermore for $k=cn$ qubits of memory (for $0< c < 1$), stabilizer testing is as hard as learning, with both requiring $\Theta(n)$ copies.

Non-Gaussian quantum states and operations constitute essential resources for achieving quantum computational advantage and enabling quantum error correction in bosonic platforms. However, their generation in optical settings remains a challenging experimental task, often relying on probabilistic heralded protocols. Here, we present an in-depth analysis of the suitability of photon catalysis between low number Fock states and squeezed states for the generation of squeezed coherent state superpositions. We employ the stellar rank formalism to characterize the non-Gaussian complexity of input resources (including both states and measurements) and the generated states. This enables a systematic comparison of the fidelity between the catalyzed output and the target states to the maximum fidelity achievable by any protocol with the same non-Gaussian input resources. In this sense, we identify instances where the catalysis protocols considered here are provably optimal. We identify parameter regimes in which high-fidelity approximations of the target states can be achieved with minimal resources. Furthermore, we benchmark the performance of photon catalysis against Gaussian boson sampling-inspired protocols in terms of success probability and state quality, highlighting the advantages of deterministic Fock state sources. We also investigate the generation of related non-Gaussian resources including squeezed Fock states, relevant for quantum error correction. To account for experimental imperfections, we model losses across all optical modes using a Hilbert space truncation approach in the Fock basis and analyze the robustness of the generated states under realistic conditions. Our results quantify the trade-offs between non-Gaussian resource complexity, achievable fidelity, and losses in photon catalysis protocols, providing practical guidelines for near-term photonic implementations.

The no-broadcasting theorem in quantum information says that a set of states on a quantum system admits a common broadcasting (copying) operation if and only if their density matrices belong to a commuting family. We discuss and prove this theorem, as well as the closely related no-cloning theorem in the context of quantum probability theory, i.e. in the category of (finite dimensional) C-star-algebras with unital completely positive maps.

Quantum Fast-Weight Programmers (QFWPs) store temporal information in dynamically programmed variational-circuit parameters rather than in nonlinear recurrent hidden states, offering a practical route to quantum sequence modeling. Self-Modulating QFWP improves this framework by using input-dependent gates for both new fast-weight updates and the accumulated fast-weight state, but its unbounded old-state multiplier can diverge in long-sequence regimes. We propose a bounded old-state modulation rule that applies a sign-preserving tanh gate only to the recurrent memory branch while leaving the additive update and new-update modulation unchanged. We evaluate standard QFWP, full Self-Modulating QFWP, Only-New, and Only-Old variants on two CUDA-Q quantum-dynamics forecasting tasks and on Milan SMS telecommunication activity prediction. The quantum-dynamics results show that old-state modulation is the most consistent source of improvement over Standard QFWP, and that bounding the old-state gate removes long-sequence divergence while improving aggregate robustness. On Milan SMS forecasting, the original unbounded Self-Modulating QFWP converges across the tested grid and shows its clearest gains at longer input windows, with behavior close to the Only-Old ablation. These findings identify accumulated-memory modulation as the key mechanism of Self-Modulating QFWP and bounded old-state gating as a targeted stabilization strategy.

We study the nonequilibrium dynamics following a quantum quench in spin chains that can be solved via a mapping to free fermions in disguise. These models feature an exponential degeneracy of all energy eigenvalues, raising the question of the validity of the established framework describing the properties of integrable systems out of equilibrium. We present two main results. First, we develop an analytic method to compute the quasi-momentum distribution function characterizing the generalized Gibbs ensemble, and derive an analytic formula to compute the corresponding expectation values for special observables. Second, we adapt the standard formula for the entanglement growth based on the quasi-particle picture, discussing how our constructions do not explicitly make use of the zero-energy auxiliary free fermions responsible of the exponential degeneracies. We test our theoretical predictions against numerical tensor-network computations for different initial states and Hamiltonian parameters. For the local observables, we find excellent agreement. For the entanglement dynamics, we find small deviations suggesting that the standard quasi-particle picture is only approximately correct for the initial state considered. Our results represent a first step towards the extension of the established framework of integrable systems out of equilibrium to models hosting free fermions in disguise.

Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps. The scheme restores the uncorrupted state with a fidelity exceeding that achieved by noise parameter independent quantum error correction. We use a generic coherent QER map implemented with a quantum circuit acting on the system together with ancillary qubits to recover quantum information stored in permutation invariant (PI) codes. PI codes admit tunable parameters to suit the noise model and benefit from simple recovery operation circuits with reduced addressability requirements, unlike stabilizer codes. We showcase the method by modeling QER in PI codes after collective and local symmetric correlated amplitude-damping (AD) noise, a non-Pauli noise process for which stabilizer codes often require additional overhead. We also propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors. We show that CAD9 (supported on 9 qubits) code beats many existing codes by more than one order of magnitude. For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates which can be realized from linear geometric phase gates. Our work provides a direct path from optimized recovery maps to experimentally implementable, low-overhead protocols.

The universality of dynamical scaling laws constitutes a cornerstone in the theoretical understanding of quantum many-body systems, particularly in non-equilibrium settings. Recent advancements have proposed a phenomenological ansatz based on spontaneous symmetry breaking (SSB) to unify the description of charge transport in open quantum systems. However, it remains unclear under which conditions it fails to capture the emergent hydrodynamics and if it does break down, whether nontrivial dynamics emerge. In this work we show that Kardar-Parisi-Zhang (KPZ) dynamics in an open integrable model (the B3 model), rather than diffusion from SSB, emerges. We find that the B3 model is equivalent to two interacting asymmetric XXZ spin chains and the ansatz can only capture the influence of the inter-chain interactions. When the initial state is appropriate, the asymmetric XXZ structure dominates the dynamics, which gives KPZ scaling behavior even when the hopping rate becomes negative. Our work motivates theory of charge transport in open systems beyond the ansatz based on SSB.

Correlations between two moments in time can be too strong for any classical explanation – and, remarkably, this can happen for a single quantum system measured twice, with no second particle involved. We show that when one qudit is sent through a noisy channel, the strength of this "nonlocality in time" – the temporal nonlocality robustness $\mathrm{TNR}$ – is carried entirely by the starting state: it vanishes precisely when the input is maximally mixed (completely random), $\mathrm{TNR}(\rho_A,\mathcal{E})=0\Leftrightarrow\rho_A=\mathbb{1}/d$, for the standard noise families. The resource is not any coherence in the channel but the back-action of the input's mixedness, and it survives even complete decoherence. This is at once a power and a trap. As a power, $\mathrm{TNR}$ device-independently lower-bounds the fidelity of temporal teleportation – sending an unknown state forward in time – reaching $7/9$ at $d=3$, without trusting the measuring devices. As a trap, because the certified quantity is decoupled from the channel's actual coherence transmission, it can certify more than the channel delivers: an injective (reversible) unitary attains the maximal temporal-Bell signal yet teleports below the classical baseline. We resolve this over-certification completely – a universal cap $\mathrm{TNR}\le(d-1)/d$ with an exact channel-resolved value, honest certification for the depolarizing channel and for any sufficiently mixed probe, and a proof that no choice of probes makes it channel-universal. Underpinning the results is a unified semidefinite-programming hierarchy of the temporal entanglement, steering and nonlocality robustnesses ($\mathrm{TER}$, $\mathrm{TSR}$, $\mathrm{TNR}$), with a strict lower hierarchy and an upper one conditional on no-signaling in time ($\mathrm{NSIT}$). All structure is verified numerically for $d=2$ through $5$.

Quantum-enhanced metrology relies on entanglement to achieve sensitivities beyond the standard quantum limit. While remarkable progress has been made in generating highly entangled many-body states, extracting their metrological advantage remains a central challenge because the encoded information is often inaccessible to realistic measurements. A key development of the past decade has been the realization that many-body interactions can play a dual role: they can be used not only to generate entanglement, but also to decode it. This idea underlies interaction-based readout and time-reversal protocols, in which controlled non-linear dynamics transform weakly encoded signals into experimentally accessible observables. Cavity quantum electrodynamics (QED) provides a particularly powerful setting for these approaches because it combines collective enhancement, tunable interactions, and controllable reversibility within a single platform. In this review, we discuss the emergence of time-reversal protocols in cavity QED, from their conceptual roots in Loschmidt echoes to modern implementations of signal amplification through a time-reversed interaction (SATIN), scrambling-enhanced metrology, and more general interaction-based readout schemes. We examine the physical mechanisms that enable reversible many-body dynamics, review key experimental demonstrations, and discuss future directions involving complex entangled states, nonlinear decoding, and emerging quantum platforms. Together, these developments suggest that the ability to decode quantum information may become as important as the ability to generate it, establishing reversible many-body dynamics as a central resource for quantum-enhanced sensing.

Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions. Among NQS parameterizations, autoregressive models are especially attractive because they enable exact, independent sampling from the Born distribution, avoiding the autocorrelation and mixing issues of Markov chain methods. Yet their optimization remains comparatively underexplored: Adam is a scalable method but ignores function space geometry, while stochastic reconfiguration is principled but costly and numerically fragile in large models. To address this gap, we show that variational energy minimization can be viewed as an advantage policy-gradient problem over the Born distribution, motivating trust-region optimization for NQS training. We introduce Proximal Wavefunction Optimization (PWO), a principled trust-region algorithm that clips probability-ratio changes in the amplitude channel and phase increments in the phase channel. PWO avoids explicit matrix inversion, reuses samples across multiple updates, and combines the scalability of first-order optimization with theoretical guarantees. Across Ising and frustrated $J_1$-$J_2$ one- and two-dimensional spin systems, PWO improves stability and wall-clock convergence over Adam, minSR, and SPRING. Finally, we fine-tune a $1.5$B-parameter RWKV-7 model, demonstrating NQS optimization at a scale over three orders of magnitude beyond prior work.

Three-dimensional superconducting radio-frequency (SRF) cavities provide exceptionally long-lived electromagnetic modes and, when coupled to nonlinear elements such as transmon qubits, become promising architectures for bosonic quantum information processing. The inverse design of such systems, i.e., recovering device geometries that produce specified electromagnetic and coupling targets, is generally a one-to-many problem. The qubit-cavity coupling strength depends sensitively on both the transmon geometry and its position within the cavity's electromagnetic field. As these systems scale up and their design parameter spaces grow, the cost of conventional iterative simulation becomes prohibitive. We present two deep neural network (DNN) approaches that address this inverse-design problem at complementary levels of the design stack. The first proposes SRF cavity geometries that produce target cavity observables. The second proposes transmon qubit designs that produce target qubit-cavity parameters - the coupling rate, qubit frequency, and anharmonicity $(g, \nu_q, \alpha)$. The recovered candidate designs match the targets to within ~5% (cavity) and ~2% (transmon), confirmed by end-to-end re-simulation. Both approaches map desired device behavior directly to candidate designs, a fast alternative to the iterative simulation studies usually required.

Braiding phenomena, from the charge-flux Aharonov-Bohm effect to anyonic statistics in fractional quantum Hall systems, are paradigmatic manifestations of topology in quantum physics. Ordinary mutual braiding between $p$- and $q$-dimensional excitations occurs in $d=p+q+2$ spatial dimensions. In this work, we introduce a universal construction of mutual statistics in the adjacent dimension $d=p+q+1$, applicable to excitations obeying $\mathbb Z_N$ fusion for arbitrary $N$ and all excitation dimensions $p$ and $q$. The corresponding invariant is the Berry phase accumulated in a simple $4N$-step microscopic unitary process built from local excitation operators on lattices. This process measures the linking of one excitation with the $N$-fold fusion junction of the other, encompassing particle-particle statistics in one dimension, particle-loop statistics in two dimensions, and loop-loop or particle-membrane statistics in three dimensions. We establish the quantization and bilinearity of the invariant and show that its field-theory response is governed by the Bockstein homomorphism, motivating the name Bockstein braiding statistics. Interpreting the excitation operators as open symmetry operators turns the same invariant into a direct microscopic diagnostic of mixed anomalies between symmetries. We demonstrate this diagnostic in a (1+1)D spin chain, where the nontrivial Bockstein braiding phase proves the mixed anomaly between the spin-flip symmetry $\prod X$ and the nearest-neighbor controlled-$Z$ symmetry $\prod CZ$. We construct explicit (2+1)D and (3+1)D lattice analogs, yielding new anomalous symmetry pairs, and apply the framework to strongly coupled (3+1)D continuum gauge theories. Nontrivial Bockstein braiding rules out a fully symmetric gapped phase, obstructs simultaneous condensation of the two excitations, and implies fractionalization of higher-form symmetries.

Quantum networks require qubits that combine efficient optical access, coherent control, and long-lived quantum memory, but realizing all three in one scalable platform remains a central bottleneck. Diamond color centers are leading candidates, yet widely studied defects retain tradeoffs among these capabilities. Here, we show that transition-metal defects in diamond provide a distinct route beyond these platforms by combining spin-orbit protected ground-state coherence, all-optical control, and near-infrared emission. Using a single nickel-vacancy (NiV$^-$), we demonstrate an all-optically controlled diamond spin qubit with coherence exceeding one millisecond at 1.65 K, compatible with compact closed-cycle cryogenics. We implement Raman Rabi oscillations and Ramsey interferometry and use all-optical dynamical decoupling to extend coherence from $T_2^*$ = 371 ns to $T_2^{CPMG-4}$ = 1.27 ms, establishing NiV$^-$ as a deployable diamond spin-photon interface.

Fermionic non-Gaussianity, or fermionic magic, is a key resource underlying the computational complexity of fermionic quantum systems, yet tractable and operationally meaningful ways to quantify it remain limited. We address this challenge by developing a convex resource theory of fermionic non-Gaussianity and introducing two families of computable quantities for pure fermionic states, both derived from the Williamson normal form of the covariance matrix. The first family, occupation number entropies, is defined as the Tsallis-$\alpha$ entropy of the occupation numbers. We prove that one member of this family is monotonic under Gaussian protocols, establishing it as a computable convex resource monotone. It consequently lower bounds the number of non-Gaussian gates needed for state preparation. The second family, natural-orbital participation entropies, is given by the Rényi-$\alpha$ entropy of the squared amplitudes of the state in the natural-orbital basis, defined by the eigenvectors of the covariance matrix. They quantify state compressibility in this basis and thus upper bound the classical simulation cost in an orthonormal Gaussian basis. We analyze both families for stabilizer and translation-invariant states, where they simplify and reveal additional structure. We further study representative examples, including random SWAP-doped matchgate circuits and the bond-modulated XXZ model, highlighting the role of non-Gaussianity in many-body phenomena. Our work establishes a resource-theoretic framework for computable fermionic non-Gaussianity that unifies notions arising across quantum information, condensed-matter physics, and quantum chemistry, opening new directions for studying the complexity of quantum many-body systems and providing practical tools to assess the classical simulability of fermionic states relevant for quantum advantage.

We prove that any generalized extended code is monomially equivalent to the Hermitian dual of a code which is closely related to a second kind of extended code of $\C^{\perp_{\rm H}}$. Every $[n+1,k+1]_{q^2}$ linear code $\D$ with $d(\D^{\perp_{\rm H}})>1$ is monomially equivalent to the generalized extended code $\C({\bf u},a)$ of an $[n,k]_{q^2}$ linear code $\C$ for a fixed $a\in\F_{q^2}^{*}$ and some ${\bf u}\in\F_{q^2}^{n}$. We then characterize the Hermitian hull and Hermitian dual distance of $\C({\bf u},a)$ in terms of the position of ${\bf u}$ relative to $\C+\C^{\perp_{\rm H}}$ and the interaction between ${\bf u}$ and the minimum weight codewords of $\C^{\perp_{\rm H}}$, respectively. We obtain explicit criteria to independently control the expected Hermitian hull dimension and Hermitian dual distance of $\C({\bf u},a)$. In particular, several conditions for simultaneously increasing the Hermitian hull dimension and the Hermitian dual distance of $\C({\bf u},a)$ are derived. Applying these results to the Hermitian construction for EAQECCs gives us $267$ new EA qubit codes of lengths $n \leq 40$ and $14$ new EA qutrit codes of lengths $n \leq 25$ compared to the best-known codes in Grassl's code tables and the imporvements recorded in very recent works in the literature. Among the new parameter sets, we confirm improvements for $236$ qubit and $8$ qutrit codes.

We connect the structure theorem for quasiprobability representations to quantum error correction. For a code space invariant under a subgroup of an extended Weyl-Heisenberg group, the Brif-Mann construction gives a semi-functorial representation whenever its kernel satisfies the Stratonovich-Weyl axioms, and composes on channels covering full error-correction cycles. With phase-space parity available, a kernel other than the ordinary Wigner one exists iff the code space is invariant under a lattice of displacements: among compact-phase-space bosonic codes, this is only the ideal Gottesman-Kitaev-Preskill family; in finite dimension, this is every qudit stabiliser code, whose negative volume for odd prime dimension is the syndrome-averaged logical magic. For rotation-symmetric, one-photon, non-Pauli qudit and spin codes only the ordinary kernel remains, its negativity reflecting the physical carrier, not logical content; a sector-graded representation built from recovery isometries restores a resource reading. We add a channel atlas, a closed-form magic lifetime under displacement noise, a Kirkwood-Dirac layer, and finite-energy corrections.

Quantum reservoir computing provides a framework for processing complex temporal data, yet its fundamental computational and energetic limits remain unresolved. Here, we establish a non-equilibrium thermodynamic framework that links the macroscopic predictive performance of driven open quantum systems to their microscopic energetic costs. By mapping Holevo capacities onto the Bogoliubov-Kubo-Mori geometric manifold, we analytically prove that the computational peak within the quantum critical region originates from a spectral resonance: the closing of the intrinsic energy gap forces the reservoir's internal transition frequencies to align with the chaotic drive. To evaluate the associated thermodynamic costs, we introduce quantum informational dissipation to quantify the non-predictive historical data retained by the reservoir. This allows us to derive a generalized Landauer bound for continuous temporal processing, which reveals a fundamental thermodynamic trade-off: the critical resonance that maximizes predictive capacity simultaneously maximizes informational dissipation and the irreversible work required for environmental erasure. Furthermore, coherence decomposition demonstrates that quantum coherences amplify predictive capacity without demanding additional mechanical work. These findings establish the fundamental energetic limits of quantum learning devices, providing theoretical principles for designing energy-efficient quantum neuromorphic hardware.

Quantum annealing is a promising heuristic for combinatorial optimization, but on current hardware its performance degrades for larger and more complex problems due to noise and small energy gaps. Reverse annealing has been proposed as a refinement strategy, yet it remains unclear when it provides systematic advantages over standard forward annealing or simply increasing annealing time. We find that combining forward and reverse annealing consistently improves solution quality and efficiency across multiple problem classes. The benefits of reverse annealing increase with problem complexity and are strongest in regimes where forward annealing is increasingly limited. Moreover, reverse annealing yields larger efficiency gains than simply extending forward annealing times. We establish these results through a systematic experimental study on a D-Wave Advantage system, benchmarking reverse annealing across Max-Cut, Number Partitioning, and sparse clustering problems while varying reverse distance, pause duration, and annealing time. We identify a narrow optimal regime for reverse annealing parameters linked to the location of freeze-out points and energy-level crossings in the annealing schedule. These findings demonstrate that reverse annealing is most valuable for large, high-complexity optimization problems and is likely to gain importance as quantum annealing hardware scales toward more realistic applications.

Quantum convolutional neural networks (QCNNs) have become increasingly popular in quantum machine learning (QML) due to their efficient parameterization and hierarchical representation of quantum information. Anomaly detection is an important machine learning task with applications across a wide range of domains, including scientific data analysis. In this work, we adapt a QCNN architecture into a quantum autoencoder (QAE) framework for reconstruction-based anomaly detection. The models are trained in a semi-supervised manner on normal samples to reconstruct feature-extracted and dimensionally reduced time-series data, with reconstruction error used as an anomaly score. We investigate two quantum convolutional autoencoder architectures that differ in their treatment of latent information: a hierarchical architecture in which information remains distributed across the circuit and a bottleneck-based architecture in which information is explicitly compressed and reconstructed using additional decoder qubits. The size of the quantum latent space is varied to study its influence on reconstruction accuracy and anomaly detection performance. The approaches are benchmarked against both a variational quantum circuit and a comparable classical baseline using a real-world exoplanet anomaly-detection dataset. Results indicate a trade-off between latent-space size and model capacity, while also suggesting that explicit latent-space compression through a quantum bottleneck can improve anomaly detection performance relative to architectures that retain information throughout the circuit.

Ultra-thin films are fundamental components of modern nanoelectronics, where reducing thickness to the few-nanometer scale leads to a dramatic increase in electrical resistivity. For decades, this behavior has been interpreted in terms of classical size effects, primarily surface scattering within the Fuchs–Sondheimer theory and grain-boundary scattering in the Mayadas–Shatzkes model. While these approaches successfully describe transport when the film thickness is comparable to the electronic mean free path, growing experimental evidence indicates that they become insufficient under extreme confinement. This review discusses the crossover from classical scattering to a quantum-confinement regime in which the electronic states available for transport are fundamentally restructured by finite size. We review the recently proposed reciprocal-space confinement theory, which predicts an exponential increase of resistivity with decreasing thickness at the nanoscale, and discuss how it can be combined with classical surface-scattering models to provide a unified description of ultra-thin metallic and semiconducting films. Finally, we summarize recent experimental evidence supporting this picture and discuss its implications for future nanoelectronic devices, nanoscale interconnects, and quantum transport under extreme spatial confinement.

We present a complete classification of integrable Yang-Baxter quantum circuits with open boundary conditions and arbitrary circuit geometries. Starting from the standard transfer-matrix construction with two types of staggered inhomogeneities, we derive a general mapping that determines the arrangement of circuit gates in terms of the inhomogeneities and the system size. We conjecture that time-periodic quantum circuits are integrable whenever the local bulk and boundary gates satisfy the Yang-Baxter equation and the same bulk gate is applied exactly once per period to every nearest-neighbor pair of spins. Our construction also provides an algorithm to detect Yang-Baxter integrability for circuits with arbitrary geometries. Furthermore, we introduce a third type of inhomogeneity, denoted by $\rho$, and demonstrate that the minimum possible circuit depth is four. We show that when these $\rho$-inhomogeneities are placed at the endpoints and in their immediate neighborhood, the resulting boundary gates can be interpreted as single gates acting on multiple sites. Our construction is fully general and applies to regular $R$-matrices, both of difference and non-difference type, together with their associated boundary matrices. As an application, we consider two-qubit gates corresponding to 6- and 8-vertex $R$-matrices of non-difference form satisfying the Yang-Baxter equation, and we construct the associated reflection matrices that generate integrable quantum circuits.

We present a theoretical study of electron tunneling through a magnetic barrier in 8-Pmmn borophene, created by depositing two ferromagnetic strips on the borophene sheet. Using a low-energy effective Hamiltonian that captures the anisotropic Dirac spectrum, we solve the Dirac equation in three regions and impose wave-function continuity at the interfaces. From the resulting spinor solutions, we compute current densities and determine transmission and reflection probabilities as functions of incident energy, angle, and barrier parameters. The transmission exhibits strong anisotropy due to the tilted Dirac cones, with pronounced suppression for specific incident directions, suggesting directional filtering of carriers. We further calculate the conductance using the Landauer-Büttiker formalism, revealing that both magnetic strength and barrier width can tune the charge transport properties. The results demonstrate that engineered magnetic barriers in 8-Pmmn borophene enable precise control over electron flow, offering a platform for anisotropic transport control and tunable quantum devices. The interplay between the intrinsic anisotropy of borophene and external magnetic barriers provides rich opportunities to manipulate Dirac fermions in two-dimensional systems.

Mapping methods are often used for the numerical simulation of nonadiabatic systems by propagating classical mapping variable trajectories. A recently popularised mapping method is spin-mapping, whose mapping variables arise from quantum mechanical operators with symmetries described by a Lie-Poisson algebra. Simulating the classical-like dynamics of spin-mapping systems accurately is generally challenging, with many methods unable to preserve the underlying geometric structure of the symplectic form. The Spin-MInt algorithm is a recently proposed algorithm propagating spin-mapping variables, with a direct proof of symplecticity existing only for 2 electronic states. Here, we directly prove the symplecticity of the Spin-MInt algorithm for a general $K$ electronic states. A review of the symplectic nature of coadjoint orbits of the $\mathfrak{su}(K)$ Lie-Poisson algebra provides the framework needed to understand symplecticity of the Spin-MInt algorithm in this general case. The symplecticity of the method on the associated coadjoint orbit is then shown for what we believe to be the first time via an explicit verification of the symplecticity condition $\mathbf{MJ}\mathbf{M}^\textrm{T}=\mathbf{J}$ exploiting the Lie-Poisson structure of the system. To our knowledge, this is the first time the monodromy matrix for the Spin-MInt algorithm has been explicitly stated using canonical coordinates on the coherent state manifold for a general number of states. We hope that this will assist the development of classical-like spin-mapping methods which might utilise elements of the monodromy matrix, and inform future work on similar symplectic algorithms for coupled and uncoupled Lie-Poisson systems.

We investigate the undamped behaviors in a spin-1/2 Heisenberg chain coupled with an environment via collective spin jump operators. Using the Bethe ansatz basis, we show that undamped modes exist for any chain length N >= 3. These modes remain robust against variations in the system parameters, including the specific form of the collective dissipation, and the external field. Exploiting the Bethe ansatz solution, we further characterize the number of undamped modes and their oscillation frequencies, uncovering long-lived coherent dynamics in open integrable quantum systems.

Achieving high-precision quantum computation requires effective suppression of idling errors that occur when qubits remain inactive during waiting periods within a quantum circuit. Conventional mitigation techniques, such as dynamical decoupling, suppress decoherence by periodically refreshing quantum states through the insertion of additional control gates. In this paper, we propose an alternative approach that suppresses idling errors through quantum circuit scheduling without introducing any additional gate operations. By appropriately adjusting the execution timing of quantum gates with scheduling flexibility, we demonstrate through both numerical simulations and hardware experiments that the overall computational accuracy can be significantly influenced and, in many cases, improved. In addition, we analytically derive the density-matrix evolution under idling noise and provide a theoretical framework that explains the observed behavior.