Papers

We investigate the interplay between genuine entanglement harvesting and communication mediated correlations for local particle detectors in expanding cosmological spacetimes. Focusing on a conformally coupled scalar field in de Sitter spacetime, we analyze how spacetime expansion induces interference between these two sources of entanglement when the detectors are in causal contact. We compare two physically distinct detector models: detectors whose spatial profile expands with the Universe, and detectors whose proper size remains fixed despite cosmological expansion. We find that the lack of time-reversal symmetry in cosmological settings generically leads to constructive or destructive interference between communication mediated correlations and harvested field correlations, dramatically affecting the entanglement that detectors can acquire. In particular, rapid expansion can suppress entanglement entirely for expanding detectors through destructive interference, even when both communication and field correlations are individually large, whereas detectors that maintain a fixed proper size remain capable of acquiring significant entanglement. Our results show that cosmological expansion qualitatively reshapes the balance between communication and harvesting, and that the detector internal cohesion (whether it expands with the Universe or not) plays a crucial role in determining whether detectors' entanglement can survive in rapidly expanding universes.

Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network by utilizing strategies based solely on local operations and classical communication between the nodes. As it happens in classical percolation theory, the topology of the network is crucial, but also the entanglement shared between the nodes of the network. In a network of identically partially entangled states, the network topology determines the minimum entanglement needed for percolation. In this work, we generalize the protocol to scenarios where the initial entanglement shared between any two nodes of the network is not the same but has some randomness. In such cases, we find that for classical entanglement percolation, only the average initial entanglement is relevant. In contrast, the quantum entanglement percolation protocol (within the q-swap framework) degrades under these more realistic conditions as the width of the distribution increases, suggesting that Random CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks.

The Kramers-Wannier transformation of the 1+1d transverse-field Ising model exchanges the paramagnetic and ferromagnetic phases and, at criticality, manifests as a non-invertible symmetry. Extending such self-duality symmetries beyond gauging of abelian groups in tensor-product Hilbert spaces has, however, remained challenging. In this work, we construct a generalized 1+1d Ising model based on a finite-dimensional semisimple Hopf algebra $H$ that enjoys an anomaly-free non-invertible symmetry $\mathrm{Rep}(H)$. We provide an intuitive diagrammatic formulation of both the Hamiltonian and the symmetry operators using a non-(co)commutative generalization of ZX-calculus built from Hopf-algebraic data. When $H$ is self-dual, we further construct a generalized Kramers-Wannier duality operator that exchanges the paramagnetic and ferromagnetic phases and becomes a non-invertible symmetry at the self-dual point. This enlarged symmetry mixes with lattice translation and, in the infrared, flows to a weakly integral fusion category given by a $\mathbb{Z}_2$ extension of $\mathrm{Rep}(H)$. Specializing to the Kac-Paljutkin algebra $H_8$, the smallest self-dual Hopf algebra beyond abelian group algebras, we numerically study the phase diagram and identify four of the six $\mathrm{Rep}(H_8)$-symmetric gapped phases, separated by Ising critical lines and meeting at a multicritical point. We also realize all six $\mathrm{Rep}(H_8)$-symmetric gapped phases on the lattice via the $H$-comodule algebra formalism, in agreement with the module-category classification of $\mathrm{Rep}(H_8)$. Our results provide a unified Hopf-algebraic framework for non-invertible symmetries, dualities, and the tensor product lattice models that realize them.

We provide explicit constant-depth local unitary circuits that realize general anyon permutations in Kitaev's quantum double models. This construction can be naturally understood through a correspondence between anyon permutation symmetries of two-dimensional topological orders and self-dualities in one-dimensional systems, where local gates implement self-duality transformations on the boundaries of microscopic regions. From this holographic perspective, general anyon permutations in the $D(G)$ quantum double correspond to compositions of three classes of one-dimensional self-dualities, including gauging of certain subgroups of $G$, stacking with $G$ symmetry-protected topological phases, and outer automorphisms of the group $G$. We construct circuits realizing the first class by employing self-dual unitary gauging maps, and present transversal circuits for the latter two classes.

