Papers

Qubit reuse offers a promising way to reduce the hardware demands of quantum circuits, but current approaches are largely restricted to reordering measurements and applying qubit resets. In this work, we present an approach to further optimize quantum circuits by fully utilizing the potential of dynamic quantum circuits-more precisely by moving measurements and introducing dynamic circuit primitives such as classically controlled gates in a way that forges entirely new pathways for qubit reuse. This significantly reduces the number of required qubits for a variety of circuits, creating new opportunities for running complex circuits on near-term devices with limited qubit counts. We show that the proposed approach drastically outperforms existing methods, reducing qubit requirements where previous approaches are unable to do so for popular quantum circuits such as Quantum Phase Estimation (QPE), Quantum Fourier Transform~(QFT), and Variational Quantum Eigensolver (VQE) ansätze, as well as leading to improvements of up to 95% for sparse random circuits.

Quantum architecture search (QAS) automates the design of parameterized quantum circuits for variational quantum algorithms. The framework finds a well-suited problem-specific structure of a variational ansatz. Among possible implementations of QAS the reinforcement learning (RL) stands out as one of the most promising. Current RL approaches are single-agent-based and show poor scalability with a number of qubits due to the increase of the action space dimension and the computational cost. We propose a novel multi-agent RL algorithm for QAS with each agent acting separately on its own block of a quantum circuit. This procedure allows to significantly accelerate the convergence of the RL-based QAS and reduce its computational cost. We benchmark the proposed algorithm on MaxCut problem on 3-regular graphs and on ground energy estimation for the Schwinger Hamiltonian. In addition, the proposed multi-agent approach naturally fits into the set-up of distributed quantum computing, favoring its implementation on modern intermediate scale quantum devices.

We uncover a class of nonlinear odd viscoelastic effects in three spatial dimensions. We show that these dissipationless effects arise upon combining geometric distortions in two orthogonal directions, yielding momentum flow in the third direction. We demonstrate that the effect arises from nontrivial geometric tensors in quantum states, and can be scaled up with integer topological invariants. We further show that the effect fingerprints the multiband Hilbert-space geometry of the underlying quantum states, as encoded in the nonmetricity and three-state quantum geometric tensors. Our findings unravel the role of multistate geometry in viscoelastic phenomena, paving a path for experimental observation of uncharted nonlinear odd viscoelastic responses in quantum systems.

In recent years, a particularly interesting line of research has focused on designing quantum algorithms for code and lattice problems inspired by Regev's reduction. The core idea is to use a decoder for a given code to find short codewords in its dual. For example, Jordan et al. demonstrated how structured codes can be used in this framework to exhibit some quantum advantage. In particular, they showed how the classical decodability of Reed-Solomon codes can be leveraged to solve the Optimal Polynomial Intersection (OPI) problem quantumly. This approach was further improved by Chailloux and Tillich using stronger soft decoders, though their analysis was restricted to a specific setting of OPI. In this work, we reconcile these two approaches. We build on a recent formulation of the reduction by Chailloux and Hermouet in the lattice-based setting, which we rewrite in the language of codes. With this reduction, we show that the results of Jordan et al. can be recovered under Bernoulli noise models, simplifying the analysis. This characterization then allows us to integrate the stronger soft decoders of Chailloux and Tillich into the OPI framework, yielding improved algorithms.

Entangled photons are fundamental resources for quantum communication, computing, and networking. Among them, polarization-entangled photon pairs play an important role due to their straightforward state manipulation and direct use in quantum key distribution, teleportation, and network protocols. However, realizing compact, efficient, and scalable polarization-entangled sources that meet the requirements of practical deployment remains a major challenge. Here, we present a simple yet high-performance on-chip polarization-entangled photon-pair source on thin-film lithium niobate (TFLN). Our device employs dual quasi-phase matching (D-QPM) that sequentially supports type-0 and type-I spontaneous parametric down-conversion in a single nanophotonic waveguide, eliminating the need for interferometers, polarization rotators, or other complex circuits. The source directly produces high-fidelity Bell states with broad bandwidth, high brightness, and low noise. Using this integrated platform, we realize wavelength-multiplexed entanglement distribution in a four-user quantum network deployed over metropolitan fiber links up to 50 km. These results establish a robust and scalable pathway toward practical quantum communication systems and multi-user quantum mesh networks based on integrated photonics.

