Papers

The natural gradient is central in neural quantum states optimizations but it is limited by the cost of computing and inverting the quantum geometric tensor, the quantum analogue of the Fisher information matrix. We introduce a block-diagonal quantum geometric tensor that partitions the metric by network layers, analogous to block-structured Fisher methods such as K-FAC. This layer-wise approximation preserves essential curvature while removing noisy cross-layer correlations, improving conditioning and scalability. Experiments on Heisenberg and frustrated $J_1$-$J_2$ models show faster convergence, lower energy, and improved stability.

We give a convergent hierarchy of SDP certificates for lower bounds on the spectral gap of a local qubit Hamiltonian $H$. Our approach is based on the NPA hierarchy applied to a polynomially-sized system of constraints defining the universal enveloping algebra of the Lie algebra $\mathfrak{su}(2^{n})$ along with additional constraints which force the representation to be $\wedge^{2}(\mathbb{C}^{2^{n}})$, one which the induced Hamiltonian has ground energy $\lambda_{0}(H) + \lambda_{1}(H)$. Combined with an upper bound on the ground state energy, which can be obtained either using a hierarchy introduced by Fawzi, Fawzi, and Scalet or a noncommutative analog developed by Klep, Magron, Massé, and Volčič of a hierarchy introduced by Lasserre, we obtain lower bounds on the spectral gap of $H$ without assuming frustration-freeness or geometric locality. We prove that the resulting certificates have polynomial size at fixed degree and converge at level $n$. As illustrations of the certificates which can be obtained, we show that for a commuting 1-local Hamiltonian the hierarchy certifies the optimal bound on its spectral gap and prove that similar hierarchies require degree growing with $n$ to certify the same bound. We then extend this to prove a lower bound on the spectral gap of the transverse-field $XY$ model, which is not frustration-free, on arbitrary regular graphs without any assumption of geometric locality.

We introduce a systematic approach for analyzing device-independent single-prover interactive protocols under computational assumptions. This is done by establishing an explicit correspondence with Bell inequalities and nonlocal games and constructing a computational space of correlations. We show how computational assumptions are converted to computational Bell inequalities, in their rigorous mathematical sense, a hyperplane that separates the sets of classical and quantum verifier-prover interactions. We reveal precisely how the nonsignaling assumption in standard device-independent setups interchanges with the computational challenge of learning a hidden input (that we define). We further utilize our fundamental results to study explicit protocols using the new perspective. We take advantage of modular tools for studying nonlocality, deriving tighter Tsirelson bounds for single-prover protocols and bounding the entropy generated in the interaction, improving on previous results. Our work thus establishes a modular approach to analyzing single-prover quantum certification protocols based on computational assumptions through the fundamental lens of Bell inequalities, removing many layers of technical overhead. The link that we draw between single-prover protocols and Bell inequalities goes far beyond the spread intuitive understanding or known results about "compiled nonlocal games"; Notably, it captures the exact way in which the correspondence between computational assumptions and locality should be understood also in protocols based on, e.g., trapdoor claw-free functions (in which there is no clear underlying nonlocal game).

Characterizing continuous-variable (CV) Hamiltonians can be formulated as Hamiltonian learning under quantum measurement constraints: finite operator coefficients are inferred from noisy measurement outcomes obtained by probing an infinite-dimensional system. Existing Heisenberg-limited CV protocols are often limited to low-order structures, vulnerable to noise, or unresolved for generic multi-mode settings. We introduce Displacement-Random Unitary Transformation (D-RUT), an active data acquisition protocol with pre-specified probes and number-preserving transformations that reduce finite-order bosonic Hamiltonian learning to polynomial recovery. We prove Heisenberg-limited total evolution time with robustness to state preparation and measurement (SPAM) errors, and develop hierarchical multi-mode coefficient recovery with better statistical efficiency than simultaneous estimation. We also extend D-RUT to first-quantized Hamiltonian coefficient learning, and numerical experiments on single- and multi-mode nonlinear systems validate the predicted Heisenberg scaling.