We introduce a random circuit family and show they are robust against current classical simulation techniques, specifically tensor network contraction and Pauli propagation. We also show that local variables do not concentrate, ensuring enough variance to be able to produce a diverse set of data points. We therefore argue that using these circuits as a "random seed" for a larger classical generative model is a way to make large-scale quantum-classical hybrid models amenable towards NISQ devices.

In black-box combinatorial optimization, objective evaluations are often expensive, so high quality solutions must be found under a limited budget. Factorization machine with quantum annealing (FMQA) builds a quadratic surrogate model from evaluated samples and optimizes it on an Ising machine. However, FMQA requires binary decision variables, and for nonbinary structures such as integer permutations, the choice of binary encoding strongly affects search efficiency. If the encoding fails to reflect the original neighborhood structure, small Hamming moves may not correspond to meaningful modifications in the original solution space, and constrained problems can yield many infeasible candidates that waste evaluations. Recent work combines FMQA with a binary autoencoder (bAE) that learns a compact binary latent code from feasible solutions, yet the mechanism behind its performance gains is unclear. Using a small traveling salesman problem as an interpretable testbed, we show that the bAE reconstructs feasible tours accurately and, compared with manually designed encodings at similar compression, better aligns tour distances with latent Hamming distances, yields smoother neighborhoods under small bit flips, and produces fewer local optima. These geometric properties explain why bAE+FMQA improves the approximation ratio faster while maintaining feasibility throughout optimization, and they provide guidance for designing latent representations for black-box optimization.

We propose a robust platform for simulating chiral quantum magnetism using linear arrays of trapped asymmetric top molecules, specifically 1,2-propanediol ($\mathrm{C_{3}H_{8}O_{2}}$). By mapping the Stark-dressed rotational states onto an effective spin-$1/2$ subspace, we rigorously derive a generalized $XXZ$ Heisenberg Hamiltonian governing the underlying many-body dynamics. Unlike standard solid-state models where the topological Dzyaloshinskii-Moriya Interaction (DMI) is introduced phenomenologically, we demonstrate that DMI emerges ab initio from the molecular stereochemistry. Specifically, the interference between the transition dipole moments of heterochiral enantiomer pairs (L-R), which breaks inversion symmetry, generates a tunable DMI that stabilizes a Chiral Luttinger Liquid phase. Through a comprehensive phase-diagram analysis, we identify an optimal experimental regime characterized by intermolecular separations of \( r \approx 1.5~\mathrm{nm} \) and intermediate electric-field strengths \( d\varepsilon/B \approx 2.5 \). In this window, the system is protected from trivial field-polarized phases and exhibits a robust gapless spin-spiral texture. Our results establish 1,2-propanediol arrays as a versatile quantum simulator, providing a direct microscopic link between molecular chirality and topological many-body phases.

Thermodynamics is commonly presented as a theory of macroscopic systems in stable equilibrium, built upon assumptions of extensivity and scaling with system size. In this paper, we present a universal formulation of the elementary foundations of thermodynamics, in which entropy and energy are defined and employed beyond equilibrium and without assuming extensivity. The formulation applies to all systems – large and small, with many or few particles – and to all states, whether equilibrium or nonequilibrium, by relying on carefully stated operational definitions and existence principles rather than macroscopic idealizations. Key thermodynamic concepts, including adiabatic availability and available energy, are developed and illustrated using the energy-entropy diagram representation of nonequilibrium states, which provides geometric insight into irreversibility and the limits of work extraction for systems of any size. A substantial part of the paper is devoted to the analysis of entropy transfer in non-work interactions, leading to precise definitions of heat interactions and heat-and-diffusion interactions of central importance in mesoscopic continuum theories of nonequilibrium behavior in simple and complex solids and fluids. As a direct consequence of this analysis, Clausius inequalities and the Clausius statement of the second law are derived in forms explicitly extended to nonequilibrium processes. The resulting framework presents thermodynamics as a universal theory whose concepts apply uniformly to all systems, large and small, and provides a coherent foundation for both teaching and modern applications.

