Papers

It is sometimes said that a reason to prefer Everettian quantum mechanics is that it allows one to avoid the kind of spooky action at a distance that is a consequence of quantum entanglement according to other approaches. There is a straightforward argument to show EQM has this virtue, however some advocates argue that this requires we see branching as a local causal process. I explain this reasoning and then show why, given the way Everettians standardly conceive of worlds and branching as emergent phenomena, branching need not be viewed as a causal process for EQM to be relativistically local. Forthcoming in Local Quantum Mechanics, OUP 2026.

The periodic non-Hermitian Baxter-Fendley $Z_N$ clock chain has lacked a complete finite-size spectral solution, whereas its open-chain counterpart admits a solution in terms of independent quasienergies. For the periodic model we show that the operator-valued matching polynomial associated with its cyclic Weyl algebra simultaneously generates a set of conserved quantities, including the Hamiltonian, and realizes a cyclic $\tau^{(2)}$ Yang-Baxter transfer matrix. Root-of-unity closure yields a finite system of polynomial spectral equations in each charge sector, which reproduces the complete finite-size energy spectrum counted with algebraic multiplicity. As a first application of this result, we show that Newton continuation of these equations provides a practical numerical route to the periodic ground-state energy without enumerating the full spectrum. For homogeneous chains the thermodynamic seam response yields a criterion for boundary-induced criticality; for $N=3$ it predicts two reciprocal critical couplings with singular ground-state curvature, in contrast to the single self-dual open boundary critical point.

Given a certain specific, $M$ by $M$ matrix form of the Feshbach's effective (i.e., energy-dependent) Hamiltonian $H^{(M)}_{e\!f\!f}(E)$, the inverse-problem reconstruction of the full-space, $N$ by $N$ matrix Hamiltonian $H^{(N)}$ is considered and reduced to the solution of a coupled set of polynomial algebraic equations. Using computer-assisted symbolic manipulations, an explicit algebraic reconstruction of $H^{(N)}$ is found feasible at not too large $K = N-M$.

The advancement of quantum hardware and the intricacies of quantum computing make well-designed quantum software increasingly necessary. Due to the interdisciplinarity of the field, it is crucial to understand the perspectives and specific needs of involved stakeholders, for example, to balance the desired level of abstraction with the exposition of (hardware)-specific details. In this work, we conduct a stakeholder-based analysis to identify personas of quantum software as a means of creating meaningful, user-tailored quantum software. We conducted an expert focus group at a Dagstuhl seminar in 2024 and qualitative interviews with practitioners at conference IEEE QCE in 2025, from which we derive eleven personas of potential users and stakeholders for quantum software. We discuss these personas regarding their use cases, interests, constraints and abstraction level.

Fault-tolerant quantum computation hinges on the requirement for low physical error rates. Reaching below threshold regime requires the accounting of circuit dependent noise, that is inherent to the execution context in which a quantum gate is usually embedded. Direct fidelity estimation is a technique that offers natural context preservation as it solely requires the insertion of local Pauli preparation and measurement fiducials around the window of interest. However, each sampled input-output Pauli pair demands its own preparation and measurement setting, an overhead that grows rapidly once the target gate is no longer Clifford. We introduce joint fiducial grouping, which partitions Pauli pairs into sets with commuting input and output operators, allowing several Pauli-transfer coefficients to be estimated within the same preparation-measurement setting. We derive an unbiased grouped estimator and finite-sample guarantees showing that grouping always reduces the number of distinct input-output settings and can also reduce the required channel uses when the target weight is concentrated within compatible groups. We characterize these gains for the parametric two-qubit gate $\mathrm{fSim}(\theta,\varphi)$, and use the grouped estimator as a context-sensitive reward for reinforcement-learning-based gate calibration. Our results provide a practical route to lower-overhead, context-preserving fidelity estimation for continuously parameterized quantum gates.

