Peer Revenue Fully funded

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Physics Quantum Physics

quant-ph Watch Quantum Physics (sign in to use)

Thursday 17 September

Quantum Physics

An exact Jordan signature in cumulative-count first-passage statistics

For cumulative-count first-passage problems, the Laplace transform of the time $\mathcal T_N$ of the $N$th count is naturally expressed through powers of a one-count kernel. A Jordan defect of that kernel does not, however, automatically survive the complete sum over terminal phases. We give an exact three-state Markov-renewal example in which it does. At $s=1$, the one-count kernel has spectrum $\{1/2,1/8,1/8\}$, with a one-dimensional eigenspace at $1/8$, and for initial phase $1$, \[ \mathbb E_1[e^{-\mathcal T_N}] =\frac56\,2^{-N}+\frac{N+1}{6}\,8^{-N}. \] Thus the ordinary, unconditioned cumulative-count transform contains the explicit Jordan contribution $N/(6\,8^N)$ at every threshold $N\ge1$. For the same fixed stochastic process, the two eigenvalues meeting at $1/8$ unfold as \[ \lambda_\pm(s)=\frac18\pm\frac1{96}\sqrt{s-1} -\frac{131}{2304}(s-1)+O((s-1)^{3/2}), \] and the characteristic discriminant has a simple zero at $s=1$. We place the example beside two structures that suppress such a marginal signature: fixed post-count reset, which gives scalar renewal, and a common total holding rate, for which terminal summation scalarizes the matrix power. The model also admits a monitored-Lindblad realization, but the mechanism is entirely classical. The result provides a small exact benchmark for how generalized spectral modes can remain visible in finite-threshold first-passage statistics.
Read the full abstract

Quantum Physics

Electrostatic Stabilization of Near-Surface Quantum Sensors via Dielectric Interface Engineering

Control of charge-state stability in near-surface quantum defects is critical for nanoscale sensing, yet remains particularly challenging under ultra-high vacuum (UHV), where surface-induced band bending destabilizes the metrologically relevant charge-state. Here, we present a robust and reproducible approach for stabilizing shallowly implanted (< 10 nm deep) nitrogen-vacancy (NV) centers in near-UHV conditions (P = $3 \times 10^{-9}$ mbar) based on dielectric interface engineering. Through measurements on individually addressable NV centers, we demonstrate that a TiO2 coating on the diamond suppresses surface-induced electrostatic fields, yielding a 79% increase n NV- population and a 45% enhancement in NV-spin resonance contrast at room temperature. Coherent control measurements further reveal suppressed charge-state conversion dynamics. These results establish dielectric screening as a powerful and reproducible strategy to engineer charge transition energetics of NV centers in scanning-probe-compatible geometries under extreme conditions.
Read the full abstract

All authors Atharva Paranjape, Kathrin Küster, Olga Shevstova, Lisa Ebo, Toni Hache, Klaus Kern, Rainer Stöhr, Jörg Wrachtrup, Aparajita Singha

Quantum Physics

Private communication from Pauli channels with no privacy

A channel capacity quantifies the communication capability of a noisy physical process. In contrast to communication channels in the classical world, quantum theory makes this capability contextual. We show that two Pauli two-qubit channels, each with zero private classical capacity, can be used to transmit private information when used together. One is a two-qubit Pauli channel whose environment can reconstruct the receiver output up to matrix transposition; the other is an antidegradable channel. We obtain a similar result when the second channel is the 50% qubit erasure channel. A simple binary code built from rank-three mixtures of Bell states activates private communication. The main ingredient in our construction is a transpose-antidegradable channel that is not antidegradable.
Read the full abstract

Quantum Physics

Semiclassical scaling of eigenstate thermalization in single-particle chaotic systems

We study the off-diagonal matrix elements of real-space observables in time-reversal-invariant single-particle chaotic systems. By analyzing the semiclassical expression for the off-diagonal variance derived from Berry's conjecture, we show that the banded structure of the observable matrix emerges naturally. For local observables, we identify a characteristic bandwidth associated with a late-time timescale inversely proportional to the particle velocity. We further show that, for systems with steep-wall confinement, the predicted magnitude follows the entropy scaling of the eigenstate thermalization hypothesis (ETH), multiplied by an additional kinetic-energy-dependent factor that is independent of spatial dimension and is not captured by conventional many-body ETH. We illustrate these results through a case study of quantum billiards and verify the semiclassical scaling numerically in a generalized quarter-Sinai billiard. Our results elucidate the dynamical implications of Berry's conjecture and provide a comparison between single-particle eigenstate thermalization and many-body ETH.
Read the full abstract

Quantum Physics · Cross-listed from cond-mat.mes-hall

Highly uniform first-electron position in qubit arrays fabricated on dedicated QSOI(R) 300mm commercial platform