Betting games provide a natural setting to capture how information yields strategic advantage. The Kelly criterion for betting, long a cornerstone of portfolio theory and information theory, admits an interpretation in the limit of infinitely many repeated bets. We extend Kelly's seminal result into the single-shot and finite-betting regimes, recasting it as a resource theory of adversarial information. This allows one to quantify what it means for the gambler to have more information than the odds-maker. Given a target rate of return, after a finite number of bets, we compute the optimal strategy which maximises the probability of successfully reaching the target, revealing a risk-reward trade-off characterised by a hierarchy of Rényi divergences between the true distribution and the odds. The optimal strategies in the one-shot regime coincide with strategies maximizing expected utility, and minimising hypothesis testing errors, thereby bridging economic and information-theoretic viewpoints. We then generalize this framework to a distributed side-information game, in which multiple players observe correlated signals about an unknown state. Recasting gambling as an adversarial resource theory provides a unifying lens that connects economic and information-theoretic perspectives, and allows for generalisation to the quantum domain, where quantum side-information and entanglement play analogous roles.

Erasure qubits – qubits designed to have an error profile that is dominated by detectable leakage errors – are a promising way to cut down the resources needed for quantum error correction. There have been several recent experiments demonstrating erasure qubits in superconducting quantum processors, most notably the dual-rail qubit defined by the one-photon subspace of two coupled cavities. An outstanding challenge is that the ancillary transmons needed to facilitate erasure checks and two-qubit gates introduce a substantial amount of noise, limiting the benefits of working with erasure-biased qubits. Here, we show how to suppress the adverse effects of transmon-induced noise while performing erasure checks or two-qubit gates. We present control schemes for these operations that suppress erasure check errors by three orders of magnitude and reduce the logical two-qubit gate infidelities by up to three orders of magnitude.

Device-independent quantum key distribution (DIQKD) promises cryptographic security based solely on observed quantum correlations, yet its implementation over long distances remains limited. Routed Bell tests have recently re-emerged as a promising strategy to mitigate this limitation by enabling local self-testing of one party's device. However, extending this idea to self-testing both communicating parties has remained unclear. Here we develop a general $C^*$-algebraic for routed DIQKD with multiple switches and arbitrarily many local test parties, with a conservative, state-dependent definition of Eve. Within this framework, we design and analyse four-party routed protocols that locally self-test both Alice as well as Bob, and numerically bound key rates from the full observed statistics. In the parameter regimes considered, adding a fourth party strictly improves certified key rates and lowers the non-zero key threshold. Randomized key-basis switching further amplifies this advantage. Finally, we investigate a self-test-assisted E91-type protocol that continuously interpolates between the device-dependent Shor-Preskill rate and the device-independent rate derived by [Pironio et al., New J. Phys. 11, 045021 (2009)].

Directed $st$-connectivity (DSTCON) is the problem of deciding if there exists a directed path between a pair of distinguished vertices $s$ and $t$ in an input directed graph. This problem appears in many algorithmic applications, and is also a fundamental problem in complexity theory, due to its ${\sf NL}$-completeness. We show that for any $S\geq \log^2(n)$, there is a quantum algorithm for DSTCON using space $S$ and time $T\leq 2^{\frac{1}{2}\log(n)\log(n/S)+o(\log^2(n))}$, which is an (up to quadratic) improvement over the best classical algorithm for any $S=o(\sqrt{n})$. Of the $S$ total space used by our algorithm, only $O(\log^2(n))$ is quantum space - the rest is classical. This effectively means that we can trade off classical space for quantum time.

We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This framework opens new pathways toward universal fault tolerance by allowing transversal implementation of $T$ gates alongside fault-tolerant realization of selected non-transversal Clifford gates using flags. The construction we present allows a Clifford circuit consisting of $n$ two-qubit gates and $O(n)$ single-qubit gates acting upon physical qubits in a code of distance $d$ to be made fault tolerant to distance $d$ using $O(d^2 \log(nd^2\log n))$ ancilla qubits and $O(nd^2 \log(nd^2 \log n))$ extra CNOTs. Beyond asymptotic analysis, we demonstrate our construction by implementing the non-transversal logical Hadamard gate for the [[15,1,3]] code, which has transversal T, and compare to alternative approaches for universality using this code. We also apply our construction to magic-state preparation, general state preparation using Clifford circuits, and data-syndrome codes.