This paper develops the foundations of Quantum Granular Computing (QGC), extending classical granular computing including fuzzy, rough, and shadowed granules to the quantum regime. Quantum granules are modeled as effects on a finite dimensional Hilbert space, so granular memberships are given by Born probabilities. This operator theoretic viewpoint provides a common language for sharp (projective) and soft (nonprojective) granules and embeds granulation directly into the standard formalism of quantum information theory. We establish foundational results for effect based quantum granules, including normalization and monotonicity properties, the emergence of Boolean islands from commuting families, granular refinement under Luders updates, and the evolution of granules under quantum channels via the adjoint channel in the Heisenberg picture. We connect QGC with quantum detection and estimation theory by interpreting the effect operators realizing Helstrom minimum error measurement for binary state discrimination as Helstrom type decision granules, i.e., soft quantum counterparts of Bayes optimal decision regions. Building on these results, we introduce Quantum Granular Decision Systems (QGDS) with three reference architectures that specify how quantum granules can be defined, learned, and integrated with classical components while remaining compatible with near term quantum hardware. Case studies on qubit granulation, two qubit parity effects, and Helstrom style soft decisions illustrate how QGC reproduces fuzzy like graded memberships and smooth decision boundaries while exploiting noncommutativity, contextuality, and entanglement. The framework thus provides a unified and mathematically grounded basis for operator valued granules in quantum information processing, granular reasoning, and intelligent systems.

Infinite projected entangled-pair states (iPEPS) provide a powerful tensor network ansatz for two-dimensional quantum many-body systems in the thermodynamic limit. In this paper we introduce an approach to accurately compute the energy variance of an iPEPS, enabling systematic extrapolations of the ground-state energy to the exact zero-variance limit. It is based on the contraction of a large cell of tensors using the corner transfer matrix renormalization group (CTRMG) method, to evaluate the correlator between pairs of local Hamiltonian terms. We show that the accuracy of this approach is substantially higher than that of previous methods, and we demonstrate the usefulness of variance extrapolation for the Heisenberg model, for a free fermionic model, and for the Shastry-Sutherland model. Finally, we apply the approach to compute $\langle \langle \mathcal{L}^\dagger \mathcal{L} \rangle \rangle$ for an open quantum system described by the Liouvillian $\mathcal{L}$, in order to assess the quality of the steady-state solution and to locate first-order phase transitions, using the dissipative quantum Ising model as an example.

Out-of-time-order correlators (OTOCs) are central probes of quantum scrambling, and their generalizations have recently become key primitives for both benchmarking quantum advantage and learning the structure of Hamiltonians. Yet their behavior has lacked a unified algorithmic interpretation. We show that higher-order OTOCs naturally fit within the framework of quantum signal processing (QSP): each $\mathrm{OTOC}^{(k)}$ measures the $2k$-th Fourier component of the phase distribution associated with the singular values of a spatially resolved truncated propagator. This explains the contrasting sensitivities of time-ordered correlators (TOCs) and higher-order OTOCs to causal-cone structure and to chaotic, integrable, or localized dynamics. Based on this understanding, we further generalize higher-order OTOCs by polynomial transformation of the singular values of the spatially resolved truncated propagator. The resultant signal allows us to construct frequency-selective filters, which we call OTOC spectroscopy. This extends conventional OTOCs into a mode-resolved tool for probing scrambling and spectral structure of quantum many-body dynamics.