We report progress toward the development of a quantum silicon-on-insulator (QSOI(R)) technology compatible with 300mm CMOS fabrication and adapted from the 28nm Fully-Depleted SOI (28nm FD-SOI) platform for scalable quantum computing. We compare quantum devices fabricated with standard 28nm FD-SOI and QSOI(R) technologies, and show striking improvements of room temperature electrostatic properties of the individual device. Moreover, the QSOI(R) technology has significantly reduced the device variability and the dispersion of device properties at the wafer level. Transistor metrics are reproduced by TCAD simulations showing that the electrostatics of the devices behave as expected for QSOI(R) technology. Wafer-scale measurements at sub-2K show reproducible quantum dots down to the few-electron regime with 69% yield for successful charge detection of the first electron and a dispersion of the first electron position of $\mathrm{\pm 35 mV}$ over 377 quantum dots. These results establish QSOI(R) as a promising platform for CMOS-compatible quantum device co-integration.
Read the full abstract

All authors Johan Pelloux-Prayer, Elise Prin, Giselle A. Elbaz, Pierre-Louis Julliard, Amaryllis Comiti, Clément Nguyen, Sylvain Martin, Patrick Torresani, Renan Lethiecq, Carlos Augusto Suarez Segovia, Franck Arnaud, Etienne Nowak, Tristan Meunier, Bruna Cardoso Paz

Quantum Physics · Cross-listed from cond-mat.quant-gas

Statistical delocalization in the Anyonic Aubry-André model

Many-body localization is remarkable in that localization persists despite the presence of dynamical interactions. Here we demonstrate the converse phenomenon: enhanced many-body delocalization induced solely by exchange statistics. We study a Aubry-André quasiperiodic system of anyons in one dimension in the absence of density-density interactions. In terms of anyon operators, the system is described by a quadratic Hamiltonian. By analyzing the finite-size scaling of its spectral properties and the inverse participation ratio of many-body eigenstates, we find that increasing the anyonic statistical phase systematically shifts the many-body localization crossover toward larger quasiperdiodic potentials. We further confirm these findings using a dynamical probe, namely the persistence of an initial density imbalance following quenches. Our results establish exchange statistics as an independent mechanism capable of altering many-body localization, revealing a fundamentally distinct route to delocalization in one-dimensional quantum systems.
Read the full abstract

Quantum Physics · Cross-listed from cond-mat.str-el

Corner entanglement scaling with projected entangled pair states

Entanglement scaling provides a powerful probe of universal properties at quantum critical points. In two dimensions, contributions originating from a corner-shaped bipartition exhibit a universal scaling, which is determined by the underlying conformal field theory. We develop a method to extract this corner entanglement entropy from projected entangled pair states directly in the thermodynamic limit. When applied to models at a quantum critical point, we show that the corner contribution exhibits scaling with the effective correlation length, in agreement with the hypothesis of finite-entanglement scaling. Our results for the corner coefficients are consistent with other methods, demonstrating the efficiency of our method for diagnosing strongly-correlated quantum critical points in two dimensions.
Read the full abstract

Quantum Physics

Quantum Graph Convolutional Networks: Implementation and Trainability Analysis

Graph Neural Networks (GNNs) achieve state-of-the-art performance on graph-structured data, but training and inference on large graphs are often bottlenecked by memory constraints and sparse linear-algebra workloads. Quantum computing offers an alternative set of primitives that may improve scalability for graph learning. Building on the quantum graph neural network (QGNN) framework of Liao et al., this work implements two representative architectures — the Simplified Graph Convolution (SGC) and Linear Graph Convolution (LGC) models — and evaluates them on open benchmark graph datasets and semi-supervised learning tasks using quantum simulation. We compare predictive performance and optimization behavior against classical baselines, showing that the quantum models achieve competitive performance with fewer parameters. Finally, we present a cost gradient analysis that identifies the tasks for which the models showcased are trainable. This is followed by a classical simulability study to find regimes in which the proposed circuits remain robust during training.
Read the full abstract

All authors Paul San Sebastian Sein, Theodor Iosif, Tilen G. Limbäck-Stokin, Kin Ian Lo, Yidong Liao

Quantum Physics

Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem

Recent advances in quantum computing hardware toward fault-tolerance have increased interest in evaluating near-term quantum platforms on application-relevant quantum algorithms. In this work, we introduce Quantum WalkScore (QWS), a scalable application-oriented benchmark designed to assess the performance of NISQ and future fault-tolerant quantum computers in executing essential quantum routines –discrete-time quantum walks and quantum amplitude amplification– to solve the graph nodefinding problem (marked-vertex search). QWS quantifies performance by scoring the largest problem size for which a designated target node can be found with success probability above a defined threshold. In addition to the complete protocol description, we provide example parameter-selection scenarios designed from noiseless simulation results and demonstrate QWS evaluation through experimental runs on multiple generations of IBM real quantum processors.
Read the full abstract