A classical obfuscator for quantum circuits is a classical program that, given the classical description of a quantum circuit $Q$, outputs the classical description of a functionally equivalent quantum circuit $\hat{Q}$ that hides as much as possible about $Q$. Previously, the only known feasibility result for classical obfuscation of quantum circuits (Bartusek and Malavolta, ITCS 2022) was limited to circuits that always reject. On the other hand, if the obfuscator is allowed to compile the quantum circuit $Q$ into a quantum state $|\hat{Q}\rangle$, there exist feasibility results for obfuscating all pseudo-deterministic quantum circuits (Bartusek, Kitagawa, Nishimaki and Yamakawa, STOC 2023, Bartusek, Brakerski and Vaikuntanathan, STOC 2024), and all unitaries (Huang and Tang, FOCS 2025). We show that (relative to a classical oracle) there exists a classical obfuscator for all pseudo-deterministic quantum circuits. We do this by giving the first construction of a compact quantum fully-homomorphic encryption (QFHE) scheme that supports public verification of (pseudo-deterministic) quantum evaluation, relative to a classical oracle. To construct our QFHE scheme, we improve on the approach of Bartusek, Kitagawa, Nishimaki and Yamakawa (STOC 2023), which required ciphertexts that are both quantum and non-compact due to the use of quantum coset states and their publicly-verifiable properties. We introduce new techniques for analyzing coset states that can be generated ”on the fly”, by proving new cryptographic properties of the one-shot signature scheme of Shmueli and Zhandry (CRYPTO 2025). Our techniques allow us to produce QFHE ciphertexts that are purely classical, compact, and publicly-verifiable. This also yields the first classical verification of quantum computation protocol for BQP that simultaneously satisfies blindness and public-verifiability.

The spontaneous breaking of a $Z_2$ symmetry typically gives rise to emergent excitations possessing the same symmetry with a renormalized mass. Contrary to this conventional wisdom, we present a theory in which the low-lying excitation in the broken-symmetry phase acquires a continuous symmetry, even when the underlying symmetry of the system is discrete. In the presence of anisotropic long-range interactions, the order parameter renormalizes the relative strength of the particle-conserving and particle-nonconserving interactions. When one of the two renormalized interactions vanishes, a conservation law absent in the original Hamiltonian emerges, giving rise to a continuous symmetry. A striking consequence of the emergent continuous symmetry and conservation law is that it constrains quantum correlations in the ground-state to be zero, leading to the ground-state factorization in the presence of strong interactions. Our finding is a universal feature of quantum phase transitions in fully-connected systems and in their lattice generalizations; therefore, it can be observed in a wide range of physical systems.

We provide the ultimate precision attainable in spectroscopy of a quantum emitter using single-photon pulses. We find the maximum for estimating the linewidth to be independent of the details of the emitter's bare Hamiltonian while that for the detunings not to be so. We also identify optimal pulse shapes attaining these precisions.

A family of oriented, normal, nonabelian Cayley graphs is presented, whose continuous-time quantum walks exhibit uniform mixing.

Mechanical systems provide a unique test bed for studying quantum phenomena at macroscopic length scales. However, realizing quantum states that feature quantum correlations among macroscopic mechanical objects remains an experimental challenge. Here, we propose a quantum system in which two micro-electromechanical oscillators interact through a chain of Rydberg atoms confined in optical tweezers. We demonstrate that the coherent dynamics of the system generate entanglement between the oscillators. Furthermore, we utilize the tunability of the radiative decay of the Rydberg atoms for dissipative entanglement generation. Our results highlight the potential to exploit the flexibility and tunability of Rydberg atom chains to generate nonclassical correlations between distant mechanical oscillators.

