Papers

Variational quantum algorithms have attracted attention for their potential to solve combinatorial optimization problems. We study how the choice of encoding affects the resource requirements and optimization behavior of a variational quantum optimization algorithm. In order to quantify these effects, realistically inspired constrained electric vehicle (EV) fleet management problems were considered. These problems couple determining the optimal EV battery charging schedule with assigning EVs to trips requested by customers. We compare a conventional binary (qubit) trip encoding with an integer (qudit) encoding that represents assignments more directly. Both encodings guarantee the same feasible solution set, while the qudit encoding exponentially reduces the required Hilbert-space dimension. We solve many random instances of highly constrained uni- and bi-directional charging problems using qudit-based quantum approximate optimization algorithm (QAOA) and thoroughly evaluate the performance results. We find that the qudit encoding of customer trips achieves similar or better optimization performance at much reduced resource requirements and shorter simulation runtime. These results highlight qudit-native encodings as a practical route for integer and multi-valued scheduling problems in variational quantum optimization.

We study even non-unital Dirac data on the two-dimensional Moyal plane with fixed deformation parameter \(\vartheta\neq0\), whose Dirac operator is affine in the left and right regular coordinate multipliers, with coefficient matrices \(T_L\) and \(T_R\). Two invariants organize this class. The right block controls algebra–Dirac transversality: local compactness holds if and only if \(\det T_R\neq0\), with \(|\det T_R|\) determining the local volume coefficient and \(\operatorname{sgn}\det T_R\) the oriented Gaussian \(K\)-homology pairing. Independently, \(\Gamma=\vartheta(\det T_L-\det T_R)\) controls the spectral regime and, together with \(|\det T_R|\), the exact localized heat trace: \(\Gamma\neq0\) gives infinitely degenerate Landau levels, while for \(\Gamma=0\) in the transverse regime the spectrum is \(\mathbb R\) with empty point spectrum. Applied to Wallet's Landau–Moyal family, the criterion shows that local compactness survives at the metric-degenerate point \(\xi_{\mathrm W}=1\) but fails at \(\xi_{\mathrm W}=-1\), thereby resolving the local-compactness behaviour at both exceptional one-sided points. We then derive a distinguished affine family from a fixed nondegenerate sector \((\hbar_0,\vartheta_0,B_0)\) of the kinematical symmetry group of two-dimensional noncommutative quantum mechanics. The sector fixes the effective Moyal scale \(\vartheta_{\mathrm{eff}}=\vartheta_0/(1-\vartheta_0B_0/\hbar_0)\) and \(T_R\), while an affine \(U(1)_\star\) background coupling deforms only the left affine part of the Dirac operator. Consequently, local compactness, noncommutative volume and \(K\)-homology class remain unchanged, whereas \(\Gamma=\tfrac12(1-eF_{xy}/B_0)\) drives a transition at \(eF_{xy}=B_0\) from Landau levels to spectrum \(\mathbb R\) with empty point spectrum.

More profound than bulk topological order of quantum materials is only its unwinding via gapless excitations along boundaries of the sample. We recast this bulk-edge correspondence – for the experimentally relevant case of fractional quantum Hall (FQH) systems – in terms of effective relative higher gauge theory, controlled by choices of classifying fibrations. For FQH systems, we identify the complex Hopf fibration as classifying the bulk/boundary topological effects, and find that it yields a non-Lagrangian reconstruction of Floreanini-Jackiw/Wess-Zumino-Witten chiral edge currents. Remarkably, the resulting effective FQH higher gauge theory turns out to be "geometrically engineered" on M2/M5-branes probing A-type orbi-singularities in 11D supergravity, globally completed by flux-quantization in twisted equivariant differential (TED) Cohomotopy: Here the M-string ends of M2-branes on M5-branes engineer the FQH liquid's boundary. This geometric engineering on M-branes might naturally elucidate the curious combination of $W_\infty$-symmetry and of super-symmetry that is known to govern the collective excitations of FQH liquids at long wavelengths.

