Quantum Physics Paper Analysis
This page provides AI-powered analysis of new quantum physics papers published on arXiv (quant-ph). Each paper is automatically evaluated using AI, briefly summarized, and assessed for relevance across four key areas:
- CRQC/Y2Q Impact – Direct relevance to cryptographically relevant quantum computing and the quantum threat timeline
- Quantum Computing – Hardware advances, algorithms, error correction, and fault tolerance
- Quantum Sensing – Metrology, magnetometry, and precision measurement advances
- Quantum Networking – QKD, quantum repeaters, and entanglement distribution
Papers flagged as CRQC/Y2Q relevant are highlighted and sorted to the top, making it easy to identify research that could impact cryptographic security timelines. Use the filters to focus on specific categories or search for topics of interest.
Updated automatically as new papers are published. It shows one week of arXiv publishing (Sun to Thu). Archive of previous weeks is at the bottom.
Provable circuit-level thresholds for non-abelian topological phases
View Full Abstract
We provide an explicit scheme to realize a quantum memory in any 2D non-chiral topological order. For this, we construct syndrome extraction circuits based on the Turaev-Viro path integral as well as a classical algorithm for decoding on the fly. We prove that our scheme has a threshold under a local stochastic circuit-level noise model and discuss how to generalize it to implement topological logical gates.
Quantum Knowledge Distillation: State-of-the-art, Applications and Open Problems
View Full Abstract
Knowledge distillation transfers predictions, representations, or other supervisory information between learning models and is increasingly investigated in quantum machine learning. Its applications extend beyond compression to cross-architecture transfer, circuit approximation, distributed learning, and classical deployment of models trained using quantum-derived supervision. This survey reviews these approaches using two complementary classification axes: teacher-student configuration and the role of quantum resources in the distillation process. Quantum-inspired methods are discussed separately from methods that simulate quantum computations classically or execute them on quantum hardware. We explain how measurement probabilities, expectation values, classical readouts, state overlaps, and circuit-level objectives support different transfer mechanisms. We then critically assess the presented results against baseline design, execution conditions, uncertainty, and resource costs. The evidence shows that distillation can improve selected quantum students, but benefits are task- and architecture-dependent, and several studies find negligible gains or even performance degradation. Evaluations on physical quantum hardware remain limited, with some testing individual quantum components rather than complete learning pipelines. Heterogeneous protocols and incomplete resource reporting prevent general conclusions about practical quantum advantage. We identify priorities for controlled benchmarking, noise-aware learning, reproducible evaluation, and efficient transfer between quantum and classical models.
Room-Temperature Quantum Emission from Boron Nitride Nanotubes
View Full Abstract
Quantum information systems such as quantum key distribution and quantum communications require bright, high-purity, stable sources of single photons to act as carriers of quantum information. As such, methods for obtaining single photon emitters (SPEs) in solid-state devices capable of articulating with quantum photonic circuits are a necessary obstacle that must be overcome. Hexagonal boron nitride (hBN) flakes have been extensively studied as a host material for SPEs, though working in two dimensions is accompanied by engineering complexity. However, dimensionality can be reduced through the implementation of boron nitride nanotubes (BNNTs). Here we investigate the potential of BNNTs as room-temperature SPEs using confocal photoluminescence microscopy and Hanbury Brown-Twiss interferometry. Quantum emitters were found in BNNTs spanning the entirety of the visible spectrum, including spectral regions where SPEs within hBN have not been reported. Furthermore, each tube was found to possess multiple SPEs at varying emission wavelengths along the length, exhibiting lifetimes as fast as 0.5 ns, which is about two-fold faster than the fastest hBN SPEs. Additionally, we demonstrate that surface passivation/coating mitigates blinking events, therefore increasing the emitter stability. Thus, BNNTs can function as a single structure supporting a variety of multiwavelength SPE sources, while maintaining a compact radius of ~25 nm, making them ideally suited for deterministic placement and integration within nanophotonic devices such as waveguides and interferometric filters.
Dynamical effects induced by synthetic SU(1,1) gauge fields
View Full Abstract
Compact gauge fields are powerful tools for controlling quantum dynamics and topological phases of matter. Non-compact gauge fields are particularly relevant for open systems, where particles or energy are exchanged with the environment. Here, we investigate the wavepacket and entanglement dynamics induced by an $\mathrm{SU}(1,1)$ gauge field. The wavepacket undergoes non-Abelian non-compact Bloch oscillations, in which the spectrum of an auxiliary one-dimensional quantum problem determines the transition between stable oscillations and unstable amplification. In the unstable adiabatic regime, the wavepacket probes an $\mathrm{SU}(1,1)$ topological defect, and its amplification is determined solely by a hyperbolic solid angle in Minkowski space. Threading an $\mathrm{SU}(1,1)$ gauge field through a bosonic tight-binding model yields the bosonic Kitaev model, whose volume or super-volume entanglement scaling is governed by the stability of the gauge field. We further propose an experimental realization of an $\mathrm{SU}(1,1)$ gauge field in a spinor condensate. Our results can be generalized to other non-compact groups and higher dimensions, providing a geometric framework for entanglement control, selective amplification, and engineering energy transfer.
Polynomial-time classical simulation of boson and fermion sampling under thermal loss
View Full Abstract
Sampling experiments are a leading approach to demonstrating quantum computational advantage, yet their robustness to experimental noise is not completely understood. We develop a common framework for classical simulation of boson and fermion sampling under thermal loss, including pure loss. For Fock-state boson sampling, Gaussian boson sampling with fixed uniform squeezing, and fermion sampling with magic inputs, we obtain polynomial-time sampling at inverse-polynomial total variation error, for any fixed nonzero overall loss rate, and with high probability over Haar-random interferometers. A milder flatness assumption on the ideal output distribution suffices for quasipolynomial-time simulation without Haar randomness. With constant thermal loss per layer, the same flatness assumption gives polynomial-time simulation at logarithmic depth. Our bounds for Fock-state boson sampling cover both dilute and saturated regimes and become stronger near full input filling: when only a bounded number of input modes are empty, the noisy output for Haar-random interferometers converges, as the number of modes grows, to a distribution independent of the interferometer.
DiffSequence-Q: Diffusion Design with Quantum Assistance for Biologically Active Proteins
View Full Abstract
Designing protein sequences that satisfy both secondary structure requirements and solubility targets remains challenging. We present DiffSequence-Q, a hybrid multinomial diffusion model conditioned on secondary structure at each residue and a continuous solubility target. To introduce quantum auxiliary supervision during training, we employ a quantum neural network (QNN) or quantum Kolmogorov-Arnold network (QKAN) as an auxiliary solubility prediction head over shared Transformer representations. The auxiliary prediction loss is jointly optimized with the diffusion objective, allowing quantum auxiliary supervision to influence the learned denoising model. Once trained, protein sequences are generated entirely through classical reverse diffusion. On the CATH benchmark, DiffSequence-Q achieved the highest secondary structure recovery among the four evaluated models for complete sequence generation. Evaluation with a separately trained solubility prediction model showed that the best QNN and QKAN configurations achieved mean predicted solubility scores 14.0% and 22.7% higher than the multilayer perceptron (MLP) baseline, respectively. Experimental characterization further demonstrated biological activity across three distinct protein families. Selected defensins exhibited pronounced inhibitory activity against Aspergillus niger, while xylanases and short-chain dehydrogenases exhibited substantial enzymatic activity. Together, these results support DiffSequence-Q as a framework for integrating structural requirements and solubility targets in protein generation, with experimentally demonstrated biological activity.
Quantum enhanced beam displacement estimation: sensitivity limits, optimal probes, and measurement schemes
View Full Abstract
We investigate the ultimate sensitivity limits for measuring small transverse beam displacements and identify optimal strategies that attain them, using the framework of mode parameter estimation. We contrast two families of states with different resource constraints, using Hermite-Gauss and Laguerre-Gauss mode pairs. First, for fixed total photon number states, the optimal state is identified and we show that it asymptotically approaches a rotated NOON state. The sensitivity bound is compared to that of an asymptotically optimal pure Gaussian state with fixed average photon number. Finally, we propose concrete measurement schemes using the method of moments and show that the twin-Fock state may provide a viable alternative to the rotated NOON state for this task. Our work provides a broader benchmark for developing practical strategies for spatial sensing at the quantum limit.
Disorder-blind Mpemba acceleration of quantum state preparation
View Full Abstract
Using the strong Mpemba effect to accelerate relaxation by initial-state design requires suppressing the slowest mode, which typically needs prior knowledge of the system. However, in disordered systems, this mode is sample-dependent, so a fixed preparation generally retains a slow-mode overlap. We show that a ``blind'' preparation, designed from the clean chain without knowledge of the disorder realisation or its distribution, can start farther from stationarity yet overtake a reference in typical samples of a dephased disordered XX chain. It requires only the chain geometry and the particle number. At strong dephasing, the density dynamics maps to a resistor chain, and an exact inverse-generator identity links the residual overlap to the spatial resistance profile. We find two distinct thresholds: a finite mean resistance suffices for diffusion, but the residual overlap decays as $L^{-1/2}$ with chain length $L$ only when the resistance variance is finite; rare weak links slow this decay. We predict the fraction of samples in which the blind preparation wins, which is an ensemble-level measure of its reliability. Finite-size calculations support both scaling regimes with interactions at strong dephasing. We give preparation circuits and a density readout for the residual overlap.
Recalibration-Aware Optimization of ZEFOZ Operating Points in $^{167}\mathrm{Er}^{3+}:\mathrm{Y}_2\mathrm{SiO}_5$ for Quantum Memories
View Full Abstract
Erbium-doped solids like $^{167}\mathrm{Er}^{3+}:\mathrm{Y}_2\mathrm{SiO}_5$ have properties that make them suitable for quantum-network memories, however, their unquenched effective electronic spin causes rapid magnetic decoherence. Operating at Zero First-Order Zeeman (ZEFOZ) points allows us to mitigate this, where we evaluate the ZEFOZ landscape for Site-2 $^{167}\mathrm{Er}^{3+}$ by incorporating a full-Hessian spin-Hamiltonian treatment with the anisotropic magnetic-field covariance derived from the native $^{89}\mathrm{Y}$ crystal lattice directly. Operating-point screening criteria were adopted to devise a Pareto-optimal frontier of four transition pairs to balance modeled Y-only magnetic pure-dephasing lifetimes ($T_{φ,Y}^{(2)}$) against microwave control authority. The $ε_{14}\leftrightarrowε_{15}$ transition exhibits the longest modeled Y-bath-induced quadratic pure-dephasing time, $T_{φ,Y}^{(2)}>2.2\times10^5~\mathrm{s}$, while the $ε_{12}\leftrightarrowε_{13}$ transition stood out, achieving a Rabi frequency coefficient of $1.248 \times 10^5~\mathrm{Hz/mT}$. An assumption-based Hamiltonian-uncertainty analysis demonstrates that while uncompensated deviations shift the ZEFOZ condition away from its nominal magnetic-field coordinate, the shifted operating points can be recovered via numerical vector-field recalibration. The Pareto-optimal coordinates were mathematically recovered for all sampled Hamiltonian perturbations, and the $84.1^{\mathrm{st}}$-percentile field relocations ranged from $10.95$ to $27.97~\mathrm{mT}$. The intended operation near $10~\mathrm{mK}$ must be taken into account for the suppression of Er-induced spectral diffusion through electronic-spin polarization, while the extended Y-bath pure-dephasing timescales also remain conditional on the adopted temporal-correlation model.
Asymptotic analysis of the dynamical field-field correlation function of the impenetrable Bose gas
View Full Abstract
We study the long-time, large-distance asymptotic behaviour of the two-point correlation function of fields of the impenetrable Bose gas in equilibrium states characterized by a quasi-momentum distribution (or filling fraction). This includes, in particular, the cases of Gibbs and generalized Gibbs ensembles. The overall structure of the asymptotic expansion depends on the number of Fermi points, those points for which the quasi-momentum distribution takes the value $1/2$. The leading asymptotic behaviour is determined by a relaxation rate, a logarithmic correction term and an amplitude for which we provide simple and explicit expressions. In the case of two Fermi points the first sub-leading correction is calculated as well.
Atomic Static Electric Quadrupole Polarizability from Relativistic Many-Body Theory With Application To Thulium $\left(6s^2\, 4f^{13}\right)$\, $^2F_{7/2}$ and $^2F_{5/2}$
View Full Abstract
In the present work a method for calculating atomic static electric rank-$n$ tensor quadrupole polarizabilities $α_Q^{(n)}(J)$ for arbitrary atomic electronic structure is presented. It is based on a linear-symmetry representation of atomic states using large-scale relativistic configuration interaction wavefunctions, and the quadrupole polarizabilities are obtained by a sum-over-states approach. The major result from applying this method to atomic thulium is $α_Q^{(0)}(\frac{7}{2}) = 2496^{+0}_{-231}$ \au for the electronic ground term $^2F_{7/2}$ static electric scalar quadrupole polarizability which is roughly a factor of four smaller than same property in the electronic ground state of the cesium atom. This finding adds to the favorable properties of thulium atoms in atomic-clock research.
Testing Gravitationally-Induced-Entanglement with Massive Particles and Quantum Clocks
View Full Abstract
We present an experimental proposal to test whether gravity can entangle a levitated particle with an array of quantum clocks. By harnessing the collective interaction between a micrometer-scale particle and an array of ultra-precise nuclear clocks, our scheme offers a conceivable path to observing gravitationally mediated entanglement with quantum clocks in the laboratory. Crucially, this setup will probe a genuinely relativistic effect one that requires the contribution of internal clock energy to active gravitational mass and cannot arise from the Newtonian interaction between fixed masses. Therefore, observing this entanglement would provide evidence for the quantised nature of active gravitational mass -- which has not been tested in any prior experiment -- rather than for spatial coherence of fixed masses,which is routinely tested in matterwave interferometers
Recovery gates as a resource in repetition-code process tomography: exhaustive gate-optimal designs for three, five and seven qubits
View Full Abstract
Process tomography built on stabilizer codes compares the logical channel of a repetition code with a reference channel, and the decoder that produces that channel is almost always fixed to the standard minimum-weight one. We ask how many physical single-qubit Pauli gates the decoder actually needs when the measurement basis is fixed---the constraint under which the count is a resource rather than a bookkeeping artefact. Exhaustive enumeration of every recovery design for $n=3$, $5$ and $7$ qubits, with rank decided by exact modular arithmetic at two primes, gives minimal counts of $0$, $1$ and $5$ gates, against $6$, $10$ and $14$ for first-order decoding and $6$, $50$ and $308$ for full minimum-weight decoding. The count depends only on how many sites are corrected and never on which, so the two halves of the design problem separate. Correcting more sites is not monotonically better: at $n=7$ full decoding loses three dimensions of rank, and under a calibration-residual floor the precision curve at $n=3$ is U-shaped. The three-gate design is $9.5$ times more precise than the standard six-gate decoder at the median of $40$ sampled working points, and more precise at every one of them ($1.8$ to $88$ times); the size of that factor belongs to the working point, the ordering does not. Reaching a $10$\,mrad rms error then costs $1.2\times10^{7}$ shots in $65$\,s on a current superconducting device at a well-conditioned point, while $n\ge5$ stays out of reach for conditioning reasons rather than gate-count reasons. Finally, the optimal designs are not covariant under chain reversal: they separate the mirror pair of arXiv:2610.19779 by $1.3\times10^{-3}$ while leaving the Jacobian at full rank.
Beyond Quantum Messages: Toward Quantum-Native Network Functioning
View Full Abstract
The Quantum Internet is commonly envisioned as a network that transports quantum states and distributes entanglement as the key resource underpinning distributed quantum applications. This view is necessary but incomplete if quantum phenomena are confined to what the network carries or manages, while network functionalities remain grounded predominantly in classical abstractions. This Perspective advances a broader thesis: quantum phenomena can also participate directly in the realization of network functionalities. We first establish the architectural baseline by introducing entanglement as a stateful network resource whose operational condition is non-locally distributed across remote nodes, evolves through manipulation or consumption, and degrades over time through decoherence. Its evolving state must therefore remain visible to the functionalities acting on it. We then move beyond resource visibility and use two mechanisms as proof points of a broader quantum-native functional design space: entanglement generation during propagation through coherent spatial-path superposition, and operational connectivity induced by shared entanglement that can depart from the physical graph. These examples show that paths, neighbors, or participating nodes may become operationally relevant in ways determined by quantum coherence and shared entanglement, rather than by physical connectivity alone. We identify Quantum Addressing as a transversal abstraction capable of representing such relations while complementing, rather than replacing, classical addressing and signaling. The resulting perspective broadens the Quantum Internet from transporting quantum information and distributing entanglement to exploiting quantum phenomena in network functioning, opening a coupled frontier spanning routing, forwarding, control, and functionality placement.
Dualities in one-dimensional quantum lattice models: Lie groups, Schur-Weyl duality and symmetry breaking
View Full Abstract
We present a systematic framework for gauging continuous symmetries, and show that the Schur-Weyl duality arises naturally as a realization of this construction with open boundary conditions. Restricting to compact Lie group symmetries, we construct dual models for one-dimensional quantum lattice models exhibiting those symmetries. We demonstrate that matrix product operators enable the explicit construction of intertwiners between the dual theories and their (non-invertible) symmetries. With closed boundary conditions, we can relate the full spectrum of these dual theories by considering all possible twisted boundary conditions.We illustrate how the Peter-Weyl transform appears when the duality acts on the boundary Hilbert space of a $G$-symmetric model. The presented framework generalizes previous work on dualities for unitary fusion category symmetric models. It exemplifies how dualities for both finite and continuous symmetries rely on the relation between a bond algebra and a representation of the symmetry in the lattice as double centralizers. We argue that dual non-invertible spontaneous symmetry breaking is the mechanism that underlies symmetric tensor network algorithms. We illustrate these results for $U(1)$- and $SU(2)$-symmetric quantum lattice models.
Entropic measures of quantum information
View Full Abstract
Entropy has played a pivotal role in physics ever since its inception by Clausius in the early industrial age. Shannon ushered the concept into the information age by using it to describe fundamental limits of information processing, founding the field of information theory. Today, a fruitful interaction between information theory and physics is pushing our understanding of entropy forward. It has revealed, in particular, that no single notion of entropy suffices to capture all relevant properties of physical systems, making it necessary to consider a variety of entropic measures of quantum information, each with distinct features and uses. This review surveys these recent advances in a structured way, covering a comprehensive array of information measures, including Rényi and smooth entropies, together with their interrelations. Starting with a systematic characterization of entropies that motivates their definitions from natural physical principles, we discuss their applications ranging from quantum communication and cryptography to resource theories, thermodynamics, and many-body physics.
Certifying quantum code and circuit distances at scale
View Full Abstract
Code and circuit distances characterize how strongly quantum error correction suppresses logical errors and guide code comparisons, schedule choices and resource estimates. Yet many published distances are only upper bounds from heuristic searches. Here, we express both distances as tropical partition functions and evaluate them with rank-based dynamic programming and weight-bounded search. Circuit reductions and relaxations shrink the problems, and proved lower bounds with explicit logical errors of matching weight certify exact values. On two benchmarks, our method certifies more instances than all other tested exact solvers combined. We certify distances for codes with up to 31,200 qubits, such as Google's modular hyperbolic codes, and for memory circuits with up to $8\times10^5$ fault mechanisms, such as those of high-rate Cornucopia codes. Our audit of 26 recent papers identifies overestimated distances and non-tight upper bounds in 10 papers, with a maximum discrepancy of at least eight. Certified distances also guide circuit design and show which defective chips remain usable. In particular, we certify circuit distance 16 for IBM's two-gross memory circuits with the standard schedule, not the assumed 18, whereas redesigned schedules reach 18 at one noisy cycle, at the cost of one more timestep per cycle. At 99.98% junction yield, keeping gross-code memory blocks with dead checks that are certified at distance 10 or more raises the estimated usable share from 53% for perfect blocks alone to 94% with an improved schedule.
Finite-Time Thermodynamic Routing in an Anharmonic Collective Quantum Otto Engine
View Full Abstract
The Gibbs state determined by a thermal reservoir does not determine how a working medium approaches it or how fluctuations accumulate over repeated cycles. We exploit this kinetic freedom in an anharmonic collective quantum Otto engine. A longitudinal interaction separates neighboring Dicke transition frequencies without changing their collective matrix elements, allowing passive spectral shaping to route finite-time transport among edges with different heat costs while preserving the contact Gibbs states. Exact edge-current identities and repeated-cycle counting statistics link this routing to mean work, hot heat, and intercycle work correlations. At fixed thermal-contact exposure, structured reservoirs can increase both mean work and long-time squared precision; equal-work controls distinguish these gains from uniform relaxation-rate changes. The useful regime is mesoscopic, bounded by spectral resolution and physical contact time. An equal-cooling example and a full-spin local-noise study test the mechanism beyond ideal engine operation, the latter retaining a one-cycle precision gain despite spin-sector mixing. In a six-transmon dressed-spectrum model, passive microwave filters at fixed integrated coupling achieve equal mean work with shorter thermal contacts, corresponding to higher contact-time-normalized output, and with long-time squared precision comparable to that of the fastest sampled flat reference. The transition pathways selected by a passive reservoir thus provide a control variable for finite-time performance and accumulated work fluctuations that is independent of thermal equilibrium.
Persistent level-resolved transmon population after dispersive readout, and the limits of its open-system description
View Full Abstract
We calculate the level-resolved transmon population remaining after dispersive readout with a converged open-system model. The drive and qubit-cavity coupling use the rotating-wave approximation, while the cavity is a quantized mode in a frame displaced by its classical trajectory. At a readout occupation of 80, the model leaves a persistent distribution across the first transmon levels, with p2 = 1.02 x 10^-3 and p3 = 4.10 x 10^-5 at the end of readout. These populations survive an additional drive-off wait: over 73 ns each level decays by less than 3 percent and follows its own relaxation rate, not the near-factor-of-two drop in residual cavity photons. This identifies the population as bare-level occupation rather than coherent dressing. Channel-removal and bath-model controls attribute p2 mainly to dephasing and p3 and above mainly to relaxation, unchanged across bath models though absolute values vary by up to 15 percent. We also test the coherent drive truncation. In dissipation-free transmon-only benchmarks driven by the classical cavity trajectory, the nearest-neighbour RWA drive underestimates the full charge-operator result while the drive is on. At switch-off for occupation 80, where coherent populations are hundreds of times larger than the residual values, p2(RWA)/p2(full) = 0.905 and p3(RWA)/p3(full) = 0.759, with larger discrepancies at deeper levels. One source is a parity-allowed non-nearest-neighbour charge matrix element omitted by the drive operator. A naive beyond-RWA extension with bare-basis Lindblad dissipators fails a zero-drive ground-state test and serves only as a diagnostic. A dressed-basis (secular) construction instead leaves the dressed ground state stationary at zero drive. The result is a converged RWA prediction of readout-induced population plus direct tests of where the approximation loses quantitative reliability.
Optimal finite-copy readout of three-qubit entanglement with state retention
View Full Abstract
For unknown three-qubit pure states, we characterize the optimal trade-off among GHZ-class certification, binary probability readout of the three-tangle, and conditional state retention. The vanishing ideal of the null class specifies the optimal certification subspace, while a polynomial multiplication operator gives the spectral limit for binary readout. Four copies are necessary for a nonzero certificate. A fifth copy raises the optimal success probability from $τ^{2}/48$ to $5τ^{2}/72$ and permits the original unknown state to be retained, where $τ$ is the three-tangle. We obtain this gain as an instance of a general symmetry-based additional-copy theorem. At six copies the optimal certification probability is $(39+2S)τ^{2}/296$, with $S=\sum_{X}\mathrm{Tr}\,ρ_{X}^{2}$, whereas the largest exact binary probability is $τ^{2}/8$. Local Schur measurements and conditional local operations with classical communication attain these bounds. Retaining the full six-copy branch record yields a weighted estimator with lower variance than binary thinning of the same data. Explicit circuits and fixed-budget comparisons connect the success probabilities to input-copy consumption, retained quantum output, and coherent gate cost.
QDiff: Differential Testing of Quantum Software Stacks
View Full Abstract
Over the past few years, several quantum software stacks (QSS) have been developed in response to rapid hardware advances in quantum computing. A QSS includes a quantum programming language, an optimizing compiler that translates a quantum algorithm written in a high-level language into quantum gate instructions, a quantum simulator that emulates these instructions on a classical device, and a software controller that sends analog signals to a very expensive quantum hardware based on quantum circuits. In comparison to traditional compilers and architecture simulators, QSSes are difficult to tests due to the probabilistic nature of results, the lack of clear hardware specifications, and quantum programming complexity. This work devises a novel differential testing approach for QSSes, named QDIFF with three major innovations: (1) We generate input programs to be tested via semantics-preserving, source to source transformation to explore program variants. (2) We speed up differential testing by filtering out quantum circuits that are not worthwhile to execute on quantum hardware by analyzing static characteristics such as a circuit depth, 2 qubit gate operations, gate error rates, and T1 relaxation time. (3) We design an extensible equivalence checking mechanism via distribution comparison functions such as Kolmogorov Smirnov test and cross entropy
Quantum Fourier integration of decay rates at next-to-leading order
View Full Abstract
We discuss the use of quantum neural networks (QNNs) as a tool for integrating decay rates at next-to-leading order (NLO) in perturbation theory. Data-encoding quantum circuits admit a truncated Fourier-series representation, enabling a trained QNN to approximate a target integrand and provide the coefficients subsequently integrated with Quantum Fourier Iterative Amplitude Estimation (QFIAE). The causal-unitary formulation of the Loop-Tree Duality (LTD) combines virtual and real contributions into locally finite integrands suitable for this representation. We consider $H\to q\bar q(g)$, $γ^*\to q\bar q(g)$ and $Φ\toφφ(φ)$, comparing quantum-simulator and quantum-hardware results with analytic NLO predictions. The study illustrates the potential of Fourier-based QNN integration for high-energy physics.
Quantum Advantage with Sign-Free Proofs: An Oracle Separation between $\mathsf{StoqMA}$ and $\mathsf{MA}$
View Full Abstract
Several landmark oracle results (FOCS 2000, FOCS 2025, STOC 2026) establish strict separations along the chain $\mathsf{MA} \subseteq \mathsf{QCMA} \subseteq \mathsf{QMA}$, showing that quantum verification and quantum witnesses can each provide additional power over classical proof systems. These separations, however, use substantial coherent quantum computation, often through the quantum Fourier transform. We prove that a minimal quantum resource already suffices to outperform every classical verifier. Namely, we show the separation $$\mathsf{MA} \subsetneq \mathsf{StoqMA}$$ relative to a classical oracle. The class $\mathsf{StoqMA}$, introduced by Bravyi, Bessen, and Terhal (arXiv 2006), restricts the verifier to classical reversible computation, followed by a single Hadamard-basis measurement. Its power is closely tied to the complexity of stoquastic Hamiltonians, a sign-problem-free and seemingly more tractable class of quantum Hamiltonians. Our separating problem is to determine whether a sparse high-girth graph, given via an adjacency-list oracle, has a large or small Perron--Frobenius eigenvalue. This amounts to a ground-energy estimation task for a related stoquastic Hamiltonian. Our construction builds on a line of work on graph exploration problems with exponential quantum speedups, from welded trees (STOC 2003) to recent constructions (STOC 2021, arXiv 2026).
Coherent phase slips in coupled rings: from weak to strong interactions
View Full Abstract
We study the coherent transfer of circulation between two weakly coupled lattice rings of ultracold bosons, in which a persistent current initially prepared in one ring oscillates back and forth between the rings without net transfer of particles. Combining Bose--Hubbard simulations with their Gross--Pitaevskii and quantum phase model limits, we show that similar current oscillations arise from two distinct microscopic mechanisms. At weak interactions, particles in each occupied momentum mode tunnel independently between the rings, leading to a transfer time inversely proportional to the inter-ring tunnelling, extensive particle-number fluctuations and entanglement distributed over many Schmidt components; this mode-exchange dynamics is suppressed by self-trapping as the interactions increase. At stronger interactions and large filling, in the phase-dominated regime, circulation is instead transferred through a second-order collective process between many-body persistent-current states, with a transfer time scaling as the inverse square of the inter-ring tunnelling in the weak-link limit. Number fluctuations then remain of order one instead of growing with the particle number, and within each number sector the system evolves into coherent superpositions of two many-body configurations, distinguished by which ring carries the circulation. The entanglement accessible under number-conserving operations therefore reaches up to approximately one bit. We propose a quench protocol to prepare the initial state and estimate transfer times within reach of current ring-lattice experiments, identifying coupled rings as a platform to study coherent quantum phase slips and to manipulate persistent-current states.
Primitive Quantum Gates for an $SU(3)$ Discrete Subgroup: $Σ(216\times3)$
View Full Abstract
We construct a primitive gate set for the digital quantum simulation of the $648$-element discrete subgroup of $SU(3)$, $\dsb$. The five algorithmic primitives are the inversion, group multiplication, trace, group Fourier transform, and kinetic-phase gates, for which we provide qubit and qutrit--qubit decompositions. For a fiducial shear-viscosity calculation on a $10^3$ spatial lattice with $50$ time steps and a total synthesis-error budget of $10^{-8}$, the estimated fault-tolerant costs are $2.3$--$6.8\times10^{10}$ $T$ gates in the qubit architecture and $1.3$--$5.9\times10^{12}$ $R$ gates in the qutrit--qubit architecture.
Non-Unitary Quantum Butterfly Effect: Theory and Experiment
View Full Abstract
We present a generalization of the out of time order correlator (OTOC) for non-unitary systems. For a Haar-random brickwork qudit-circuit, peppered with local, projective measurement, we calculate the infinite-temperature, ensemble-average OTOC. Utilizing transfer matrix machinery, we find that the OTOC asymptotically decays exponentially and that the decay depends on the rate of measurement. In the thermodynamic limit, with sparse measurement, the OTOC approximately exhibits a Gaussian shape. Phenomenologically, this corresponds to the development of a causal scrambling front where unlike the unitary case, the signal decays in the bulk of the causal cone. We develop a Monte Carlo framework to compute the OTOC. We then estimate the OTOC directly via quantum simulation and on Quantinuum's trapped-ion quantum computer. We resolve the unitary and non-unitary OTOC phenomenology despite the presence of hardware noise. Our analytic results characterize how local nonunitary channels affect OTOC decay, providing a quantitative benchmark for the cumulative effects of a broad class of hardware noise on many-body dynamics.
Machine learning quantum data to accelerate quantum Monte Carlo
View Full Abstract
Simulating strongly correlated electrons in molecules and materials remains a central goal for quantum computing. A promising strategy uses quantum processors to prepare trial wavefunctions that guide classical quantum Monte Carlo (QMC). However, the enormous computational cost of repeatedly processing quantum measurements has severely limited the practical scalability of this approach. Here, we overcome this bottleneck by compressing quantum measurement data into machine-learning models that efficiently provide the wavefunction overlaps needed by QMC. This accelerates quantum-classical QMC by orders of magnitude, enabling chemically accurate simulations on up to 40 qubits, more than doubling the scale of previous hardware demonstrations with comparable accuracy. We demonstrate our approach on hydrogen chains and strongly correlated iron-sulfur clusters using measurements from Google's Willow processor. By enabling efficient reuse of quantum-state information on the classical coprocessor, our framework addresses a fundamental bottleneck in hybrid quantum algorithms that will persist even into the fault-tolerant era.
Accelerating Quantum-Classical Auxiliary-Field Quantum Monte Carlo with Shadow-Trained Neural Quantum States
View Full Abstract
Quantum-classical auxiliary-field quantum Monte Carlo (QC-AFQMC) uses a trial state prepared on a quantum computer to improve the accuracy of the classical AFQMC algorithm. State-of-the-art QC-AFQMC represents this state with matchgate shadows, so every trial-walker overlap and local energy must be averaged over many snapshots, making this classical computation a bottleneck. Here we distill the matchgate shadow data into a symmetry-constrained, noise-aware, autoregressive transformer neural quantum state (NQS). Used as the AFQMC trial state, the NQS evaluates overlaps, force biases, and local energies without repeatedly summing over the matchgate shadows. For a nickel-catalyzed oxidative-addition reaction, the noise-awareness of our NQS design successfully recovers the ideal-upCCD AFQMC barrier and reaction energy within statistical uncertainty, while standard QC-AFQMC execution with the same shadow data yields qualitatively inaccurate results as a result of hardware noise. Since the shadow data are needed only for training, the estimated classical cost for the nickel system falls by approximately 99% relative to our previous QC-AFQMC implementation.
Semi-Analytical Geometric Synthesis of Robust Quantum Controls
View Full Abstract
High-fidelity quantum gates are a central requirement for fault-tolerant quantum computation, yet their implementation is limited by the sensitivity of qubits to environmental noise and by control non-idealities. To mitigate these effects, quantum gates can be designed as dynamically corrected gates (DCGs), where control sequences are engineered to suppress the impact of errors on the resulting operation. Many methods in the literature are able to synthesize DCGs, but they typically rely on numerical optimization, with synthesis times on the order of minutes per gate. Here, we propose an automated semi-analytical method that reduces this cost by orders of magnitude, synthesizing smooth, robust control pulses in tens of milliseconds rather than minutes, with comparable fidelity and robustness. Our approach is based on the Space Curve Quantum Control (SCQC) formalism, where quantum evolution is mapped onto a geometric space curve whose geometric properties determine the target gate and its robustness. We parameterize the curve in the Frenet-Serret frame and employ the Pontryagin Maximum Principle (PMP) to design controls that are robust against both amplitude and dephasing errors. The PMP is formulated as a boundary-value problem and solved using a shooting method. The Frenet-Serret frame is integrated using Rodrigues' formula. Starting from a reference solution, we gradually vary the target rotation angle to construct a library of solutions, whose interpolation provides initial guesses for the shooting parameters of new target gates. We evaluated the method on 2,000 single-qubit rotations, obtaining a mean local optimization time of 39.945 ms per gate after preparation of the interpolation base. Quantum propagation yielded nominal gate infidelities below 10^-9 after virtual phase correction, with verified robustness against quasistatic amplitude and dephasing errors.
Quantum trajectory of a spin oscillator, continuous retrodiction beyond the Heisenberg uncertainty relation
View Full Abstract
The Heisenberg uncertainty relation in quantum mechanics limits the precision of predicting the outcome of measurements of any non-commuting observables. However, this restriction does not apply to retrodictive guessing of the outcomes of past measurements. Here, we experimentally demonstrate this using a spin oscillator consisting of $ 5.17 \times 10^{10}$ rubidium atoms. Through weak continuous measurements, we monitor canonical spin observables $\hat{x}_{\mathrm{A}}$ and $\hat{p}_{\mathrm{A}}$ with $[\hat{x}_{\mathrm{A}},\hat{p}_{\mathrm{A}}] = i\hbar$. By combining information obtained before and after time $t$, we retrodict the outcomes of measurements of $\hat{x}_{\mathrm{A}}$ and $\hat{p}_{\mathrm{A}}$ at time $t$ with variances that remain, concurrently over 1.4 hours, $\sim$ 1.01 dB below the bound set by the Heisenberg uncertainty relation. We also infer and demonstrate the ability to retrodict, with the same precision, the measurement outcomes for arbitrary quadratures of the spin oscillator. This brings interesting prospects for further research on quantum measurements, and for quantum-enhanced sensing that combines trajectory and entanglement strategies.
Nonuniform Time-bins for Making Raw QRNG Outputs Uniform
View Full Abstract
Random numbers play a vital role in scientific simulations and cryptography. Both randomness and security are critical requirements for random number generators (RNGs). However, classical RNGs often rely on mathematical assumptions that can compromise security, while quantum RNGs (QRNGs) face challenges, including non-uniform output due to the lack of specialized single-photon sources. In this work, we propose a QRNG model that generates uniformly distributed random numbers using a standard coherent photon source, without requiring heavy attenuation or post-processing. Although the raw data is theoretically free of bias, post-processing, if any, may be required to suppress any classical noise and device imperfections. The proposed method analytically equalizes the output probabilities under the assumed photon-arrival-time model, potentially reducing the need for heavy attenuation and post-processing to correct binning bias. We evaluate the method using real photon-detection timestamps and compare its statistical performance with conventional uniform time binning using the NIST, Dieharder, and ENT test suites. The results demonstrate improved statistical performance for the proposed binning scheme under the tested conditions.
Exponential mixing time for the Davies dynamics of the quantum random energy model
View Full Abstract
We prove exponentially slow thermalization for the quantum random energy model (QREM) under Davies dynamics. The QREM is the $n$-qubit Hamiltonian $H=ΓT+U$, where $U$ assigns independent Gaussian energies with variance equal to the system size to computational-basis configurations and $T$ is the transverse field generated by single-qubit Pauli $X$ operators. Let $β_c=\sqrt{2\log 2}$ be the freezing inverse temperature of the classical random energy model. For every inverse temperature $β>β_c$ and every transverse-field strength $0\leqΓ<Γ_c(β)$, where $e^{ββ_c}=2\cosh(βΓ_c(β))$, we show that the mixing time of the dissipative Davies dynamics associated with single-qubit Pauli system--bath couplings grows exponentially with the system size, almost surely; the bound is unchanged if the standard zero-Bohr-frequency dephasing terms are included. The result is uniform over all Davies rates satisfying detailed balance and a polynomial upper bound and does not assume primitivity. In the spin-glass phase, the Gibbs weight is carried by a sparse family of deep classical configurations that are separated by an extensive Hamming distance. A localization theorem for the QREM [Manai, Warzel, Comm. Math. Phys. 402, 1259 (2023)] transfers this geometry to the corresponding low-energy quantum eigenstates. Consequently, the Gibbs weight of the intermediate spectral sector is exponentially small, while single-qubit bath operators have exponentially small matrix elements between the two macroscopic sides of the bottleneck. A Davies-specific flux estimate then converts these two facts into an exponential lower bound on the mixing time. This gives a rigorous open-system dynamical manifestation of the frozen, localized low-energy structure of the QREM throughout its equilibrium spin-glass phase below the quantum transition line.
Effective Thermodynamics of a Volume-Dependent Qubit
View Full Abstract
We develop an effective thermodynamics for a qubit whose energy gap depends inversely on a volume-like control parameter, $Δ(V)=Δ_0/V$, where $V$ is a spectral-control coordinate rather than a literal mechanical volume. Starting from the canonical Gibbs state, we derive a complete thermodynamic structure from the Helmholtz potential and its Legendre and stability properties, including the fundamental relation $S(U,V)$, a generalized pressure conjugate to $V$, the equation of state $U=PV$, the first law, and the associated Maxwell relations. Reversible adiabats preserve the Gibbs populations and satisfy $TV=\mathrm{const.}$ and $PV^2=\mathrm{const.}$, corresponding to an effective exponent $γ=2$. The resulting effective Carnot cycle attains the Carnot efficiency, $η_{\mathrm{Carnot}}=1-T_C/T_H$, whereas the Otto cycle yields $η_{\mathrm{Otto}}=1-V_{\min}/V_{\max}$ and remains strictly sub-Carnot at finite work output. We identify the source of Otto irreversibility exactly: entropy is produced entirely during the isochoric thermalizations, and the cycle entropy production quantifies the informational mismatch between the adiabatically transported states and the reservoir-selected Gibbs states through the sum of the corresponding quantum relative entropies. Finally, we show that unitary-generated nonpassivity can act as a nonequilibrium battery, producing an apparent efficiency above Carnot when its preparation cost is omitted. At the same time, complete work accounting restores the thermodynamic bound.
Approaching quantum limits in sub-Rayleigh resolution using phase modulation optimization
View Full Abstract
Spatial-mode demultiplexing (SPADE) has made significant progress in incoherent optical imaging and has been implemented through various experimental approaches. Holography-based SPADE is widely used in proof-of-principle experiments because of its low cost, stable optical arrangement, and ease of implementation. However, its low photon utilization severely limits its practical applications. Alternating Fourier transforms and phase modulations can implement unitary optical transformations. Building on this idea, we use backpropagation to optimize the phase profiles of spatial light modulators (SLMs) and thereby design quantum measurements that are efficient in both information and energy. We study centroid--separation estimation for two incoherent point sources, using Fisher information or the estimation errors of an auxiliary neural network estimator as optimization objectives. As the number of SLMs increases, the optimized measurements approach the quantum limits characterized by the quantum Cramér-Rao bound and the information-regret tradeoff relation. With a few SLMs, our method can outperform direct imaging, showing its potential for superresolution imaging.
From maximum work to maximum power in an optimally controlled quantum Ising Otto engine
View Full Abstract
In finite-time quantum Otto engines, maximizing power requires balancing the duration of the unitary strokes against the losses from nonadiabatic excitations. We address this trade-off in an Otto engine with a free-fermion working medium, using quantum optimal control. Having determined the single-particle energy scales that maximize ideal work at fixed reservoir temperatures, we realize them as the two endpoint Hamiltonians of a transverse-field Ising chain, connected by a path that crosses the quantum critical point. Optimal control of the unitary strokes yields near-ideal work on a time scale growing linearly with system size, instead of quadratically as for linear driving. We derive a time-rescaling relation that maps protocols with different energy scales onto a single reference problem and, for complete thermalization strokes of fixed duration, use it to build an analytical model of the cycle power. The model predicts two competing maximum-power regimes: a slow branch that approaches the ideal work, and a fast, size-independent branch that trades work for a shorter cycle and dominates above a crossover size, in quantitative agreement with numerical optimal-control results. It also identifies power-optimal energy scales that differ from the work-optimal ones and further increase the power. Our results provide a predictive approach to jointly optimizing the operating conditions and finite-time dynamics of quantum heat engines.
Quantum transport of vortex electrons in bending magnets and circular accelerators
View Full Abstract
Controlling the sizes and phase structure of single-particle wave packets in accelerators remains an experimental challenge and requires understanding how bending magnets transform these states. An important example is transporting relativistic vortex electrons through the magnets to a collision point while keeping a narrow orbital-angular-momentum (OAM) distribution. We derive an effective Hamiltonian that accounts for the packet acceleration, employ it to obtain a generalized BMT-like equation, match the electron state at both magnet boundaries, and calculate the mean OAM and its variance. A half turn can reverse the mean OAM relative to the momentum while broadening its distribution, so recovering the mean does not ensure state recovery. We identify windows in packet sizes and bend angles for a small OAM spread and show that weak bends can produce narrow distributions with the mean OAM tilted relative to the momentum, making these states candidates for spatiotemporal vortices. For a few MeV electrons, we propose to use half-turn magnets that leave the mean OAM nearly antiparallel to the momentum while keeping its distribution narrow. For a circular orbit in a uniform field, the OAM variance after the exit grows as $N^2$ over $N$ turns, favoring linear accelerators, such as LINAC at JINR, for first experiments in MeV range.
Quantum Relative Entropy and Information Flux Resolve Wavefunction Collapse in Spacelike-Separated QED Waveguides
View Full Abstract
Resolving how first-order quantum coherence and definite measurement outcomes emerge from entangled vacuum fluctuations across spacelike-separated regions is unified here by the principle that quantum relative entropy governs the energy-information flux across causal boundaries [P.~Dorau and A.~Much, Phys.~Rev.~Lett.~\textbf{136}, 091602 (2026)]. We establish the exact quantum-optical realization of this principle using dual, spacelike-separated entangled nonlinear biphoton sources implemented in quantum electrodynamics waveguides pumped by an optical frequency comb and seeded by a continuous-wave laser in a coherent state $|α\rangle$. We demonstrate that single-photon-added coherent states (SPACS) generated via coherent seeding possess a quantum relative entropy that precisely quantifies the entanglement deficit between signal and idler fields. Tracing over the unmeasured idler continuum yields an exact spatial Lindblad master equation along the propagation axis, proving that spatial dephasing is driven by an information divergence flux determined by the SPACS overlap fidelity $F = |α|^2/(1+|α|^2)$. Uniting this relative-entropy flow with quotient measurement theory (detailed in Section~S3 of the Supplemental Material), we rigorously resolve nonlocal wavefunction collapse into local coset projections---explaining macroscopic state reduction without superluminal signaling. This exact open-system framework simultaneously saturates the wave-particle-entanglement triality [T.~H.~Yoon and M.~Cho, Sci.~Adv.~\textbf{7}, eabi9268 (2021)] and anchors hardware-native time--frequency Gottesman--Kitaev--Preskill stabilizers to the comb symplectic structure.
Crosstalk-Induced Row Hammer Attacks on Quantum Random Access Codes
View Full Abstract
Quantum processors remain susceptible to crosstalk-induced effects despite the continuous evolution of their underlying hardware architectures. In this work, we experimentally investigate the effectiveness of crosstalk-induced attacks across six IBM superconducting quantum processors and one IQM processor. Our results demonstrate that such attacks can be launched across all the platforms, due to persistance of crosstalk, although their effectiveness varies significantly between devices. The probability of a measurement outcome flip in the victim qubits reaches a maximum value of $60\%$. Also, it is seen that processors sharing identical coupling graphs exhibit different vulnerability profiles, indicating that connectivity alone is insufficient to predict attack efficiency. Finally, to demonstrate the practical relevance of these attacks, we study their impact on quantum random access codes (QRACs), observing a degradation in their average success probabilities.
Autler-townes energy-level engineering for high-quality all-microwave qubit gate
View Full Abstract
High-fidelity entangling gates are essential for realizing large-scale fault-tolerant superconducting quantum computing, yet existing approaches are limited: frequency-tuning techniques induce decoherence, while all-microwave-driven schemes suffer the trade-off between gate speed and leakage rate. Here, we introduce an energy-level engineering technique that employs the Autler-Townes effect to manipulate the nonlinearity of qubits without perturbing the computational subspace or degrading coherence time. This approach enables an experimentally validated, fast (97 ns) and high-fidelity (99.40(9)%) CZ gate, where error analysis reveals that gate errors arise mainly from static decoherence. The scheme facilitates fast, high-quality all-microwave gate operations with a simple topology and can be applied across various quantum platforms.
Monopoles, Scattering and Generalized Symmetries on a Quantum Computer
View Full Abstract
Quantum computers have advanced to the stage that interesting many-body quantum phenomena can be observed. A striking example is the magnetic monopole paradox, a problem that was only solved recently using the language of generalized symmetries. Here we demonstrate a quantum spin chain analogue of magnetic monopole scattering on Quantinuum System Model H2. We implement a novel protocol for preparing a localized quasiparticle wavepacket on top of the ground state. By combining this protocol with time evolution across a duality defect, we efficiently convert local particles into non-local string-like excitations. We demonstrate this particle-to-string conversion in the transverse-field Ising model and a symmetry-protected topological (SPT) phase of the cluster model. Our results establish duality defects and generalized symmetries as practical resources for preparing and probing non-local excitations on quantum hardware.
Negative non-linear differential dissipation in mechanical quartz resonators
View Full Abstract
We observe negative non-linear differential dissipation in a low-frequency (32.7 kHz) miniature quartz tuning fork, representing a high-Q piezoelectric resonator, at temperatures below 0.3 K. Similar drive-induced dissipation suppression has previously been reported in superconducting microwave resonators, and high-frequency MEMS devices, associated to coupling with tunneling two-level systems (TTLSs). In the case of low-frequency resonators, the equivalent temperature of the mechanical mode is orders of magnitude lower than the thermodynamic temperature of the device, implying that accessible TTLS states are largely saturated. We demonstrate that the observed temperature and drive dependence of the losses fit well within the framework of an interacting TTLS bath, indicating the presence of a channel for energy transfer between the mechanical mode and thermally activated TTLSs. As a possible coupling mechanism, we suggest microwave phonon modes in the metallic electrodes of the tuning fork.
Continuous variable payload transmitter for the SPOQC mission
View Full Abstract
The continuous variable (CV) quantum key distribution (QKD) scheme enables two parties to share a secret key separated by a certain distance. Here we propose, design, build, test and show results of a CV payload transmitter, intended to demonstrate downlink based QKD from a CubeSat in low earth orbit. This is part of the SPOQC mission by Quantum Communications Hub, UK which was successfully launched on March 2026.
Multirobust Control Pulses Designed by Iterative Quantum Kolmogorov-Arnold-Moser Algorithm
View Full Abstract
We introduce a multi-robust quantum control strategy designed to suppress multilevel leakage outside the computational qubit space while simultaneously ensuring robustness against unknown inhomogeneities in control parameters. It is based on a reformulation of the Derivative Removal by Adiabatic Gate (DRAG) technique which allows for the full incorporation of control pulses originally designed for two-level models by using the iterative quantum Kolmogorov-Arnold-Moser (KAM) algorithm. We apply it for optimal robust control designed by inverse optimization (RIO), referred to as RDK pulses. We analyze the performance of RDK pulses on various durations, iterations, and robustness types. We show that the two-level robustness is restored after only a few iterations with an asymptotic exponential approximation (i.e. as a superasymptotic series), even for relatively short pulse durations and that the resulting pulses are near optimal in terms of energy compared to the optimal RIO pulses defined in the qubit subspace. Such pulses are well suited for superconducting transmons as well as other forms of qubits embedded in a multi-level structure. By effectively reproducing a two-level dynamics within a multi-level system, this approach is versatile thanks to its compatibility with two-level control strategies under conditions (smoothness, duration) that are analyzed.
Constrained Quantum Imaginary Time in Krylov Space
View Full Abstract
We introduce constrained quantum imaginary time evolution (CQITE), extending quantum imaginary time evolution (QITE) to constrained-search dynamics for ground-state preparation with prescribed expectation-value constraints. A central challenge in practical QITE is constructing a compact unitary representation of the imaginary-time evolution while maintaining accuracy and controlling the approximation error. We resolve this challenge by deriving an exact characterization of the imaginary-time evolution from the Krylov space generated by repeated applications of the Hamiltonian to the initial state. This characterization induces a hierarchy of operator directions expressed through nested anti-commutators. Truncating the hierarchy produces a systematic static operator pool, with polynomial size in the system size at any fixed truncation order. The resulting construction provides a principled route to compact unitary approximations of imaginary-time dynamics. Numerical tests on spin models show close agreement with exact constrained imaginary-time evolution and small constraint deviations, while a fermionic example yields energies close to the analytic constrained-search reference.
Discrete quadrature spectrum of composite bosons: Weyl relation, intensity correlations, and binned homodyne detection
View Full Abstract
A composite boson made of two fermions can look elementary under one measurement and composite under another. In an exactly solvable paired-mode model we compare three probes: classical drives, periodically binned quadrature statistics, and intensity correlations $g^{(2)}$. The Weyl defect has an exact product formula and a controlled dilute expansion in the Schmidt moments. The binned observables are instead piecewise constant in the Schmidt weights and sensitive to single eigenvalues crossing bin edges; on the flat-spectrum ladder they converge slowly and nonmonotonically over the computed range. A spectral filter and a polar correction recover an exact Pauli algebra; a heralded joint projection then extracts a logical singlet from the vacua of two independent copies of the composite, with probability set by the accepted weight and the mixedness of the filtered reduced qubit. Finite-mode examples with Schmidt number about three succeed at the percent level despite order-one Weyl defects; near-unit $g^{(2)}$ does not control the binned algebra. For flat spectra the construction converges strongly to its oscillator counterpart, whose vacuum overlap is strictly positive at every scale; for infinite spectra with summable Schmidt amplitudes it converges at all but countably many filter cutoffs, positivity at the cutoffs studied remaining open.
Development of time-resolved fluorescence spectroscopy using heralded emission spectroscopy for organic light-emitting materials
View Full Abstract
Organic light-emitting materials are widely used in optoelectronics and bioimaging, but sometimes conventional fluorescence spectroscopy techniques can be limited by scattering, background fluorescence, photon pile-up and photobleaching. We report a quantum-spectroscopic approach using frequency-entangled, nondegenerate photon pairs generated via spontaneous parametric down-conversion with heralded detection, to perform photoluminescence lifetime measurements at low excitation intensities. We demonstrate this approach across three organic light-emitting material classes: the fluorescent dye Rhodamine 6G, an organic semiconducting conjugated polymer poly[2-methoxy-5-(2-ethylhexyloxy)-1,4-phenylenevinylene] (MEH-PPV), and a fluorescent protein mOrange. The intrinsic timing correlation between signal and idler photons enables coincidence gating that suppresses uncorrelated background counts. Across all materials and integration times of 500, 1000 and 3600 seconds, heralded detection yields signal-to-noise ratios 1.6-3.0 times higher than classical pulsed-laser excitation attenuated to match heralded photon counts in the fitting range. For MEH-PPV, this roughly halves the noise amplitude. Our measured lifetimes closely match long-integration classical pulsed-laser reference values.
Detecting Nonbilocal Correlations via Parameterized Elegant Joint Measurement
View Full Abstract
Quantum networks constitute a defining resource for quantum information processing; however, their nonclassical behavior is jointly governed by the choice of measurement basis and the independence of the distributed sources. We study a bilocal entanglement-swapping network in which the central node performs a three-parameter elegant joint measurement (EJM). For two independent Bell-state sources, we construct two binary edge observables and then derive a quantum prediction involving three parameters, which surpasses the classical constraints. In particular, the parameter θ controls both the degree of entanglement of the EJM basis states and the maximum value of the quantum prediction. These results provide an analytic and directly reproducible route for tuning nonbilocal correlations in an experimentally relevant two-source network.
Observation of Inter-Transition Interference
View Full Abstract
Many well-known quantum interference phenomena are associated with coherent superpositions of quantum states. Recent theoretical work showed that dissipative coupling between transition coherences can give rise to a distinct form of quantum interference in open quantum systems, termed inter-transition interference (ITI). Here we experimentally observe ITI through coherent microwave reflection spectroscopy of a superconducting artificial atom realized by a Kerr parametric oscillator. Using strong parametric driving, we access a regime in which two transitions become nearly degenerate and simultaneously contribute to the reflected response. The observed spectral lineshapes are not adequately captured by a model of independent transitions. By contrast, theoretical calculations that incorporate dissipative coupling between the corresponding transition coherences reproduce the essential features of the measured spectra. These results provide experimental evidence for ITI and demonstrate that dissipative coupling between transition coherences can qualitatively modify spectroscopic responses. More broadly, our work identifies transition coherences as a new arena for quantum interference in open quantum systems.
Efficient preparation of spin-squeezed states with Grover's algorithm
View Full Abstract
We propose a scheme for preparing spin-squeezed states in an ensemble of $N$ spin-$1/2$ particles based on Grover's algorithm. With only a few oracles, the scheme can exactly prepare superpositions of a few neighboring Dicke states with the Wineland squeezing parameter scaling as $N^{-1}$. The scheme requires only global rotations and Dicke-selective phase shifts, thus avoiding the need to engineer a dedicated many-body Hamiltonian for the squeezing dynamics. We further discuss the feasibility of realizing the scheme in cavity QED systems, with the phase-matched Grover iterations realized by single-photon reflection from a dispersively coupled cavity. Full-sequence scattering calculations accounting for finite photon bandwidth and loss show that appreciable spin squeezing can be achieved with high fidelity for suitable system parameters.
Separability and lower bounds of concurrence via symmetric measurement correlations
View Full Abstract
The detection and quantification of quantum entanglement is a central issue in quantum information science, particularly for unknown quantum states. Based on symmetric measurement correlation matrices, we present a family of separability criteria that can be experimentally applied without state tomography, and recover some related existing criteria as special cases. Using the constructed correlation matrices, we further derive a class of lower bounds of concurrence. Through illustrative examples, we demonstrate that our criteria outperform some existing separability criteria in entanglement detection, and that the obtained lower bounds on concurrence are tighter than known counterparts.
Using topology to reveal all mutually unbiased bases in dimension six
View Full Abstract
Mutually unbiased bases (MUBs) describe complementary quantum measurements: certainty in one basis gives no information about the others. In dimension six, triples of MUBs are known, but whether a fourth basis could exist remained unresolved for over three decades. OpenAI recently reported a proof that none exists. Here we use the topology of the space of complex Hadamard matrices, which describe transitions between MUBs, to characterize all sets in dimension six. We prove that every mutually unbiased triple belongs to a two-parameter family or is a single isolated triple built from the Fourier matrix. Since none of them extend to a fourth basis, this also proves that no four MUBs exist. Our proof rests on a new topological result that all order-six complex Hadamard matrices except Tao's form a connected space. Connectedness reduces the classification of triples to finitely many overlapping four-dimensional phase balls. We certify with interval arithmetic that these balls cover the space and for every pair of MUBs represented in a ball, we then determine all third bases that extend it. Dimension six is now the first non-prime-power dimension in which all sets of MUBs are classified.
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
View Full Abstract
Resource analyses for quantum programs commonly provide safe upper bounds on qubits, gates, or non-Clifford operations. We study a single-qubit dyadic fragment in which the deepest exact resource layer can instead be inferred exactly. Starting from the normalized-midpoint misty-state syntax, we define dyadic program states and the real cyclotomic tower $K_D=\mathbb Q(2\cos(π/2^D))$. For the projective single-qubit Clifford-cyclotomic tower $\widehat G_D\subseteq SO(3)$, we prove the relative intersection law $\widehat G_D\cap SO(3,K_d)=\widehat G_d$ for $d\le D$. Combining this descent theorem with an arithmetic-closure invariant for adaptive stabilizer processing yields $\mathrm{Fdepth}(U)=\mathrm{Adepth}(U)=\mathrm{Rdepth}(U)$: the smallest real cyclotomic field containing the Bloch matrix of an exactly synthesizable channel, the shallowest dyadic gate alphabet realizing it up to global phase, and the shallowest dyadic program-state layer sufficient for exact stabilizer-assisted implementation coincide. At that common minimum, known fixed-alphabet synthesis gives minimum primitive-rotation count. We package the result as an exact static resource effect and outline a certificate-producing compiler.
3D Printed Monolithic Optomechanical Chassis for an Unbalanced Field-Widened Interferometer
View Full Abstract
Additive manufacturing is increasingly being explored as an approach for producing complex structures for optical hardware. In this work, we present a fully monolithic optomechanical chassis fabricated using laser powder bed fusion additive manufacturing. The structure was fabricated from thermally stable Invar36, a low-thermal-expansion alloy that enables high dimensional stability under varying environmental conditions. Our monolithic design incorporates embedded optical mounts, flexures, and alignment features directly into the chassis geometry that exceed the practical limits of conventional subtractive manufacturing. By integrating the optomechanical support structure into a single compact unit, the system achieves a reduced footprint compared to traditional optomechanical assemblies. The results demonstrate the potential of additive manufacturing to produce lightweight, and highly customized optical systems, opening the possibility of new pathways for next-generation quantum sensors and optical instrumentation.
Probing gravity at megahertz frequencies with levitated rotors
View Full Abstract
The near-field gravitational interaction between masses is always thought of as instantaneous, an assumption experimentally tested only up to 1.7 kHz, where measurements yield a bounds at the $10^{-5}$ s level. We propose a near-field experiment reaching up to megahertz frequencies, in which a levitated microrotor modulates a mass quadrupole and a second rotor measures the resulting gravitational tidal field as a torque. Because the detector rotor acts as a mechanical local oscillator, the megahertz signal is downconverted to a convenient band of a few hertz, and since at fixed geometry neither the torque nor the integration time depends on the rotation rate, higher frequencies are reached at no cost in sensitivity. With parameters within reach of magnetically levitated NdFeB rotors, a signal at 2 MHz yields a torque of $2\cdot 10^{-25}$ Nm, detectable in under an hour at 10 mK. Treating a possible departure from instantaneous gravitational coupling through a field relaxation time, the measured torque could constrain it at the $10^{-8}$ s level, improving on the existing bounds by more than three orders of magnitude. As a byproduct of our analysis, we derive the sensitivity of a rotor operated as a tunable high-frequency gravitational-wave detector, finding that a noise-equivalent strain around $10^{-22}$ Hz$^{-1/2}$ could be achievable in the megahertz band.
Optimal Holding Times for Entanglement Swapping
View Full Abstract
We revisit the optimization of entanglement holding times in memory-based quantum repeaters for maximizing entanglement swapping throughput under different fidelity constraints - strict, probabilistic, and mean. We consider two heterogeneous quantum links that are equipped with single or multiple memories and differ in decoherence rates, memory capacities, entanglement attempt rates and success probabilities, as well as classical communication latencies. Efficient models are developed to estimate the expected entanglement throughput and the probability density functions of the conditional wait time to swap. The models are then used to satisfy different fidelity requirements by optimizing the maximum holding times for the two links. Finally, our proposed model and approach are validated with a discrete-event quantum network simulator.
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
View Full Abstract
Quantum algorithms for molecular response functions have mostly been studied one route at a time, most prominently the indicator-binning algorithm of Kharazi et al. We compare six routes within one accounting framework and state the conversions between their resource calibers. On the resolvent route the Lorentz-broadened spectrum is exactly a resolvent expectation; at finite gamma two boundary terms, a reversal term and a permanent-dipole pseudo-line, enter a disjoint error budget. Because the kernel subnormalization is exactly 1, the published binning accounting carries a removable Theta(alpha+1+omega) factor (49.69x and 7.75x at the definitional caliber), a correction that applies to both routes. Estimating the square root of the kernel amplitude lowers the readout cost from beta^2/mu_tilde_2 to beta/sqrt(mu_tilde_2). On the time-domain route we prove a single-point amplitude-estimation theorem and convert the generalized QPE of Loaiza et al. to the same accounting. The lower bounds are Theta_tilde(1/gamma) for parameter location, Theta(1/(gamma epsilon)) for windowed values, Omega(n/gamma) inside a restricted correlation-sampling class, and Omega(1/(epsilon gamma^2)) on the Lorentzian object; in the single-circuit-resolution caliber, gamma^(-n) is a grid-coverage artifact. Six routes, their calibers, an n=2 assembly with a component-grade coherence, and a phase diagram over the tested ensembles form one accounting map.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
View Full Abstract
Choosing a quantum error-correcting code for a real device means scoring candidates with circuit-level simulations so slow that only a few hundred can be run. So every evaluation counts, and a search is judged by how many good codes it finds per paid evaluation. Quantum LDPC codes built from a few group elements protect many logical qubits, but good ones are rare in a huge space. We introduce GFlowQEC, to our knowledge the first generative flow network (GFlowNet) for quantum code design. It builds a code one group element at a time and learns to propose codes in proportion to a power of their score. We train it once on scores from earlier searches, freeze it, and let it propose lifted-product codes with 180 physical qubits, scored by their distances. Ranking ten of its draws per paid call, it finds more than twice as many new top-scoring codes (inequivalent to any it was trained on) as tuned parallel tempering, even when tempering starts from GFlowQEC's training codes. It finds more than three and a half times as many as a supervised screen ranking ten random candidates per call. When both rank a hundred, the screen beats GFlowQEC, and does best ranking GFlowQEC's draws. Soft Q-learning, which shares the GFlowNet's optimal policy, does as well at one noise bias and better at the other, so the gain does not depend on the GFlowNet's training loss. Trained proposers can make a budget of expensive evaluations go further when good codes are rare.
Linear-time erasure recovery for quantum expander codes
View Full Abstract
Erasures are used to model faults at a subset of known locations in various platforms used to construct fault-tolerant quantum computers. Beyond the utility in erasure recovery, efficient decoders for erasures are useful to both understand error decoders and as a subroutine for error decoding. Classical expander codes, which belong to the family of low-density parity-check (LDPC) codes, can be equipped with the Peeling decoder which works in linear time. Our main result is the algorithm Small-Set-Peeling, a quantum generalization of the classical Peeling decoder for erasures, that applies to quantum expander codes (Tillich, Zémor, IEEE T-IT 2013; Leverrier, Tillich, Zémor, FOCS 2015). This decoder can correct up to $D-1$ erasures, where $D$ is the (design) distance of the code and, importantly, is the first decoder that is guaranteed to do so in linear time. Combining with the erasure-conversion algorithm Small-Set-Find (Krishna, Livni-Navon, Wootters, SODA 2024), our result also implies the existence of a novel graph-local linear-time decoder for Pauli errors.
Finite-temperature transition-window weights on a fault-tolerant quantum computer: duplex filtering on a thermal purification
View Full Abstract
The excite-filter-readout framework of Kharazi et al. computes zero-temperature response windows on a fault-tolerant quantum computer from a pure ground state. We extend it to Gibbs states, where the two objects decouple: filters act on absolute energies, a thermal response on transition frequencies. The extension rests on a Liouville-space/TFD identity, explicit in the block-encoding/QSP setting: the thermally weighted transition-window weight is a spectral projection of H_0 (x) I - I (x) H_0^T onto the Schmidt (thermofield-double) purification, instance of Rall's framework. Around it we assemble a routed-SELECT block encoding (one Hamiltonian query per filter query), a conjugate-pair readout, and a four-route (duplex, bin, Fourier-LCU, METTS) compatibility analysis. The cost is multiplicative and conditional: a per-window query bound M_"AE" * (2*sqrt(d/Z_"lb")*d_"vt" + 4*d_W), with a tight signal-adaptive count, the optimal sqrt(alpha beta) degree, and a window-edge term. The preparation factor sqrt(d/Z) grows exponentially with system size at fixed temperature in positive-entropy-density systems (2.08 -> 25.7, N = 8 to 14 at beta = 2), relieved only as beta -> 0. Zero temperature is recovered for beta G >= ln(2(d-1)||D||^2/epsilon). Identities are cross-checked between independent formula paths to 10^(-16)-10^(-12) and the readout assembly is validated at matrix level under a block-encoding promise.
Resource-efficient formulations of the Knapsack problem for quantum computing
View Full Abstract
Quantum computing has emerged as a new tool for solving combinatorial optimization problems. Quantum optimization approaches usually operate on the subclass of Quadratic Unconstrained Binary Optimization (QUBO) problems. Many optimization problems can be reformulated in this form, though there are often multiple ways to do so. The choice of formulation can considerably affect the performance of QUBO solvers in practice. In this work, we study QUBO formulations of the Knapsack problem, a canonical example of a problem with inequality constraints. In the standard formulation these constraints are converted into penalty terms, which requires additional slack variables. Here, we investigate three more resource-efficient approaches for formulating the Knapsack as a QUBO. The first two modify the standard formulation, either by deriving a smaller penalty constant or by reducing the number of slack variables. The third approach is a wholly different method, which avoids the use of slack variables entirely. All three approaches increase the probability of finding the optimal solution, both in simulations of the linear ramp Quantum Approximate Optimization Algorithm (LR-QAOA) and on a D-Wave quantum annealer. The slackless method performs best, increasing success probabilities by several orders of magnitude even for relatively small problem sizes.
Entanglement Entropy in Non Relativistic Collisions
View Full Abstract
We study numerically the build-up of entanglement entropy between two colliding, non relativistic particles, that are driven by the plain Schrödinger equation containing local, finite range potentials, and whose initial state is the product of two independent wave packets. Different situations are considered, ranging from a tunnel and mirror effect at low energy in front of a barrier, to higher energies, and also attraction rather than repulsion. While the calculated wave functions and density matrices significantly depend on the physical situations described by our models, the build-up trends and values in time of entanglement entropy look surprisingly alike one another.
Non-compact Kogut-Susskind gauge theories: 1D lattice models with exact ${\rm SL}(2,\mathbb{R})$ gauge invariance
View Full Abstract
The Kogut-Susskind (KS) formulation of gauge theories constructs quantum many-body Hamiltonians with gauge invariance under a compact Lie group exactly implemented on a spatial lattice. Here, we revisit this construction for a non-compact gauge group. Although motivated in part by theories like general relativity whose first-order formulation involves the non-compact Lorentz group as a local symmetry, we focus on simpler cases in one spatial dimension akin to the Schwinger model. In a bottom-up approach, we show how exact gauge invariance under the simplest non-compact Lie group ${\rm SL}(2,\mathbb{R})$ can be retained exactly on a 1D lattice, and highlight the differences that arise with respect to compact gauge groups, including a continuous spectrum of the Casimir operators of the gauge fields and the emergence of infinite-dimensional representations of the matter fields. For the pure gauge theory, we discuss how a consistent restriction to the positive semigroup ${\rm SL}^{+}(2,\mathbb{R})$ reproduces well-known results from the quantization of Jackiw-Teitelboim (JT) gravity. Motivated by the constraint structure of general dilaton gravity, we introduce static charges coupled to the non-compact gauge field, which can be realised by single-fermion degrees of freedom living in an additional, synthetic dimension. With static charges our lattice model remains exactly integrable, but when extending to dynamical fermionic matter, we arrive at an interacting 1D ${\rm SL}(2,\mathbb{R})$ KS gauge theory. We give an interpretation of this model as a chain of charges sequentially connected by strings whose tension pulls matter left or right depending on the sign of the relative continuous ${\rm SL}(2,\mathbb{R})$ fluxes. This picture becomes exact when the involved ${\rm SL}(2,\mathbb{R})$ charges are strongly self-interacting, where we solve the reduced two-body problem analytically.
Near-Quantum-Limited Readout for the Princeton Axion Search using a sub-GHz Kinetic Inductance Traveling Wave Parametric Amplifier
View Full Abstract
Parametric amplifiers are a workhorse for near-quantum-limited measurements above 1 GHz. However, amplifier development has been more limited below 1 GHz. We present a kinetic inductance traveling-wave parametric amplifier (KI-TWPA) operating over 300-700 MHz, with gain exceeding 30 dB and pump powers of a few hundred nanowatts. The system noise performance, as measured by a variable-temperature noise source, is 2.5-3.5 quanta. This device is a versatile new tool for precision measurements of sub-GHz signals, with applications including readout of semiconductor spin qubits, superconducting detector arrays, and searches for new physics beyond the Standard Model. We characterize aspects of the amplifier performance relevant to axion searches, including gain drift, compression point, amplifier noise at various operating temperatures, readout with an input circulator, and magnetic field insensitivity.
A Quantum Lower Bound for Triangle Finding
View Full Abstract
Triangle finding is a fundamental problem in graph theory that has played a central role in the development of quantum algorithmic techniques. For $N$-vertex graphs given by their adjacency matrices, a long line of work has improved the quantum query upper bound from $O(N^{3/2})$ to $O(N^{5/4})$. However, the best known lower bound has remained the elementary $Ω(N)$ bound obtained from unstructured search. We prove the first superlinear quantum query lower bound for triangle finding, showing that $Ω(N^{13/12})$ queries are necessary. Our result also implies the same lower bound for triangle detection and for detecting every fixed connected non-bipartite graph. The proof builds on the compressed oracle approach of Zhandry and the transfer approaches of Belovs. It compares the computation on graphs with a planted triangle to the computation on random graphs conditioned to be triangle-free, through a map on the input registers that almost commutes with every query. We average over local changes to the input while preserving its distribution, through a procedure known as conditional resampling. Our main technical contribution is a set of estimates that let us control the query error under this averaging, despite the dependence introduced by conditioning a dense graph to be triangle-free.
Solving a non-abelian hidden subgroup problem on a trapped-ion quantum computer: the power of the measurement basis
View Full Abstract
The hidden subgroup problem (HSP) unifies many of the best-known quantum speed-ups. For abelian groups it is solved efficiently by weak Fourier sampling, but for non-abelian groups, which include the cases relevant to graph isomorphism and lattice-based cryptography, the right measurement basis is crucial and often unknown. We experimentally study the HSP over the $q$-hedral groups $\mathbb{Z}_q \ltimes \mathbb{Z}_p$, which interpolate between the dihedral and affine groups and mark a boundary between instances that are efficiently solvable and those that are only information-theoretically solvable. On the IonQ Forte trapped-ion quantum computer, with $p \le 7$, we implement weak Fourier sampling, strong Fourier sampling in an adapted basis, strong Fourier sampling of adjacent pairs, and forgetful abelian sampling. We demonstrate that the theoretical predictions of Moore, Rockmore, Russell and Schulman survive on a noisy device: weak sampling reveals nothing about the hidden subgroup, the adapted basis succeeds for large $q$, adjacent pairs succeed for small $q$, and forgetful sampling saturates below unit success. For $p=7$, $q=6$, the hardware exceeds the success probability of an exhaustively optimised classical algorithm for up to three oracle queries.
Phase-Locked Quantum Battery Charging via Dissipative Mode Selection
View Full Abstract
We investigate how dynamical instability and reservoir engineering can be harnessed to enhance the quality of quantum-battery charging in a bosonic two-mode system. We show that reservoir-engineered dissipative coupling selectively amplifies a single unstable quasi-dark mode, enabling phase-locked exponential charging at a reduced gain threshold, whereas coherent coupling can amplify two frequency-split unstable modes, resulting in persistent beating. This dissipative mode selection yields a near-unit ergotropy fraction and a substantially higher work-like signal-to-noise ratio (SNR), defined as ergotropy divided by the standard deviation of battery energy. Although optimizing the driving frequency enables coherent coupling to achieve faster charging and higher ergotropy power, dissipative coupling retains its advantage in the work-like SNR. An exact finite-time source-noise relation reveals that this advantage arises from a more constructive accumulation of coherent driving relative to incoherent fluctuations. Our results establish dissipative mode selection as a promising route to high-quality quantum-battery charging.
QASPA-MaxCut on Unweighted Graphs: Edge Encoding and QAOA Restarts
View Full Abstract
Max-Cut is a common testbed for near-term quantum optimization because it has a simple Ising Hamiltonian, established classical baselines, and a parameterized quantum circuit whose performance depends on the outer classical optimizer. This paper develops QASPA-MaxCut, a shift-phase circuit for Max-Cut that encodes graph edges through controlled $R_y$ rotations of the form $\mathrm{CX}_{ij}R_y(θ_{ij})\mathrm{CX}_{ij}$. We derive the exact two-qubit algebra of the edge block, trace an unweighted four-vertex example, and compare one-layer QASPA-MaxCut with depth-one QAOA by exact state-vector simulation. The protocol uses seed 42, evaluates connected backbone-augmented random graphs with additional-edge probabilities $p_{\mathrm{edge}}\in\{0.1,0.3,0.5,0.7\}$, and adds nineteen custom unweighted topologies. The QASPA-MaxCut score is reported after the algorithm's classical selection stage: the four leading QASPA bit strings are evaluated by the Max-Cut objective, and the best cut is retained. The QAOA score is the expected approximation ratio after local optimization, reported as a best-of-$k$ curve over one to ten restarts. In these small exact simulations, fixed-angle QASPA-MaxCut produces reported group-mean selection ratios between $0.955$ and $1.000$, the topology-level readout is unchanged in the retained finite-shot checks under the rule $\lceil 0.03047\cdot 2^n+1016.2\rceil$, and depth-one QAOA improves with additional classical restarts while remaining lower than the QASPA selection score in the reported mean summaries. This comparison motivates further study of the classical search budget needed to obtain competitive Max-Cut samples at shallow circuit depth.
Experimental activation of hidden metrological steerability in quantum channels via stochastic filtering
View Full Abstract
Quantum steering-assisted metrology allows a trusted party (Bob) to improve local phase estimation by exploiting classical information communicated by an untrusted party (Alice). In realistic scenarios, however, the channel is subject to noise that degrades steerability and suppresses the associated metrological advantage. Here, we demonstrate that stochastic pre- and post-filtering operations can revive the violation of the metrological steering inequality (MSI) in phase-covariant amplitude-damping channels where it is initially absent, thereby activating a hidden metrological steerability and restoring their usefulness for quantum metrology. Specifically, the critical damping parameter beyond which the MSI violation is suppressed is raised from $γ_c \approx 0.5$ to $γ_c \approx 0.75$ for the largest filter strength considered. We verify this in a photonic experiment, where polarization qubits carrying the encoded phase are transmitted through an amplitude-damping channel implemented with a two-path Sagnac interferometer, and the stochastic operations are realized with glass plates at the Brewster angle. By tuning the filter strength and scanning the damping parameter over its full range, we observe the revival of the MSI violation, obtained at the cost of a reduced success probability inherent to the stochastic nature of the filtering operations. Our results establish that metrological utility and steerability can be activated through stochastic operations even when these properties are absent in the original noisy channel, extending filtering-based activation from witnesses of nonclassicality to a certified and operationally quantified metrological advantage.
Flux Crosstalk Calibration from Zero Knowledge to High Precision in Fully Tunable Superconducting Circuits
View Full Abstract
Precise and independent flux control is essential for scalable superconducting processors built from frequency-tunable qubits and couplers, but flux crosstalk undermines it. Conventional calibration methods rely either on dedicated readout channels, which tunable couplers typically lack, or on readout schemes requiring extensive prior spectroscopy of the qubit and coupler. We demonstrate two independent methods that characterize coupler flux crosstalk without directly driving or measuring the couplers. The first method is zero-knowledge characterization, which exploits intrinsic coupler-resonator coupling to yield rapid and accurate estimates with no prior qubit or coupler spectroscopy, accelerating large scale bring-up. The second method is symmetric branch cancellation, which isolates crosstalk from other dispersive effects allowing for quantifying with high precision. Combined with an improved iterative procedure, these methods suppress residual coupler crosstalk below $5\times10^{-5}$, providing a complete route from zero-knowledge initialization to high-precision crosstalk characterization in fully tunable architectures.
Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method
View Full Abstract
Solving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum solvers because their structured discretizations can enable efficient linear-algebra operations while providing rapid convergence. Their quantum implementation, however, requires an efficient transform between amplitudes encoding function values and amplitudes encoding expansion coefficients. This work develops two key components of a quantum spectral method. First, we construct the quantum ultraspherical transform (QUT) for orthonormal ultraspherical polynomials, a basis that supports sparse and well-conditioned discretizations of differential equations. For the basis parameters $m=0$ and $1$, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer $m\geq2$: for dimensions $N$ with $N+m=2^n$, where $n$ is the number of qubits, the QUT achieves error at most $\varepsilon$ using a gate count polynomial in $n$ and $\log(1/\varepsilon)$. The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of $N$. Second, we develop a quantum spectral solver for regular linear ordinary differential equations based on the QUT. Under suitable boundary conditions and data-access assumptions, preconditioning keeps condition numbers bounded independently of the basis size, allowing the solution state to be prepared at polylogarithmic cost in system size and inverse error. Together, these contributions provide a framework for quantum spectral methods with the potential to solve linear differential equations efficiently.
Precision Limits and Non-Gaussian Advantage in Optical Phase Estimation under Preparation Constraints
View Full Abstract
In optical quantum metrology, the scaling of the quantum Fisher information (QFI) with the mean photon number is a standard benchmark for relating precision to probe resources. For phase estimation, Heisenberg scaling corresponds to a quadratic growth of the QFI with the mean photon number, which Gaussian probes can approach. Interestingly, certain non-Gaussian probes can exhibit arbitrarily large QFI even at fixed mean photon number. Here, we clarify the resource requirements underlying this behavior by introducing a constraint that separates physically admissible states from inadmissible ones: an envelope on the photon-number distribution that arises naturally from the physical limitations of state-generation methods. Building on this constraint and considering pure single-mode probes, we define a resource quantity, $N_\mathrm{RMS}$, fixed by the preparation constraints, and derive a finite bound on the QFI whose Heisenberg scaling is attainable. We identify a genuine metrological advantage of non-Gaussian states over Gaussian probes subject to the same constraints. Finally, we illustrate these results with an optical preparation model based on a universal gate set.
Noise-regularized training of quantum circuit Born machines under a finite shot budget
View Full Abstract
Quantum circuit Born machines (QCBMs) can learn distributions that are hard to sample from classically, but their value depends on generalizing from finite training data. Here, we study how hardware noise affects this generalization. We show that, for any noise process, the generalization gap of a QCBM trained with the maximum mean discrepancy is bounded by the complexity of the distributions the noisy model can reach. Scrambled local Pauli noise contracts this complexity but biases the model towards the uniform distribution, so residual noise acts as a regularizer whose optimal strength can be intermediate. We propose GENIE, a framework that realizes a chosen noise level with capped error mitigation and selects it during training from held-out data within a fixed execution budget, with provably bounded regret. In simulations on synthetic and census data, GENIE stays close to the best of four noise-control strategies, whereas every fixed noise level falls short in many settings.
A Counterexample to the Weak Gibbs and Regularity Conjectures
View Full Abstract
We provide a counterexample to the weak Gibbs and regularity conjectures. The example is a spin-one system on the square lattice with a translation-invariant nearest-neighbor interaction. At high temperatures and high on-site field strengths, it has a unique KMS state that does not have the weak Gibbs or regularity properties.
Cryogenic suppression of correlated loss in Rydberg atom arrays
View Full Abstract
Blackbody radiation (BBR) poses a central challenge for quantum science with Rydberg atoms. By driving transitions to nearby opposite-parity states, BBR shortens Rydberg lifetimes and has long been suspected to trigger "avalanche" events known to cause correlated atom loss. Here, we suppress avalanche decay and establish BBR as its dominant trigger using a Rydberg atom array that operates either cryogenically or at room temperature. A $45~\text{K}$ radiation shield reduces ambient BBR, extending Rydberg $nS$ lifetimes for $n$ ranging from 50 to 75. BBR-induced decay rates are suppressed by 30%-50%, corresponding to an effective blackbody temperature $T_{\rm eff}\approx190~\text{K}$. This enables controlled comparisons of Rydberg-dressed atom arrays operating in different BBR environments. Arrays of up to 70 atoms demonstrate cryogenically suppressed avalanche rates, tracking the suppression in BBR-induced decay, for both $n=50$ and $n=60$ dressing. A parameter-free rate model agrees with the measured avalanche rates after accounting for frequency-dependent cryogenic shielding, photoionization-triggered avalanches, laser phase noise, BBR decay channels, and Rydberg interaction effects. We demonstrate a quantitative description of avalanche decay and show that improved BBR shielding should further suppress correlated loss to the $T_\text{eff}=45~\text{K}$ achievable in the current apparatus. Our results establish a route to mitigating correlated errors that otherwise impede fault-tolerant operation in neutral-atom quantum processors.
Discovering correlated error mechanisms: data-driven augmentation of detector error models improving decoding
View Full Abstract
Accurate decoder priors are essential for high-performance quantum error correction. Theoretical noise models inevitably omit physically relevant error mechanisms, most notably correlated errors, which appear consistently in experimental error budgets yet are absent from standard models. We introduce a data-driven method for augmenting detector error models (DEMs) by discovering entirely new error mechanisms directly from experimental detector-firing statistics, going beyond most existing approaches that merely refine the probabilities of already-known mechanisms. Our method generates candidates by combining pairs of existing mechanisms as building blocks, then filters and validates them using pairwise and higher-order detector correlations. Crucially, this construction provides each newly discovered mechanism with a well-defined logical effect derived from the constituent error mechanisms, enabling its direct use in decoding. Furthermore, each mechanism is accompanied by a natural decomposition into lower-order components, preserving compatibility with the original decoder. This is particularly valuable in settings that rely on correlated graph-based decoders such as correlated matching. We evaluate the method on surface-code simulations with correlated noise and correlated-matching decoding, demonstrating that, in a realistic near-term noise scenario, DEM augmentation increases the Lambda parameter by 20% across code distances 7-15 and reduces the logical error rate by 75% at code distance 15 relative to the unaugmented DEM. On experimental data from Google's superconducting device, the augmented DEM increases the Lambda parameter by 9% across code distances 5-7 and yields a reduction of 14% in logical error rate over the baseline for distance 7. To our knowledge, this is the first data-driven DEM augmentation method that produces decomposed hyperedges with assigned logical effects.
Compatibility of Pauli Observables
View Full Abstract
Given an arbitrary finite family of Pauli observables, how sharply can they be approximated by a single measurement? We derive an exact state-space correspondence that characterises the resulting sharpness tradeoffs, establishing a link between incompatibility and preparation uncertainty. In particular, suitable ensembles of quantum states determine the full compatibility region and generate explicit parent measurements through Pauli conjugation and classical randomisation. The compatibility region depends only on the anti-commutativity graph and determines all nonuniform tradeoffs under standard noise models, including depolarising, probabilistic and generalised noise. We show that optimal sharpness tradeoffs are determined by spectral problems for signed Pauli Hamiltonians, whose ground states supply the seeds for optimal parent measurements. The correspondence also shows that magic is necessary to attain the full compatibility region of every noncommuting Pauli family. We quantify the resulting sharpness advantage and relate it to the reduced robustness of magic. Finally, we apply the framework to several structured Pauli families, obtaining exact compatibility characterisations and explicit optimal parents.
Thermodynamics-Informed Learning Captures Hierarchical Hydrogen-Bond Networks in Deep Eutectic Solvents
View Full Abstract
Deep eutectic solvents (DESs) offer a tunable platform for lignocellulose refining, but their solvation behavior depends on multicomponent hydrogen-bond networks rather than individual constituent properties. We develop TiNN, a thermodynamics-informed neural network that hierarchically represents HBA-HBD association and solute accommodation through a learned free-energy pathway. Trained on 938 records, TiNN achieves a test-set $R^2$ of 0.917 and generalizes to new HBA-HBD combinations and sparse conditions. Ablation identifies solute-specific stabilization as the largest contributor to prediction accuracy, while the importance of hydrogen-bond compatibility depends on the dissolution mechanism. Experimental measurements of glucose, xylan, and Kraft lignin in acidic, basic, and neutral DESs show that TiNN reduces the geometric mean solubility error from more than 23-fold with COSMO-RS to approximately 1.5-fold. Without training on fractionation data, TiNN also distinguishes DES formulations with high and low lignin and hemicellulose removal from corn stover. These results support chemically grounded solvent screening for lignocellulose fractionation.
Equivalence of Correlated Catalytic and Marginal Asymptotic Transformations in Quantum Resource Theories
View Full Abstract
We prove that correlated-catalytic state conversion is possible if and only if the marginal asymptotic conversion rate is at least one. Under general operational assumptions, this equivalence holds for arbitrary states in broad classes of entanglement, coherence, and magic theories. It reduces the characterization of correlated-catalytic convertibility to the computation of marginal asymptotic rates, and yields transitivity and equality of catalytic and marginal conversion rates. Under local operations and classical communication, we fully characterize correlated-catalytic conversion from arbitrary bipartite states to entangled pure states in terms of distillable entanglement. We show that correlated catalysts cannot increase the distillable entanglement or distillable secret key of any bipartite state, and in particular cannot make bound entanglement distillable. Extending our construction to adaptive communication protocols, we further prove that correlated catalysts cannot enhance the two-way private-state generation capacity of any finite-dimensional quantum channel.
Parrondo's paradox for three discrete-time quantum walks with distinct shift operators
View Full Abstract
Parrondo's paradox describes a surprising phenomenon in which certain combinations of biased quantum walks result in an unexpected reversal of their bias direction. To date, research on this effect has predominantly focused on one-dimensional discrete-time quantum walks that employ fixed sequences of two or three quantum coins, paired with a single shift operator. In this work, we first introduce a wide class of unitary shift operators which allow for three movement options (left, right or stay in place) of a walker in one time step, and we then demonstrate that Parrondo's paradox can also arise with a single coin and three distinct shift operators. Furthermore, we investigate how this paradox influences the time evolution of quantum entanglement between the walker and the coin in such quantum walks.
Spectral properties of twisted soft waveguides
View Full Abstract
We discuss a model of a soft waveguide described by Schrödinger operator whose potential is a twisted straight channel of non-circular profile. We show that a compactly supported twist makes the operator subcritical, the property being expressed in terms of a Hardy-type inequality. On the other hand, a periodic twist raises the essential spectrum and its local slowdown may give rise to isolated eigenvalues below the essential spectrum threshold.
A Tensor-Network Chebyshev--Galerkin Method for Boundary-Value Problems in Computational Mechanics
View Full Abstract
Quantum-inspired numerical methods for partial differential equations represent discretized fields and operators as quantics tensor trains (QTT), so that their cost depends on how compressible the problem is rather than on the number of unknowns. Global spectral formulations in this setting have so far relied on Fourier bases, restricted to periodic problems, or on collocation, which does not preserve the variational structure exploited by tensor-network solvers. We introduce a QTT Chebyshev--Galerkin method that assembles and solves global spectral systems directly in compressed form, without forming the underlying arrays. Starting from the weak formulation, the method handles coupled elliptic systems with variable coefficients, smoothly mapped geometries, and mixed Dirichlet--Robin boundary conditions, and yields symmetric positive-definite systems suited to variational tensor-network solvers. Parameters and random inputs enter as additional coordinates, so the same construction returns the solution over an entire parameter space in a single solve. In linear elasticity, the method retains spectral convergence and reaches errors below $10^{-8}$ on a three-dimensional benchmark, beyond those attained by QTT finite differences and Q2/Q4 FEniCSx finite elements over the tested range. A six-parameter cantilever design study covering $1.7\times10^{7}$ designs is solved in a single 92~s run, and a stochastic problem with ten random coordinates is represented with $2.4\times10^{6}$ times less memory than its full coefficient array.
Stability of energy gap of macroscopic quantum matter
View Full Abstract
In quantum many-body physics and quantum field theory, it is often assumed that gapped systems remain gapped under sufficiently weak local perturbations. However, to what extent this assumption holds is elusive, except for some special systems. In this work, we examine the stability of energy gap of macroscopic quantum matter that is only subject to two physically natural conditions, locality and translation invariance. We first show that in any spatial dimension, there are gapped local Hamiltonians with a unique ground state and an unstable gap, i.e., they become gapless under certain arbitrarily weak local perturbation in the thermodynamic limit. We then prove that for both spin and fermionic systems in one dimension, such Hamiltonians with an unstable gap must not only break translation invariance but also be fine-tuned. We further show that in any dimension greater than one, there are fine-tuned local translation invariant Hamiltonians with a unique ground state and an unstable gap. These results greatly sharpen our understanding of the fundamental problem of the stability of quantum phases of matter. We also discuss implications of our results on, for example, anyon superconductivity and higher-form symmetries.
A Variational Quantum Algorithm for Multi-Skill Project Scheduling
View Full Abstract
Job scheduling is an NP-hard optimization problem with clear industrial relevance. In practice, distributing work across a team is not only about meeting deadlines or improving productivity; it also affects fatigue, stress, and employee well-being. Variational Quantum Algorithms (VQAs) provide a promising way to address these problems through QUBO formulations, although their scalability on near-term NISQ hardware is still limited by Hilbert-space growth and barren plateaus. In this work, we simulate a VQA for a realistic Multi-Skill Resource-Constrained Project Scheduling Problem (MS-RCPSP), including worker capacities, skill matrices, task priorities, deadlines, and calendar stability during rescheduling. To keep the problem within a near-term circuit size, we use a temporal batch decomposition that solves one day at a time, propagates the remaining workload, and combines it with a logarithmic binary encoding that keeps every batch at or below 30 qubits. Because the ground state of a QUBO Hamiltonian is a computational basis state, entanglement is not required to represent the solution, raising the question of whether it helps or hinders ansatz training. We address this question by comparing the linear and brick-wall entangling topologies of a hardware-efficient ansatz with an entanglement-free reference that has the same number of parameters and by training every configuration with COBYLA and with Adam using SPSA gradient estimation. For the instance and initialization studied, the entanglement-free reference produced feasible schedules under both optimizers. With COBYLA, it produced the feasible schedule closest to the required workload at a fraction of the simulation cost of the entangled topologies, indicating that entanglement did not improve the solutions found by the VQA.
Quantum Advantage needs Multiple Perspectives
View Full Abstract
The origin of the quantum speedup is a topic of ongoing research. We propose a logical criterion for the possibility of a speedup within the continuous-variable and odd-prime qudit settings. There, Wigner function nonnegativity signals the possibility of efficient classical simulation in the state-injection scenario. We consider representations of quadrature/Weyl measurements in a single von Neumann algebra that reproduce the Born statistics in a particular state. If in that state, the set-theoretic universe of the algebra is ZFC-satisfiable, i.e. every ZFC-theorem holds with unit probability, all measurement contexts can be represented in a single commutative algebra of `beables'. Furthermore, the statistics admit a noncontextual hidden variable model, ensuring Wigner nonnegativity for two or more modes or qudits. For a single mode, a stronger notion of linear representation ensures commutativity, and with it, ZFC-satisfiability independently of the state, as well as Wigner nonnegativity. In consequence, in any setting that cannot be efficiently simulated, it must be impossible to merge the models associated with every context into a single ZFC-satisfiable one: quantum advantage needs multiple perspectives.
Quasi-Normal Modes and thermalization in integrable Quantum Field Theories from the Thermodynamic Bethe Ansatz
View Full Abstract
We propose a Thermodynamic Bethe Ansatz (TBA) approach for describing thermalization in integrable quantum field theories. The exponential damping and oscillations when approaching thermal equilibrium can be understood as the analogs of quasi-normal mode (QNM) frequencies of black hole perturbations within the framework of holography. Holographic intuitions and some general properties of thermal Green's functions motivate the existence of such a TBA formulation, as well as lead to the imposition of a nonstandard analytical structure on the QNM TBA, while comparison with integrable form-factor expansions fixes the remaining ingredients. We conjecture the QNM TBA to be equivalent to performing an all-order resummation of secular terms in a thermal form factor expansion of retarded 2-point correlation functions. We compare the predictions with tensor network simulations of the E8 deformation of Ising CFT at nonzero temperature. We conjecture that the QNM TBA framework should also be applicable for describing out-of-equilibrium approach to Generalized Hydrodynamics (GHD).
Universally Certifying Partially Self-Correcting Quantum Memories in 3D Translation-Invariant Stabilizer Codes
View Full Abstract
Achieving passive protection of quantum information at finite temperature is a central problem at the intersection of quantum information and quantum many-body physics. Yet a general, computable criterion for determining self-correcting behavior directly from the form of local interactions remains elusive. Here we develop a unified algebraic-geometric framework for certifying partial self-correction in three-dimensional translation-invariant local stabilizer codes, encompassing the cubic code as a special case. From the algebraic curves defined by the codes' defining polynomials, we construct valuation matrices on the boundaries of their normalized projective closures and derive a computable rank criterion. Together with a polynomial-time decoder, this criterion guarantees super-Arrhenius memory lifetimes for code families satisfying it under the specified local Davies dynamics. We apply the framework to certify several classes of partially self-correcting quantum memories, including nearest-neighbor models with stabilizer weight as low as six and long memory lifetimes at modest system sizes. These results establish an algebraic-geometric connection between local stabilizer structure and the recoverability of quantum information at finite temperature, providing a systematic approach to certifying and designing passive quantum memories.
Beyond the Gap: What Imaginary-Time Evolution Reveals About the Edge of the Continuum
View Full Abstract
The spectral gap, the energy separating the ground state from the first excitation, governs many quantum phenomena, yet it is far harder to compute than the ground state. We propose a mathematically rigorous method for extracting the gap from imaginary-time evolution in infinite-dimensional Hamiltonians, where the first excitation typically marks the edge of a continuous spectrum. We show that a gap is not automatically detected: detection depends on how the initial state and observable couple the ground state to excitations at the bottom of the continuum. When this coupling follows a power law, the gap is recovered together with a logarithmic correction whose coefficient yields the exponent of the spectral density near the edge of the continuum, which reflects the physics of the excitations. We confirm both predictions numerically for an exactly solvable model. Our results offer a new numerical approach to many-body quantum physics, in which both the gap and the threshold exponent are obtained merely at the cost of a ground-state calculation.
Helium States in a CAS(2,2) Subspace Inspired by Quantum Photonics
View Full Abstract
We present a four-mode Fock-state photonics implementation of the variational quantum deflation (VQD) algorithm to calculate the ground-state and excited-state energies for the neutral helium atom in a CAS(2,2) Subspace. Its CAS(2,2) electronic Hilbert space is encoded into a bosonic Fock-space representation and subsequently optimized using a continuous-variable quantum circuit. The circuit architecture under study is constructed of single-mode phase shifts, beam splitters, and cross-Kerr interactions. The variational circuit is initialized in the Fock state $\ket{1100}$ and its performance is benchmarked against exact diagonalization of the active-space configuration-interaction (CASCI) Hamiltonian. We also extend the method to optimize from the first to three excited states of the helium atom with the aid of the variational quantum deflation $(VQD)$ method in a CAS(2,2). We then investigate the performance of this circuit architecture as a basis for implementing the VQD method. In the ideal noiseless simulation setting, we see that the survival probability of the ground and the excited states within the target $CAS$ subspace is unity, because the total photon number and the photon number in the two spin sectors $α$ and $β$ are preserved. We demonstrate that the proposed approach enables the determination of the ground and excited-state energies within the CAS(2,2) electronic Hilbert space using a continuous-variable quantum circuit and the variational quantum deflation ($VQD$) algorithm, while satisfying the orthogonality conditions with negligible errors.
Constraining Lorentz Invariance Violation via Precision Atomic Spectroscopy
View Full Abstract
This paper investigates Lorentz violation arising from quantum gravity effects in electronic and muonic hydrogen atoms. The violation is modeled through a modified dispersion relation parameterized by a dimensionless coefficient $ξ$ and suppressed by the Planck scale. Using high-precision spectroscopic data and a chi-squared fitting procedure that carefully accounts for theoretical uncertainties in the Rydberg constant and the proton radius, the analysis yields a 95% confidence level constraint $ξ\in [-14.3,\; 1.37] \times 10^5$. The mass scaling of the effect reveals two distinct regimes: for the lowest-order deformation, the heavy nucleus amplifies the signal, while for higher-order corrections, the lepton dominates the sensitivity. These bounds approach Planck-scale sensitivity using the simplest atomic systems, thereby circumventing ambiguities inherent in more complex quantum systems.
Kardar--Parisi--Zhang density hydrodynamics in a coherent XXZ--ASEP Lindbladian
View Full Abstract
Coherent interactions can generate quantum correlations without changing a stationary density current. Whether that current still determines long-wavelength transport is a dynamical question. We study an XXZ chain with asymmetric Lindblad hopping, whose stationary current has the asymmetric simple exclusion process (ASEP) form although its populations do not evolve autonomously. The current curvature and static susceptibility fix the leading Kardar--Parisi--Zhang (KPZ) length and amplitude without a fitted length or amplitude conversion factor. The density-visible Liouvillian spectrum, real-space spreading, and Fourier relaxation support KPZ scaling at the finite coherent couplings studied. Central and intermediate stationary density correlations are consistent with the Prähofer--Spohn profile at this microscopic scale, with resolved finite-time corrections. Reservoir-matched classical references quantify boundary effects, while symmetric hopping recovers diffusion and reduced asymmetry produces the expected crossover. These results connect an exact nonlinear current to the observed long-wavelength KPZ transport of the physical density in an interacting open quantum chain away from the isotropic Heisenberg point.
Improved Exact and Approximate Quantum Fourier Transforms from Multiplication
View Full Abstract
In the world of quantum computing, quantum Fourier transform (QFT) has been one of the most important subroutines for quantum algorithms, as exemplified by Shor's factoring algorithms and phase estimation (which in itself has been used as a primitive in various quantum algorithms). In fact most of the well known quantum algorithms can be divided into two classes, QFT based algorithms and search based algorithms. The usual circuit for QFT (covered in almost every basic quantum algorithms course) needs $O(q^2)$ gates (and $O(q)$ qubits) to perform the exact Fourier transform over $\mathbb{F}_{2^q}$. Cleve and Watrous (FOCS 2000) improved this gate count to $O(q (\log q)^2 (\log \log q))$ using the integer multiplication algorithm in $O(n (\log n) (\log \log n))$ time for two $n$-bit integers (best known at that time). Our first main result shows that this gate count can be improved to $O(q (\log q))$. In fact, if there is a multiplication circuit, to multiply two $n$-bit integers, with $O(n (\log n)^α)$ gates; we get a QFT circuit with $O(q (\log q)^α)$ gates (improving upon $O(q (\log q)^{α+ 1})$) gates from the construction of Cleve and Watrous). Given the recent claim by OpenAI about integer multiplication, this opens up the possibility of having a QFT circuit with $o \left( q (\log q)\right)$ gates. On approximating the QFT over $\ZZ/(2^q \ZZ)$, the result of Ahokas, Cleve and Hales (ERATO 2003) showed that an approximating circuit can be built with $O \left( q (\log \log(q/\varepsilon))^{α+1} \right)$ gates, where $ε$ is the approximating parameter. Our second main result again improves this to $O \left( q (\log \log(q/\varepsilon))^α \right)$ gates.
Semi-Device-Independent Certification of multi-qubit Entangled Basis Measurement
View Full Abstract
The entangled basis measurement plays a pivotal role in fundamental information-processing tasks, such as dense coding, quantum teleportation, and entanglement swapping. Consequently, certifying such measurements in a device-independent manner remains an important task. In this work, we present a semi-device-independent (SDI) protocol in a prepare-and-measure (PM) scenario for certifying a class of m-qubit entangled basis measurements. Specifically, we consider a tripartite PM scenario featuring two senders and one receiver, where each sender sends an arbitrary number of 2^m inputs and the receiver performs a measurement with 2^m outcomes. We adopt a classical causal model framework to demonstrate the non-classicality of quantum measurements. We introduce nonlinear witnesses in classical causal models and demonstrate that the optimal quantum value exceeds the classical bounds. Further, we demonstrate that the optimal quantum value of the witness SDI certify the entangled basis measurement and the prepared states of the two senders.
Spatial Path Superposition: A No-Cloning Perspective on MIMO-Inspired Spatial Diversity
View Full Abstract
Spatial diversity is a key mechanism in classical Multi-Input Multi-Output (MIMO) communications, where multiple propagation alternatives provide redundant observations that improve reliability in noisy environments. A direct translation of this principle to quantum communications is forbidden by the no-cloning theorem, since an unknown quantum state cannot be copied and transmitted through independent links. In this Perspective article, we argue that spatial path superposition provides a no-cloning-compatible analogue of the spatial-diversity principle of MIMO. Rather than duplicating the transmitted quantum state, a quantum carrier is coherently delocalized over multiple communication links, so that alternative spatial evolutions are experienced in quantum superposition. In this framework, classical redundancy is replaced by spatial coherence, and the communication link itself becomes part of the quantum dynamics. Indeed, spatial coherence can enhance the fidelity of the received quantum state, providing the quantum counterpart of the classical diversity gain, and can be converted into bipartite and multipartite entanglement during propagation. This implies that, under suitable coherent path control, noisy channel evolutions can contribute constructively to entanglement generation. This Perspective identifies spatial path superposition as a quantum-native primitive for the Quantum Internet, linking no-cloning-compatible spatial diversity, fidelity enhancement, entanglement generation, and coherent path control.
Bridging Pulse and Circuit Levels: A Geometric Framework for Deterministic Error Suppression
View Full Abstract
Quantum errors in noisy environments remain a major obstacle to advancing quantum information technology. Standard quantum error correction requires massive ancillary qubit overhead, motivating the need for hardware-efficient mitigation strategies. In this work, we propose a framework for dynamical quantum error correction at the circuit level, requiring no logical encoding or ancillary qubits. By extending a geometric framework (originally developed for creating dynamical error-correcting gates at the control pulse level) to the discrete dynamics of digital circuits, we map the accumulation of coherent errors to trajectories in a high-dimensional error space. We demonstrate that inserting deterministically optimized twirling gate sequences actively shapes these trajectories, utilizing destructive interference to keep the accumulated error bounded with error scaling $\mathcal{O}(1)$. This deterministic path-shaping suppresses circuit errors fundamentally differently than the stochastic random-walk behavior of standard randomized compiling with error scaling $\mathcal{O}(\sqrt{N})$. Furthermore, we show that this circuit-level dynamical correction synergizes with pulse-level robust control, providing an analytical bridge between continuous noise dynamics and discrete quantum compilation. This research illuminates pathways to achieving highly noise-resistant quantum circuits prior to the era of fault tolerance.
Connection of surface code patches based on entanglement distillation without postselection
View Full Abstract
Distributed quantum computing is a promising approach for overcoming the scalability limitations of fault-tolerant quantum computing. Entanglement distillation, a process that extracts higher-fidelity entangled states from noisy ones, plays a key role in distributed quantum computing. However, simple distillation protocols typically rely on postselection, which poses practical challenges for implementation. Here, we propose a scheme for distributed surface-code quantum computing that benefits from entanglement distillation even without postselection. Numerical simulations show that the logical error rates in the proposed scheme are lower than those in the setting without distillation. Additionally, we demonstrate that the logical error rates can be suppressed further by exploiting the asymmetry between spacelike and timelike errors in the surface code. The proposed scheme offers a practical and simple approach to distributed quantum computing with surface codes.
Hyperbolic Nanocavities for Single-Molecule Vibrational Strong Coupling
View Full Abstract
Hyperbolic phonon polaritons (HPhPs) in low-loss anisotropic materials such as hexagonal boron nitride (hBN) provide extreme sub-diffractional field confinement in the mid-infrared, making them attractive for enhancing the interaction of light with molecular vibrations. Collective vibrational strong coupling between molecular ensembles and HPhPs has already been demonstrated in extended slabs. Reaching this regime with a single molecule, however, remains a major challenge, and would provide a platform for investigating how vacuum electromagnetic fields influence molecular dynamics and chemical reactivity. Here, we show theoretically that single-molecule vibrational strong coupling can be reached in hBN nanocavities that laterally confine HPhPs within a finite volume. Combining full-wave electromagnetic simulations with the few-mode quantization approach, we find that these nanocavities support a rich set of asymmetric resonances that strongly enhance the local spectral density, with frequencies that follow from simple HPhP ray trajectories and can be tuned through the cavity aspect ratio. We identify resonances with quality factors of about $600$ and effective mode volumes of $|V_{\mathrm{eff}}| \sim 10^{-7}λ^{3}$, sufficient for single-molecule strong coupling with vibrational transitions with dipole moments on the order of $1\,\mathrm{D}$. These results establish hyperbolic nanocavities as a promising platform for single-molecule vibrational strong coupling and open new routes toward the local control of vibrational dynamics and molecular energy flow.
Resetting a Superconducting Qubit with a Compact Colder Resistive Dissipator below the Qubit Frequency
View Full Abstract
Efficient qubit reset has become a key requirement for large-scale superconducting quantum processors, as initialization fidelity increasingly lags behind gate performance and quantum error correction demands rapid, high-fidelity state re-initialization. This work proposes a compact on-chip dissipator consisting of two transmon dissipation modes and a thin-film resistor, and experimentally demonstrates an unconditional reset protocol. With no additional control lines and negligible impact on the qubit $T_1$, the effective temperature of the transmon qubit is reduced from $49$~mK to $35$~mK. Quantum process tomography is employed to benchmark the reset process, achieving a process error of $0.0028$. This reset protocol is robust to pulse parameter deviations, thereby relaxing calibration requirements. The dissipator architecture provides a practical, calibration-friendly reset solution for large-scale superconducting quantum processors.
Spatial Cost of Recovering a Fusion Qubit in a Critical Spin Chain
View Full Abstract
Vanishing-error recovery of a fusion qubit from a fixed-sector ground doublet of four Kramers--Wannier defects in a critical Ising chain requires at least the shorter three-defect span of physical spins to leading order. Across arbitrary preselected spin sets and unrestricted joint decoding, this bound holds when the thermodynamic limit precedes large spacings at fixed positive ratios. An exact interval decoder attains it. Collective records of both logical axes in the complement force successful near-minimal supports to concentrate in density on a leading-order shortest interval.
Statistical mechanics and hierarchy of learnability in quantum codes: From generalized symmetries to non-Abelian topological orders
View Full Abstract
Local weak measurements provide noisy information about observables encoded in a quantum code. We formulate the corresponding Bayesian inference problem for a broad class of topological stabilizer codes by mapping it to classical spin models with generalized symmetries. When the wavefunction deformation and Gaussian measurement strengths coincide, the replicated model acquires an enlarged symmetry. We use this symmetry to derive exact identities among correlators averaged over measurement records that quantify the learnability of nonlocal observables associated with fractionalized excitations. Together with correlation inequalities in the associated clean ferromagnetic models, these identities establish hierarchies of learnability: if two observables remain learnable at long distances, their product must also remain learnable. We demonstrate these relations in the rank-2 toric code and the X-cube model, whose classical descriptions exhibit modulated and subsystem symmetries, respectively. We further extend the analysis to finite group quantum double models, including non-Abelian ones. We derive exact relations between learnability and correlations in the corresponding classical models, and show that the representation structure and fusion rules of anyons impose further constraints under suitable positivity conditions. These results constrain which types of nonlocal information can be learned simultaneously, providing a guide to learning phase diagrams in quantum codes under local weak measurements.
Robust Geometric Gates for QCCD Architecture
View Full Abstract
The trapped-ion quantum charge-coupled device (QCCD) is a promising route toward scalable quantum computing. However, the frequency offset during shuttling operations introduce significant decoherence and control errors, severely degrading gate fidelity on transported ions. Here, using a room-temperature planar chip trap, we demonstrate a robust and universal single-qubit gate set in the QCCD architecture. Based on a recently proposed path-optimizable noncyclic geometric scheme, we show that dynamic noise is strongly suppressed even when multiple shuttling operations are interleaved with gate execution, achieving substantially higher fidelities than conventional dynamical gates. This robustness is further validated in a multi-ion system containing up to 33 qubits. With inherent robustness and adaptability to varying shuttle distances and ion numbers, our work offers a plug-and-play solution for building robust quantum primitives for the QCCD platform.
Quantum Error Correction in Nearly Critical Toric Codes
View Full Abstract
We investigate quantum error correction protocols for topological codes deformed away from their stabilizer limits, particularly as they are pushed towards quantum phase transitions into trivial phases. Our focus is primarily on quantum information stored within the ground-state manifold of the transverse-field toric code (TFTC), subjected to independent bit-flip and phase-flip decoherence. Although the transverse field induces strong quantum fluctuations of $m$ anyons in the ground states, we show that projective measurements of the "bare" toric code stabilizers can nevertheless be used to construct an efficient decoding algorithm which exhibits a finite threshold to both types of decoherence, even when the transverse field is tuned infinitesimally close to the quantum critical point. Our construction of the optimal postmeasurement decoders---that is, the optimal decoders assuming that the stabilizers are first measured---crucially relies on the stoquastic nature of the TFTC Hamiltonian, which affords a description of its ground states in terms of a classical lattice gauge theory. Using stoquasticity, we first prove that stabilizer measurements act unitarily on the undecohered TFTC ground states to excellent approximation, and that the optimal postmeasurement decoder can be efficiently implemented via Monte Carlo simulation of a constrained lattice gauge theory. We then construct the optimal postmeasurement decoder for the TFTC states under bit-flip and phase-flip decoherence, where we numerically demonstrate a finite threshold close to the quantum critical point. We provide theoretical evidence (without a rigorous proof) that stabilizer measurements constitute an optimal decoding strategy in this setting. For phase-flip decoherence, we further prove that the optimal postmeasurement decoding threshold is independent of the transverse field strength throughout the topological phase.
Quantum Pointwise Dimension (QUPID): An algorithm for identifying classical chaos in quantum dynamics
View Full Abstract
The Pointwise Dimension is a diagnostic that reveals the effective dimensionality of classical trajectories in a $2N$-dimensional phase space. The essence of this diagnostic is to find a scaling according to which density changes with radius $r$ around a point of interest in phase space. Particularly, regular trajectories are confined to an $N$-dimensional invariant torus, while chaotic trajectories explore a $(2N-1)$-dimensional energy surface. In classical mechanics, this trajectory density can be found by counting recurrences to within the sphere of radius $r$. In quantum mechanics, probability density is intrinsic, making the Pointwise Dimension compelling, but surprisingly this has not been studied in the quantum regime. In this work, we implement the Pointwise Dimension in the quantum regime using the Husimi representation of the quantum wavepacket. This implementation entails a long-time average of the time-dependent Husimi representation to obtain a stationary phase space density, and a radial spatial integration of this density over a sphere of radius $r$. The classical-quantum correspondence is excellent for both autonomous and non-autonomous systems, adding a new diagnostic to the study of quantum chaos. Finally, we explore the possibility, both classically and quantum mechanically, of obtaining the Pointwise Dimension from a time correlation function.
Breaking the quantum barriers for Graph Collision
View Full Abstract
In the graph collision problem, the task is to decide whether a known graph on $n$ vertices contains an edge with both endpoints marked, given query access to the input bits specifying the marked vertices. We first refute the conjectured $Ω(n^{2/3})$ query lower bound with a bounded error quantum algorithm using $\widetilde O(n^{92/139})$ queries. We then refine this approach to obtain a $\widetilde O(n^{11/17})$ query algorithm. We also obtain a $\widetilde O((nq)^{11/17})$ query bound for all (partial) Boolean output functions with positive certificate complexity at most 2 and alphabet size $q$, contrasting a known $Ω(n^{2/3})$ lower bound for such problems with large alphabet sizes. We complement these algorithms with an $Ω(\sqrt{n\log n})$ quantum query lower bound for graph collision, exceeding the $O(\sqrt n)$ certificate complexity barrier for the positive adversary method.
Reading Why: Born-Measured Attention with Exact Word Evidence on Light and Qubits
View Full Abstract
When a language model answers, we can usually only estimate why. We build a transformer in which every step is a Born measurement - attention $|\langle q|k\rangle|^4$ normalised over each row, a measured product in place of the feed-forward nonlinearity, and a Born readout. With its denominators held at their values for the input, each class probability is a polynomial in the word amplitudes, so its integrated-gradient evidence is computed by a finite quadrature with no quadrature error: the words' contributions sum to the class probability above its no-information share, to $10^{-11}$ or better. On e-SNLI natural language inference, with about 98k parameters outside the embedding, the model reaches $76.98 \pm 0.17$% test accuracy, level with a softmax transformer of the same size ($76.62 \pm 0.36$%). Deleting the word its evidence ranks first changes the answer in 45% of test pairs, out of the 53% any single deletion can change, against 32% for the softmax model explained the same way and 40% by its attention x gradient. Attention can look more like the words annotators highlighted, yet accounts for the answer less well: deleting the word it ranks first changes the Born Transformer's answer in 32% of pairs. The same weights compile exactly to optoelectronic optics and to qubits, and a coherent attention layer becomes one circuit equal to the model (852 CNOTs on 23 qubits). On IBM's ibm_kingston, reading only the attention overlaps by Hadamard tests, the device gave the model's answers on two short test pairs and kept or changed them under deletion as the model does; the evidence itself did not yet survive the device, and we work out the shots and calibration that measuring it on hardware would need.
Interpretable Quantum Photonic Generative Models
View Full Abstract
We propose a physical generative model for learning correlated multivariate data based on homodyne detection of photonic continuous-variable (CV) circuits. We use an $N$-mode photonic circuit in which two-mode squeezing provides correlations, local phase shifts tune the strength and sign of these correlations, and an adjustable interferometer redistributes them across modes. We train the circuit by matching its Pearson correlation matrix to the one obtained from data. We apply affine post-processing to adjust the marginals independently while keeping the relations intact. We test the model on the multivariate distribution of standardized log returns of financial assets, showing that the photonic model can represent rich correlation structures. We reproduce empirical correlations with residuals below $10^{-4}$ for five variables and recover the correct correlation signs for $94\% \pm 1\%$ of 190 correlation pairs at twenty variables, with $86\%$ of the residuals below $0.1$. As a separate technical contribution, we develop an approach for simulating Kerr gates with small nonlinearity via a Hubbard-Stratonovich expansion, making them suitable for CV-based simulators. Our results establish CV photonic circuits as a platform for interpretable generative learning, suitable for representing and fast sampling of distributions across different application domains.
Simple proof of conditions requiring maximal entanglement for local state verification and discrimination
View Full Abstract
For deterministic state verification by separable measurements, the Schmidt rank of an entangled resource must be at least that of the state being verified [N. Yu, R. Duan, and M. Ying, IEEE Trans. Inf. Theory 60, 2069 (2014)], and if the two are equal, the resource must be maximally entangled [S. Akibue, J. Miyazaki, and H. Osaka, Lett. Math. Phys. 116, 110 (2026)]. The latter was derived from a general theorem proved using algebraic geometry. In this paper, we give a simple, self-contained proof of both statements using only linear algebra. We then use these results to show that among pure entangled resources of local dimension at most $d$, a maximally entangled state of $\mathbb{C}^d\otimes\mathbb{C}^d$ is necessary and sufficient for perfect local discrimination of a generic orthogonal basis of $\mathbb{C}^d\otimes\mathbb{C}^d$, however weakly entangled. The same holds for local implementation of a generic orthogonal measurement.
Quantum Advantage has Few Complexity Implications
View Full Abstract
We consider the complexity implications of proofs of quantumness and (quantum verifier) oblivious state preparation. We show that both of these objects can coexist with the easiness of nondeterministic computation. That is, we give evidence that proofs of quantumness can exist when $\mathsf{P} = \mathsf{NP}$ and that (quantum verifier) oblivious state preparation can exist when $\mathsf{BQP} = \mathsf{QCMA}$. In particular, we give a classical oracle relative to which (1) $\mathsf{P}^\mathcal{O} = \mathsf{NP}^\mathcal{O}$ (2) $\mathsf{BQP}^\mathcal{O} = \mathsf{PSPACE}^\mathcal{O}$ (3) Proofs of quantumness exist. In particular, there exists a language in $\mathsf{IP}^\mathcal{O} \subseteq \mathsf{BQP}^\mathcal{O}$ which is hard on average against $\mathsf{P}^\mathcal{O}/poly$. We give a unitary oracle such that (1) $\mathsf{BQP}^\mathcal{O} = \mathsf{QCMA}^\mathcal{O}$ (2) Quantum verifier oblivious state preparation exists. These oracle separations directly imply a number of related consequences. For example, our first result implies that proofs of quantumness cannot be used to construct classical or quantum cryptography with a relativizing proof. Our second result implies that quantum computation/classical communication oblivious transfer cannot be used to construct post-quantum one-way functions with a relativizing proof.
Universal dynamics of quantum phase transitions with fractional long-range interactions
View Full Abstract
The complete statistical characterization of defects generated in a quantum phase transition has mostly been studied in exactly solvable models, and remains little explored in nonintegrable systems such as long-range interacting spin chains. We characterize the full defect counting statistics in a nonintegrable long-range spin chain, the fractional Ising model, by time-dependent variational-principle simulations within the matrix-product-state and matrix-product-operator formalism. Fractional interactions capture emergent multiscale correlations and long-range effects in nature, governed by the order of the underlying fractional derivative. Such couplings can be approximated on existing quantum simulation platforms, where the full defect statistics can be measured. The defect number cumulants follow power laws in the driving time, with exponents that vary continuously with the fractional order. At low fractional order, deep in the long-range regime, the mean defect number decays more slowly than predicted by the Kibble-Zurek mechanism (KZM), while at intermediate order the KZM holds with the numerically extracted many-body critical exponents. At large fractional order, the exactly solvable free-fermion limit of the model becomes progressively more accurate towards the short-range limit. We derive exact bounds on the kink-number cumulants and on the kink-kink correlations, implying an exact Gaussian limiting distribution for large system sizes. In the many-body simulations, however, kinks are more correlated, consistent with the confinement of domain walls, and these bounds are violated in the long-range regime, also in the bulk of the chain. Nevertheless, the kink distribution still approaches a Gaussian for large defect numbers, with proportionality partially broken between the cumulants.
Effective Hamiltonians and non-Hermitian physics
View Full Abstract
Every realistic quantum system is coupled to an environment. Including the environment restores a closed, Hermitian description, but at the cost of an intractably large Hilbert space. The Feshbach--Löwdin projection eliminates the unwanted degrees of freedom exactly, yielding an effective Hamiltonian $H_{\rm eff}$ on the relevant subspace alone---which \new{generically becomes non-Hermitian when the eliminated subspace contains an energetically accessible continuum and outgoing boundary conditions are imposed}. We illustrate this through a minimal model: a particle in a box with a delta barrier at its center. Direct elimination of one half-well reduces all information about the discarded sector to a single \new{boundary parameter} $β$; the same result is then rederived via the Green's function and Dyson equation, offering a pedagogical illustration of how boundary data enter the Green's-function formalism and relating $β$ to a self-energy term. Whether $β$ is real or complex determines whether $H_{\rm eff}$ is Hermitian or not, and the full range of behavior---from Hermitian dynamics through finite-width resonances to the counterintuitive quantum Zeno effect---follows from this single parameter.
DynaMite: Dynamic Measurement Scheduling To Accelerate Fault-Tolerant Quantum Programs
View Full Abstract
Fault-tolerant quantum computers run millions of logical cycles to perform quantum error correction (QEC). As logical operations span entire logical cycles, the logical cycle time (LCT) dictates program runtime. Qubit measurements, critical to extract parity information for QEC, are the slowest operations and account for 43-86% of LCT. Measurement latencies impact fidelity: fast measurements lower our ability to correctly classify quantum states, whereas slow measurements increase the likelihood of decoherence. Hardware providers thus calibrate measurement latencies that maximize readout fidelity per qubit and use them to schedule all measurements during program execution. However, calibrated latencies are sub-optimal for logical performance because logical cycles span multiple QEC rounds, during which data qubits are not measured. This increases LCT and logical error rates (LERs) due to decoherence at the logical level. We propose DynaMite, a lightweight real-time measurement latency selection policy built on two key insights. First, logical cycles must use a measurement latency that is fast enough to reduce both LCT and LER for the QEC code, instead of the calibrated latency that only maximizes readout fidelity. Second, not all logical cycles are equal; many do not fully utilize the error budget of the QEC code, i.e., the number of failed parity checks it can tolerate without compromising LER. These cycles could use even faster measurements but do not, because latencies are chosen statically, whereas error information is only available at runtime. DynaMite exploits the fact that a logical cycle comprises multiple QEC rounds and selects the fastest latency for an upcoming round based on the error budget left and rounds remaining. Our evaluations show that DynaMite reduces LCT by 1.69x on average and up to 2.29x, and reduces LER to 0.46x on average and up to 0.13x of baseline.
Efficient simulations of spectra and transport for multiorbital quantum impurities
View Full Abstract
Quantum impurity calculations become challenging when multiple correlated orbitals are treated explicitly, particularly in nonequilibrium steady states. We introduce Coupled-Cluster Coupled Lindblad (C$^3$L), a deterministic approach that combines the recently developed coupled-Lindblad compact bath representation with coupled-cluster theory to compute steady states and Green's functions directly in imaginary and real frequency. C$^3$L has favorable polynomial computational complexity and avoids the sign problem of quantum Monte Carlo (QMC). In a real-time multiorbital benchmark, it agrees closely with state-of-the-art QMC while reducing computational cost by four to five orders of magnitude, with a further 10--100-fold speedup on a GPU. Beyond the practical reach of established real-time QMC solvers, four-orbital nonequilibrium impurities with general interactions and biased reservoirs become accessible with C$^3$L. We obtain resonance-resolved transport signatures relevant to scanning tunneling microscopy experiments on molecular junctions.
Quantum Query Lower Bounds from Classical Moment Matching
View Full Abstract
We prove a quantum analogue of the classical moment matching method, a popular framework used to prove lower bounds in property testing. For two random variables $X_0$ and $X_1$ whose moments match up to the first $r-1$ moments, the classical moment matching method says that no classical algorithm can reliably distinguish between input instances of length $N$ constructed from $X_0$ and $X_1$, respectively, unless it performs at least $Ω(N^{1-1/r})$ queries. While this method has been widely explored since its inception in the seminal work of Raskhodnikova, Ron, Shpilka, and Smith (STOC 2007) to prove lower bounds for symmetric properties, it has remained an open question whether a quantum analogue of it could be proved. We prove two variants of this quantum moment matching method, which are incomparable. Our first quantum query lower bound scales as $Ω(N^{1/2-1/(2r)})$, while our second moment matching theorem yields a sharper lower bound of $Ω(N^{1/2-1/(2(2^r-1))})$, albeit for smaller parameter ranges. Our results combine a new continuous hybrid argument with the polynomial method. The continuous hybrid argument compares two hard input distributions generated from i.i.d. samples by continuously varying both distributions, keeping them identically distributed at every intermediate stage. It reduces the comparison to the effect of changing the distribution of a single sample. The polynomial method then cancels the terms determined by the matched moments. We apply these moment matching theorems to prove new optimal lower bounds on $k$-distinctness, $k$-star-freeness, planarity and outerplanarity testing, as well as to improve prior lower bounds on image size testing and $K$-junta testing by logarithmic factors. A key advantage of our framework is its simplicity: it reduces quantum lower bound proofs to the construction of suitable moment-matching distributions.
Comment on "Supervised Learning with Quantum Hamiltonian Embeddings" (arXiv:2610.26833)
View Full Abstract
We discuss the relationship between quantum Hamiltonian embeddings (arXiv:2610.26833) and prior developments in Quantum Cognition Machine Learning (QCML), including QCML's earlier implementation on IBM quantum hardware. We consider the novelty claims and the computational role of encoding an entire dataset in a single ground state.
Data informed Ansatz Selection for Variational Quantum Circuits
View Full Abstract
Choosing a variational quantum circuit (VQC) usually means searching over ansatze and depths, and training each candidate. We give three rules that fix these choices from the data and the gate set alone, before any training. First, a circuit without entangling gates has a rank-one Fourier coefficient tensor on every subset of qubits. A singular value decomposition of a dataset's Fourier coefficients therefore indicates whether entanglement is needed, which qubits it connects, and a lower bound on the error of omitting it. Second, the rank of the quantum Fisher information matrix grows by $p_0$ per layer, after a first-layer deficit $d_0$, until it reaches a ceiling set by the dynamical Lie algebra. This law fixes the depth. Third, reading out all $2^N - 1$ Pauli-Z products from one batch of shots resolves half of the state's directions, the most any single-basis readout can. A single-qubit readout resolves an exponentially small fraction. For the Madelon dataset, the rules prescribe 7 blocks of 3 qubits at depth 3: a 239-parameter classifier with 78.5% test accuracy, found without a grid search. Ablations confirm three predicted effects: shallower circuits, smaller blocks and dropping reuploading all lower accuracy.
Operational Thresholds for Long-Range Entanglement in Quantum Networks
View Full Abstract
Quantum networks distribute entanglement between distant nodes by combining many short entangled links using local quantum operations. These operations only succeed probabilistically, yet existing percolation-based theories of entanglement transmission treat them as perfect. We approach the problem through statistical physics, using a stochastic generalization of concurrence percolation to determine how reliable local operations must be for long-range entanglement to remain possible. On hierarchical $(U,V)$-flower networks, which permit full analytical control across network scales, we derive an exact renormalization recursion for the probability that an end-to-end entangled connection survives. For the $(2,2)$-flower this yields a closed-form operational phase boundary, $η_p = 2 - \frac{32}{27}η_s$, where $η_s$ and $η_p$ are the success probabilities of the series (entanglement swapping) and parallel (purification) operations, respectively. At this boundary the survival probability jumps discontinuously from $0$ to $S_\infty = 3/(4η_s)$. Numerically propagating the full distribution of end-to-end concurrence yields a second threshold in the initial link quality, which varies continuously with operational reliability. Above both thresholds the large-network state is binary: the connection either fails outright or approaches a perfect Bell pair. Our results thus reveal a two-threshold structure for long-range entanglement, in which operational reliability and initial link quality can compensate one another. Operational success rates therefore emerge alongside initial link quality as a primary design constraint for scalable quantum networks.
QECert: Formal Foundations for Quantum Error-Correction Theory in Lean
View Full Abstract
Quantum error correction provides the mathematical basis for protecting quantum information against noise. Existing formalizations have established foundations for stabilizer codes and code verification. However, a systematic formal treatment of the asymptotic constructions and fundamental limitations that underpin scalable quantum error correction is still needed. We present QECert, a Lean library providing reusable formal foundations for these theoretical questions. It connects quantum error-correction criteria, stabilizer and Calderbank-Shor-Steane codes, and algebraic and homological constructions within a common framework. Asymptotically good quantum low density parity check codes provide the principal case study. We formalize constructions and asymptotic parameter theorems spanning hypergraph products, balanced products, lifted products, and quantum Tanner codes. Further developments cover Bravyi-Poulin-Terhal bounds and related locality restrictions, constant overhead magic state distillation, and energy barriers and storage errors for quantum memories. QECert establishes a reusable formal foundation for studying the capabilities, resource requirements, and fundamental limitations of quantum error correction, supporting systematic verification and further development of its theory.
Reopening the one clean qubit case of a semi-grand challenge
View Full Abstract
In his 2005 list of semi-grand challenges for quantum computing theory, Scott Aaronson asked whether a quantum computer that is always in a separable mixed state can be simulated by a classical computer in polynomial time. An affirmative answer was claimed for the one clean qubit model of quantum computation. The supporting mathematical arguments relied on an exhaustive characterization of circuits that stay in separable states. Here, we give a counterexample where one pure qubit, known as the clean qubit, controls a sequence of three gates that act on a maximally mixed three-qubit register. The overall unitary that accumulates as these gates are applied has the properties that ensure the state of all four qubits remains fully separable. Crucially, we show that the final unitary cannot be put into the form required by the claimed simulation result. We also give a continuous-time implementation of the same circuit that keeps the qubits fully separable throughout and ends at the same unitary. We extend our counterexamples to a uniform family, and pinpoint the gap in the earlier proof. Since our circuits are themselves efficient to simulate classically, this work does not settle Aaronson's question. It does, however, reopen the semi-grand challenge for an actively researched model of quantum computation.
Recoverability of Gravitational Entanglement under Decoherence
View Full Abstract
Decoherence can make gravitationally generated entanglement arbitrarily small, or even vanishing, without necessarily rendering the effective matter dynamics separable. We ask whether this hidden non-separability can be revealed using strictly local quantum error correction. For Newtonian gravity supplemented by physically relevant localization noise, including environmental noise, and noise from collapse models such as GRW, CSL, and Diósi--Penrose, we analyze when the underlying entangling resource is locally recoverable. For GRW- and CSL-type noise, we analytically establish that strictly local quantum error correction can make the ratio of the effective gravitational interaction strength to the residual decoherence rate arbitrarily large for any parametrization of the collapse model, even in regimes where the unencoded entanglement signal approaches zero. By contrast, the Diósi--Penrose model does not exhibit the same enhancement under bipartite protocol considered here, revealing a qualitative difference. These results show that the loss of detectable entanglement is not equivalent to the loss of a recoverable non-separable resource, and open a route toward practical recovery protocols.
Ultracold polar molecules for quantum science and technology
View Full Abstract
Ultracold polar molecules present a rich platform for experimental quantum science leveraging their unique properties. Of particular relevance is the intrinsic electric dipole moment of the molecule, which results in strong coupling to microwave fields and can be used to engineer long-range, anisotropic, and tunable dipole-dipole interactions. Such interactions can generate entanglement between molecules and enable the study of novel quantum many-body phenomena in parameter regimes inaccessible in other systems. Modern experiments in optical tweezers and optical lattices have demonstrated controlled interactions between molecules in coherent quantum states, and recently bulk gases of molecules have been cooled to quantum degeneracy. Motivated by these landmark advances, we present this article to explain many of the key concepts relevant to current research in the field.
On Revolutionizing Power Systems: Suitability of Quantum Computing-Ready Pipelines for Stochastic Unit Commitment Optimization
View Full Abstract
Modern unit commitment (UC) scenarios, particularly those involving uncertainties from demand fluctuations and renewable energy sources, pose significant challenges to traditional optimization methods due to the large search spaces they encompass. This paper proposes a quantum computing-ready optimization pipeline for deterministic and stochastic UC, integrating classical, quantum-inspired, quantum annealing, and hybrid quantum-classical solvers across test systems, including the IEEE 118-bus system. A novel Quadratic Unconstrained Binary Optimization (QUBO) reformulation accommodates generator scaling and 24-hour scheduling horizons with compact Boolean logic penalties for startup, cooldown, and spinning reserve constraints. A divide-and-conquer strategy and Quantum Computing Monte Carlo (QCMC) simulation address scalability across 27,730 uncertainty scenarios, reducing compilation time by up to two orders of magnitude. Experimental results demonstrate the pipeline's ability to achieve efficient, scalable, and accurate UC optimization under uncertainty: the hybrid quantum method approach matches the classical baseline, reduces stochastic UC runtime from 40.76 to 14.79 hours, and characterizes pure quantum annealing as limited to small systems with 0.22% to 2.18% encoding errors and constraint violations. These results provide an analysis of the scalability and computational practicality of hybrid quantum optimization for generator scheduling in UC.
Ergotropy Activation and Coherence in Dissipatively Charged Quantum Batteries
View Full Abstract
Quantum batteries can exploit quantum resources to enhance energy storage and work extraction, and recent experimental progress has brought their implementation closer to reality. In realistic settings, however, environmental dissipation is unavoidable, making dissipative charging a physically relevant operating regime. Here we investigate ergotropy in dissipatively charged quantum batteries, focusing on interaction-induced work extraction. For two coupled two-level systems (TLSs), we derive exact analytical expressions for the total, coherent, and incoherent ergotropy in both resonant and detuned configurations. We show that, in the resonant case, ergotropy is activated only above a critical coupling associated with an interaction-induced energy-level crossing, whereas detuning enables ergotropy already in the weak-coupling regime. Moreover, quantum coherence, although necessary for coherent work extraction, is not by itself sufficient to guarantee nonzero coherent ergotropy. In the strong-coupling regime, the resonant setup reaches the maximum ergotropy at a finite coupling strength, whereas the detuned setup approaches the same limit only asymptotically. Extending the analysis to a periodic XX spin chain of $N$ TLSs, we analytically derive the finite-temperature coupling threshold for ergotropy activation and show that it scales as $1/N$ in the large-$N$ limit. These results identify frequency detuning, interaction strength, and system size as key control parameters for ergotropy generation in open quantum batteries.
Synchronization Mpemba Effect
View Full Abstract
We introduce the synchronization Mpemba effect, in which a less synchronized initial state overtakes a more synchronized one, and demonstrate it in dissipatively coupled quantum van der Pol oscillators. Within a graph-Laplacian framework, we show that for two oscillators, the mechanism is a competition between a slowly decaying collective background and a fast transverse transient, equivalently an exchange between relative-mode displacement and phase-fluctuation errors. The same decomposition extends to networks: the synchronization error splits into transverse Laplacian modes, yielding closed-form crossing times from eigenvalue separations and initial mode weights, and a sufficient screening criterion. With only these eigenvalues entering, the rule is topology independent: crossing times of different networks collapse onto a single spectral-gap line. Thus, quantum many-body dynamics can be designed and controlled at low dimension without constructing the exponentially large Liouvillian, opening a route to quantum synchronization as a resource.
Band structure of two-dimensional graphene and of one-dimensional nanoribbons via variational quantum algorithms: from energies to wavefunction quality
View Full Abstract
Simulating quantum many-body systems classically encounters exponential bottlenecks, which quantum devices circumvent by natively encoding wavefunctions. In the Noisy Intermediate-Scale Quantum (NISQ) era, however, hardware noise constrains simulation accuracy. As a stepping stone toward strongly correlated materials, we compute the band structure of 2D monolayer graphene and 1D nanoribbons (zigzag and armchair) using a single variational workflow in the $p_z$ tight-binding approximation. Non-interacting ground states also provide essential initial reference states for subspace and warm-started variational methods to solve interacting spectra. By mapping the Bloch Hamiltonian to Pauli operators, we extract the ground band via the Variational Quantum Eigensolver (VQE) and excited subbands via Variational Quantum Deflation (VQD), validating our approach from ideal simulations to execution on physical IBM Quantum processors. In ideal simulations, the workflow reproduces exact diagonalization results with high precision, whereas hardware noise introduces energy deviations of a few hundredths of the hopping parameter. While qubit counts scale logarithmically with ribbon width, fixed-depth ansatz accuracy degrades with Hilbert space dimension. Crucially, deepening the ansatz improves ideal simulation accuracy by over three orders of magnitude but worsens energy estimates under noise, proving that practical circuit depth is bounded by hardware noise rather than expressivity. Finally, we complement energy evaluations with a wavefunction-level diagnostic measuring subspace containment. This diagnostic captures degenerate manifolds and exposes optimization failure modes disguised by energy agreement alone. Operating directly on NISQ hardware, this validated workflow establishes a controlled baseline for studying topological and strongly correlated phases in realistic materials.
Substantially Improved Rate and Distance for Addressable Transversal Phase Gates
View Full Abstract
An important ingredient in fault-tolerant quantum computation is asymptotically good codes with fully addressable transversal non-Clifford gates. Existing constructions, however, provide only small explicit guarantees for rate and relative distance. Here, we substantially improve these guarantees for fully addressable transversal phase gates at every fixed level $h\ge3$ of the Clifford hierarchy, using a cyclic encoding beyond the binary CSS framework. The encoding separates logical phase control from the joint design of rate and distance, enabling two constructions with different computational costs. A deterministic polynomial-time algebraic-geometric construction gives a common asymptotic lower bound of $52/(675h)$ on both quantities. A counting argument gives an exponential-time construction with exact verification, improving this bound by a factor of approximately $2.86$. We further establish a universal upper bound for codes supporting fully addressable transversal single-qubit phase gates. Within our cyclic encoding framework, we obtain a stronger upper bound that is approximately $1.28$ times the lower bound achieved by our exponential-time construction. As concrete examples, we construct codes with $48$ and $90$ physical qubits supporting fully addressable transversal $T$ gates. These results narrow the gap between achievable code parameters and addressability bounds, providing quantitative targets for further improvements in efficient code constructions.
Generalized Lorentz Framework for Active Semiconductor Quantum Surface Plasmonics
View Full Abstract
Nanostructured semiconductors provide an actively tunable platform for light-matter interactions across a broad spectral range. As feature sizes shrink to the deep nanoscale (~10 nm scale), nonclassical carrier dynamics and surface plasmonic responses become prominent, creating substantial challenges for a rigorous and efficient theoretical treatment. Here we develop a generalized Lorentz framework for quantum surface plasmonics in nanostructured semiconductors with arbitrary energymomentum dispersion relations. The framework enables efficient quantitative treatment of carrier nonlocality, carrier surface accumulation and depletion, and nonlocal damping in three-dimensional semiconductor nanostructures, under electrical tuning and across a wide range of doping densities. Building on this framework, we further establish a rigorous quasinormal-mode analysis that provides transparent physical insight into complex surface plasmonic responses of multiscale semiconductor structures. We demonstrate electrically controlled deep-nanoscale carrier accumulation and depletion in a semiconductor nanoantenna, leading to pronounced plasmonic-response modulation that can be interpreted in terms of eigenmode shifts, creation, and annihilation. By quantifying and linking complex nonclassical carrier dynamics with plasmonic eigenmodes, our work establishes a comprehensive quantitative framework for active semiconductor quantum surface plasmonics and will foster the convergence of electronics and photonics at the deep nanoscale.
Transferable Lindblad Variational Ansatz for Accelerated Steady-State Preparation
View Full Abstract
Open quantum systems naturally relax toward steady states that underpin diverse nonequilibrium phenomena and quantum technologies. We independently control the coherent and dissipative constituents of a Lindblad generator to construct a variational product formula, termed the Lindblad variational ansatz (LVA), that accelerates steady-state preparation over natural relaxation through an optimized preparation path. The protocol consists of small-system learning, continuation to greater depth, and transfer to larger systems, followed when needed by reference-free post-training on quantum simulators. We demonstrate LVA in a bulk-dissipative Ising chain and a boundary-driven Heisenberg chain, where transferred protocols achieve matched preparation accuracies with fewer generator blocks than time-optimized first- and second-order Trotter formulas. The acceleration arises from coordinated endpoint preparation: earlier controls shape the dissipative-mode amplitudes so that the final dissipative step brings multiple components simultaneously close to their target values. Our results suggest a route to open-system quantum simulation that combines classical training on small systems with deployment and optional refinement on larger quantum devices.
Fast verification of fault tolerant magic state preparation circuits with the CNOT + T gate set
View Full Abstract
Magic state preparation is often among the most expensive operations in a fault tolerant quantum computation. One obstacle to coming up with better magic state preparation circuits lies in verifying their fault tolerance properties, as it is difficult to verify either by hand or in software that a very large number of combinations of faults do not give rise to high-weight or logical errors, especially in a non-Clifford circuit. In this work, we propose the use of the CNOT + T gate set to fault-tolerantly prepare a large class of magic states. We consider the propagation of Pauli faults within CNOT + T circuits and derive properties similar to those of Pauli faults within Clifford circuits, with a view to verifying fault tolerance as efficiently as possible. We present Comb, a library that can verify the fault tolerance of CNOT + T magic state preparation circuits, and demonstrate its use in verifying the fault tolerance of distance three and distance five magic state preparation circuits in minutes on a laptop. We present a distance five magic state preparation circuit that was discovered using Comb. As an independent confirmation of Comb's correctness we compare its findings to circuit-level noisy simulations for several magic state preparation circuits.
Quantum sensing of a weak drive signal in cascaded quantum van der Pol oscillators
View Full Abstract
We have constructed a quantum sensing system composed of two quantum van der Pol (vdP) oscillators. Coherent and dissipative couplings are combined to establish a generic nonreciprocal coupling between the two vdP subsystems. A weak driving signal to be measured is applied to an oscillator (probe system) and then transferred via non-reciprocal coupling to another oscillator (measurement system) that is easier to measure. This allows for the acquisition of information about the driving strength of the signal being measured. For the classic cascaded dual vdP oscillators, complete non-reciprocal coupling yields a much higher susceptibility than a single classical vdP oscillator alone. For the quantum vdP system, the sensitivity generally does not diverge at the zero driving force point. When only dissipative coupling and two-particle loss are present, the system will have a dark mode at the zero driving force point, which enables the measurement precision to ultimately reach the Heisenberg limit in the time domain. Enhancing incoherent driving can effectively resist dissipation and thereby improve measurement precision. Moreover, in the strong incoherent driving regime, the improvement factor of non-reciprocal coupling over reciprocal coupling in terms of measurement precision tends to infinity as the two-particle loss rate of the measurement system approaches zero.
Conditional Quantum Priors for Chaotic Fluid Dynamics
View Full Abstract
Neural networks that predict chaotic dynamics can reproduce short trajectories while misrepresenting statistics over long times. Quantum priors represent selected dynamical statistics through quantum generative models and provide statistical constraints for classical neural networks. Training a separate prior for each value of a system parameter, such as the Reynolds number, does not explicitly model how these statistics vary with that parameter. We learn a conditional quantum prior that approximates selected statistics of an invariant measure at unseen parameter values within the training range, without retraining. For Lorenz-63, the prior reduces mean Jensen-Shannon divergence by 56.9% relative to a classical multilayer perceptron with a comparable number of weights across 96 unseen parameter values. Across 101 values of the same parameter, the shared prior uses 84.7% fewer trainable weights than would be required by a separate quantum neural network at each value. We then use the learned prior to regularize classical neural networks, encouraging their autoregressive rollouts to better reproduce long-term statistics. For Kolmogorov flow at Reynolds number $Re=1000$, prior regularization reduces forecast mean squared error by 66.0% over 318 steps relative to the classical baseline without prior regularization. We also implement a photonic quantum prior for noisy intermediate-scale quantum (NISQ) devices, achieving a mean Jensen-Shannon divergence of $4.58\times10^{-3}$ for Lorenz-63 and $2.59\times10^{-3}$ for Kolmogorov flow at unseen parameter values.
Autonomous cooling of Kerr-cat qubits to minutes-long bit-flip times
View Full Abstract
Quantum error correction becomes more hardware efficient when physical noise is strongly biased towards one error channel. Cat qubits realize such a bias by encoding information in two opposite coherent states of a superconducting oscillator, so that bit flips are exponentially suppressed with photon number while phase-flip rates increase only linearly. In Kerr-cat qubits, a driven double-well potential confines these states and enables fast coherent control, but excitations can induce interwell switching, limiting bit-flip times to milliseconds. Here we show that the nonlinear interaction generating the confinement can also cool these excitations. When an intra-well transition becomes resonant with a lossy readout mode, excitations are transferred out of the qubit and dissipated, as established by spectroscopy and relaxation measurements. We observe the predicted exponential scaling of Kerr-cat bit-flip times with photon number, reaching 450 s, over five orders of magnitude beyond previous demonstrations. Phase-flip rates remain consistent with intrinsic photon loss at operating points with seconds-long bit-flip times. We further demonstrate fast Z gates without measurable degradation of bit-flip protection and single-shot readout with a bit-flip probability below $10^{-6}$ per measurement. Autonomous cooling thus brings minutes-long bit-flip protection to Kerr-cat qubits while retaining fast coherent control, without additional cooling drives or circuit elements.
Rotating two-dimensional Bose--Einstein condensates in power-law traps: collapse, Thomas--Fermi scaling, and the inverse-square endpoint
View Full Abstract
In two dimensions, the kinetic and contact energies scale identically under dilation, a trap $V=r^s/s$ as $λ^{-s}$. We follow this balance through the power-law family $-2\le s\le4$, $s\neq0$, for both signs of the coupling $g$, with rotation, using scaling bounds, radial solutions, Bogoliubov spectra, and two-dimensional imaginary-time states. Attraction collapses the cloud at the Townes coupling $g_{*}$ in every trap, with width $\ell\proptoδ^{1/(s+2)}$, $δ=1-|g|/g_{*}$; repulsion spreads it to a Thomas--Fermi (TF) radius $\propto g^{1/(s+2)}$. A rotating collapse leaves the axis once the rotation frequency $Ω$ exceeds its dipole frequency, which softens only for $s>2$; in a quartic trap this happens at $δ\simeq0.32\,Ω^6$, within $3\%$ of the Bogoliubov threshold; it then collapses on the minimum ring of the rotating-frame potential, which also empties a repulsive TF cloud at $Ω=(3g/π)^{1/6}$. For repulsive vortex states the TF energy error splits exactly into a density-gradient and a flow part of comparable or larger size. At $s=-2$ only the cutoff sets a length: the energy is exactly covariant with it, the condensate falls to the center for both signs, and repulsion leaves a halo of density $\propto1/(gr^2)$ whose extent grows exponentially with $g$. Near collapse, split-step imaginary time has a first-order stationary bias invisible to residual tests.
Mitigating small gaps in quantum annealing through recursive $XX-$catalyst construction
View Full Abstract
The introduction of $XX-$interactions, typically in the form of an additional catalyst Hamiltonian, has shown promise as a tool for gap enhancement in quantum annealing, allowing the algorithm to obtain optimal solutions with shorter run-times. However, the optimal placements of these couplings within the problem graph has been found to be highly setting-dependent. In this work, we propose an iterative catalyst-construction protocol for the removal of a common quantum annealing bottleneck known as perturbative crossings. The method utilises the measurements returned by successive annealing runs to effectively steer the algorithm away from the local optima in which it becomes trapped. First, we motivate a framework for $XX-$term selection based on perturbation theory and establish its effectiveness at removing perturbative crossings on scalable toy instances with up to $39$ spins, demonstrating a consistent performance both with increasing system size and number of local optima. We then simulate the recursive catalyst-construction method on a test set of $18-$spin maximum-weight independent set problems that are generated to produce annealing spectra with multiple perturbative crossings. We find that the protocol significantly outperforms both catalyst-free annealing and annealing with catalysts containing randomly selected $XX-$terms.
Sleep-Disordered Breathing Detection with Quantum Recurrent Neural Networks
View Full Abstract
This work investigates the application of Quantum Recurrent Neural Networks to the binary classification of sleep-disordered breathing events in time-series data, aiming to distinguish between apneic and normal breathing episodes. A variational classical--quantum architecture is proposed and evaluated against classical Recurrent Neural Network models. Experiments were conducted on multiple real-world datasets with varying levels of complexity to assess the strengths and limitations of the quantum approach. In the comparative analysis, both classical and quantum models showed comparable performance. The quantum model achieved superior performance on the smallest dataset, while yielding slightly weaker results in the most complex setting. However, the quantum approach exhibited notable strengths, such as competitive performance despite a drastically reduced parameter count and low-qubit regime, as well as good generalization capabilities. These results suggest that, despite current hardware and algorithmic limitations, variational quantum recurrent models represent a promising alternative for time-series classification as Quantum Computing technologies continue to mature.
Bulk and edge states in Fibonacci-Bose-Hubbard clusters
View Full Abstract
We study the one- and two-boson energy subspaces of finite open Bose--Hubbard chains with Fibonacci-modulated hopping and zero on-site potential. Their spectra exhibit a hierarchy of bands and gaps, and a critical zero-energy mode for odd lengths, in agreement with prior research. For the singe-excitation subspace we find two families of length-invariant finite-energy states localized at the left cluster boundary. For the two-boson subspace, we report both doublon and separated-pair excitations in the form of Tamm/Shockley states localized near either end. In particular, the right-edge doublon states occur across all Fibonacci generations whereas the left-side states appear every second generation. We check numerically that the second-order perturbation theory accounts well for the structure of the spectrum and the edge states in the doublon subspace in the strong-coupling regime. The results are useful for future explorations of many-body physics beyond numerical tractability, specifically using near-term Josephson quantum simulators.
Temporal stretching of single-photon pulses by intra-cavity frequency conversion
View Full Abstract
Spectral bandwidth and frequency mismatch between quantum light emitters and quantum components is a common problem in the realization of hybrid quantum information networks. Here we propose a simultaneous solution to both of these problems by using a free-space cavity with an embedded nonlinear crystal that, through frequency conversion, facilitates perfect coupling into a cavity mode. The slow leakage of the cavity effectively stretches the photon pulse, resulting in a much longer photon pulse at a different wavelength. We show that the amount of stretching is strictly limited by the finesse and length of the cavity. Including realistic internal losses in the cavity, we show that it is possible to stretch a photon by at least two orders of magnitude with high efficiency. The proposed setup can thus constitute a valuable addition to the toolbox of quantum information technologies.
Nonlinearity-Induced Suppression of Dissipation in Bath-Coupled Floquet Topological Insulators
View Full Abstract
Topological insulators can host chiral, disorder-robust edge states that dissipate energy when coupled to an external bath. We show that nonlinear interactions enable all-optical control over edge-state dissipation in a laser-written Floquet topological insulator periodically coupled to a photonic bath. Although moderate nonlinearity enhances dissipation due to mode mixing, increasing the nonlinear strength to an optimal value dramatically suppresses dissipation by forming highly localized traveling edge solitons. These results establish engineered system-bath coupling and nonlinear interactions as a route to suppress dissipation of chiral topological edge transport.
Bayesian optimization enhanced magnetic field gradient detection based on spin-orbit coupled Bose-Einstein condensates
View Full Abstract
Magnetic field detection is of great significance in modern fields such as medical diagnostics, geological exploration, inertial navigation, and space physics. We have previously investigated the expansion dynamics of a spin-orbit-coupled Bose-Einstein condensate. Building on these results, here we propose a scheme for magnetic-field-gradient detection by establishing a quantitative relationship between the condensate's rotational deflection angle and the magnetic-field gradient. In this work, we present the parameter dependence of this scheme and perform a systematic optimization. We introduce a Bayesian optimization algorithm to automatically and efficiently search for the optimal combination of key parameters, thereby significantly enhancing the sensitivity of the magnetic field gradient measurement. The results show that the optimized gradiometer improves the sensitivity by a factor of five. This work not only provides a new approach for magnetic field gradient measurement but also serves as a reference for machine learning-empowered quantum precision measurement.
Closed- and open-system characterization of the Yukawa-SYK model in real time
View Full Abstract
Strongly correlated matter without quasiparticles is central to many-body physics, quantum chaos, and quantum gravity, motivating a considerable effort toward its realization in tabletop experiments. Two challenges remain: laboratory platforms are open systems, so conformal behavior must survive dissipation, and it must be identified through measurable quantities. We address both challenges in the Yukawa-Sachdev-Ye-Kitaev (YSYK) model, in which bosons and fermions interact as in, e.g., light-matter systems, but through random all-to-all couplings that drive the boson to criticality without fine tuning. Solving the model in real time using the Schwinger-Keldysh formalism, we treat closed and open systems within a unified framework and, in both cases, consider a thermal steady state to map their phase diagrams. In addition to the known conformal and impurity (or SYK$_2$) regimes, we identify novel high-temperature regimes in which the fermions are driven by an essentially bare boson and show that their dynamics is captured by a quadratic model with time-dependent random hopping. Across all regimes, the fermionic softening of the boson is bounded by a ``criticality budget'' determined only by the Yukawa coupling and the temperature. Coupling the boson with a thermal environment induces a mass shift that deforms the boundaries between different regimes and exhausts the criticality budget, thus imposing a bound on temperature and dissipation rate compatible with self-tuned criticality. We further introduce a set of markers built from the two-point functions that separate all identified regimes, are accessible in linear response, and require no fit of the conformal exponents. We complement them with the quantum Fisher information, deriving upper bounds with and without dissipation. These results may help characterize holographic quantum matter beyond the closed setting.
Quantum Simulation of Electronic Structure using Quantum Density Functional Theory on a Programmable Integrated Photonic Circuit
View Full Abstract
Quantum simulations of molecular electronic structure hold the potential for computational advantage but are inherently limited by the linear scaling of qubit requirements with respect to system size. Quantum Density Functional Theory (Q-DFT) addresses this constraint by reformulating the interacting many-body problem in terms of a non-interacting Kohn--Sham reference system. Here, we present and experimentally validate a Q-DFT algorithm that requires only $\mathcal{O}(\log_2(N))$ qubits to simulate a system of $N$ orbitals, thereby reducing resource overhead. More precisely, we solve the Kohn--Sham problem for the lithium hydride (LiH) molecule using the ensemble extension of the variational quantum eigensolver paradigm that minimizes the energy of the system in the subspace spanned by the ground and first excited states. To execute this task, we encode the problem with qubits on a quantum photonic platform, utilizing an architecture that combines a deterministic quantum dot single-photon source with a programmable integrated photonic circuit. By evaluating the molecular ground- and first excited-state properties, this work establishes a pathway for simulating larger molecular systems, demonstrating the viability of integrating qubit-efficient algorithms with advanced reconfigurable photonic hardware for near-term quantum chemistry applications.
Breakdown of Linearized Dispersion in Waveguide QED
View Full Abstract
Exploring interactions between quantum emitters and guided photons, waveguide quantum electrodynamics (wQED) offers a versatile platform for quantum simulation and quantum interconnect. To simplify the quantized light-matter interactions, a linearized dispersion approximation (LDA) was widely used in wQED under the conditions of weak coupling and narrow photonic bandwidth. However, a growing number of strong-coupling wQED experiments have called the validity of LDA into question. Here, by investigating giant atoms coupled to a semi-infinite waveguide, we propose a principle to judge the validity of LDA. We find that the decoherence of the atoms exhibits rich dynamical behaviors determined by different numbers of bound states in and out of the continuum (BICs and BOCs) formed in the energy spectrum of the total atom-photon system. Based on this, we show that despite the LDA can partially preserve some of BICs, it completely erases BOCs. This causes the dominant role of LDA in the atomic dynamics to break down. Providing a physical insight into the validity of LDA, our results lay a firm foundation for exploring fundamental physics and its application frontier in strong-coupling wQED platforms.
Cooperative Suppression of Two-Particle Excitation by Kerr Nonlinearity and Cavity Loss ion a Driven Holstein-Tavis-Cumming System
View Full Abstract
We apply the numerically accurate multiple Davydov Ansatz (multi-$\rm D_2$) method to investigate the nonequilibrium dynamics of an open molecular cavity system using an extended driven-dissipative Holstein-Tavis-Cummings model incorporating Kerr nonlinearity. Our results reveal that the synergy between Kerr nonlinearity and exciton-phonon coupling induces an anharmonic level structure, imposing a stringent energy penalty that isolates the one-excitation manifold. This establishes a robust single-excitation-dominated regime that dynamically manifests photon blockade, characterized by suppression of the pure two-photon state and isolation of the one-excitation manifold. While strong coherent driving induces power broadening that overcomes the nonlinear barrier and opens multiphoton channels, cavity dissipation counteracts this process by acting as a highly selective manifold filter. By preferentially depleting fragile multi-photon states while sheltering single excitations within dissipation-free dark states, the cavity mode decay rate actively cooperates with Kerr nonlinearity to restore and reinforce the photon blockade effect. These findings elucidate the intricate interplay among nonlinearity, driving, and dissipation, offering a theoretical blueprint for engineering robust single-photon sources in open molecular cavity platforms.
An Excursion into Grassmannian Spectra
View Full Abstract
We revisit the classical spectral problem for the Laplace-Beltrami and Laplace-Bochner operators on complex Grassmannians. After reviewing the standard approach based on non-commutative harmonic analysis, we develop two complementary methods originating from the quantization of the corresponding one-dimensional sigma model, both with and without a magnetic monopole field. The first is based on $\mathbf{SU}(n)$-equivariant first-order GLSM formulation and gives explicit eigenfunctions in terms of projectors and Plücker coordinates. The second uses a spin-chain realization of free particles on manifolds and describes the space of square-integrable functions, or sections in the magnetic case, through limiting tensor products of long rectangular $\mathbf{SU}(n)$ representations. Together, these approaches provide a more explicit picture of the spectral geometry of Grassmannians and clarify the relation between harmonics, Young diagrams, magnetic bundles, and Laplacian spectra.
Adaptive Self-Optimization of Polarization Efficiency for Low-Power NV Center Thermometers Based on PAS-Q
View Full Abstract
Nitrogen-vacancy (NV) centers in diamond have attracted considerable attention for micro- and nanoscale thermometry owing to their high precision and spatial resolution. However, achieving sufficient electron spin polarization and signal-to-noise ratio (SNR) typically requires high-power or long-duration laser excitation, which introduces heating and degrades measurement accuracy and stability. To address this trade-off, a reinforcement learning (RL)-based approach is proposed to optimize spin polarization under low-heating constraints. First, a physical model integrating five-level optical pumping rates and NV spin polarization dynamics is established. A temperature-rise constraint model is then developed based on pulsed optically detected magnetic resonance (P-ODMR) measurements under varying laser powers and pulse widths in an external magnetic field. Subsequently, a Progressive Action-Space Q-learning (PAS-Q) algorithm is employed to explore the parameter space and identify optimal laser power and pulse-width combinations. The agent is trained through numerical simulations and the resulting strategy is implemented in a hardware system. Experimental results demonstrate a 44% reduction in laser-induced heating, a 33% increase in spin polarization rate based on T1 relaxation analysis, and a 71% reduction in optimization time compared with traditional methods. This approach enables efficient spin polarization with reduced laser heating and improved optimization efficiency, and may be extended to other heat-sensitive quantum spin sensors, including silicon-vacancy centers in diamond and divacancy defects in silicon carbide.
Spectral Quantum Memory for Implicit Neural Representations
View Full Abstract
Implicit neural representations (INRs) model signals as continuous functions from coordinates to values, but their performance depends strongly on how spectral capacity is allocated. Yet most Quantum INR (QINR) architectures treat spectral components as independent outputs of separate quantum blocks. We introduce the Spectral Quantum Memory Model (SQMM), a memory coupled quantum INR in which sequential hybrid data reuploading layers (bands) communicate through a shared coherent quantum memory register. Each band reads the memory, computes on its own coordinate upload, and writes part of its state back, so later bands can build on the computation of earlier ones. When memory read and write layers are input independent, we prove that the memory state forms an operator valued Fourier series whose support is contained in the Minkowski sum of the initial memory spectrum and the local band spectra. Downstream bands then condition their Fourier coefficients on the spectral content stored by earlier bands, and the memory coupling creates no new primitive frequencies. This theory motivates a spectral memory alignment loss that encourages memory to encode the spectrum expressed by the deployed prefix of the model. Across audio and image reconstruction benchmarks, SQMM improves over compact QINR and INR baselines.
On Random Purifications of Isometries and Channels
View Full Abstract
Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns $t$ copies of a mixed state into $t$ copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension $N$ to dimension $M$, we give an efficient, stateful simulator for $T$ sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error $O(T\sqrt{N/(M-T)})$. This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below $1/2$ requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to $φV$ for a random phase $φ$ can be transformed into one using the same number of uncontrolled forward queries to $V$, generalizing the analogous result for unitaries.
Time-invariant negativity and persistent bound entanglement in a cyclic two-qutrit family
View Full Abstract
We study the entanglement dynamics of two qutrits under collective dephasing for a family of states obtained by mixing a maximally entangled state that lives in the decoherence-free subspace with three nonstationary two-term states sharing a common amplitude ratio $r$. We obtain exact PPT and separability regions along the whole trajectory, a specialization of known results on cyclic sign invariant states, and we supply explicit certificates: a finite product decomposition, three fixed positive-map witnesses, and a closed realignment formula that detects every PPT-entangled state, so that no state is left undecided. The negativity is computed in closed form. It shows that the entanglement is time-invariant, positive and constant from the initial time although the state changes, exactly when the weight of the maximally entangled state exceeds the threshold $U_r=r/(1+r+r^2)$. To our knowledge, this is the first demonstration of time-invariant entanglement for qutrit--qutrit systems under collective dephasing. For smaller weights the entanglement decays and vanishes at a finite time: the state either becomes separable (entanglement sudden death) or, for $r\neq1$ in an intermediate range, loses distillability suddenly and remains bound entangled at all later times. Every state with negative partial transpose is one-copy distillable by a fixed local projection. The same trajectories arise from the global dephasing map and from a correlated local random-unitary semigroup, although the two channels differ on product inputs. Exact rational benchmarks and embeddings of the Horodecki and Ha--Kye--Park families are provided.
Wigner-Function Fingerprints of Collective Excitations in Mirror-Terminated Waveguide QED
View Full Abstract
We investigate the emission profiles of singly excited collective states and propose a matched-mode witnessing protocol in a mirror-terminated waveguide quantum electrodynamics system. The amplitudes and relative phases of the initial collective excitation are encoded in the temporal mode of the emitted single-photon wavepacket, providing a route to state verification through the common waveguide output. We identify the emission mode associated with a chosen target state and employ an auxiliary virtual-cavity representation to evaluate the quantum state of this selected output mode. For a matched initial state, the selected mode contains the emitted single photon, whose Wigner function exhibits a pronounced non-classical negative dip, serving as a distinct fingerprint of the target many-body state. With the reference mode held fixed, different initial configurations yield different photon occupations and phase-space distributions, demonstrating the state selectivity of the protocol. These results connect collective-state verification with temporal-mode analysis of the emitted radiation, offering access to collective coherence with reduced reliance on qubit-resolved correlation measurements.
Decoy-state quantum key distribution with a leaky Mach-Zehnder receiver
View Full Abstract
We prove the security of phase-encoded decoy-state BB84 quantum key distribution for a Mach-Zehnder receiver with imbalanced beam splitters and two threshold detectors that leak fine-grained information about the detection patterns. For this, we derive a lower bound on Bob's single-photon contributions and combine it with the decoy-state method and a recent phase-error framework for leaky receivers. The leakage-induced correction to the phase-error rate is independent of channel loss, providing a loss-tolerant treatment of receiver leakage even in the presence of beam-splitter imbalance. Our results provide a practical route toward loss-tolerant security proofs for imperfect QKD receivers in the presence of receiver leakage.
Wavefront engineering with atomic Huygens' surfaces made simple
View Full Abstract
Atomic arrays provide a cooperative platform for light-mediated interactions in nonlocal metasurfaces which can operate in the quantum regime without nanofabricated optical elements or intrinsic material absorption. We present a minimal atomic implementation to harness wavefront engineering and create a near-ideal intrinsic atomic Huygens' surface. A simple bilayer square lattice with a two-atom unit cell, not limited to small lattice spacings, provides near-unity reflectionless transmission and a full $2π$ phase control of transmitted light without the localized site-dependent level shifts of previous proposals. This simplification is achieved through nonlocal radiative excitations that provide the familiar electric-dipole response with even radiation parity as well as an odd-parity radiation channel whose leading multipolar interpretation combines magnetic-dipole and electric-quadrupole contributions in atoms exhibiting only electric dipole transitions. This eliminates the need to simultaneously excite pure electric-dipole and magnetic-dipole responses with exactly matched radiation. We derive a two-mode model for this response and show that it accurately captures full coupled-dipole simulations near the optimal lattice spacings. Because of the wide applicability of coupled-dipole models, the relevance of our microscopic analysis extends beyond atomic physics to nanostructured metasurfaces. Moreover, the same platform also connects directly to established subradiance-protected single-photon storage protocols, suggesting a route toward combining wavefront engineering, storage, and retrieval in a simple atomic bilayer.
Long-lived quantum memories with rare-earth ions doped in crystals
View Full Abstract
Quantum memory is a core enabling device for large-scale quantum networks, serving as the fundamental building block for quantum repeaters and transportable quantum memories. Among various physical platforms, rare-earth-ion-doped crystals stand out as one of the most promising solid-state candidates for long-lived photonic quantum memories, owing to their exceptionally long spin coherence time and their compatibility with integration. In this review, we first introduce the physical mechanisms underlying long-lived spin coherence in rare-earth systems, with particular emphasis on the zero-first-order-Zeeman transition and dynamical decoupling techniques. We then review the experimental progress in this field, highlighting three distinct lifetimes--the spin coherence time, the light storage time, and the quantum storage time--and covering experiments that have achieved hour-scale spin coherence, minute- to hour-scale light storage, and minute-scale single-photon-level quantum storage. Finally, we discuss the remaining challenges that hinder the realization of practical long-lived quantum memories, explore potential strategies to overcome these obstacles, and outline the prospects for their future applications in quantum networks.
Quantum channel tomography: optimal bounds in the near-boundary regime
View Full Abstract
Quantum channel tomography (also known as quantum process tomography) is a fundamental task in quantum information and quantum computing, aiming to learn the full description of an unknown quantum channel from black-box queries. For channels with input dimension $d_1$, output dimension $d_2$, and Kraus rank at most $r$, [CGO+26] identifies the dilation rate $τ=rd_2/d_1\geq 1$ as a key parameter governing a Heisenberg-to-classical transition in query complexity. While the optimal bounds in the boundary regime ($τ=1$) and the away-from-boundary regime ($τ\geq 1+Ω(1)$) are now known, the precise behavior in the near-boundary regime ($1<τ<1+o(1)$) has remained unresolved. In this paper, we close this gap, thereby fully settling the query complexity of quantum channel tomography. Specifically, we show that the query complexity is - $Ω(rd_1d_2/\varepsilon^2)$ for diamond norm error $\varepsilon$, matching the upper bound by [MB26, CGO+26], - $Θ(d_1^2/\varepsilon+\min\{(τ-1)d_1^2,(τ-1)^2d_1^2d_2^2\}/\varepsilon^2)$ for Choi trace norm error $\varepsilon$. Our results reveal two qualitatively different forms of the Heisenberg-to-classical transition. For diamond norm tomography, the Heisenberg scaling disappears suddenly as soon as $τ$ leaves the boundary regime. In contrast, Choi trace norm tomography exhibits a gradual transition from Heisenberg to classical scaling as $τ$ moves from the boundary regime to the away-from-boundary regime.
Mutual information to all orders from modular flow: a replica-free approach
View Full Abstract
We derive an all-orders long-distance expansion of vacuum mutual information between two disjoint balls in generic $d$-dimensional CFTs. The derivation uses a novel radial sewing expansion of the joint vacuum density matrix, together with a modular response formula for relative entropy and the geometric modular flow of a single ball, without analytic continuation in replica number. The expansion coefficients are modular integrals of modular-flowed vacuum correlators. Our formula provides a systematic treatment of arbitrary multi-point sectors, and recovers known results on two-point sector derived from replica methods. The full two-point sector resums into a modular integral of the thermal partition function on $S^{d-1}$, with an effective temperature depending on ball configuration and modular time. We compute the expansion explicitly in CFTs. In two-dimensional Ising CFT, using analytic reductions and multidimensional numerical integration, we obtain the first ten radial orders in the long-distance expansion, which involve sphere correlators with up to twenty spin insertions. The truncated expansion agrees well with lattice data at finite separation, and approximately satisfies crossing symmetry. Analytic calculations also reproduce known expansion coefficients for 2d free compact boson at self-dual radius and its current sector, as well as for free scalars in higher dimensions.
Lee-Yang theorems for $q$-deformed oscillators and doubly-scaled SYK
View Full Abstract
We show that the vacuum partition function of the $q$-deformed oscillator \[ L_q(z):= \langle0|e^{zT_q}|0\rangle, \qquad T_q := \mathsf{a}_q + \mathsf{a}_q^* \] satisfies the Lee-Yang property, i.e., all zeros of $L_q$ lie on the imaginary line for all $q\in[-1, 1)$, proving the conjectures of Okuyama'23. Using the connection between $q$-deformed oscillators and the Sachdev-Ye-Kitaev (SYK) Hamiltonian in the doubly-scaled regime, we show that the annealed SYK partition function satisfies the Lee-Yang property in the thermodynamic limit, that is, all of its Fisher zeros are on the imaginary axis. As a result, we show that the quenched SYK partition function admits a zero-free strip of constant width with high probability, rigorously complementing the large$-k$ replica calculations of Zlokapa and Kiani'26. We show the imaginary-rootedness of $L_q$ by expressing $\varphi_q(z):= L_q(\mathbf{i} z)$ as a locally uniform limit of ``$q$-deformed'' matching polynomials and then showing that those $q$-deformed polynomials are real-rooted. This establishes that $\varphi_q$ is real-rooted, and in fact belongs to the \emph{Laguerre-Pólya} class. The real-rootedness of the $q$-deformed polynomials yields novel log-concavity relations on the \emph{$q$-deformed matching moments} \[M_\ell(q):= \sum_{π\in\mathcal{P}_2(2\ell)}q^{\operatorname{cr}(π)}.\] We show the real-rootedness of the $q$-deformed polynomials by using the Touchard--Riordan formula to derive a partial differential equation relating their $q$-derivatives to their $z$-derivatives, and then analyzing the resulting motion of their roots.
Spacetime Emergence in the Memory of a Learning Agent
View Full Abstract
We show that the causal structure of spacetime can emerge within the memory of a learning agent performing a quantum information task. We train a model-based reinforcement-learning agent to maximize the quantum mutual information between localized quantum probes interacting with a quantum field in Minkowski spacetime, without directly providing it with information regarding the spacetime metric or causal structure. In learning to accomplish this task, the reinforcement-learning agent constructs an internal predictive model whose planner develops the characteristic null structure of spacetime, allowing us to reconstruct the causal structure of the Minkowski metric with high accuracy. Within this task, spacetime geometry is obtained from an agent's successful predictions and actions, providing a first step toward showing that spacetime concepts emerge from operational quantum experience.
Single-pass stochastic cooling for electron microscopy
View Full Abstract
Scientific applications of free electrons, such as in electron microscopes and particle accelerators, are limited by the brightness of available electron sources. Accelerators can use phase space cooling to surpass these source limitations, whereas electron microscopes can only rely on particle filtering to increase beam coherence at the cost of reduced brightness. We show that strong electron-light coupling in nanophotonic structures makes it possible to achieve single-pass stochastic cooling inside an electron microscope for a lossless improvement of longitudinal emittance. This approach is laser-free and compatible with normal CW operation of electron microscopes. We derive a fully quantum mechanical model of stochastic cooling valid in the strong coupling regime, finding an analytic asymptotic formula for the optimal cooled energy spread $σ_{E_f}\simeq0.88(\hbarω)^{2/3}σ_{E_0}^{1/3}$, with $\hbar ω$ the cooling photon energy and $σ_{E_0}$ the initial energy spread. Numerical simulations confirm that the energy spread reduction is reflected in an increase in the purity of the electron's quantum state and a reduction of the longitudinal phase space area. Our work paves a path towards even brighter beams for electron microscopy, promising higher image quality, enhanced spectral resolution, and a route to reaching fundamental quantum limits on electron beam phase space area.
Quantum Private Information Retrieval on Forests
View Full Abstract
We consider the problem of graph private information retrieval (PIR) in the quantum setting. We focus on a specific type of graphs, namely the forest graphs. A forest graph is a union of disjoint trees. We consider the quantum setting where all the servers share an entangled state. Each server is allowed to send only one qudit per retrieval round. We design a scheme for the forest graphs that achieves the rate of $\frac{3}{N}$. The scheme uses a GHZ state as the initial entangled state between the servers prior to the scheme initiation. We compare our scheme with the only work done in the literature that considered the quantum setting of graph PIR. We show that our scheme is more efficient in this setting. We derive the quantum capacity for the case of $G=3K_2$, which is equal to $4/6$. $G=3K_2$ is a special case of the forest graph. We design a scheme that is specialized for this graph, achieving a rate equal to $4/6$ and provide the corresponding matching upper bound, establishing it as the capacity.
Unifying entanglement and nonclassicality via the Narcowich-Wigner spectrum
View Full Abstract
Entanglement and nonclassicality are two fundamental features of quantum mechanics which serve as resources in quantum information processing tasks and are tightly connected by two-mode mixing. In this work, we show that the connection between entanglement and nonclassicality extends well beyond the two-mode mixing setting by considering the case of arbitrary multimode Gaussian evolutions. Using the Narcowich-Wigner spectrum as our main technical tool to quantify single-mode phase-space nonclassicality, we derive sufficient conditions for a single-mode state to generate NPT entanglement after a multimode Gaussian unitary evolution, which both tighten and generalize existing criteria. As an application, we obtain simple single-mode protocols for quantitatively testing the entanglement structure of multimode quantum states over arbitrary bipartitions. Our results identify the Narcowich-Wigner spectrum as a powerful tool for investigating fundamental properties of bosonic quantum states.
Quantum tomography on Schwartz space
View Full Abstract
In this work we show that standard results in quantum tomography, which are typically proven in the context of Hilbert spaces, can analogously be established in the theory of Schwartz spaces. In particular, we will see that quantum states are equivalently characterized by their Wigner function, the characteristic of their Wigner function, and the probability distributions for a family of linear combinations of position and momentum. Physically, the latter can be understood as the evolution of its probability distribution in position over time under, for example, free or harmonic evolution. The result is obtained with techniques that are more accessible to a physicist audience, and shows that, at least for tomography results, the full structure of Hilbert spaces is not necessary.
On the Failure Probability of Quantum Leftover Hashing with Bad Seeds
View Full Abstract
We study hashing against quantum adversaries, as used in cryptographic applications, and provide bounds on the probability of failure in practical settings where seeds might be reused and might be non-ideal. Randomness extraction and privacy amplification are key components of quantum cryptographic protocols, such as quantum randomness generation or key distribution, that allow the compression of partially secure raw data into shorter output with high security. To ensure the security of any cryptographic construction that integrates them, it is desirable to establish composable security. This can be done by using methods based on universal hashing and leveraging the general leftover hash lemma, which allows extraction of near-uniform random numbers from an imperfect entropy source by sampling from an almost two-universal family of hash functions using a seed. This approach is taken in many practical implementations, commonly using Toeplitz hashing. The lemma provides an upper bound $\varepsilon$ on the distance of the output to uniform randomness, which holds on average over the choice of seeds. It makes no claim that any particular seed yields near-uniform random numbers. This poses a problem for practical applications where a seed is sampled once and reused for many rounds (blockwise hashing). Here, we study the subset of \textit{bad} seeds yielding far-from-uniform outputs. We show that randomness extraction against quantum side information is guaranteed to produce $δ$-close-to-uniform random numbers except with failure probability $\left(\frac{\varepsilon}δ\right)^2$. This result is generalised to blockwise hashing providing a guarantee of the security of $k$ rounds except with failure probability $\big(\frac{(2k-1)\varepsilon}δ\big)^2$. Moreover, we extend the general leftover hash lemma to blockwise hashing and relax the assumption of almost two-universality.
Exceptional Points and Optimized Encoding in Qubit Stabilizer Codes
View Full Abstract
Continuous blind stabilizer measurements turn stabilizer codes into a Liouvillian spectral problem in which Hamiltonian terms compete with dissipative error channels. We show that this competition generically enables Liouvillian exceptional points, whose occurrence at weak error rates is constrained by the code distance. Exceptional points are detrimental in this regime of error correction as they maximize the decay rate of encoded coherences. We then optimize the encoding of the logical qubit using the eigenmodes of the Lindblad operator. This phase-optimized encoding cancels the linear short-time decay of logical qubit coherences. We apply this encoding to the [[5,1,3]] code and demonstrate that it outperforms naive encoding methods near the exceptional point, improves the fidelity of a logical $π$ rotation and remains effective in the presence of additional weak error channels.
Surface charges and quantum reflection of hydrogen-isotope beams at grazing incidence
View Full Abstract
Experiments with cryogenic beams of hydrogen isotopes (hydrogen (H), deuterium (D), and tritium (T)) can be used to study quantum reflection from solid dielectric mirrors. Most dielectric surfaces carry trapped electric charges whose field polarizes the incident atom. We study theoretically how such charges, distributed randomly, in clusters, with compensation over a finite length, or in order, change specular reflection and diffuse scattering of H, D, and T at grazing incidence on typical dielectric mirrors (SiO$_2$/Si and MgF$_2$), for longitudinal velocities of 100--300~m/s and normal velocities of 3--100~cm/s which might become available soon in grazing incidence experiments. Starting from the exact coupled-channel equations, we show that the specular wave feels only the laterally averaged polarization potential, which is fixed by the structure factor of the charges and, for uncorrelated charges, is an inverse-square tail $-C_2/z^2$. The exact solution replaces the linear threshold law $1-\Rr\propto\vperp$ by the fractional power $\vperp^{2ν}$, $ν=(1/4-ζ)^{1/2}$, with the coupling $ζ\propto C_2$; for weak coupling, this appears as a logarithmic velocity dependence, and for $ζ>1/4$, the reflection coefficient oscillates log-periodically. At the surface charge density of $10^{12}$ cm$^{-2}$, absorption increases by up to 26\% for SiO$_2$/Si and by a factor of two to three for MgF$_2$; the effect increases with atomic mass, saturates for compensated charges, and is accompanied by diffuse scattering below $10^{-3}$ of charge-induced loss. We also formulate the condition of complete absorption at the solid surface.
Lossless propagation bounds for long-range fermionic interactions
View Full Abstract
We prove propagation estimates for extensive fermionic many-body interactions with polynomial time growth, no loss of spatial decay, and an optimal threshold for the polynomial spatial exponent. More precisely, we construct local representatives of evolved fermionic many-body interactions on metric spaces with polynomial volume growth of order $d_{\mathrm{vol}}$ and suitable cell partitions. For the even Hamiltonian interaction $Φ_u$ and the even interaction $Ψ$ being evolved, we assume bounds, uniform in the site, on sums of term norms over finite supports $X$ containing a given site, with weights $e^{κ|X|}(1+\operatorname{diam}X)^a$ and $e^{κ|X|}(1+\operatorname{diam}X)^p$, respectively. Here $a>d_{\mathrm{vol}}$, $0\le p\le a$, $κ$ is sufficiently large, and the Hamiltonian bound is uniform in time. We construct local representatives whose interaction norms with weight $e^{c(1+|t-s|)^{-b}|X|}(1+\operatorname{diam}X)^p$ grow at most polynomially in $|t-s|$, for suitable $c,b>0$. In particular, $p=a$ is allowed: the Hamiltonian need not decay faster than the interaction being evolved. The threshold $a>d_{\mathrm{vol}}$ is optimal in general: uniform polynomial time bounds at $p=a$ fail for $0<a\le d_{\mathrm{vol}}$, even for smooth time-dependent two-site interactions. Polynomial time growth permits integration against filters with sufficiently many finite absolute moments, including those used in quasi-adiabatic constructions and quantum belief propagation. We derive consequences for filtered interactions and the dynamics they generate, providing dynamical estimates for perturbation theory with extensive perturbations, including gap stability, the principle that local perturbations perturb locally (LPPL), adiabatic theory, and response theory. All results also hold for quantum spin systems.
Efficient thermalization of one-dimensional noncommuting Hamiltonians via system-bath interactions with $Θ(n)$ ancilla qubits
View Full Abstract
We prove rapid convergence of a system-bath interaction algorithm for preparing Gibbs states of one-dimensional noncommuting Hamiltonians at every fixed positive temperature. For a chain of $n$ qudits of local dimension $2^q$ with bounded nearest-neighbor interactions, the algorithm prepares the Gibbs state from any initial state to trace-norm error $0<\varepsilon\le1/2$ in expected total Hamiltonian evolution time $\widetilde{O}(n/\varepsilon)$. This improves the previously proved $\widetilde{O}(n^6/\varepsilon)$ bound for single-ancilla system-bath Gibbs samplers, up to logarithmic factors. The proposed algorithm couples $4^q-1$ resettable bath qubits to each site in parallel and randomizes the interaction time. Our analysis bounds both the one-round approximation error and the stationarity defect of an approximate stationary state in Gibbs-weighted $L^2$ norms, with only linear dependence on the system size. It also uses the dephasing induced by randomized evolution to control the extensive Lamb shift without treating it as a small perturbation of the dissipative dynamics.
Quartet state of the neutral nitrogen-vacancy center in diamond and optimized spin readout under near-infrared two-photon excitation
View Full Abstract
Photoionization of the excited nitrogen-vacancy center (NV-) in diamond leaves the neutral defect in a metastable quartet state of unknown energy. Using two-photon optically detected magnetic resonance with a tunable femtosecond laser, we resolve its onset in the spin contrast at 1.23 +/- 0.02 eV and, with the ground-state threshold from the same setup, place the quartet 0.54 +/- 0.04 eV above the neutral ground state. The threshold sets the optimum excitation for spin readout at 1060-1075 nm, in the near-infrared tissue window, with 26-37% higher shot-noise-limited sensitivity than at 1030-1040 nm.
Agentic Pipelines for Mapping Topological Codes to Quantum Hardware
View Full Abstract
Mapping a prescribed many-body Hamiltonian to a particular quantum hardware is generally an approximate process, resulting in both intended and unwanted quantum dynamics. We introduce an AI-agent-assisted workflow that uses Lean to establish whether an effective device Hamiltonian retains the intended low-energy subspace of the target many-body Hamiltonian. We demonstrate this approach with topological quantum error correction (QEC), providing, to our knowledge, the first Lean-verified pipeline connecting a code space to low-energy states of a device model. Starting from qubits and parity checks, the pipeline constructs the ideal Hamiltonian whose lowest energy states form the intended code space, and determines the excitation gap that protects that code space. It then tests if the device retains the required number of isolated low-energy states and quantifies how closely their subspace matches the intended code space. We compare three bounds on unwanted energy shifts obtained by: summing the interaction strengths, grouping the anticommuting Pauli interactions, and diagonalizing the Hamiltonian. Pauli grouping yields a bound that is tighter than the conventional sum and closer to the diagonalization result, avoiding overly conservative compensation requirements. The workflow also identifies the strongest unwanted interactions and the qubits they affect, providing specific targets for improving device couplings and controls. We demonstrate our framework using an eight-qubit toric-code array on a superconducting device, where the same driven device generates both the required four-qubit interactions as well as unwanted dynamics. An AI agent identifies viable device parameters within a prescribed leakage budget, and Lean verifies four isolated low-energy states close to the ideal code space. Our workflow supports predictive hardware engineering for analog implementations of QEC codes.
Stabilizer Learning under Global Depolarizing Noise with Polynomial Copies and $2^t$ Time
View Full Abstract
We study learning the stabilizer structure of an unknown pure $n$-qubit state observed through global depolarizing noise of unknown strength, with a fixed promised upper bound below one, using destructive two-copy Bell measurements. Let $0\le t\le n$ bound the stabilizer nullity, let $\varepsilon>0$ be the accuracy, and let $0<δ<1$ be the failure tolerance. With probability at least $1-δ$, a learner must return a commuting unsigned Pauli group containing every stabilizer of the pure state; averaging conjugation by that group must decrease the purity of the observed noisy state by at most $\varepsilon$. Tang and Steckmann gave such a learner with polynomially many copies and $2^t$ times polynomial time when the noise strength is below a threshold of at most about $0.16$, which tends to zero as $t/n\to1$. They asked whether other algorithms with these resources can exceed this threshold. We answer this question affirmatively for every fixed bound on global depolarizing noise below one and every $0\le t\le n$, including states with only one promised independent stabilizer. Our learner uses polynomially many copies and $2^t$ times polynomial classical running time. All resource bounds hold on every execution. Their polynomial factors depend on $n,1/\varepsilon,\log(1/δ)$, with degrees and constants depending on the fixed noise promise.
Inline inter-core phase control in multi-core fiber with a commercial polarization controller
View Full Abstract
Inter-core phase control is a prerequisite for interferometry in multi-core fiber (MCF), but no compact inline element for this purpose is presently available, and existing approaches require fanout to single-mode fiber or free-space optics. We show that a commercial inline polarization controller, a low-loss and widely available component, can be operated as an inline inter-core phase shifter. Two-core interferometry on a jacketed four-core patchcord gives a reversible inter-core phase of $0.95 \pm 0.02$~rad from a single device, with an operating-point-independent lower bound of $0.38$~rad, driven through repeated load-unload cycles at a rate set by the actuator. A diametrically compressed disk model is used to predict the operating condition: with the input polarization aligned to a principal stress axis the device imparts a relative phase between cores without rotating the polarization state of either, which we verify by polarimetry on all four cores. The response is polarization dependent, falling to less than $0.58$~rad for the orthogonal input. The result is a practical, inline route to inter-core phase control and stabilization in all-MCF interferometers, requiring neither fanout to single-mode fiber nor free-space optics.
Qyantram: A Transparent and Verifiable Quantum Computing Platform
View Full Abstract
Most quantum circuit platforms focus on idealized circuit assembly and simulation, hiding hardware compilation, error identification, and variational model training behind black-box operations. QYANTRAM addresses this gap through an open platform comprising four subsystems, built around evidence-backed results and independent verification. Its staged compilation pipeline makes every transformation traceable, while the router publishes rejected SWAP candidates and their scores for transparent decision-making. Verification exploits inactive qubits remaining in the |0> state, reducing complexity from 2^N to 2^k for k active qubits. This mathematically exact reduction enables full pre-compilation verification on 127- and 156-qubit layouts, achieving approximately 10,000x speed-ups with execution times below one millisecond. The error identification engine exhaustively evaluates all Pauli error patterns without sampling, matching closed-form predictions within 2.8e-17. Its machine-learning engine achieves numerical agreement within 2.0e-15 of qiskit.quantum_info while training 25-50 times faster. The router introduces approximately 1.27x more SWAP gates than Qiskit's SABRE due to its omission of optimization, trading routing efficiency for complete decision transparency and traceability.
Dynamics of Fock states in traveling pulses
View Full Abstract
The quantum state of a traveling light pulse can qualitatively change the excitation dynamics of a two-level atom. We investigate this dependence for coherent and Fock input states using a virtual-cavity formulation with matched input and output temporal profiles. Analytical treatment of the master equation and numerical simulations show that coherent pulses produce damped Rabi oscillations, whereas Fock pulses can exhibit a partial recovery of the oscillation amplitude in the trailing part of the pulse. We examine how coupling to an auxiliary temporal mode and radiative loss shape this recovery. We also establish a connection with stimulated Raman adiabatic passage through an exact many-photon dark state and derive the associated adiabaticity condition. The observed recovery occurs away from ideal dark-state following. These results distinguish transient recovery in traveling-pulse scattering from conventional cavity collapse and revival, and clarify the scope of an adiabatic-transfer interpretation.
Spin SYK-dot chains: entanglement bound and resource estimates towards a quantum advantage
View Full Abstract
Ground states of Sachdev-Ye-Kitaev (SYK)-type models are volume-law entangled, which makes them costly both for tensor networks and for quantum hardware simulations. Thus, it remains unclear where quantum hardware could outperform classical simulation of such models. In this work, we study a spin SYK-dot chain, in which q dense SYK dots of p qubits are joined by single ZZ bonds of strength K. The entanglement across any cut is then bounded by floor(p/2) ln 2 plus the inter-dot entanglement, and the two-qubit depth of one Trotter step is set by p alone. A resource estimate shows that a quantum advantage for the ground state could appear only for dots of about 15 to 21 qubits or more. There, a single Trotter step already requires two-qubit error rates of order 10^{-6}, beyond the reach of noisy intermediate-scale quantum (NISQ) hardware. We test the assumptions of this estimate with an imaginary-time matrix product state (MPS) that applies each dot as one block. It agrees with exact diagonalisation at (p, q) = (6, 2). At (5, 2), a variational circuit with the same dot-plus-link layout comes within 3.6% of the exact energy, and noisy simulations show that its fidelity decays as assumed in the resource estimate. At (8, 5), i.e., N = 40 qubits, the energy converges at bond dimension chi = 768, far below the exact value 2^20, and the inter-dot entanglement stays small and is set mainly by K. Out-of-time-order correlators across the links decay on a time scale that shrinks rapidly with |K|. Thus, the dot size p and the inter-dot coupling K together set the entanglement of the chain, and with it where a quantum advantage could appear.
Universality and Emergent Classicality in Krylov Space
View Full Abstract
Krylov complexity grows linearly at late times for many systems. In this regime, we give a general spectral formula for the leading growth coefficients of Krylov complexity and its higher moments, without requiring detailed knowledge of the Lanczos coefficients. For states with a narrow energy distribution compared to the bandwidth, dynamics in the Krylov basis resembles motion along a classical trajectory. We demonstrate our results for the critical XY chain and double-scaled SYK. For the latter, we compute the leading late-time behavior of the chord-number moments through one-loop order.
Taming a macroscopic free mass through continuous quantum measurement
View Full Abstract
The free particle is the most elementary dynamical system in quantum mechanics. Despite remarkable progress in quantum control of increasingly massive solid-state mechanical oscillators, the analogous control of the free-particle counterpart has remained elusive. Dissipation and environmental noise have prevented such control in the inherently low-frequency domain of free-particle dynamics---a regime of growing importance for quantum sensing and tests of fundamental physics. Here we realize a suspended 1-milligram rotor operating in the free-particle regime with exceptional environmental isolation. Combining this isolation with a low-noise measurement architecture, we directly resolve thermal fluctuations in the motion associated with a damping rate of only 7~nHz. Through continuous quantum measurement of the rotor, we localize its otherwise unconfined motion, obtaining conditional states with entropic temperatures as low as 140~nK as a quantitative measure of control in the free-particle regime. This is two orders of magnitude below temperatures previously achieved in tabletop optomechanical experiments. We demonstrate immediate utilities of the new operating regime, setting new constraints on modifications of quantum mechanics and benchmarking inferred entanglement-to-decoherence rate ratios nearly two orders of magnitude beyond the state of the art for tests of gravity at the quantum-classical interface.
Correlated Catalysis Removes the Strong Converse for Entanglement Distillation
View Full Abstract
Entanglement distillation converts noisy shared quantum states into maximally entangled pairs using local operations and classical communication. The distillable entanglement $E_D$ determines the maximum asymptotic rate at which this process can be performed reliably. For several classes of quantum states, distillation above this rate obeys a strong converse: the fidelity with the target state vanishes asymptotically. Here we show that correlated catalysis removes the strong converse for every distillable bipartite state. Specifically, at any target rate $R>E_D$, the optimal asymptotic fidelity is given by $E_D/R$. Thus, although catalysis does not increase the maximum reliable distillation rate, it allows nonvanishing fidelity at every finite rate. Remarkably, this advantage persists even when the catalyst is returned exactly at every finite blocklength and the correlations between the output and catalyst vanish asymptotically. We further characterize the catalyst size required to sustain nonvanishing fidelity above the reliable distillation rate.
Belief Propagation-Informed Tesseract Decoding of Quantum LDPC Codes
View Full Abstract
In quantum error correction, the decoder must estimate the errors from the measurement data accurately and fast enough to avoid a backlog. Search-based decoders such as Tesseract achieve high accuracy by finding a minimum-weight set of error events with an A* search, but their search effort grows rapidly with the physical error rate and the code size. To reduce this search effort while maintaining a logical error rate close to that of Tesseract, we propose a belief propagation (BP)-guided modification of the Tesseract decoder for quantum low-density parity-check (LDPC) codes. Damped sum-product BP is applied to the triggered detectors before the Tesseract search. If the detectors triggered by the BP hard decision match the triggered detectors, this hard decision is accepted directly, and the Tesseract search is skipped. Otherwise, the BP marginal probability estimates, weighted by a trust coefficient, modify the search priority, while the path cost keeps the channel-prior weights so that the decoding objective is unchanged. The framework also supports BP-based initialization, in which selected BP decisions form the starting point of a residual search whose signed-cost objective allows incorrect initial decisions to be removed. A node-exploration limit bounds this residual search; if the limit is reached, the decoder falls back to the BP-guided search on the original triggered detector set. The method is evaluated on the [[72,12,6]], [[90,8,10]], and [[144,12,12]] bivariate bicycle codes under circuit-level noise. With BP-based initialization and a global trust coefficient, the number of Tesseract search nodes expanded is reduced by up to more than two orders of magnitude at low physical error rates, while the logical error rate remains close to that of Tesseract.
Many-Body Correlations in Phase-Space Microscopes
View Full Abstract
The recently proposed "phase-space microscope" (PSM) extends quantum gas microscopes by allowing joint, single-shot measurements of position and momentum. We show that the $n$-body correlation functions constructed from such phase-space snapshots determine, in principle, all $n$-body observables of a many-body quantum state. This establishes phase-space imaging as a complete probe of strongly correlated matter, beyond what snapshots of position and momentum can provide---a limitation that goes back to a famous question posed by Pauli. Even without the full reconstruction of the density matrices, the PSM provides valuable insight into the quantum states. We demonstrate this power through several applications: witnessing entanglement hidden from both position and momentum, including between spatially separated collective degrees of freedom; resolving pairing structure across the BEC-BCS crossover, including the phase of the pair wavefunction and the reconstruction of its two-body Wigner function; probing inhomogeneous systems and preformed pairs without long-range order, relevant to the pseudogap phase; extracting the interaction energy in a magnetic field; and measurements of the local Chern marker. Furthermore, we discuss phase imprinting in the matter-wave Fourier plane as an alternative method for probing time-reversal-symmetry-broken phases such as chiral $p$-wave superconductors. Together, these results establish the PSM as a versatile new tool for exploring fundamental features of quantum many-body phases in strongly correlated quantum matter.
On physical origin of Berry connection of free relativistic electrons
View Full Abstract
No consensus has been reached on the appropriate operators for the spin and orbital angular momentum of free relativistic electrons. But there is a tendency to believe the existence of a spin-orbit coupling through the Berry connection. Here we show that this is not the case. Because the positive-energy solution of the Dirac equation is associated with the state of the electron, it is reasonable to postulate that only when projected onto the positive-energy subspace can observable operators on the Hilbert space of the Dirac equation represent physical quantities of the electron. On this basis, we find, after mapping the projected operators onto an irreducible representation, that the Berry connection describes the position of a quantum reference point with respect to the laboratory reference frame, relative to which the position of the electron is canonical. The orbital angular momentum of the quantum reference point about the origin of the laboratory reference frame is expressed in terms of the Berry connection. It combines with the canonical orbital angular momentum of the electron about the quantum reference point to give the orbital angular momentum of the electron about the origin of the laboratory reference frame.
Second-order mean force Gibbs state of fermionic open systems
View Full Abstract
Thermodynamics typically assumes that a system in contact with a thermal reservoir relaxes to the Gibbs state, or to the grand canonical Gibbs state when it also exchanges particles. However, this only holds when the coupling is very weak. Beyond this, the expected equilibrium state is the mean force Gibbs (MFG) state, obtained by tracing the reservoir out of the thermal state of the combined system. Despite its relevance, general analytic results for the MFG state have so far been obtained almost exclusively for bosonic reservoirs. Here we derive the grand canonical MFG state to second order in the coupling for a generic fermionic system coupled to a thermal reservoir at arbitrary chemical potential, using the concept of the mode reduced state in order for the fermionic MFG state to be well defined. The correction to the bare Gibbs state separates into particle and hole channels weighted by the empty and occupied reservoir states, related through the Kubo-Martin-Schwinger condition. We apply the result to the resonant level model, two modes coupled to a shared reservoir, and the single impurity Anderson model. For the two modes, the reservoir mediates coherence between modes that do not interact directly, something the bare Gibbs state cannot capture. We verify our results against numerically exact calculations, including real-time dynamics for the interacting model, and find agreement between the static prediction and the dynamical relaxation.
Nonreciprocal generation of Bell states via cooperative dissipation in a qubit-magnon system
View Full Abstract
Directionally generating and controlling quantum states is critical in chiral quantum technologies. Here, we propose a scheme for the nonreciprocal generation of Bell states via cooperative dissipation in a qubit-magnon system, consisting of a superconducting transmon qubit and a yttrium iron garnet sphere subject to a bias magnetic field. The cooperative dissipation between them is induced by coupling both to a common transmission-line waveguide. Due to this cooperative dissipation, the system possesses a dark eigenstate within the single-excitation subspace. Under appropriate parameter conditions, the dark eigenstate reduces to a specific Bell state. With the assistance of a drive pulse, the system can be prepared in this Bell state (i.e., the dark eigenstate). In particular, we find that the dark eigenstate corresponds to different Bell states under positive ($+\mathbf{B}_0$) and negative ($-\mathbf{B}_0$) bias fields. Consequently, nonreciprocal Bell-state generation is achieved: $+\mathbf{B}_0$ yields one Bell state, while $-\mathbf{B}_0$ yields the other. Moreover, we define a fidelity-based nonreciprocal rate to quantify this nonreciprocity. Our work establishes cooperative dissipation as a versatile resource for nonreciprocal entangled-state generation, opening a promising route toward chiral quantum technologies.
Needle-beam generation from SPDC photons using inverse-designed flat optics
View Full Abstract
We experimentally demonstrate the generation of needle-like beams from spontaneous parametric downconversion (SPDC) light using a compact inverse-designed multilevel diffractive lens (MDL). The nonclassical nature of the SPDC source is independently verified through a three-detector heralded Hanbury Brown-Twiss measurement performed before the MDL, yielding a zero-delay second-order correlation value of approximately 0.14. Spatial measurements using an intensified charge-coupled device reveal that the MDL maintains a tightly confined focal distribution over an axial distance of approximately 11 mm under collinear SPDC illumination, substantially reducing diffraction-induced broadening compared with a conventional plano-convex lens of the same nominal focal length. Under non-collinear SPDC illumination, two distinct regions of extended axial confinement are observed, demonstrating the dependence of the engineered focal distribution on the incident spatial field. These results establish a compact flat-optical approach for engineering extended-focus SPDC photon fields, with potential applications in structured quantum photonics.
eigenkit: A Provider-Neutral Quantum Computing Library
View Full Abstract
Quantum software ecosystems provide increasingly capable tools for simulation and hardware execution, but differences in programming models, supported features, and backend capabilities can make it difficult to move and systematically compare the same quantum algorithm across execution environments. We introduce eigenkit, a provider-neutral quantum computing library that separates algorithm definition from backend execution through a common circuit representation and provider interface. The library currently supports 12 execution providers spanning simulators and quantum hardware, provides backend-independent gradient computation, and integrates with standard scientific-computing and machine-learning workflows through NumPy, PyTorch, and scikit-learn interfaces. We evaluate the practical relevance of this abstraction across both simulation and quantum hardware. Simulator performance varies substantially with circuit size, structure, batching, and application workload, showing that no single backend is consistently preferable. On quantum hardware, experiments on IBM Heron and IQM Emerald show that which processor is better suited to a given algorithm depends not only on hardware constraints, but also on how well the topology of the quantum algorithm matches the physical connectivity of the processor. These results demonstrate that backend portability is not only a software-design convenience, but can be important for both computational efficiency and quantum execution quality.
Inducing cooperative dynamics in an inhomogeneous many-emitter ensemble with a pulse sequence
View Full Abstract
Driving a many-particle quantum system with an appropriately tuned external field can give rise to features in its nonequilibrium dynamics that are absent in the equilibrium counterpart. Cooperative dynamics in a dense ensemble of quantum emitters manifested through superradiance, a burst in the emission intensity as a function of time, is typically suppressed by spectral disparities among emitters in the ensemble. We demonstrate the enhancement of cooperative dynamics in a spectrally inhomogeneous ensemble of quantum emitters when it is driven by a periodic pulse sequence. Using both a semi-analytical mean-field solution and a digital quantum simulation, we examine the coherence of the pulse-driven ensemble and the intensity of the emitted radiation as a function of the spectral disparity in the ensemble, as a function of time, the number of atoms in the system, and as a function of the inter-pulse delay. We identify clear signatures of the enhanced cooperative dynamics for the pulse-driven inhomogeneous ensemble when dephasing in the dynamics of the ensemble is suppressed by a sufficient number of pulses during the individual emitter lifetime. These results demonstrate a post-fabrication tuning knob based on externally applied control fields for the dynamics of the many-emitter ensemble.
Towards Optimal Routing Strategies for qLDPC codes on Silicon Spin Qubits
View Full Abstract
One of the major challenges of implementing high-rate quantum error correction codes, like qLDPC codes, is realizing the required long-range interactions. Spin qubit platforms can provide this connectivity by shuttling qubits next to each other whenever they need to interact. When doing this, the performance of the code depends on the shuttling strategy. We study memory experiments of the [[144,12,12]] bivariate bicycle (Gross) code on two shuttling grids for future spin qubit devices: a square grid and a square grid with diagonals. We compare three shuttling strategies, structured and random initial layouts, and a range of shuttling noise models spanning best- and worst-case scenarios. The best strategy minimizes the longest distance travelled rather than the total distance. The initial layout has only a weak effect, whereas adding diagonals to the grid reduces the logical error rate by up to two orders of magnitude which may have implications for future hardware design.
Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCs
View Full Abstract
We construct explicit two-sided lossless expanders whose binary adjacency matrices have full rank, and use them to obtain explicit asymptotically good quantum LDPC codes whose specified X- and Z-check matrices have full row rank and satisfy small-set soundness, or confinement, on a linear range. Our lossless expanders are a variant of those of Hsieh, Lubotzky, Mohanty, Reiner, and Zhang, with a free action of a finite 2-group. Under such an action, injectivity and surjectivity of the adjacency matrix are detected on a fixed-size matrix indexed by vertex orbits. Adding a sparse factor to the gadget at the middle vertices of a single type then enforces full rank, with a controlled loss in expansion. To obtain the 2-group action, we observe that reducing the generators of the Lubotzky-Phillips-Sarnak Ramanujan graphs modulo powers of 2, instead of modulo an odd prime, gives Ramanujan Cayley graphs on finite 2-groups. This construction may be of independent interest. Plugging two such expanders into the balanced product of Lin and Hsieh gives the quantum codes, since full rank of the input graphs is inherited by the check matrices. Our construction supplies the code family sought by Hong, Guo, and Lucas. Applying their analysis, within their framework and under their dynamical assumptions, gives quantum memories whose free-energy density is analytic at every positive temperature and whose guaranteed lifetime is $exp(Ω(N))$ at sufficiently low fixed positive temperature, where N is the blocklength. This improves the previously guaranteed stretched-exponential timescale.
Quantum-Nondemolition Probing of Multiphoton Transitions between Dressed States in a Strongly Driven Jaynes--Cummings System
View Full Abstract
The response of the Jaynes--Cummings (JC) model to strong driving has been examined previously, but the origin of intriguing features near emitter--cavity resonance remains poorly understood because of the large background in conventional transmission spectroscopy. Here we introduce a spectroscopic approach for circuit quantum electrodynamics that combines strong cavity driving with quantum-nondemolition qubit readout. Separating the drive and readout substantially enhances the measurement sensitivity as compared with conventional cavity-transmission spectroscopy. With this technique, we identify the near-resonant features as multiphoton transitions between emitter--photon dressed states of the same parity, and resolve transitions between dressed states of opposite parity. Away from resonance, we also observe selective enhancement and suppression of multiphoton transitions, together with transitions involving the second excited state of the anharmonic qubit. Our approach opens a route to resolving the rich transition structure of the JC ladder and probing strongly driven light--matter interactions.
Reimagining computational quantum research with AI scientists
View Full Abstract
AI scientists are expanding automated research across scientific domains, yet their ability to turn the scientific record into a foundation for autonomous discovery remains elusive. Here we uncover a fundamental barrier to this transition and demonstrate a route to overcome it in computational quantum science, where advances shape both what we can learn from complex quantum systems and what quantum computing can ultimately deliver. To identify this barrier, we introduce OmniQ, an expert-audited virtual research environment that converts published studies into executable reproduction tasks. Across 59 papers spanning classical simulation, quantum algorithms and quantum-property characterization, we systematically evaluate five agentic systems powered by large language models and six third-party agent harnesses. Our findings reveal that current AI scientists often fail to reproduce published results, exposing a fundamental mismatch between what scientific papers communicate and what autonomous agents require. By contrast, human expert intervention can turn these failures into successful reproductions, showing that the missing information can be identified and converted into reusable research experience. Guided by this observation, we develop Residual Agents (RA), a quantum-tailored self-improving AI scientist that distils externally verified workflow repairs into such experience. RA substantially improves research performance under fixed base models and limited adaptation budgets. For example, RA raises DeepSeek V4.1 Flash performance from 68% to 85%, matching Claude Code with Opus 5 at a third of its cost despite using a weaker base model. We integrate all reproduced results into an extensible platform built on the model context protocol, making verified research workflows directly accessible to AI scientists and allowing new scientific papers to be continuously incorporated.
unitaryQIP = unitaryPSPACE
View Full Abstract
Unitary synthesis complexity studies the computational cost of applying a target unitary to an unknown quantum state, extending complexity theory beyond its traditional focus on problems with classical inputs and outputs. Rosenthal and Yuen (ITCS 2022) introduced two complexity classes for unitary synthesis: $\mathsf{unitaryQIP}$ and $\mathsf{unitaryPSPACE}$ for the unitary families implementable via interactive proofs and in polynomial space, respectively. In this work, we prove the equality $\mathsf{unitaryQIP}=\mathsf{unitaryPSPACE}$ and thereby establish a unitary-complexity analogue of $\mathsf{QIP} = \mathsf{PSPACE}$ (Jain, Ji, Upadhyay, and Watrous, J. ACM 2011) and $\mathsf{stateQIP}=\mathsf{statePSPACE}$ (Rosenthal and Yuen, ITCS 2022; Metger and Yuen, FOCS 2023). To prove $\mathsf{unitaryQIP} \subseteq \mathsf{unitaryPSPACE}$, we use an acceptance rigidity lemma derived from the soundness condition to show that the polynomial-space prover constructed for a fixed input in state synthesis (Metger and Yuen, FOCS 2023) implements the target unitary on every input, leading to a polynomial-space simulation of the protocol. For the reverse inclusion, we build on OpenAI's recently announced solution to the unitary synthesis problem (Aaronson and Kuperberg, Theory Comput. 2007), and show that $\mathsf{unitaryPSPACE}$ families can be synthesized in polynomial time with a $\mathsf{PSPACE}$ oracle. We then implement the oracle queries using auxiliary states prepared via the $\mathsf{statePSPACE} \subseteq \mathsf{stateQIP}$ protocol (Rosenthal and Yuen, ITCS 2022). Beyond the equality, we show that our protocol for $\mathsf{unitaryPSPACE}$ can be parallelized to constant rounds when the verifier receives polynomially many copies of the input, and we also obtain a complexity-theoretic barrier to proving the existence of $\mathsf{EFI}$ pairs.
Coulomb Blockade in a One-Dimensional Array of Strong Josephson Junctions
View Full Abstract
We measure current across a voltage-biased, long array of Josephson junctions. Current-voltage characteristics do not reveal any critical current and instead display the presence of threshold voltage and finite activation energy, consistent with the Coulomb blockade. However, the respective energy scale is well below the value prescribed by a single-island geometric capacitances. We explain it by strong quantum fluctuations of charge associated with a large value of Josephson energy, $E_J\gg E_C$, where $E_C$ is the charging energy associated with the inter-island capacitance. Comparison between the data and theory points to an exponential (in parameter $E_J/E_C$) suppression of the threshold. We achieve a quantitative agreement with theory by accounting for charge-$e$ solitons associated with the quasiparticles entering the array from its leads. This scenario however underestimates the current below threshold in comparison with the experiment.
Quantized pumping of boundary Hilbert space in chiral Floquet phases
View Full Abstract
Chiral Floquet phases support quantized chiral flow along their boundaries even when the bulk is fully localized. In this Letter, we establish a complementary phenomenon, which we call Hilbert-space pumping: under a boundary condition twisted by time translation, a part of the boundary Hilbert space, of quantized dimension, is transferred between the opposite boundaries. The twist is the temporal analogue of Laughlin's flux insertion in the quantum Hall effect. For noninteracting fermions, the number of transferred boundary modes is determined by the winding number, as we show analytically for the boundary dynamics and numerically for the anomalous Floquet Anderson insulator. For interacting systems whose boundary dynamics is a quantum cellular automaton, the transferred dimension is set by the Gross-Nesme-Vogts-Werner (GNVW) index: the twisted boundary Floquet operator is the Floquet operator on a tilted time slice, whose Hilbert-space dimension is multiplied by the index for each period of twist. We derive this relation for matrix product unitaries and test it numerically in random unitary circuits. Applied to the matrix product operators of non-invertible symmetries, the same twisted rank returns the quantum dimension of the symmetry operator in addition to its flow index.
Single-port homodyne detection achieves optimal multiphase sensing in an $n$-port ring cavity
View Full Abstract
Estimating several phases simultaneously is more than estimating them one at a time: the optimal measurements for different parameters may not commute, and in a multiparameter problem the quantum Cramér-Rao bound is not automatically achievable. Ring cavities are a natural setting for this question, since a single coherent input can be made to interact repeatedly with every internal phase before it is read out. We study the simultaneous local estimation of the $n$ internal phases of a lossless $n$-port ring cavity probed by a fixed-energy multimode coherent state, optimizing over the full coherent-input space and over the operating point of the cavity. We identify a necessary and sufficient condition for the global optimum: the input energy should be distributed equally among the ports, and the internal phases and input phases satisfy a simple phase-matching condition for every port. The optimum is unique up to a common optical phase and minimizes both the symmetric logarithmic derivative (SLD) cost and the sloppiness of the model. At this point the quantum Fisher information matrix is full rank and its spectrum is obtained in closed form, the Uhlmann curvature vanishes, and no incompatibility penalty has to be paid. The precision retains the coherent-state scaling and the dependence on the number of phases, but the cavity feedback reduces the prefactor relative to $n$ independent single-pass experiments. Finally, we show that this bound may be achieved in practice: the Fisher information of a balanced homodyne measurement at each output port, with local-oscillator phases locked to the prepared input phases is equal to the optimal quantum Fisher information. Our results establish the ring cavity as a platform for optimal multiphase sensing and provide the ultimate benchmark against which nonclassical probes may be evaluated for further precision enhancement.
Entanglement inference from quantum erasure and path discrimination
View Full Abstract
Fringes recovered by conditioning on quantum-eraser outcomes do not, by themselves, establish entanglement. We determine the minimum entanglement compatible with recorded eraser data when the preparation may be mixed, distinguishing these data from independently determined optimal which-path distinguishabilities and additional joint measurement outcomes. For noisy Greenberger-Horne-Zeilinger (GHZ) preparations, explicit compatible states establish sharp entanglement-depth thresholds and show how parity information strengthens certification. A matching converse establishes the exact threshold for two complete Pauli-outcome distributions. For an ideal three-qubit eraser, we classify the additional marker measurement directions that certify genuine multipartite entanglement within a fixed eraser configuration and determine the separate minima of compatible concurrence and squared GHZ fidelity for specified tilted axes. For noisy three-qubit data, an exact semidefinite characterization and constructive converse determine biseparable compatibility at arbitrary fixed local measurement axes, with rational certificates bounding one example. These results establish what entanglement is required by the measurement record, rather than inferred from assumptions about the source.
Quantum teleportation using photon-added two-mode squeezed Fock states: A comparison with photon-subtracted counterparts
View Full Abstract
Quantum state engineering frequently employs non-Gaussian operations, particularly photon addition and subtraction, to tailor and improve the nonclassical characteristics of quantum states. We investigate how photon addition to a two-mode squeezed Fock state (TMSFS) influences its performance in the Braunstein-Kimble quantum teleportation protocol. We obtain the Wigner characteristic function of the photon-added TMSFS (PA-TMSFS) and evaluate the corresponding teleportation fidelities for both Gaussian and non-Gaussian input states. We further compare the teleportation performance of PA-TMSFS with that of its photon-subtracted counterpart by accessing their fidelity enhancements over the parent TMSFS and considering the probabilistic nature of both the operations. Our results demonstrate that photon subtraction provides superior teleportation performance compared with photon addition, with this advantage becoming more pronounced when the success probabilities of the corresponding non-Gaussian operations are considered. In particular, the symmetric $(1,1)$ photon subtraction yields the optimal trade-off between teleportation fidelity and success probability among the configurations investigated. These findings highlight that photon subtraction retains its advantage even when the underlying entangled resource is already non-Gaussian.
Performance analysis of cat and GKP breeding protocols with squeezed single-photon input
View Full Abstract
Homodyne breeding is a promising optical route for generating large cat states and Gottesman--Kitaev--Preskill (GKP) grid states, using readily available squeezed-cat states as inputs. We analyze the performance of protocols, using squeezed single-photon seeds, $\hat{S}(r)\ket{1}$, as squeezed-cat resources and propagating them through the same cat-to-GKP breeding pipeline. For a symmetric tree with $N=2^{m_1}$ seeds, the heralded resource state reduces to a state with a polynomial-Gaussian wavefunction controlled by a single effective width, achieving near-unit fidelity with the desired cat resource state. Our analysis yields closed-form even-cat fidelities and an inverse-design rule for the seed squeezing. We apply these resources to GKP breeding, and find a large overlap with a practical GKP state. We also investigate the effects of practical imperfections, including finite homodyne acceptance windows and photon loss. This study shows that squeezed single-photon inputs provide a viable resource assignment for homodyne cat and GKP breeding, replacing the demanding requirement for high-resolution photon-number-resolving heralding with an on-demand single-photon source.
Dynamical-mean-field cluster-correlation expansion of NV$^-$ spin-echo decoherence in a realistic substitutional-nitrogen bath
View Full Abstract
The Hahn-echo time $T_2$ of nitrogen-vacancy (NV$^-$) ensembles in nitrogen-rich diamond follows the empirical relation $T_2\cdot$[N] = 160 $μ$s ppm, independent of field between 2 and 30 mT. Cluster-correlation-expansion (CCE) calculations that treat the Overhauser field of the surrounding P1 centres as a frozen, sampled mean field overestimate it at high field by up to a factor of two, an excess recently attributed to additional dark defects. We show that the excess is largely an artefact of freezing the field. The P1 centres outside each cluster flip-flop in pairs that conserve their total $S_z$, generated by kinetic Monte Carlo at golden-rule rates from the dipolar Hamiltonian without adjustable parameters, and each cluster is propagated in the resulting time-dependent field. This dynamical mean field interpolates between the static-mean-field and mean-field-free limits. For a $^{14}$N P1 bath it reduces $T_2\cdot$[N] at 30 mT from 264 $\pm$ 16 to 188 $\pm$ 12 $μ$s ppm and gives 167 $\pm$ 11 $μ$s ppm at 10 mT, 1.7 and 0.4 standard deviations from experiment, with no dark spins. Letting each centre jump independently gives 147 $\pm$ 9 $μ$s ppm at 30 mT; the correlation of the flip-flop partners lengthens $T_2$ by 20-30 percent at high field. The Overhauser field is neither frozen nor motionally narrowed: 68-83 percent of its autocorrelation survives 200 $μ$s. At 2.5 mT, where the P1 electron and nucleus hybridise, $T_2$ remains below experiment for any choice of rates, so part of the field dependence remains ($T_2$ rises by a factor 1.69 $\pm$ 0.07 instead of 2.15 $\pm$ 0.08 from 2.5 to 30 mT).
Logarithmic Bias of Zero-Noise Extrapolation under 1/f Noise
View Full Abstract
Zero-noise extrapolation estimates ideal quantum observables by amplifying noise and extrapolating the measured response. Its accuracy depends on whether the extrapolation model captures the physical effect of amplification, including correlations between repeated operations. Here we derive the response of complete multiqubit gate folding in the simultaneous presence of time-local Markovian noise and stationary finite-band 1/f noise. An ordered circuit kernel couples the observable to noise memory; exact block counting shows how folding samples correlations at increasing time separations. The resulting response contains an r^2 ln r coordinate, with a coefficient fixed by the noise spectrum and the integrated forward-inverse control response. Ordinary polynomial Richardson extrapolation leaves a calculable contribution from this coordinate; the three-node rule (1,3,5) retains 2.73 theta. We construct response-matched extrapolation, including a log-domain implementation, that cancels this contribution at the retained order. Explicit bounds separate the remaining control-shape, finite-band, higher-order, and native-offset errors. The theory applies to arbitrary finite multiqubit circuits within the stated control and noise model, and distinguishes removal of memory-induced bias from an unconditional guarantee of the ideal intercept. Single- and ten-qubit numerical examples illustrate the predicted correction and its response dependence.
Barycentric programming: Classical realization of programs for universal quantum processors
View Full Abstract
A programmable quantum processor implements a target unitary using information stored in a classical or quantum program register. For arbitrary unitaries in $\mathrm{SU}(d)$, quantum programs attain the optimal leading-order memory cost, whereas deterministic classical rounding requires twice as much memory for the same diamond-distance error. We show that this gap disappears when classical randomization is allowed. We introduce barycentric programming, which stores the label of a unitary randomly selected from a finite set, with probabilities chosen so that first-order approximation errors cancel in the averaged unitary channel. Consequently, the diamond-distance error scales quadratically with the discretization spacing. For any $ν$-parameter family of unitaries forming a compact, smooth manifold without boundary, this method achieves error $\varepsilon$ using only $(ν/2)\log_2(1/\varepsilon)+O(1)$ classical bits. We also prove a matching lower bound for arbitrary quantum programs, determining the optimal leading-order program size for general unitary families. Thus, classical randomization achieves the optimal scaling $(ν/2+o(1))\log_2(1/\varepsilon)$ without requiring coherent quantum memory.
Finite attainment and efficient computation of regularized quantum channel relative entropy
View Full Abstract
Quantum channel relative entropy can be nonadditive, making its regularization essential for asymptotic analysis. We study when the regularized value is attained at finite blocklength and how efficiently it can be approximated. For the first question, we establish a sharp dichotomy: the regularized value is either attained already at the single-copy level, implying additivity at every blocklength, or is never attained at any finite blocklength. Notably, a simple two-copy additivity test distinguishes between these alternatives for qubit channels and for channel pairs in arbitrary dimensions admitting an interior optimizer. We further show that both the interiority condition and finite nonattainment are generic, holding for almost every channel pair. For the second question, we establish explicit convergence rates for approximating the regularized channel relative entropy. For fixed channel dimensions, $\widetilde O(\varepsilon^{-3/2})$ channel copies suffice to approximate the regularized value to additive accuracy $\varepsilon$. Alternatively, a semidefinite hierarchy achieves the same accuracy at level $\widetilde O(\varepsilon^{-2})$, yielding a certified polynomial-time approximation. Together, these results reveal the intriguing structure and generic behavior of regularized channel relative entropy, sharpening our understanding of both its analytical and computational aspects.
Nearly Transform-Limited Pulse-Like Temporal and Narrowband Spectral Responses in Sum-Frequency Generation from Bright Twin Beams
View Full Abstract
We simultaneously characterize the temporal and spectral responses of the coherent component in bright twin beams using a spectrally resolved, delay-dependent sum-frequency generation (SFG) measurement. The measured temporal-correlation width is 0.138 ps, close to the transform-limited value of 0.126 ps estimated from the measured twin-beam spectrum.The observed spectral-correlation width is 0.176 rad/ps and is limited by the spectrometer resolution. The corresponding time-frequency width product is 0.0243, far below the value of 1 for SFG between two independent transform-limited Gaussian pulses.
State Synthesis with an NP oracle
View Full Abstract
In this note, I describe a quantum algorithm that prepares an arbitrary state $|ψ\rangle$ to inverse exponential precision in polynomial time by making queries to an $\mathsf{NP}$ oracle, assuming one can directly query entries of the state vector corresponding to $|ψ\rangle$. The previous best upper bound on the complexity class required by an oracle for this task was $\mathsf{PP}$. I provide evidence that $\mathsf{NP}$ is the best possible upper bound by showing that any quantum algorithm using a $\mathsf{P}$ oracle, or even a $\mathsf{P/poly}$ oracle, requires exponentially many queries. I also discuss some implications of this result for the $\mathsf{QMA}$ search-to-decision problem and unitary synthesis.
Quantum simulation of dissipative acoustic and elastic waves by Schrödingerisation: absorbing boundaries and explicit polynomial-size circuits
View Full Abstract
Explicit quantum circuits for the acoustic and elastic wave equations, obtained by Hamiltonian simulation of their first-order forms, conserve energy and therefore describe closed domains: an outgoing wave reflects off the edge of the computational region or, with periodic boundaries, wraps around and re-enters from the opposite side. We open the domain with the simplest physical absorber, a graded sponge layer in which every wave field is damped at a rate that grows towards the outer edge, and implement the resulting dissipative dynamics on a quantum simulator by Schrödingerisation, which turns a non-unitary linear evolution into a family of unitary ones by means of a single auxiliary variable. We derive the whole chain from the partial differential equation to the circuit, in one, two and three dimensions. An independent finite-difference solver confirms that damping all wave fields absorbs far better than the common velocity-only damping mask. For the sponge the quantum analysis is sharp: recovery is exact on the whole non- negative half of the auxiliary axis at every time; that axis can be truncated periodically at a length set by the largest damping rate and the simulated time; and the success probability is a fixed constant, about 0.4, times the fraction of the energy not yet absorbed, with only one or two auxiliary qubits measured. On the circuit side, the damping step, which generic synthesis compiles into a number of controlled-NOT gates exponential in the number of qubits, factorises exactly into polynomially many multi-controlled phase gates. Gate-level simulations on up to 25 qubits agree with the classical solutions of the damped wave equations.
MBUndo: Sound, Automatic, and Efficient Measurement-Based Uncomputation for Quantum Circuits
View Full Abstract
Quantum programs that use temporary values, known as \emph{ancilla} qubits, must explicitly \emph{uncompute} each ancilla back to zero to ensure that the program produces correct outputs. Conventional uncomputation uses unitary quantum gates, whereas leading quantum algorithms now leverage \emph{measurement-based uncomputation} (MBU), which replaces costly unitary $T$ gates with cheaper measurements and phase corrections. Current quantum programming frameworks can use measurement to uncompute specific gates such as Toffoli. No automatic transformation, however, accepts an arbitrary circuit whose ancillas are computed and uncomputed via the standard approach and converts the circuit to use MBU\@. Researchers instead apply MBU to individual circuit designs by hand, which limits algorithm development and compiler optimization. Such a transformation has not existed due to two fundamental unknowns: where MBU applies and which gates realize MBU for an arbitrary computation. To solve these, we first present a static analysis that identifies, for each ancilla qubit, each circuit position where measurement is sound --- subsuming basic assumptions that MBU only applies at the end of a circuit. Next, we present circuit transformations that soundly turn unitary uncomputation gates into efficient phase corrections after measurement --- generalizing rewrite rules from prior literature that are either limited to a single gate or not applicable to a general circuit. We present \textsf{MBUndo}, an integrated compiler pass that automatically converts circuits to measurement-based uncomputation. It requires no user annotations other than which qubits are ancillas, the same as needed by existing uncomputation synthesizers, and can enhance their output circuits. We evaluate \textsf{MBUndo} on 22 benchmarks to reveal \emph{T} gate reductions of ${>}36.5\%$ over uncomputation synthesizers.