Two photons from the ground state para-positronium annihilation are emitted in a maximally entangled singlet state of orthogonal polarizations. In case of the Compton scattering of both photons the phenomenon of quantum entanglement leads to a measurable increase in the azimuthal correlations of scattered photons, as opposed to a classical description treating the two scattering events as independent. The probability of the scattering of the system of the entangled photons is described by the Pryce-Ward cross section dependent on a difference of the azimuthal scattering angles in the fixed coordinate frame, while the independent scattering of single photons is described by the Klein-Nishina cross section dependent on the azimuthal angle relative to each photon's initial polarization. Since the singlet state of orthogonal polarizations is rotationally invariant, it does not carry any physical information on the initial polarizations of the single annihilation photons. In such bipartite state the angular origin for the Klein-Nishina cross section is undefined, making the Pryce-Ward and Klein-Nishina descriptions mutually exclusive. However, semi-classical simulations of the joint Compton scattering of entangled photons - implementing the Pryce-Ward cross section, but still treating the two photons as separate entities - can reconcile the Pryce-Ward correlations with the Klein-Nishina statistics for single photons by implementing a modified version of a scattering cross section presented in this work.

Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The CliNR implementation of an $n$-qubit Clifford circuit of size $s$ achieves a vanishing logical error rate if $snp^2\rightarrow 0$ where $p$ is the physical error rate. Here, we propose a recursive version of CliNR that can reduce errors on larger circuits with a relatively small gate overhead. When $np \rightarrow 0$, the logical error rate can be vanishingly small. This implementation requires $\left(2\left\lceil \log(sp)\right\rceil+3\right)n+1$ qubits and at most $24 s \left\lceil(sp)^4\right\rceil $ gates. Using numerical simulations, we show that the recursive method can offer an advantage in a realistic near-term parameter regime. When circuit sizes are large enough, recursive CliNR can reach a lower logical error rate than the original CliNR with the same gate overhead. The results offer promise for reducing logical errors in large Clifford circuits with relatively small overheads.

Modified divacancies in the 4H polytype of silicon carbide (SiC) exhibit enhanced charge stability and spin addressability at room temperature, making them attractive for quantum applications. However, their low formation yield and lack of direct structural identification have hindered progress. Here, we demonstrate a controllable method for high-yield engineering and identification of oxygen-related modified divacancy color centers in 4H-SiC via oxygen-ion implantation. Based on their distinct optical and spin-resonance characteristics, we experimentally resolve four types of modified divacancies. Furthermore, by measuring isotope-resolved 17O hyperfine interactions, we identify them as the four crystallographic configurations of oxygen-vacancy (OV) complexes. Remarkably, single OV centers account for over 90% of the total defect population and exhibit superior optical properties and spin coherence compared with defects created by conventional carbon or nitrogen implantation. We characterize the zero-phonon lines of these OV centers and reveal distinct temperature-dependent behavior in spin-readout contrast. By optimizing implantation dose and annealing temperature, we achieve high-density ensembles and observe Rabi-oscillation beating patterns associated with different orientations of basal-type defects. These results establish a high-yield route for scalable engineering of these four oxygen-related modified divacancies in 4H-SiC and clarify their atomic structure, opening new opportunities for solid-state quantum technologies.

Lie algebras are essential mathematical structures used in physics to describe sets of quantum operators. Identifying a minimal set of generators to construct these algebras is a central challenge. The traditional search for such generators relies on greedy construction steps applied to an exponentially growing number of candidate operators, making it computationally intractable. Here we show a general, polynomial-scaling strategy, based on fundamental Lie-algebraic properties, to overcome this bottleneck. We apply this framework to quantum chemistry, specifically to adaptive variational algorithms that simulate molecular ground states. By integrating our mathematically verified generator pools into a batched algorithmic framework, we reduce the required quantum resources and improve convergence for strongly correlated systems. Furthermore, this approach eliminates computational bottlenecks that previously restricted fixed-ansatz non-iterative coupled-cluster methods to small molecules, enabling simulations of complex systems well beyond previous limits. This foundational framework also presents broad applications across quantum computing, including quantum error correction, machine learning, and hardware control.

