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.

This Week: Nov 15 - Nov 19, 2026
200 Papers This Week
884 CRQC/Y2Q Total
13018 Total Analyzed

High-temperature Gibbs states are uniformly Markovian and trivial

Andrew D. Kim, Tai Hsuan Yang, Jong Yeon Lee

2611.26626 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

We prove that, above a constant temperature threshold, Gibbs states of local noncommuting qudit Hamiltonians exhibit exponential decay of mutual information and conditional mutual information (CMI). Specifically, we prove exponential decay of the CMI for arbitrary spatial tripartitions $A \sqcup B \sqcup C$ which need not comprise the entire system, thereby establishing a \textit{uniform Markov property} for high-temperature Gibbs states. A central obstruction to proving such bounds is that conventional cluster expansions for the logarithm of reduced Gibbs states can fail to converge due to noncommutativity. Our main insight is to construct a classical representation of the Gibbs state using an overcomplete basis. Although such representations generally involve negative quasiprobability weights, we show that a decomposition based on projective 2-designs admits a convergent cluster expansion with strictly positive weights at sufficiently high temperatures, allowing us to circumvent the obstruction. The separability of high-temperature Gibbs states is a natural byproduct of this decomposition. Finally, in the context of mixed-state phases of matter, our results imply that high-temperature Gibbs states belong to the same mixed-state phase as the maximally mixed state.

Local velocimetry for atomic superfluids: from Riemann rarefaction waves to quantized vortices

Yansheng Zhang, Yi Jiang, Feiyang Wang, Louis Depaepe, J. Q. Matthew Chia, Christoph Eigen, Gehrig Carlse, Zoran Hadzibabic

2611.26608 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

We demonstrate local velocimetry for atomic superfluids in two dimensions (2D). Using matter-wave interferometry based on Raman--Bragg beam splitters, we map the local gradient of the phase of the superfluid's wavefunction onto displacement of the interference fringes and reconstruct the 2D velocity field. We illustrate the capabilities of this technique by applying it to two canonical problems. First, we directly observe the self-similar evolution of the velocity field in 1D Riemann rarefaction flows. Second, we map out the full 2D velocity field around quantized vortices, explicitly demonstrating the quantization of velocity circulation.

Query-Optimal Quantum Minimum Finding from Numerical Estimators

Egil Bae

2611.26606 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

We propose a quantum minimum-finding algorithm for objectives accessed via numerical estimators that avoids the logarithmic query overhead of amplifying the confidence of estimates before the search. A coherent estimator that is $\varepsilon$-accurate with probability at least $2/3$ on each of $N$ labels suffices to find a $2\varepsilon$-optimal label using $O(\sqrt N)$ base-estimator queries at constant confidence. The query bound and the additive-error constant are separately worst-case optimal. More generally, suppose a preparation assigns probability mass at least a known $p$ to objective values at most $a$. Without knowing $a$ or the prepared distribution, our algorithm returns a candidate and an estimate $v$ such that, jointly with constant probability, $v$ is $\varepsilon$-accurate for the candidate and $v\le a+\varepsilon$. The algorithm uses $O(p^{-1/2})$ queries to each of the preparation and estimator oracles in the worst case, and the selected candidate can be retained as a quantum state. For preparation width $s_P$ and estimator workspace width $w$, it requires $O(s_P+w+\log\log(4/p))$ qubits, independently of the requested confidence. Applications give worst-case optimal $Θ(\sqrt N/η)$ queries for selecting an $η$-optimal bounded expectation, and guided ground-energy estimation using $O(ω^{-1})$ preparations and $O((ωη)^{-1})$ elementary controlled-evolution queries at constant confidence, where $ω$ is a lower bound on the guiding state's ground-space amplitude overlap.

Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion

David Halpenny, Adithya Sireesh, Petros Wallden

2611.26605 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Arithmetic operations are a fundamental building block in the design of quantum algorithms, with their implementation cost expected to have a significant impact on the viability of a wide variety of quantum applications. In this work, we present novel algorithms for a number of in-place quantum arithmetic operations that are highly efficient in terms of their space and gate count overheads compared to the current state-of-the-art. We show that in-place modular multiplication of integers, modulo a power of two, can be performed with either a classical or quantum odd multiplier using $O(n^{1+ε})$ gates and no ancilla qubits, for any $ε>0$. We then show that standard in-place integer multiplication can be performed with a non-zero classical or quantum multiplier using $O(n^{1+ε})$ gates for any $ε>0$, with no ancilla qubits required for the classical multiplier and a logarithmic number of ancilla qubits for the quantum. Using our quantum modular multiplication algorithm, we also show that in-place modular inversion, modulo a power of two, can be performed using $O(n^{1+ε})$ gates and no ancilla qubits, for any $ε>0$. To our knowledge, these are the first quantum algorithms achieving both subquadratic gate counts and sublinear ancilla counts for each of the considered in-place operations. All but one of these fast operations are optimal in terms of memory, only requiring enough space to store the output of the operation, which overwrites the input directly. We present our multiplication algorithms as consequences of a single unified theorem, which may find further application within quantum arithmetic.

Scalable Simulation of Strongly Correlated Fermions with Neural Gaussian Tensor Networks

Runze Chi, Ao Chen, Garnet Kin-Lic Chan

2611.26604 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Accurate simulations of strongly correlated electrons remain a central challenge in computational physics. We introduce neural-network Gaussian projected entangled-pair states (NN-GPEPS), which exploit the locally-entangled subspace of Gaussian states to give an architecture more compatible with modern neural networks and an exact contraction cost of $O(N^{3/2})$ on two-dimensional lattices. For the Hubbard model at $U/t=8$ and $1/8$ hole doping, we obtain state-of-the-art variational energies in large lattices of up to 1024 sites. These results demonstrate an accurate approach to strongly correlated fermions by connecting neural networks with Gaussian tensor networks.

High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics

John M. Martyn, Rod Rofougaran, Samuel Stein, Di Luo

2611.26587 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Neural-network quantum states (NQSs) exhibit a disparity in converging to the ground state during energy minimization: while the energy converges quadratically with the error in the variational wave function, other observables converge only linearly, which limits the accuracy of physical predictions. Here we show how to close this gap by introducing a new algorithm that improves the accuracy of NQSs. Our method, termed dynamical averaging, estimates expectation values by averaging over a state (or observable) evolved in real-time. Using insights from quantum information, we prove an up-to-quadratic suppression of error in arbitrary ground state observables, thus matching the fast convergence of the energy. Importantly, this improved accuracy requires neither further energy minimization nor increased model complexity, but rather exploits the effect of randomization on quantum states. We demonstrate dynamical averaging on non-integrable spin models, where it accelerates convergence and substantially reduces errors in observables.

End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System

Mohsen Bagherimehrab, Daniyaal Farooqi, Gavin K. Brennen, Barry C. Sanders, Alán Aspuru-Guzik

2611.26582 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum algorithms for differential equations have the potential for substantial algorithmic speedups over classical methods. However, they rely on certain assumptions and abstract oracle specifications that leave their practical feasibility and computational advantages for realistic applications unclear. Here we formalize the concept of an end-to-end quantum algorithm for differential equations as one that accepts classical inputs and returns classical outputs, and provide implementations for algorithmic primitives in constructing such algorithms. We present a tailored end-to-end quantum algorithm for the linearized Poisson-Boltzmann (LPB) equation, a partial differential equation (PDE) with variable coefficients widely used in simulating a biomolecular system. We explicitly implement all aspects of the algorithm, from preparing an initial state to generating a quantum solution and estimating properties of the system. In particular, we develop a new discrete representation for variable-coefficient PDEs on a grid that enables efficient implementation of the operator oracle, and build on a recent technique based on optimal wavelet preconditioning to generate a quantum solution with a cost independent of the condition number of the discretized operator. We show the algorithm can be implemented by quantum circuits of size polylogarithmic in both the number of grid points $N_g$ and the inverse of the desired accuracy $\varepsilon$, with an overall gate cost polylogarithmic in $N_g$ and quasilinear in $1/\varepsilon$. We also show the classical preprocessing to construct the circuits has polylogarithmic cost in $N_g$ and $1/\varepsilon$. Our work provides a concrete end-to-end quantum algorithm for a PDE of practical value, demonstrates an exponential improvement in scaling with $N_g$ over classical methods, and provides a foundation for assessing its potential quantum advantage in practice.

Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter

Mario Herrero-Gonzalez, Elham Kashefi, Mina Doosti

2611.26577 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Ground-state measurement statistics characterize quantum matter. Selected correlations can guide the classical training of a quantum sampler even when sampling the full distribution is difficult. We ask whether training across related ground-state distributions helps the sampler reproduce their correlations more accurately. We train a hypernetwork to map Hamiltonian parameters to circuit angles, sharing information across the phase diagram before local fine-tuning with additional reference data for quantum deployment. For classical training, we derive an unbiased Monte Carlo estimator of Fourier coefficients for circuits built from general Pauli rotations, with a cost that depends on the circuit generators. We also introduce a CDF-KL loss for comparing selected marginals. We study the Haldane Hamiltonian and transverse-field Ising model, using an automated search to select reference calculations near phase transitions. On the twelve-site chain, the adaptively pretrained hypernetwork matches the independent fits' final mean total variation distance in fewer local updates and continues to a lower error. On a 1,024-site chain and a 4 by 256 lattice, the fine-tuned circuits have lower squared maximum mean discrepancy from the reference distributions than the independent circuits at the evaluated point in each geometry. These results motivate shared training for preparing quantum samplers across a phase diagram and local fine-tuning.

Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA

Alper Cakan

2611.26574 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Remark: This work is in submission at STOC'27 and thus the full manuscript has been publicly posted on the conference website since November 3rd, 2026. Inspired by the Codeword-Hash Structure problem recently introduced by Cakan (arXiV, 2026) to separate $\mathsf{QMA}$ from $\mathsf{QCIP}$, we introduce a new problem called Codeword-Hash pairs in Noise ($\mathsf{CHN}$) and prove that, in the query complexity model, it is in $\mathsf{QMA}$ but hard for the $\mathsf{QCMA}$ hierarchy $\mathsf{QCMAH} = \bigcup_{d\geq1}\mathsf{QCMA}^{\mathsf{QCMA}^{\cdots^{\mathsf{QCMA}}}}$, the classical-witness quantum-verifier analogue of $\mathsf{PH}=\bigcup_{d\ge1}\mathsf{NP}^{\mathsf{NP}^{\cdots^{\mathsf{NP}}}}$. Using this problem, we show that there exists a classical oracle ${O}$ such that $\mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O} =\mathsf{QCMAH}^{O} \subset \mathsf{QMA}^{O} \text{ but } \mathsf{QMA}^{O}\not\subseteq\mathsf{QCMAH}^{O},$ thus showing that quantum state or quantum proof advantage could exist even if classical computers can efficiently solve any problem that can be quantumly verified with a classical proof. Further, using our problem, we show that various quantum cryptographic primitives can exist even when $\mathsf{P} = \mathsf{QCMA}$ and thus neither quantum-computable one-way functions nor (verifiable) quantum computational advantage exist. In particular, relative to a classical oracle ${O}$ with $\mathsf{P}^{O}=\mathsf{BQP}^{O}=\mathsf{QCMA}^{O}=\mathsf{QCMAH}^{O}$, there exist pseudorandom states with classical keys and public-key encryption with copy-protected quantum decryption keys and classical public keys and ciphertexts, among other primitives, answering an open question of Kretschmer, Qian, and Tal (STOC 2025).

Authenticating quantum key distribution through random position checks

Florian J. Curchod, Erik Woodhead, Cameron Foreman, Marcel Mordarski, Harry Buhrman

2611.26542 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum key distribution (QKD) requires some form of authentication in order for the parties to be sure they are not unknowingly generating a key with an adversary pretending to be one of the honest parties. In this work, we propose a protocol in which the position of one of the parties is used as the authentication credential for key distribution. Our protocol essentially consists of a BB84 QKD protocol with quantum position verification (QPV) rounds randomly interleaved in. The approach is efficient compared with previous approaches, which required running an entire QPV protocol for every bit requiring authentication. We undertake an initial security analysis of the protocol for a restricted set of attacks.

On the design of sequential quantum repeaters with error detection

Javier Rey-Domínguez, Koji Azuma, Mohsen Razavi

2611.26537 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Long-distance, trust-free quantum communications rely on the development of scalable quantum repeater schemes. Sequential entanglement generation with error detection is a promising approach that combines manageable implementation requirements with a hop-by-hop architecture compatible with existing classical infrastructure. In this paper, we investigate key design choices for such schemes over a repeater chain using quantum key distribution as a benchmark. We find that simple quantum error-detecting codes, such as repetition codes or quantum parity codes, perform well under near-term hardware assumptions and outperform strategies without any encoding. In particular, we show that two-qubit repetition codes may well be all that we need to implement in many practical scenarios. We also examine different architectures for the generation of initial entanglement and assess their merits. Additionally, we show that moderate improvements in some hardware components can partially mitigate the slow technological progress of others.

Hamiltonian Stabilization of the Two-Photon Dicke Model

Pradip Laha, Kingshuk Adhikary, Subhashish Banerjee, Peter van Loock

2611.26523 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Collective two-photon light--matter interactions enable pair amplification but can destroy spectral confinement, preventing a stable thermodynamic bright phase. We show that a positive Kac-scaled number-Kerr interaction renders the two-photon Dicke Hamiltonian of \(N\) emitters lower-bounded at all couplings while preserving its generalized \(\mathbb Z_4\) symmetry. We determine the exact zero-temperature thermodynamic energy density with \(O(N^{-1})\) finite-size control and obtain the global phase diagram. A bright minimum is born at a saddle-node and exchanges global stability with the normal minimum at coexistence, producing a discontinuous photon-density jump. Symmetry-resolved exact diagonalization through \(N=128\) supports the predicted density jump and an exponentially closing same-sector normal--bright tunneling gap. Spectral collapse thus becomes the singular zero-Kerr point of a first-order phase diagram, identifying a Hamiltonian route to stabilizing pair amplification.

When the Noise Gets Noisy: Quantum Error Correction with Disordered Noise and Misinformed Decoding

Cory T. Aitchison, Lucas H. English, Benjamin Béri, Dominic J. Williamson, Campbell K. McLauchlan

2611.26506 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Experimental demonstrations of quantum error correction often exhibit noise that varies across space and time, and attempting to characterize this disorder has been shown to substantially improve decoding performance. However, theoretical studies of quantum error correction typically assume fixed, perfectly known, homogeneous noise. Here we model decoding with incomplete or inaccurate knowledge of disordered noise channels by treating physical error rates as random variables. We show that the decoding performance is set by a small number of information-theoretic functionals of the noise distribution: the entropy determines the threshold while Bhattacharyya coefficients bound the deep sub-threshold decay rate of logical failures. Furthermore, our results give a quantitative measure of the benefits of characterizing this noise. We numerically investigate both maximum-likelihood and minimum-weight-error decoding of surface codes, showing good agreement with theory across the code-capacity, phenomenological, and circuit-level noise settings, including with noise distributions seen in open-access superconducting devices. When it comes to error correction in realistic settings, reporting the average entropy and Bhattacharyya coefficient of noise distributions could therefore be more informative than the mean or median error rates of a device's components.

Optimal Error corrected Hamiltonian estimation with nuisance parameters

Zhiyao Hu, Haidong Yuan, Liang Jiang, Zain H. Saleem

2611.26497 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Realistic quantum sensing is often affected by both noise and unknown nuisance parameters. Under Markovian dynamics, existing error correction approaches have often sought to suppress nuisance responses alongside environmental noise. Here we show that this local suppression of nuisance parameters is unnecessary and can be overly restrictive: nuisance parameters and Markovian noise impose fundamentally different constraints and require distinct treatments. We establish a general framework for quantum sensing with parameters encoded in a general time dependent Hamiltonian, in the presence of both nuisance parameters and Markovian noise. We derive a necessary and sufficient condition for Heisenberg scaling, determine the exact optimal precision, and construct protocols that attain it. Our results show that to achieve Heisenberg scaling Markovian noise must be suppressed locally by quantum error correction, whereas nuisance parameters need not, and in general should not, be eliminated locally. Instead, optimally designed coherent control can separate their accumulated effects from the target signal over the full sensing evolution. Consequently, Heisenberg scaling can remain attainable even when the target signal is instantaneously aligned with nuisance parameter directions, in sharp contrast to alignment with Markovian noise. This distinction substantially enlarges the regime in which Heisenberg scaling is attainable and provides a general principle for designing robust quantum sensors.

Scaling classical hardware for accurate real-time quantum error correction

Chenyang Jin, Susanne F. Yelin, Andi Gu

2611.26447 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Fault-tolerant quantum computation requires a classical decoder fast enough to process syndrome measurements at the rate at which they are generated, and to return its decisions with low latency. This is most demanding for superconducting processors, whose fast syndrome cycles force a trade-off between decoding speed and accuracy. Decoders fast enough to keep up sacrifice accuracy, which must be compensated for with larger codes and thus additional physical qubits. Here we introduce Rapids, a streaming neural decoder that is both fast and accurate. We achieve this by co-designing the decoder with a field-programmable gate array (FPGA): the network is built from operations that map cheaply onto the device and trained in its integer arithmetic. For the distance-19 surface code, Rapids decodes each round of syndromes in under a microsecond on a single FPGA, fast enough for superconducting processors, and returns its decisions with the low latency that fault-tolerant algorithms require. Its logical error rate is 240 times lower than that of existing real-time hardware decoders. The same design extends to the color code and the [[144,12,12]] bivariate-bicycle code, on which our decoder is 16 times more accurate than the real-time Relay decoder. We further show that the decoder scales: spread over several FPGAs or hardened into custom silicon, it becomes faster, more accurate, or able to decode larger codes. Classical hardware thus becomes a further resource, alongside qubits, that can be scaled to improve fault-tolerant quantum computers.

When lies look like noise: certifying untrusted entanglement swapping

Maria Gragera Garces, Chris Heunen, Mahesh K. Marina

2611.26436 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entanglement swapping lets quantum repeaters distribute entanglement over long distances, a prerequisite for the quantum internet. We study its security in a noisy network whose intermediate nodes perform the quantum operations faithfully but may misreport the classical outcome that end users rely on. We show that the ideal functionality of entanglement swapping cannot be realised, because it gives the adversary no influence over the delivered state, whereas a node that relabels its report does have such influence. Including honest noise in the ideal setting does not help unless it also concedes a bounded fraction of misreported pairs. We therefore propose a cut-and-choose protocol that tests a random subset of pairs to certify the rest. Since no test can distinguish a misreport from readout noise, the protocol certifies the error above a pre-agreed minimum noise level, which is the misreport rate under our threat model. This yields a quality-of-service guarantee, in which a failure witnesses that the node did not deliver as agreed. Unlike verification schemes that consume the state they certify, the untested pairs remain available for use, with a finite-size guarantee. Certifying a 1% misreport rate on 10^6 pairs costs 10^4 to 1.7x10^5 test pairs, for minimum noise levels ranging from 0 to 5%. The main cost is memory, since 1% requires holding 10^5 to 10^6 pairs at once, far beyond the capacity of today's quantum memories. Verifying and releasing in blocks ties the memory to the block size at the cost of a weaker rate: a (10^4)-qubit memory certifies 14% on 4.7x10^5 delivered pairs.

Tunable Ground-State Entanglement in Fully Connected Quantum Systems: From Logarithmic to Volume-Law Scaling

Donghoon Kim, Tomotaka Kuwahara

2611.26430 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entanglement scaling is a central probe of the complexity of quantum many-body ground states, yet once geometric locality is absent, it can depend sensitively on the structure and normalization of interactions. For fully connected Hamiltonians with the natural Kac normalization, nondegenerate gapped ground states are known to obey a logarithmic entanglement bound. Here we ask how the ground-state entanglement changes when this interaction normalization is continuously relaxed away from the Kac scale. We answer this question by constructing an explicit all-to-all bipartite Hamiltonian of $n$ qubits with Fourier pairing amplitudes and pairwise interaction strength proportional to $n^{-κ}$. For sufficiently small fixed coupling, we prove that every pure ground state has entanglement entropy $Θ(n^{2-2κ} \log n)$ for $1/2<κ\leq1$ and $Θ(n)$ at $κ=1/2$. We further show that the ground state is unique and separated from the rest of the spectrum by a system-size-independent gap for $3/4 \leq κ\leq 1$, while weak-coupling analysis and numerical calculations suggest that the gap remains open also for $1/2 \leq κ< 3/4$. Thus, varying only the interaction normalization yields a controlled hierarchy from logarithmic scaling at the natural Kac normalization $κ=1$ to increasingly strong subextensive entanglement and ultimately to a volume law, showing that even an arbitrarily weak relaxation of this normalization precludes a universal logarithmic entanglement bound.

Non-Binary Detector Error Models

Stefano Tinelli, Francisco Lázaro, Francisco García Herrero

2611.26395 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

A key challenge in fault-tolerant quantum error correction (QEC) is that the syndrome extraction circuits are themselves faulty. Such circuit-level noise is commonly described by a detector error model (DEM). In Stim and in almost all related works, DEMs are binary: every non-binary circuit error (e.g., CNOT gate), is decomposed into independent binary error mechanisms. In this work, we introduce non-binary DEMs, in which each fault location of the syndrome extraction circuit is modeled by one random variable over its original alphabet, e.g., the 16 two-qubit Pauli errors after a CNOT gate. We also propose a split-merge-regroup transformation that builds a compact non-binary DEM from any Clifford circuit by merging the error components that flip the same detectors and observables. Non-binary DEMs represent any Pauli channel exactly, whereas binary DEMs are exact only for channels that factorize into independent binary parts. When the channels factorize, we prove that binary and non-binary DEMs are equivalent under degenerate quantum maximum-a-posteriori (MAP) decoding, but not under quantum MAP decoding. Although the variables are non-binary, belief propagation (BP) still exchanges a single scalar message per edge. Our numerical results with surface, color and bivariate bicycle codes show that non-binary DEMs have two main advantages. First, their Tanner graphs have four to five times fewer edges, which is advantageous for hardware implementations. Second, their performance under BP, with and without OSD post-processing, is better than that of their binary counterparts, and BP with OSD runs up to $9.4\times$ faster in a CPU.

Efficient Classical Algorithms for Ground Energy Estimation of Fermions with Conjugate-Pair Orbital Interactions

Ziyi Yang, Yexin Zhang, Yuexin Su, Xinzhao Wang, Xiaoyang Wang, Tongyang Li

2611.26382 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Estimating the ground energy of interacting fermions is central to quantum many-body physics, and recent quantum algorithms provide polynomial-time guarantees for some structured families. Classical approaches commonly rely on quantum Monte Carlo, where the sign problem is a major obstacle. However, even when a nonnegative expansion without sign problem is available, rigorous guarantees for rapid mixing are still far from well understood. In this paper, we give an efficient classical randomized algorithm for approximating the ground energy of fermionic Hamiltonians with conjugate hopping matrices and conjugate-paired orbital interactions, which includes the attractive Hubbard models. This guarantee not only holds without a physical spectral gap or a weak-coupling assumption, but also covers interactions beyond onsite density attractions. Technically, we first reduce ground-energy estimation to partition-function estimation and then use a discretization with controlled energy error to obtain a nonnegative weighted sum of squared determinant moduli and then apply the Chen--Liu log-concave counting theorem. In addition, we obtain a sharper arithmetic bound by controlling how many independent sampling runs and matrix updates are needed, and using sparse matrices to reduce the cost of each update.

Imaginary-Time Density Correlations Encode Quantum Entropy and Free Energy

Sagi Meir

2611.26381 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

In the classical limit, maximum-entropy inference yields an estimate of the excess entropy from the static structure factor through a single momentum sum. Quantum mechanically this estimate fails, because interactions also change the kinetic energy, while delocalization and exchange add information that equal-time correlations do not contain. We show that imaginary-time density correlations contain this information, and that with them the classical relation carries over to quantum systems. Such correlations are available from path-integral simulations and X-ray Thomson scattering. Relative-entropy inference over imaginary-time paths, with an ideal Bose or Fermi gas as reference, gives closed forms for the excess entropy and free energies, within the same Gaussian approximation as the classical relation. They recover the classical result and estimate entropy that the classical relation misses. We test them on weakly interacting bosons, interacting fermions on a ring, and the warm dense electron gas. The closed forms need only imaginary-time density correlations and their ideal-gas reference at a single state point, without using the interaction potential. Our approach can extend other classical entropy estimators to quantum systems.

Effect of coupling asymmetry on the spontaneous decay and entanglement of two atoms in a common cavity

Yamen Hamdouni

2611.26373 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate the dynamics and the spontaneous decay of two identical two-level atoms into the vacuum in a cavity at low temperature. We analytically derive the survival probability and the amplitudes of the state of the system by calculating the exact self-energy when the atoms are both initially excited. It is found that moderate asymmetry enhances the decay of the survival probability and increases the entanglement production in either lossless and lossy cavities.

Quantum Zeno Effect with a Superposed Measurement Schedule in Relational Time

Olivia Seidel, Chiara Marletto, Jonathan Asaadi, Sara Sussman, Sayan Biswas, Vlatko Vedral

2611.26371 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Motivated by the Page-Wootters construction in which time is a quantum clock reading and the global system state is stationary, we propose a quantum circuit that explores the observable consequences of treating measurement timing as a quantum degree of freedom. We place two Zeno measurement schedules of a driven qubit in a coherent superposition using a schedule qubit. We show that, for a fixed drive strength, the interference visibility between the two schedules depends only on the time offset between them, not on the number of intermediate measurements taken. Then we show that, for one schedule-readout outcome, the Zeno trend reverses, predicting a result that complements the standard Zeno probability. We propose a circuit implementation with physical memory qubits and show that measuring the memory register's joint $X$-basis parity distinguishes a coherent schedule from a classical or dephased one. We give the gate count and an error budget for a superconducting-qubit implementation. The Page-Wootters picture motivates this protocol and provides an equivalent stationary representation, although the predictions follow from the standard circuit description without requiring a relational-time interpretation. This is consistent with the Page-Wootters framework recovering standard quantum dynamics through correlations between a clock and the rest of the system.

Entanglement, records, and quantum recovery in qubit chains

Sugumi Kanno, Jiro Soda

2611.26368 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate entanglement, readable records and quantum recovery using an exactly solvable chain of sequentially interacting qubits. For weak interactions, entanglement reaches a later environment site before that site carries an equally strong local record. The leading local record is encoded in an off-diagonal element of the reduced density matrix and can be detected by a Pauli measurement, while a population measurement gives a higher-order signal. We further characterize the accessibility of the relative phase through joint transverse correlations and derive the optimal fidelity for recovering an unknown quantum state from the system and an accessible environment fragment. We show that interactions acting only within the environment can redistribute readable records and change the region required for quantum recovery without affecting the reduced state of the system.

Quantum Autoencoder on Real Hardware for New Physics Searches at Muon Colliders

Shuai Zhang, Ji-Chong Yang

2611.26364 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

We apply a quantum autoencoder to search for new physics (NP) in the tri-photon process $μ^+μ^-\toγγγ$ at muon colliders. Using a six-qubit circuit on the Tianyan176 quantum computer, we measure the reconstruction losses for Standard Model (SM) events and anomalous quartic gauge couplings (aQGCs) events. The results demonstrate that the hardware-implemented quantum autoencoder effectively discriminates NP signals from the SM background. Concurrently, we derive the expected constraints on the aQGCs coefficients and compare them with those obtained from conventional methods.

Quantifying the irrealism required by quantum random access codes

Pedro R. Dieguez

2611.26340 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

How far must decoding observables be from having elements of reality to achieve a given quantum advantage in a communication task? We answer this question for quantum random access codes. Here, an observable has an element of reality when its unrevealed measurement leaves the preparation undisturbed; its irrealism is the relative entropy to the closest such preparation. Because it comprises local coherence and the correlations destroyed by the unrevealed measurement, irrealism applies to prepare-and-measure (PM) and entanglement-assisted (EA) codes alike. For PM codes decoded in mutually unbiased bases, we obtain the irrealism frontier, the least total irrealism compatible with each success probability, exactly in every dimension; an excess-irrealism identity shows that Gibbs states of the decoding operator attain it uniquely. For PM codes minimized also over the decoders, the required irrealism vanishes up to the classical value and is positive beyond it; for qubits, mutually unbiased decoders are not the cheapest below a success probability of 0.833. For EA codes with a qubit receiver, trusted decoders, and parity-dependent sender settings, the frontier exceeds the PM one by the realism-based nonlocality of the contexts used by an optimal code, and with rank-one projective sender measurements a success probability above 0.815 certifies a minimum realism-based nonlocality of the shared state.

Stitching Quantum Codes into Quilts: Universal Logic with no Ancillary Qubits

Stasiu Wolanski