Quantum Physics · Cross-listed from cond-mat.quant-gas

Odd/Even or Half ? Entanglement Anomaly in the Bose-Hubbard model

The area law relates the bipartite entanglement entropy of a quantum many-body ground state to the size of the boundary between the subsystems, but the geometry of this boundary is rarely discussed. We inspect this in the 1D Bose-Hubbard model at fixed density by comparing four spatial bipartitions of the periodic lattice: first half, second half, even sites, and odd sites; sharing the same number of sites but differing in how the boundary is arranged. We find analytical limits with perturbation theory: in the Mott insulator the contiguous cut obeys the area lay while the alternating cut obeys a volume law $S\propto N_s$, in this sense an anomaly, and for the superfluid both cuts colapse to the binomial saturation due to delocalization of the state. We formulate these limits as a statement about the many-body problem using a generalized slave-boson approach based on mean-field with quantum fluctuations while verifying with Exact Diagonalization (ED) for small lattice sizes and Densitiy Matrix Renormalization Group (DMRG) simulations for $N_s\gg 1$. The slave-boson Gaussian ground state allows to compute the entanglement entropy from a reduced correlation matrix for any desired bipartition consistent with ED and DMRG results. Using slave bosons the computational cost is set by the local cutoff $n_{\max}$ rather than the Hilbert space dimension, so we can reach lattice sizes far beyond ED. Our method is capable of establishing the partition-dependent scaling laws as a many-body feature, not only a finite-size effect, in great agreement with the ED for $N_s\in[4,10]$ and DMRG for larger lattice sizes.
Read the full abstract

Quantum Physics

Automated search for highly contextual Kochen-Specker proofs

Observable-based Kochen-Specker proofs are configurations of multi-qubit Pauli observables grouped into contexts whose products are plus or minus the indentity. Their robustness as state-independent contextuality tests can be measured by the tolerated error per context $\varepsilon = 2d/|H|$, where $d$ is the contextuality degree and $|H|$ the number of contexts. Since the degree depends only on an underlying abstract structure called the hypergram i.e. the pair formed by the context hypergraph and the anticommutation graph, the search for highly contextual proofs can be carried out on them instead, with no reference to qubits or to any particular Pauli labeling. We further exploit this by enumerating anticommutation graphs first, and then by associating to each graph $G$ the single hypergram carrying its entire hypergraph support $HS(G)$, so that exactly one candidate is examined per graph. Applied to the House of Graphs database and to censuses of vertex-transitive graphs on at most 24 vertices, this pipeline recovers the Peres-Mermin square, the doily and the Mermin pentagram, and yields configurations reaching $\varepsilon = 0.707$, against $0.424$ for the previous published record. The best configurations are predominantly those stemming from line graphs and unions of graphs; we explain the former by showing that every perfect matching of a graph is a context of its line graph, which exhibits the Peres-Mermin square and the doily as the first members of two infinite families. We close with finite geometric descriptions of the most striking configurations inside symplectic polar spaces, in terms of ovoids, hyperbolic quadrics and Fano planes.
Read the full abstract

Quantum Physics

Long-horizon autoformalization of a core theorem underlying MIP* = RE

Landmark mathematical formalizations have taken specialist teams years to complete. We present FormalFlow, a system that coordinates AI proving agents under human supervision to address statement drift and proof composition in long-horizon formalization. Drawing on software engineering principles and practices, it uses a shared blueprint to guide nested planning, proving and review loops. Agents strengthen verification and review throughout formalization. We completed a machine-checked Lean 4 proof of the quantum soundness of the classical low individual-degree test, a core theorem underlying MIP* = RE. Developing the proof took 63 days; greater parallelism could further reduce this time. The final library contains 126,367 lines of Lean code, all generated by agents. The formalization corrects side conditions and intermediate errors while preserving the published final error bound under corrected assumptions. This work provides a verified foundation for quantum complexity and demonstrates a route to affordable verification of major research proofs by small teams.
Read the full abstract

All authors Sirui Lu, Ruixuan Deng, David Zhu, Zhengfeng Ji

Quantum Physics

Local unitary equivalence of orthogonal arrays and related linear codes

Orthogonal arrays (OAs) are combinatorial configurations with applications in experimental design, error-correcting codes, and quantum information. Local unitary (LU) equivalence provides a natural framework for classifying multipartite entangled states. Using the correspondence between OAs and quantum states, Goyeneche and Życzkowski [Phys. Rev. A, 2014, 90: 022316] posed the problem of determining when OAs are $LU$ equivalent. In this paper, we construct OAs from generator matrices and establish conditions for Fourier-based $LU$ equivalence of OAs and irredundant orthogonal arrays (IrOAs). For prime alphabets, we identify the Fourier partners of the linear OAs considered here with the arrays of their corresponding dual codes. This gives an explicit connection between $LU$ equivalence and coding theory. We also identify families of $LU$ equivalent OAs arising from specific classes of linear codes.
Read the full abstract