We present Polfed$.$jl, an open-source Julia package implementing the Polynomially Filtered Exact Diagonalization (POLFED) algorithm for computing mid-spectrum eigenvalues and eigenvectors (shortly, eigenpairs) of quantum many-body Hamiltonians. Access to such eigenpairs is essential for studying non-equilibrium many-body physics, but is hindered by the exponential growth of Hilbert-space dimension. POLFED addresses this challenge through a polynomial spectral transformation evaluated on the fly within a Lanczos iteration, preserving Hamiltonian sparsity and substantially reducing memory costs compared to other diagonalization methods. The package supports flexible energy targeting, automatic optimization of the spectral mapping for structured Hamiltonians, and GPU acceleration, which is particularly effective since the dominant computational cost reduces to repeated sparse matrix-vector multiplications. Benchmarks on disordered spin-chain and fermionic models demonstrate access to larger system sizes than alternative approaches, and CPU–GPU comparisons confirm significant speedups. In particular, we also provide code for constructing the quantum sun model Hamiltonian, a toy model of a many-body ergodicity-breaking transition. While our focus is on many-body Hamiltonians, Polfed$.$jl may be applied to any large sparse matrix.

The coherent interaction between free electrons and optical near-fields enables the active modulation of electron wave packets, a mechanism central to photon-induced near-field electron microscopy (PINEM). While existing theories effectively describe these interactions at high kinetic energies, the growing interest in low-energy ultrafast electron microscopy demands frameworks that explicitly account for finite wave packet geometries and recoil effects. In this paper, we develop a rigorous 3D quantum scattering theory for electron wave packets interacting with time-periodic potentials, capturing the case of optical near-field interaction. By mapping the time-dependent dynamics into an extended Floquet space, we formally connect the modulation process to time-independent multi-channel scattering. We evaluate the resulting scattering amplitudes using both an exact R-matrix approach and a multi-channel eikonal approximation. The latter analytical approach recovers PINEM-like probabilities weighted by the wave packet's transverse profile. Application of the theory to an oscillating potential demonstrates the generation of distinct energy sidebands, revealing that the modulation strength is sensitive to the transverse focusing of the incident electron pulse, underlining the importance of a fully 3D treatment.

The Jarzynski equality is a cornerstone of nonequilibrium thermodynamics, linking work statistics to equilibrium free-energy differences. Although it has been extensively verified in classical and quantum Hermitian settings, its status in non-Hermitian dynamics remains under debate. Here we show that, in a postselected no-quantum-jump framework, a conditional non-Hermitian Jarzynski equality holds when the transition probabilities obey a parity-exchange symmetry. We study a constructed family of two-level hybrid Hamiltonians formed as linear combinations of parity-time ($\mathcal{PT}$) and anti-parity-time ($\mathcal{APT}$) symmetric terms, and demonstrate using complementary geometric and algebraic arguments that the parity-exchange symmetry persists throughout the corresponding $\mathrm{SU}(2)$-rotated orbit. Relative to previous $\mathcal{PT}$-focused conditional Jarzynski equality results, the advance here is an extension of the symmetry criterion from the isolated $\mathcal{PT}$ endpoint to a broader $\mathcal{PT}$–$\mathcal{APT}$ hybrid family. Experimentally, we implement three representative points, $\theta_k = 0, \pi/4, \pi/2$, in a single trapped $^{171}\mathrm{Yb}^+$ ion and measure the resulting work distributions under cyclic protocols with $\Delta F = 0$, confirming the predicted symmetry criterion at those points. Our results establish a symmetry-based extension of the conditional non-Hermitian Jarzynski relation within this restricted two-level setting.