Encoding quantum information with low circuit overhead is a fundamental challenge in fault-tolerant quantum computation. Random circuits provide a natural mechanism for rapidly spreading logical information through simple gates applied in parallel. Brown and Fawzi showed that random Clifford circuits on two-qubit Clifford gates provide such encoders that achieve the quantum Gilbert-Varshamov rate-distance tradeoff with depth $O(\log^3 n)$. We show that the same asymptotic tradeoff is attained in optimal $O(\log n)$ depth under a gate distribution with a more restricted support. For every fixed $\delta>0$ and sufficiently large $n$, if $\frac kn < 1 - H(\frac{d}{n}) - \frac{d}{n}\log_2 3 - \delta$, we can construct random circuits of depth $O(\log n)$ which define, with high probability, an $[n,k]$ stabilizer code of distance at least $d+1$, which matches the $\Omega(\log n)$ light-cone lower bound for linear distance encoders. Our ensemble employs a random matching circuit architecture consisting of $T$ independent permutation-invariant layers. In each layer, the qubits are paired up by a uniformly random perfect matching, and a random independent two-qubit Clifford gate is applied to each pair. The gate distribution need not be uniform over, or even have full support on, the two-qubit Clifford group; rather, we allow for very general distributions on Clifford gates satisfying three regularity conditions. In particular, the construction can be implemented using $n/2$ CNOT gates on randomly matched pairs in each layer, with parallel one-qubit Clifford twirls. These regularity conditions allow us to reduce the second-moment dynamics of our random circuits to a reversible Markov chain on binary support strings. We establish logarithmic hitting-time bounds for this Markov chain and comparisons of its stationary distribution to prove the coding properties of the circuits.

Topological orders (TOs) are widely used as quantum error-correcting codes, with anyon excitations serving as error syndromes. For certain Abelian TOs, decoding can be performed by independently matching particle-antiparticle pairs of each species. However, matching-based decoders cannot handle more general fusion rules in either Abelian or non-Abelian TOs, nor account for noise that correlates different anyon species. While clustering decoders are more broadly applicable, they typically neglect anyon data and fusion properties, leading to poor performance in practice. In this work, we introduce a fundamentally different decoder for arbitrary TOs based on integer linear programming (ILP). The ILP formulation linearizes the error-correction problem through the introduction of auxiliary variables and encodes fusion rules as linear constraints. Classical optimization then identifies the minimum-weight error configuration. As concrete examples, we determine error-correction thresholds for three TOs: the Abelian $\mathbb{Z}_2$ TO under depolarizing noise, where charge and flux errors are correlated; the Abelian $\mathbb{Z}_3$ TO, which does not admit a pairwise matching decoder; and the non-Abelian $D_4$ TO under noise channels that generate all anyon species. We demonstrate the versatility of the ILP decoder by showing a clear performance advantage over most existing decoders in all three cases. We further extend the method to incorporate noisy syndrome measurements and propose a just-in-time variant for continuous error correction. Our results establish ILP as a natural framework for handling correlated errors and general anyon fusion rules, and as a powerful and flexible general-purpose decoder for incoherent anyon noise in arbitrary TOs, with applications to fault-tolerant quantum computation.

Projected entangled pair states (PEPS) provide an efficient variational ansatz for two-dimensional quantum phases, but computing observables remains challenging because PEPS contraction is generally costly. Here, we parameterize two-dimensional quantum states using variational PEPS subject to isometric constraints and map the resulting ansatz onto monitored quantum circuits, replacing tensor-network contraction with circuit sampling. For infinite cylinders, the transfer matrix defines a quantum channel on the virtual boundary. We use a fixed-point treatment and a monitored-circuit unraveling of this channel to evaluate observables efficiently. Using a constant number of variational parameters and a number of qubits that scales only with the cylinder width, our method yields a phase diagram for the $J_1$-$J_2$ model in qualitative agreement with DMRG results. Because the monitored circuits are compatible with near-term quantum hardware, this approach provides a hybrid quantum-classical framework for simulating two-dimensional quantum many-body systems.

Two-dimensional (2D) electron/hole gases confined in semiconductor heterostructures suffer from weak Rashba spin-orbit coupling (SOC) for manipulating spin degreee of freedom via an electric rather than a magnetic field. Here, we show that complementary metal-oxide-semiconductor technology-accessible strain could substantially enhance the linear Rashba SOC of the top hole subband in Ge/SiGe quantum wells (QWs) to a level comparable to that of 2D Rashba materials through enhancing the mixture of the light-hole and heavy-hole bands. We further show that strongly enhanced Rashba SOC boosts the Rabi frequency of hole spin qubits confined in Ge/SiGe QWs by two orders of magnitude to an unprecedented 40 GHz, more than one order of magnitude faster than other qubit platforms. We also demonstrate that the hole spin rotation with Rabi frequency > 25 GHz enters a new regime being immune to gate control-induced electric noise, opening a new avenue to simultaneously improve the gate speed and gate fidelity. Our findings provide a new routine to substantially enhance the Rashba SOC in 2D semiconductor hole gases to a level that is great for spintronic applications.