The Kibble-Zurek mechanism (KZM) successfully predicts the density of topological defects deposited by the phase transitions, but it is not clear why. Its key conjecture is that, near the critical point of the second-order phase transition, critical slowing down will result in a period when the system is too sluggish to follow the potential that is changing faster than its reaction time. The correlation length at the freeze-out instant $\hat t$ when the order parameter catches up with the post-transition broken symmetry configuration is then decisive, determining when the mosaic of broken symmetry domains locks in topological defects. To understand why the KZM works so well we analyze Landau-Ginzburg model and show why temporal evolution of the order parameter plays such a key role. The analytical solutions we obtain suggest novel, hitherto unexplored, experimentally accessible observables that can shed light on symmetry breaking dynamics while testing the conjecture on which the KZM is based.

State-of-the-art single-qubit gates on superconducting transmon qubits can achieve the fidelities required for error-corrected computations. However, parameter fluctuations due to qubit instabilities, environmental changes, and control inaccuracies make it difficult to maintain this performance. To mitigate the effects of these parameter variations, we numerically derive gates robust to amplitude and frequency errors using gradient ascent pulse engineering (GRAPE). We analyze how fluctuations in qubit frequency, drive amplitude, and coherence affect gate performance over time. The robust pulses suppress coherent errors from drive amplitude drifts over 15 times more than a Gaussian pulse with derivative removal by adiabatic gate (DRAG) corrections. Furthermore, the robust gates, originally designed to compensate for quasi-static errors, also demonstrate resilience to stochastic, time-dependent noise, which is reflected in the dephasing time. They suppress added errors during increases in dephasing by up to 1.7 times more than DRAG.

Photon-pressure circuits are the circuit implementation of the cavity optomechanical Hamiltonian and discussed for qubit readout, low-frequency quantum photonics and dark matter axion detection. Due to the enormous design flexibility of superconducting circuits, photon-pressure systems provide fascinating possibilities to explore unusual parameter regimes of the optomechanical Hamiltonian. Here, we report the realization of a photon-pressure platform, in which a GHz circuit interacts with a MHz circuit via a magnetic-flux-tunable combination of dispersive and dissipative photon-pressure. In addition, both coupling rates are considerably enhanced by nonlinearities of the GHz-mode, which leads to the multi-photon coupling rates scaling stronger with the pump photon number $n_\mathrm{c}$ than the usual $\sqrt{n_\mathrm{c}}$ dependence. We demonstrate that interference of the two interaction paths leads to a Fano-like response in photon-pressure induced transparency, and that the dynamical backaction is considerably modified compared to the dispersive case, including a parametric instability caused by a red-detuned pump tone.

Bell inequalities limit the possible observations of non-communicating parties. Here, we present analogous inequalities for any number of communicating parties under the causal constraints of static causal order, definite causal order, and bi-causal order. All derived inequalities are remarkably simple. They correspond to upper bounds on the winning chance in graphical games: Given a specific directed graph over the parties, the parties are challenged to communicate along a randomly chosen arc. In the case of definite causal order, every game that we find is specified by a kefalopoda digraph. Based on this we define weakly causal correlations as those that satisfy all kefalopoda inequalities. We show that the problem of deciding whether some correlations are weakly causal is solvable in polynomial time in the number of parties.

The two main notions of control in quantum programming languages are often referred to as "quantum control" and "classical control". With the latter, the control flow is based on classical information, potentially resulting from a quantum measurement, and this paradigm is well-suited to mixed state quantum computation. Whereas with quantum control, we are primarily focused on pure quantum computation and there the "control" is based on superposition. The two paradigms have not mixed well traditionally and they are almost always treated separately. In this work, we show that the paradigms may be combined within the same system. The key ingredients for achieving this are: (1) syntactically: a modality for incorporating pure quantum types into a mixed state quantum type system; (2) operationally: an adaptation of the notion of "quantum configuration" from quantum lambda-calculi, where the quantum data is replaced with pure quantum primitives; (3) denotationally: suitable (sub)categories of Hilbert spaces, for pure computation and von Neumann algebras, for mixed state computation in the Heisenberg picture of quantum mechanics.