Optical interfaces that connect long-lived spin qubits to photons are a central requirement for quantum networking and distributed quantum information processing. Currently, solid-state atomic defects are leading candidates due to their inherent spin and optical coherence. Building on these advancements, synthetically tailored molecular systems represent a fundamental change in the field, utilizing precise atomic control and consistent bottom-up assembly. However, the lack of a robust spin-photon interface combining bright fluorescence, high spectral stability, and the persistent spin lifetimes inherent to ground-state systems has prohibited the detection of individual molecular qubits. Here we show that a triplet ground state carbene molecule, embedded within a structurally matched host crystal, functions as a robust spin-photon interface with single-molecule addressability. The system exhibits narrow zero-phonon lines, spectral stability over more than an hour, spin-selective optical transitions and single-molecule optically detected magnetic resonance. Coherent control yields millisecond-scale dynamical-decoupling coherence and tens-of-milliseconds spin relaxation at a temperature of 4.5 K. These results establish molecular qubits as a viable platform for single-emitter quantum optics while preserving the advantages of bottom-up chemical design and processable materials.

Set coherence is a basis-independent relational form of quantum coherence: a finite family of quantum states is set incoherent exactly when all its members are diagonal in one common basis. We determine how much low-order Bargmann data are needed to decide this property. For two states, second-order data are complete for qubits but fail for qutrits, while complete third-order data are sufficient for qutrits but fail already in dimension four. We then show that fourth-order, ordering-sensitive Bargmann invariants give the first universal pairwise criterion for set coherence. Applied to all unordered pairs, this criterion yields a complete test for arbitrary finite families. The result provides a low-order hierarchy connecting cyclic trace invariants with the noncommutativity that prevents a common incoherent basis.

Nonlinear properties of quantum states are essential to quantum information and many-body physics, but assessing them experimentally is challenging, as it typically requires multi-copy operations or a large number of measurement settings. To address this challenge, we develop a universal framework, collision-based nonlinear estimation (CBNE), for efficiently measuring nonlinear quantities of a quantum state $\rho$, such as the higher-order expectation value ${\rm tr}(O\rho^t)$ for some observable $O$, using single-copy randomized measurements. Strikingly, our protocol requires only a single measurement setting, provided that the system dimension is sufficiently large or a few ancillary qubits are available; this contrasts with the conventional expectation that multiple measurement bases are necessary for nonlinear estimation. In addition, CBNE is observable-independent at the experimental stage, which enables simultaneous estimation of multiple nonlinear functions. It further extends to broader tasks, including the estimation of principal component properties and partial-transpose moments of quantum states. Our results provide a practical and scalable route for measuring nonlinear state properties on near-term quantum devices.

We consider the task of constructing pseudorandom unitaries (PRUs) with scalable security, i.e. families in which the security parameter may vary independently of the dimension (or input bit-length). It is not known whether scalable PRUs can be constructed. In this work we show that if scalable PRUs can be constructed via the prevailing paradigm for analyzing PRUs, then there would be a positive solution to the Aaronson-Kuperberg unitary synthesis problem, a longstanding question in quantum complexity theory about whether implementing arbitrary unitaries can be efficiently reduced to computing a Boolean function. Specifically, we formalize the notion of ROM-PRUs, which are statistically secure PRUs in the random oracle model (ROM). All prior known constructions of cryptographically secure PRUs are based on a ROM-PRU construction. We prove novel connections between ROM-PRUs, approximate unitary designs, epsilon-nets over the unitary group, and the unitary synthesis problem. In particular, we prove that any unitary synthesis algorithm (and thus any ROM-PRU) must use a classical oracle with input length (2 - o(1)) log d bits, where d is the dimension of the unitary to be implemented. This bound rules out all existing candidates for scalable PRUs in the literature. Together, these connections indicate that ROM-PRUs provide a fruitful idealized model for studying pseudorandom unitaries.