We present TDSE-Z, a high-performance open-source framework for strong-field quantum dynamics in atomic, molecular, and semiconductor effective-mass systems. The core engine implements a weak-form Galerkin discretisation of the Hermitian BenDaniel-Duke operator, $\hat{T}_{\mathrm{BDD}} = -\frac{1}{2}\nabla\cdot(m^{-1}(\mathbf{r})\nabla)$, on geometry-adapted B-spline meshes, supporting arbitrary potentials and customisable laser configurations in one to three dimensions. We validate the static position-dependent-mass (PDM) eigensolver through two stringent benchmarks: a comparison to the analytical Quesne PDM model and a $\text{GaAs/Al}_{0.3}\text{Ga}_{0.7}\text{As}$ double quantum well, where the exponential decay of computed tunnel splittings follows Wentzel-Kramers-Brillouin (WKB) theory at the sub-percent level. We further demonstrate the time-propagation engine on constant-mass systems, accurately reproducing high-harmonic generation (HHG) spectra in atomic benchmarks and confirming the importance of dimensionality in fully capturing the strong light-matter interaction. Our implementation demonstrates robust strong-scaling efficiency, maintaining performance across hundreds of CPU cores. While the static eigensolver currently supports optional GPU offloading, the time-propagation engine is CPU-optimised, providing a modular architecture for future expansion toward exascale quantum dynamics.

We study the problem of perfectly multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication. We construct a protocol that multicasts symmetric universal clones of input states from multiple source nodes by extending the quantum network coding protocol proposed by Kobayashi et al. We further establish a sufficient condition for perfect multicast in the single-source setting. Specifically, we show that when a single copy of a $q^r$-dimensional input state is available at the source node, where $q$ is a sufficiently large prime power, perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes. This result holds for quantum networks represented by an undirected graph $G$, where each edge corresponds to a noiseless $q$-dimensional quantum channel, provided that there exists an acyclic directed graph $G'$ obtained by assigning directions to the edges of $G$ such that the minimum cut of $G'$ is at least $r$.

Entanglement is central to quantum information processing, while stabilizer operations underpin fault-tolerant quantum computation. We ask how much entanglement remains visible or distillable under stabilizer restrictions. We quantify stabilizer-visible entanglement by restricting the measured relative entropy of entanglement to stabilizer measurements, thereby obtaining converse bounds on entanglement distillation under stabilizer operations. We demonstrate magic-free asymptotic entanglement hiding: we construct explicit convex mixtures of pure stabilizer states on $N$ qutrits per party whose unrestricted visible entanglement and LOCC-distillable entanglement both grow as $\Omega(N/\log N)$, while their stabilizer-visible and stabilizer-distillable entanglement vanish as $N\to\infty$. Thus, an unbounded amount of LOCC-distillable entanglement carried by stabilizer states can become asymptotically invisible and undistillable under stabilizer restrictions. We further prove that stabilizer-visible entanglement is $O(1)$ with high probability for Haar-random pure states despite extensive unrestricted visibility, and vanishes uniformly over entangled Werner states as the local dimension grows through odd primes. These results reveal a fundamental separation between entanglement and magic as resources, exposing intrinsic limits on entanglement extraction using stabilizer operations.

We use edge-colored complete multigraphs to study complete orthogonal product bases (OPBs) in $n$-qubit systems. We prove that two OPBs are equivalent if and only if their associated multigraphs are isomorphic, thereby reducing OPB classification to graph isomorphism. Within this framework, we establish the upper bound $v\le 2^n-1$ on the number of variables of an $n$-qubit OPB. We also derive $\binom{a_{n-1}+1}{2}\le a_n\le B_{2^{n-1}}^n$ for the number $a_n$ of equivalence classes of $n$-qubit OPBs, where $B_m$ denotes the number of partitions of an $m$-element set. These bounds imply the asymptotic behavior $a_n=2^{2^{n+o(n)}}$. For every OPB, the connectivity pattern of its color layers characterizes local irreducibility, which in turn implies indistinguishability by finite-round local operations and classical communication (LOCC); the existence of a complete color-splitting tree characterizes perfect distinguishability by finite-round LOCC. Finally, we give an algorithm for testing OPB equivalence and a recursive graph algorithm that constructs a finite-round LOCC protocol whenever such perfect discrimination is possible.