All authors Miaomiao Zheng, Yajuan Zang, Xiuling Shan, Zihong Tian

Quantum Physics · Cross-listed from physics.atom-ph

Observation of multiphoton entanglement in resonance fluoresce

Resonance fluorescence, the process in which a single two-level quantum emitter interacts with a near-resonant coherent light, is a cornerstone of quantum optics as a paradigmatic light-matter interaction. Quantum phenomena in resonance fluorescence have been accounted for in terms of one- and two-photon processes; however, the physical processes arising from the interaction of a single two-level atom with higher photon numbers remain unexplored experimentally. Here we experimentally reveal the multiphoton scattering nature of resonance fluorescence, which intrinsically gives rise to multiphoton entanglement. By accessing quantum fluctuations in the field emitted from a cavity-quantum electrodynamics system, we resolve third- and fourth-order photon scattering events from a single two-level atom. In the three-photon component, the scattered photons are shown to be genuinely energy-time entangled, as verified by a violation of Svetlichny's inequality. As a demonstration of an application, a quantum secret sharing protocol (QSS) is implemented using this entangled photon source. Our study refines the descriptive framework of resonance fluorescence and broadens the scope of its investigation. It also establishes a fundamentally simple route for generating multiphoton entangled states for quantum information processing and quantum metrology.
Read the full abstract

All authors Xiao-Long Zhou, Jian Wang, Ze-Min Shen, Dong-Yu Huang, Si-Jian He, Qi-Yang Huang, Yi-Jia Liu, Yu-Shu Chen, Quan Jiang, Chuan-Feng Li, Guang-Can Guo

Quantum Physics

90%-Efficient Optical Storage in a Rare-Earth Crystal with a Low-Loss Impedance-Matched Cavity

High-efficiency optical storage in rare-earth-ion-doped crystals is challenging because of their typically weak optical absorption,which makes cavity-enhanced memories highly sensitive to parasitic intracavity loss. Here we demonstrate a 90.1(5)% storage efficiency for coherent optical pulses in an impedance-matched cavity atomic-frequency-comb memory based on Eu3+:Y2SiO5. The Brewster-angle configuration of the crystal and fully cryogenic Fabry-Pérot cavity reduce the round-trip intracavity loss to 0.37%. Quantitative modeling shows that further improvement is limited primarily by AFC preparation and its associated dispersive response rather than by residual cavity loss,identifying the principal requirements for further approaching unity efficiency.
Read the full abstract

All authors Weiye Sun, Fudong Wang, Mucheng Guo, Xiantong An, Zhenqi Xu, Zhehao Xu, Xingmin He, Matthew J.Sellars, Shuping Liu, and Manjin Zhong

Quantum Physics · Cross-listed from hep-th

Variational Solution of Non-Hermitian Quantum Field Theory in Two Dimensions

This work describes a variational technique to solve non-Hermitian quantum systems, in particular those with negative coupling quartic self-interaction. Differences of applying variational methods from standard quantum mechanics to non-Hermitian quantum mechanics – including potential pitfalls – are highlighted. A successful implementation of the variational approach for the non-Hermitian case is presented. The technique is used to analyze scalar quantum field theory in d=2 with negative quartic self-interaction in the Hamiltonian formulation in lattice discretization.
Read the full abstract

Quantum Physics

Transduction-Enabled Superconducting Quantum Repeater: Toward Deterministic Entanglement Distribution with High-Fidelity Gates

Long-distance entanglement distribution is hindered by photon loss in optical fibers and the nocloning theorem. Optical quantum repeater (QR) protocols rely on Bell state measurements (BSMs), they are intrinsically limited to probabilistic photon operations and fail 50% of the time. We propose a hybrid approach to building quantum repeaters that combines the high transmission speed of photonic qubits in optical fiber with the high-fidelity quantum processing capabilities enabled by superconducting circuits. The transduction-enabled superconducting QR (TESQR) architecture eliminates the need for probabilistic BSMs and allows deterministic processing operations. The TESQR framework always yields a final state at the remote nodes rather than aborting on photon loss, manifesting deterministic entanglement distribution within certain parameter regimes. We evaluate the performance by assessing output-state fidelities and success probabilities of entanglement distribution using realistic noise models. Additionally, we integrate an entanglement purification scheme and evaluate the performance through numerical simulations in QuTiP environment. Our results show that, for entanglement swapping, the proposed scheme improves the entanglement distribution rate by an average of 63% and by up to 159% compared with photonic-only architectures. Moreover, after purification, the end-to-end fidelities exceed 0.8 over distances up to 20 km.
Read the full abstract