We develop an information-theoretic reconstruction of quantum dynamics based on inference over action space. The fundamental object is a density of action states encoding the multiplicity of dynamical alternatives between configurations. Maximum-entropy inference introduces a finite resolution scale in action, implying that sufficiently close action contributions are operationally indistinguishable. We show that this indistinguishability, together with probability normalization and action additivity, selects complex amplitudes and unitary evolution as the minimal continuous representation compatible with action additivity, probability normalization, and inference under finite resolution. Quantum interference and unitarity therefore emerge as consequences of these assumptions rather than independent postulates. From the resulting propagator, the Lagrangian, Hilbert-space structure, and Schrödinger equation follow as derived consequences. In the infinitesimal-time limit, action differences universally fall below the resolution scale, making coherent summation the minimal consistent description at every step. The numerical value of the action scale is fixed empirically and identified with $\hbar$.

Chirality in active and passive fluids gives rise to odd transport properties, most notably the emergence of robust edge currents that defy standard dissipative dynamics. While these phenomena are well-described by continuum hydrodynamics, a microscopic framework connecting them to their topological origins has remained elusive. Here, we present a lattice model for an isotropic chiral random walk that bridges the gap between classical stochastic diffusion and unitary quantum evolution. By equipping the walker with an internal degree of freedom and a tunable chirality parameter, $p$, we interpolate between a standard diffusive random walk and a deterministic, topologically non-trivial quantum walk. We show that the topological protection characteristic of the unitary limit ($p=1$) remarkably persists into the dissipative regime ($p<1$). This correspondence allows us to theoretically ground the robustness of edge flows in classical chiral systems using the bulk-boundary correspondence of Floquet topological insulators. Our results provide a discrete microscopic description for odd diffusion, offering a powerful toolkit to predict transport in confined geometries and disordered chiral media.

Spin qubits are typically operated in the lowest orbital of a quantum dot to minimize interference from nearby states. In valence-band hole systems, strong spin-orbit coupling links spin and orbital degrees of freedom, strongly influencing the hole $g$-factor, a key parameter for qubit control. We investigate the out-of-plane $g$-factor in Ge quantum dots using excitation (single-particle) and addition (many-body) spectra. Excitation spectra allow us to distinguish the pure Zeeman $g$-factor from orbital contributions to the magnetic field splitting of states despite the strong spin-orbit coupling. This distinction clarifies discrepancies between $g$-factors extracted with the two methods, for different orbital states and different hole numbers. Furthermore, we find gate-tunability of $g$-factors at the level of 15%, highlighting its relevance for all-electric qubit manipulation.

The dissipative phase transitions in the open transverse and longitudinal Dicke-Ising model (DIM), which incorporates nearest-neighbor Ising-type spin interactions into the Dicke framework, are investigated within a mean-field approach and further validated by detailed stability analysis. While the dissipative phase diagram of the transverse DIM is only slightly shifted upward compared with its ground-state counterpart, dissipation in the longitudinal DIM stabilizes bistable nonequilibrium steady states and induces first-order phase transitions that are absent in the ground-state phase diagram. This bistable phase is characterized by the coexistence of superradiant and antiferromagnetic orders, and it converts a ground-state triple point into a tetracritical point, at which the boundaries of the first- and second-order transitions intersect. Our results reveal that the interplay among spin interactions, light-matter coupling, and dissipation supports a diverse set of nonequilibrium phase transitions and provides broad tunability of the phase diagram. These findings offer a theoretical foundation for exploring nonequilibrium physics in realistic open solid-state quantum systems.