Equivalence checking of hybrid quantum circuits is of primary importance, given that quantum circuit transformations are omnipresent along the quantum compiler chain. While some approaches exist for automating this task, most focus on the simple case of unitary circuits. At the same time, real quantum computing requires hybrid circuits equipped with measurement operators. Moreover, the few approaches targeting the hybrid case are limited to a restricted class of problems. We propose tackling the Quantum Hybrid Circuit Equivalence Checking problem through lifting unitary circuit verification using a transformation known as deferred measurement. We show that this approach alone significantly outperforms prior work, and that, with the addition of specific unitary-level techniques we call separation and projection, it can handle much larger classes of hybrid circuit equivalence problems. We have implemented and evaluated our method over standard circuit transformations such as teleportation, one-way measurement, or the IBM Qiskit compiler, demonstrating its promises. As a side finding, we have identified and reported several unexpected behaviours with the Qiskit compiler.

Pure states are usually used to observe quantum phenomena. In this study, we show that a quantum superposition of spatially displaced mixed cat states can be generated within an optical waveguide via nonparaxial unitary evolution of the initial low coherence (low purity) light beam. It is shown that highly mixed Schrodinger cat states can be observed at a well-defined propagation distance. The importance of the long-term decoherence and recoherence of the original wave packet in observing the mixed cat states is demonstrated. The Heisenberg and Schrodinger-Robertson uncertainty relations for mixed cat states are evaluated. We have demonstrated the feasibility of our method using accurate numerical simulations for the parameters of the source and optical waveguide available in practice.

Efficient fidelity estimation of multiqubit quantum states is crucial to many applications in quantum information processing. However, to estimate the infidelity $\epsilon$ with multiplicative precision, conventional estimation protocols require (order) $1/\epsilon^2$ different circuits in addition to $1/\epsilon^2$ samples, which is quite resource-intensive for high-precision fidelity estimation. Here we introduce an efficient estimation protocol by virtue of common randomized measurements (CRM) integrated with shadow estimation based on the Clifford group, which only requires $1/\epsilon $ circuits. Moreover, in many scenarios of practical interest, in the presence of depolarizing or Pauli noise for example, our protocol only requires a constant number of circuits, irrespective of the infidelity $\epsilon$ and the qubit number. For large and intermediate quantum systems, quite often one circuit is already sufficient. In the course of study, we clarify the performance of CRM shadow estimation based on the Clifford group and 4-designs and highlight its advantages over standard and thrifty shadow estimation.

In this work we derive the replica field theory for monitored quantum many-body systems evolving under the quantum jumps protocol, corresponding to a non-Hermitian evolution interspersed with random quantum jumps whose distribution is state-dependent. We show that the density matrix of $R$ replicas evolves according to a master equation where the non-Hermitian term is replica-diagonal while coupling among replicas are due to quantum jumps. We write down the associated Keldysh action and study its behavior for the specific case of the Ising Chain with monitoring of particle density and tunable anisotropy, interpolating between free fermions with strong U(1) symmetry and the Ising chain with Z$_2$ symmetry. We derive the effective field theory in terms of slowly varying fields and obtain the replica-diagonal saddle point, which we show to describe the average state. We then go beyond saddle point and derive the effective field theory describing the replica off-diagonal sector, which takes the form of a Non-Linear Sigma Model. The symmetry class is either DIII or D, depending on the parameters of the Ising chain, except at a special symmetric point, where we recover the results for free fermions. We discuss the implications of these findings for the entangling phase observed numerically for the monitored Ising chain.