All authors Francesco Fiorini, Jing Wu, Andrew Cameron, Changqing Wang, Doga M. Kurkcuoglu, Rosario G. Garroppo, Michele Pagano, Silvia Zorzetti

Quantum Physics

Scalable entanglement distribution using encoded hybrid repeater chains

Long-distance entanglement distribution requires error correction protocols to compensate for qubit decoherence in quantum memories and noise introduced during entanglement swapping. We argue that repeater chains with error-correction capabilities should exploit more than one physical platform, combining the complementary strengths of different quantum memory technologies into a single hybrid repeater architecture. An important constituent of such an architecture is a hybrid repeater which combines type-1 memories, characterized by fast entanglement generation rates and suitability for multiplexing, and type-2 memories that offer long coherence times and low two-qubit gate error rates. Taking the resource-intensive nature of hybrid nodes into account, we propose and analyze repeater chains in which only a subset of nodes need to be hybrid, while the remaining nodes are simpler first-generation repeaters with no error-correction capability. Through detailed Monte Carlo simulations of fault-tolerant encoded repeater chain protocols based on the three-qubit phase-flip repetition code, the $[[7,1,3]]$ Steane code, and the $[[9,1,3]]$ Shor code, we demonstrate that these hybrid architectures outperform pure architectures based on a single memory platform in terms of end-to-end entanglement distribution rate. In our study we develop a full circuit-level noise model of our architectures and examine the impact of an imperfect interface between the two platforms on our hybrid architecture. We also develop a modified version of the swap-as-soon-as-possible policy with multiplexing, more suited to our architecture where some nodes perform error-correction while others do not. This modified policy significantly reduces the information storage time in memory qubits relative to the previously considered swap policies in encoded repeater chains.
Read the full abstract

All authors Stav Haldar, Saikat Guha, Don Towsley, Filip Rozpędek

Quantum Physics · Cross-listed from physics.optics

Rapidity-Coupled Spin Dynamics in Pulsed Laser Fields from Physics-Informed Neural Networks

Carrier-envelope-phase (CEP) stabilized few-cycle pulses make the sub-cycle field structure a control parameter for laser-driven polarized electron sources, yet spin solvers for such pulses are rarely tested against exact results. We show that for an electron initially at rest in a linearly polarized plane-wave pulse the rest-frame polarization angle follows the instantaneous vector potential, $\Sigma = 2\arctan(a_x/2) + a_e a_x$ with $a_e$ the electron anomaly: the net rotation vanishes for every CEP, while the peak intra-pulse angle varies over the CEP by 3.02 degrees for a two-cycle and by 0.22 degrees for an eight-cycle pulse. The result follows from the Volkov orbit in longitudinal and transverse rapidities. We use it to validate a light-front reference integrator and a physics-informed neural network trained only on the light-front equations, which reaches $4\times10^{-5}$ in the spin sector and carries over to elliptical polarization, for which no closed-form solution is known. This gives validated tools for CEP-resolved spin dynamics in intense fields.
Read the full abstract

All authors N. S. Akintsov, A. P. Nevecheria, S. N. Andreev, Qing-Hua Qin

Quantum Physics

Exact Local Optimality Does Not Compose: Invariant Simplices and the Complexity of Chronological Stochastic Realization

Probabilistic models constructed separately for different families of experiments are often expected to share one latent dynamical system. We formalize the resulting shared finite partial-realization problem as chronological stochastic realization: deciding whether finite partial response specifications admit a chronological shared stochastic model (CSSM) within a prescribed state budget. A CSSM is a normalized probabilistic automaton in which multiple named preparations share stochastic transitions and a single terminal effect. Local and tagged-static optimality do not compose at fixed dimension. For every $k,L\ge1$, we construct finite menus with local and tagged-static widths $k$, yet chronological width exactly $k(L+1)$, isolating compatibility with word composition as an independent state resource. In the ordinary-rank-tight calibrated regime, an exact $k$-state CSSM exists if and only if a $(k-1)$-simplex contains the root responses, lies in the response polytope, and is forward invariant under every primitive affine update. For finite rational menus, deciding whether an exact CSSM with at most $K$ states exists is $\exists\mathbb{R}$-complete. The promise problem distinguishing zero minimax defect from defect at least $\epsilon$ is $\mathsf{PromiseNP}$-complete, with hardness already holding for inverse-polynomial $\epsilon$. Both classifications hold over a fixed five-letter alphabet on instances where every individual menu and the tagged independent-query static relaxation have exact minimum state count $K$. They also hold with Boolean terminal effects, and the robust soundness gap remains valid over all effects in $[0,1]^d$. Thus chronological compatibility remains computationally hard even when the local and tagged-static optima are fixed at $K$.
Read the full abstract