Quantum state preparation is a fundamental component of quantum algorithms, particularly in quantum machine learning and data processing, where classical data must be encoded efficiently into quantum states. Existing amplitude encoding techniques often rely on recursive bipartitions or tensor decompositions, which either lead to deep circuits or lack practical guidance for circuit construction. In this work, we introduce Tucker Iterative Quantum State Preparation (Q-Tucker), a novel method that adaptively constructs shallow, deterministic quantum circuits by exploiting the global entanglement structure of target states. Building upon the Tucker decomposition, our method factors the target quantum state into a core tensor and mode-specific operators, enabling direct decompositions across multiple subsystems.

Quantum steering ellipsoids (QSEs) provide a geometric representation, within the Bloch picture, of all possible states to which one qubit can be steered through measuring another correlated qubit. However, in realistic settings, quantum systems are inevitably coupled to their environment, resulting in decoherence and degradation of the QSE. Here, by investigating how local dissipative environments coupled to each qubit affect the quantum steering, we find that the geometry of each party's QSE is closely tied to the non-Markovian effect and the formation of a bound state in the energy spectrum of the total qubit-environment system. The bound state provides the ability and the non-Markovian effect provides the dynamical way for preserving the QSE. We systematically examine the characteristics of QSEs under three distinct scenarios, i.e., two-sided bound states, one-sided bound states, and no bound state, revealing a diverse range of steering types. Our work establishes quantum reservoir engineering as a tunable strategy for protecting and controlling quantum steering in open systems, offering a practical pathway toward robust steering-based quantum technologies.

In recent years, the quantum nature of gravity has attracted significant attention as one of the most important problems in modern physics. Here, we analyze the mechanism of gravitationally-induced entanglement from the perspective of quantum resource theory. Building on the framework of Bose et al. [Phys. Rev. Lett. 119, 240401 (2017)], we show that the gravitational interaction acts as a unitary channel, redistributing quantum resources between two spatially superposed masses. Specifically, we demonstrate that the resulting bipartite entanglement originates from the coherent conversion of local quantum coherence – initially present in each subsystem – into shared non-local correlations. We derive exact, analytical complementarity relations quantifying this conversion, link the decay of local coherence directly to the growth of entanglement, and support these findings with numerical simulations. Our results clarify the underlying mechanism and establish gravity as a coherence-to-entanglement conversion channel, offering a refined interpretive basis for forthcoming experimental tests. Crucially, we show that initial coherence is a necessary condition for entanglement generation and that its degree bounds the maximum achievable entanglement, with maximal entanglement requiring initial maximal coherence.

This paper presents a quantum generalization of the multinomial distribution for the transition probabilities of $m$ identical photons in a $k$-port linear optical interferometer: two multinomial coefficients (one for the input configuration, one for the output) times the squared modulus of a coherent sum over routing matrices, weighted by the multivariate hypergeometric distribution; no Hilbert space formalism is needed to state or evaluate it. The classical multinomial is recovered when all photons enter through a single port, the coherent sum degenerating to a single term with no interference; the quantum family is not a generalization in the Askey sense but a parallel family that departs from classical statistics through the coherence of the amplitude summation. The $r$-th factorial moment carries a squared multinomial coefficient in place of the classical single one, the extra factor arising from the two copies of the amplitude expansion whose indices the Fock state forces to agree; for the beam splitter, the third cumulant is invariant under bosonic interference and the quantum departure first appears in the fourth cumulant as negative excess kurtosis; for multiport interferometers, however, three-body interference breaks this invariance and the departure enters already at the third cumulant. Cross-mode covariances involve the phases of the scattering matrix through coherence terms that strengthen output anti-correlations beyond the classical value; together with the squared-coefficient signature in the single-mode moments, these provide low-order statistical witnesses for boson sampling verification without requiring the full permanent computation.