Using quadratic optomechanical coupling to prepare high-purity mechanical cat states is not feasible as its strength is several orders weaker than linear optomechanical coupling. Here, using only linear coupling in a multimode system, we achieve strong interaction between photons and two phonons, enabling the deterministic generation of high-purity multicomponent mechanical cats. Mediated by an auxiliary supermode, when other two optical supermodes satisfy the two-phonon resonance condition, the process whereby the annihilation of a high-frequency photon accompanied by the creation of a low-frequency photon and two phonons is strongly enhanced. Such resonant two-phonon process drives multiple rotations and interferences of mechanical coherent states, deterministically generating a multicomponent mechanical cat immune to both mechanical and optical losses. Our work provides an universal strategy for enhancing high-order phonon nonlinearities, paving the way for quantum state engineering, quantum precision measurement and fault-tolerant quantum computation.

Variational quantum eigensolvers fail before optimization begins when strong correlation splits the molecular energy landscape into competing basins and the initial state selects a non-ground-state basin. We introduce a geometry-conditioned preconditioner $\mathcal{P}_{\mathrm{eq}}:\mathbf{R}\mapsto\boldsymbol{\theta}_0$ constrained by the $SE(3)$ covariance of the molecular Hamiltonian, so that nuclear geometry is mapped directly into circuit parameters in the correlated ground-state basin. This basin localization changes the relevant gradient statistics from concentration controlled to curvature controlled. In statevector benchmarks on six stretched molecules, $\mathcal{P}_{\mathrm{eq}}$ reduces Hartree–Fock initialization errors by factors of $38\times$–$6250\times$, reaches sub-mHa initialization in CO, LiH, and H$_8$, and places N$_2$, H$_2$O, and BeH$_2$ in the mHa-scale correlated basin. In disordered H$_{10}$ chains, equivariant basin targeting and stochastic escape reach unit success probability at fixed optimization budget. The procedure performs basin selection before the shot-limited quantum loop; the quantum circuit then refines correlation inside the selected basin.

We discuss the interplay between thermodynamics and magic resources in closed quantum dynamics by introducing Clifford ergotropy, the amount of extractable energy under the restriction to Clifford operations. We provide universal upper bounds on Clifford ergotropy, which decrease with increasing magic as quantified by the infinite-order filtered stabilizer Rényi entropy. We demonstrate the utility of this bound for one- and two-qubit systems, with the latter exhibiting a notable transition in the control landscape of Clifford ergotropy. Finally, we show that our analysis has nontrivial consequences even for many-body systems where the exact optimization is generally difficult to perform, including a form of the second law of thermodynamics under Clifford operations for typical quantum states.

It is known that there exist multi-prover interactive protocols ($\mathsf{MIP}$ protocols) for the complexity class $\mathsf{NEXP}$, succinct $\mathsf{MIP}$ protocols for $\mathsf{NP}$ and multi-prover interactive protocols with shared entanglement ($\mathsf{MIP}^\ast$ protocols) for $\mathsf{RE}$. This extraordinary power of multi-prover interactive proof systems comes from the assumption that provers do not communicate with each other during the protocols. If they are allowed to communicate freely, the setting is the same as in the single-prover case, and the computational power of the system becomes significantly weaker. In this paper, we investigate for the first time the setting where communication (i.e., leakage of information) between provers is allowed but bounded. We introduce two techniques to approach this question and show that multi-prover interactive proof systems are robust against some amount of leakage. Our first technique is based on parallel repetition theorems. We apply it to show that for any polynomial $p$, we can construct two-prover one-round $\mathsf{MIP}$ and $\mathsf{MIP}^\ast$ protocols for $\mathsf{NEXP}$ and $\mathsf{RE}$, respectively, that are robust against $p(n)$ bits of leakage. We further derive our second technique to convert any low-soundness PCP construction to a two-prover one-round $\mathsf{MIP}$ protocol for $\mathsf{NP}$ robust against leakage. We also discuss the relation between robustness against leakage in multi-prover interactive proof systems and the Sliding Scale Conjecture in the PCP literature.