Quantum Physics

Linear combination of Schrödingerization for quantum linear systems with optimal matrix-query complexity

Quantum linear systems algorithms (QLSAs) aim to solve linear systems $A\bb{x}=\bb{b}$ exponentially faster than classical methods under certain conditions. In this work, we develop quantum algorithms for solving linear algebraic equations from an ODE-based perspective. Inspired by the linear combination of Hamiltonian simulation (LCHS) representation in the Fourier approach \cite{Childs2017QLSA}, we express the solution $\bb{x}$ as a linear combination of solutions to a system of linear convection equations, which become Schrödinger-type equations with unitary evolutions in the Fourier domain. We refer to this representation as LC-Schrödingerization. Based on this result, we construct an LCHS-based quantum algorithm with two LCHS instances: one for time-marching and one for numerical integration. The key construction uses the derivative of a Gaussian-smoothed hat function and recovers the solution over a fixed auxiliary interval. This permits a truncation time independent of the target accuracy and avoids the loss in success probability from selecting a single grid point. Periodization and explicit Fourier coefficients provide the corresponding projection error bounds. Under the stated oracle assumptions and given a constant-factor estimate of the solution norm, direct simulation of the select operators and block preconditioning achieve the optimal matrix-query complexity $\mathcal{O}(\kappa_A\log\frac1\varepsilon)$ without using variable-time amplitude amplification (VTAA). The same upper bound holds for queries to the right-hand-side preparation oracle.
Read the full abstract

Quantum Physics

Improving Sample Efficiency in Peptide-HLA Binding Prediction with Hybrid Quantum-Classical Neural Networks

Peptide-HLA binding prediction is a critical step in neoantigen identification for personalized cancer immunotherapy and holds significant clinical value. However, the training data available for many HLA alleles are extremely limited, which severely constrains the performance of conventional methods on this task. Parameterized quantum circuits are hypothesized to induce inductive biases beneficial for learning from small datasets, yet their application to biological sequence prediction remains underexplored. To address this, we propose a hybrid quantum-classical neural network (HQNN) specifically designed for peptide-HLA binding prediction. HQNN integrates multi-source biological feature encoding with parallel quantum feature extractors and a quantum-enhanced classifier. On two HLA alleles (A*02:01 and B*07:02), HQNN outperforms a parameter-matched classical CNN baseline across all training sizes, with the performance gap widening as training data decreases. Ablation studies confirm the respective contributions of the quantum feature extraction module and the quantum classifier. In noise-aware simulations, performance degrades only mildly, and such degradation is reasonable and acceptable under realistic quantum hardware noise levels. These results suggest that hybrid quantum-classical architectures can provide practical sample-efficiency gains for immunoinformatics tasks in low-data regimes.
Read the full abstract

All authors Chenyan Jia, Cong Guo, Siyue Chen, Pengpeng Ye, Xiaochun Chen

Quantum Physics

Quantum computers will not be that different: A blueprint for quantum computer architecture at scale

Quantum computers are technologically novel and unusual, but at system scale they should be engineered using many of the same principles that govern classical heterogeneous accelerators. This paper argues that utility-scale quantum architecture is primarily a cost-performance problem across a coupled quantum-classical system, leading to a blueprint for scalable quantum processing unit (QPU) design. Our architecture blueprint is organized around clean logical abstractions, hiding details and complexity of physical qubit modalities below the instruction set architecture (ISA) boundary, and specializes recurring functions aggressively to minimize the cost for utility scale quantum computations. Its low-level implementation through specialized local hardware for control, readout, and quantum error correction (QEC) closely resembles the architecture of high-performance network stacks. One of our main insights is that the design principles and the resulting architecture closely follow established practice from classical computing and networking.
Read the full abstract

Quantum Physics

Experimental certification of the nonlocal advantages of quantum imaginarity

Quantum imaginarity is a distinct resource in quantum information theory, yet its nonlocal properties have not been fully explored. Here, we report an experimental study of the nonlocal advantage of quantum imaginarity (NAQI), in which local measurements on one subsystem can steer the average imaginarity of the conditional states of the other subsystem beyond the corresponding classical bound. The $l_1$-norm of imaginarity inequality is adopted as an experimentally accessible witness. A hybrid optimization algorithm that combines a genetic algorithm with sequential quadratic programming is developed to avoid local optima and accelerate the search for optimal measurement settings. Using polarization-encoded photonic qubits, we prepare two classes of two-qubit Bell-diagonal states and experimentally characterize the imaginarity of the conditional states following local measurements. Clear violations of the $l_1$-norm of imaginarity inequality are observed, providing an experimental certification of NAQI. We further investigate the relationship among NAQI, the nonlocal advantage of quantum coherence (NAQC), and Bell nonlocality based on their respective inequality criteria. For the two-qubit Werner states considered in this work, the regions of states that violate the respective criteria satisfy $\mathcal{D}_{\rm NAQC}\subset\mathcal{D}_{\rm NAQI}\subset\mathcal{D}_{\rm BN}$. Our work provides an experimental realization of NAQI and a comparison of different forms of quantum nonclassicality in a photonic platform.
Read the full abstract