Atomic metasurfaces (AMs) provide a powerful nanophotonic platform for integrating topological effects into quantum many-body systems. In this Letter, we investigate the quantum optical and topological properties of a two-dimensional Kagome AM, going beyond the tight-binding approximation and incorporating all-to-all interactions. We reveal selective higher-order topological states with a unique dynamical “chasing" behavior, protected by a generalized chiral symmetry and enabling efficient topological directional transfer. By introducing an impurity atom – a giant atom – coupled to all array atoms, we observe chiral emission patterns strongly dependent on the atomic polarization. This nonlocal coupling structure allows exploration of self-interference effects at subwavelength scales. Our findings establish AMs as a versatile platform for engineering tunable topological states and chiral quantum optical phenomena, with potential applications in customized light sources and photonic devices.

We introduce a generic framework for solving linear programs (LPs) with many constraints $(n \gg d)$ via adaptive sparsification. Our approach provides a principled generalization of the techniques of [Assadi '23] from matching problems to general LPs and robustifies [Clarkson's '95] celebrated algorithm for the exact setting. The framework reduces LP solving to a sequence of calls to a “low-violation oracle” on small, adaptively sampled subproblems, which we analyze through the lens of the multiplicative weight update method. Our main results demonstrate the versatility of this paradigm. First, we present a quantum version of Clarkson's algorithm that finds an exact solution to an LP using $\tilde{O}(\sqrt{n} d^3)$ row-queries to the constraint matrix. This is achieved by accelerating the classical bottleneck (the search for violated constraints) with a generalization of Grover search, decoupling the quantum component from the classical solver. Second, our framework yields new state-of-the-art algorithms for mixed packing and covering problems when the packing constraints are “simple”. By retaining all packing constraints while sampling only from the covering constraints, we achieve a significant width reduction, leading to faster solvers in both the classical and quantum query models. Our work provides a modular and powerful approach for accelerating LP solvers.

Studies of entanglement dynamics in quantum many-body systems have focused largely on initial product states. Here, we investigate the far richer dynamics from initial entangled states, uncovering universal patterns across diverse systems ranging from many-body localization (MBL) to random quantum circuits. Our central finding is that the growth of entanglement entropy can exhibit a counter-intuitive non-monotonic dependence on the initial entanglement in many non-ergodic systems, peaking for moderately entangled initial states. To understand this phenomenon, we introduce a conceptual framework that decomposes entanglement growth into two mechanisms: “build” and “move”. The “build” mechanism creates new entanglement, while the “move” mechanism redistributes pre-existing entanglement throughout the system. Specifically, we demonstrate that MBL dynamics are “move-dominated”, exhibiting a quantitative agreement with a random SWAP circuit that serves as a model of pure “move” dynamics by uniformly distributing pre-existing entanglement. This implies that MBL acts as a redistributor of a hidden entanglement reservoir quantified by the bipartition-averaged entropy. This “build-move” framework offers a unified perspective for classifying diverse physical dynamics, deepening our understanding of entanglement propagation and information processing in quantum many-body systems.

Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In particular, moment polytopes have been understood to play a key role. In quantum information, moment polytopes (also known as entanglement polytopes) provide a framework for the single-particle quantum marginal problem and offer a geometric characterization of entanglement. In algebraic complexity, they underpin quantum functionals that capture asymptotic tensor relations. More recently, moment polytopes have also become foundational to the emerging field of scaling algorithms in computer science and optimization. Despite their fundamental role and interest from many angles, much is still unknown about these polytopes, and in particular for tensors beyond $\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2$ and $\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2$ only sporadically have they been computed. We give a new algorithm for computing moment polytopes of tensors (and in fact moment polytopes for the general class of reductive algebraic groups) based on a mathematical description by Franz (J. Lie Theory 2002). This algorithm enables us to compute moment polytopes of tensors of dimension an order of magnitude larger than previous methods, allowing us to compute with certainty, for the first time, all moment polytopes of tensors in $\mathbb{C}^3\otimes\mathbb{C}^3\otimes\mathbb{C}^3$, and with high probability those in $\mathbb{C}^4\otimes\mathbb{C}^4\otimes\mathbb{C}^4$ (which includes the $2\times 2$ matrix multiplication tensor). We discuss how these explicit moment polytopes have led to several new theoretical directions and results.

The Walsh-quantized baker's maps are models for quantum chaos on the torus. We show that for all baker's map scaling factors $D\ge2$ except for $D=4$, typically (in the sense of Haar measure on the eigenspaces, which are degenerate) the empirical distribution of the scaled matrix element fluctuations $\sqrt{N}\{\langle \varphi^{(j)}|\operatorname{Op}_{k,\ell}(a)|\varphi^{(j)}\rangle-\int_{\mathbb{T}^2}a\}_{j=1}^{N}$ for a random eigenbasis $\{\varphi^{(j)}\}_{j=1}^{N}$ is asymptotically Gaussian in the semiclassical limit $N\to\infty$, with variance given in terms of classical baker's map correlations. This determines the precise rate of convergence in the quantum ergodic theorem for these eigenbases. We obtain a version of the Eigenstate Thermalization Hypothesis (ETH) for these eigenstates, including a limiting complex Gaussian distribution for the off-diagonal matrix elements, with variances also given in terms of classical correlations. The presence of the classical correlations highlights that these eigenstates, while random, have microscopic correlations that differentiate them from Haar random vectors. For the single value $D=4$, the Gaussianity of the matrix element fluctuations depends on the values of the classical observable on a fractal subset of the torus.

A key result in entanglement theory is that the addition of a catalyst dramatically enlarges the set of possible state transformations via local operations and classical communication (LOCC). However, it remains unclear what is the interplay between classical communication and quantum catalysis. Here our aim is to disentangle the effect of the catalyst from that of classical communication. To do so, we explore a class of state transformations termed catalytic local operations (CLO) and compare it to LOCC and to stochastic LOCC augmented by bounded quantum communication. We show that these classes are incomparable and capture different facets of quantum state transformations.

Scaling up the number of qubits available on quantum processors remains technically demanding even in the long term; it is therefore crucial to clarify the number of qubits required to implement a given quantum operation. For the most general class of quantum operations, known as quantum instruments, the qubit requirements are not well understood, especially when mid-circuit measurements and delayed input preparation are permitted. In this work, we characterize lower and upper bounds on the number of qubits required to implement a given quantum instrument in terms of the causal structure of the instrument. We further apply our results to entanglement distillation protocols based on stabilizer codes and show that, in these cases, the lower and upper bounds coincide, so the optimal qubit requirement is determined. In particular, we compute that the optimal number of qubits is 3 for the $[[9,1,3]]$-code-based protocol and 4 for the $[[5,1,3]]$-code-based protocol.

We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU($n$), a naive brute-force search requires a computational complexity of $O(1/\varepsilon^{(n^2 - 1)})$ to achieve an approximation with error $\varepsilon$. In contrast, by using our method, the complexity can be reduced to $O(-n^2 \log\varepsilon/\varepsilon^{((n^2 - 1)/2)})$. This method requires almost no assumptions and can be applied to a variety of gate sets, including Clifford+$T$ and Clifford+$V$. Further, we introduce a suboptimal but short run-time algorithm for synthesizing multi-qubit controlled gates. This approach highlights the role of subgroup structures in reducing synthesis complexity and opens a new direction of study on the compilation of multi-qubit gates. The framework is broadly applicable to different universal gate sets, and our analysis suggests that it can serve as a foundation for resource-efficient quantum compilation in near-term architectures.

This paper is concerned with open quantum memory systems for approximately retaining quantum information, such as initial dynamic variables or quantum states to be stored over a bounded time interval. In the Heisenberg picture of quantum dynamics, the deviation of the system variables from their initial values lends itself to closed-form computation in terms of tractable moment dynamics for open quantum harmonic oscillators and finite-level quantum systems governed by linear or quasi-linear Hudson-Parthasarathy quantum stochastic differential equations, respectively. This tractability is used in a recently proposed optimality criterion for varying the system parameters so as to maximise the memory decoherence time when the mean-square deviation achieves a given critical threshold. The memory decoherence time maximisation approach is extended beyond the previously considered low-threshold asymptotic approximation and to Schrödinger type mean-square deviation functionals for the reduced system state governed by the Lindblad master equation. We link this approach with the minimisation of the mean-square deviation functionals at a finite time horizon and with their discounted version which quantifies the averaged performance of the quantum system as a temporary memory under a Poisson flow of storage requests.

In thermodynamics, an agent's ability to extract work is fundamentally constrained by their environment. Traditional frameworks struggle to capture how strategic decision-making under uncertainty, particularly an agent's tolerance for risk, determines the trade-off between extractable work and probability of success in finite-scale experiments. Here, we develop a framework for nonequilibrium thermodynamics based on adversarial resource theories, in which work extraction is modeled as an adversarial game for an agent extracting work. Within this perspective, we consider a Szilard-type engine as a game isomorphic to Kelly gambling, an information-theoretic model of optimal betting under uncertainty – but with a thermodynamic utility function. Extending the framework to finite-size regimes, we apply a risk-reward trade-off to find an interpretation of the Renyi divergences in terms of extractable work for a given failure probability. By incorporating risk sensitivity via utility functions, we show that the guaranteed amount of work a rational agent would accept instead of undertaking a risky protocol is given by a Renyi divergence. This provides a unified picture of thermodynamics and gambling, and highlights how generalized free energies emerge from an adversarial setup.

Quadratic Unconstrained Binary Optimization (QUBO) problems are prevalent in various applications and are known to be NP-hard. The seminal work of Goemans and Williamson introduced a semidefinite programming (SDP) relaxation for such problems, solvable in polynomial time that upper bounds the optimal value. Their approach also enables randomized rounding techniques to obtain feasible solutions with provable performance guarantees. In this work, we identify instances of QUBO problems where matrix multiplicative weight methods lead to quantum and quantum-inspired algorithms that approximate the Goemans-Williamson SDP exponentially faster than existing methods, achieving polylogarithmic time complexity relative to the problem dimension. This speedup is attainable under the assumption that the QUBO cost matrix is sparse when expressed as a linear combination of Pauli strings satisfying certain algebraic constraints, and leverages efficient quantum and classical simulation results for quantum Gibbs states. We demonstrate how to verify these conditions efficiently given the decomposition. Additionally, we explore heuristic methods for randomized rounding procedures and extract the energy of a feasible point of the QUBO in polylogarithmic time. While the practical relevance of instances where our methods excel remains to be fully established, we propose heuristic algorithms with broader applicability and identify Kronecker graphs as a promising class for applying our techniques. We conduct numerical experiments to benchmark our methods. Notably, by utilizing tensor network methods, we solve an SDP with $D = 2^{50}$ variables and extract a feasible point which is certifiably within $0.15\%$ of the optimum of the QUBO through our approach on a desktop, reaching dimensions millions of times larger than those handled by existing SDP or QUBO solvers, whether heuristic or rigorous.

We introduce a general framework for weak transversal gates, namely syndrome-resolved implementation of logical unitaries realized by local physical unitaries, and demonstrate its wide impact in three applications: partial fault-tolerant architecture, short-depth state preparation, and magic state distillation. Our theoretical contribution is to prove a sufficient condition for a general Calderbank-Shor-Steane code to admit weak transversal gates, and to present an efficient algorithm to determine the physical multiqubit Pauli rotations. To demonstrate the practicality of weak transversal gates in the near future, we propose a partially fault-tolerant Clifford+$\phi$ architecture that implements in-place Pauli rotations via a repeat-until-success strategy. Numerical simulations indicate that a rotation of 0.001 attains a logical error of $9.6\times10^{-5}$ on a surface code with $d=7$ at a physical error rate of $p=10^{-4}$, while avoiding the spacetime overheads of magic state factories, small angle synthesis, and routing. Resource estimates on surface and [[144,12,12]] bivariate bicycle codes for a Trotter-like circuit with $N=108$ logical qubits indicate runtime reductions of factors of 778 and 45, respectively, relative to the conventional method, due to the natural parallelism of rotation gates. Looking further ahead, we consider state-preparation tasks allowing postselection. We show that weak transversal gadgets prepare high-level equatorial magic states with a substantially improved cost-accuracy tradeoff, achieving up to a $10^3$-fold reduction in spacetime cost for a magic state at the 11th level of the Clifford hierarchy. Furthermore, we integrate weak transversal gates into magic state distillation pipelines, reducing the logical error rate of level-2 distillation of the $\sqrt{T}$ state by up to a factor of 94 with a small increase in spacetime cost.

Understanding the relationship between many-body localization and spectra in non-Hermitian many-body systems is crucial. In a one-dimensional clean, long-range interaction-induced non-Hermitian many-body localization system, we have discovered the coexistence of static and dynamic spectral real-complex phase transitions, along with many-body ergodic-localized phase transitions. The phase diagrams of these two types of transitions show similar non-monotonic boundary trends but do not overlap, highlighting properties distinct from conventional disorder-induced non-Hermitian many-body localization. We also propose a potential experimental realization of this model in cold-atom systems. Our findings provide valuable insights for further understanding the relationship between non-Hermitian many-body localization and non-Hermitian spectra in long-range interacting systems.

Binary optimisation tasks are ubiquitous in areas ranging from logistics to cryptography. The exponential complexity of such problems means that the performance of traditional computational methods decreases rapidly with increasing problem sizes. Here, we propose a new algorithm for binary optimisation, the Bosonic Binary Solver, designed for near-term photonic quantum processors. This variational algorithm uses samples from a quantum optical circuit, which are post-processed using trainable classical bit-flip probabilities, to propose candidate solutions. A gradient-based training loop finds progressively better solutions until convergence. We perform ablation tests that validate the structure of the algorithm. We then evaluate its performance on an illustrative range of binary optimisation problems, using both simulators and real hardware, and perform comparisons to classical algorithms. We find that this algorithm produces high-quality solutions to these problems. As such, this algorithm is a promising method for leveraging the scalable nature of photonic quantum processors to solve large-scale real-world optimisation problems.

We present a low-depth amplitude encoding method for arbitrary quantum state preparation. Building on the foundation of an existing divide-and-conquer algorithm, we propose a method to disentangle the ancilla qubits from the final state. Our method is measurement-based but deterministic, and offers an alternative approach to existing state preparation algorithms. It has circuit depth $\Theta(n^2)$ and requires $\Theta(2^n)$ ancilla qubits. The resulting spacetime allocation is $\Theta(2^n)$, which is optimal. Furthermore, we go beyond scaling arguments to precisely quantify the resources needed for any $n$. We illustrate our method through detailed worked examples of both a “dense” state and a W-state. Finally, we demonstrate how to combine this method with existing methods to construct hybrid algorithms with varying space and circuit depth complexities.

We investigate the formulation of work distributions for quantum scalar fields in static curved spacetimes by extending the Ramsey interferometric protocol originally developed in previous works for flat spacetimes. The use of Unruh-DeWitt particle detectors provides a causally consistent framework to define and measure work statistics, avoiding the limitations of the two-time projective measurement scheme in relativistic quantum field theory. We derive a non-perturbative expression for the characteristic function of the quantum field and apply it to thermal Kubo-Martin-Schwinger (KMS) states, showing that the resulting work distributions satisfy both the Crooks fluctuation theorem and the Jarzynski equality. Furthermore, we analyse the case of a pointlike detector, obtaining compact expressions for the first two moments of the work distribution, allowing us to recover the standard fluctuation-dissipation relation in the high-temperature limit. Our results demonstrate that fluctuation theorems hold for quantum fields interacting with Unruh-DeWitt particle detectors in static curved spacetimes.