Fidelity is the standard measure for quantifying the similarity between two quantum states. It is equal to the square of the minimum Bhattacharyya coefficient between the probability distributions induced by quantum measurements on the two states. Though established for over thirty years, the structure of fidelity-optimal quantum measurements remains unclear when the two density operators are singular (not invertible). Here we address this gap, with a focus on minimal optimal measurements, which admit no nontrivial coarse graining that is still optimal. We show that there exists either a unique minimal optimal measurement or infinitely many inequivalent choices. Moreover, the first case holds if and only if the two density operators satisfy a weak commutativity condition. In addition, we provide a complete characterization of all minimal optimal measurements when one state is pure, leveraging geometric insights from the Bloch-sphere representation. The connections with quantum incompatibility, operator pencils, and geometric means are highlighted.

We report electrical spin state readout and coherent control of an ensemble ($\sim$540) of silicon vacancies ($\mathrm{V}_{\mathrm{Si}}^{-}$) in a silicon carbide-on-insulator (SiCOI) platform, with excitation wavelengths from 780 to 990 nm, demonstrating for the first time spin state readout well beyond the zero phonon line of the V2 $\mathrm{V}_{\mathrm{Si}}^{-}$. By implementing photoelectrical detection of magnetic resonance in thin-film SiCOI, we merge a scalable spin readout technique requiring no collection optics, together with a promising platform for future scalable and CMOS-compatible integrated photonics. Furthermore, we provide a comparison of optical and electrical readout between bulk silicon carbide (SiC) and thin-film SiCOI, revealing that our thin-film processing has a measured $T_2$ coherence time of $\approx 7 \mu$s , similar to that in the bulk SiC. These results extend the capabilities of SiCOI toward electronic and spin-based devices for scalable quantum technologies over a wide range of excitation wavelengths.

We report an experimental demonstration of room-temperature Hong-Ou-Mandel (HOM) interference at a radio-wave frequency of 120 MHz using conditional build-up of quantum states from classical phase-averaged coherent states. This approach enables observation of quantum effects in spectral regimes where conventional single-photon sources and detectors are unavailable or require cryogenic conditions. By constructing a high-fidelity approximation of a single-photon state with phase-averaged coherent states, we observe the normalized second-order intensity correlation dips significantly below the classical limit of 0.5. The method allows for tunable noise suppression via optimization of the state representation. Our results establish the feasibility of using conditionally prepared classical states to simulate quantum interference phenomena in the radio-frequency domain. This technique opens the door to realizing other quantum protocols, such as Bell inequality tests, in frequency ranges where standard quantum technologies are currently infeasible.

The unitary cluster Jastrow (UCJ) ansatz and its variant known as local UCJ (LUCJ) are promising choices for variational quantum algorithms for chemistry due to their combination of physical motivation and hardware efficiency. The parameters of these ansatzes can be initialized from the output of a coupled cluster, singles and doubles (CCSD) calculation performed on a classical computer. However, truncating the number of repetitions of the ansatz, as well as discarding interactions to accommodate the connectivity constraints of near-term quantum processors, degrade the approximation to CCSD and the resulting energy accuracy. In this work, we propose two methods to improve the parameter initialization. The first method, which is applicable to both expectation value- and sample-based algorithms, uses compressed double factorization of the CCSD amplitudes to improve or recover the CCSD approximation. The second method, which is applicable to sample-based algorithms, uses approximate tensor network simulation to improve the quality of samples produced by the ansatz circuit. We validate our methods using exact state vector simulation on systems of up to 52 qubits, as well as experiments on superconducting quantum processors using up to 65 qubits. Our results indicate that our methods can significantly improve the output of both expectation value- and sample-based quantum algorithms.