Maximum-probability (MP) decoding selects the most probable microscopic error, whereas degenerate maximum-likelihood (MLD) decoding includes the configurational entropy of an entire logical sector. Using code-capacity Pauli noise to isolate rigidity intrinsic to the code, we determine the first physical error weight $m$ at which their logical winner sets become disjoint, even under optimal MP tie resolution. Code distance imposes the universal bound $m\geq h=\lceil d/2\rceil$. We define the entropic rigidity depth $r$ through $m=h+r$ and certify a three-level hierarchy: $r=0$ for planar surface codes and two concatenated families, $r=1$ for odd-distance square toric codes and the Gross $[[144,12,12]]$ quantum low-density-parity-check code, and $r=2$ for a separable family with hypergraph product and bivariate bicycle descriptions. The onset fixes the leading operational failure gap, proportional to the $m$th power of the physical noise strength. Geometry and algebra therefore provide quantifiable controls of configurational entropy and an exact benchmark for low-noise decoder selection.

Quantum error correction (QEC) protects quantum computations by repeatedly measuring stabilizer syndromes and using a classical decoder to infer corrections. Modern surface-code decoders are increasingly calibration-aware: they use recent device behavior to set priors such as matching-graph edge probabilities, and these priors directly shape the selected correction. We identify the prior-update path as an overlooked integrity-critical attack surface: a poisoned prior can change decoding decisions even when the syndrome stream, logical labels, and decoder implementation are unchanged. This makes prior poisoning different from ordinary syndrome anomalies and difficult for raw syndrome-anomaly tests to detect. We introduce PriorGuard, a lightweight semantic guard that checks proposed prior changes on high-influence detector-graph entries against private syndrome-derived evidence, accepts updates only when their log-odds movement is evidence-supported, and otherwise falls back to the last evidence-supported prior. We evaluate on Stim-generated rotated surface-code memory circuits decoded with PyMatching. Prior influence is highly concentrated, with the top 10 percent of entries carrying over 60 percent of positive logical-error influence; poisoning only 6.4 percent of decoder-prior entries can raise logical error rate (LER) by 3.35x. PriorGuard recovers most attack-induced loss with a low false-positive rate and modest update-boundary overhead of about 1.7–1.8 ms and less than 0.31 MB auxiliary memory per update.

We identify a few small errors in the proof of Theorem 1 in M. Schuld, 'Supervised quantum machine learning models are kernel methods' (arXiv:2101.11020v2), Appendix A. These do not affect the validity of the theorem, but do matter if one wants to use the appendix to explicitly compute the Fourier coefficients of a quantum kernel. We give the corrected derivation, and additionally show that the paper's worked cosine-kernel example contains a second, unrelated error that happens to cancel the first, thereby coincidentally yielding the correct result.

Saturated absorption spectroscopy is a powerful technique that provides valuable information about gas-phase atomic targets, including not only the precise positions of transitions but also the effects of velocity-changing collisions, which manifest as changes in the shape of the peaks. However, using a lock-in amplifier inappropriately can generate artifact side peaks, potentially leading to a misinterpretation of results. To investigate the emergence of these artifacts, we conducted numerical calculations based on the basic Lambert-Beer's law. Our model reproduced the artifact side peaks and revealed that these artifacts become more significant as the transmittance of the probe laser decreases.

An ensemble of $N$ two-level molecules prepared in its ground state and sharing a lossless cavity with a weak field does not simply absorb: the intensity collapses and then recurs, in a train of collective photon echoes. Working from the exact solution of the Tavis-Cummings model in the few-photon regime $\bar n<N$, we confirm the echo time $\tau_E=4\pi\sqrt{N+\Delta}/g$ numerically at resonance from $N=5$ to $400$, the small-$N$ end discriminating this form from the alternative $4\pi\sqrt{N-\bar n+\Delta}/g$ in its favor. The initial state requires no preparation, being the ground state. The echo time is independent of the initial photon distribution: coherent, thermal, squeezed and oscillatory-squeezed distributions spanning variances from 2 to 34 all recur together, as does a controlled pair with identical mean and variance differing only in the shape of $\rho_{nn}$. The echo amplitude is not: it varies at the tens-of-percent level at fixed mean, including a factor of 1.8 with the squeezing phase at fixed squeezing strength. Detuning organizes the dynamics into two clean regimes separated by a fragmented crossover, the dispersive-branch echo time approaching one-half the resonant one, and sufficient detuning removes the dependence on the initial Dicke state. For arbitrary initial Dicke state, emission replaces absorption at $m\simeq-N/2+\bar n$, and the echo envelope acquires one component per step up the ladder: a single-component echo occurs only at the ground state. A feasibility analysis against a five-qubit superconducting device, with Lindblad simulations of cavity decay and dephasing and full-Hilbert-space disorder simulations, shows the first echoes observable at $N\sim5$-$20$ on existing hardware: the echo survives the dominant loss channel with contrast $\sim e^{-\kappa\tau_E/2}$, photons being shielded from cavity decay while resident in the emitters.