Sensing weak forces through observing a mechanical motion near or below its quantum zero-point fluctuation has been desired in diverse areas. While mechanical oscillators have played a crucial role in such studies, their application to free-fall-type sensing has been elusive, in particular in the quantum regime. Here, we demonstrate sensing a static force of the order of 10 zeptonewtons with a levitated nanomechanical oscillator below the zero-point fluctuation through the rapid modulation of its confining potential. We prepare a squeezed state with a reduced velocity uncertainty by abruptly decreasing the potential. Subsequently, we detect the exerted static force through time-of-flight measurements, where we release the nanoparticle from the potential and measure the displacement during a free fall. Furthermore, time-of-flight measurements allow us to perform quantum state tomography of the squeezed state, from which we reconstruct its Wigner quasiprobability distribution and evaluate the Fisher information for the position measurement to quantify the achievable force sensitivity of our protocol. Our results demonstrate that modulating the trap stiffness serves as a crucial technique for quantum-limited force sensing and paves the way to utilize a levitated nanoparticle as a promising sensing platform beyond the quantum limit with a capability of quantum state tomography.

We systematically investigate nonlinear Ohmic responses in second-harmonic generation and bilinear magnetoelectric effects within the Matsubara Green's function formalism. The optical nonlinear Ohmic conductivity is shown to consist of a nonlinear Drude-like part and an intrinsic term determined by the fully symmetrized normalized quantum metric dipole. Notably, we predict a previously unrecognized intrinsic Ohmic conductivity arising from band geometry in the bilinear magnetoelectric response, which exhibits transverse behavior similar to its optical counterpart. Using a two-dimensional Dirac model, we demonstrate that this geometrically induced nonlinear Ohmic response is observable in materials with high Fermi velocity and narrow band gaps. Our work provides a systematic quantum field-theoretic framework for describing nonlinear Ohmic transport in condensed matter systems.

We identify a class of finite quantum systems, namely, acyclic systems whose transition graph is a directed acyclic graph (DAG), for which the Born series collapses into an exact algebraic identity with finitely many terms and strictly zero truncation error. The sufficient condition is the nilpotency of the transfer operator T = G_0(E)V. If T^{m+1} = 0, then the exact solution of the Lippmann-Schwinger equation is the finite sum |psi> = sum_{k=0}^{m} T^k |phi>, with no condition on ||T||. We prove that the acyclicity of the transition graph implies the nilpotency of T (Theorem 19), and that the nilpotency index coincides with the maximal path length of the graph (Proposition 21). The main result (Theorem 23) concerns the four-level quantum system with diamond-graph structure. In this case, the transition amplitude toward the final state is A_4 = t_{42}t_{21} + t_{43}t_{31}, an exact algebraic identity encoding constructive interference, exact destructive interference (dark state formation), and partial interference. The first-order Born approximation predicts identically zero amplitude in all regimes, thereby failing quantitatively in 100% of the cases. The Born-SON framework additionally provides the exact full resolvent, the exact T-matrix, explicit error control in the quasi-nilpotent regime, and a scalar structural metric, the Born-SON depth, quantifying the intrinsic complexity of an acyclic quantum system.

Let $\mathcal{H}=P\mathcal{H}\oplus Q\mathcal{H}$ and let $\Pi\rho=P\rho P\oplus Q\rho Q$ be the two-block pinching of a density matrix. Write $A=P\rho P$, $B=P\rho Q$, and $C=Q\rho Q$. We study the block-coherence entropy $D(\rho\|\Pi\rho)$, the relative-entropy cost of removing cross-block coherence. First, we prove a midpoint Bogoliubov–Kubo–Mori coercivity estimate, giving the operator-kernel lower bound $D(\rho\|\Pi\rho)\ge \operatorname{Tr}[B^*\Omega^{-1}_{A,C}(B)]$ for strictly positive diagonal blocks. The proof uses the block-sign involution $U=P-Q$ to obtain a sign-symmetric midpoint lower bound for the BKM Hessian. Second, we determine the exact minimum in the associated constrained entropy-minimization problem: at fixed protected-sector floor, leakage mass, and quadratic coherence, the minimum can be achieved by a single active two-level block, independently of the ambient dimension. Third, under a uniform floor $A\ge a_0P$ and $0<\varepsilon_Q\le a_0/2$, we obtain the logarithmic boundary law $D(\rho\|\Pi\rho)\ge \|B\|_F^2\log(a_0/\varepsilon_Q)$, showing that the lower-bound coefficient multiplying the quadratic coherence diverges logarithmically as leakage mass tends to zero. As a finite-dimensional application, the estimates give an entropy certificate for coherent leakage from a protected subspace: $P\rho Q$ measures protected–leakage coherence, and the constrained entropy minimum is attained by a state supported on a single effective two-level transition. The BKM estimate also yields a dissipation lower bound along an idealized uniform block-dephasing orbit. Finally, the midpoint mechanism extends to finite-dimensional trace-preserving $\mathbb{Z}_2$-graded automorphisms and bounded finite-trace semifinite corners.