Adiabatic chiral state conversion (CSC) is one of the many counterintuitive effects associated with non-Hermitian physics. In quantum systems, numerous works have demonstrated this phenomenon under both non-Hermitian Hamiltonian and Lindblad evolution. However, despite considerable progress, the physical mechanism behind it has been a subject of debate. In this work, we present a unified framework that explains CSC in any non-Hermitian system, encompassing non-Hermitian Hamiltonian, Lindblad, and hybrid settings. Our framework relies on perturbative, non-adiabatic corrections to adiabatic evolution and consistently predicts CSC with only the lowest-order corrections. We demonstrate its efficacy with models of single and coupled dissipative qubits, obtaining analytical solutions for the conversion fidelity. Our analysis further reveals the role of non-perturbative dynamics, which can be present even in apparently slow trajectories. We show that this property can be utilised to considerably enhance state conversion. Finally, we demonstrate that CSC can be observed in a model without the presence of exceptional points.

Equational reasoning is central to quantum circuit optimisation and verification: one replaces subcircuits by provably equivalent ones using a fixed set of rewrite rules viewed as equations. A finite rule set is most informative when it separates the genuine algebra of a circuit fragment from the structural treatment of wires. This paper gives six near-Clifford fragments a common PROP treatment, where wire permutations are structural: qubit Clifford, real Clifford, Clifford+T (up to two qubits), Clifford+CS (up to three qubits), CNOT-dihedral, and qutrit Clifford. Starting from prior completeness theorems, we transfer completeness into this setting and remove redundant non-structural rules, then check minimality by separating interpretations tailored to individual axioms; the resulting presentations are minimal in all arities for qubit Clifford, real Clifford, and CNOT-dihedral, minimal in bounded ranges for the remaining fragments, and comparable by one transfer-and-separation pattern.

High-dimensional quantum computation needs a native circuit-level equational theory for qudits. We give the first finite schematic equational theory that is sound and complete for exact unitary qudit circuits in every finite dimension at least two. Circuits are built from local gates, sequential and parallel composition, and value-controls; equality is derivable exactly when the standard unitary denotations agree. For each dimension, a finite list of local bounded-arity axiom schemata presents the theory, and the diagrammatic shapes do not depend on d. Primitive value-control makes control on a chosen basis value part of the language, so local rules generate the internal algebra of controlled operations within the circuit PROP. This gives a finite, dimension-uniform basis for exact equational reasoning about qudit circuits.

We investigate the structure of $k$-positivity and Schmidt numbers for classes of linear maps and bipartite quantum states exhibiting symplectic group symmetries. Specifically, we consider (1) linear maps on $M_d(\mathbb{C})$ which are covariant under conjugation by unitary symplectic matrices $S$, and (2) $d\otimes d$ bipartite states which are invariant under $S\otimes S$ or $S\otimes \overline{S}$ actions, each parametrized by two real variables. We provide a complete characterization of all $k$-positivity and decomposability conditions for these maps and explicitly compute the Schmidt numbers for the corresponding bipartite states. In particular, our analysis yields a broad class of PPT states with Schmidt number $d/2$ and the first explicit constructions of (optimal) $k$-positive indecomposable linear maps for arbitrary $k=1,\ldots, d/2-1$, achieving the best-known bounds. Overall, our results offer a natural and analytically tractable framework in which both strong forms of positive indecomposability and high degrees of PPT entanglement can be studied systematically. We present two further applications of symplectic group symmetries. First, we show that the PPT-squared conjecture holds within the class of PPT linear maps that are either symplectic-covariant or conjugate-symplectic-covariant. Second, we resolve a conjecture of Pal and Vertesi concerning the optimal lower bound of the Sindici-Piani semidefinite program for PPT entanglement.