A closed Friedmann-Lemaitre-Robertson-Walker Wheeler-DeWitt model is formulated as an exact reflection problem. The derivative of its reflection phase defines a relational crossing duration whose first two clock moments follow from a covariant scalar-clock observable. An analytic expression is obtained for this duration, its classical recollapse limit, and the leading quantum correction. A finite spectral packet also gives an operational, equal-prior minimum error probability for distinguishing the two orientations of recollapse with a geometric reading. The construction is extended to a bounded finite quantum detector. Its multichannel reflection matrix yields probe transitions, spectral-probe correlations, and a matrix duration. A direct weak-coupling calculation verifies the predicted transition and duration scalings. Scalar-clock conditioning and oriented geometric sections are shown to be local representations of the same positive-frequency Dirac sector. These results define duration and transition observables entirely through correlations and scattering records of a stationary constrained state, without introducing a background clock.

This paper extends a recently proposed Variational Quantum Algorithm framework for nonlinear elasticity to a broader class of constitutive nonlinearities involving rational powers of the stretch. One-dimensional incompressible Ogden and Mooney-Rivlin models are employed as representative examples to demonstrate the proposed methodology. Nonlinear constitutive terms are transformed into forms compatible with the available quantum algorithmic primitives through the introduction of auxiliary variables and penalty constraints, yielding approximate solutions via a Variational Quantum Algorithm. An iterative correction strategy based on a sequence of Variational Quantum Algorithms is then introduced to improve solution accuracy. A Numerical example demonstrates the proposed approach.

The quantum geometric tensor has been shown to bound the gap, optical absorption, and dielectric susceptibilities of materials. Here we derive new quantum-geometric bounds on the magnitude and sign of the Casimir force between two-dimensional plates in the long-distance limit. These bounds limit the previously attributed benefit of increasing the plate's Chern number to maximize repulsion, and give a quantum geometric origin to the stronger attractive force of metallic plates, regardless of their Chern number. These bounds allow us to infer that flat Chern bands that saturate geometric bounds, including Landau levels and moiré flat bands, enlarge the window where Casimir repulsion exists and bring the repulsive crossover to smaller, more experimentally relevant distances. We derive estimates for material platforms such as twisted MoTe$_2$. Our work shows that quantum-geometric bounds constrain repulsive Casimir forces beyond previously known theorems, and suggests new optimization strategies to observe repulsion.

Let $L_u$ be a symmetric Levy process representing an unobserved phase lift, coupling to a quantum system via charge $Q$. Averaging $e^{iL_uQ}$ gives a completely positive dephasing semigroup. If the characteristic exponent lacks an intrinsic charge scale, the Levy-Khintchine theorem forces $\eta(\xi)=D | \xi |^{\alpha}$ ($0<\alpha\le2$), so coherences decay at $\Gamma_{ab}=D | q_a-q_b |^{\alpha}$. For integer charge differences, the process descends to the wrapped variable $\Theta_u=L_u\bmod 2\pi$; for real charges, the lift is the relevant phase. Schoenberg's theorem ensures complete positivity for any finite real spectrum when $0<\alpha\le2$, while $\alpha>2$ yields an analytic obstruction. This boundary is exact, verified numerically here. A Gaussian integrated phase gives quadratic charge dependence, though colored Gaussian noise need not yield a Markov semigroup. Two idealized non-Gaussian mechanisms are analyzed: inverse-power Poisson shot noise ($\alpha=d/p$) and Bochner subordination of Brownian phase by an $\alpha/2$-stable clock. For a bounded reduction walk, we prove Born probabilities for every symmetric bounded proposal law. Simulations of truncated stable laws ($\alpha=0.5,1,1.5,2$) confirm this law-independence. In continuous time, $\alpha$-stable drivers fail to reduce: the exact-flow (Marcus) equation oscillates, and the naive Ito jump equation fails to preserve state. For Gaussian white noise, the Itô model collapses to Born probabilities, whereas the exact-flow (Stratonovich) model does not collapse without a threshold and yields non-Born exit probabilities. The quadratic case recovers Milburn's small-step limit, not his exact Poisson dynamics. Finally, a bi-temporal geometry is examined as a possible compact phase source, but closed timelike curves, nonunitary evolution, and an unstable mode tower prevent a consistent field-theoretic realization.