All authors Jian-Hao Wu, Kai-Yu Yuan, Yun-Xiang Tian, Hao-Ran Tan, Yan-Xin Rong, Zhen Shang, Yong-Jian Gu, Ya Xiao

Quantum Physics

A Restricted Boltzmann Machine with Quantum-State Visible Units

We construct a restricted Boltzmann machine (RBM) whose visible input is a quantum state rather than a classical configuration. Each hidden unit carries a trainable quantum template prepared by a parametrized circuit and converts its overlap with the input into a feature. Treating quantum states as high-dimensional continuous visible objects creates nontrivial normalization and scaling problems. We regularize the continuous likelihood and derive two controlled high-dimensional limits, yielding a Hopfield-type network with continuous Hilbert-space patterns and a data-augmented Gram likelihood. The resulting algorithms are compact and use trainable circuit-prepared templates as measurement intermediaries between quantum data and classical optimization. Numerical simulations across several many-body systems demonstrate effective quantum-phase recognition and multicomponent feature extraction.
Read the full abstract

All authors Zhe-Hao Zhang, Yi-Cong Yu, Xiaoming Cai, Hai-Qing Lin

Quantum Physics

Dephasing-Enhanced Response and Phase Transitions in Quantum Boltzmann Samplers

Dephasing can drive a quantum Boltzmann sampler into an ordered phase while its programmed probability distribution remains disordered. We trace this transition to an enhanced conditional response: coherence loss changes how each spin responds to its neighbors, and interactions amplify the change. For all-to-all coupling, we establish the stationary transition at finite dephasing. Near criticality, the magnetization distribution depends on the ratio of dephasing strength to the square root of system size, retaining a finite imprint of coherence even as the local coherent correction vanishes. In the strong-dephasing limit on a square lattice, the dynamics generates effective multispin interactions and probability currents, with Ising-like critical statistics. Adjusting the local dissipative update restores the target probability process on arbitrary graphs.
Read the full abstract

All authors Yu-Xuan Zhang, Jing-Ling Chen, Leong-Chuan Kwek, Peng Wang

Quantum Physics

Vehicle-Routing Clustering by Sparse Quantum Relaxation

This paper studies the cluster-assignment layer of a cluster-first-route-second decomposition for the capacitated pickup-and-delivery problem with time windows (CPDPTW), instead of a direct route-ordering quadratic unconstrained binary optimization (QUBO). Sample-based subspace diagonalization (SQD) degenerates to best-of-shots for any diagonal optimization Hamiltonian, so a useful transfer to routing requires non-diagonal relaxation. Quantum random access optimization (QRAO) provides this non-diagonality by encoding binary variables through non-commuting quantum random access code (QRAC) observables. CPDPTW-derived conflict graphs expose a routing-specific obstruction because dense objectives and penalty-encoded constraints destroy QRAO compression. We keep the Hamiltonian sparse by encoding only the sparsified objective and enforcing one-hot, capacity, and cluster time-budget feasibility by repair after rounding. We make no quantum-advantage claim. Under strong repair the classical pass alone reaches near-optimal cost at the tested sizes. The result is a regime map linking sparsification, achieved compression, linear-combination-of-unitaries (LCU) 1-norm, heavy-hex two-qubit depth, sampling drift, and final routing quality on Qiskit Aer, calibrated FakeTorino, and IBM Heron ibm_quebec. Across a 108-row ideal-calibrated-hardware evaluation grid spanning four to twelve pickup-delivery request pairs, the hardware slice has mean gap 0.0016 and mean device-vs-ideal total variation distance (TVD) 0.279; a decoder ablation at sizes six through twelve isolates the non-diagonal signal.
Read the full abstract

Quantum Physics · Cross-listed from cond-mat.str-el

Universality of the $1/9$ Magnetization Plateau and Quantum-Disordered States in the Kagome Family $\mathrm{Cs_8AB_3Ti_{12}F_{48}}$ ($A=\mathrm{Rb},\mathrm{Li}$; $B=\mathrm{K},\mathrm{Na}$)