Many quantum computing workflows manipulate long lists of Pauli strings. A basic classical subroutine involves taking $m$ Pauli strings on $n$ qubits, each of weight bounded by a constant, to determine if they are pairwise commuting, identify any counterexamples, or calculate the exact number of anticommuting unordered pairs. The standard general-purpose route represents Pauli strings in binary symplectic form and checks pairs in $O(m^2)$ time. Here, we provide an $O(m)$ algorithm for the bounded locality regime. It maintains counts of all labeled subpatterns of previously inserted strings and answers each new string query by a subset zeta identity. Our algorithm is particularly useful for processing large collections of Pauli strings within the bounded locality regime.

We propose a quantum network consisting of optical waveguides in the linear regime for quantum state transfer. The circular topology of our network introduces novel functionalities that enable us to analytically identify the conditions under which perfect state transfer (PST) is achievable. We utilize the properties of the Fourier modes, in particular the zero Fourier modes, which provide a protected subspace for the efficient propagation of quantum states, resulting in PST to the diametrically opposite site in a network with any number of sites $N = 4n$. The coupling profiles in the photonic network modulate the number of zero-energy eigenmodes, with uniform couplings yielding more than evanescent ones, confirming that the expedition of observed PST originates from the collapse of the eigenvalue spectrum into three distinct eigenvalue blocks, including $N/2$ manifolds of zero Fourier modes. We investigate PST in both discrete- and continuous-variable input regimes, using single photon state, Schrödinger cat states, and two-mode squeezed vacuum state. Our findings apply to the engineering of quantum networks and photonic lattices, paving the way for applications in controlled routing in integrated quantum circuits.

We introduce two-parameter classes of exactly-solvable novel systems whose Hamiltonian operators could be represented by tridiagonal symmetric matrices in some orthogonal bases. The associated wavefunction is written as point-wise convergent series in the basis elements. The expansion coefficients of the series are orthogonal polynomials in the energy that satisfy the resulting three-term recursion relation starting with two-parameter initial values. These polynomials contain all physical information about the system and they depend on the values of the two parameters. We obtain the associated two-parameter potential function induced by the change in the initial values that causes the system's wavefunction to change. We give several illustrative examples of these systems with continuous and/or discrete energy spectra. Moreover, a curious phenomenon is observed where bound states and/or resonances are induced in a system with pure continuous spectrum (e.g., a free particle) if the two parameters in the initial values exceed certain critical limits.

Quantum systems with more than two levels - so-called qudits - offer increased computational density and reduced circuit complexity compared to qubit-based architectures, but achieving universal and scalable control remains challenging. We propose an all-optical scheme for universal qudit control in trapped neutral atoms in moderate to high magnetic fields, focusing on the fermionic isotope 173Yb (I = 5/2). The strong hyperfine interaction in the 3P1 manifold enables fast and selective Raman transitions between nuclear-spin states in the 1S0 ground-state manifold using a single linearly polarized laser. For each neighboring transition in the qudit manifold, we identify a magic polarization angle that enables coherent, state-selective control while suppressing off-resonant excitations, with operation frequencies exceeding 100 kHz. Combined with phase-shift operations, this provides universal control of the full single-qudit space. We further discuss compatible two-qudit gates based on the Rydberg blockade mechanism, completing a universal gate set, and analyze state-selective readout schemes compatible with the proposed protocol. Our results identify 173Yb as a promising platform for high-fidelity, all-optical qudit-based quantum information processing.