We establish a connection between quantum mechanics and computation, revealing fundamental limitations for algorithms computing spectra, especially in non-Hermitian settings. Introducing the concept of locally trivial pseudospectra (LTP), we show such assumptions are necessary for spectral computation. LTP adapts dynamically to system energies, enabling spectral analysis across a broad class of challenging non-Hermitian problems. Exploiting this framework, we overcome a longstanding obstacle by computing the eigenvalues and eigenfunctions of the imaginary cubic oscillator $H_{\mathrm{B}} = p^2 + i x^3$ with error bounds and no spurious modes – yielding, to our knowledge, the first such error-controlled result. We confirm, for instance, the 100th eigenvalue as $627.6947122484365113526737029011536\ldots$. Here, truncation-induced $\mathcal{PT}$-symmetry breaking causes spurious eigenvalues – a pitfall our method avoids, highlighting the link between truncation and physics. Finally, we illustrate the approach's generality via spectral computations for a range of physically relevant operators. This letter provides a rigorous framework linking computational theory to quantum mechanics and offers a precise tool for spectral calculations with error bounds.

In a recent work [B. J. P. Jones and J. A. Formaggio, Phys. Rev. Lett. 135, 111801 (2025)], the possibility of superradiant neutrino emission from atomic condensates has been theoretically proposed. Subsequent analysis by Y. K. Lu, H. Lin, and W. Ketterle [arXiv:2510.21705] questioned this scenario, emphasizing the limiting role of the fermionic nature of the decayed atoms. In this study, we revisit the problem and discuss under which conditions collective emission phenomena might still emerge in cold-atom systems.

Studying the performance of a quantum interferometer coupled to an external environment is a problem of conceptual and practical importance. If we consider a quantum interferometer featuring Heisenberg-limited sensitivity, then a typical result is that introducing coupling with the environment degrades the sensitivity to the shot-noise limit. Here we argue that this result crucially depends on whether the interferometer-environment coupling term is subject (or not) to the so-called Kac rescaling that restores extensivity, i.e., whether the coupling Hamiltonian is extensive or not. We present results of the Lindblad equation in the presence and absence of Kac rescaling of the coupling constant. Our results show that for a linear coupling and a harmonic model of the environment, often used in modeling of a quantum interferometer coupled with an environment, the Heisenberg-limited sensitivity may be restored after the Kac rescaling. This result points out the need and the importance to characterize the (model of the) environment of the interferometer at hand.

Berry monopoles always cancel when summing over a complete set of energy eigenstates. We demonstrate that analogous sum rules exist for geometric phases and their underlying 2-forms in non-adiabatic evolution. Our result has implications for qudit computation as it limits the types of gates that can be implemented by purely geometric means.

Catalysis refers to the possibility of performing an otherwise impossible local state transformation by sharing an additional state, i.e. a catalyst, which is returned at the end of the protocol. There is a stronger version, known as supercatalysis, in which the borrowed catalyst is returned in an enhanced form, i.e. more entangled. However, this phenomenon has remained little explored. In this work we introduce the supercatalytic entanglement gain as a figure of merit taking values in [0,1] that quantifies the performance of the protocol (with 0 corresponding to the standard case of catalysis and 1 representing the maximal possible gain) and we study in which cases it can be greater than zero and which strategies can maximize it. While it turns out that every catalytic transformation can be implemented in a supercatalytic fashion with entanglement gain equal to 1 if the state that is borrowed is chosen appropriately, other choices can make the gain strictly less than 1 and even 0. In fact, we prove that a large class of catalytic transformations are not fully supercatalyzable, i.e. there is at least one choice of catalyst for which the entanglement gain vanishes. On the other hand, the construction that shows that supercatalysis is always possible with maximal gain uses artificially highly entangled catalysts. For this reason, we also study minimal supercatalysis, where the entanglement content of the borrowed state is constrained in a precise and natural way. While we consider a scenario where we prove it is impossible to have entanglement gain equal to 1 in this case, we show that there exist minimal supercatalytic transformations with gain as close to 1 as desired. We also explore several examples and observe that, although choosing a catalyst with the least possible entanglement is often an optimal strategy for minimal supercatalysis, this is not necessarily always the case.