Pauli Check Sandwiching (PCS) is a quantum error detection (QED) technique that protects a quantum circuit by utilizing a pair of controlled Pauli operators, or checks, and detecting errors that anti-commute with the checks. Further, PCS can be used for quantum error mitigation (QEM) via post-selection based on the Pauli check syndrome values. Currently, PCS is leveraged in the qubit space. In this paper, we introduce a generalized approach for applying PCS-based QED and QEM to quantum information of arbitrary dimension in the Hilbert space. Each pair of these extended checks consists of a sequence of gates in the Heisenberg-Weyl operator set that extend Pauli operators into the qudit space. These qudit checks use at least one ancilla qudit to detect qudit errors that do not commute with the unitary selected for the check. We show that our proposed methods for qudit QED can detect errors of arbitrary dimensions. More specifically, we prove that an arbitrary Heisenberg-Weyl error maps deterministically to a unique ancilla readout, and further, post-selecting on the $|0 \rangle$ readout guarantees unit fidelity in the noiseless check limit. We validate these findings numerically across dimensions $d=2$ through $d=9$, achieving error-mitigated fidelities above $97.5\% $ under realistic depolarizing error rates.

A context is a complete set of mutually exclusive outcomes whose probabilities sum to one. We define a pseudocontext as two disjoint groups, with no mutually exclusive pair within either group, whose total probabilities must nevertheless be equal solely because of how the contexts overlap. We give an exact finite test for this property and show that the equality is independent of the chosen coordinates and probability model. Applying the test in three dimensions, we obtain a 15-outcome real example with groups of three and a 20-outcome complex example with groups of two. Under this definition, the sharp minimum number of outcomes in each target group is two over the complex field and three over the real field.

Teleporting unknown quantum states between distant nodes of a network is a significant feature of quantum communication. Few studies, however, have been conducted on $N \to M$ telecloning, in which $N$ copies of an unknown quantum state are optimally teleported to $M \geq N$ receivers. Previous work requires global POVMs on all copies and auxiliaries; here, we show that symmetric $N \to M$ telecloning can be probabilistically performed using only sequential (or parallel) Bell state measurements (BSMs), allowing the copies to be spatially separated. When successful, the fidelity of each receiver's reduced state saturates the bound imposed by the no-cloning theorem, with the probability of success being independent of $M$. In the case of an `unsuccessful' BSM, we show that the teleportation fidelity is likely to remain high, with the measurement outcome also providing information about the closest Pauli eigenbasis to the unknown state being telecloned. In this sense, each receiver can remotely infer the unknown quantum state with a level of confidence that scales with the number of copies, even if the fidelity of their own reduced state is sub-optimal. We additionally analyze the required resources to ensure the classical-communication fidelity bound is surpassed, both in terms of two-qubit inseparability and varying classes of multipartite entanglement. Surprisingly, we uncover that, at a given iteration of the protocol, pairwise entanglement is not always necessary to increase the teleportation fidelity and is never required to beat the classical bound for $N \geq 2$.

As quantum circuits grow beyond small toy examples, preparing them for execution on physical devices becomes increasingly complex. Design automation is therefore essential for scalable quantum computing: Compilation procedures optimize resource requirements and transform circuits to a format compatible with specific hardware; resource estimation evaluates execution cost; verification methods prove circuit correctness. However, these concepts present a steep learning curve for novices, particularly when quantum circuits are introduced through low-level textual representations. To address this, we present a block-based programming framework for quantum design automation, implemented as an extension to the Scratch programming platform. This system allows users to build quantum circuits as a sequence of blocks and embed them in classical control logic to perform evaluations, compare simulation results, and directly apply different design automation techniques. We evaluated the approach in a user study with computer science students, who completed guided exercises using the platform and provided structured feedback in the form of self-reports and short knowledge assessments. Results demonstrate strong understanding and confidence in quantum design automation concepts, suggesting that the block-based approach successfully lowers the entry barrier to quantum design automation. The implemented framework is open-source and available at https://github.com/munich-quantum-toolkit/scratch-quantum.