A set of quantum states is said to be antidistinguishable if, upon being given a randomly chosen state from the set, it is possible to exclude with certainty a state that was definitely not prepared. We study quantum nonlocality within the framework of local state exclusion and prove that any set of multipartite pure states containing a state that is orthogonal to all the others is locally antidistinguishable. Next, we introduce the task of $\textit{local state antimarking}$, where, instead of a single state, a non-repetitive sequence of states from a known set of multipartite states is randomly selected and distributed to spatially separated parties, whose objective is to identify, using LOCC, at least one sequence that was not supplied. We present an ensemble of product states that is not globally antidistinguishable; yet, by choosing states from it without replacement, one can construct sequences that can be perfectly excluded globally but, importantly, not locally. This reveals a hitherto unexplored form of `nonlocality without entanglement'. Finally, for a given ensemble, we compare its local antidistinguishability and antimarkability with its conclusive local distinguishability and markability. We demonstrate that no strict hierarchy exists between these paradigms: there exist product-state ensembles that permit one task while strictly forbidding the other, and vice versa.

Detection based on quantum principles such as entanglement has the capacity to achieve finessed levels of sensitivity, bringing transformative impacts to applications. In this study, we propose a rotation sensor using ultra-cold dipolar atoms trapped in a four-well configuration. The design, based on a simple population imbalance measurement to quantify rotation, profits from the property of superintegrability. The implementation of the measurement protocol achieves rotation-detection sensitivity beyond the Heisenberg limit. Our results spotlight superintegrability opportunities for advancing the field of quantum sensing.

Fault-tolerant quantum computing typically requires the transpilation of arbitrary quantum circuits into a finite, universal gate set, such as Clifford+T. As a baseline, Diagonal approximation can be used for synthesizing single-qubit Pauli rotations, yielding an approximating sequence with $T$-count that equals $3 \log_2(1/\epsilon)$ for a target precision $\epsilon$. Magnitude Approximation can reduce the $T$-count to only $1 \log_2(1/\epsilon)$ by allowing large residual errors, which are rotations about orthogonal axes. Within a complete quantum circuit, these residual errors can then be absorbed into neighboring gates before they are approximated themselves. Determining the optimal allocation of approximation strategies within a large, multi-qubit circuit presents a significant combinatorial challenge. In this work, we present a linear-time algorithm that guarantees an optimal solution to this problem. We demonstrate that the issue of delegating Magnitude versus Diagonal approximation across a circuit maps formally to a classical 1D Ising model with a spatially varying field. By minimizing the energy of this Hamiltonian, we identify the optimal approximation configuration for each rotation without exponential overhead. Benchmarking our method against standard diagonal approximation on random quantum circuits, we observe an average reduction of 26% in the total approximating circuit gate count, offering a significant efficiency gain for the implementation of quantum algorithms on near-term and fault-tolerant architectures.

Experiments aimed at quantifying the interface between quantum and classical physics necessarily require a high degree of isolation from the environment: wavefunction collapse and quantum gravity effects at laboratory scales are predicted to be very subtle. Ideally, such tests would be performed in a closed system at extremely low temperatures in order to rule out any external influence and thermal fluctuations. Cryogenic levitated macroscopic bodies are excellent candidates for an accurate laboratory approximation of such systems, as a tether to another body would violate the requirement for the system to be fully closed. Here we report a significant milestone on the way to a practically suitable approximation of such closed system. We have built a milligram-mass superconducting oscillator operating at millikelvin temperatures showing extremely low dissipation rate, with the oscillator ring-down time exceeding 110 hours. This corresponds to the resonance linewidth of less than 0.8 $\mu$Hz. The experimental setup is highly tunable and is compatible with adiabatic nuclear demagnetisation, promising even lower temperatures and lower dissipation levels in the future. We demonstrate the capability of our device by measuring drag from $^3$He impurities in superfluid $^4$He at a level of $\sim10^{-8}$ with the drag force in the femtonewton range.

Hybrid quantum-classical algorithms can help mitigating the physical limitations of current quantum devices, particularly the low qubit count and the reduced topological connectivity. In this paper, we propose a hybrid technique to solve a well-known NP-hard optimization problem: the Traveling Salesperson Problem (TSP). Our approach is based on a graph contraction technique that removes most of the dimensionality of the original problem instance, producing a sub-TSP of a size suitable to be efficiently solved by a quantum device. The performance of our approach is first demonstrated on classical quantum simulation using Path Integral Monte Carlo, and then run on a D-Wave quantum annealer.

Quantum computing promises disruptive capabilities, yet its energy footprint has received far less attention than its asymptotic speedups. We present a first-order, full-system energy model for quantum computing in an high performance computing (HPC) context. The model separates costs common to NISQ and FTQC, such as system maintenance and classical processing, from regime-specific ones such as error mitigation for NISQ and error correction for FTQC. We instantiate the model on 96- and 100-qubit Heisenberg time-evolution simulations on IBM Eagle r3 and a representative VQE workload, and sketch the FTQC energy pipeline. We find that NISQ energy is dominated by the QEM sampling multiplier, while FTQC cost shifts to physical-qubit overhead set by the code distance and magic states. Our model provides actionable insights into the energy consumption of both NISQ and FTQC workloads, and paves the way toward energy-efficient quantum advantage.

When does a decohering quantum system become classical? Generalised noncontextuality gives one criterion, for scenarios rich enough in preparations: a system is classical once its statistics admit an underlying model in which operationally indistinguishable procedures are physically identical. Where it crosses depends not on the state and channel alone but on which preparations, transformations and measurements the experiment offers, and if every measurement is allowed there is no crossing. For any pairwise unbiased bases in any dimension, given preparations holding their eigenstates and surrounding the maximally mixed state, the question reduces to a finite linear program; for a qudit of odd prime dimension $d$ restricted to the stabiliser subtheory, with one depolarised magic state, we solve it in closed form. With preparations and measurements alone the qutrit strange state is classical at zero noise; with the Clifford gates added, each channel represented once, it crosses at $3/5$; and with a random gate represented, as Spekkens' treatment asks, by the matching mixture of stochastic maps, at $3/4$. A Clifford orbit of assignments supports such a representation only if it has $d^2$ members, leaving, in every odd prime dimension, only Gross's discrete Wigner function: the crossing sits where it stops being negative.

Randomness extraction is indispensable for quantum random number generators, serving to eliminate bias and potential information leakage from raw measurement data. Conventional extractors operate in a block-wise fashion, requiring the complete accumulation of raw data before processing. To circumvent the latency and buffering overheads that hinder real-time random number generation, recent work introduced a stream-cipher implementation for the randomness extractor based on the Toeplitz matrix hashing. In this work, we generalize this stream-processing paradigm to the broader family of randomness extractors based on (almost dual) universal$_2$ random hashing. Specifically, we shift the computational burden from a time-consuming block-wise post-processing stage into an offline pre-processing stage that generates a pseudo-random mask. This allows the raw data to be processed by the mask on the fly using a simple bitwise exclusive-OR operation. Crucially, we prove that this stream implementation strictly preserves the security guarantees of the original block-wise protocols. We detail the transformation of three typical constructions – based on standard Toeplitz, circulant, and modified Toeplitz matrices – from block to stream implementations, and benchmark their practical performance using realistic quantum experimental data. We anticipate our framework will enhance the efficiency of real-time quantum cryptographic systems.