To build large-scale quantum computers while minimizing resource requirements, one may want to use high-rate quantum error-correcting codes that can efficiently encode information. However, realizing an addressable gate$\unicode{x2014}$a logical gate on a subset of logical qubits within a high-rate code$\unicode{x2014}$in a fault-tolerant manner can be challenging and may require ancilla qubits. Transversal and fold-transversal gates could provide a means to fault-tolerantly implement logical gates using a constant-depth circuit without ancilla qubits, but available gates of these types could be limited depending on the code and might not be addressable. In this work, we study a family of $[\![n=2^m,k={m \choose m/2}\approx n/\sqrt{\pi \log_2(n)/2},d=2^{m/2}=\sqrt{n}]\!]$ self-dual quantum Reed$\unicode{x2013}$Muller codes, where $m$ is a positive even number. For any code in this family, we construct a generating set of the full logical Clifford group comprising only transversal and fold-transversal gates, thus enabling the implementation of any addressable Clifford gate. To our knowledge, this is the first known construction of the full logical Clifford group using only transversal and fold-transversal gates without requiring ancilla qubits for a family of codes in which $k$ grows near-linearly in $n$.

We critically discuss the apparent lack of logical rigor pervading the debate on quantum nonlocality. Strong convictions often prevail over rational assessment, leading to the acceptance of loose ideas that become entrenched dogmas. The lack of sound rationales and adherence to the rules of logical inference lead to widely adopted antinomies that receive little conceptual scrutiny.

While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad class of structured dense matrices arise in potential theory, covariance modeling, and computational physics, namely, hierarchically block separable (HBS) matrices. We develop two distinct methods to make these systems amenable to quantum solvers. The first is a pre-processing approach that transforms the dense matrix into a larger but sparse format. The second is a direct block encoding scheme that recursively constructs the necessary oracles from the HBS structure. We provide a detailed complexity analysis and rigorous error bounds for both methods. Numerical experiments are presented to validate the effectiveness of our approaches.

The reliable characterization of quantum states is a fundamental task in quantum information science. For this purpose, quantum state tomography provides a standard framework for reconstructing quantum states from measurement data, yet it is often degraded by experimental noise. Mitigating such noise is therefore essential for the accurate estimation of the states in realistic settings. In this work, we propose a scalable tomography method based on multilayer perceptron networks that mitigate unknown noise through supervised learning. This approach is data-driven and thus does not rely on explicit assumptions about the noise model or measurement, making it readily extendable to general quantum systems. Numerical simulations, ranging from special pure states to random mixed states, demonstrate that the proposed method effectively mitigates noise across a broad range of scenarios, compared with the case without mitigation.

Quantum machine learning (QML), as an interdisciplinary field bridging quantum computing and machine learning, has garnered significant attention in recent years. Currently, the field as a whole faces challenges due to incomplete theoretical foundations for the expressivity of quantum neural networks (QNNs). In this paper we propose a constructive QNN model and demonstrate that it possesses the universal approximation property (UAP), which means it can approximate any square-integrable function up to arbitrary accuracy. Furthermore, it supports switching function bases, thus adaptable to various scenarios in numerical approximation and machine learning. Our model has asymptotic advantages over the best classical feed-forward neural networks in terms of circuit size and achieves optimal parameter complexity when approximating Sobolev functions under $L_2$ norm.

Direct fidelity estimation (DFE) is a famous tool for estimating the fidelity with a target pure state. However, such a method generally requires exponentially many sampling copies due to the large magic of the target state. This work proposes a sample- and gate-efficient fidelity estimation algorithm that is affordable within feasible quantum devices. We show that the fidelity estimation with pure states close to the structure of phase states, for which sample-efficient DFE is limited by their strong entanglement and magic, can be done by using $\mathcal{O}({\rm poly}(n))$ sampling copies, with a single $n$-qubit fan-out gate. As the target state becomes a phase state, the sampling complexity reaches $\mathcal{O}(1)$. Such a drastic improvement stems from a crucial step in our scheme, the so-called phase stripping, which can significantly reduce the target-state magic. Furthermore, we convert a complex diagonal gate resource, which is needed to design a phase-stripping-adapted algorithm, into nonlinear classical post-processing of Pauli measurements so that we only require a single fan-out gate. Additionally, as another variant using the nonlinear post-processing, we propose a nonlinear extension of the conventional DFE scheme. Here, the sampling reduction compared to DFE is also guaranteed, while preserving the Pauli measurement as the only circuit resource. We expect our work to contribute to establishing noise-resilient quantum algorithms by enabling a significant reduction in sampling overhead for fidelity estimation under the restricted gate resources, and ultimately to clarifying a fundamental gap between the resource overhead required to understand complex physical properties and that required to generate them.