The microscopic origin of the low-field $1/9$ magnetization plateau in spin-$1/2$ kagome antiferromagnets remains unresolved. Here, we show that chemical pressure reshapes the hierarchy of fractional magnetization plateaus in the titanium-based kagome family $\mathrm{Cs_8AB_3Ti_{12}F_{48}}$ ($A=\mathrm{Rb},\mathrm{Li}$; $B=\mathrm{K},\mathrm{Na}$). High-field magnetization measurements up to 60 T reveal a robust $1/9$ plateau-like phase in the expanded $\mathrm{Cs_8RbK_3Ti_{12}F_{48}}$ and $\mathrm{Cs_8LiK_3Ti_{12}F_{48}}$ compounds, despite the absence of the conventionally more robust $1/3$ plateau. In contrast, compressed $\mathrm{Cs_8LiNa_3Ti_{12}F_{48}}$ exhibits neither the $1/9$ plateau-like phase nor a quantum-disordered ground state. Specific-heat measurements and first-principles calculations show that lattice expansion preserves a frustrated, fully connected kagome exchange network and gapless quantum-disordered ground states, whereas compression reorganizes the exchange network into weakly coupled quasi-one-dimensional subsystems and induces successive magnetic transitions. These results demonstrate that the $1/9$ and $1/3$ plateaus need not share a common microscopic origin and suggest that the $1/9$ plateau may represent a more universal feature of frustrated spin-$1/2$ kagome magnetism.
Read the full abstract

All authors Prena Chaudhary, Asiri Thennakoon, Tommy Park, Hanru Wang, Leshan Zhao, Laurel Winter, Neil Herrison, Christina Hoffmann, Junghong H. He, Harald O. Jeschke, Hiroyuki Nojiri, Akira Matsuo, Koichi Kindo, Miwako Takahashi, Yukio Noda, Taku J. Sato, Shiyan Li, Hiroaki Ueda, Gia-Wei Chern, Seung-Hun Lee

Quantum Physics

A Bi-Objective Routing Framework for Hybrid Terrestrial-Satellite Quantum Networks

Hybrid terrestrial-satellite quantum networks combine terrestrial fiber infrastructure with free-space links to enable long-distance entanglement distribution. Entanglement can be routed over different combinations of terrestrial and satellite links, resulting in paths with different entanglement generation rates (EGRs) and fidelities. Existing routing algorithms, however, typically reduce routing to a single-objective problem by optimizing either EGR or fidelity, or by optimizing one while constraining the other, and thus do not explicitly capture the trade-off between the two. In this paper, we present a bi-objective routing framework for hybrid quantum networks that jointly optimizes end-to-end EGR and fidelity. We formulate routing as a Pareto optimization problem and show that it possesses a special mathematical structure: the bottleneck nature of end-to-end EGR and the multiplicative nature of end-to-end fidelity allow the problem to be transformed into a MAXMIN-MINSUM bi-criterion path problem. This transformation enables the exact polynomial-time computation of a minimal complete Pareto set using Martins' bicriterion routing algorithm. Our results demonstrate that hybrid networks expose substantially richer Pareto frontiers than terrestrial-only networks and that the proposed framework outperforms representative single-objective routing policies by allowing applications to select paths based on their EGR and fidelity requirements.
Read the full abstract

Quantum Physics

Symmetry-driven correlation patterns in one-dimensional periodic fermionic systems: closed-form expressions and exact selection rules for correlation functions, entanglement entropies and mutual information

We present an analytical study of the spatial structure of correlations in periodic fermionic systems at the single Slater determinant level, focusing on the cyclic case. Exploiting cyclic symmetry, the transformation from localized orbitals to molecular orbitals is simultaneously a discrete Fourier transform, a Vandermonde matrix on the roots of unity, a complex Hadamard matrix, and the character table of the cyclic group $C_m$. Within this framework, the spatial structure of correlations is fully determined by the occupied irreducible representations (Fourier modes), independently of the specific Hamiltonian generating them. In particular, the fermionic two-point correlator is expressed as a truncated Fourier sum over the occupied orbitals, leading to exact analytical expressions for symmetric occupation patterns of Fourier modes ($\ell$ and $-\ell$ pairs), corresponding in quantum chemistry to aromatic fillings, i.e. fillings satisfying Hückel's $4n + 2$ rule. For the half filling case, we derive exact spatial selection rules. In particular, the two-point correlator vanishes identically for all even distances along the ring. This property propagates to reduced density matrices and implies a complete absence of mutual information between the corresponding orbitals. These results reveal that, despite the global delocalization of molecular orbitals, the correlation structure in cyclic systems is highly non-uniform and governed by symmetry-induced interference. Although formulated in terms of cyclic lattice systems, the present results extend straightforwardly to one-dimensional fermionic chains with periodic conditions, reflecting the underlying translational symmetry of the problem. The framework therefore provides a Hamiltonian-independent and universal reference for understanding correlation patterns in one-dimensional periodic fermionic systems.
Read the full abstract