2611.26329 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Proposals abound for performing fault-tolerant logical Pauli-product measurements between quantum codes beyond the surface code. We introduce a new construction, the code quilt, whereby a target joint logical operator of two or more codeblocks is directly measured without the use of an ancillary system. We construct explicit circuits to perform a logical measurement using the quilt construction, which also require no physical qubits beyond the ancillas already in place to perform idle syndrome extraction on the codeblocks in question. We give a detailed structural analysis of the construction, which is based on a subsystem code, and provide several sets of sufficient conditions under which the relevant code-capacity distance is preserved. We give two variants of the protocol. The first, where the gauge generators of the subsystem code are measured directly, is provably not fault tolerant in the large-distance limit but admits a particularly practical circuit implementation in which the physical qubit degree increases by at most two. The second has more favourable asymptotic properties, although we do not prove its fault tolerance in the general case. We then perform an extensive empirical analysis of the technique, in particular of the first variant, as applied to bivariate bicycle and surface codes, finding code-capacity-distance preserving quilts for measuring 25,000 randomly selected logical operators. We optimise to find sparse and decongested detector bases for each and, for a randomly selected subset, find circuits that we estimate to be distance preserving. Finally, we perform decoding experiments on a subset of these circuits and find that their logical error probability is comparable to that of idle memory for operations involving the 144-qubit bivariate bicycle code and distance-12 rotated surface code at physical error rates between $1.5\times 10^{-3}$ and $3\times 10^{-3}$.

All Non-Contextual Pauli Hamiltonians are Free-Fermion in Disguise

Andrew M. Projansky, Weishi Wang, Kevin A. Reiss, James D. Whitfield

2611.26315 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Decomposing Hamiltonians into classically tractable fragments is central to quantum simulation. One such way of doing so is the contextual subspace decomposition, which expresses the Hamiltonian with respect to non-contextual sets of Paulis. The conditions for contextuality rely on the anticommutation and commutation of Pauli operators; it is therefore natural to make an explicit connection between non-contextuality and fermionic physics. Theoretical work is centered around two theorems: in the first, we consider non-contextual Pauli Hamiltonians and show that they are free-fermion-disguised. In the second we write these Pauli non-contextual Hamiltonians in terms of Majorana and Dirac fermionic operators, showing that they carry a Jordan--Wigner-like fermion-to-qubit encoding. These two central theorems are formalized in the proof assistant language Lean. We use this to describe the space of fermionic non-contextual Hamiltonians, and highlight their relation to the more general class of free-fermion-disguised Hamiltonians. We further develop a heuristic algorithm to find line-graph based free-fermion fragments and their connected components of molecular Hamiltonians. We benchmark our algorithms against non-contextual searches for encoded molecular Hamiltonians and find comparable performance in identifying free-fermion solvable components. Our work has implications for what fragments to consider as useful for quantum simulation.

A Tensor-Algebraic No-Go Theorem for High-Dimensional Photonic Greenberger--Horne--Zeilinger States Discovered with AlphaProof Nexus

Mario Krenn, Moritz Firsching, George Tsoukalas, Rishikesh Gajjala, Xuemei Gu, Swarat Chaudhuri

2611.26300 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Photonic GHZ states generated with probabilistic pair sources can be described by edge-coloured, complex-weighted graphs. In this representation, conditioning on an event with one photon in every detector turns the output amplitudes into coherent sums over perfect matchings, and generating an \(N\)-photon \(D\)-dimensional GHZ state is equivalent to constructing a monochromatic quantum graph. Here, we prove that no complex-weighted monochromatic quantum graph exists for any even \(N\ge4\) when \(D\ge N\). The proof, discovered through AI-assisted formal proof search in Lean using AlphaProof Nexus, constructs a weighted sum \(\mathcal F\) of amplitudes whose coefficients factor vertex by vertex. Summing over the colours at one fixed vertex reduces the problem to an \((N-1)\times N\) matrix of effective edge weights. For the graph amplitudes \(ω\) and GHZ target \(Δ\), the row--column imbalance yields \(\mathcal F(ω)=0\) but \(\mathcal F(Δ)\neq0\), contradicting the required equality \(ω=Δ\). Finally, we give a physical interpretation of the AI-discovered mathematical proof.

Fast extraction of universal data from temporal spectrum: Applications to Haagerup CFT and monopole scattering

Tokiro Numasawa, Boris De Vos, Masataka Watanabe, Atsushi Ueda

2611.26257 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Extracting precise universal data on conformal field theory (CFT) on the lattice traditionally requires large-scale simulations of the ground states and excitations of critical systems. Here, we propose an alternative accurate and fast algorithm, where we read off the CFT spectrum from the transfer matrix spectrum of an infinite matrix product state after a short imaginary-time evolution. We apply this method to extract the charge-resolved spectrum of a Haagerup CFT to higher levels and obtain a central charge $c = 2.137(27)$. Moreover, we show that the Maldacena--Ludwig monopole boundary can be realized as the ground state of the Fidkowski--Kitaev Hamiltonian after space-time rotation.

Efficient calculation of the full Laguerre-Gaussian spectrum of entangled biphotons

Jiabao Peng, Richard Bernecker, Stephan Fritzsche

2611.26251 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

The spatial biphoton state generated by spontaneous parametric down-conversion (SPDC) enables applications in high-dimensional quantum information processing and is often described in Laguerre-Gaussian (LG) modes. However, calculating the full LG spectrum for arbitrary radial and orbital angular momentum (OAM) indices requires computationally demanding multidimensional integrations. We present a generating-function approach that analytically performs the four-dimensional transverse spatial integral without approximating the phase-matching function. The source geometry can be completely described by a few dimensionless parameters, which reduce to two parameters for wave-vector-degenerate photons with equal waists. Our derived expressions for the full LG spectrum allow for computationally efficient and numerically stable evaluation at high mode orders, addressing a crucial obstacle in previous works. To illustrate our approach, we compare OAM spectra obtained by projection onto the lowest radial order and by radially insensitive detection, and investigate how high-dimensional maximal entanglement can be approached by tuning source parameters. Our results provide a new analytical tool for efficiently characterizing and engineering high-dimensional spatial entanglement in SPDC.

Adaptive Hamiltonian Identification via Quantum Reinforcement Learning under Non-Stationary Dynamics

Jawaher Kaldari, Saif Al-Kuwari

2611.26241 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Accurate identification of the Hamiltonian governing a quantum system is important for quantum-system characterization, device calibration, simulation, and reliable operation of quantum hardware. In practical systems, however, the governing dynamics may vary over time because of parameter drift, changing control conditions, or transitions between operating regimes. In this work, we formulate Hamiltonian identification as a quantum reinforcement learning (QRL) problem in which a quantum agent processes sequential quantum-state observations and estimates the governing Hamiltonian parameters. We first consider stationary dynamics using a Vanilla-QRL agent and then introduce a recurrent GRU-QRL architecture to track non-stationary dynamics. The framework is evaluated on transverse-field Ising model systems under stationary dynamics, abrupt Hamiltonian switching, rapidly changing Hamiltonians, random switch locations over longer trajectories, and gradual Hamiltonian drift. We further compare the proposed approach with a Quantum Graph Recurrent Neural Network (QGRNN) baseline and evaluate frozen policies on unseen trajectories. Results show that both approaches accurately reconstruct stationary Hamiltonians, while GRU-QRL provides substantially improved tracking under non-stationary dynamics. These results demonstrate the potential of recurrent QRL as an adaptive system-identification tool for monitoring time-varying quantum systems.

A sensitivity-constrained polynomial method for DQC1 query complexity

Changpeng Shao

2611.26231 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

The polynomial method is one of the fundamental techniques for proving lower bounds on quantum query complexity, particularly in the BQP query model. In this work, we develop an analogue of the polynomial method for the DQC1 query model. We introduce the notion of {\em sensitivity approximate degree} for Boolean functions and show that it provides a lower bound on DQC1 query complexity. We establish several basic structural properties of this new measure. As a first result, we show that every nonconstant total Boolean function on $N$ input variables has sensitivity approximate degree $Ω(N)$, and hence requires $Ω(N)$ queries in the DQC1 model. Thus, unlike in the BQP query model, DQC1 admits no asymptotic query speedup for total Boolean functions. For symmetric partial Boolean functions, we give a complete characterization of the sensitivity approximate degree in terms of the separation between oppositely labeled Hamming weight layers. This yields a tight quadratic separation between sensitivity approximate degree and standard approximate degree, and also leads to tight quadratic separations between DQC1 and BQP query complexities. We further establish quantitative average-case classical simulation theorems for DQC1 algorithms. Finally, we apply our framework to Fourier analysis, obtaining a simple proof of an $Ω(N^{1/4})$ DQC1 query lower bound for the 2-Forrelation problem.

CAVQS: Context-Aware Variational Quantum Circuit Synthesis via Unitary Redistribution and Dynamic Reconstruction

Zhilong Liu, Xiangzhen Zhou, Yunqi Huang, Xin Hong, Pengcheng Zhu, Fanxu Meng, Zhenlong Du

2611.26219 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Variational quantum circuit synthesis jointly searches circuit structure and continuous parameters to reduce costly two-qubit gates, but block-based workflows typically instantiate blocks independently, limiting simplification across block boundaries. Moreover, fully unitary synthesis does not exploit opportunities created by permitted output measurements and classical feedforward. We present CAVQS, a context-aware variational synthesis framework that combines unitary redistribution and dynamic reconstruction. First, CAVQS uses QR decomposition to transfer unitary factors between overlapping blocks, preserving the overall transformation while reshaping local synthesis targets to enable cross-block reductions. Second, for blocks that precede permitted terminal measurements, CAVQS constructs ancilla-free dynamic implementations with a CNOT-budgeted pre-measurement search and analytic branch-unitary construction, thereby minimizing expected CNOT cost. Across random-circuit targets, CAVQS reduces mean two-qubit gate counts by 28.79%-42.52%, 2.05%-52.62%, and 30.51%-74.64% relative to QFAST, SQUANDER, and Fast-USYN, respectively, on common successful instances. On 4--6-qubit quantum algorithm benchmarks, the corresponding reductions are 27.27%-36.77%, 20.65%-69.10%, and 36.31%-71.88%, respectively.

To predict or to persist: how decoherence shapes learning in a spin-qubit quantum reservoir

Nikolaos Petropoulos, Elena Blokhina

2611.26215 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

In this work we investigate how dephasing and the choice of measured observables affect learning in a simulated six-qubit spin chain with Markovian dissipation and exact expectation-value readout. For externally driven nonlinear autoregressive moving-average signals, combining single- and two-qubit observables gives better predictions than a population-only readout at comparable polynomial feature counts. Most of the configurations we tested become more accurate than a reference with relaxation and dephasing disabled, most strongly at $T_2=1\,μ$s, where total memory capacity drops, and still at $T_2=5$-$10\,μ$s, where memory is only redistributed across delays. For autonomous generation, we train the readout with scheduled sampling and iterative dataset aggregation to expose it to states reached under its own feedback. We do not find a clear systematic dependence of limit-cycle persistence on coherence across the reservoir ensemble. For chaotic forecasting, in contrast, prediction horizons at $T_2=1\,μ$s shorten in all 10 reservoir realizations relative to that reference. For the noise-driven strange non-chaotic attractor, the model produces a smooth, approximately closed orbit, and neither captures the target's scatter nor follows its trajectory pointwise. We conclude that, within this simulated reservoir, the impact of coherence depends strongly on the task.

Cooperativity-enhanced single-photon emission in a topological quantum emitter chain

Jonathan Sturm, Irene Burghardt, Bert Hecht, Adriana Pálffy

2611.26214 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Single-photon emitters are one of the key elements in state-of-the art quantum technologies, yet optimizing and manipulating their emission requires precise fabrication of the emitter systems themselves. Here, we propose a route to tailored single-photon emission by exploiting cooperative effects in a topological single-photon emitter chain. Although the involvement of multiple emitters normally suppresses single-photon emission, we show that localized topological edge modes restore single-photon emission and protect against local perturbations. At the same time, cooperative effects occur due to the collective nature of the edge modes, leading to directional emission and linewidth narrowing. Our findings open new possibilities for tailoring single-photon emission by combining cooperativity and topological effects.

Improving the signal-to-noise ratio through postselection of coincident detections in anticounterfeiting and quantum key distribution

Paula Wieteska-Bajak, Mohamed Hatifi, Renaud Mathevet, Vincent Lacombe, Jerome Wenger, Thomas Durt

2611.26210 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

In quantum communications and other photon-counting applications, reliably detecting weak optical signals against a strong noise background remains a fundamental challenge. In this paper, we develop a simple idea: when a signal is carried by pairs (or more generally multiplets) of photons emitted simultaneously, postselection of coincident detections recorded on two detectors makes it possible to improve-sometimes drastically-the Signal to Noise Ratio. Essentially, this is made possible by the fact that genuine and accidental coincidences scale differently with the width of the postselection window. As long as the window remains wide enough to retain detections from the same pair, the genuine coincidence rate is approximately unchanged. In contrast, coincidences formed from independent clicks decrease linearly as the window is narrowed. The resulting signal-to-noise ratio, therefore, increases inversely with the window width. Our approach makes it possible to reveal photon-pair signals that are otherwise hidden beneath a much stronger uncorrelated background. We analyze here applications of this idea to quantum key distribution, metrology, and anti-counterfeiting.

The role of complementarity and quantum correlation in the uncertainty relations and the optimum states

Sttiwuer Díaz-Solórzano, Goosline Alfredo Pereira Narváez

2611.26198 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Uncertainty relations are used in quantum mechanics to illustrate the complementarity of two observables, assuming there is a lower bound for the product of their dispersions that depends on the first-order quantum correlation and the commutation relation of those observables in an optimum state. In this work, we demonstrate that the complex parameter of the optimum state equation has real and imaginary parts that depend on the first-order quantum correlation and the commutation relation between the observables in the optimum state, respectively. We apply our results to a two-level system, finding that the first-order quantum correlation and the commutation relation of two spin-1/2 projections in the optimum state complement each other and, finally, when the term correlation is used, a lower bound for the uncertainty principle does not depend on any parameter of the optimum state, in contrast to the usual form of the Heisenberg principle.

Ellis: Extremely Fast Quantum Circuit Simulation under Qubit Loss and Leakage

Yuewen Hou, Gokul Subramanian Ravi