Solving large-scale linear systems problems is a cornerstone in scientific and industrial computing. Classical iterative solvers face increasing difficulty as the number of unknowns becomes large, while fully quantum linear solvers require fault-tolerant resources that remain far beyond near-term feasibility. Here we propose a quantum-accelerated conjugate gradient (QACG) method in which a fault-tolerant quantum algorithm is used exclusively to construct a spectrally informed initial guess for a classical conjugate gradient (CG) solver. We estimate the total runtime and resource requirements of an integrated quantum-HPC platform for the 3D Poisson equation. A central feature of QACG is the controllable decomposition of the condition number between the quantum and the classical solver, enabling flexible allocation of computational effort. Under explicit architectural assumptions, we identify regimes in which QACG yields a runtime advantage over purely classical approaches while requiring substantially fewer quantum resources than end-to-end quantum linear solvers. These results illustrate a concrete pathway toward the scientific and industrial use of early-stage fault-tolerant quantum computing and point to a integrated paradigm in which quantum devices act as accelerators within high-performance computing workflows.

Thermalization in isolated quantum many-body systems can be nonmonotonic, with its process dependent on an initial state. We propose a numerical method to construct a low-entangled initial state that creates a "burst" – a transient deviation of an observable from its thermal equilibrium value – at a designated time. We apply this method to demonstrate that a burst of magnetization can be realized for a nonintegrable mixed-field Ising chain on a timescale comparable to the onset of quantum scrambling. Contrary to the typical spreading of information in this regime, the created burst is accompanied by a slow or even negative entanglement growth. Analytically, we show that a burst becomes probabilistically rare after a long time. Our results suggest that a nonequilibrium state is maintained for an appropriately chosen initial state until scrambling becomes dominant. These predictions can be tested with programmable quantum simulators.

In this work, we study Bayesian quantum parameter estimation given a finite number of uses of the process encoding one or more unknown physical quantities. We analyze the performance of different kinds of quantum metrological protocols, including the conventional parallel, sequential, or general, which may involve an indefinite causal order. We also analyze a class of hybrid adaptive greedy strategies, which are based on classical feedforward between quantum protocols to optimize the next round. Within each class, the central question is to determine the optimal strategy – namely, the choice of optimal input state, control operations, measurement, and estimators. Using the formalism of higher-order operations, we develop an algorithm that searches for the optimal solution, and we provide a numerical implementation based on semidefinite programming. Our benchmark cases, specifically those against existing analytical solutions, demonstrate how powerful and precise our method is. We further demonstrate the strength of our algorithm in several examples, from single to multiparameter estimation, and with various prior distributions. Particularly, we find examples where the adaptive greedy strategy matches the performance of general strategies with indefinite causal order, and at the same time examples that showcase a strict hierarchy between all different classes.

We study entanglement suppression in $s$-wave $\Omega\Omega$ scattering, where each baryon has spin $3/2$. By treating the $S$-matrix as a quantum operator acting on the spin states, we quantify its ability to generate entanglement and identify the conditions on the phase shifts of the spin channels that minimize entanglement generation in the system. In $\Omega\Omega$ scattering, only antisymmetric spin channels are allowed due to Fermi-Dirac statistics. Applying the entanglement-suppression framework to $\Omega\Omega$ scattering, we find two solutions for the phase shifts: one leading to a spin SU(4) symmetry and the other to a nonrelativistic conformal symmetry. We show that the solution associated with the nonrelativistic conformal symmetry originates from the specific structure of the Clebsch-Gordan coefficients in the $3/2 \otimes 3/2$ system.