Quantum dots are tunable semiconductor nanocrystals that can be produced at industrial scales. We present the first ab initio calculation of the scattering of dark matter on electrons bound in quantum dots. The momentum-dependence of a quantum dot's electronic response depends on its morphology and on the dark matter mass, interaction operator, mediator coupling, and mediator mass. Therefore, the relative rates across an array of distinct quantum dot targets form a “barcode” that carries information about the nature of the dark matter interaction. We project the sensitivity of a detector concept in which a collection of independent target subunits, each loaded with silicon quantum dots of a particular morphology, are read out by Skipper CCDs. Given a future signal, this barcode could discriminate between interaction operators and mediator types. We quantify the discrimination power for a benchmark pair of models as a function of readout noise and exposure.

Variations in the gauge couplings of the Standard Model have been searched for experimentally and proposed as solutions to open questions in fundamental physics. Varying gauge couplings can arise from a dynamical scalar field coupled to the gauge kinetic term. This mechanism has been invoked extensively, assuming a minimal linear coupling of the scalar to the gauge bosons. In this work, we investigate how this operator is generated from the ultraviolet perspective. We argue that in weakly coupled, renormalizable completions in four spacetime dimensions, gauge invariance forces the leading dependence of the effective gauge coupling on the scalar to be logarithmic rather than linear. The gauge coupling evolution in these scenarios can be entirely described by the renormalization-group running with dynamical mass thresholds. Beyond leading order or four dimensions, we provide examples showing that more general behavior is possible. Finally, we discuss the phenomenological implications of dynamically evolving gauge couplings, particularly in early-universe settings.

Programmable arrays of ultracold atoms are a leading platform for quantum computation and simulation, enabling state-of-the-art implementations of quantum error correction, and analog simulations of Hubbard models that address open problems in condensed matter physics. In these systems, all local control is mediated through precisely shaped optical fields, and so the challenge of managing many-body quantum states becomes an exercise in optical design. In particular, one wishes for fast, flexible control with low disorder and heating, and access to large arrays with many atoms. An ideal optical system therefore must generate arbitrary patterns with high spatial resolution and low disorder, and alter these patterns on a timescale that is faster than the relevant atomic dynamics. Here, we present an optical system that is comparable to previous approaches in scale, while advancing all other axes. We demonstrate arbitrary pattern generation with $10^{-3}$ intensity resolution, a frame rate of $>84$ MFPS (megaframes per second), and a spatial resolution of $83 \times 52$ beam waists (with $11 \times 52$ waists accessible via a single $40$ GHz electro-optic modulator). These capabilities unlock a new class of experiments. We develop and numerically validate a scheme for fully programmable Hubbard models, with time-dependent control over local chemical potentials, tunneling amplitudes, on-site interactions, and patterns of artificial magnetic flux. The same architecture performs fast, arbitrary permutations of tweezers in 2D, decoupling optical constraints from the design of high-rate error-correcting codes.

In this paper, we provide estimators for quantum Rényi and Tsallis entropies with nearly optimal sample complexity. Specifically, for order $\alpha$, dimension $d$, and additive error $\varepsilon$, 1. For $0 < \alpha < 1$, the sample complexity is $O(d^{1+1/\alpha}/\varepsilon^{1/\alpha} + d^{1/\alpha-1}/\varepsilon^{2})$ for Rényi entropy and $O(d^{1+1/\alpha}/\varepsilon^{1/\alpha} + d^{2-2\alpha}/\varepsilon^2)$ for Tsallis entropy. In particular, for $0 < \alpha \leq 1/2$, the sample complexity for both entropies is $O(d^{1+1/\alpha}/\varepsilon^{1/\alpha})$. 2. For non-integer $\alpha > 1$, the sample complexity is $O(d^2/\varepsilon^{1/\alpha} + d^{1-1/\alpha}/\varepsilon^2)$ for Rényi entropy. Our upper bounds improve the quantum Rényi entropy estimators due to Acharya, Issa, Shende, and Wagner (2017) and the quantum Tsallis entropy estimators due to Chen, Liu, and Wang (2026), and match the lower bounds recently established by Wang (2026).