2611.26173 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Qubit loss and leakage are persistent errors: while a qubit remains lost or leaked, every operation acting on it is dropped. Consequently, the Clifford circuit executed differs from shot to shot. This variation breaks Pauli-frame simulation, which constructs each shot by XORing sampled Pauli flips onto a single \emph{common reference} measurement record. By rethinking the roles of tableau simulation and Pauli-frame simulation, we show that many key fault-tolerant primitives nevertheless retain a common reference under loss. These include CSS code memory, lattice surgery, and transversal CNOT. Such circuits can therefore be simulated exactly under Pauli noise and loss by a Pauli frame with per-shot masks for the dropped operations. We define \emph{frame-CSS} circuits as those that are CSS up to local single-qubit basis changes, given a loss model that specifies where qubits can be lost and reloaded. We prove that every frame-CSS circuit has a common reference, and we give a practically near-linear-time procedure that certifies whether a circuit is frame-CSS. We implement the certifier and a high-performance simulator in the open-source package \href{https://github.com/isaachyw/ELLIS}{\textsc{Ellis}} (Efficient Loss and Leakage Invariant-reference Simulation). On the gross code under qubit loss and Pauli errors, \ellis{} samples 952{,}000 shots per second on a single CPU core, at least $1000\times$ faster than Clifft~\cite{chase2026} and PPVM~\cite{luo2026ppvm}.

A receiver-side approach to confirm phase randomization in BB84 time-bin QKD with weak coherent pulses

Bedir Halcı, Rainer Kaltenbaek

2611.26147 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

In quantum cryptography using time-bin BB84 protocols, the relative phase of symbol pulses has to be random to avoid vulnerability to coherent attacks. Typically this phase randomization is checked on the sender side. Here, we propose a protocol for monitoring and confirming phase randomization independently on the receiver side during operation. The proposed method can be implemented on the single-photon level without the need for any physical adaptation of the receiver. This can provide an additional tool for monitoring against possible eavesdropping attempts that affect the phase randomization.

Local-channel inequivalence within analytic symmetry-broken phases

Guanxi Xun, Rintaro Masaoka, Weiguang Cao, Haruki Watanabe

2611.26139 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Gibbs states at different temperatures can be inequivalent under two-way quasi-local channels even within a single phase with spontaneously broken continuous symmetry and analytic free energy. We prove this for the symmetry-invariant Gibbs states of a canonical ideal Bose gas at fixed density and a classical vortex-free Villain model on hypercubic lattices in $d\ge3$ dimensions. At lower temperatures, two distant observers can estimate the shared direction of order more accurately. The maximum mutual information they can obtain by separate measurements grows logarithmically with the radius of their regions. The leading term is the same throughout each ordered phase, while the constant term $\mathcal{C}(T)=\tfrac12\ln[Υ(T)/T]+c_{\mathrm{geom}}$ is strictly larger at lower temperatures. Here $Υ(T)$ is the phase stiffness and $c_{\mathrm{geom}}$ depends only on the region geometry. A quasi-local channel cannot increase this constant, so it is invariant under two-way conversion. Cooling would increase it and is therefore impossible between any two distinct temperatures in the ordered phase. On finite lattices, cooling with vanishing error requires a circuit whose causal radius grows at least linearly with the lattice side length. We also obtain the invariant for quantum and multicomponent Villain models and conjecture a stiffness formula for more general patterns of continuous symmetry breaking.

The classical complexity of quantum state transmission

Elna Svegborn, Alexander Bernal, Armin Tavakoli

2611.26126 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum communication provides a natural means to transmit quantum information, but how difficult is it to make such a transmission using only classical communication resources? We address this question by introducing classical communication models for quantum preparations and defining their minimum cost as the classical complexity. We prove that this complexity equals the amount of classical communication required to simulate quantum correlations in prepare-and-broadcast experiments, thus establishing a resource equivalence between quantum state transmission and quantum correlations. This calls for a general characterisation of the classical complexity of the noisy quantum state space, which we show grows exponentially with the quantum dimension and as a power-law in the inverse noise. It reveals the rapidly scaling fundamental cost of classical simulation. Moreover, we develop a toolbox of methods to certify classical complexity in quantum preparation devices, including an exact semidefinite-programming characterisation, analytical witnesses for symmetric preparations and convex programming scalable up to hundreds and sometimes thousands of qubit states. Our results establish classical complexity as a fundamental measure of quantum communication advantage, revealing the intrinsic cost of classically simulating quantum theory and providing practical tools for its certification.

Genuinely Out-of-Equilibrium Bose-Einstein Condensation

Tatsuhiko N. Ikeda, Masahito Ueda

2611.26123 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Bose-Einstein (BE) condensation typically occurs in the ground state. Prominent exceptions include excitons, whose ground state is the vacuum; consequently, they undergo BE condensation only in out-of-equilibrium regimes to counteract rapid decay. Here, we develop a driven-dissipative framework to address this challenge, demonstrating that BE condensates emerge under sufficiently strong excitation in one and two dimensions. In three dimensions, by incorporating effective loss rates and a specified injection energy, we find a percent-level condensate fraction, consistent in order of magnitude with the exciton experiment of Morita et al. (Nat. Commun. 13, 5388 (2022)).

Finite-Key Analysis for Multiple-Antenna Quantum Key Distribution with Continuous Variables

Masoud Ghalaii, Ahmed Q. Lawey, Mohsen Razavi

2611.26066 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Multiple-input multiple-output (MIMO) techniques, known for their use in wireless communications, can also find applications in quantum communications systems. This is, for instance, relevant to satellite-based quantum communications when atmospheric turbulence and the time-varying nature of the channel can make their implementation difficult. Here, we study the application of MIMO techniques to continuous-variable (CV) quantum key distribution (QKD) in the realistic setting where a finite number of signals are exchanged. We show how data collected during the brief overpass time of low-earth-orbit satellites over ground stations can be processed to estimate MIMO channel parameters, extract a secret key, and quantify the key generation rate. For $2\times 2$ MIMO settings with Gaussian encoding and heterodyne detection, our finite-key analysis indicates that MIMO CV-QKD could outperform both multiplexed (with a nominal 3~dB improvement) and single-mode (with a nominal 6~dB nominal improvement) scenarios. Furthermore, we conjecture that the ultimate enhancement of a multiple-antenna CV-QKD system can be characterized by the product of the number of its inputs and outputs.

The influence of quantum scarring on the onset of Bohmian chaos

Athanasios C. Tzemos, George Contopoulos

2611.26006 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

In the present work we investigate how the stable and unstable periodic orbits of a perturbed two-dimensional oscillator influence the Bohmian trajectories of the corresponding quantum system. In particular, we find that in our systems all Bohmian trajectories become chaotic in the long run and examine the times needed for them to approach their ergodic pattern. We show that these times are systematically shorter for orbits close to unstable periodic orbits than for orbits close to stable periodic orbits of the same period. We demonstrate that this behaviour is connected to scarring effects associated with both unstable and stable periodic orbits. We also investigate how the Bohmian dynamics changes when a stable periodic orbit undergoes a bifurcation and becomes unstable.

Flat bands and bound states in the continuum in non-Hermitian pseudospin lattices

X. Y. Chen, C. H. Zhang

2611.26005 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Flat bands support compact localized states (CLSs), whereas bound states in the continuum (BICs) remain spatially localized despite having energies embedded in the continuum of extended states. Here, we investigate the connection between these phenomena in a class of one-dimensional non-Hermitian lattices whose Bloch Hamiltonians take the pseudospin form H(k)=d(k)S. For integer pseudospin, the Hamiltonian intrinsically supports a zero-energy flat band and its associated compact localized states. When the effective pseudospin field has real transverse components and a purely imaginary longitudinal component, increasing non-Hermiticity compresses the dispersive bands toward the intrinsic zero-energy flat band, enabling their spectral overlap within a finite parameter range. The CLSs thus become embedded in the dispersive continuum and emerge as BICs. Adding a momentum-dependent Hermitian component along the gain-loss direction generally removes this spectral overlap without destroying the CLSs. We further extend this spectral mechanism to integer-pseudospin-n systems. These findings establish a connection between intrinsic flat-band localization and BIC formation through non-Hermitian spectral reconstruction.

A New Quantum Algorithm Framework for Integer Order Entropy Estimation

Zongxing Xiong

2611.25964 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entropy estimation for unknown distributions is a basic problem in statistical property estimation. In this paper, we propose a quantum algorithm framework for estimating Rényi entropy with fixed integer order $k\geq 2$. Given purified quantum query-access to a distribution on $n$ symbols, our algorithm estimates its order-$k$ Rényi entropy to within additive error $ε$ using $$\widetilde{\mathcal{O}}\left(\frac{n^{u_k}}{ε^{1-u_k}} + \frac{n^{(k-1)/(2k)}}ε\right)$$ queries, where $u_k=\max_{2\leq j\leq k} \frac{(3k-j)2^{j-2}-k}{k(2^j-1)}$. The main ingredient is a recursive construction of collision states in which intermediate states are retained and reused. We bound both the preparation and reflection costs, and choose the number of retained states at each order so that all recursive steps fit within a common query budget. We combine this construction with a sequence of decreasing probability thresholds, estimating the contribution of the labels found along the way separately from the remaining power sum. A batch estimator gives the required bound in the high-precision regime, and an initial search removes the need for prior knowledge of the power sum.

A Quantum Genetic Algorithm for Optimization of Benchmark Test Functions using Entangled Qutrits

Muhammad Farooq, Mehrosh Talat

2611.25941 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Typically, quantum genetic algorithms are based on qubits, a two-level quantum system. This work investigates the optimization of Rastrigin, Rosen-Brock and Table Holder Function in comparison with Classical Genetic Algorithm (CGA), using two quantum approaches: Quantum Genetic Algorithm (QGA), and Higher-Order Quantum Genetic Algorithm (HO-QGA) based on qutrits, a three-level system. HO-QGA uses higher-dimensional quantum representations, such as entangled qutrits, to test its capability of enhanced optimization. We show that the QGA convergence rate is higher than the CGA, and the solution quality is considerably improved. Based on this study, a three-state quantum object novelly provides more capabilities than qubits in terms of computational and information resources.

High-fidelity control of long-lived data qubits via a noisy mediator

Nguyen H. Le, Tikai Chang, Eran Ginossar, Michael Stern

2611.25887 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Long-lived qubits are attractive for storing quantum information, but they are often difficult to control or couple directly. A common strategy is to use mediator qubits to generate effective interactions for gate implementation. However, the mediator typically has a shorter coherence time than the data qubits, so mediator relaxation and dephasing are expected to limit the achievable gate fidelity. Here, we show that this limitation can be overcome. We present a reset-assisted control method that suppresses mediator-induced errors and enables high-fidelity single- and two-qubit gates on a quantum register of long-lived data qubits. Although mediator quantum jumps render the data-qubit evolution stochastic, repeated mediator reinitialization drives the resulting evolution paths toward the desired target operation. An analytical quantum-trajectory analysis reveals the physical mechanism of error suppression and provides compact fidelity formulas for adapting the method to different platforms. Our results relax the requirement for long mediator coherence, broadening the range of mediators that can support high-fidelity control.

Evolving Decoding Algorithms for Quantum Error Correction

Eduardo Dueñez, Edgar Said Hernandez Sanchez, Edgar A. Duéñez-Guzmán, Suzanne Sadedin

2611.25880 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum computation entails robustness engineering: a noisy quantum state is measured continuously, and a classical algorithm (the decoder) must infer corrections that reliably remove the noise, fast enough to keep up. We write several published belief-propagation (BP) decoders for quantum low-density parity-check (qLDPC) codes in a Domain-Specific Language (DSL), and search over it with grammatical evolution. Written in the language, the published decoders show their parameters in plain view, allowing us to re-parameterise BP+OSD (ordered statistics decoding) and BP+LSD (localized statistics decoding) decoders with damping, before any search, making each 17.1--41.0$\times$ faster at a higher error rate, and BP+OSD-0 about 103 faster than the ldpc package's version tuned on the [[72,12,6]] bivariate-bicycle code. Evolution over the language finds decoders that improve the time-error front. One makes 23% fewer logical errors than BP+OSD-0 with damping at 0.64$\times$ its time, and decoders evolved from random code are more accurate than ldpc's tuned BP+OSD-0 at 1/31 of its time or less. Frozen at one operating point, the two fastest evolved decoders generalize well across noise levels, code sizes and round counts, staying at the time-error front. Ultimately, we demonstrate that capturing expert knowledge within a DSL creates a powerful intermediate layer---one that effectively bridges human intuition and machine-driven optimization to unlock highly efficient quantum error correction.

Nonmagnetic Impurity Effects on Majorana Braiding Quantum Gates in Vortex Cores

Jiangwei Long, Zihui Liu, Yizhi Li, Lijun Meng

2611.25858 • Nov 19, 2026

QC: none Sensing: none Network: none
View Full Abstract

Using time-dependent many-body simulations, we investigate nonmagnetic impurity effects on vortex-core Majorana braiding. In the two-MZM $\sqrt{Z}$ gate, sufficiently strong attractive impurities suppress the topological gap $Δ_t$, reduce adiabaticity, and degrade the quantization of the geometric-phase difference; the repulsive impurities considered here cause no comparable damage despite stronger zero-energy nonequilibrium local density of states (LDOS) distortions. Slowing the braid or using a $2a_0$ detour restores near-quantization in the cases examined. In the four-MZM configuration, attractive impurities leave the low-energy spectrum nearly unchanged, whereas repulsive impurities mainly suppress the first excited state. Slower braiding substantially improves the $X$ gate success probability. A specific attractive-impurity pair yields near-unit success ($\approx 0.9985$), unlike two weak repulsive impurities. These findings clarify how nonmagnetic impurities affect the low-energy spectrum and adiabatic dynamics of vortex-core Majorana braiding and provide theoretical guidance for designing robust braiding protocols in realistic topological superconducting platforms.

Residual Allan Stability under Periodic Auxiliary Ramsey Sampling

Zhiqian Su

2611.24928 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

The timing of auxiliary Ramsey measurements can change the frequency stability associated with a drifting pulse shift at a fixed nominal Fisher-information rate for a constant shift. For periodic instantaneous observations of an Ornstein-Uhlenbeck shift with causal prediction between updates, we derive the exact residual covariance averaged over the update cycle and the corresponding Allan variance at arbitrary averaging times. Relative to a continuous Kalman reference at the same information rate, periodic estimation increases the cycle-averaged estimation-error variance, reduces the short-time residual Allan variance, and increases its long-time value. Its covariance decays more slowly at the origin and has a larger integral. We extend the result to instantaneous sensing of the sum of finitely many independent Ornstein-Uhlenbeck modes. Integrated observations preserve the short-time ordering for the scalar shift, and numerical calculations resolve the dependence of the crossover on window duration. A zero-order-hold comparison shows that the short-time ordering can change when the same estimator drives a different correction command. A three-level Ramsey model of coherent population trapping (CPT) maps the discriminator response to an effective information budget and illustrates how the dark times affect the choice of schedule.

A Nonsecular Quantum Master Equation with Detailed Balance and Second-order Error Bound

Ji-Hui Pei, Jin-Fu Chen

2611.24911 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

An effective theory of open quantum systems should preserve the detailed balance structure inherited from microscopic reversibility and remain accurate throughout relaxation. Meeting both requirements is particularly challenging in quantum many-body systems, where dense spectra can invalidate the secular approximation even at weak coupling. Here we construct a nonsecular quantum master equation that satisfies time-reversal Kubo-Martin-Schwinger (TR-KMS) detailed balance. Under suitable conditions, we prove a time-uniform $O(λ^2)$ bound on the difference between the predicted and exact reduced density matrices, where $λ$ is the system-bath coupling strength. Our construction completes the Redfield generator by imposing detailed balance while matching its dissipative and coherent coefficients at resonance. In this approach, TR-KMS detailed balance is compatible with resonance matching, whereas its counterpart without time reversal is not. In a benchmark against the exact microscopic dynamics of two coupled oscillators, our equation maintains $O(λ^2)$ accuracy across secular and nonsecular regimes, outperforming the existing detailed-balance equations tested. These results provide a systematic route from microscopic models to thermodynamically consistent descriptions of open quantum dynamics beyond the secular approximation.

Dressed-State Quantum Information Processing Using a Multilayer Ion Trap Chip with an Integrated Radio Frequency Resonator

Ivan A. Boldin, Elham Esteki, Bogdan Okhrimenko, Friederike Giebel, Konstantin Thronberens, Amado Bautista-Salvador, Christian Ospelkaus, Christof Wun...

2611.24910 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We present the experimental preparation of a radio frequency (RF)-dressed-state qubit, the coherent operation of a single RF-dressed qubit, and the selective readout of RF-dressed hyperfine states of $^{171}$Yb${^+}$ ions trapped using a novel microstructured ion trap chip. We demonstrate the individual addressing of RF-dressed-state qubits in a two-ion Coulomb crystal. To this end, we developed, manufactured, and characterized a trap chip specifcally designed for quantum information processing with RF-dressed-state qubits. The chip consists of multiple layers, one of which includes an integrated resonator that creates a gradient of the RF magnetic field amplitude along the axis of a linear ion crystal. This RF gradient enables the individual addressing of dressed qubit states as well as their coupling. We characterize the ion trap chip experimentally using the hyperfine states of the electronic ground state of laser cooled $^{171}$Yb${^+}$ ions and by applying a single, global, modulated RF field oscillating near 12.6 GHz that drives dressed-state resonances. We present a microfabricated multilayer ion trap chip specifically designed for quantum information processing based on dressed-state qubits. This ion trap chip consists of multiple layers, one of which includes an integrated radio frequency (RF) resonator, creating a gradient of the RF magnetic field amplitude that allows for individual qubit addressing and qubit-qubit coupling. We experimentally characterize this ion trap chip demonstrating dressed-qubit state preparation, coherent single dressed-qubit operation, and dressed-state-selective read-out using hyperfine states of the electronic ground state of $^{171}$Yb${^+}$. For this purpose, a global modulated RF driving field oscillating near 12.6 GHz is applied to the ions. In addition, we demonstrate individual addressing of dressed-state qubits in a two-ion Coulomb crystal.

Residual-Algebraic Design of Symmetry-Preserving Variational Quantum Circuits

Sahinur Reja

2611.24890 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Symmetry-preserving (SP) variational quantum circuits restrict evolution to physically relevant sectors of Hilbert space, but symmetry preservation alone does not guarantee accessibility within those sectors. We show that a restricted generator set can possess a residual dynamical Lie algebra whose commutant further decomposes the target symmetry sector into invariant blocks. The associated block populations are conserved and impose a kinematic upper bound on the fidelity with a target state. We then invert this diagnostic into a circuit-design principle: candidate SP generators can be screened before variational optimization by asking whether they break the residual commutant, which invariant blocks they couple, and what adjoint module they generate under the residual algebra. For two orthogonal residual blocks we prove that a single elementary real inter-block rotation generates the full orthogonal algebra. We further derive a complex escape criterion: if the real and imaginary parts of an inter-block seed are independent over the residual intertwiner algebra, the generated module is the full complex coupling space and the enlarged algebra becomes special unitary. A connected residual-block graph yields a natural multi-block generalization and suggests minimum-cost spanning-tree circuit design. We demonstrate this design principle in the XXZ and Hubbard models, where residual-algebra screening identifies SP circuit extensions that remove the relevant accessibility obstructions. These examples establish a unified route from residual-symmetry diagnosis and fidelity bounds to predictive quantum circuit design.

CREST: A Hardware-Aware GNN-Based Framework for High-Fidelity and Robust Superconducting Quantum Compilation

Wenjie Sun, Xiaoyu Li, Zhigang Wang, Yuchen He, Shengbin Wang, Hantao Sun

2611.24886 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum compilation on superconducting processors requires selecting a connected execution region whose topology and calibrated properties suit the input circuit. This choice constrains subsequent routing and influences the noise encountered during execution, yet aggregate hardware-quality metrics alone may not reliably predict the execution fidelity of a given circuit. Calibration updates can also change region suitability and trigger the rebuilding of calibration-dependent resource structures. We present CREST, a graph neural network (GNN)-based framework that evaluates circuit-region compatibility before routing. It encodes gate dependencies and logical-qubit interactions alongside each candidate region's connectivity and current calibration attributes; bidirectional cross-graph attention relates the two representations, while real-device execution outcomes supervise candidate ranking. The trained scorer is reused with updated calibration attributes. Evaluations on 324 circuits from seven datasets on TianYan-176 show that CREST improves mean measurement-distribution fidelity by 19.03% over the strongest baseline and achieves the highest mean fidelity on every dataset. Furthermore, using updated calibration attributes, the same trained model maintains the highest overall mean fidelity across six measurement dates without retraining. With a unified model of circuit-region compatibility, CREST improves execution fidelity across diverse workloads and sustains that advantage as hardware calibration changes.

Quantum Simulation of First-Quantised Chemistry with a Sum-of-Squares Representation

Aleksei V. Ivanov, Christoph Sünderhauf, Jon Kunjummen, Nick S. Blunt, Róbert Izsák

2611.24885 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Calculating molecular energies is expected to be an important application of quantum computers, but the most efficient algorithms to achieve this typically have significant space requirements. Scaling quantum processors to thousands of logical qubits is a daunting engineering challenge, so developing algorithms that run with reduced qubit requirements is of particular importance. Moreover, most algorithms are benchmarked on active spaces with about as many orbitals as electrons, missing dynamical correlation which is necessary to describe real chemistry. Capturing this correlation requires several times more orbitals than electrons, even in compact atomic-orbital basis sets. This low-filling regime favours first quantisation, where each electron is represented by a number of qubits that grows only logarithmically with the number of orbitals. Whether this approach translates into a practical advantage in orbital basis sets of realistic size, however, has been unclear. Here, we develop a first-quantised phase estimation algorithm for generic orbital basis sets, based on a non-convex sum-of-squares representation of the Hamiltonian and spectral-gap amplification. We compare it with the state-of-the-art second-quantised algorithm, compiling both with the same techniques at the logical level. For six molecules with 4 to 24 electrons in 5 to 14 times as many orbitals, our first-quantised method needs up to 16 times fewer Toffoli gates than the second-quantised algorithm in the low-qubit regime, where only a few hundred logical qubits are available. It stays cheaper up to between several hundred and about 1\,400 qubits, and its smallest qubit count is 1.4 to 2 times lower than in second quantisation. In the low-qubit and low-filling regime, our algorithm is therefore the method of choice for chemistry in orbital basis sets.

Hurst Exponent Estimation with Quantum Wavelets

Brani Vidakovic

2611.24882 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

How accurately can the Hurst exponent $H$ of fractional Brownian motion be estimated from repeated preparations of a single amplitude-encoded path, when every measurement interrogates the same realization? We extend the $ε$-decimated quantum nondecimated wavelet transform in three directions: we remove the endpoint jump of circular filtering, derive the sampling distribution of the estimator, and compare readouts at equal query budgets. A one-qubit mirror extension removes the jump and keeps every coefficient that straddles a fold of the same order as an interior coefficient, for any compactly supported filter and circular shift. The transform for any such filter is compiled from the paraunitary lattice of its filter bank, and the energy share of a level is the success probability of one multiply-controlled reflection, which is both the controlled unitary of a Hadamard test and the oracle of amplitude estimation. For filters with at least two vanishing moments we prove a root-$N$ central limit theorem for the log-energy contrasts, independent of the limiting path norm, so the studentized estimator is asymptotically standard normal for deterministic query budgets under which the success count at every level diverges. For sparse counts we give a working multinomial--lognormal likelihood, exact in its readout model for direct measurement, and check its coverage by simulation. For paths of length $512$, mirroring reduces RMSE by a factor of $3$--$10$ for $H\ge0.5$, and with exact shares the nondecimated db2 estimator is $6$--$14\%$ above the root Cramér--Rao bound. Hadamard level tests are less accurate than direct measurement of the leading qubits at every budget. At $H=0.9$ and $2^{20}$ queries, maximum-likelihood amplitude estimation attains RMSE $0.0347$, against $0.0451$ for direct measurement and $0.0295$ with exact shares.

Time-Varying Medium from an Ensemble of Laser-Dressed Quantum Emitters

Adrián Juan-Delgado, Diego Martín-Cano, Paloma A. Huidobro

2611.24861 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We propose a minimal quantum-mechanical model of a frequency dispersive, time-modulated medium that explicitly incorporates the pumping mechanism. It consists of a homogeneous ensemble of quantum emitters dressed by a pump laser. We analyze their dispersive, time-varying response to a perturbative probe field by deriving the macroscopic polarizability of the ensemble, and then solving Maxwell's equations via the Floquet formalism. This yields a rich band structure that departs from conventional analyses in which the modulation source is neglected, arising from the interplay between the dispersive polaritonic and time-varying responses. These results shed light on the role of the modulation source in time-varying media and pave the way toward realizing dispersive time-varying media from driven quantum-mechanical systems.

The limits of magic-state cultivation

Llorenç Balada Gaggioli, Jakub Mareček

2611.24852 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Fault tolerance is understood through Pauli algebra, which fails at non-Clifford gates. Circuits such as magic-state cultivation, which checks an encoded T state with physical T gates, have therefore lacked an exact theory of which faults are harmful. We develop such a theory and show that, for any circuit that prepares a magic state with non-Clifford gates and postselection, one stabilizer code on the non-Clifford gates decides which faults are harmful. This ties cultivation to distillation, bounds its T-count from below and gives an exact test. For a single check on an ideally encoded state, the fault distance reduces to Pauli algebra on the code. As a use case, we analyze the S gates that have stood in for T gates in the design of cultivation. We show that this proxy can only overstate the fault distance of such a check, and that the checks in use, on color and surface codes, tolerate at most half as many faults as their code allows. The theory also yields nearest-neighbor checks that keep the full distance, certified up to code distance nine.

Shedding Light on Quantum Non-Classicality: Witnessing Wigner Negativity with Free Electrons

Sunjun Hwang, Leong Chuan Kwek

2611.24834 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Certifying quantum non-classicality like Wigner negativity typically demands full optical state tomography. This work introduces a noise-resilient framework for witnessing optical Wigner negativity using phase-resolved quantum photon-induced near-field electron microscopy (QPINEM). By mapping electron coherences directly to symmetrically ordered optical characteristic functions within a coupling-limited phase-space region, the protocol bypasses full optical reconstruction. A post-measurement witness matrix is constructed via Bochner's theorem from recorded electron spectra, where negative eigenvalues certify non-classicality. To ensure reliability under realistic experimental conditions, a noise-aware selection procedure decouples discovery from statistical validation. Benchmarked across various optical preparations-including vacuum-Fock superpositions, odd cat states, and GKP states-the protocol provides a statistically bounded pathway for probing quantum features with free electrons.

Soft Mixture of Quantum Experts for Hybrid Quantum-Classical Learning

Valeria Repetto, Romina D'Aurizio, Piero Farinelli

2611.24798 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum Machine Learning (QML) has attracted increasing interest as a possible route to construct feature representations that are difficult to reproduce with classical models. However, near-term QML architectures based on trainable parametrized quantum circuits remain affected by limited hardware resources, noise, and severe optimization difficulties such as barren plateaus. In this work we propose Soft-MoQE, a Soft Mixture of Quantum Experts architecture that replaces variational quantum training with the input-dependent selection and combination of fixed quantum feature maps. The model is composed of a heterogeneous pool of non-trainable quantum circuits, each defining a distinct embedding, and a classical gating network that learns how to weight these embeddings for each data point. We benchmark Soft-MoQE on three PCA-reduced tasks: MNIST parity, MNIST 10-class, and FashionMNIST. Soft-MoQE outperforms the single best expert, the uniform average of all experts and a linear baseline, achieving task-dependent performance comparable to that of a trainable quantum neural network, without optimizing any quantum parameter and with a quantum training cost that is lower by orders of magnitude. The analysis of the class- conditioned expert usage shows that the learned routing combines a few experts for each input, with a selection that depends on the class. These results support the learned routing among fixed quantum circuits as a trainability-aware design principle for hybrid QML.

Environment-assisted imaginary time evolution in feedback-based quantum algorithms

J. C. Bellizotti Souza, M. C. de Oliveira

2611.24783 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

The Feedback-based Algorithm for Quantum Optimization (FALQON) prepares ground states without classical parameter optimization, but requires deep circuits and can stagnate away from the ground state as a consequence of barren plateaus and symmetry protection. In order to avoid stagnation, imaginary time evolution (ITE) layers can be incorporated into FALQON layers, enhancing FALQON convergence. However, applying a non-unitary ITE layer in a closed quantum system is not possible, and approximations must be made to use ITE on real hardware; using an open quantum system formulation to incorporate ITE into FALQON represents a better approach. We describe ITE as a quantum operation induced by an environment, and combine it with the FALQON feedback law. In simulations of a frustrated Ising chain (ANNNI) and of MaxCut, the resulting algorithm prepares the ground state starting from any initial state, where FALQON can fail, and needs fewer layers on average when the initial state is fixed for the two investigated problems. The CITE-FALQON advantage strongly depends on the system phase for the ANNNI chain, and on the graph weights for the MaxCut problem.

Squeezed Cooling and Lasing with Cold Atoms in Cavity-QED

Rodrigo Grande de Diego, Carlos Sánchez Muñoz

2611.24743 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

A squeezed laser undergoes a lasing transition into a squeezed cavity mode, where stimulated emission generates a bright coherent field with a laser-like coherence time while maintaining one field quadrature below the vacuum noise level. Here we propose an optical implementation that needs neither a nonlinear crystal nor injected squeezed light, based on engineered interactions between ensembles of rubidium atoms and a squeezed cavity mode via cavity-assisted Raman transitions. A first ensemble cools the cavity into a squeezed vacuum, a mechanism we term squeezed cooling, yielding up to 9 dB in the intracavity field, surpassing the 3 dB limit of optical parametric oscillators. Tuned for output instead, it reaches up to 18 dB of output squeezing. Incoherently pumping a second ensemble drives a lasing transition into the squeezed mode, emitting a bright beam with long coherence time and noise below vacuum spanning a megahertz-wide band, away from the sharp phase-diffusion peak of excess noise at the carrier frequency, and robust to relaxation oscillations. We characterize lasing thresholds, superradiant emission, and linewidth narrowing, and identify the experimentally accessible regime where the system exhibits the defining features of a squeezed laser.

The magical memory cost of entanglement spectrum compression

Matias Karjula, Vilma Nieminen, Teemu Ojanen, Tapio Ala-Nissila, Moein N. Ivaki

2611.24710 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

How much quantum memory is needed to faithfully retain the entanglement spectrum of a bipartite pure state after separating out Bell pairs through local unitaries? We derive the exact tradeoff between Bell-pair yield, residual memory, and reconstruction fidelity under local unitaries, defining an operational measure of entanglement-spectrum complexity. Smoothed entanglement spread bounds this memory cost from below, while diverging nonlocal magic forces unbounded memory at any fixed positive fidelity. Chaotic circuit dynamics exhibit a transient memory peak whose height increases with system size, followed by declining cost despite continued entropy growth. A large typical Haar-random state requires only an accuracy-dependent memory, whereas stationary fermionic Gaussian states retain a growing cost with size. In the circuits studied, the multiscale spectral structure associated with entanglement catalysis also has a practical consequence for matrix product state compression, yielding a multiplicative overhead not captured by the conventional entropy-based bond dimension estimate.

Coherent-Response and Thermal-Fluctuation Information in Cavity-Magnon Magnetometry

G. Zhao, X. -F. Qian

2611.24701 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Magnetic sensing with cavity--magnon systems typically relies on the coherent response, while field-dependent fluctuations are treated as measurement noise. Here, we show that the variance of a measured microwave quadrature provides a distinct source of magnetic-field information. For repeated phase-sensitive measurements of a calibrated quadrature, we derive the Gaussian likelihood and show that its Fisher information separates exactly into two terms. The coherent-displacement term depends on the field derivative of the quadrature mean, and the thermal-fluctuation term depends on the field derivative of its variance. Both terms are accessible from the same measurement record, but their optimal operating conditions differ. For the amplitude quadrature, the dimensionless coherent response factor reaches its global maximum at cooperativity $C=2$, corresponding to a coupling strength $g=\sqrt{2κ_aκ_m}$, and at linewidth-normalized detunings $δ_a=δ_m=\pm 1$. In the near-resonance approximation, the reduced variance-information term is globally maximized at cavity--magnon frequency matching, $Δ_a=Δ_m$, and approaches a finite limit at large cooperativity. We map the relative contributions of the two terms across drive frequencies, drive strengths, and temperatures. Strong coherent driving favors displacement-based sensing, whereas at finite temperature the variance contribution can dominate under weak driving and remain finite even when the coherent-displacement contribution vanishes. These results establish a measurement-specific framework for cavity--magnon magnetometry and identify operating regimes for exploiting the quadrature mean, its variance, or both.

On Reaction Depth and Fast Fault-Tolerant Boolean Logic

Christopher Kang, Alexander Cowtan, Adam Bene Watts, Guillaume Dauphinais, Benjamin Ide

2611.24687 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Reducing runtimes of quantum applications is critical for practical viability. On quantum computers, the runtime can depend both on the speed of quantum operations and on how often the program must wait for the classical coprocessor to determine adaptive operations. Some recent approaches to reducing this overhead have focused on minimizing the "reaction depth" of a computation, informally defined as the number of times the classical coprocessor must be consulted while running a quantum program. In this work, we formalize the notion of reaction depth. We find several subtleties in this theory. For example, we distinguish the reaction depth of a circuit from that of a circuit run, and show that the magic depth of a unitary can be higher than the reaction depth once compiled into Clifford computation and magic state injection. We then focus on the specific case of coherent Boolean logic, a common and expensive component in quantum algorithms. We use a natural gateset for fast operations with Low-Density Parity Check (LDPC) codes, which consists of homogeneous $Z$- and $X$-type Pauli Product Measurements (PPMs), alongside a supply of Toffoli states. We prove that, using this gateset, any Boolean arithmetic circuit can be implemented on a quantum computer with constant quantum depth and constant reaction depth, at the cost of exponential space and leaving some qubits "dirty". Using the same gateset we find two efficient AutoAND circuits that require only a Toffoli state and homogeneous PPMs. We then give efficient implementations of the quantum ripple-carry adder and quantum schoolbook multiplier, which require a low number of heterogeneous PPMs for uncomputation. We find implementations competitive with the state-of-the-art despite the restricted gateset.

A provably efficient classical algorithm for simulating OTOC$^{(1)}$ in 1D

Laura Lewis, Antonio A. Mele, Ronald de Wolf, Jarrod R. McClean, Amira Abbas

2611.24640 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Out-of-time-order correlators (OTOCs) are quantities of broad interest in many-body physics due to their connection with information scrambling and quantum chaos. Recently, estimating higher-order OTOCs in random quantum circuits was proposed as a promising avenue for quantum advantage, yet the classical hardness of this task remains poorly understood. Even for first-order OTOCs, where growing evidence suggests classical tractability, no efficient classical algorithm with rigorous guarantees has been established to date. In this work, we introduce "window propagation," the first provably polynomial-time classical algorithm for approximating first-order OTOCs in 1D Haar-random brickwork circuits, at arbitrary depths and with inverse-polynomial mean-squared error. We also conduct numerical experiments comparing our simulation results to exact computation on up to $512$ qubits for Clifford circuits with $768$ $T$-gates and up to $22$ qubits for Haar-random circuits. We emphasize that our results do not directly apply to second-order OTOCs in 2D, which is the subject of recent quantum advantage proposals. Nevertheless, our work provides a rigorous step towards understanding the classical complexity of OTOC estimation and represents a family of non-trivial quantum circuits for which a provable, polynomial time algorithm is now known, establishing foundations for understanding these widely used diagnostics of quantum chaos.

Instanton tunnelling as a verifiable benchmark for digital quantum simulation: circuit structure, classical simulability and hardware reproducibility

Gerhard Hellstern, Marc Maussner

2611.24624 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We use instanton-mediated tunnelling in the quartic double well as a benchmark for digital quantum simulation that is checkable against an exact answer at every step. The instanton enters through the classical analysis; the hardware tests the dynamics of the lattice model. A unary (single-excitation) encoding maps N lattice sites to N qubits, with the single-excitation dynamics as a reference that remains classically cheap at any N. For a second-order Trotter circuit with adjacent, equal-angle XX/YY pairs on each bond, we prove that the Schmidt rank across any cut is at most four at every gate boundary and at most two after each pair, independently of N. Matrix-product-state simulations of this gate list reproduce the exact splitting up to N = 48. For this bond-wise formula the admissible Trotter step shrinks roughly as N^-2, so one tunnelling period costs about N^3.3 two-qubit gates; a kinetic/potential splitting keeps the step near 0.065 up to N=128, so this scaling belongs to splitting the kinetic term bond by bond. At a coarser, separately bounded step we measure the full transfer at N=8 on two superconducting processors, recovering the lattice splitting to a few percent and its dependence on the barrier height, which at this resolution is set by the lattice rather than by the instanton. Over 9 repetitions, runs taken minutes apart agree to shot noise, while runs hours to weeks apart differ by up to 6.1%, also on a fixed set of qubits; with sessions as the sampling unit, the processors differ in the damping, while a difference in the splitting is not established. Normalising by the measured single-excitation population extends the usable depth about 4-fold but does not improve the splitting. A Gaussian start state, which needs no diagonalisation, reproduces the splitting of the eigenvector-based start to within 1.6 percentage points.

Number-correlated photon entanglement with a quantum memory interferometer

Imogen Forbes, Vincent Boyer, Louis Edwards-Pratt, Mahirul Khan, Sougato Bose, Thomas M Hird

2611.24605 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Strong photon-photon interactions are central to quantum optical technologies yet remain challenging to realise at the single-photon level. Here, we show how embedding a quantum memory within a Mach-Zehnder interferometer enables a coherent transformation that converts single-mode photon states into number-correlated entangled states. Using an off-resonant ladder-type atomic interaction, storage and retrieval within a quantum memory maps a single-photon excitation onto a pair of photons across distinct optical modes via a driving control field. Embedding this within an interferometer deterministically produces an effective transformation in the photon number basis: $\sum_n a_n |n\rangle \to \sum_n a_n |n\rangle |n\rangle$ without relying on conventional optical nonlinearities. Measurement of one mode enables photonic non-demolition detection, state preparation, and frequency conversion as applications of the same underlying transformation. These results establish quantum memories embedded within an interferometric architecture as a platform for measurement-induced photon-photon interactions and the generation of Gaussian and non-Gaussian entangled states.

Measurement-order dependence bounds uncertainty, contextuality, steering, and Bell nonlocality

Shengjun Wu

2611.24604 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Two quantum measurements applied to the same input in opposite orders give two joint distributions of the same outcomes. For Lüders instruments we measure how far apart these order records can be, over all inputs, by their total-variation distance $\mathcal{T}$, their Jensen-Shannon divergence $\mathcal{J}$ (in bits), and their squared Hellinger distance. These order scores vanish exactly when the measurements commute, and $\mathcal{T}=\|[A,B]\|/4$ for two binary sharp observables. Some pairs of bases exceed mutually unbiased bases in squared Hellinger score, and in odd dimensions in $\mathcal{J}$, although their minimal entropy sum is smaller. For projective measurements, a Maassen-Uffink bound $q>0$ implies $\mathcal{T}\ge1-2^{-q}$ and a positive lower bound on $\mathcal{J}$. Measuring all observables of a scenario in sequence defines a joint distribution, so violations of noncontextuality, steering, and Bell inequalities are bounded by distances between order records. For correlation Bell inequalities with binary sharp observables, the squared Bell operator is a symmetrized (Jordan) part minus tensor products of local commutators. If one party has two settings, the violation is bounded bilinearly in the two parties' order scores; we conjecture this bound in general. On Clifford realizations it would follow from a Hilbert-Schmidt variant of Grothendieck's inequality, which we prove when one party has at most three settings. For three binary sharp measurements, the violation of Bell's original inequality by a maximally entangled state equals an order effect in three-measurement records of the maximally mixed state minus four times an alternation probability. For the rank-one Klyachko-Can-Binicioğlu-Shumovsky pentagon on a qutrit, the violation is at most the largest product of the order scores of two crossing diagonals, with equality at the maximal violation.

No-Go Theorems for Ordered Universal Entanglement Purification

C. L. Liu

2611.24603 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entanglement purification is a fundamental tool for obtaining high-fidelity entangled states used in various quantum technologies. It aims to increase the fidelity of noisy shared entangled states with a fixed maximally entangled state through LOCC. In distributed quantum systems, such as networks employing quantum repeaters, limited memory, probabilistic entanglement generation, and unequal storage times can leave a finite collection of nonidentical pairs. Their states may remain incompletely characterized even when calibrated preparation and storage records establish their fidelity ordering. Recent work has investigated whether fidelity ordering permits nontrivial universal purification. A nontrivial universal $n$-to-1 protocol must, conditioned on success, never lower the highest input fidelity and strictly increase it for at least one allowed joint input. Although no-go results have been established for a restricted class of LOCC protocols, the corresponding question for general LOCC has remained unresolved. Here, we study ordered universal purification under separable operations. Specifically, for every fixed finite $n\ge2$, we prove that when independently prepared two-qubit pairs range over the full family of states above a fixed fidelity threshold $0\le F_*<1$, any separable success map that never lowers the highest input fidelity on the allowed ordered inputs must preserve that fidelity exactly whenever it succeeds. This excludes nontrivial universal LOCC purification even for arbitrarily high input fidelities, without imposing a positive lower bound on success probability. ...

Gutzwiller Quantum-Classical Embedding for Dynamics Simulations of Correlated Electron Systems

Joshua Aftergood, Daniele Guerci, Jacob Brunton, Feng Zhang, Thomas Iadecola, Peter P. Orth, Cai-Zhuang Wang, Nicola Lanatà, Yong-Xin Yao

2611.24592 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Simulating the real-time dynamics of correlated electron systems requires a nonperturbative treatment of local correlations over long times, a challenge for classical methods. We present the time-dependent Gutzwiller quantum-classical embedding framework, t-GQCE, for generic multi-orbital lattice models with time-dependent Hamiltonians. Within the time-dependent ghost Gutzwiller approximation, the lattice dynamics is mapped onto a noninteracting quasiparticle lattice, propagated classically, coupled to finite interacting embedding models propagated on quantum processors. The two parts exchange only embedding Hamiltonian parameters and single-particle density matrices, and the framework is agnostic to the quantum dynamics solver. We demonstrate it with adaptive variational quantum dynamics simulations of interaction quenches in the Hubbard model on the Bethe lattice. Without ghost orbitals, the embedding problem reduces to a single qubit, simulated on IBM quantum hardware with two qubits, including an ancilla. With more ghost orbitals, t-GQCE suppresses the artificial undamped oscillations of the conventional Gutzwiller approximation and approaches nonequilibrium dynamical mean-field theory results for weak and strong quenches. Statevector simulations with 2, 4 and 6 ghost orbitals per spin, or 8, 12 and 16 qubits, give adaptive circuits that follow the embedding states with infidelities below $5\times10^{-4}$. Under trapped-ion noise models, circuit compression, measurements in rotated orbital bases with post-selection, and noise mitigation reduce the measurement errors severalfold. At one third of the error rates of a hardware-benchmarked noise model, they reach an accuracy of $0.01$ for the single-particle density matrix and the double occupancy with $10^5$ shots per time step, and the Quantinuum H2-Emulator gives similar accuracy.

On a local hidden-variable model for postselected EPR correlations

Daniele Cenni

2611.24534 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

A theoretical and numerical analysis of a Bell-type experiment is presented, where linear polarization measurements on nonmaximally entangled two-qubit states are modeled through a sigmoid-based threshold mechanism that violates the fair-sampling assumption required by the CHSH inequality. Numerical simulations characterize how closely this local construction can reproduce quantum-like correlations in the postselected detected sample, for both the |Phi_r> and |Psi_r> states over a range of entanglement parameters. For the tested configurations, the model produces CHSH-type violations only in the postselected detected sample through a setting-dependent detection mechanism, operating outside the assumptions of both the CHSH inequality and Mermin's 82.8% efficiency bound. The model is not in conflict with loophole-free Bell experiments, which specifically close the detection loophole exploited here. The CH--Eberhard analysis in the one-detector-per-side configuration yields J < 0 throughout the full range of entanglement parameters, as required for a strictly local model. The model is further extended with a local adaptive-threshold mechanism implementing one-sided memory. A paired comparison shows that this specific memory rule produces a systematic and reproducible shift in the CH--Eberhard parameter J relative to the fixed-threshold model, while leaving the CH--Eberhard analysis qualitatively unchanged under the tested conditions. The results characterize how a local, setting-dependent postselection mechanism shapes Bell-test statistics across a range of entanglement parameters, within the specific configurations and threshold rules tested.

A Relativistic Quantum Mechanical Formulation of Wu-Shaknov Entanglements

J. G. Cardoso

2611.24502 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

It is suggested that a spontaneous formation of quantum mechanical entanglements does actually occur between spin, helicity and polarization states involved in creation-annihilation processes. A framework built up earlier that presumably affords a unified relativistic quantum mechanical description of free particle-antiparticle pairs of any spin is used to propose a comprehensive formulation of Wu-Shaknov entanglements. Explicit relationships between amplitudes and Born-like probabilities associated to incoming and outgoing states are obtained thereafter on the basis of certain theoretical assumptions. The behaviours of these relationships under the action of a dynamical group which is taken to supply observational correlations for different frames in spacetime are then specified. It appears that a modified version of some of the conventional conservation laws may afford a set of general selection rules for the formation of relativistic entanglements.

Sharp rank thresholds and cubic support in PPT extensions of completely symmetric states

Qian Lilong, Teng Zhang

2611.24500 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

For completely symmetric states on $d\ge3$ parties of actual local rank $N\ge3$, the least rank of an entangled state passing any prescribed finite positive level of the PPT extension hierarchy is $3d+N-3$. At equality, the two- and three-party marginals recover a ternary plane cubic shared by every extension. On this cubic the hierarchy becomes exact at a finite level precisely when every singularity outside the zero locus of the contraction quadratic is a split real node. We give the first exact level or an exact feasibility test for it, independent of $d$. On a smooth cubic the thresholds along the specified paths to the square of a flex tangent reduce to elliptic division and have unique rank-two Gram matrices. On reflection-invariant paths we obtain a quartic formula and the leading asymptotic constant. The least rank for entanglement itself is $3d+N-5$, and we classify equality. An explicit rational rank-nine three-qutrit state on a smooth cubic passes the first extension level and fails the second.

A Bose-Hubbard quantum thermal machine

Felipe Isaule, Juan E. Bernate, Francisco J. Peña, Patricio Vargas, Thomás Fogarty

2611.24483 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

This work proposes a quantum thermal machine comprised of interacting ultracold bosons confined in a one-dimensional optical lattice and modeled by the Bose-Hubbard Hamiltonian. We consider an Otto-inspired cycle with strokes that change the interaction strength between bosons, in addition to standard thermalization and compression/expansion strokes. We find that these interaction changes can be manipulated to enhance the performance of the thermal machine, outperforming non-interacting cycles. In particular, when operating as a heat engine, the cycle can achieve its largest work output and near-Carnot efficiency by compressing the medium at strong repulsion into a Mott insulator state. Additionally, we find that decreasing interactions after the compression stroke favors and enhances the engine operation, whereas increasing interactions favors refrigeration cycles. The findings of this work further show that controlling the interactions across quantum phases of matter can be harnessed as a useful thermodynamic resource.

From BBM92 Measurements to Secure Keys: Challenges in a Practical Implementation

Karolina P. Schatz, Elia Falcioni, Panagiotis Papanastasiou, Marco Lucamarini

2611.24478 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

The protocol introduced by C. H. Bennett, G. Brassard and N. D. Mermin in 1992 (BBM92) is one of the most important and widely adopted quantum key distribution (QKD) protocols. As with any other QKD protocol, its practical security depends on satisfying the assumptions underlying its theoretical security proofs. Here, we examine two common implementations of BBM92: a conventional passive receiver and a time-multiplexed configuration that halves the number of detectors. We characterise the passive polarisation analysers common to both architectures and present experimental results obtained with the time-multiplexed receiver, employing a continuous-wave (CW) pumped spontaneous parametric down-conversion (SPDC) source of polarisation-entangled photon pairs and threshold detectors. We investigate the challenges encountered during post-processing when attempting to satisfy the requirements of existing security proofs and discuss the gap between theoretical security assumptions and the extraction of a provably secure cryptographic key.

Bound entanglement as a trigonometric moment problem

Lilong Qian, Teng Zhang

2611.24473 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entangled states that are positive under partial transposition (PPT) are the main obstruction to a simple description of entanglement. We study three basic questions about them within a class of multiqubit states, the mixtures, with real but possibly negative weights, of products of equatorial spin coherent states of several groups of qubits: which PPT entangled states belong to the class, how robust their entanglement is to white noise, and how small their rank can be. In this class each question becomes a question about a truncated trigonometric moment problem. Every such state is PPT across every bipartition, and it is fully separable exactly when an associated multi-level Toeplitz matrix is the moment matrix of a positive measure on the torus. We answer the three questions exactly in the following cases. For three qubits, every rank-four PPT entangled state with nonzero Lorentz invariant belongs to the class after invertible local operators, which proves a working hypothesis of Garberg, Irgens and Myrheim and yields a complete set of invariants for this seven-dimensional family; among the states with vanishing invariant, exactly a one-parameter family belongs to it. For every three-qubit state built from an unextendible product basis, the white-noise threshold for full separability is $λ^*=1-2/(1+\sqrt{1+s})$ with a local-unitary invariant $s\in(0,1]$, and $λ^*=3-2\sqrt2$ for the Shifts basis; a witness in closed form detects every entangled state of this family with eight local Pauli settings. For two groups of qubits we construct extremal states of minimal rank, and for three groups we determine the minimal rank of entanglement within the class in several configurations.

Linear-mode photon counting performance and intrinsic dark current in HgCdTe APDs for quantum optical applications

Arthur Charrier, Timoth{é}e Guerra, Nicolas Baier, Julie Abergel, Antoine Coquiard, Amaury Mavel, Sebastien Renet, Frederic Berger, Aur{é}lie Vanden...

2611.24461 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

The performance of HgCdTe APDs for single photon detection at T=80 K has been characterized using a hybrized Resistive Trans-Impedance Amplifier (RTIA) and a deported Capacitance Trans-impedance amplifier (CTIA). The single-photon detection capacity was characterized with the HgCdTe APDs operated in linear mode with high APD gain, M>400, and hybridized with the RTIA. The measurements revealed an external photon detection efficiency (PDE) of 42 % to 55 %, and a dark count rate (DCR) of 2.6 MHz to 17 MHz, for an amplitude threshold ranging from 2.5 to 4.5 times the rms noise of the amplifier. Taking into account the unity gain quantum efficiency, QE=63%, this corresponds to an internal PDE ranging from 66 % to 86 %. Using the deported CTIA, it was demonstrated that the high level of DCR is not the intrinsic limit of the APD technology. The CTIA approach enables direct measurement of the APD dark current, Idark, with gain-normalized dark current levels as low as Idark/M=10.9 fA at M = 450. This corresponds to a DCR of 150 Hz which is compatible with the requirements for most of the quantum photonics applications.

Virtual Autopurification in Translationally Invariant Quantum States

Atsushi Iwaki, Hideaki Hakoshima, Nobuyuki Yoshioka

2611.24448 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We introduce virtual autopurification (VAP), a protocol for virtual purification that operates entirely within a single translationally invariant system. Virtual purification suppresses thermal fluctuations and decoherence noise by amplifying the dominant pure component of a mixed state, but its standard implementation requires multiple copies of the state and global entangled measurements. VAP avoids the multiple-copy overhead by constructing virtual copies from spatially separated subregions and performing entangled measurements only between them. Assuming clustering of correlations, we show that VAP reproduces the expectation values of the standard virtual purification protocol, with discrepancies that decay exponentially in both the buffer length and the inter-subregion distance. Numerical simulations support the theoretical predictions and demonstrate accurate implementation of virtual cooling with reduced resource requirements. Our results establish VAP as a resource-efficient and scalable approach to quantum-state purification in near-term devices.

A unified approach to the time-dependent quantum harmonic oscillator via point transformations and Lie symmetries

F. Güngör, J. Negro

2611.24446 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We revisit the time-dependent harmonic oscillator (TDHO) in quantum mechanics based on the notion of equivalence transformations and Lie point symmetries. Within this framework, we give the most general point transformations depending on seven parameters which map from the TDHO to the usual harmonic oscillator (HO) and the other way around. As a byproduct we reconstruct the Schrödinger propagator (Mehler's kernel) for the time-independent harmonic oscillator. We demonstrate, without recourse to the Lewis--Riesenwert (LR) invariant, how Lie algebraic methods enable alternative derivation of the normalized wave functions of the TDHO by constructing solutions invariant under some specific subgroup of $\SL(2,\mathbb{R})$ combined with the gauge group. We further show that, on the relevant $\SL(2,\mathbb{R})$-invariant solution family, the Lewis--Riesenfeld operator defines a compatible second-order differential constraint, thereby clarifying its relation to the Lie symmetry structure of the TDHO.

Efficient simulation of variational quantum circuits: representation, accuracy and CPU/GPU allocation

Vojtěch Novák, Radovan Rečka, Ondřej Knebl, Ivan Zelinka

2611.24444 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Classical circuit simulation supports quantum software development and verification and provides a baseline for assessing quantum advantage. We compare gate-based statevector simulation, direct Pauli evolution and matrix product states for molecular and spin Variational Hamiltonian Ansatze and hardware-efficient ansatze on CPU/GPU systems, varying width, depth, precision and resource allocation. In the tested implementations, direct Pauli evolution benefits complex molecular VHA, whereas GPUs accelerate wider spin and hardware efficient circuits. Matrix product state is useful when limited entanglement permits accurate compression; corrected CPU FP32 can meet the tested tolerance while costing more than FP64. Workload size, startup, worker memory and task-specific profiling can change the preferred allocation. Matched NumPy Pauli updates accelerate two-layer full LiH by 3.45-fold; the GPU gives approximately 30-fold acceleration over 18-thread Aer for 28-qubit, four-layer TFIM, both in FP64. We provide a procedure for choosing representation, precision and worker allocation jointly, comparing the cost of complete energy evaluations under accuracy, memory and core constraints.

Long-distance continuous variable entanglement distribution over deployed fibre

Huy Q. Nguyen, Benjamin L. Larsen, Luiz C. C. P. Filho, Yijian Meng, Mikael Ø. Lassen, Jonas S. Neergaard-Nielsen, Tobias Gehring, Ulrik L. Andersen,...

2611.24411 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Continuous-variable (CV) entanglement offers deterministic generation and room-temperature coherent detection for quantum networks, but distributing it over deployed fibre has been hindered by the need to stabilise optical phase, polarisation, and timing at remote receivers. Here we demonstrate, to our knowledge, the first distribution of CV entanglement over deployed metropolitan fibre using independent coherent receivers. The two modes of a two-mode squeezed vacuum state are delivered to remote nodes through 23 km ($\approx 7$ dB loss) and 450 m ($\approx 1$ dB loss) deployed fibre links. Each node uses its own free-running laser and polarisation-diverse coherent receiver. Co-propagating pilot tones enable digital recovery of timing, phase and polarisation, while inter-mode correlations fix the quadrature alignment. We certify entanglement with a Simon-Duan value of $1.915\pm 0.013$, below the separability bound of 2 and a logarithmic negativity of $0.067\pm0.011$. By replacing optical stabilisation with digital reconstruction, our approach offers a practical route towards scalable CV quantum networks.

Doppler effect on dual-downlink time-bin quantum key distribution and a proposed ephemeris-assisted witness-field correction

Sacha Gressani, Luca Furfaro, Erik Kerstel, Jean-Marc Merolla

2611.24369 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Time-bin entanglement is promising for satellite Quantum Key Distribution (QKD) due to its compatibility with telecom fiber networks, but its phase-sensitive measurements are vulnerable to Doppler effects induced by satellite motion. We present a spectral-temporal framework for time-bin-entangled photon pairs generated onboard a satellite via Spontaneous Parametric Down Conversion (SPDC) and distributed to two Optical Ground Stations (OGSs) over independent downlinks with distinct Doppler shifts. Each OGS is equipped with an Unbalanced Mach-Zehnder Interferometer (UMZI) used to perform Bennett-Brassard-Mermin 1992 (BBM92) entangled-photon QKD. In a simulated Low Earth Orbit (LEO) pass with matched 400 ps analyzer delays, the received time-bin separation changes by at most 8.8 fs per link, while the combined carrier phase shifts by about 38 rad, which primarily degrades phase-basis correlations. After zero-Doppler calibration, this phase separates into independent signal-and idler-link contributions, allowing each station to correct its link Doppler phase shift locally, without real-time phase exchange between the stations. We propose an ephemeris-assisted feed-forward architecture, in which an auxiliary interferometer analyzes a co-propagating classical witness field to reconstruct the local Doppler-induced phase, which a phase modulator then compensates on the quantum channel. In a noise-free model, a 1 Hz sample-and-hold correction rate keeps the phase-basis Quantum Bit Error Rate (QBER) below 2% and retains 93% of the ideal asymptotic key yield. After 18 accumulated passes, the corrected finite secret key reaches 95% of its ideal length, whereas relabeling the parity from the ephemeris without optical correction reaches only about 8%.

Spontaneous emission of atomic systems near metallic and semiconducting atomic chains

Abhishek Ghosh, David Dams, Antton Babaze, Garnett Bryant, Carsten Rockstuhl, Andrés Ayuela, Karolina Słowik, Marta Pelc

2611.24358 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate the spontaneous emission of a quantum emitter placed near finite atomic chains described by the Su-Schrieffer-Heeger model. By tuning the chain from a metallic to a semiconducting character through dimerization, we analyze how the electronic structure of an atomic-scale scatterer, together with the illumination profile, determines the strength, bandwidth, and spatial structure of the spontaneous emission enhancement. The resonant enhancement depends on both spectral matching and the emitter position relative to the induced charge and field patterns. In metallic chains, the nearly harmonic energy spectrum leads to overlapping optical transitions and strong resonances. For semiconducting chains, dimerization opens a gap and leads to a modified density of electronic states, redistributing the response over a broader spectral range and reducing its peak intensity. Coulomb interactions affect the optical resonances through blueshift or modification of their spatial character, and act differently on collective and single-particle-like excitations. Finally, we show that the same mechanisms demonstrated in atomic chains persist in realistic quasi-one-dimensional systems, including trans-polyacetylene chains and graphene nanoribbons. Our findings indicate a general direction for engineering light-matter interactions at the atomic scale, and may offer design principles for tunable nanoscale photonic and quantum-optical devices.

QuFrame: Pauli Frame Tracking for Fault-Tolerant Quantum Control

Aleksandra Świerkowska, Ilgaz Er, Emmanouil Giortamis, Pramod Bhatotia

2611.24328 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Fault-tolerant quantum computing requires continuous quantum error correction (QEC) to suppress physical noise. While Clifford-only workloads can defer corrections to software post-processing, universal computation breaks this paradigm: executing non-Clifford gates via magic-state gadgets introduces hard, real-time control-flow dependencies on error-corrected measurements. Consequently, the controller must extract syndromes, decode them, and update the Pauli frame in real time, closing the entire QEC loop within a strict $1\,μ\text{s}$ cycle. However, prior proposals on Pauli frame tracking remain largely theoretical, leaving the microarchitectural bottlenecks of tracking, resolving, and synchronizing frame updates across distributed control pipelines unaddressed. To this end, we present QuFrame, a control microarchitecture for real-time Pauli frame tracking that closes the QEC loop within $1\,μ\text{s}$ while sustaining QPU-rate throughput. By introducing QuFrameISA, we cleanly decouple instruction execution from continuous Pauli frame management. Execution is distributed across per-qubit Instruction Resolution Engines (IREs) that resolve instructions against the frame via a single table lookup, while a Pauli Frame Management Unit enables independent, lock-free concurrent commits. To strictly guarantee the $1\,μ\text{s}$ deadline, QuFrame pairs an asynchronous primary decoder with an on-chip fallback decoder that resolves in $144\,\text{ns}$, natively reconciling divergent updates in hardware without degrading logical error rates.

A Convex-Roof Affinity-Square Measure of Quantum Imaginarity

Nan-Nan Guan, Meng-Li Guo, Xue-Na Zhu, Zhi-Xiang Jin, Yan-Hui Zhou

2611.24311 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum imaginarity characterizes the part of a quantum state that cannot be represented by real density matrices in a fixed reference basis. We study an affinity-square measure of imaginarity for pure states and its convex-roof extension to mixed states. The pure state quantity is defined by minimizing the affinity-square measure over the convex set of real states. This optimization admits a closed expression determined by the modulus of the conjugation overlap between a state and its complex conjugate. The measure vanishes precisely when the state is real up to a global phase. We prove that the convex-roof extension is faithful, convex, monotone under real operations, and nonincreasing on average under selective real operations. For arbitrary single-qubit mixed states, we evaluate the convex roof exactly and express it in terms of the imaginary component of the off-diagonal density-matrix element. We also compare pure-state imaginarity with an auxiliary affinity-square coherence functional and give the corresponding phase weights.

Quantifying extractable imaginarity with qubit triangles

Meng-Li Guo, Chen-Xin Xu, Wen Xu, Shao-Ming Fei

2611.24305 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Two qubit states with the same robustness of imaginarity can differ in the robustness attainable by real filtering on a successful outcome. We represent the input robustness $R$ and the largest conditional robustness $κ$ by the base of a right triangle and the slope of its hypotenuse, respectively. Twice the area, $R^2κ$, defines a faithful, convex measure that is monotone on average under real instruments. In arbitrary finite dimensions, maximizing the mean normalized area of the extracted qubits gives the pointwise smallest strongly monotone extension of the qubit measure. We derive computable bounds on this area by determining the maximum mean squared robustness of the output qubits. This maximum equals the Bures quantum $χ^2$ divergence between the input and its real part. A projection onto orthogonal real subspaces attains the maximum and, when its outcome is retained, preserves the quantum Fisher information at the midpoint of a mixture of the input and its complex conjugate. We obtain exact areas for states with commuting real and imaginary parts and for pure states mixed with white noise. Two eight-dimensional states have identical $R$, $κ$, and optimal mean squared robustness, yet their different areas rule out deterministic conversion by real operations in one direction.

Semiclassical Quantum Mechanics and the Optics of Time-Varying Media

S. A. R. Horsley, R. Sokol, E. -M. Graefe

2611.24291 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Rapid, high contrast modulation of optical parameters such as the refractive index can radically reshape a wave's frequency spectrum as it propagates. Non-commuting frequency and time operators can be used to describe this reshaping, analogous to the position and momentum operators of quantum mechanics. Here we develop the connection between this theory and semi-classical quantum mechanics, showing that: (i) different microscopic models of time-varying materials are equivalent to choices of operator ordering; (ii) wave propagation is governed by an unusual non-Hermitian Schrödinger equation; (iii) we can take a semi-classical limit, finding a generalization of Hamilton's equations governing the central frequency and arrival time of a wave spectrum as it propagates through a modulated material. The theory can be applied to design dispersive time modulations that `focus' a wave in frequency and time, analogous to caustics in semiclassical quantum mechanics. Our results not only deepen the connection between classical wave propagation and quantum mechanics, but can also simplify overly complex calculations that have been previously applied to media where time reflection effects are negligible.

Beyond Corpus-Driven Imitation: Evolving Musical Mindsets in the Agentic Orchestra via Quantum Reinforcement Learning

Eduardo Reck Miranda, Moein Fahmideh Vatandoost

2611.24290 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

This paper presents a framework for computer-aided music composition and performance based on quantum reinforcement learning and multi-agent interaction. We introduce the agentic orchestra, where musical agents evolve distinct mindsets through trial-and-error engagement with a musical environment, rather than through training on large datasets. The agents are implemented as parameterised quantum circuits. They evolve distinct compositional behaviours, referred to as mindsets. This enables the exploration of musical decision spaces using quantum superposition and entanglement within a hybrid quantum-classical loop. We present two complementary agent architectures: atomistic agents, which process pitch and rhythm independently, and holistic agents, which handle pitch and duration as unified note events. Mindsets are shaped through musically grounded reward functions, which can be combined and weighted to develop different mindsets across agents. The resulting system positions quantum computing agents less as autonomous composers and more as adaptive musical partners, each developing its own musical personality through interaction rather than imitation. Demonstrations show how agents generalise their learned behaviour to previously unseen material, operating in interactive and offline batch modes using MIDI-encoded music. While quantum computers are still in development, experiments conducted on IBM quantum hardware confirmed that musically meaningful learning is achievable with existing quantum computers. For composers and performers, the agentic orchestra opens new possibilities for emergent, process-oriented musical creativity, offering a scalable foundation for quantum computer-aided music composition as quantum computing technology continues to advance.

In-memory measurement-device-independent quantum key distribution

Nicolas Gauriot, Samuel Morrissey, Paul M. Burdekin, Ilse Maillette de Buy Wenniger, Sarah E. Thomas, Ian A. Walmsley, Robert I. Woodward, R. Mark Ste...

2611.24255 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum memories offer to significantly extend the performance of quantum networks, but their complexity and limited performance at telecommunication wavelengths have so far hindered practical deployment. We propose a new memory-assisted measurement device independent quantum key distribution (MDI-QKD) protocol based on in-memory interference. Our approach leverages progress in atomic ensemble memories that enable the interference of a stationary matter qubit and a travelling photonic qubit inside a single quantum memory. We quantitatively evaluate the performance of this scheme against memoryless MDI-QKD and existing two-memory architectures, showing that it not only achieves superior secret key rates and surpasses the memoryless bound at substantially shorter distances, but also reduces hardware requirements by halving the number of memories and detectors. Our results further indicate that off resonant cascaded absorption (ORCA) memories are a particularly promising platform for implementing this protocol, and we outline a concrete design compatible with their capabilities. These findings demonstrate that in-memory interference provides a higher performance, and resource efficient route toward near term memory enhanced quantum secure communications.

A relativistic gravitisation of quantum theory?

Samuel Fedida, Adrian Kent

2611.24227 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We develop a model, that we call local semiclassical gravity, based on the distributional semiclassical Einstein field equations (EFEs) sourced by the local quantum state, i.e. the reduced density matrix of the local system updated by collapses (only) in its past light cone. We propose this as the basis of a relativistically causal generally covariant gravitisation of relativistic quantum theory in $1+3$ spacetime dimensions. We derive the weak-field limit which exhibits the explicitly causal dynamical structure of the theory, and recover the Schrödinger-Newton (SN) system in the nonrelativistic limit. This proposal can thus be understood as a causal completion of the SN equation, a nonlinear extension to quantum theory. We analyze relativistic quantum measurements in this nonlinear setup, showing that these do not lead to superluminal signalling if quantum states update (only) in the future light-cone of the measurement region. We give explicit examples of quantum measurements on a spatial superposition and on entangled subsystems showing how, in the weak field limit, discontinuities in the expectation value of the stress-energy tensor can be consistent with distributional solutions to the (linearised) semiclassical EFEs. We also highlight that the theory allows non-standard measurements via its nonlinearities. These effective ``readout devices'' can approximately determine a quantum state without affecting it through the state's influence on the classical gravitational field and hence can implement approximate quantum state cloning. Nonetheless, the theory does not allow superluminal signalling, although it does violate the quantum no-signalling principle. We further show that the classical gravitational field is generally not locally causal in the sense of Bell. We present several paths to test the model against low-energy quantum gravity in tabletop experiments.

Gradient Blindness in Adaptive Architecture Search for IQP Born Machines

Sebastian Wölckert, Gerhard Stenzel, Michael Poppel, Claudia Linnhoff-Popien, Jonas Stein

2611.24174 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Instantaneous quantum polynomial (IQP) Born machines learn a probability distribution from data with a circuit of commuting gates that a classical computer trains at hundreds of qubits. Adaptive algorithms grow a sparse circuit from a small seed by adding in every round the candidate gates with the largest loss gradient. Such algorithms never add a candidate whose gradient vanishes, so the choice of seed decides which circuits they can reach. Here we show that a candidate gate has a nonzero gradient for some angles of the circuit exactly when its generator is the sum of an odd number of linearly independent generators already in the circuit. The common seed of one-qubit gates therefore never adds a gate on an even number of qubits, which exact gradients on 12 qubits confirm. A seed of one-qubit gates plus the edges of the Chow-Liu tree sees every candidate, and its circuits match the full circuits on 12 and 16 qubits with 10 to 13 percent of their parameters. At 484 qubits, a heredity pool keeps the search over higher-order gates feasible, and the circuits grown from this seed reach a lower test loss than the dense two-body circuit with 6 percent of its parameters, although the higher-order gates add no gain.

Quantum Parallel Algorithm for Multivariate Trace Estimation with Applications

Honghong Lin, Yun Shang

2611.24147 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Estimating multivariate traces Tr(A1A2......Ak) is a fundamental task arising across diverse fields. In this paper, We develop a quantum algorithm for this problem tailored to near-term quantum devices. We access matrices by preparing their vectorized states. This access mode yields a tensor-network representation of the multivariate trace, which in turn guides the design of a parallel algorithm. The resulting circuit has depth dominated solely by that of the input oracle and independent of the number of matrices k, at the cost of a qubit count scaling as Θ(k)-a trade-off between circuit depth and circuit size. Moreover, the circuit exhibits a simple modular structure that allows explicit distribution over O(k) devices. We further establish efficient preparation circuits for a broad range of matrix classes, demonstrating the wide applicability of our approach. we present two applications: spectral sum estimation and a quantum implementation of the classical Lanczos method. Both reduce the target problem to sums of multivariate traces, thereby avoiding the construction of matrix polynomial transformations and achieving two levels of parallelism. For certain matrix classes, the resulting algorithms reduce circuit depth by a factor equal to the degree of the approximating polynomial. The shallow circuit depth and distributed implementation make our algorithms particularly suitable for near-term devices.

Stabilizer models of achiral abelian topological orders

Marvin Qi, Wilbur Shirley

2611.24105 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We construct continuous-variable stabilizer codes realizing every achiral 2D abelian topological order, both bosonic and fermionic. Starting from an arbitrary signature-zero integer $K$-matrix, we show that the corresponding topological order can be obtained by condensing a lattice of dyons with trivial pairwise mutual braiding in an $\mathbb{R}^N$ gauge theory. We implement this condensation microscopically by gauging a non-on-site 1-form symmetry of the $\mathbb{R}^N$ toric code.

Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters

Mojtaba Asadollahi, Danial Khajehzadeh, Abolfazl Ramezanpour

2611.24089 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum annealing is a promising quantum algorithm for dealing with computationally hard optimization problems. Currently available hardware can implement the algorithm for a significant class of Hamiltonian problems. However, its performance is especially limited in discontinuous quantum phase transitions, where the energy gap shrinks exponentially with system size. In this paper, we introduce an extension of quantum annealing to a quantum neural network and study its performance in a number of prototypical optimization problems. In particular, we observe that already a random quantum annealing network of width W = 2 can exponentially reduce the number of evolution layers or depth of the annealing process in the quantum search problem. By tuning the network parameters the search problem can be solved with exponentially small errors by a quantum perceptron of depth L = 1 and width W = 2. The findings show that width of a quantum annealing network is critical to enhance the success probability of the algorithm by providing a larger and learnable evolution space for the annealing process.

CCZ gate beyond the strong Rydberg-blockade regime

Snigdhadev Ray, Sinchan Snigdha Rej

2611.24078 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We present a protocol for implementing a controlled-controlled-Z (CCZ) gate on a neutral-atom platform, employing three individually addressable atoms confined in a linear array of optical tweezers and operating under finite Rydberg-Rydberg interaction (RRI). The protocol combines successive excitation of the Rydberg atoms with analytically determined pulses and uses two Rydberg levels to access opposite-sign interaction shifts. We show two different paths to get the conditional phase in the target atom: a pair of target pulses with opposite phases and a single detuned target pulse followed by a local phase correction. We derive analytical expressions for the time-integrated Rydberg populations to calculate the associated decay errors and also evaluate gate performance through master-equation simulations. Numerical comparisons with a fast Rydberg-antiblockade (RAB)-based CCZ protocol show improved gate performance at larger interatomic separations within the parameter regime considered. Monte Carlo sampling further quantifies the sensitivity to thermally induced position fluctuations. These results identify the tradeoffs between gate duration, Rydberg-state exposure, and interaction sensitivity, providing an analytically specified route to native three-qubit phase gates beyond the strong-blockade regime.

Reliability of quantum communication over erasure channels

Hongyu Mao, Kun Fang

2611.24054 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum information can be reliably transmitted at rates below the quantum capacity with an error that vanishes as the number of channel uses grows. The reliability function characterizes the optimal exponential decay rate of this error. For quantum erasure channels with a prime input dimension, we determine the reliability function exactly at all positive communication rates below capacity that meet or exceed an explicit critical rate. Notably, stabilizer coding strategies attain this optimal reliability throughout this regime.

Odd-Even Effects on Liouvillian Spectra and Relaxation Dynamics in Boundary-Driven Spin Chains

Zhen-Yu Zheng, Shu Chen

2611.24053 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate odd-even effects on Liouvillian spectra and relaxation dynamics in boundary-driven XY and cluster chains. With the bulk couplings and boundary dissipation rule fixed, the parity of chain length determines whether non-decaying oscillatory modes exist. Consequently, odd- and even-sized chains exhibit qualitatively different dynamical behaviors. We trace this mechanism to the coupling between bulk Majorana paths and the boundary jump operators. An isolated path supports undamped modes, and products of an even number of its Majorana operators span a non?decaying subspace of even operators. This structure yields nonzero purely imaginary eigenvalues of the Liouvillian and persistent contributions to bond correlations or magnetization after preparation in product states. The mechanism extends to cluster interactions of even range under a fixed boundary dissipation rule. The existence and frequencies of the persistent modes are independent of the magnitudes of the positive boundary dissipation rates. Our results unveil how chain parity controls the existence of persistent dynamics.

Accelerating Quantum Error Correction Simulations under Coherent Noise with Compiled Clifford-Augmented Matrix Product States

Jiale Huang, Yaojian Chen, Ke Liu, Dingshun Lv, Mingpu Qin

2611.24044 • Nov 18, 2026

QC: none Sensing: none Network: none
View Full Abstract

Reliable assessment of quantum error correction requires understanding how coherent errors affect logical performance. Although tensor networks naturally capture coherent interference, entanglement growth and large qubit counts make repeated sampling costly. Here we develop a compiled Clifford-Augmented Matrix Product State (CAMPS) framework that reuses Clifford transformations across shots, recycles qubits released by measurements, evolves a compressed residual state, and accelerates sampling through rotation fusion and compilation tailored to the MPS layout. Surface-code benchmarks under fixed-sign coherent noise yield accurate logical error estimates at small bond dimensions, while random-sign simulations up to distance $d=9$ and on the $[[72,12,6]]$ bivariate bicycle code match the Pauli-twirling approximation results. Compared with uncompiled CAMPS, compiled CAMPS converges at smaller bond dimensions and achieves order-of-magnitude sampling speedups at equal bond dimension, opening a scalable route to studying coherent error propagation in larger fault-tolerant circuits.

Expressivity of two-dimensional Gaussian fermion tensor network states

Pok Man Tam, William Musk, Zhehao Dai

2611.23227 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Tensor network states (TNS) provide a family of efficiently compressed approximations to physically relevant many-body quantum states. An important quantity that characterizes the computational resources required by a TNS is its bond dimension. While in one dimension an area law for the Renyi-0 entropy guarantees an exact matrix product state representation with a bond dimension independent of the system size, an analogous statement does not hold for general states in two dimensions (2D). This leaves open the question of how the expressivity of 2D TNS is related to the entanglement properties of the states they represent. In this work, we focus on two families of 2D translation-invariant Gaussian fermionic states: single-band BCS superconductors and half-filled two-band insulators (including semimetals). For each family, we prove that an area law for the Renyi-0 entropy is equivalent to having an exact Gaussian fermionic TNS representation with a finite bond dimension determined by the Renyi-0 entropy. We also establish equivalent characterizations in terms of compactly supported Wannier-type orbitals and the momentum-space wavefunction, relating the spatial extent of these orbitals and the structure of the wavefunction to the required bond dimension.

From nonlocal correlations to local symmetry breaking: Asymmetry dynamics of crosscap states

Konstantinos Chalas, Pasquale Calabrese, Colin Rylands

2611.23224 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Under unitary dynamics preserving a global symmetry, bipartite entanglement typically grows while an initially broken symmetry is locally restored. Here, we show that this conventional scenario can be reversed when symmetry-breaking coherence is initially encoded in long-range entanglement. We investigate this phenomenon in a family of charge deformed crosscap states, characterized by antipodal entangled pairs with tunable entanglement and symmetry breaking. We first characterize their static properties, finding a Page-like entanglement profile and an entanglement asymmetry that vanishes for subsystems smaller than half the system size, but grows logarithmically for larger subsystems. For symmetric subsystems, we also analyze the symmetry-resolved entanglement and investigate how it evolves as the subsystem is continuously deformed away from a symmetric partition. Following a quench to a free-fermion tight-binding chain, we uncover an unconventional dynamics in which the entanglement entropy decreases whereas the entanglement asymmetry increases, so that initially symmetric subsystems dynamically develop local symmetry breaking. This behavior is quantitatively captured by a quasiparticle picture describing the propagation of antipodal correlations. Our results reveal how symmetry-preserving dynamics can redistribute globally encoded symmetry-breaking coherence, making it locally accessible, and establish the initial entanglement structure as a key ingredient in determining the fate of local symmetries out of equilibrium.

Modeling quantum information scrambling in realistic protein NMR experiments

Alec F. White, Joseph Haslehurst, Daniel R. Moberg, Justin Provazza, Nicholas C. Rubin, Thomas E. O'Brien, Christian Bengs

2611.23213 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Out-of-time-order correlators (OTOCs) are important probes of operator spreading and information scrambling, and have recently been proposed as a means of extracting molecular structural information through nuclear magnetic resonance (NMR). Realizing this potential requires accurate modeling of OTOCs in complex molecular environments within experimentally relevant settings. Here, we develop an end-to-end computational pipeline connecting molecular structures to OTOC dynamics in protein systems. Our framework incorporates molecular motion through molecular dynamics simulations, orientational averaging appropriate for powder samples, and spin-network truncation, using an experimentally realizable double-quantum effective Hamiltonian. We apply this framework to a dataset of over 350 carbon-carbon spin pairs across 10 protein systems, spanning interspin distances of 5-17 A. We find that OTOC arrival times scale approximately linearly with interspin distance, revealing system-dependent operator-spreading velocities that enable correlations to propagate over extended distances within milliseconds. Our sensitivity analysis further shows that individual OTOCs predominantly constrain a single structural parameter, primarily associated with interspin distance. Together, these findings highlight the potential of OTOCs to probe spatially extended spin correlations on timescales compatible with solid-state NMR experiments.

Local interference algorithms for observables in large random circuits

Philippe Suchsland, Brayden Ware, Vladislav D. Kurilovich, Vadim Smelyanskiy, Kostyantyn Kechedzhi

2611.23207 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

In quantum dynamics, it is generally believed that interference effects lead to a sign problem for classical Monte Carlo sampling methods, rendering sampling ineffective. In this paper we show that this is generically not the case for the task of simulating the evolution of observables in random instances of circuit dynamics. Specifically, we consider two examples of observables which give large signals despite the randomness of the dynamics: first order out-of-time-ordered correlators (OTOCs) in unstructured random circuits without conservation laws and time-ordered charge-charge correlators (TOCs) in particle number-preserving random circuits. We show that these observables can be approximated by classical stochastic processes and that these approximations can be systematically improved with a series expansion that incorporates coherent corrections associated with clusters of gates. We design and implement algorithms that combine Monte Carlo sampling and tensor network methods to approximate the series. We observe numerically that the computational complexity of approximating TOCs and OTOCs scales polynomially in the circuit size and in the target precision. We study the accuracy of these algorithms by directly mapping their ensemble-averaged errors to partition functions of replica statistical models, allowing for perturbative analysis and numerics in $1$d brickwork geometries. Our theoretical analysis explains the empirical observation of polynomial complexity of these algorithms and is consistent with polynomial complexity extending to arbitrarily small precision and to the thermodynamic limit.

Nonlinearity-preserving quantum simulation of flows in the early fault-tolerant regime

Hansol Noh, Unam Oh, Sangkyu Baek, Doyeol, Ahn

2611.23196 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Ensemble prediction of nonlinear dynamics propagates a probability density whose linear transport equation retains the nonlinear drift, but grid-dependent circuit costs leave end-to-end feasibility in early fault-tolerant quantum computing unresolved. We couple polynomial reduced-order models fitted by sparse identification of nonlinear dynamics to Walsh-synthesized Koopman-von Neumann (KvN) transport and surface-code resource estimation. At fixed model dimension and drift degree, per-step transport rotation counts scale polylogarithmically with cells per reduced coordinate. Balancing model accuracy against circuit costs makes reduced-model polynomial degree a design variable for early fault-tolerant quantum simulation. For a cylinder wake approaching saturation, preparation, propagation and sampling to 1% relative root-mean-square field error against the radial model are estimated to take 1.62 h on about 560,000 physical qubits. Estimated three-coordinate wake runtimes span hours to weeks below one million qubits. IBM hardware experiments demonstrate nonlinear radial KvN transport for this wake, using reference circuits to mitigate noise.

Performance analysis of a Rydberg atom THz radiometer concept

Richard J. Murchie, Petronilo Martin-Iglesias, Julian Hofmann, Christophe Buisset

2611.23193 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

THz receiver technology lies between electronics and photonics; as such, its implementation is not as mature. This warrants investigation into alternative THz receivers such as Rydberg atom sensors, which are highly susceptible to electric fields. In particular, the conversion architecture has been demonstrated to coherently transduce thermal radiation. This system offers room-temperature operation and does not necessarily require a local oscillator at the frequency of the input signal. We provide an assessment of the feasibility of such sensors for THz radiometry within the context of Earth observation.

Quantum amplification with a linear quantum coupler

Changqing Wang, Yao Lu

2611.23188 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Josephson parametric amplifiers (JPAs) are essential components for quantum-limited microwave measurement, but their dynamic range is often constrained by Kerr and other pump-induced nonlinear effects. In this work, we systematically study the performance of a parametric amplifier based on the linear inductive coupler (LINC). Starting from the driven-circuit Hamiltonian, we derive the effective three-wave-mixing amplifier model, including leading flux-driven nonlinear corrections relevant to realistic operation. We analyze the resulting gain response, saturation behavior, and intermodulation distortion, comparing them with representative state-of-the-art JPA designs. Our results show that the symmetry-protected structure of the LINC suppresses static Kerr nonlinearity. Moreover, suitable circuit-parameter optimization can further reduce the dressed-squeezing and driven-Kerr effects, leading to considerable improvements in power-handling metrics. These results identify the LINC architecture as a promising platform for high-linearity Josephson parametric amplification.

Integral Tensor Isomorphism via Cubic Rings and Lattice Methods

Thomas Huffstutler

2611.23186 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We prove that isomorphism of integral $2\times3\times3$ tensors under $\mathrm{GL}_2(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z})$ is decidable in bounded-error quantum polynomial time. For a tensor $T=(A,B)$ with nonzero determinant form $\det(xA-yB)$, we use the parametrization of Wood by balanced modules to reduce the isomorphism problem to principality tests for compatible lattices, and use the algorithms of Bley, Hofmann, and Johnston to solve this in BQP. When the determinant form vanishes identically, we get either an integral $2\times2\times2$ core, or a polynomial kernel vector of degree one or two. The linear-kernel case yields another compatible lattice problem, while the quadratic-kernel case reduces to a fixed system of polynomial congruences and unimodular lifting. A quantifier-elimination argument decides these congruences in deterministic polynomial time given the prime factorization of the modulus, which quantum integer factorization supplies. Finally, we show that zero padding preserves integral $2\times2\times2$ tensor isomorphism, yielding a polynomial-time reduction from real-quadratic principality to the identically singular $2\times3\times3$ problem.

Teleportation of Logical Qubits using Lattice Surgery with Superconducting Circuits

Luca Hofele, Yongxin Song, Áron Márton, Ian Hesner, Ilya Besedin, Jakob Ekert, Jonathan Trebst, François Swiadek, Felix Henrich, Dante Colao Zanúz...

2611.23165 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Demonstrating a quantum advantage when solving large-scale computational problems on a quantum computer requires the correction of errors that occur due to limitations in control accuracy and coherence. Using the concept of quantum error correction, fault-tolerant logical qubits can be realized and manipulated with logical single- and two-qubit gates. In this paper, we experimentally analyze fault-tolerant lattice-surgery, which is a key primitive that enables operations between logical qubits realized in the surface-code. Using this primitive, we demonstrate the teleportation of logical states between two distance-three logical qubits realized in a superconducting circuit composed of 41 physical qubits. Throughout this process, we study the step-by-step transfer of logical information from a source to a target logical qubit by characterizing the time evolution of logical observables. We find that repeated execution of stabilizer measurements, after merging two surface-code patches, restores fault tolerance and yields increased fidelity of the teleported state. When optimizing the protocol in terms of gate count and sequence duration, we observe further improvements in fidelity. Our work offers new insights into the optimization of fault-tolerant lattice-surgery operations, while also providing a comprehensive description of the physical device and gate sequences used. We expect the efficient implementation of increasingly complex logical circuits to enhance the performance of future fault-tolerant quantum computers.

Quantum simulation of neutral-meson mixing and decay on a reprogrammable photonic processor

Mohd Abu Bakar Siddique, Abrar Al Shadid Abir, A. K. M. Rakib, Mohammad Abrar Kabir, Aseer Imad Keats, Rakibul Hasan Sagor

2611.23156 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Neutral mesons oscillate into their antiparticles while decaying, so their dynamics is generated by a non-Hermitian effective Hamiltonian which a quantum simulator restricted to unitary operations cannot implement directly. We propose a reprogrammable photonic processor that simulates this open-system evolution through dilation and analyze it at the circuit level. The effective Hamiltonian is reconstructed exactly from measured lifetimes, mass and width differences, and the CP-violation parameter $|q/p|$. Through a singular-value decomposition and a single ancilla that encodes the total decay probability, its propagator is embedded in a four-mode unitary, which is compiled at each time step into a rectangular interferometer on a hexagonal mesh of tunable Mach-Zehnder units. Circuit simulations including coupler, propagation, and bend losses show that one fixed device, reprogrammed only through its control voltages, reproduces the flavor oscillation and decay of neutral kaons and of $B_d$ and $B_s$ mesons, with $x=Δm/Γ$ from 0.77 to 26.9. Over 500 time steps per system, the mean fidelity lies between 0.99979 and 0.99982, and no step falls below 0.9996. Because every optical path crosses nine tunable units, uniform insertion loss reduces only the transmitted power, whereas unit-to-unit loss variations lower the fidelity quadratically, $1-\langle F\rangle \simeq 0.08σ^2$ for a loss standard deviation $σ$ in dB. A leading-order analysis traces this coefficient to the routing of light through the mesh, reproduces the fitted value to within 2%, and explains why it is the same for all three mesons; a mean fidelity of 0.999 tolerates $σ\approx 0.11$ dB. The ancillary outputs encode the total decay probability without postselection, and the reported probabilities are normalized to the collected optical power.

Non-equilibrium topological order from Floquet anyon proliferation in the toric code

Francesco Petiziol

2611.23132 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We analyze the dynamics of Kitaev's toric code in Floquet quenches where the drive coherently creates and propagates fermionic $f$ anyons. We show that the long-time state departs from pure-state topological order but retains long-range entanglement, thereby realizing a Floquet analog of intrinsic mixed-state topological order. As a key result enabling this analysis, we derive decompositions of the entanglement entropy and logarithmic negativity that separate the ground-state value, including topological terms, from a contribution given by the driven quasiparticles. For a drive inducing non-interacting $f$ dynamics, these decompositions allow us to leverage numerical methods for free fermions and to link the emergence of the proposed long-time ordered state to the equilibration of $f$ anyons to a periodic Gibbs ensemble. For drives inducing Floquet eigenstate thermalization of $f$, our results suggest a scenario where Floquet heating of the $f$ sector stabilizes a genuine non-equilibrium topological phase, in contrast with the usual view of heating as an obstacle to order in periodically driven systems.

Causality, determinism and predictability: Probing nature through classical and quantum eyes

Mundur V N Murthy, Usha Devi A R

2611.23128 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

In this article, mainly focussed on students and interested readers, we discuss how the understanding of causality, determinism and predictability is transformed as we move from the classical world view to the quantum description. We first explain how determinism and predictability operate in classical dynamics and outline the notion of causality. A paradigm shift occurs within the framework of quantum mechanics where we have to revisit, and even give up, the notions of determinism, predictability and maybe even strict causality. An engrossing and fascinating debate ensues, after the formulation of quantum mechanics among the giants of physics like Einstein, Bohr, Heisenberg, Pauli, and many others. While some questions have been settled in the last century in favour of quantum world view, there are still many open questions, most important of which is the role of gravity in shaping events within the quantum framework.

Optimal Min-Entropy Estimation with High Probability

Qisheng Wang

2611.23116 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Min-entropy plays a fundamental role in assessing the unpredictability of randomness sources. In particular, NIST SP 800-90B specifies min-entropy estimation as a key procedure for entropy sources used in cryptographic random bit generators, illustrating the practical importance of reliable min-entropy estimation. In this paper, we settle the sample complexity of min-entropy estimation with high probability in both the classical and quantum cases. Specifically, for min-entropy estimation with additive error $\varepsilon$ and probability at least $1-δ$, the sample complexity is $Θ(d\log(d/δ)/\varepsilon^2)$ for classical distributions on $d$ symbols and $Θ((d^2+d\log(1/δ))/\varepsilon^2)$ for quantum states on a $d$-dimensional Hilbert space. Our results admit short and simple proofs.

Performance of Fusion-Based Quantum Computing with Imperfect Photon Indistinguishability

Katia Hakem, Grégoire de Gliniasty, Nathan Shettell, Paul Hilaire, Stephen C. Wein

2611.23083 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Fusion-based quantum computation (FBQC) is a promising route to fault-tolerant photonic quantum computing, connecting small entangled resource states through linear-optical fusion measurements. While logical encoding can substantially improve resilience to photon loss, whether these benefits extend to other noise remain an open question. In this work, we show that this is not generally the case when accounting for partial photon distinguishability during resource state generation and fusion measurement. We develop hardware-motivated noise models to capture these effects and investigate their impact on fault tolerance in the 6-ring fusion network. We compare unencoded and Shor(2,2)-encoded resource states prepared using all-photonic and emitter-assisted repeat-until-success (RUS) schemes. For the all-photonic construction, encoding reduces the distinguishability threshold from 0.136% to 0.08%. In contrast, the RUS construction tolerates more distinguishability, with comparable unencoded and encoded thresholds (0.256% and 0.271%, respectively). These results expose a fundamental limitation of evaluating logical encodings under idealized resource-state assumptions and demonstrate that resource-state generation can critically determine the fault tolerance of photonic architectures.

Unique continuation for the Pauli-Fierz Hamiltonian

Mihály A. Csirik

2611.23062 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We prove a unique continuation property for eigenstates of the Pauli-Fierz Hamiltonian, viewed as functions of the electron configuration with values in the spin-photon space. The vector potential may lie in $L^6_\mathrm{loc}$, with its divergence, curl, and the scalar potential in $L^p_\mathrm{loc}$ for some $p>2$. As an application, we prove a Hohenberg-Kohn theorem at positive coupling strength: the spin-summed ground-state density and combined current density determine the external potentials up to a gauge transformation and an additive constant.

Frequency Multiplexing of Purcell-Enhanced Optically Coherent NV Centers

Alok Gokhale, Marco E. Stucki, Malo Bezard, Maarten H. van der Hoeven, Kilian Unterguggenberger, Gregor Pieplow, Tommaso Pregnolato, Julian M. Bopp, L...

2611.23046 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Integrating optically coherent quantum emitters into nanophotonic structures is key to scalable quantum networks. Realizing them with nitrogen-vacancy (NV) centers in diamond is hindered by the degradation of optical coherence accompanying nanofabrication. Here, we overcome this challenge by integrating multiple NV centers into a monolithic diamond photonic crystal nanocavity while preserving near-lifetime-limited optical coherence. We observe linewidths as narrow as 19 MHz, enabling the frequency multiplexing of spectrally distinct NV centers within a common cavity mode, while maintaining charge-state stability over several minutes under resonant excitation. Tuning the cavity into resonance with the NV zero-phonon line enhances the optical emission, consistent with Purcell enhancement predicted by finite-element simulations. Additionally, individual cavities can be independently brought into resonance with NV zero-phonon lines on the same chip. These results combine bulk-like optical coherence with frequency multiplexing and cavity-enhanced emission, establishing a scalable nanophotonic platform for NV-based quantum network nodes.

PRISM: A Logical-Physical Boundary Compiler for Dual-Rail Qubits

Evan McKinney, Kun Liu, Harshvardhan K. Babla, Robert J. Schoelkopf, Yongshan Ding

2611.23009 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum computers can encode each logical qubit across multiple physical degrees of freedom so that errors on the physical qubits can be detected or corrected. A compiler must then translate each logical gate into native instructions, and one gate can have several equivalent realizations that interact through different wires. Routing moves those wires, so a realization chosen before routing can force SWAPs that another would avoid, making code expansion and physical routing a phase-ordering problem. PRISM therefore keeps each gate's realizations open across the logical--physical boundary and commits to one only when routing reaches a layout that can execute it. We formalize which physical circuits implement a gate, which respect the fault model, and which the compiler keeps, and define when a gate can execute under a layout. For dual-rail cavity qubits, logical $\mathrm{CR}_z$ has four loss-admissible realizations, one per rail pairing, and its logical availability graph is exactly the simple quotient of the occupied device graph by the rail pairs. Across 25 workloads with 7 to 25 logical qubits on three device graphs, PRISM reduces routing SWAPs by 20.4--30.8\% and physical depth by 8.8--10.1\% relative to a greedy search that fixes each realization before routing. On the grid and hexagonal lattice, the SWAP reductions hold through 32 logical qubits. By shortening routes, PRISM also reduces photon loss on device models and therefore needs 44.3\% fewer attempts per retained shot at 16 logical qubits, as a geometric mean over workloads and device graphs, and it lowers decoded logical error in a three-round Steane memory under skip-gate leakage.

Variable-length MDI QKD under source imperfections and local randomization over horizontal links

Gabriele Staffieri, Martí Sales-Moragues, Carlos Pascual-García

2611.23000 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum key distribution (QKD) provides security guarantees that hold despite device imperfections and finite-size effects. We address these challenges in measurement-device-independent (MDI) QKD, combining its intrinsic untrusted detection with an imperfection model for Alice's and Bob's sources via fidelity bounds. We establish variable-length general security under the Marginal-constrained Entropy Accumulation Theorem (MEAT), estimating the relevant Rényi entropies through conic optimization. We evaluate our model under a horizontal channel link, reporting secret keys for blocks as small as n~3x10^4 rounds under atmosphere-free conditions, and show that compensating for unequal channel attenuation through appropriately chosen transmitted amplitudes improves performance in asymmetric configurations, enabling communication distances beyond 80 km for commercial satellite systems.

Dynamical Decoupling via Continuous Unitary Design

Xiaodong Yang, Jun Li

2611.22933 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Dynamical decoupling is a cornerstone of quantum control for protecting and engineering quantum systems. However, conventional schemes rely on idealized instantaneous pulses, limiting their performance under realistic finite-duration and imperfect controls. To overcome this limitation, we establish a dynamical decoupling framework based on continuous unitary designs, which intrinsically suppresses arbitrary static noise during continuous control. We further derive closed-form phase conditions to suppress Rabi-amplitude errors, unifying universal decoupling, finite-pulse compatibility, and control-error robustness within a single analytical framework. We experimentally validate our approach on a superconducting quantum cloud platform, demonstrating significantly extended coherence times and the highest robustness against Rabi-amplitude errors and detuning among the tested sequences.

Non-Invertible Quantum Cellular Automata I: Microscopic Definition of Non-Invertible Symmetries

Sahand Seifnashri, Shu-Heng Shao

2611.22928 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We introduce non-invertible quantum cellular automata (QCAs), defined as locality-preserving quantum channels that are dualizable and pure. This provides an operator-algebraic definition of non-invertible symmetries of quantum lattice systems, formulated in terms of their action on local operators. Focusing on quantum spin chains, we motivate these defining conditions and conjecture that every such quantum channel admits a realization by dualizable topological defects or, equivalently, by dualizable sequential quantum circuits. We construct a broad class of examples, including on-site non-invertible symmetries that are anomalous, as well as higher-dimensional examples. In Part II of this work, we reconstruct topological defects whose boundary algebras yield an index theory that classifies non-invertible QCAs up to blend equivalence.

Problem-adjusted $X$-mixer eigenstates for improved QAOA

Matvii Kistaiev, Georgios Korpas, Bart Partoens, Matthias Van der Donck

2611.22916 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We show that the use of problem-adjusted excited eigenstates of the $X$-mixer Hamiltonian can be beneficial for the performance of the Quantum Approximate Optimization Algorithm (QAOA) when applied to problems with degenerate ground states. We show that this advantage persists in the presence of quantum gate and readout noise, with the problem-adjusted excited initial states achieving better optimal performance than the standard ground state initialization. The realized advantage depends on the number of QAOA layers and whether or not the initial state has a reasonable time evolution path into the ground space of the problem Hamiltonian. We also explain how to prepare these problem-adjusted $X$-mixer eigenstates exactly, as well as how to approximate them using a linear combination of ladder operators. Finally, we discuss how the power of these initial states can be applied to any problem Hamiltonian regardless of the degeneracy of its ground state by making use of a Grover-style mixer Hamiltonian.

Entanglement cost and classical capacity of multimode Gaussian states and channels

Yuan Gao, Gerardo Adesso

2611.22915 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Gaussian states and operations are central to continuous-variable quantum information and communication. For systems with any finite number of modes, we prove that entanglement of formation, Gaussian entanglement of formation, and entanglement cost coincide for every finite-energy bipartite Gaussian state. Their common value is strongly superadditive and lower-bounds entanglement of formation and entanglement cost for arbitrary non-Gaussian states with the same covariance matrix. We then determine the entanglement cost of every multimode Gaussian channel as well as its classical capacity under a mean energy constraint. These quantities reduce to Gaussian covariance optimizations, and the capacity is attained by pure Gaussian signals with Gaussian displacement modulation, independently across channel uses. The proof combines geodesic convexity of entanglement for pure Gaussian states with a relative-entropy inequality for arbitrary states. We also obtain a closed formula for the entanglement cost of a family of four-mode bound entangled states.

Development of a Discrete Variable Representation of a Field-Adaptive Hermite Basis for Accurate Modeling of Magnetically Confined Systems

Athul Tom, Pratyush Bhattacharjya, Sangita Sen

2611.22906 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Accurate magnetic-field evolution of spectra requires a common wavefunction representation that consistently describes multiple states across different field regimes. Discrete Variable Representation (DVR) methods combine accurate basis-based kinetic-energy evaluation with flexible real-space potential representation, enabling arbitrary non-analytic potentials to be treated. Here, we develop a magnetic-field-dependent Hermite function-based (Hermite-B) DVR that adapts naturally to magnetic confinement, efficiently representing compressed wavefunctions across a wide range of field strengths while remaining centered in regions relevant to the scalar confinement potential. This ensures accurate treatment of the field-dependent kinetic energy while addressing two key challenges: maintaining accuracy from the Zeeman to Landau regimes and accommodating diverse confinement potentials. We also introduce a spatial restriction scheme that confines Hermite DVR grid points to a fixed-length domain, enabling compact representations for smooth potentials. The method is benchmarked for two-dimensional quantum dots in perpendicular magnetic fields against analytical models and compared with finite-grid, sine DVR, and field-free Hermite DVR calculations. The performance of field-independent DVR methods for magnetically confined systems is also investigated for the first time. Excellent agreement with exact analytical spectra and wavefunctions is obtained, with Hermite-B requiring the fewest basis functions and smaller Hamiltonian matrices, improving computational efficiency. Applications to arbitrary confinement potentials and tilted magnetic fields demonstrate its versatility beyond analytically solvable systems. The proposed method offers a robust, accurate, and efficient framework for large-scale calculations of realistic semiconductor nanostructures and molecular systems in external magnetic fields.

Exact classical bounds of bipartite correlation Bell inequalities using improved branch-and-bound

István Márton, Erika Bene, Péter Diviánszky, Tamás Vértesi

2611.22893 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We present an improved branch-and-bound (IBB) algorithm for the exact computation of classical (local) bounds of bipartite correlation Bell inequalities. We strengthen pruning in the standard BB algorithm in two ways: a heuristic search based on see-saw iteration supplies a strong initial lower bound, and greedy row reordering of the Bell matrix reduces the tail bounds used during the exact search. An OpenMP implementation combines these improvements with shared-memory parallelism and dynamic work redistribution. Random-matrix benchmarks show substantial runtime reductions in matrix sizes, while explicit constructions demonstrate exact local-bound computations for square matrices up to $130 \times 130$ and rectangular matrices of sizes up to $81 \times 321$. Applications provide improved lower bounds on finite-order Grothendieck constants for $d=3,4,5,7$ and uniform-input XOR games with quantum-to-classical ratios exceeding $\sqrt2$. The method retains an exponential worst-case search for this NP-hard optimization problem, and its practical performance depends on matrix structure and tail-bound preprocessing depth.

Molecular energies from sparse quantum prolate diagonalization on a trapped-ion quantum processor

Davide Castaldo, Marvin Kronenberger, Marek Miller, Sélène Forget, Gemma C. Solomon, Kresten Lindorff-Larsen, Matthias Christandl, Markus Reiher

2611.22834 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We introduce sparse quantum prolate diagonalization (sparse QPD), which combines the original formulation of QPD [Phys. Rev. Res., 8(3), 033177, (2026)] with compressed sensing to exploit Hamiltonian spectrum sparsity for molecular systems. We show that sparse sampling reduces the sample complexity of QPD from $\mathcal{O}(N_s)$ to $\mathcal{O}(\log N_s)$, where $N_s$ is the number of sampled points of the autocorrelation function (i.e.\ distinct circuits), without increasing circuit depth at chemical accuracy. With a two-orbital active-space-embedded Hamiltonian for an interacting arginine--tryptophan residue pair in water as an example, we show that on the Quantinuum Helios trapped-ion quantum computer, sparse QPD resolves the Hamiltonian energies to chemical accuracy with circuits of up to 448 two-qubit gates. For a suitably large quantum processor, we demonstrate numerically in the weakly correlated regime that the method extends to larger systems.

Oblique incidence and non-commuting limits: a remark on the convergence of Fresnel integrals

G. C. Reali

2611.22823 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

The Gaussian integrals of quantum mechanics and of paraxial optics are oscillatory and only conditionally convergent. Textbooks usually make them converge by adding a small imaginary part to the time or by analytic continuation. We point out that the one-dimensional Fresnel integral converges by itself, while in two dimensions the result depends on the shape of the expanding domain: over squares it converges, over discs it oscillates for ever. The second case is the field of a uniformly excited plane of dipoles, which Feynman uses to explain the refractive index. Lai, Lau and Wong showed that at oblique incidence the integral converges and that normal incidence is recovered in the limit; we note that the two limits do not commute, and that this provides a transparent introduction to the regularization of the time-sliced path integral, where the ordering of the integrations in time plays the role of the physical prescription.

Depth-Dependent Collapse and Warm-Start Limits of a Symmetry-Preserving VQE for the J$_1$--J$_2$ Heisenberg Ring

Soumyadip Sahoo, Sahinur Reja

2611.22810 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Increasing circuit depth is expected to improve a variational quantum eigensolver (VQE). We show that this expectation can fail, and that curing the failure does not guarantee the exact ground state. We study a symmetry-preserving ansatz of SingleExcitationMinus gates, started from the Néel state, on the frustrated spin-$1/2$ $J_1$--$J_2$ Heisenberg ring with $N=10$ and $12$ sites. With random initialization the fidelity, energy error, half-chain entropy and total spin change abruptly at intermediate depth ($L\approx 9$ for $N=10$, $L=10$--$12$ for $N=12$), giving improvement, degradation and recovery, a double-descent-like shape. The circuit family is nested and the gradient stays finite, so this is an optimization failure, not a loss of expressibility or a barren plateau. A chained warm start, which extends an optimized shallow circuit with identity layers, removes the collapse and improves energy error and fidelity almost monotonically for most frustration values. However, near $J_2/J_1=0.60$ ($N=10$) and over $J_2/J_1=0.60$--$1.00$ ($N=12$) the warm start stalls at a fidelity of $\approx 0.50$--$0.58$, although the energy error is small and the total spin stays in the $S=0$ sector. Removing the non-monotonic depth dependence is therefore not the same as reaching the ground state, and low energy and a singlet-like state are not sufficient: the fidelity, entropy and total spin must be satisfied together. The conclusions are limited to the system sizes and frustration values studied.

How can every physicist become a Bohmian

Hrvoje Nikolić

2611.22798 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

The Bohmian interpretation of quantum mechanics is controversial because it attributes deterministic trajectories to microscopic particles. We propose a reformulation that sidesteps this controversy: rather than applying Bohmian mechanics at the microscopic level, we recast it as an effective deterministic description of the macroscopic pointer of a measuring apparatus, with no claims about the fundamental nature of the microscopic world. In this form, the Bohmian trajectory becomes a practical tool for visualizing the emergence of a definite measurement outcome, broadly acceptable to physicists who would otherwise reject the Bohmian program.

Time-Travel Paradox in a Bohmian Extension of Deutsch's Approach: Mandatory Tunneling as the "Banana Peel Mechanism"

Vladimir Nikitin

2611.22794 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We consider a self-prevention paradox in which a particle travels through a wormhole into its own past, encounters its younger version, and blocks its movement. In a specially constructed one-dimensional model, this collision rules out a classically self-consistent history. Deutsch's quantum approach can resolve such contradictions by imposing a self-consistency condition on the density matrix. The physical interpretation of this approach, however, remains debated. In particular, Dunlap argues that Deutsch's model presupposes the existence of interacting parallel worlds. Here we extend Deutsch's approach within de Broglie-Bohm theory by supplementing the self-consistency condition on the quantum state with a self-consistency requirement for the particle's ontic configuration. This allows us to consider the self-consistent evolution of an individual particle. In a two-channel, narrow-band Gaussian approximation, we find a self-consistent solution in which quantum tunneling is mandatory, despite its arbitrarily small probability in an ordinary scattering process. This realizes the "banana peel mechanism": to avoid a contradiction during a journey into the past, an event that would ordinarily be extremely unlikely occurs nonetheless.

Quantum-classical dynamical density functional theory for solvation dynamics

Paul Bergold, Irene Burghardt, Francesco Di Maiolo, Cesare Tronci

2611.22786 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We provide a unified modeling framework for thermalization and non-equilibrium spectroscopy in overdamped polar environments. This framework extends dynamical density functional theory to describe the coupled quantum-classical evolution of a molecular electronic subsystem and an overdamped polar solvent represented by a reaction-field coordinate. The nonadiabatic dynamics is formulated in terms of an operator-valued distribution obeying a quantum-classical Ehrenfest--Smoluchowski equation which exhibits nonlinear classical diffusion and non-increasing free energy, thereby retaining detailed balance. In contrast, a quantum-classical Liouville--Smoluchowski model with quantum-classical linear diffusion develops unstable long-time behavior and fails to reach a stationary thermal state. The method is applied to a two-level model of a polar dye in three different solvents: chloroform, dichloromethane, and dimethyl sulfoxide, each differing in polarity and dielectric relaxation time. Absorption and time-resolved emission spectra are obtained from dipole-dipole correlation functions, capturing the solvent-induced spectral broadening, the dynamic Stokes shift, and the time evolution of the emission bandwidth. The calculated solvent spectral response agrees well with the experimental relaxation trends of the three solvents.

Double-Bracket Quantum Algorithms for Preparing Multiple Excited States

Salahuddin Abdul Rahman, Özkan Karabacak, Rafal Wisniewski

2611.22774 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Many problems in quantum chemistry, many-body physics, and optimization require excited states of a Hamiltonian. Double-bracket quantum algorithms compile circuits recursively from evolutions under the Hamiltonian and a second operator, without a parameterized ansatz. They have been proposed for several tasks, such as diagonalization and the preparation of ground and thermal states. In this work, we extend this framework to excited states. Combining the ensemble approach with double-bracket flows, we introduce the Double-Bracket quantum algorithm for Multiple EXcited states (DB-MEX), which evolves $p+1$ orthonormal states toward low-lying eigenstates of the Hamiltonian with a single recursively compiled quantum circuit, so they remain orthonormal by construction. The circuit approximates a double-bracket flow of a weighted sum of projectors onto the evolving states, whose number and weights are design parameters. The number of states sets the highest targeted excited state, and the weights determine whether the algorithm prepares the $p+1$ lowest eigenstates, only the $p$-th excited state, or only the span of the $p+1$ lowest eigenstates. In the latter case, a post-processing step recovers the individual eigenstates from their span. We show that the double-bracket flow and, for small step sizes, its discretization converge to the target for almost all initial states, with explicit local rates given by products of weight and energy gaps.

Finite-key security of BB84 with passive receivers via reduction to active measurements

Go Kato, Akihiro Mizutani, Toyohiro Tsurumaru

2611.22768 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

In BB84 with passive receiver basis choice (passive BB84) and threshold detectors, the distribution of detection bases can depend on the incoming photon number. Its relation to BB84 with active receiver basis choice (active BB84), in which the basis is chosen using independent randomness, is therefore nontrivial. We establish a reduction theorem that expresses the secret-key-length formula for passive BB84 in terms of an active BB84 formula. The theorem allows a passive key-length formula to be obtained by simple substitutions into an existing active formula, without constructing a passive-specific security proof from scratch. It applies to key-length formulas derived using the Shor--Preskill, Koashi, and Renner approaches, because the reduction uses only properties shared by these approaches. Our result illustrates a modular approach that separates receiver analysis from the security proof and allows the proof of a common reference protocol to be reused for different implementations.

Catalytic imaginarity transformations

Ying-Hui Yang, Chen-Xi Wang, Xiao-Li Wang, Shao-Ming Fei

2611.22734 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

State conversion is a central problem in quantum resource theories. In this work, we investigate catalytic state transformations within the resource theory of imaginarity. Catalytic imaginarity transformations enable otherwise impossible state transformations using only real operations, assisted by an auxiliary system with imaginarity that is not consumed. For deterministic catalytic conversion, we show that a maximally imaginary pure state is the unique catalyst. This result contrasts with the resource theories of entanglement and coherence, where maximally entangled and maximally coherent catalysts cannot enable such deterministic conversions under their respective free operations. For stochastic-approximate catalytic conversion, if we do not require catalyst recovery upon failure, any pure state with imaginarity can serve as a catalyst, and we derive the optimal success probability. If the catalyst is required to be recovered exactly regardless of whether the catalytic state transformation succeeds or fails, the optimal success probability coincides with that without a catalyst, and thus no advantage arises from catalysis. If exact catalyst recovery upon failure is relaxed, we find a tradeoff relation between the success probability of a single conversion and the catalyst's residual imaginarity after transformation. When the initial state is re-prepared and the catalyst's residual imaginarity can be reused after failure, the success probability can be further improved over $N$ ($N \geq 2$) rounds of catalytic conversion, and we obtain the corresponding maximum overall success probability.

An exact separability criterion for the $J/ψΛ$ spin state in $Λ_b^0\to J/ψ\,Λ$ decays at the LHC

Yujie Li, Xiaofan Hu, Liming Zhang

2611.22701 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We derive an exact separability criterion for the spin state of the $J/ψΛ$ pair produced in $Λ_b^0\to J/ψ(\toμ^+μ^-)\,Λ(\to pπ^-)$ decays, taking into account the $Λ_b^0$ polarization at the LHC. Within the four-amplitude family $\{a_\pm,b_\pm\}$, the system is separable if and only if $(1+P_b\cosθ)a_+b_+=(1-P_b\cosθ)a_-b_-=P_b\sinθb_+b_-=0$, where $θ$ is the $Λ$ production angle defined in the LHC environment. We propose a profiled likelihood ratio test to probe entanglement in the full five-dimensional angular analysis. Idealized pseudoexperiments compare this test with a negativity test and a test based on the angular moments $M_7$ and $M_9$ for rejecting the $a_+=b_-=0$ hypothesis. At both $3σ$ and $5σ$ significance, the proposed test achieves a $90\%$ rejection power with about half as many signal events as the other two methods. These results support the prospects for entanglement evidence with samples on the existing scale and for observation with larger samples.

Tomographic reconstruction of non-Markovian Gaussian noise in continuous-variable photonic systems

Hamid Reza Naeij

2611.22693 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Memory effects in continuous-variable (CV) photonic systems can make standard Markovian Gaussian noise models inaccurate, even when the average noise strength is correctly calibrated. We propose a theoretical and simulation-based tomography framework for reconstructing such memory effects directly from time-resolved homodyne data. The method estimates an effective time-local Gaussian generator, represented by drift and diffusion matrices, using a regularized maximumlikelihood procedure constrained by complete positivity (CP) of the finite-time Gaussian channel. This description covers any Gaussian-preserving noise dynamics for which a well-defined time-local generator exists, rather than being restricted to particular noise mechanisms. Non-Markovianity is then diagnosed at the generator level through temporary violations of local CP-divisibility, rather than from time dependence alone. This distinction is important because ordinary nonstationary noise can remain CP-divisible, whereas genuine memory can produce a non-CP-divisible reduced generator while the accumulated channel remains physical. Numerical benchmarks covering memorydependent loss, nonstationary thermal excitation, and pseudomode-mediated memory show that the reconstruction distinguishes CP-divisible time-dependent noise from genuine non-CP-divisible dynamics and captures the corresponding signatures in the Gaussian covariance evolution. The framework therefore provides a practical route for diagnosing non-Markovian Gaussian noise in CV photonic quantum systems.

Proven optimality for LABS with quantum-classical branch and bound

András Czégel

2611.22688 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Low autocorrelation binary sequences (LABS) are the phase codes of pulse compression radar and the synchronization words of digital communication, and finding the sequence of a given length whose aperiodic autocorrelations have the smallest sum of squares is a hard binary optimization problem. The quantum optimization methods tested on LABS so far return good sequences, but they cannot show that a sequence is optimal or bound how far from optimal it may be. We show that a quantum optimization algorithm can deliver proven optimality. In our quantum-classical branch and bound, fixed-angle QAOA samples the Hamiltonians of the nodes of the search tree, its samples supply candidate sequences and the branching choice, and classical bounds prune the tree, so that the algorithm returns either a proof of optimality or, if it is stopped early, the best sequence found with a certified lower bound and gap. It works on the native quartic Hamiltonian without penalty terms, and its correctness does not depend on the sampler. With QAOA at depth p= 12 and at p= 1 and 1,000 shots per node, it proved the optima of all lengths from 2 to 30, where from length 27 on the root node is split without being sampled. Every run records both bounds against time, and its primal-dual integral measures its convergence. We claim no speedup.

Quantum Random Number Generators: principles, practical challenges and mainstream implementations

Lucas Q. Galvão, Gubio G. de Lima, Rubicely Francisco do Nascimento, José Batista de Souza Júnior, Davi Juvêncio G. de Sousa, Hugo Santos da Costa...

2611.22681 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum random number generators have become a cornerstone technology for modern digital cryptography, including key generation, quantum key distribution, and post-quantum cryptographic systems. While existing reviews typically concentrate on specific entropy sources or implementation platforms, a comprehensive perspective encompassing the complete QRNG pipeline remains largely absent. This work addresses this gap by providing a unified review of the theoretical foundations, practical methodologies, and technological developments that underpin modern QRNGs. We examine randomness from both classical and quantum perspectives and survey the principal discrete-variable and continuous-variable entropy sources, together with entropy estimation, randomness certification, extraction techniques, randomness enhancement protocols, and statistical validation methods. Beyond the fundamental components, we review representative implementations reported in the literature, comparing performance metrics, architectural trade-offs, integration strategies, and attainable generation rates across different technological platforms. Practical deployment challenges, including scalability, trust assumptions, hardware integration, and cryptographic adoption, are also discussed. By complementing the discussion with a broad survey of state-of-the-art implementations and applications, this review provides researchers with a comprehensive reference on the current landscape, open challenges, and future directions of quantum random number generation.

Complex quasiprobabilities as measurable temporal interference

Wenzheng Dong, Alexander Yosifov, Jinzhao Sun

2611.22643 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum dynamics can encode interference information that conventional correlation functions leave unresolved. Here we show that the imaginary component of the extended Kirkwood-Dirac quasiprobability reveals dynamical distinctions absent from out-of-time-order correlators (OTOCs) formed from two repeated Hermitian observables at infinite temperature. We interpret its real and imaginary components as complementary quadratures of interference between many-body echo amplitudes. We prove that the imaginary component vanishes for every unitary evolution if either projective measurement has two outcomes, whereas nonreal values arise for generic unitary dynamics when it has at least three (e.g., spin-1 systems). We develop an algorithm to reconstruct the full quasiprobability from covariances of local probe signals over repeated preparations of randomised initial states, using forward evolution and probe readout only. In a spin-1 chain, a nonzero imaginary signal distinguishes a real Hamiltonian $H$ from $-H$ despite identical corresponding OTOCs, and identifies opposite sides of a pair-conversion resonance at short times while dipolar and quadrupolar OTOCs remain nearly unchanged. These results show how temporal interference resolves dynamical ambiguities and provides additional constraints for Hamiltonian inference.

Resonance-induced quantum non-Gaussian states below criticality

Daniel J. Nader, Pavel Stránský, Jorge Chávez-Carlos, Pavel Cejnar, Radim Filip

2611.22640 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

The Quantum Rabi Model (QRM), consisting of a single qubit coupled to a harmonic oscillator, provides a paradigmatic platform for exploring critical phenomena investigated for their applications in quantum technologies. In the superradiant phase of the QRM with coupling strength above the critical point, the bosonic ground state exhibits temporally stable quantum non-Gaussian features. However, the quantum non-Gaussian features of such superradiant ground states can be fragile against loss during preparation. Here, we show that persistent quantum non-Gaussian features can instead be realized below the critical point through weak periodic qubit modulation. We analyze an adiabatic ramp protocol in which the modulation amplitude is gradually increased, allowing the system to approximately follow the instantaneous Floquet state. When the modulation period is tuned close to Poincaré-Birkhoff resonances, the resulting state exhibits pronounced quantum non-Gaussian features in the directly measurable Wigner function with a complex phase-space structure that is considerably more robust against loss than that of the superradiant ground state. The protocol of adiabatic ramps provides an attractive route for generating long-lived quantum non-Gaussian effects below the critical point.

A Quantum Support Vector Regression Framework for Missing Data Imputation in Ship Performance Data

Daniel Maroto Sanchez, Christian Velasco-Gallego, Miriam Bastante Chichon, Jaime Álvarez-Benayas, Tsoulakos Nikolaos, J. A. Bravo-Montes

2611.22635 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

The Internet of Ships enables vessels to generate vast amounts of data, yet missing values remain a persistent issue. To the best of the authors' knowledge, existing imputation techniques in this domain rely exclusively on classical machine learning. This study investigates quantum support vector regression (QSVR) for imputing missing values in ship performance data. Classical support vector regression and QSVR models based on different quantum feature maps are compared for estimating marine fuel consumption under varying levels of data availability. The case study uses real-world data from a Panamax bulk carrier, covering 37 variables across six categories. Three experiments are conducted: exploratory analysis with three input features, scalability analysis with increasing dimensionality (3 to 18 features), and comparative evaluation under a selected representative configuration. Across all scenarios, both classical and quantum approaches captured the relationship between the inputs and the main-engine fuel-flow rate, maintaining strong imputation performance even under severe data scarcity. ZZFeatureMap_1 achieved the highest average R2 (0.991 in the performance comparison conducted with 60% of the dataset, 90% missing data, and 14 input features, for instance) and the lowest aggregate imputation errors, while the radial basis function kernel was the strongest classical baseline, delivering highly competitive results.

Measurement-Conditioned Bloch-Sphere State Steering with a Continuous-Variable Pointer

Necati Çelik

2611.22633 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate measurement-conditioned state steering of a qubit coupled to a continuous-variable pointer through a state-dependent displacement interaction. A position measurement on the pointer induces a nonunitary conditional transformation of the qubit, allowing its post-measurement state to move along a trajectory on the Bloch sphere. We derive the conditional state, the measurement-outcome distribution, and the corresponding Bloch-sphere coordinates. For a real Gaussian pointer, the conditional state follows a meridian, whereas a phase-engineered Gaussian pointer produces a trajectory with a measurement-dependent azimuthal angle. We further describe outcome-dependent unitary feedback for preparing a prescribed target state from a known initial qubit state. We distinguish this state-preparation task from implementing a universal deterministic single-qubit gate, which does not follow from the proposed interaction and measurement alone. Finally, we derive the quantum Fisher information of the joint qubit--pointer state for estimating the displacement-generating parameter and discuss the implications of pointer squeezing, phase engineering, and experimental implementation. The results provide a framework for analysing conditional Bloch-sphere steering using continuous-variable measurement resources.

Quantum speed limits from symmetries: A numerical analysis

Santana Lujan, Marco Wiedmann, Daniel Burgarth

2611.22630 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Target-specific quantum speed limits (QSLs) bound the minimal time required to realize a given operation. Recent theoretical work derives these limits directly from the symmetries of the dynamical Lie algebra of the control system and a symmetry-restoring perturbation, bypassing the need to solve the equations of motion. In practice, however, identifying a suitable symmetry and a perturbation that restores it demands strong physical intuition and offers no guarantee of tightness. We show that, for any given symmetry, the minimal restoring perturbation is the solution of a convex semidefinite program, which can be solved to global optimality and thus yields the tightest achievable speed limit for that symmetry. This semidefinite program is one building block of our numerical method, alongside an explicit computation of the space of admissible symmetries and a search over this space. Since this search is non-convex, it is addressed with gradient-based optimization, black-box heuristics, or the injection of physically motivated candidate symmetries. We apply the method to three examples: a two-qubit CNOT gate, a SWAP on a spinless-particle chain, and a Dicke state preparation on a qubit ring. Our results improve on previously known symmetry-based bounds, most notably for the SWAP, where solving the semidefinite program for the known analytical symmetry tightens the bound by a factor of approximately 2.5. For the Dicke state preparation, however, the bounds decrease with system size, which we trace back to a symmetry-independent perturbation ceiling. This work provides a reproducible numerical procedure for constructing target-specific quantum speed limits directly from the system Hamiltonians and the target operation.

Entanglement Lower Bounds for Symmetric Quantum Circuits

Davi Castro-Silva, Ryan Dancy, Sergii Strelchuk

2611.22621 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Symmetric circuits require every symmetry of the input to extend to an automorphism of the circuit. In the classical setting, their connection to descriptive complexity yields strong unconditional lower bounds. We extend this approach to the quantum model of symmetric computation defined by Castro-Silva, Gur, and Strelchuk (ITCS 2026), proving a tradeoff between circuit size and entanglement width (the smallest $b$ such that, on every computational-basis input, the state after each layer factors into states on at most $b$ qubits each). Our main result identifies a graph property decidable in classical polynomial time that no polynomial-size family of symmetric quantum circuits on $n$-vertex graphs with entanglement width $o(n/\log n)$ can compute. The bound holds for circuits with arbitrary one-qubit and two-qubit gates and unrestricted depth, and remains valid under the weaker notion of symmetry with respect to even permutations of vertices. Our proof is based on a new quantum pebble game based on the partial trace. The resulting indistinguishability theorem transfers classical pebble-game lower bounds to quantum circuits with restricted entanglement. By contrast, without entanglement restrictions, we show that every graph property in BQP can be computed by a uniform family of polynomial-size symmetric quantum circuits. Restricting to circuits with no entanglement at all, we show that polynomial-size symmetric quantum circuits with entanglement width 1 can compute every graph property definable in fixed-point logic with counting. Finally, we give an efficient symmetric implementation of QAOA for MAX 3XOR, providing a starting point for studying entanglement lower bounds in quantum optimization algorithms.

Quantum differential interference contrast microscope

Daniel F. Urrego, M. H. M. Passos, Francisco Bernal-Texca, Juan P. Torres

2611.22579 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Optical sensing and imaging of transparent unstained biological and material specimen makes use of optical interference to translate phase shifts into intensity measurements, that are readily available in the optical domain. This is the case of Differential Interference Contrast (DIC) microscopes. However, environmental disturbances such as acoustic vibrations, air currents, temperature shifts, and mechanical drifts cause random phase noise that degrades the precision attainable in the estimation of the unknown phase shift. Although there are tools to compensate for these random phase drifts, such using common path interference techniques or phase stabilization systems, these are not always an option and its introduction is generally at the expense of device simplicity and robustness. Here we introduce a quantum version of Differential Interference Contrast microscopy (qDIC), that makes use of quantum interference for polarization analysis. When compared with standard schemes that make use of coherent light, our approach shows that the transfer of classical DIC microscopy into the quantum domain offers a route towards quantum-enhanced resilience to environmental disturbances, allowing the enhancement of phase sensitivity without sacrificing the simplicity and robustness of the optical setup.

Local distinguishability of five six-partite orthogonal product states

Ben-Hao Zhao, Dong-Huan Jiang, Yu-Guang Yang, Guang-Bao Xu

2611.22553 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

The local distinguishability of a set of orthogonal quantum states can be used to reduce the amount of quantum state transmission in quantum protocols and lower system operational costs and quantum resource overhead. In this paper, we investigate the local distinguishability of five six-partite orthogonal product states (OPSs), where any two states are orthogonal on only one subsystem. We classify all feasible sets of five six-partite OPSs into five categories with 249 cases in total, and prove that these sets can be perfectly distinguished by local operations and classical communication, except for two cases. For five six-partite OPSs corresponding to these two exceptional cases, we further discuss their local distinguishability. Our work fully characterizes the local distinguishability of all feasible sets of five six-partite OPSs.

Predicting Quantum Mpemba Effects from Quantum Speed Limits

Andrea Nava, Rosario Fazio, Reinhold Egger

2611.22547 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Can anomalous Quantum Mpemba Effects be anticipated before a system comes close to its stationary state? We employ Quantum Speed Limits as geometric indicators of Quantum Mpemba Effects, arguing that Mpemba physics is already imprinted in speed limits by benchmarking dissipative qubits and open spin chains. Our results show that short-time speed limits can predict Quantum Mpemba Effects at low cost and with reasonable precision over broad parameter regimes. This predictive power implies a useful application of speed limits for open many-body quantum systems.

Multilevel Effects and the Limits of the Quantum Rabi Model in Ultrastrong Coupling system

Akiyoshi Tomonaga

2611.22546 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

The spectrum of artificial atoms coupled to resonators in the ultrastrong coupling regime have been analyzed using the quantum Rabi model over a wide range of coupling strengths. However, the accuracy of models obtained by truncating multilevel artificial atoms to two levels, as well as the correspondence between effective parameters extracted from spectral fitting and the bare parameters of the circuit Hamiltonian, depends on the multilevel structure of the system. In this study, I analyze the spectrum of an ultrastrongly coupled circuit consisting of a multilevel superconducting artificial atom and a resonator using a circuit Hamiltonian, and investigate the effects of truncating higher atomic levels on the low-energy spectrum. Based on Löwdin partitioning, I evaluate the contributions of virtual transitions through higher atomic levels and show that diagonal energy corrections reduce the errors arising from simple two-level truncation over a wide parameter range. I also show that there are parameter regimes in which readjustment of the effective Rabi parameters successfully reproduces the multilevel spectrum, while systematic deviations remain in other regimes. These results demonstrate the necessity of separately evaluating two-level truncation, perturbative corrections, and effective-parameter fitting in ultrastrongly coupled systems, and provide guidance for quantitative spectral analysis of multilevel quantum circuits.

Quantum Codes for Distributed Quantum Fault Sensing

Xiu-Hao Deng

2611.22530 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Targeted recovery in modular quantum processors requires identifying the component affected by a fault. Independent qubits can monitor faults through repeated preparation and measurement. Bell-pair probes improve the guaranteed correct-site probability for unknown local channels, but require partners kept away from the fault. Can entanglement among exposed probes supply this advantage without protected storage? We establish a quantum-code criterion for optimal distributed fault sensing of one unknown local qubit channel with strength in a prescribed positive range. For one interrogation with zero false alarms and no background noise, suitable code states attain the optimal worst-case correct-site probability, improving on independent probes by 50% with every qubit exposed. Exact attainment is equivalent to mutually orthogonal input and single-qubit Pauli error subspaces. Pairwise entanglement gives no improvement, and entanglement depth at most four cannot exceed 95.54% of the optimum without protected ancillas. Approaching the optimum without protected ancillas also requires a number of probes proportional to the array size to participate in larger entangled factors. For a persistent fault under memoryless depolarizing background of fixed strength 0 < eta < 1, independent probes already attain the optimal logarithmic interrogation scaling at fixed success between zero and one and a positive false-alarm budget. In three 1000-site comparisons with specified readouts, an encoded-probe protocol certifies fewer interrogations than independent probes and only one more than optimally decoded ideal Bell pairs, while storing no protected qubits.

Quantum Optimal Control of Many-Body States in an Antiferromagnetic XXZ Chain with a Single Local Magnetic Field

Nicolás Rojo, Ignacio R. Solá, Juan J. Omiste

2611.22505 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate the quantum optimal control of an antiferromagnetic XXZ spin chain with open boundary conditions, driven solely by a local time-dependent magnetic field applied to a single terminal spin. By optimizing the control field via Krotov's algorithm, we evaluate the feasibility of preparing multi-particle many-body states, including highly polarized Greenberger-Horne-Zeilinger (GHZ)-type states and study the mechanisms by which the control is applied. We demonstrate that global spin-flip symmetry restricts reachable state spaces, strictly confining dynamics within the parity sector of the initial ground state and requiring parity-adapted linear combinations to avoid fundamental population upper bounds. Beyond symmetry constraints, driven population transfer does not occur via direct multi-spin flips, but proceeds stepwise across intermediate magnetization sectors ($|S_{\mathrm{tot}}^z| = 0 \to 1 \to 2 \to 3$) mediated by resonant frequency components matching the internal energy gaps. To overcome optimization stagnation caused by the small overlap mechanism in gradient updates, we introduce a four-stage sequential target protocol and compared it to spectrally filtered, time-localized frequency seed pulses. Combining frequency-tailored seed fields with an extended propagation time window yields GHZ state preparation fidelities exceeding $0.927$ establishing that a single local actuator is sufficient for high-fidelity multipartite state engineering in interacting spin networks.

Entanglement in restricted experimental setups

Rafiul Nakib, Martin Plávala

2611.22481 • Nov 17, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entanglement is a necessary resource for steering and Bell nonlocality, yet whether a state is separable takes no account of what an experiment can prepare or measure. We define two notions of separability relative to an experiment, one on either side of separability. Inner separability confines the local states to the preparable sets. Outer separability lets the local factors be self-adjoint operators positive on the available effects but not necessarily positive semidefinite. We find exactly when each departs from separability and that outer separability keeps the operational content of separability for the available measurements: outer separable states, entangled or not, admit local hidden variable models for every behaviour these measurements generate and, when the steered party is unrestricted, local hidden state models for every assemblage the steering party's measurements generate. Such hidden state models do not imply outer separability in general, but we identify conditions under which they do.

Double quantum dots as dynamical impurities in one-dimensional transport

Yang-Zhi Chou

2611.21609 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We study single-electron scattering in a tight-binding chain capacitively coupled to double quantum dots, which act as dynamical two-level-system impurities with electrically tunable level splittings. For a single impurity, we solve the scattering problem exactly and show Feshbach-like perfect elastic reflection, whose resonant condition distinguishes the initial two-level state. For several impurities in a strongly reflecting chain, transmission peaks at an intermediate mean level splitting. At small splittings, energy exchange with the impurities can weaken constructive interference between backscattered paths, consistent with the initial rise in transmission. As excitation channels close, virtual transitions can enhance reflection and drive transmission below its purely elastic value $T_0$. At larger splittings, these virtual processes weaken and transmission approaches $T_0$. We discuss how gate-controlled transmission measurements in quantum-dot arrays could test these predictions.

Resolving and Suppressing Temporally Correlated Noise in Quantum Error Correction

Alec Eickbusch, Nick Noll, Michael Newman, Matt McEwen, Leigh S. Martin, Alexis Morvan, Gabrielle Roberts, Chunyang Ding, Volodymyr Sivak, Nathan Lacr...

2611.21578 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Scaling fault-tolerant quantum error correction (QEC) requires suppressing errors in both space and time, yet standard logical memory experiments primarily probe spatial faults. Here, we use a 105-qubit Willow superconducting quantum processor to realize and scale the surface code stability experiment, which is alternatively sensitive to temporal error chains. Scaling from patch sizes of $3 \times 3$ to $7 \times 7$, we realize a timelike block suppression factor of $μ_T = 1.47 \pm 0.25$, demonstrating the ability to maintain temporal error suppression as the number of qubits increases. By extending the stability experiment for many cycles, we uncover a sum-of-exponentials behavior in error suppression caused by a temporally correlated error: data-qubit heating to the third excited state $|3\rangle$. We fully capture this effect with a parameter-free, device-level leakage model incorporating higher-state transport during syndrome extraction cycles. To suppress this error, we develop and realize a walking stability circuit, reaching a logical error probability floor of $\le 3.20\times 10^{-8}$ at 60 cycles---two orders of magnitude below the standard construction---and limited by ionizing radiation error bursts. Finally, by adaptively terminating syndrome extraction based on decoder confidence in an offline analysis, we reduce spacetime logical error by 38% and time overhead by 34% compared to the optimal fixed-cycle strategy.

Peak state transfer in trees and the cost of distance

Andrew Osborne, Andrew A. Houck

2611.21567 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

There is peak state transfer between vertices $u$ and $v$ in a graph $G$ if there exists a time $t$ for which $|(\mathrm{e}^{\mathrm i t M})_{u,v}|$ saturates the triangle inequality imposed by its spectral decomposition and $M$ is either the adjacency or Laplacian matrix. We show that peak state transfer at distance $d$ requires $\frac{d^3}{24}(1 + o(1))$ edges in the adjacency case, $Ω(d^2)$ edges in the Laplacian case, and that the leading coefficient in the former is tight. We find a family of graphs with Laplacian peak state transfer at distance $d$ and $Θ(d^5)$ edges, showing that peak state transfer is achievable in a polynomial graph size. In contrast, Laplacian perfect state transfer costs at least $Ω(2^{d/2})$ edges when the distance partition of vertices around one vertex is almost equitable. Finally, we show that Laplacian peak state transfer in trees requires $Ω(d!)$ edges, and we characterize all trees of diameter $\leq 4$ admitting Laplacian peak state transfer, thus answering a pair of questions posed by Coutinho, Guo, and Schmeits.

Optimal Quantum Sensing Algorithms for Discrete-Frequency Spectroscopy

Yu-Jie Liu, Richard R. Allen, Ruohan Shen, Bingtian Ye, Timothy T. Chang, Joonhee Choi, Soonwon Choi

2611.21560 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Spectroscopy is a versatile tool that drives scientific discovery and underpins modern technologies. Quantum sensing offers promising opportunities to advance spectroscopy through enhanced sensitivity and spectral and spatial resolution. However, existing approaches largely focus on improving general measurement capabilities, often overlooking the structure of specific sensing tasks and leaving potential performance gains untapped. Here, we develop an algorithmic approach to quantum sensing tailored to various spectroscopic tasks, providing new avenues for improvement. Specifically, we consider general time-varying signals supported on a known set of $N$ candidate frequencies, a setting we call discrete-frequency spectroscopy. We formulate three types of practically motivated sensing tasks---Detection, Search, and Learning---that require progressively more spectral information. For all tasks, we design optimal quantum sensing algorithms achieving a $\sqrt{N}$ speedup over conventional frequency-scanning approaches. Optimal Detection and Search need only a single-qubit sensor under $π$-pulse control, whereas optimal Learning provably requires coherent processing with a quantum computer. End-to-end numerical simulations incorporating various experimental imperfections predict up to two-orders-of-magnitude speedup in Detection. As an example, we analyze the feasibility of our Detection and Search algorithms for real-world molecular screening based on state-of-the-art nitrogen-vacancy centers. We also show how quantum-computing-enhanced Learning enables wireless communication in a weak-signal regime where conventional methods fail. Our results establish a practical route toward realizing quantum advantages via designing task-specific sensing algorithms.

Benchmarking memory and nonlinear processing capacity of quantum recurrent neural networks for time series prediction

José Daniel Viqueira, Andrés Gómez, David Mera

2611.21552 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum machine learning has emerged as a promising approach to time series prediction. While quantum reservoir computing has been widely explored for this setting, variational quantum models tailored to sequential data remain comparatively understudied, largely because they are difficult to train. In this work, we present a rigorous benchmark of variational quantum recurrent neural networks (QRNNs) on time series prediction tasks, focusing on two key capabilities: memory and nonlinear processing. We introduce a task-driven methodology that quantifies model capacity, enabling an intuitive and fair comparison across architectures, including classical recurrent baselines. We evaluate the proposed framework on two generic benchmark tasks and on a synthetic dataset describing a chaotic system. Overall, the quantum models achieve performance comparable to their classical counterparts, but classical models scale better with the memory size within the range studied. Notably, one QRNN variant shows higher average capacity on the task designed to jointly probe memory and nonlinear capacity. Moreover, our results show that quantum models offer better capacity when we are able to find a good parameter initialization. However, the increasing sensitivity to initialization leads to a lower probability of finding good solutions as the model size increases. These results provide a principled starting point for designing richer quantum recurrent architectures and for assessing where they may offer practical benefits.

The speed limit of gravitational entanglement and the cost of noise

Ekta Panwar, Anubhav Chaturvedi

2611.21546 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Is gravity quantum? A proposed test lets two small masses, each in a superposition of two places, become entangled through their mutual gravity. Gravity is weak, so the masses must stay coherent for seconds while random forces disturb them. Here we ask how fast gravity can entangle two masses, and what noise costs. Without noise we find the maximum rate exactly: it falls as the inverse cube of the separation, and two positions per mass achieve it. Above a noise level set by the masses and their separation, gravity's leading pull can be imitated by classical signals, and every strategy is limited to a rate falling at least as the inverse fourth power. Exact, continuous error correction shields the masses from noise but hides them from each other: the best rate falls as the inverse seventh power, and six positions on a hexagon come within 10% of it at large separation.

Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation

Burhan Gülbahar

2611.21500 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with $N$ nodes vary over their neighbour graph. Memory becomes the bottleneck when the neighbour graph arrives only after data erasure, a late-graph setting motivated by dispersed sensor networks and telemetry. We analyse three collection scenarios, reliable rounds, continuous broadcast and ordered capture, and test the Dirichlet energy $\mathcal E_G=\mathbf z^{\mathsf T}\mathbf L\mathbf z/N$ of the fused decision map $\mathbf z\in\{\pm1\}^N$, with late-graph Laplacian $\mathbf L$, against two thresholds. Hidden Matching uses $O(\log N)$ qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report $b$ sub-bits separately, a classical record buffer before it uses $O(N b)$ bits; classical methods need $Ω(\sqrt N)$ bits in the worst case. The recently introduced Quantum Oracle Sketching builds quantum oracles from random data streams without storing them. We combine coherent loading of separately reported sub-bits, exact in reliable rounds and by Quantum Oracle Sketching in continuous broadcast, with nonlinear fusion and Hidden Matching readout. The register count $R$ does not grow with $N$, and the memory is $O(\log N)$ logical qubits and classical bits, at fixed $b$, graph bounds, thresholds and error targets: an exponential memory advantage over every classical receiver and over Hidden Matching with that buffer. We prove unbiasedness in reliable rounds, preparation bounds in continuous broadcast, classical lower bounds and, for a planner-supplied multi-hop coefficient stream, spectral error bounds. Broadcast simulations match analytic averages at $N=1024$, without resolved bias growth up to $N=2^{20}$. Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.

Entanglement distillation, nonlocal magic, and state sharing in an isospectral non-Hermitian bipartite model

Chenhuan Wu

2611.21490 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

An invertible nonunitary similarity deformation leaves a two-qubit Hamiltonian's spectrum unchanged while varying a selected normalized right eigenstate in the fixed physical inner product. We embed this state in a two-parameter maximally correlated family that includes local dephasing and noisy circuit preparation. Hashing and a matching diagonal relative-entropy bound give the exact distillable entanglement and the PPT comparison distances at every finite tensor power. Correlated PPT catalysts cannot improve the Bell-pair distillation rate. The optimized CHSH value is \(2\sqrt{1+t^2}\): every state with nonzero coherence violates CHSH, while complete dephasing is separable. A calibrated finite-sample bound and two equal-fidelity preparations clarify which noise parameters determine the rate. For pure inputs, the binomial Schmidt spectrum gives logarithmic collectively optimized nonlocal magic with vanishing density, despite a positive entanglement density and extensive pairwise-frame magic. Fixed Clifford decoding gives six- and eight-copy CCZ concentration probabilities \(P_6=\frac12(1-2^{-\mathcal M_γ})\) and \(P_8=1-2^{-\mathcal M_γ}\). The same family permits explicit swapping recursions, symmetry-resolved entanglement, and a comparison of qubit stabilizer and fermionic Gaussian resources. These calculations keep the relevant operation classes separate when comparing many-copy limits.

Quantum Networks with Realistic Photonic Memories

Benedikt Tissot, Sophia Carmen Simon, Anders Søndberg Sørensen

2611.21481 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Ensemble based photonic memories paired with photon pair sources are the essential ingredient for many quantum networking protocols. Most protocols and theoretical analyses focus on networks of identical nodes, however, realistic networks consist of nodes that may vary from device to device. We investigate a network of non-identical memories and develop mitigation strategies for the variation in performance. We find that by strategically distributing the memories among the nodes and individually adapting the emission probabilities based on the memory efficiency the effect of the variance on fidelity and duration can to a large extend be mitigated. Generally, our analysis shows the importance of accounting and compensating for device variations to avoid deteriorating the performance. Lastly, we also link our results to memories where efficiency decays as a function of storage duration. Here, we show that our approach provides a visible improvement for networks with non-identical and decaying memories.

Experimental simulation of a Hilbert-space inner-product change

Vinh San Dinh, Salini Karuvade, Abhijeet Alase, Silvia Zorzetti, Barry C. Sanders

2611.21450 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We simulate an effective change in a single qubit's inner product (IP) by implementing the channel $\mathcal{F}^η$ on a superconducting quantum processor. Whereas previous experiments simulated parity-time (PT)-symmetric dynamics with a fixed IP, this experiment implements the IP-change channel itself for metrics associated with PT-symmetric systems. Building on an earlier adversarial verification approach, we derive a process-fidelity threshold that rules out mixtures of qubit unitary operations with random discarding of runs. We test the channel for 40 metrics using a single qutrit and a two-qubit Stinespring dilation. The measured fidelities exceed the threshold in 24 of 40 qutrit instances after readout error mitigation, compared with 16 of 40 unmitigated two-qubit instances. Without mitigation, 14 of 40 qutrit instances pass. These results demonstrate a direct simulation of an effective Hilbert-space IP change and its verification against a specified adversarial class, while showing the importance of readout treatment in comparing the encodings.

Plenitude of ideal correlations explains quantum theory

Adán Cabello

2611.21448 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We show that the Hilbert-space formalism and the Born rule of quantum theory are singled out by the following principle: every correlation that is possible in a theory in which every observable admits an ideal measurement is physically realizable. An ideal measurement is one that yields the same outcome when repeated and does not disturb any compatible observable.

Localization transition in a spin chain with an exact Fock-space tree

Bernhard Jobst, Simone Warzel, Alexander Altland, Frank Pollmann

2611.21445 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Many-body localization is often pictured as Anderson localization on the graph of many-body configurations. Strongly correlated disorder and a dense net of loops, however, make this graph hard to analyze. We introduce a local disordered spin-1 chain in which a single domain wall explores an exact binary tree of configurations. Random fields create strongly correlated disorder on this tree, as in generic interacting systems, while the absence of loops keeps the problem tractable. We rigorously bound the spreading of the domain wall at strong disorder, and efficient numerics on exponentially large trees indicate a localization transition at finite disorder strength.

Geometry of squeezed states. The phase-space metric, relative vacua and cosmology

Alejandro Corichi, Jerónimo Cortez

2611.21426 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Geometry enters quantum theory in two places. The space of quantum states carries a symplectic form, which generates unitary evolution, and a metric, which governs uncertainties and transition probabilities. The classical phase space acquires a metric of its own when a vacuum is chosen: quantizing a linear system amounts to choosing a compatible complex structure, equivalently a compatible metric $g$. We take this second metric as the primary object and show that it plays, on phase space, the role that the quantum metric plays on the space of states: fluctuations of linear observables are $g$-norms of Hamiltonian vector fields, and along coherent states $g/2\hbar$ \emph{is} the quantum metric. Squeezed states then have a simple description. A squeezed vacuum is the vacuum of another metric, and squeezing is a property of a pair of metrics, a relative vacuum, whose invariants are the eigenvalues $e^{\pm2r_i}$ of $L=g_0^{-1}g$. We work out the harmonic oscillator in detail, including why a rotated squeezed state no longer minimizes the product of the displayed uncertainties. Quadratic evolution deforms the metric, and only the part of the generator that is self-adjoint with respect to the reference changes the $r_i$, at a rate we give exactly. For fields, a vacuum is unitarily implementable relative to a reference exactly when it lies at finite distance from it in the space of vacua. For a massless field in de Sitter space we revisit the two canonical charts compared by Grain and Vennin: relative to the reference of the standard squeezing formalism the Bunch--Davies state has $\sinh r_k=1/(2|kη|)$, and relative to the vacuum that a radiation era beginning at time $η$ would select it has $\sinh r_k=1/(2k^2η^2)$. The second comparison squeezes twice as fast and is unitarily implementable; the first is not.

Rethinking Entropic Uncertainty: How measuring without a trace leads to longer keys

Philipp Kleinpaß

2611.21417 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

In recent years, the entropic uncertainty relation (EUR) has been one of the most prominent tools to obtain tight key rates secure against general coherent attacks for a broad class of quantum key distribution (QKD) protocols. Despite its success, the fundamental question of how to incorporate the statistics of more than two mutually unbiased bases (MUBs) directly into the EUR is yet to be answered. Here, we introduce a simple yet powerful shift of perspective: Instead of the usual tripartition into the systems of Alice, Bob and Eve, we treat Alice and Bob as one joint system and introduce an additional register as the third system. This register contains the results of appropriately chosen virtual measurements that leave no trace in the real branch of the protocol, but act as a conditioning on the counterfactual phase error measurements. We show that this allows us to obtain tight key rates for QKD protocols using an arbitrary number of MUBs directly and natively from the EUR. Moreover, we demonstrate that this approach has a much broader relevance beyond the inclusion of multiple MUBs, allowing for improvements in many existing security proofs and the treatment of previously unexplored aspects for a wide range of protocols.

Reinforcement Learning designs Quantum Repeater Protocols on Networks beyond the Chain Scenario

Andrés Agustí Casado, Álvaro Troyano Olivas, Javier Faba García, Luis M. Robledo, Vicente Martín, Laura Ortiz

2611.21414 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Small-scale quantum repeater protocols have been shown to distribute entanglement over existing telecommunication infrastructure by means of short range quantum communications and long range classical messages. For larger networks, there are a number of theoretical proposals about how to operate the network to achieve a good performance under varying metrics. Moreover, since the dimension of the space of possible protocols grows exponentially with network size, plenty of those proposals are based on heuristics that reduce the search space. One of these is entanglement routing, which simplifies the problem on non-linear networks by allocating a series of disjoint paths and running chain protocols simultaneously on them. However, in this work we claim routing leads to suboptimal protocols. In fact, inspired by works on linear chains, we apply reinforcement learning to non-linear networks and optimize over the larger non-routing protocol space. Then, we find protocols that outperform a routed extension of the swap-ASAP protocol, even in the parameter regimes where the latter is widely recognized as the state of the art. These results indicate that routing must be discarded in favor of non-routing methods, while they pave the way towards the design of a sensible Quantum Internet architecture.

Sharp $L_p$-Regularity for Quantum Markov Semigroups

Lijun Wang

2611.21411 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We determine the sharp universal constants in positive-input $L_p$-regularity for finite-dimensional quantum Markov semigroups with a faithful invariant state. For $1<p<\infty$, they are $p\sin(π/p)/(2(p-1))$ under KMS symmetry and $\frac{p}{2(p-1)}\tan(\fracπ{2}\min\{1/p,1-1/p\})$ without a symmetry assumption, with the endpoint values at $p=1$ given by $π/2$ and $π/4$, respectively.

Quantitative measurement of microwave power at millikelvin temperatures: Comparison between dispersively and directly coupled superconducting qubits

Asen L. Georgiev, Christoph Kissling, Fabian Kaap, Victor Gaydamachenko, Lukas Grünhaupt, Mark Bieler

2611.21397 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

The Rabi frequency of a two-level system is directly proportional to the electric field amplitude being incident on this system. Taking advantage of this relationship, it is possible to use two-level systems as quantitative sensors of electric fields. Here, we apply this concept to superconducting qubits and use them for quantitative measurement of microwave power at millikelvin temperatures. Our superconducting circuit design includes three transmon qubits directly coupled to the central microwave feedline and three transmon qubits coupled dispersively via readout resonators to the feedline. We compare both coupling schemes to assess their reliability for microwave power sensing. Further, we describe the modeling behind each power-sensing method, including an uncertainty estimation based upon repeated measurements. By combining dispersively coupled and directly coupled qubits on the same device, we are able to explore different power ranges: from $-155\;$dBm to $-130\;$dBm for the directly coupled qubits and from $-95\;$dBm to $-55\;$dBm for the dispersively coupled qubits. When determining the microwave-line attenuation for a frequency of $6.0\;$GHz from room temperature to the millikelvin stage of the cryostat, we obtain best estimates and uncertainties for the directly coupled transmons of $(74.7\pm 0.2) \;$dB and for the dispersively coupled transmons of $(75.4\pm 6.8) \;$dB. The larger uncertainty of the dispersively coupled qubit measurements indicates that these qubits are less reliable for power sensing than the directly coupled qubits, most likely, due to the additional coupling resonator, whose transfer function is difficult to estimate accurately. Our results constitute the first step towards validation of qubit power sensing in dilution fridges, leading towards traceability for cryogenic microwave measurements.

Vanishing Relative Distance of Uniformly Random CSS LDPC Codes Built from Permutation Matrices

Kenta Kasai

2611.21389 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Classical random regular low-density parity-check codes can have minimum distance growing linearly with block length. We study CSS check matrices formed as full $J\times L$ arrays of arbitrary $P\times P$ permutation matrices, sampled uniformly subject to commutation. For fixed column weight $J\ge3$ and fixed even row weight $L>2J$, we prove that the relative minimum distance converges to zero in probability as $P\to\infty$, with block length $n=LP$. We analyze the weight enumerators that count all nontrivial logical representatives after excluding stabilizers. A coefficientwise lower bound shows that, at every fixed relative weight $0<α<1$ along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound $h_2(α)/2$, where $h_2$ is the binary entropy function. We compare this bound with the classical LDPC and dense CSS mean weight-distribution exponents. The existence, with high probability, of a logical operator below every fixed target weight $δn$ yields the distance conclusion.

Information Causality Defeats Every Finite NPA Level

Anubhav Chaturvedi, Marcin Pawłowski

2611.21371 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

For every finite level of the Navascués-Pironio-Acín (NPA) hierarchy, we construct correlations that satisfy all its constraints but violate information causality. At each fixed level, one use of a binary-outcome correlation and one classical bit suffice for a violation that grows without bound as the number of measurement settings increases. Information causality bounds the information gained about independent database bits, summed over possible requests, by the length of the message. Quantum correlations obey the one-bit bound; the optimal information gain at any fixed NPA level grows logarithmically with the number of settings. The violation remains unbounded even when all outcome probabilities are positive and, for any fixed number of measurement settings on each side, every choice of those settings admits a local model. One communicated bit therefore exposes an unbounded gap between information causality and every finite NPA level.

Sequential strategy for depolarizing strength estimation

Yasir Mehmood, Enrico Trombetti, Marco Pezzutto, Stefano Gherardini

2611.21360 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We study the advantages of applying a sequential strategy for enhancing the precision in estimating the strength $p$ of a depolarizing channel, using qudit and two-qubit probes. The sequential strategy requires that the same depolarizing channel is repeatedly applied $M$ times to the quantum probe. From the analysis of the probe's output state, both the quantum Fisher information (QFI) and its regularization RQFI, given from multiplication by $p$, are analyzed. We determine that in the limit of $p \to 0$, the QFI is {\it linearly amplified} with the number of channel repetitions. Instead, in the weak-noise regime, the QFI is maximized at a finite value of $M$. Then, the RQFI decreases more quickly with $p$ as $M$ increases. In particular, for two-qubit probes, the RQFI decreases with the depolarization strength proportionally to the amount of correlation between the qubits. The greater the number of channel repetitions, the wider the range of $p$ for which the initial state of the probe that allows for the maximization of the QFI is a separable state. We also show that a single qubit probe undergoing a sequential encoding protocol outperforms the optimal two-qubit single-round QFI for $M>3$ in the weak-noise regime.

Catalytic compression of classical communication in exact entanglement transformations

Vito Viesti, Alexander Streltsov

2611.21349 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Entanglement catalysis is usually associated with making otherwise impossible transformations possible. Here we show that it can also change how much classical communication a transformation requires. A catalyst, returned exactly and uncorrelated with the output, can reduce the message alphabet size required for exact transformations of bipartite pure states by a factor that grows without bound as the Schmidt rank increases. In the asymptotic many-copy regime, however, this advantage disappears at the level of the leading communication rate: the optimal catalytic and noncatalytic rates coincide. We characterize the optimal catalytic cost in terms of Rényi entropies, revealing how the entanglement structure of the source and target governs the finite-copy advantage. Our results establish reusable entanglement as a resource for compressing classical communication in quantum state manipulation.

Quantum adiabatic and diabatic optimization: A Hilbert space engineering strategy with Rydberg arrays

Rui Lin

2611.21341 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Neutral-atom arrays provide a versatile platform for encoding combinatorial optimization problems with arbitrary graph connectivity [Nguyen et al., PRX Quantum 4, 010316 (2023)]. Although the dynamics of individual encoding gadgets has been studied [Bombieri et al., PRX Quantum 6, 020306 (2025)], understanding annealing bottlenecks in larger networks remains challenging. We investigate how engineering the Hilbert-space geometry controls quantum annealing in a family of blockaded-chain models motivated by these encodings. While boundary terms encode the target maximum independent set problem, the bulk geometry induces an auxiliary optimization problem associated with independent sets of cliques. Spectrally, the energetics of the quantum system can be approximated by physically derived clique weights. When the target problem and the auxiliary problems are consistent, the low-energy modes lie predominantly within the target subspace. This spectral structure motivates a diabatic annealing strategy that exploits target-compatible excited states, as tested on the diamond-chain graph family. These results provide a framework for predicting annealing bottlenecks, and demonstrate Hilbert-space engineering as a strategy for improving neutral-atom quantum optimization protocols.

Experimentally relevant witness for non-Markovianity in discrete time crystals

Rahul Ghosh, Victor Mukherjee, Yonatan Dubi

2611.21332 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Discrete time crystals (DTCs) are almost always analyzed under the Born-Markov approximation, in which the environment is memoryless. We show that a reservoir with a finite correlation time $τ_m$ leaves an exact and strikingly simple imprint on the stroboscopic dynamics of DTCs, which can be used as an experimentally relevant witness for non-Markovianity. By analyzing a post-Markovian master equation we prove that the Floquet spectrum splits into the ordinary Markovian spectrum plus a replica of the purely unitary Floquet spectrum, uniformly contracted by $e^{-T/τ_m}$, where $T$ is the drive period. Consequently, the DTC signal decay rate becomes independent of any system parameter once $τ_m$ exceeds the Markovian lifetime of the DTC. The measured decay, and in particular its insensitivity to tunable system parameters, thus becomes a direct read-out of the reservoir correlation time. Below this threshold the dynamics is already non-Markovian, but the memory remains hidden in the decay. We confirm this in two structurally unrelated DTCs, a collective long-range model with incoherent pumping and a disorder-free Ising chain with dephasing, where a single estimator recovers $τ_m$. The time crystal thereby witnesses the non-Markovianity of its own environment.

TCBP-JOBS: GPU-Accelerated Quantum Error Correction Decoding and Noise Learning with Near-Optimal Accuracy

Ben Howe, Satvik Maurya, Jan Olle, Ivan Basov, Muyuan Li, Justin G. Lietz, Kevin Young, Krysta M. Svore

2611.21321 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Achieving near-optimal quantum error correction (QEC) decoding accuracy often requires computationally expensive searches that limit both large-scale simulation and real-time operation. We introduce trajectory-calibrated belief propagation (TCBP), which learns calibrated fault probabilities from BP trajectories, and jittered OSD beam search (JOBS), which uses these probabilities to guide parallel GPU searches. Across surface, color and bivariate-bicycle code memory and surgery circuits, TCBP-JOBS achieves logical error rates comparable to those of the Tesseract most-likely-error decoder at physical error rates of 0.1% to 0.4%, and up to 4.5$\times$ lower on the largest codes. Serial speedups over Tesseract's sparsified presets range from 10$\times$ to 7,400$\times$, and against unsparsified long-beam Tesseract they reach 13,000$\times$ on the bivariate-bicycle codes, at logical error rate ratios of 0.97 to 1.57. At lower physical error rates ($10^{-4}$ to $5\times10^{-4}$), rare-event splitting on the gross code shows that Tesseract is more accurate. Batched execution accelerates offline simulation for rapid, efficient exploration of large-scale QEC design spaces. For QPUs with longer logical clock cycles, our serial memory and logical-surgery experiments demonstrate accuracy comparable to Tesseract while meeting the millisecond-scale latency requirements of online feed-forward operation. Beyond memory and logic decoding, we demonstrate using TCBP-JOBS for confidence scores for postselection in memory and magic-state cultivation, enabling end-to-end color code cultivation. Together, these methods provide a GPU framework for accelerating QEC research via accurate decoding, noise estimation, and confidence assessment.

SCOPE: A Physical Execution Latency-Guided Quantum Circuit Compilation Framework

Bolin Zhang, Zhiyuan Zhang, Yongguang Lv, Ruiqing He, Hengliang Guo, Jiandong Shang, Qiang Chen

2611.21270 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum computing requires compilers to translate algorithms represented in the quantum circuit model into unitary operations supported by physical devices. Limited coherence time makes physical execution latency an important compilation objective. Gate fusion can shorten pulses, but gate count and depth do not capture fused targets' control demands. Evaluating every candidate with quantum optimal control (QOC) would embed pulse optimization in structural search. We present Schmidt-guided Compilation for Optimized Pulse Execution (SCOPE), driven by an operator Schmidt time surrogate. The target's angular distance from product operators measures the required nonlocal change; dividing it by a coupling-limited evolution-rate bound gives a lower bound on exact implementation time. Trace-angle and waveform constraints complete block scores for critical-path evaluation during genetic search. Local QOC determines final pulse durations. Under a numerical nearest-neighbor control model, all 104 results across 13 instances from four application families have shorter QOC critical-path durations than an adapted efficient pulse generation framework with advanced synthesis for quantum circuits (EPOC). Using eight-run instance means, the equally weighted reduction is 42.50\%, with a geometric mean speedup of 2.00. In a shared six-qubit quantum Fourier transform (QFT) ablation, time-surrogate guidance reduces mean QOC duration by 22.21\% relative to gate-count guidance and 21.01\% relative to depth guidance, validating the surrogate's joint use in fitness evaluation and mutation-region selection.

Quantum-Assisted D-FACTS Scheduling for Moving Target Defense under Switching Limits

Hongyu Wu, Yichen Liu, Bo Liu

2611.21265 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Moving target defense with distributed flexible alternating-current transmission system (D-FACTS) devices re- quires activation decisions as operating points change. Switching limits couple these decisions, but period-by-period rankings can overlook combinations needed to complete low-activation schedules. This paper proposes cross-period candidate sharing and schedule-completion evaluation to allocate limited physical checks in quantum-assisted D-FACTS scheduling. The quantum approximate optimization algorithm (QAOA) generates activation candidates, while classical scheduling enforces operating and switching constraints. We also quantify model-based activation requirements and test detection through noisy nonlinear trials. A modified IEEE 118-bus study assesses recovery of reference activation and switching objectives within the evaluated set. Combining candidate sharing and schedule-completion evaluation improves final-budget recovery over period-by-period ranking in the primary operating window for every tested candidate generator. The results show that quantum and classical candidates yield identical recovery curves under combined checking, so the same allocation policy applies to either source.

A boson representation of the electronic structure calculation based on the quantum Krylov subspace algorithm

Hiroki Katow, Hisao Nakamura

2611.21242 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum calculations are expected to broaden the range of strongly correlated phenomena in solids accessible to first-principles calculations. The quantum Krylov diagonalization method, or in a broader sense, the quantum subspace expansion method (QSE) offers an advantage over other variational methods in terms of numerical stability. In this work, we propose a boson representation of electronic systems with the aim of reducing QSE quantum circuit depth, where electron-hole pair bosons serve as the fundamental degrees of freedom. We benchmark the boson representation in comparison with a corresponding fermionic QSE and CCSD for an equidistant and a dimerized configuration of a periodic hydrogen chain \ce{(H2)_n}. Despite the drastic approximation we reveal the boson QSE scheme provides practically useful accuracy in the ground state energy. Our results support its applicability to realistic quasi-two- and three-dimensional electronic systems.

What kind of quantum advantage is this?

Christophe Pere

2611.21239 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum advantage encompasses fundamentally different claims, from resource reductions to exponential separations in sample complexity. Evaluating these claims requires distinguishing how an algorithm achieves an advantage from what is necessary for the separation and how strongly it is supported against classical alternatives. We propose a multi-label taxonomy that makes these distinctions explicit, classifying structural, interference, and coherent mechanisms while separately recording their necessity and the evidence for the classical comparison. Coherent mechanisms are further divided into memory and output, reflecting distinct restrictions on quantum information processing. A two-part entanglement-breaking test distinguishes loss of information from loss of algorithmic efficiency. The hidden subgroup problem illustrates the distinction: among the cases examined, cross-copy coherence is information-theoretically necessary only for the symmetric group. We present this as a diagnostic methodology rather than a theory of quantum advantage: for a new claim, it identifies the relevant adversary, separates the mechanisms a protocol uses from those shown to be necessary, and records the strength of the evidence and the quality of the advantage separately.

Specifying & Verifying Quantum Error-Correcting Codes

Stavan Jain, Nithin Raveendran, Aws Albarghouthi

2611.21236 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Building quantum computers is challenging due to the noise that affects qubits. Quantum error correction tackles noise by encoding information in quantum error-correcting (QEC) codes. These codes are often complex, increasingly found by computational search, presented in diverse formalisms with informal arguments, and hard to reason about algorithmically. Given that the rest of the quantum computing stack relies on a QEC code's properties for correct computation, we propose a formally verified foundation for QEC codes. We present QECLean, a Lean-based framework for formally specifying and verifying QEC codes. QECLean backs every claimed QEC-code property with a machine-checked proof, unifies the diverse presentations of codes in the literature through common abstractions, and makes new codes easy to specify. We present a new compositional technique, code combinators, for proving code distance analytically. Code combinators allow us to prove the distance of large codes that are out of reach for algorithmic techniques; for example, we show that IBM's $[[360, 12, \leq 24]]$ code has distance 24, which was previously only known as an upper bound. Furthermore, we show how our approach allows us to formalize and prove entire code families, such as the surface code. Our work lays the foundation required for reasoning about circuit-level implementations of codes on given architectures and for building end-to-end verified compilers for quantum computers. QECLean is available at https://github.com/Stavan-Jain/QECLean

Interaction Landscapes of Structurally Distorted Toroidal Classical Spin Textures

Henry Pommer, Arkamita Bandyopadhyay, Jamal Berakdar

2611.21194 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We develop a classical discrete magnetostatic model of localized magnetic moments arranged in a toroidal texture, where the moments are represented by static current loops and study the behavior of the magnetic dipole-dipole interaction under several types of structural deformations. The purpose is to disentangle effects due to geometric and magnetic deformations, including elliptical, lopsided, alternating, and tilted configurations. In particular, we investigate how distortions modify the toroidal moment and the interaction energy between pairs of toroidal structures. The resulting interaction landscapes exhibit characteristic symmetry patterns and anisotropies that are highly sensitive to the underlying deformation. As a separate proof-of-concept comparison, first-principles calculations on a molecular spin-toroidal system reveal qualitatively similar orientation-dependent behavior. The calculated interaction is microscopically the conventional pairwise magnetic dipole-dipole interaction between localized moments arranged in a spin-toroidal texture; the toroidal moment characterizes the collective texture and should not be interpreted as introducing an additional elementary interaction term. Our results provide a platform for exploring orientation-dependent interactions of spin-toroidal textures in molecular magnets and related nanoscale magnetic systems that are essential to understand the role of toroidal order.

Separations Between Randomized and Exact Quantum Query Complexity for Boolean Functions

Zekun Ye

2611.21189 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We construct a family of total Boolean functions $F_{\mathrm{tot}}$ whose randomized and exact quantum query complexities satisfy $R(F_{\mathrm{tot}}) \ge Q_E(F_{\mathrm{tot}})^{2-o(1)}$. Chiruvella, Kayal, Mittal, Paraashar, and Saurabh (2026) also obtained a nearly quadratic separation for total functions in the query model by a different method. For every fixed $\varepsilon \in (0,1)$, we construct a family of partial Boolean functions $F_{\mathrm{par}}$ on $n$ bits satisfying $Q_E(F_{\mathrm{par}})=O_\varepsilon(1)$ and $R(F_{\mathrm{par}})=Ω_\varepsilon(n^{1-\varepsilon})$. This matches the asymptotic separation previously obtained with bounded error (STOC 2021; SICOMP 2023). Lifting yields a family of partial communication functions $G_{\mathrm{par}}$ with $Q_E^{\mathrm{cc}}(G_{\mathrm{par}})=O_\varepsilon(\log n)$ and $R^{\mathrm{pub,cc}}(G_{\mathrm{par}})=Ω_\varepsilon(n^{1-\varepsilon})$, where $n$ is the total number of input bits held by the two parties.

No complete set of mutually unbiased bases in dimension ten contains the Fourier pair or three product bases

Jinze Yang, Yile Liu, Yangyang Li, Xiu-Hao Deng

2611.21188 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

With computer-assisted proofs that $\mathbb{C}^6$ admits at most three mutually unbiased bases (MUBs) now available, $\mathbb{C}^{10}$ is the smallest dimension in which it is unknown whether a complete set of $d+1=11$ MUBs exists; only three MUBs are known. We prove that every triple of mutually unbiased product bases of $\mathbb{C}^2\otimes\mathbb{C}^5$ is strongly unextendible: no vector is unbiased to all three bases. Consequently no set of four MUBs in dimension ten, and in particular no complete set, contains three product bases. This settles the case $d=2\times5$ anticipated by McNulty, Pammer and Weigert; it was known only for the Heisenberg-Weyl triple. The proof covers all ten equivalence classes with explicit Nullstellensatz certificates modulo one prime on $91$ charts of $\mathbb{P}^9\times\mathbb{P}^9$ for each class ($910$ in all), transferred to characteristic zero by a projective reduction lemma, together with an independent rank certificate for eight of the ten classes. We also prove that the pair formed by the standard and the Fourier basis of $\mathbb{C}^{10}$ is contained in no set of four MUBs. Exactly $3040$ rays are unbiased to both bases (this confirms the count found numerically by Führ and Rzeszotnik), each of them is unbiased to at most eight of the others, and every triple formed by the pair and a third MUB is strongly unextendible. For this we certify $34,940$ cyclic $10$-roots in Krawczyk uniqueness boxes, decide unimodularity exactly through an involution, and prove completeness by a four-dimensional interval branch-and-bound obtained from the Chinese-remainder splitting $\mathbb{Z}_{10}=\mathbb{Z}_2\times\mathbb{Z}_5$.

Observation of Crossover from Repulsive to Attractive Interactions between Two $nS$-Rydberg Atoms in Dual-Species Atom Arrays

Yi Chen, Kun-Peng Wang, Ming-Rui Wei, Peng Zhang, Yang Wang, Yi-Bo Wang, Min Liu, Peng Xu, Xue-Yuan Wang, Xiang Gao, Chengshu Li, Xiao-Dong He, Ming-S...

2611.21171 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Dual-species Rydberg atom arrays provide a flexible platform for engineering long-range interactions beyond the conventional isotropic blockade regime. We spectroscopically study interactions between different $s$-state Rydberg levels in a $^{87}\mathrm{Rb}$--$^{85}\mathrm{Rb}$ optical-tweezer array. By varying the principal-quantum-number difference $Δn$ around $61S_{1/2}$, we observe a crossover from repulsive to attractive interactions. We identify a distinct regime at $Δn=2$ in which Förster-enhanced electronic spin exchange dominates over orbital exchange and produces a strongly bond-orientation-dependent pair spectrum. Time-domain collective-excitation measurements reveal this geometry-dependent spin exchange through a pronounced anisotropy of the double-excitation probability. For $Δn=1$, by contrast, orbital exchange dominates and the interaction is nearly isotropic. These results establish the principal-quantum-number difference and bond orientation as complementary control parameters for tailoring Rydberg interaction spectra and collective excitation dynamics, opening new opportunities for engineering spin-dependent Hamiltonians in programmable atom arrays.

Deterministic nonlinear domain engineering algorithm with variable sub-coherence-length domains

Michael Schlosser, Tommaso Faleo, Gregor Weihs, Robert Keil, Stefan Frick

2611.21156 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We present a new and improved deterministic algorithm that calculates the poling domains for the implementation of arbitrary phase-matching functions (PMF) in quasi-phase-matched nonlinear crystals for parametric down-conversion photon sources. In contrast to previous work, the algorithm presented here makes full use of the limits of the fabrication process, such as the minimum feature size and resolution of the lithographic process underpinning the poling procedure. This minimizes the tracking error to the target electric field and improves the accuracy in reaching the desired PMF. We give a tutorial on how to calculate the target function for arbitrary PMFs and run the algorithm. We also demonstrate the procedure on a relevant application in quantum sensing, where we use a quadratic phase on the PMF to implement a broadband photon spectrum while maintaining high nonlinearity across the crystal. The designed crystal is experimentally tested, and the result matches expectations.

Stabilizer-Restricted Antidistinguishability in Quantum Computation with Magic States

Selman Ipek

2611.21123 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

An antidistinguishing measurement for a family of preparations excludes at least one preparation for every possible outcome, constraining 'classical' representations of these processes, known as ontological models. We develop this connection within quantum computing with magic states (QCM), a universal model of quantum computation. Our constructions use adaptive Pauli measurements on tensor products of single-qubit non stabilizer states, including families associated with the Clifford hierarchy. These constructions yield stabilizer-restricted versions of the Pusey-Barrett-Rudolph theorem: any ontological model reproducing these measurement statistics and satisfying preparation independence must assign disjoint ontic supports to the preparations considered. We demonstrate this obstruction to preparation independence in a concrete ontological model based on convex polytopes used for the classical simulation of QCM.

Reversal of dynamical backaction and cooling below the quantum backaction limit in Floquet-driven multimode optomechanical resonators

Menno H. Jansen, Roel Burgwal, Ewold Verhagen

2611.21110 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Dynamical backaction describes how a driven cavity field responds with delay to mechanical motion, and can be used to cool that motion toward its quantum ground state or amplify it into self-oscillation. Control over this interaction underpins laser cooling, high-fidelity state preparation, quantum transduction, and phonon lasing. In conventional cavity optomechanics, both the sign and the magnitude of the optical damping are dictated by the laser detuning, and cooling is bounded by quantum backaction (QBA), the optomechanical analogue of the Doppler limit in cold atoms. We show, in theory and experiment, that dynamical backaction can be strongly enhanced in multimode optomechanical resonators driven by time-varying (Floquet) optical fields. A modulated drive couples a sideband-unresolved MHz mode to a sideband-resolved GHz mode through the shared cavity, replacing the QBA limit of the target mode by the occupancy of the auxiliary mode. Experimentally, we cool the MHz mode to $47 \pm 13$ phonons, about half its single-mode QBA limit and an order of magnitude below what single-tone backaction reaches at the same intracavity photon number. The character of the interaction can moreover be completely inverted at fixed laser detuning, turning cooling into amplification and vice versa, controlled solely by the modulation frequency. Floquet driving thus extends open-loop quantum control, which requires no measurement or feedback, to mechanical resonators outside the resolved-sideband regime.

Closing the loop on memory: accurate, shallow and transferable decoding of quantum LDPC codes

Zhou You, Ying Li, Xiao Yuan, Yuan Yao

2611.21086 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum low-density parity-check (qLDPC) codes have attracted interest for fault-tolerant quantum computing because their high-rate constructions offer a route to reduced qubit overhead. Realizing this potential requires reliable decoding. Belief propagation (BP) forms the basis of many qLDPC decoders, but can fail to converge under circuit-level noise. Memory-based variants can improve convergence, yet selecting memory strengths that work reliably across different syndromes remains challenging. Here we introduce TEMPO-BP, which adapts each variable's memory strength to the evolving decoding state through local feedback. On the gross code at a physical error rate of 0.4%, single-run TEMPO-BP achieves a per-shot logical failure rate of 0.73%, compared with 2.51% for BP+OSD+CS-10. Ensembles of 10-15 concurrent instances match or lower failure counts relative to Relay-BP-5 at all ten tested operating points, with per-instance iteration caps at least tenfold lower than its serial limit. Without retuning, the gross-code parameters yield fewer observed failures than Relay-BP-5 in its published gross-code configuration across four additional code families. Ablations support state-dependent memory control, while a loop-gain analysis characterizes specific amplification modes in the decoding dynamics.

Subwavelength confinement of optical and acoustic waves for enhancing Brillouin gain in a planar waveguide structure

A. R. Mukhamedyanov, E. A. Tereshchenkov, E. S. Andrianov, A. A. Zyablovsky

2611.21082 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We propose a planar waveguide structure consisting of two layers separated by a gap that provides subwavelength confinement of optical and acoustic modes and a large overlap integral between them. This, in turn, leads to an increase in Brillouin gain. Using the structure of two Si$_3$N$_4$ layers with a subwavelength gap from SiO$_2$ as an example, we demonstrate that a hybridized transverse-magnetic (TM) optical mode exhibits strong field confinement in the SiO$_2$ gap. Simultaneously, a high-frequency acoustic mode can be confined in the same gap, providing a high spatial overlap between the optical and acoustic fields. This provides a high opto-acoustic interaction with a Brillouin gain up to $5$ W$^{-1}$m$^{-1}$. The proposed structure is compatible with planar photonic integration and offers a promising platform for compact, low-threshold Brillouin lasers and coherent phonon generation.

Success Probability of Block-Encoding Methods

Oumaya Ladhari, Matthieu Saubanère, Jérémie Messud

2611.21080 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Block-encoding methods apply nonunitary functions $f(\widetilde H)$ of a normalized Hermitian operator on a quantum computer, but only upon a successful postselection, which introduces a shot overhead rarely included in resource estimates. We analyze the success probability $p^{(f)}_{\mathrm{success}}=\sum_n w_n|f(\tilde E_n)|^2$ of three constructions, namely linear combination of unitaries (LCU), qubitization and quantum singular value transformation (QSVT), where $w_n$ are the weights of the input state on the eigenstates of $\widetilde H$. Using the one-dimensional Hubbard model with up to 14 sites (35 qubits), we show that for LCU, the success probability is bounded by the squared ratio between the spectral norm and the $1$-norm of the Pauli decomposition, and that for a Hartree--Fock input it plateaus with system size while the ground-state overlap keeps decreasing. For qubitization, it oscillates with the Chebyshev degree, and favorable degrees can be identified from a few dominant spectral components or predicted from shallow-degree data. For QSVT, the polynomial normalization constant directly sets the success probability, and a tight certified bound balances it against phase-finding robustness. An application to quantum Krylov methods shows a nonuniform shot overhead across Krylov moments. The success probability should therefore be part of the resource estimation of block-encoding-based algorithms.

Relaxing the i.i.d. state preparation assumption with the block QKD protocol

Olgierd Żurek, Hoi-Kwong Lo

2611.21048 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

In this work, we propose a novel approach to handling the independent and identically distributed assumption for the state preparation in prepare-and measure QKD protocols. Contrary to previous approaches, we do not prove the security using sub-protocols, and instead opt to guarantee security in the presence of correlations by dividing the communication into finite blocks of consecutive pulses, and adding an additional assumption of no dependence between each block. In turn we obtain a protocol which uses only a relaxed i.i.d. assumption and is easier to implement than subprotocol-style approaches since it does not require separate statistics for each sub-protocol, whose number grows with the correlation length of the underlying dependency.

How many events does entanglement-based positronium imaging need? Information limits of Compton polarimetry with CZT detectors

Haitao Zhou, Ruonan Wang, Jianyong Hu, Zhifang Wu, Sijin Li

2611.21022 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

The degree of polarisation correlation of the two annihilation photons, measured by Compton polarimetry, has been proposed as a PET biomarker of tissue microstructure, but the statistics it requires have not been quantified. We parameterise the measurement by the linear-polarisation correlation coefficient $κ$ ($κ=1$ maximally entangled, $1/2$ separable), derive the classical Fisher information of double-Compton events and compare it with the quantum Fisher information, relate $κ$ to the annihilation channels of positronium in tissue, and simulate pixelated CdZnTe (CZT) rings. The model is checked against three published measurements and an independent GATE/Geant4 simulation. A double-Compton event carries at most 0.12-0.14 units of Fisher information about $κ$ and 0.015 on average, 0.1-0.6% of the quantum limit. Event-wise maximum likelihood reaches the Cramer-Rao bound, whereas the conventional ratio R needs 1.2-2.3 times more events. The observed coefficient is $κ_{obs}=1-α(1-κ_{pick})$, with a pick-off share $α$ of 0.13-0.29 in tissue; it is sensitive to lipid fraction but not to oxygen, and carries no tissue information if pick-off photons are maximally entangled. Published porous-polymer data imply $κ_{pick}$ = 0.34-0.58. In a 15-mm CZT module, ordering ambiguity, position errors and electron transport roughly halve the information per event, and sequence reconstruction of multi-site events recovers this loss. With $^{18}$F and an eight-module ring, $κ$ can be measured to $\pm0.01$ in a 10-mm tumour, but separating tissues by $κ$ alone requires 6-74 times more decays than are available.

Global bound-state spectrum and spin- and angular-momentum-dependent confinement in an inverse-$3/2$ magnetic quantum dot

Luis B. Castro

2611.20963 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We investigate the bound-state spectrum and confinement thresholds of a two-dimensional electron governed by the Schrödinger--Pauli equation in an inverse-$3/2$ radial magnetic-field profile. The radial problem reduces to the biconfluent Heun equation, but instead of restricting the solution to the quasi-exact polynomial sector, we impose the bound-state condition globally through a spectral Wronskian between the endpoint-selected Frobenius solution and the subdominant asymptotic solution. The resulting spectrum contains continuous nonpolynomial bound-state branches on which the known quasi-exact solutions appear as isolated exact points. In this global description, the polynomial index $N$ remains a termination index within the quasi-exact sector but does not uniquely label the spectral branches. An independent exact analysis of the continuum edge yields spin- and angular-momentum-dependent critical couplings that can lie below the quasi-exact restriction $U_0a>4$, where $U_0$ is the Coulomb-strength parameter and $a$ is the magnetic-profile length scale. These results establish quasi-exact solvability as a set of special analytic points embedded in a broader biconfluent-Heun spectrum with spin- and angular-momentum-dependent confinement thresholds.

Static Bounds on Thermal Fast Scrambling

Yixuan Ma, Weikang Li, Dong-Ling Deng

2611.20958 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Scrambling, the process by which initially localized quantum information spreads across an interacting many-body system, is a hallmark of quantum chaos and plays a central role in understanding black hole dynamics. In thermal systems, the chaos bound of Maldacena, Shenker and Stanford limits the exponential growth rate of out-of-time-order correlations to $2π/β$, assuming that time-ordered correlation functions factorize after a dissipation time. Establishing the corresponding rigorous logarithmic lower bounds on scrambling times at arbitrary fixed temperature has remained an open problem, most notably in disordered systems, where the Gibbs state depends on the same random couplings that drive the dynamics. Here we prove such bounds at every fixed temperature for the Sachdev-Ye-Kitaev (SYK) model and for random $k$-local spin systems, without assuming real-time factorization. Our approach uses the operator-size distribution of the square root of the Gibbs state to quantify how local probes modify its structure. This static information bounds the thermal correlator uniformly in time along the edges of its analytic strip in complex time, and analyticity then limits how rapidly scrambling can develop. For both families of models, we prove that with probability tending to one the scrambling time is at least $(1-ε)[β/(2π)]\log N$ for any $0<ε<1$, with the coefficient $β/(2π)$ suggested by the chaos bound. The bound holds for each fixed pair of distinct Majorana modes in the SYK model and for the target average of any fixed single-site source in the spin model. These results place the thermal fast-scrambling timescale on a rigorous footing and show how static properties of the Gibbs state can constrain real-time information spreading.

Metrological Channels Induced by Encrypted Quantum Cloning: Optimal-Probe Fisher-Information Broadcasting and Single-Use Operational Recovery

Nalan Kandirmaz

2611.20945 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Encrypted quantum cloning creates multiple individually inaccessible signal systems from which an unknown input state can be recovered by combining any selected signal with a shared quantum key. Here we study parameter estimation when a local sensing transformation is applied after encrypted cloning and before decryption. For the two-clone qubit protocol, a local Pauli rotation on one encrypted signal is shown to induce, after standard decryption, a parameter-dependent Pauli dephasing channel rather than a unitary rotation. We derive its Pauli-transfer representation and the corresponding quantum Fisher information (QFI) for arbitrary mixed qubit probes. We then distinguish raw QFI, which for an optimal decoded probe may remain simultaneously present in a decoded output and its complement, from decoder-accessible QFI, which is operationally single-use because a first decryption destroys the shared syndrome information needed for a second standard recovery. For $n\geq2$ encrypted clones, the effective channel family is independent of clone number up to a clone-parity-dependent permutation of the Pauli axes (the single-clone case is exceptional for $Y$-sensing, where the decoded map stays unitary). This produces a metrological parity switch: for fixed probe and generator, even and odd clone numbers can yield respectively vanishing and maximal QFI. Closed expressions are obtained for the degradation of this parity contrast under probe depolarization and Pauli-diagonal Bloch-vector contraction.

Variational Corrections to Strong-Disorder Renormalization in the Two-Dimensional Random Transverse Field Ising Model on Quantum Hardware

Alina Joch, Benedikt Fauseweh

2611.20932 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Strong-disorder renormalization-group (SDRG) methods provide an effective description of disordered quantum many-body systems by identifying the dominant couplings for the low energy physics. However, the resulting renormalization-group flow is approximate and neglects correlations beyond the RG description. Here, we investigate whether variational quantum optimization can be used to correct these approximations. Building on the emergent-coupling-based ansatz (ECBA) developed for the one-dimensional random Heisenberg model, we introduce a formulation adapted to the two-dimensional random transverse field Ising model. The SDRG flow determines the structure of the circuit, while variational optimization allows the state to deviate from the RG approximation. We study the resulting ansatz numerically and experimentally on an IQM superconducting quantum processor. For a 16-qubit system, we perform full variational optimization on the quantum processor, while a 49-qubit system is investigated using pre-optimized parameters, achieving a relative energy accuracy of 89% and 97%, respectively. Our results demonstrate that RG information can be translated into shallow, hardware-compatible quantum circuits while variational optimization enables corrections beyond the underlying RG approximation also for two-dimensional systems.

Efficient $XX$ Placement Strategies for Energy-Gap Enhancement in Quantum Annealing

Jennivine Chen, Natasha Feinstein, P A Warburton

2611.20902 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Quantum annealing offers the prospect of a computational advantage over classical methods for certain classes of combinatorial optimisation problems. Its performance, however, is fundamentally constrained by the minimum spectral gap between the ground state and the first excited state encountered during the annealing process. When this gap closes exponentially with problem size, the runtime required to maintain adiabatic evolution can likewise grow exponentially, severely limiting the practical efficiency of the annealer. For problems including the maximum weight independent set (MWIS), previous work has shown that introducing $XX$ interactions along problem-graph edges can substantially enlarge the minimum energy-gap and thereby improve annealing performance. In practice, however, current quantum annealing hardware does not support these interactions natively and methods for implementing effective $XX$ couplings come with hardware overhead and connectivity constraints. These limitations motivate the use of only a limited number of $XX$ interactions. In this paper, we investigate $XX$ placement strategies for MWIS instances under both resource and topological constraints, and demonstrate that careful selection of the placements can substantially increase the minimum energy-gap. We evaluate these strategies through a detailed statistical analysis of both deliberately constructed hard MWIS instances and random Erdős--Rényi graphs. Notably, these strategies are particularly effective for hard MWIS instances with initially small minimum gaps, where targeted placement yields the largest relative improvements.

Non-Hermitian edge accretion

Wei Li, Ching Hua Lee, Fuxiang Li

2611.20881 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Under the non-Hermitian skin effect (NHSE), it is generally taken for granted that the open boundary condition (OBC) spectrum is encircled by the periodic boundary condition (PBC) spectrum. Intuitively, this is because boundaries tend to block the directed NHSE amplification, thereby suppressing $\operatorname{Im}(E)$. In this work, we analytically and numerically demonstrate how this conventional scenario can be dramatically violated: In a phenomenon which we term non-Hermitian edge accretion (NHEA), strongly coupled competing NHSE channels conspire to amplify a state whenever it bounces off an edge, instead of attenuating it. This unexpected behavior arises from underappreciated consequences of non-Bloch eigenspinor orthogonality, which control the reflection coefficients as well as the balance between propagating and evanescent waves. Operating in the strongly coupled regime, NHEA is fundamentally distinct from conventional critical NHSE scaling, which is characterized by amplification feedback generated in the bulk, not the edges. Requiring only strongly coupled antagonistic NHSE chains with suitable mode orthogonality, the NHEA is platform-agnostic, and can be identified through periodically growing edge bounces in generic non-Hermitian metamaterials and quantum simulators.

A simple solvable $Z_N$ Hamiltonian in any dimension

Yuguan Li, Murray T. Batchelor

2611.20874 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

We construct local $Z_N$ clock Hamiltonians from Baxter-Fendley chains coupled according to an arbitrary finite oriented simple transverse graph. Bounded edge lengths and vertex degrees give finite-range multispin interactions, with $2d$-site bulk terms on a $d$-dimensional rectangular lattice. For open longitudinal boundaries, an explicit nonlocal unitary transformation decouples the chains and gives a free parafermion spectrum. On rectangular lattices this holds for any combination of open and periodic transverse boundaries. For periodic longitudinal boundaries, neighbouring chain charges fix the closing-bond twists. In each joint charge sector, the energies are sums of the corresponding twisted periodic-chain energies. As an example, we construct a three-dimensional array of chains perpendicular to a Penrose rhombus tiling.

Randomized routing: ruling out classical networks without trusting source independence

Martin Plávala

2611.20866 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Network nonlocality without inputs assumes that the sources are independent, but no data can test this, since one classical source feeding all parties reproduces any correlation. Here we propose a randomized routing strategy: a source is duplicated, and the two parties it connects choose at random which copy to read. Whether any classical network, even with correlated sources, explains the routed data is then a linear program, and its infeasibility certificates are linear inequalities on the data. Source independence is thus traded for locality and free choice of the routing, which experiments can enforce. In the triangle scenario, the RGB4 distribution fails the test over a wide range of parameters, including a point where its triangle data alone have a numerically found model with independent classical sources, and it still fails with 3\% white noise at each source.

Genuine multipartite entanglement in ring-shaped Hubbard models

K. Shahzad, S. Pittalis, G. Goldoni, R. Di Felice, F. Troiani

2611.20756 • Nov 16, 2026

QC: none Sensing: none Network: none
View Full Abstract

Spin states can be extracted from many-electron systems by detecting electrons at a set of lattice sites, which act as particle labels. Here we quantify the genuine multipartite entanglement (GME) of such spin states, which are generally mixed, in standard and extended Hubbard rings, together with the corresponding detection probability. We show that the on-site repulsion, by suppressing charge fluctuations, enhances the GME, and that in the strongly interacting regime at half filling the detection probability decreases only weakly with the number of spins. The GME is robust at temperatures below the singlet--triplet gap, and can even be enhanced by doping, in spite of the induced charge fluctuations. The transition from spin- to charge-density waves in the extended Hubbard model is signaled by an abrupt suppression of both the GME and the detection probability.

Weekly Archives

From the author