{ "name": "papers-crossref", "version": "0.1.0", "license": "Bibliographic metadata redistributable; per-record copyright with publisher", "source": "crossref.org, 21 journals, since 2025-09-01", "ts": "2026-05-28T17:28:36.599Z", "count_total": 500, "count_india_hint": 7, "by_journal": { "PRX Quantum": 25, "Quantum": 25, "npj Quantum Information": 25, "Quantum Science and Technology": 25, "Quantum Information Processing": 25, "ACM Transactions on Quantum Computing": 25, "Quantum Machine Intelligence": 25, "Quantum Reports": 25, "Physical Review A": 25, "Physical Review Research": 25, "Physical Review X": 25, "Physical Review Letters": 25, "New Journal of Physics": 25, "Nature Communications": 25, "Nature Physics": 25, "Communications Physics": 25, "Journal of Physics A: Mathematical and Theoretical": 25, "IACR Transactions on Cryptographic Hardware and Embedded Systems": 25, "Designs, Codes and Cryptography": 25, "Journal of Cryptology": 25 }, "by_topic": { "unclassified": 223, "general": 154, "algorithms": 21, "foundations": 18, "qml": 15, "error-correction": 15, "pqc": 15, "hardware": 11, "communication": 10, "sensing": 10, "simulation": 8 }, "by_topic_india": { "foundations": 2, "general": 2, "qml": 1, "communication": 1, "unclassified": 1 }, "count": 500, "rows": [ { "doi": "10.1103/sdlx-d3tn", "url": "https://doi.org/10.1103/sdlx-d3tn", "title": "Beyond belief Propagation: Cluster-Corrected tensor network contraction with exponential convergence", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/pw51-tnsz", "url": "https://doi.org/10.1103/pw51-tnsz", "title": "Quantifying Robustness and Locality of Majorana Bound States in Interacting Systems", "abstract": "Protecting qubits from perturbations is a central challenge in quantum computing. Topological superconductors with separated Majorana bound states (MBSs) provide a strong form of protection that only depends on the locality of perturbations. While the link between MBS separation, robust degeneracy, and protected braiding is well understood in noninteracting systems, recent experimental progress in short quantum-dot-based Kitaev chains highlights the need to establish these connections rigorously for interacting systems. We do this by defining MBSs from many-body ground states and show how their locality constrains their coupling to an environment. This, in turn, quantifies the protection of the energy degeneracy and the feasibility of non-abelian braiding.", "authors": [ { "name": "William Samuelson", "affiliations": [ "Lund University" ] }, { "name": "Juan Daniel Torres Luna", "affiliations": [ "Delft University of Technology" ] }, { "name": "Sebastian Miles", "affiliations": [ "Delft University of Technology" ] }, { "name": "A. Mert Bozkurt", "affiliations": [ "Delft University of Technology" ] }, { "name": "Martin Leijnse", "affiliations": [ "Lund University" ] }, { "name": "Michael Wimmer", "affiliations": [ "Lund University" ] }, { "name": "Viktor Svensson", "affiliations": [ "University of Oslo" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/2tt3-yndr", "url": "https://doi.org/10.1103/2tt3-yndr", "title": "Fourier Neural Operators for Time-Periodic Quantum Systems: Learning Floquet Hamiltonians, Observable Dynamics, and Operator Growth", "abstract": "Time-periodic quantum systems exhibit a rich variety of far-from-equilibrium phenomena and serve as ideal platforms for quantum engineering and control. However, simulating their dynamics with conventional numerical methods remains challenging due to the exponential growth of Hilbert space dimension and rapid spreading of entanglement. In this work, we introduce Fourier neural operators (FNOs) as an efficient, accurate, and scalable framework for nonequilibrium quantum dynamics. Parameterized in Fourier space, FNO naturally captures temporal correlations and remains minimally dependent on discretization of time. We demonstrate the versatility of FNO through three complementary learning paradigms: reconstructing effective Floquet Hamiltonians, predicting expectation values of local observables, and learning quantum information spreading. For each learning task, FNO achieves remarkable accuracy, while attaining a significant speedup, compared to exact numerical methods. Moreover, FNO possesses capabilities beyond that of conventional methods, such as predicting all local observables from a subset of measurements without information about the Hamiltonian, as well as extrapolating beyond the time window provided by training data, enabling access to observables and operator-spreading dynamics that might be beyond the coherence time. By employing a spatially local basis, we argue that the computational cost of FNOs scales only polynomially with the system size. Our results establish FNO as a versatile and scalable computation framework that integrates numerical simulations and experimental data seamlessly, with direct implications for extracting meaningful physics from measurements by near-term quantum computers.", "authors": [ { "name": "Zihao Qi", "affiliations": [ "Cornell University" ] }, { "name": "Yang Peng", "affiliations": [ "California State University, Northridge", "California Institute of Technology" ] }, { "name": "Christopher Earls", "affiliations": [ "Cornell University" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/phk5-slkl", "url": "https://doi.org/10.1103/phk5-slkl", "title": "Faster algorithmic quantum and classical simulations by corrected product formulas", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/8q24-zj73", "url": "https://doi.org/10.1103/8q24-zj73", "title": "Color It, Code It, Cancel It: k -Local Dynamical Decoupling from Classical Additive Codes", "abstract": "Dynamical decoupling is a central technique in quantum computing for actively suppressing decoherence and systematic imperfections through sequences of single-qubit operations. Conventional sequences typically aim to completely freeze system dynamics, often resulting in long protocols whose length scales exponentially with system size. In this work, we introduce a general framework for constructing time-optimal, selectively tailored sequences that remove only specific local interactions. By combining techniques from graph coloring and classical coding theory, our approach enables compact and hardware-tailored sequences across diverse qubit platforms, efficiently canceling undesired Hamiltonian terms while preserving target interactions. This opens up broad applications in quantum computing and simulation. At the core of our method is a mapping between dynamical decoupling sequence design and error-detecting codes, which allows us to leverage powerful coding-theoretic tools to construct customized sequences. To overcome exponential overheads, we exploit symmetries in colored interaction hypergraphs, extending graph-coloring strategies to arbitrary many-body Hamiltonians. We demonstrate the effectiveness of our framework through concrete examples, including compact sequences that suppress residual ZZ and ZZZ interactions in superconducting qubits and Heisenberg exchange coupling in spin qubits. We also show how it enables Hamiltonian engineering by simulating the anisotropic Kitaev honeycomb model using only isotropic Heisenberg interactions.", "authors": [ { "name": "Minh T.P. Nguyen", "affiliations": [ "QuTech and Kavli Institute of Nanoscience", "Delft University of Technology" ] }, { "name": "Maximilian Rimbach-Russ", "affiliations": [ "QuTech and Kavli Institute of Nanoscience", "Delft University of Technology" ] }, { "name": "Stefano Bosco", "affiliations": [ "QuTech and Kavli Institute of Nanoscience", "Delft University of Technology" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/jszm-48h7", "url": "https://doi.org/10.1103/jszm-48h7", "title": "Erasure Conversion in Integer Fluxonium Qubits", "abstract": "We propose an erasure conversion scheme on the | e ⟩ − | f ⟩ and | g ⟩ − | f ⟩ qubits in integer fluxonium qubits (IFQs), which are both first-order insensitive to 1 / f flux noise. The | e ⟩ − | f ⟩ transition is identical to that of a usual fluxonium qubit and hence is expected to have excellent coherence time, while the | g ⟩ − | f ⟩ transition is additionally protected from the energy relaxation by the parity symmetry. The dominant error in both qubits arises due to the energy relaxation: from | e ⟩ to | g ⟩ in the e-f qubit and from | f ⟩ to | e ⟩ in the g-f qubit. Such errors can be treated as erasure events, and their efficient detection improves the performance of quantum error-correcting codes. We consider a protocol for such erasure conversion based on the dispersive readout. Our main finding is that, with proper circuit parameter choice, carefully designed gate sets, and the integration of erasure conversion, IFQs promise highly effective coherence times.", "authors": [ { "name": "Jiakai Wang", "affiliations": [ "University of Wisconsin-Madison" ] }, { "name": "Raymond A. Mencia", "affiliations": [ "Ecole Polytechnique Federale de Lausanne", "University of Maryland, College Park" ] }, { "name": "Vladimir E. Manucharyan", "affiliations": [ "Ecole Polytechnique Federale de Lausanne", "University of Maryland, College Park" ] }, { "name": "Maxim G. Vavilov", "affiliations": [ "University of Wisconsin-Madison" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/rrrm-s1xn", "url": "https://doi.org/10.1103/rrrm-s1xn", "title": "Observation of Non-Hermitian Topology in Cold Rydberg Quantum Gases", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/6vd7-l9bn", "url": "https://doi.org/10.1103/6vd7-l9bn", "title": "Pauli Propagation: A computational framework for simulating quantum systems", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/vszq-z1sh", "url": "https://doi.org/10.1103/vszq-z1sh", "title": "Loss mechanisms in high-coherence multimode mechanical resonators coupled to superconducting circuits", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1103/6frk-891j", "url": "https://doi.org/10.1103/6frk-891j", "title": "Abelian State Hidden Subgroup Problem: Learning Stabilizer Groups and Beyond", "abstract": "Identifying the symmetry properties of quantum states is a central theme in quantum information theory and quantum many-body physics. In this work, we investigate quantum learning problems in which the goal is to identify a hidden symmetry of an unknown quantum state. Building on the recent formulation of the state hidden subgroup problem (StateHSP), we focus on abelian groups and develop an efficient quantum algorithm that learns any hidden symmetry subgroup using a generalized form of Fourier sampling. We showcase the versatility of the approach in three concrete applications: These are learning (i) qubit and qudit stabilizer groups, (ii) cuts along which a state is unentangled, and (iii) hidden translation symmetries. Through these applications, we reveal that well-known quantum learning primitives, such as Bell sampling and Bell difference sampling, are, in fact, special cases of Fourier sampling. Our results highlight the broad potential of the StateHSP framework for symmetry-based quantum learning tasks and provide protocols that are easier to implement on near-term quantum devices.", "authors": [ { "name": "Marcel Hinsche", "affiliations": [ "Freie Universität Berlin" ] }, { "name": "Jens Eisert", "affiliations": [ "Freie Universität Berlin" ] }, { "name": "Jose Carrasco", "affiliations": [ "Freie Universität Berlin" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "algorithms", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1103/6k5x-ztqt", "url": "https://doi.org/10.1103/6k5x-ztqt", "title": "Beam search decoder for quantum low-density parity-check codes", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1103/dw2h-ll6r", "url": "https://doi.org/10.1103/dw2h-ll6r", "title": "Estimates of Loss Function Concentration in Noisy Parametrized Quantum Circuits", "abstract": "Variational quantum computing offers a powerful framework with applications across diverse fields such as quantum chemistry, machine learning, and optimization. However, its scalability is hindered by the exponential concentration of the loss function, known as the barren plateau problem. While significant progress has been made and prior work has separately analyzed barren plateaus in unitary and noisy settings, their combined impact remains poorly understood, largely due to limitations in conventional Lie-algebraic approaches. In this work, we introduce an analytical framework based on non-negative matrix theory that enables the description of the variance in layered noisy quantum circuits with arbitrary noise channels. This approach enables the derivation of exact expressions in the deep-circuit regime, uncovering the complex interplay between unitary layers and noise. Notably, we identify a noise-induced absorption mechanism - a phenomenon absent in purely unitary dynamics - which provides new insight into how noise shapes circuit behavior. We further present a controlled convergence analysis, establishing general lower bounds on the variance of both deep and shallow circuits. This leads to a principled connection between noise resilience and the expressive capacity of parameterized quantum circuits, particularly under smart initialization strategies. Our theoretical results are supported by numerical simulations and illustrative applications.", "authors": [ { "name": "Giulio Crognaletti", "affiliations": [ "University of Trieste", "Istituto Nazionale di Fisica Nucleare, Trieste Section", "European Organization for Nuclear Research (CERN)" ] }, { "name": "Michele Grossi", "affiliations": [ "European Organization for Nuclear Research (CERN)" ] }, { "name": "Angelo Bassi", "affiliations": [ "University of Trieste", "Istituto Nazionale di Fisica Nucleare, Trieste Section" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1103/wdyd-bvkr", "url": "https://doi.org/10.1103/wdyd-bvkr", "title": "Realization of an All-Optical Effective Negative-Mass Oscillator for Coherent Quantum Noise Cancellation", "abstract": "We report the realization of an all-optical, tabletop effective negative-mass oscillator (ENMO) scheme capable of canceling quantum noise when cascaded with an optomechanical sensor susceptible to (quantum) radiation pressure noise. Our coherent quantum noise cancellation (CQNC) scheme offers a broadband cancellation capability with a tunable, wavelength-flexible, and compact system. This is achieved through the implementation of an optical equivalent of an optomechanical interaction, facilitated by a down-conversion and a beam-splitting process [Tsang and Caves, Phys. Rev. Lett. , 1 (2010)]. The intricate nature of the system and its multiple interacting components made characterizing the interdependent parameters with conventional methods ineffective, leading to the development of an characterization scheme. The obtained parameters meet the targets for CQNC set in previous studies [Wimmer , Phys. Rev. A: At. Mol. Opt. Phys. , 053836 (2014)]. With our current realization, we project a broadband quantum noise reduction of 3.6 dB, corresponding to a 77 % reduction in quantum back-action noise at the optimal frequency of maximum reduction, indicating the readiness of the ENMO for application. We discuss the prospects for new applications in quantum information and communication using the same platform.", "authors": [ { "name": "Nived Johny", "affiliations": [ "Max Planck Institute for Gravitational Physics (Albert Einstein Institute)", "Leibniz Universität Hannover" ] }, { "name": "Jonas Junker", "affiliations": [ "Max Planck Institute for Gravitational Physics (Albert Einstein Institute)", "Leibniz Universität Hannover", "Institute for Applied Physics, Friedrich Schiller University Jena, Albert-Einstein-Str. 15, 07745 Jena", "Abbe Center of Photonics, Friedrich Schiller University Jena, Albert-Einstein-Str. 6, 07745 Jena", "Technical University of Denmark" ] }, { "name": "Bernd Schulte", "affiliations": [ "Max Planck Institute for Gravitational Physics (Albert Einstein Institute)", "Leibniz Universität Hannover" ] }, { "name": "Dennis Wilken", "affiliations": [ "Max Planck Institute for Gravitational Physics (Albert Einstein Institute)", "Leibniz Universität Hannover" ] }, { "name": "Klemens Hammerer", "affiliations": [ "Universität Innsbruck", "Austrian Academy of Sciences", "Leibniz Universität Hannover" ] }, { "name": "Michèle Heurs", "affiliations": [ "Max Planck Institute for Gravitational Physics (Albert Einstein Institute)", "Leibniz Universität Hannover" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1103/ry52-85ll", "url": "https://doi.org/10.1103/ry52-85ll", "title": "Intrinsic preservation of plasticity in continual quantum learning", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/nsjr-vnmg", "url": "https://doi.org/10.1103/nsjr-vnmg", "title": "Robust certification of non-projective measurements: theory and experiment", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/j1ts-9nys", "url": "https://doi.org/10.1103/j1ts-9nys", "title": "Microwave spectroscopy of few-carrier states in bilayer graphene quantum dots", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/4c33-b1dv", "url": "https://doi.org/10.1103/4c33-b1dv", "title": "Mode Multiplexing for Scalable Cavity-Enhanced Operations in Neutral-Atom Arrays", "abstract": "Neutral-atom arrays provide a versatile platform for quantum information processing. However, in large-scale arrays, efficient photon collection remains a bottleneck for key tasks such as fast, nondestructive qubit readout and remote entanglement distribution. We propose a cavity-based approach that enables fast, parallel operations over many atoms using multiple modes of a single optical cavity. By selectively shifting the relevant atomic transitions, each atom can be coupled to a distinct cavity mode, allowing independent simultaneous processing. We present practical system designs that support cavity-mode multiplexing with up to 50 modes, enabling rapid mid-circuit syndrome extraction and significantly enhancing entanglement distribution rates between remote atom arrays. This approach offers a scalable solution to core challenges in neutral-atom arrays, advancing the development of practical quantum technologies.", "authors": [ { "name": "Ziv Aqua", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Matthew L. Peters", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "David C. Spierings", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Guoqing Wang", "affiliations": [ "Massachusetts Institute of Technology", "Peking University" ] }, { "name": "Edita Bytyqi", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Thomas Propson", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Vladan Vuletić", "affiliations": [ "Massachusetts Institute of Technology" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/91yq-swlv", "url": "https://doi.org/10.1103/91yq-swlv", "title": "Exponentially accurate open quantum simulation via randomized dissipation with minimal ancilla", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1103/n86s-2b88", "url": "https://doi.org/10.1103/n86s-2b88", "title": "Above 99.9% Fidelity Single-Qubit Gates, Two-Qubit Gates, and Readout in a Single Superconducting Quantum Device", "abstract": "Achieving high-fidelity single-qubit gates, two-qubit gates, and qubit readout is critical for building scalable, error-corrected quantum computers. However, device parameters that enhance one operation often degrade the others, making simultaneous optimization challenging. Here, we demonstrate that careful tuning of qubit-coupler coupling strengths in a superconducting circuit with two transmon qubits coupled via a tunable coupler enables high-fidelity single- and two-qubit gates, without compromising readout performance. Furthermore, we introduce a new calibration protocol for diabatic controlled- Z gates, phased-averaged leakage error amplification (PALEA), which enables efficient suppression of coherent gate errors and leakage to noncomputational states. Using PALEA in combination with careful tuning of qubit-coupler coupling strengths, we achieve a 40 h-averaged CZ gate fidelity of 99.93 %, simultaneous single-qubit gate fidelities of 99.98 %, and readout fidelities over 99.94 % in a single device. Our results demonstrate a viable path toward scaling up superconducting quantum processors while maintaining consistently high gate and readout fidelities.", "authors": [ { "name": "Fabian Marxer", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Jakub Mrożek", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Joona Andersson", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Leonid Abdurakhimov", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Janos Adam", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Ville Bergholm", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Rohit Beriwal", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Chun Fai Chan", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Saga Dahl", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Soumya Ranjan Das", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Frank Deppe", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Olexiy Fedorets", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Zheming Gao", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Alejandro Gomez Frieiro", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Daria Gusenkova", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Andrew Guthrie", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Tuukka Hiltunen", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Hao Hsu", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Eric Hyyppä", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Joni Ikonen", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Sinan Inel", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Shan W. Jolin", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Azad Karis", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Seung-Goo Kim", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "William Kindel", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Anton Komlev", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Miikka Koistinen", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Roope Kokkoniemi", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Snigdha Kumar", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Hsiang-Sheng Ku", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Julia Lamprich", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Sami Laine", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Alessandro Landra", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Lan-Hsuan Lee", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Nizar Lethif", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Per Liebermann", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Wei Liu", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Kunal Mitra", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Tuomas Mylläri", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Caspar Ockeloen-Korppi", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Tuure Orell", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Alexander Plyshch", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Jukka Räbinä", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Arthur Rebello", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Michael Renger", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Outi Reentilä", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Jussi Ritvas", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Sampo Saarinen", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Otto Salmenkivi", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Matthew Sarsby", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Mykhailo Savytskyi", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Ville Selinmaa", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Matthew Steggles", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Eelis Takala", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Ivan Takmakov", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Brian Tarasinski", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Jani Tuorila", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Alpo Välimaa", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Jeroen Verjauw", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Jaap Wesdorp", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Nicola Wurz", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Wei Qiu", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Lihuang Zhu", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Juha Hassel", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Johannes Heinsoo", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Attila Geresdi", "affiliations": [ "IQM Quantum Computers" ] }, { "name": "Antti Vepsäläinen", "affiliations": [ "IQM Quantum Computers" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1103/ynxb-p2xq", "url": "https://doi.org/10.1103/ynxb-p2xq", "title": "Phase Estimation with Partially Randomized Time Evolution", "abstract": "Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground-state energies on quantum computers. Its main computational overhead derives from the Hamiltonian simulation subroutine. In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation. We propose partially randomized Hamiltonian simulation methods in which some terms are kept deterministically and others are randomly sampled. We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry and obtain orders-of-magnitude improvements compared to other simulations based on product formulas. When applied to the hydrogen chain, we have numerical evidence that our methods exhibit asymptotic scaling with the system size that is competitive with the best known qubitization approaches.", "authors": [ { "name": "Jakob Günther", "affiliations": [ "University of Copenhagen", "MIT" ] }, { "name": "Freek Witteveen", "affiliations": [ "University of Copenhagen", "QuSoft", "CWI" ] }, { "name": "Alexander Schmidhuber", "affiliations": [ "MIT" ] }, { "name": "Marek Miller", "affiliations": [ "University of Copenhagen" ] }, { "name": "Matthias Christandl", "affiliations": [ "University of Copenhagen" ] }, { "name": "Aram W. Harrow", "affiliations": [ "MIT" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1103/c4zd-lbyq", "url": "https://doi.org/10.1103/c4zd-lbyq", "title": "String-Breaking Dynamics in Quantum Adiabatic and Diabatic Processes", "abstract": "Confinement prohibits isolation of color charges, e.g., quarks, in nature via a process called : the separation of two charges results in an increase in the energy of a color flux, visualized as a string, connecting those charges. Eventually, creating additional charges is energetically favored, hence breaking the string. Such a phenomenon can be probed in simpler models, including quantum spin chains, enabling enhanced understanding of string-breaking dynamics. A challenging task is to understand how string breaking occurs as time elapses, in an out-of-equilibrium setting. This work establishes the phenomenology of dynamical string breaking induced by a gradual increase of string tension over time. It, thus, goes beyond instantaneous quench processes and enables tracking the real-time evolution of strings in a more controlled setting. We focus on domain-wall confinement in a family of quantum Ising chains. Our results indicate that, for sufficiently short strings and slow evolution, string breaking can be described by the transition dynamics of a two-state quantum system akin to a Landau-Zener process. For longer strings, a more intricate spatiotemporal pattern emerges: the string breaks by forming a superposition of bubbles (domains of flipped spins of varying sizes), which involve highly excited states. We finally demonstrate that string breaking driven only by quantum fluctuations can be realized in the presence of sufficiently long-ranged interactions. This work holds immediate relevance for studying string breaking in quantum-simulation experiments.", "authors": [ { "name": "Federica Maria Surace", "affiliations": [ "California Institute of Technology" ] }, { "name": "Alessio Lerose", "affiliations": [ "Clarendon Laboratory", "KU Leuven" ] }, { "name": "Or Katz", "affiliations": [ "Duke University", "Cornell University" ] }, { "name": "Elizabeth R. Bennewitz", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] }, { "name": "Alexander Schuckert", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] }, { "name": "De Luo", "affiliations": [ "Duke University" ] }, { "name": "Arinjoy De", "affiliations": [ "Duke University", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] }, { "name": "Brayden Ware", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] }, { "name": "William Morong", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] }, { "name": "Kate Collins", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] }, { "name": "Christopher Monroe", "affiliations": [ "Duke University" ] }, { "name": "Zohreh Davoudi", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "University of Maryland, College Park" ] }, { "name": "Alexey V. Gorshkov", "affiliations": [ "Joint Center for Quantum Information and Computer Science, NIST", "University of Maryland, College Park", "Joint Quantum Institute, NIST", "University of Maryland, College Park" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1103/jtn1-wzyl", "url": "https://doi.org/10.1103/jtn1-wzyl", "title": "Maximizing the Nondemolition Nature of a Quantum Measurement Via an Adaptive Readout Protocol", "abstract": "Quantum error correction benefits from high-fidelity, noninvasive measurements for fault-tolerant quantum computing. Deviations from ideal quantum nondemolition (QND) measurements can disturb the encoded information. To address this challenge, we develop a readout protocol for a D -dimensional system that, after a single positive outcome, switches to probing only the D − 1 remaining subspace. This adaptive switching strategy minimizes measurement-induced errors by relying on negative-result measurement results that do not perturb the Hamiltonian. We apply the protocol on an eight-dimensional 123 Sb nuclear qudit in silicon and achieve an increase in the readout fidelity from (98.93±0.07) % to (99.61±0.04) %, while reducing threefold the overall readout time. To highlight the broader relevance of measurement-induced errors, we study a ten-dimensional 73 Ge nuclear spin read out through Pauli spin blockade, revealing nuclear spin flips arising from hyperfine and quadrupole interactions. We discuss the applicability of our method to other quantum hardware platforms such as color centers in diamond, spins in lithographic quantum dots, clusters of donors in silicon, and dual-species neutral atom arrays. These results unveil the effect of nonideal QND readout across diverse platforms and introduce an efficient readout protocol that can be implemented with minimal field-programmable gate array (FPGA) logic on existing hardware.", "authors": [ { "name": "Arjen Vaartjes", "affiliations": [ "UNSW Sydney" ] }, { "name": "Rocky Yue Su", "affiliations": [ "UNSW Sydney" ] }, { "name": "Laura A. O’Neill", "affiliations": [ "UNSW Sydney" ] }, { "name": "Paul Steinacker", "affiliations": [ "UNSW Sydney", "Diraq Pty. Ltd." ] }, { "name": "Gauri Goenka", "affiliations": [ "UNSW Sydney" ] }, { "name": "Mark R. van Blankenstein", "affiliations": [ "UNSW Sydney" ] }, { "name": "Xi Yu", "affiliations": [ "UNSW Sydney" ] }, { "name": "Benjamin Wilhelm", "affiliations": [ "UNSW Sydney" ] }, { "name": "Alexander M. Jakob", "affiliations": [ "University of Melbourne" ] }, { "name": "Fay E. Hudson", "affiliations": [ "UNSW Sydney", "Diraq Pty. Ltd." ] }, { "name": "Kohei M. Itoh", "affiliations": [ "Keio University" ] }, { "name": "Chih Hwan Yang", "affiliations": [ "UNSW Sydney", "Diraq Pty. Ltd." ] }, { "name": "Andrew S. Dzurak", "affiliations": [ "UNSW Sydney", "Diraq Pty. Ltd." ] }, { "name": "David N. Jamieson", "affiliations": [ "University of Melbourne" ] }, { "name": "Martin Nurizzo", "affiliations": [ "UNSW Sydney" ] }, { "name": "Danielle Holmes", "affiliations": [ "UNSW Sydney" ] }, { "name": "Arne Laucht", "affiliations": [ "UNSW Sydney", "Diraq Pty. Ltd." ] }, { "name": "Andrea Morello", "affiliations": [ "UNSW Sydney" ] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1103/t59v-8flk", "url": "https://doi.org/10.1103/t59v-8flk", "title": "Efficient quantum optimization via dynamical simulation", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1103/wm5p-tjtg", "url": "https://doi.org/10.1103/wm5p-tjtg", "title": "Quantum detectors as autonomous machines: assessing the nonequilibrium thermodynamics of information acquisition", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1103/sqcs-jk1z", "url": "https://doi.org/10.1103/sqcs-jk1z", "title": "Chiral color code: Single-shot error correction for exotic topological order", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx-quantum", "title": "PRX Quantum", "issn": [ "2691-3399" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction" ], "journal_areas": [ "algorithms", "hardware", "error-correction", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.22331/q-2026-05-26-2116", "url": "https://doi.org/10.22331/q-2026-05-26-2116", "title": "A refined Frauchiger - Renner paradox based on strong contextuality", "abstract": "The Frauchiger - Renner paradox derives an inconsistency when quantum theory is used to describe the use of itself, by means of a scenario where agents model other agents quantumly and reason about each other&apos;s knowledge. We observe that logical contextuality (à la Hardy) is the key ingredient of the FR paradox, and we provide a stronger paradox based on the strongly contextual GHZ - Mermin scenario. In contrast to the FR paradox, this GHZ - FR paradox neither requires post-selection nor any reasoning by observers who are modelled quantumly. If one accepts the universality of quantum theory including superobservers, we propose a natural extension of Peres&apos;s dictum to resolve these extended Wigner&apos;s friend paradoxes.", "authors": [ { "name": "Laurens Walleghem", "affiliations": [ "Department of Mathematics, University of York, York, United Kingdom", "INL - International Iberian Nanotechnology Laboratory, Braga, Portugal" ] }, { "name": "Rui Soares Barbosa", "affiliations": [ "INL - International Iberian Nanotechnology Laboratory, Braga, Portugal" ] }, { "name": "Matthew F. Pusey", "affiliations": [ "Department of Mathematics, University of York, York, United Kingdom" ] }, { "name": "Stefan Weigert", "affiliations": [ "Department of Mathematics, University of York, York, United Kingdom" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.22331/q-2026-05-22-2115", "url": "https://doi.org/10.22331/q-2026-05-22-2115", "title": "Quantum Doeblin Coefficients: Interpretations and Applications", "abstract": "In classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong data-processing inequality. Here, we investigate quantum Doeblin coefficients as a generalization of the classical concept. In particular, we define various new quantum Doeblin coefficients, one of which has several desirable properties, including concatenation and multiplicativity, in addition to being efficiently computable. We also develop various interpretations of two of the quantum Doeblin coefficients, including representations as minimal singlet fractions, exclusion values, reverse max-mutual and oveloH informations, reverse robustnesses, and hypothesis testing reverse mutual and oveloH informations. Our interpretations of quantum Doeblin coefficients as either entanglement-assisted or unassisted exclusion values are particularly appealing, indicating that they are proportional to the best possible error probabilities one could achieve in state-exclusion tasks by making use of the channel. We also outline various applications of quantum Doeblin coefficients, ranging from limitations on quantum machine learning algorithms that use parameterized quantum circuits (noise-induced barren plateaus), on error mitigation protocols, on the sample complexity of noisy quantum hypothesis testing, on the fairness of noisy quantum models, and on mixing, indistinguishability, and decoupling times of time-varying channels. All of these applications make use of the fact that quantum Doeblin coefficients appear in upper bounds on various trace-distance contraction coefficients of a quantum channel. Furthermore, in all of these applications, our analysis using quantum Doeblin coefficients provides improvements of various kinds over contributions from prior literature, both in terms of generality and being efficiently computable.", "authors": [ { "name": "Ian George", "affiliations": [ "Centre for Quantum Technologies, National University of Singapore, Singapore 117543, Singapore" ] }, { "name": "Christoph Hirche", "affiliations": [ "Institute for Information Processing (tnt/L3S), Leibniz Universität Hannover, Germany" ] }, { "name": "Theshani Nuradha", "affiliations": [ "School of Electrical and Computer Engineering, Cornell University, Ithaca, New York 14850, USA", "Department of Mathematics and Illinois Quantum Information Science and Technology (IQUIST) Center,\\ University of Illinois Urbana-Champaign, Urbana, IL 61801, USA" ] }, { "name": "Mark M. Wilde", "affiliations": [ "School of Electrical and Computer Engineering, Cornell University, Ithaca, New York 14850, USA" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.22331/q-2026-05-22-2114", "url": "https://doi.org/10.22331/q-2026-05-22-2114", "title": "Tensor Cross Interpolation of Purities in Quantum Many-Body Systems", "abstract": "A defining feature of quantum many-body systems is the exponential scaling of the Hilbert space with the number of degrees of freedom. This exponential complexity naïvely renders a complete state characterization, for instance via the complete set of bipartite Renyi entropies for all disjoint regions, a challenging task. Recently, a compact way of storing subregions&apos; purities by encoding them as amplitudes of a fictitious quantum wave function, known as entanglement feature, was proposed. Notably, the entanglement feature can be a simple object even for highly entangled quantum states. However the complexity and practical usage of the entanglement feature for general quantum states has not been explored. In this work, we demonstrate that the entanglement feature can be efficiently learned using only a polynomial amount of samples in the number of degrees of freedom through the so-called tensor cross interpolation (TCI) algorithm, assuming it is expressible as a finite bond dimension MPS. We benchmark this learning process on Haar and random MPS states, confirming analytic expectations. Applying the TCI algorithm to quantum eigenstates of various one dimensional quantum systems, we identify cases where eigenstates have entanglement feature learnable with TCI. We conclude with possible applications of the learned entanglement feature, such as quantifying the distance between different entanglement patterns and finding the optimal one-dimensional ordering of physical indices in a given state, highlighting the potential utility of the proposed purity interpolation method.", "authors": [ { "name": "Dmytro Kolisnyk", "affiliations": [ "Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria" ] }, { "name": "Raimel A. Medina", "affiliations": [ "Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria" ] }, { "name": "Romain Vasseur", "affiliations": [ "Department of Theoretical Physics, University of Geneva, 24 quai Ernest-Ansermet, 1211 Geneva, Switzerland" ] }, { "name": "Maksym Serbyn", "affiliations": [ "Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.22331/q-2026-05-21-2112", "url": "https://doi.org/10.22331/q-2026-05-21-2112", "title": "Hidden time-nonlocal Floquet symmetries", "abstract": "We investigate the Floquet spectrum of a detuned, driven two-level system and show that it exhibits exact quasienergy crossings when the detuning is an integer multiple of the energy quantum of the driving field. This behavior can be explained by a hidden time-nonlocal parity, which allows the Floquet modes to be classified as even or odd. Then a generic feature is the emergence of exact crossings between quasienergies of different parity. A constructive proof of the existence of the symmetry is based on a scalar recurrence relation. Moreover, we present a general scheme for its numerical computation, which can be applied to models beyond the two-level system. Analytical results are illustrated with numerical data.", "authors": [ { "name": "Sigmund Kohler", "affiliations": [ "Quantum Advanced Research Center (QuARC), CSIC, Sor Juana Inés de la Cruz 3, 28049 Madrid, Spain", "Instituto de Ciencia de Materiales de Madrid (ICMM), CSIC, Sor Juana Inés de la Cruz 3, 28049 Madrid, Spain" ] }, { "name": "Jesús Casado-Pascual", "affiliations": [ "Física Teórica, Universidad de Sevilla, Apartado de Correos 1065, E-41080 Sevilla, Spain", "Multidisciplinary Unit for Energy Science, Universidad de Sevilla, E-41080 Sevilla, Spain" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.22331/q-2026-05-21-2113", "url": "https://doi.org/10.22331/q-2026-05-21-2113", "title": "Performance Guarantees for Quantum Neural Estimation of Entropies", "abstract": "Estimating quantum entropies and divergences is an important problem in quantum physics, information theory, and machine learning. Quantum neural estimators (QNEs), which utilize a hybrid classical-quantum architecture, have recently emerged as an appealing computational framework for estimating these measures. Such estimators combine classical neural networks with parametrized quantum circuits, and their deployment typically entails tedious tuning of hyperparameters controlling the sample size, network architecture, and circuit topology. This work initiates the study of formal guarantees for QNEs of measured (Rényi) relative entropies in the form of non-asymptotic error risk bounds. We further establish exponential tail bounds showing that the error is sub-Gaussian and thus sharply concentrates about the ground truth value. For an appropriate sub-class of density operator pairs on a space of dimension d with bounded Thompson metric, our theory establishes a copy complexity of O ( | &#x0398; ( U ) | d / &#x03F5; 2 ) for QNE with a quantum circuit parameter set &#x0398; ( U ) , which has minimax optimal dependence on the accuracy &#x03F5; . Additionally, if the density operator pairs are permutation invariant, we improve the dimension dependence above to O ( | &#x0398; ( U ) | p o l y l o g ( d ) / &#x03F5; 2 ) . Our theory aims to facilitate principled implementation of QNEs for measured relative entropies and guide hyperparameter tuning in practice.", "authors": [ { "name": "Sreejith Sreekumar", "affiliations": [ "Laboratoire Des Signaux Et Systèmes (L2S), CNRS, CentraleSupélec, University of Paris-Saclay" ] }, { "name": "Ziv Goldfeld", "affiliations": [ "School of Electrical and Computer Engineering, Cornell University" ] }, { "name": "Mark M. Wilde", "affiliations": [ "School of Electrical and Computer Engineering, Cornell University" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.22331/q-2026-05-21-2111", "url": "https://doi.org/10.22331/q-2026-05-21-2111", "title": "Lower bounds on bipartite entanglement in noisy graph states", "abstract": "Graph states are a key resource for a number of applications in quantum information theory. Due to the inherent noise in noisy intermediate-scale quantum (NISQ) era devices, it is important to understand the effects noise has on the usefulness of graph states. We consider a noise model where the initial qubits, prepared in | + &#x27E9; states, undergo depolarizing noise before the application of the CZ operations that generate edges between qubits situated at the nodes of the resulting graph state. For this model we develop a method for calculating the coherent information - a lower bound on the rate at which entanglement can be distilled, across a bipartition of the graph state. We also identify some patterns on how adding more nodes or edges affects the bipartite distillable entanglement. As an application, we find a family of graph states that maintain a strictly positive coherent information for any amount of (non-maximal) depolarizing noise.", "authors": [ { "name": "Aqil Sajjad", "affiliations": [ "James C. Wyant College of Optical Sciences, University of Arizona, Tucson, AZ 85721, USA" ] }, { "name": "Eneet Kaur", "affiliations": [ "James C. Wyant College of Optical Sciences, University of Arizona, Tucson, AZ 85721, USA", "Cisco Quantum Lab, Los Angeles, USA" ] }, { "name": "Kenneth Goodenough", "affiliations": [ "College of Information and Computer Sciences, University of Massachusetts Amherst, MA 01002, USA" ] }, { "name": "Don Towsley", "affiliations": [ "College of Information and Computer Sciences, University of Massachusetts Amherst, MA 01002, USA" ] }, { "name": "Saikat Guha", "affiliations": [ "James C. Wyant College of Optical Sciences, University of Arizona, Tucson, AZ 85721, USA" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.22331/q-2026-05-20-2109", "url": "https://doi.org/10.22331/q-2026-05-20-2109", "title": "Fully optimised variational simulation of a dynamical quantum phase transition on a trapped-ion quantum computer", "abstract": "We time-evolve a translationally invariant quantum state on the Quantinuum H1-1 trapped-ion quantum processor, studying the dynamical quantum phase transition of the transverse field Ising model. This physics requires a delicate cancellation of phases in the many-body wavefunction and presents a tough challenge for current quantum devices. We follow the dynamics using a quantum circuit matrix product state ansatz, optimised for the time-evolution using a fidelity cost function. Sampling costs are mitigated by using the measured values of this circuit as stochastic corrections to a simple classical extrapolation of the ansatz parameters. Our results demonstrate the feasibility of variational quantum time-evolution and reveal a hitherto hidden simplicity of the evolution of the transverse-field Ising model through the dynamical quantum phase transition.", "authors": [ { "name": "Lesley Gover", "affiliations": [ "London Centre for Nanotechnology, University College London, Gordon St., London, WC1H 0AH, United Kingdom" ] }, { "name": "Vinul Wimalaweera", "affiliations": [ "London Centre for Nanotechnology, University College London, Gordon St., London, WC1H 0AH, United Kingdom" ] }, { "name": "Fariha Azad", "affiliations": [ "London Centre for Nanotechnology, University College London, Gordon St., London, WC1H 0AH, United Kingdom" ] }, { "name": "Matthew DeCross", "affiliations": [ "Quantinuum, Broomfield, CO 80021, USA" ] }, { "name": "Michael Foss-Feig", "affiliations": [ "Quantinuum, Broomfield, CO 80021, USA" ] }, { "name": "Andrew G. Green", "affiliations": [ "London Centre for Nanotechnology, University College London, Gordon St., London, WC1H 0AH, United Kingdom" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.22331/q-2026-05-20-2110", "url": "https://doi.org/10.22331/q-2026-05-20-2110", "title": "Bosonic Quantum Computational Complexity", "abstract": "Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic computations over infinite-dimensional Hilbert spaces is missing. In this work, we lay foundations for such a research program. We introduce natural complexity classes and problems based on bosonic generalizations of BQP, the local Hamiltonian problem, and QMA. We uncover several relationships and subtle differences between standard Boolean classical and discrete variable quantum complexity classes and identify outstanding open problems. In particular: 1. We show that the power of quadratic (Gaussian) quantum dynamics is equivalent to the class BQL. More generally, we define classes of continuous-variable quantum polynomial time computations with a bounded probability of error based on higher-degree gates. Due to the infinite dimensional Hilbert space, it is not a priori clear whether a decidable upper bound can be obtained for these classes. We identify complete problems for these classes and demonstrate a BQP lower and EXPSPACE upper bound. We further show that the problem of computing expectation values of polynomial bosonic observables is in PSPACE. 2. We prove that the problem of deciding the boundedness of the spectrum of a bosonic Hamiltonian is co-NP-hard. Furthermore, we show that the problem of finding the minimum energy of a bosonic Hamiltonian critically depends on the non-Gaussian stellar rank of the family of energy-constrained states one optimizes over: for constant stellar rank, it is NP-complete; for polynomially-bounded rank, it is in QMA; for unbounded rank, it is undecidable.", "authors": [ { "name": "Ulysse Chabaud", "affiliations": [ "DIENS, ENS, PSL University, CNRS, INRIA, Paris, France" ] }, { "name": "Michael Joseph", "affiliations": [ "Tufts CS, Medford MA, USA" ] }, { "name": "Saeed Mehraban", "affiliations": [ "Tufts CS, Medford MA, USA" ] }, { "name": "Arsalan Motamedi", "affiliations": [ "IQC, Waterloo ON, Canada" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.22331/q-2026-05-20-2108", "url": "https://doi.org/10.22331/q-2026-05-20-2108", "title": "From spin squeezing to fast state discrimination", "abstract": "There is great interest in generating and controlling entanglement in Bose-Einstein condensates and similar ensembles for use in quantum computation, simulation, and sensing. One class of entangled states useful for enhanced metrology are spin-squeezed states of N two-level atoms. After preparing a spin coherent state of width 1 / N centered at coordinates ( &#x03B8; , &#x03D5; ) on the Bloch sphere, atomic interactions generate a nonlinear evolution that shears the state's probability density, stretching it to an ellipse and causing squeezing in a direction perpendicular to the major axis. Here we consider the same setup but in the N &#x2192; &#x221E; limit . This shrinks the initial coherent state to zero area. Large N also suppresses two-particle entanglement and squeezing, as required by a monogamy bound. The torsion (1-axis twist) is still present, however, and the center of the large N coherent state evolves as a qubit governed by a two-state Gross-Pitaevskii equation. The resulting nonlinearity is known to be a powerful resource in quantum computation. It can be used to implement single-input quantum state discrimination, an impossibility within linear one-particle quantum mechanics. We obtain a solution to the discrimination problem in terms of a Viviani curve on the Bloch sphere. We also consider an open-system variant containing both Bloch sphere torsion and dissipation. In this case it should be possible to generate two basins of attraction within the Bloch ball, having a shared boundary that can be used for a type of autonomous state discrimination. We explore these and other connections between spin squeezing in the large N limit and nonlinear quantum gates, and argue that a two-component condensate is a promising platform for realizing a nonlinear qubit.", "authors": [ { "name": "Michael R. Geller", "affiliations": [ "Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA", "Center for Simulational Physics, University of Georgia, Athens, Georgia 30602, USA" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.22331/q-2026-05-18-2107", "url": "https://doi.org/10.22331/q-2026-05-18-2107", "title": "Operator space fragmentation in perturbed Floquet-Clifford circuits", "abstract": "Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states, exhibiting quantum chaos, topological order and localisation. In this work, we investigate the stability of operator localisation and emergence of chaos in random Floquet-Clifford circuits subjected to unitary perturbations which drive them away from the Clifford limit. We construct a nearest-neighbour Clifford circuit with a brickwork pattern and study the effect of including disordered non-Clifford gates. The perturbations are uniformly sampled from single-qubit unitaries with probability p on each qubit. We show that the interacting model exhibits strong localisation of operators for 0 &#x2264; p &#x003C; 1 that is characterised by the fragmentation of operator space into disjoint sectors due to the appearance of wall configurations. Such walls give rise to emergent local integrals of motion for the circuit that we construct exactly. We analytically establish the stability of localisation against generic perturbations and calculate the average length of operator spreading tunable by p . Although our circuit is not separable across any bi-partition, we further show that the operator localisation leads to an entanglement bottleneck, where initially unentangled states remain weakly entangled across typical fragment boundaries. Finally, we study the spectral form factor (SFF) to characterise the chaotic properties of the operator fragments and spectral fluctuations as a probe of non-ergodicity. In the p = 1 model, the emergence of a fragmentation time scale is found before random matrix theory sets in after which the SFF can be approximated by that of the circular unitary ensemble. Our work provides an explicit description of quantum phases in operator dynamics and circuit ergodicity which can be realised on current NISQ devices.", "authors": [ { "name": "Marcell D. Kovács", "affiliations": [ "Department of Physics and Astronomy, University College London, United Kingdom" ] }, { "name": "Christopher J. Turner", "affiliations": [ "Department of Physics and Astronomy, University College London, United Kingdom" ] }, { "name": "Lluis Masanes", "affiliations": [ "Department of Computer Science, University College London, United Kingdom", "London Centre for Nanotechnology, University College London, United Kingdom" ] }, { "name": "Arijeet Pal", "affiliations": [ "Department of Physics and Astronomy, University College London, United Kingdom", "London Centre for Nanotechnology, University College London, United Kingdom" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.22331/q-2026-05-13-2104", "url": "https://doi.org/10.22331/q-2026-05-13-2104", "title": "Quantum Resource Theories beyond Convexity", "abstract": "A class of quantum resource theories, based on non-convex star-shape sets, presented in this work captures the key quantum properties that cannot be studied by standard convex theories. We provide operational interpretations for a resource of this class and demonstrate its advantage to improve performance of correlated quantum discrimination tasks and testing of quantum combs. Proposed techniques provide useful tools to describe quantum discord, total correlations in composite quantum systems and to estimate the degree of non-Markovianity of an analyzed quantum dynamics. Other applications include the problem of unistochasticity of a given bistochastic matrix, with relevance for quantization of classical dynamics and studies of violation of CP-symmetry in high energy physics. In all these cases, the non-linear witnesses introduced here outperform the standard linear witnesses. Importance of our findings for quantum information theory is also emphasized.", "authors": [ { "name": "Roberto Salazar", "affiliations": [ "Department of Communications & Computer Engineering, Faculty of Information & communication technology (ICT), University of Malta, Msida, MSD 2080, Malta", "Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, 30-348 Kraków, Poland" ] }, { "name": "Jakub Czartowski", "affiliations": [ "Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, 30-348 Kraków, Poland", "Doctoral School of Exact and Natural Sciences, Jagiellonian University, ul. Lojasiewicza 11, 30-348 Kraków, Poland", "School of Physical and Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, 637361 Singapore, Republic of Singapore" ] }, { "name": "Ricard Ravell Rodríguez", "affiliations": [ "Institute for Cross-Disciplinary Physics and Complex Systems IFISC (UIB-CSIC), Campus Universitat Illes Balears, E-07122 Palma de Mallorca, Spain" ] }, { "name": "Grzegorz Rajchel-Mieldzioć", "affiliations": [ "BEIT sp. z o.o., ul. Mogilska 43, 31-545 Kraków, Poland", "ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Av. Carl Friedrich Gauss 3, 08860 Castelldefels (Barcelona), Spain" ] }, { "name": "Paweł Horodecki", "affiliations": [ "International Centre for Theory of Quantum Technologies, University of Gdańsk, Wita Stwosza 63, 80-308 Gdańsk, Poland" ] }, { "name": "Karol Życzkowski", "affiliations": [ "Faculty of Physics, Astronomy and Applied Computer Science, Jagiellonian University, 30-348 Kraków, Poland", "Center for Theoretical Physics, Polish Academy of Sciences, 02-668 Warszawa, Poland" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.22331/q-2026-05-13-2105", "url": "https://doi.org/10.22331/q-2026-05-13-2105", "title": "Multicopy quantum state teleportation with application to storage and retrieval of quantum programs", "abstract": "This work considers a teleportation task for Alice and Bob in a scenario where Bob cannot perform corrections. In particular, we analyse the task of multicopy state teleportation , where Alice has k identical copies of an arbitrary unknown d -dimensional qudit state | &#x03C8; &#x27E9; to teleport a single copy of | &#x03C8; &#x27E9; to Bob using a maximally entangled two-qudit state shared between Alice and Bob without Bob's correction. Alice may perform a joint measurement on her half of the entangled state and the k copies of | &#x03C8; &#x27E9; . We prove that the maximal probability of success for teleporting the exact state | &#x03C8; &#x27E9; to Bob is p ( d , k ) = k d ( k &#x2212; 1 + d ) and present an explicit protocol to attain this performance. Then, by utilising k copies of an arbitrary target state | &#x03C8; &#x27E9; , we show how the multicopy state teleportation protocol can be employed to enhance the success probability of storage and retrieval of quantum programs, which aims to universally retrieve the action of an arbitrary quantum channel that is stored in a state. Our proofs make use of group representation theory methods, which may find applications beyond the problems addressed in this work.", "authors": [ { "name": "Frédéric Grosshans", "affiliations": [ "Sorbonne Université, CNRS, LIP6, F-75005 Paris, France" ] }, { "name": "Michał Horodecki", "affiliations": [ "International Centre for Theory of Quantum Technologies, University of Gdańsk, Jana Bażyńskiego 1A, 80-309 Gdańsk, Poland" ] }, { "name": "Mio Murao", "affiliations": [ "Department of Physics, Graduate School of Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan", "Trans-scale Quantum Science Institute, The University of Tokyo, Bunkyo-ku, Tokyo 113-0033, Japan" ] }, { "name": "Tomasz Młynik", "affiliations": [ "Institute of Theoretical Physics and Astrophysics, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Wita Stwosza 57, 80-308 Gdańsk, Poland" ] }, { "name": "Marco Túlio Quintino", "affiliations": [ "Sorbonne Université, CNRS, LIP6, F-75005 Paris, France" ] }, { "name": "Michał Studziński", "affiliations": [ "International Centre for Theory of Quantum Technologies, University of Gdańsk, Jana Bażyńskiego 1A, 80-309 Gdańsk, Poland", "Institute of Theoretical Physics and Astrophysics, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Wita Stwosza 57, 80-308 Gdańsk, Poland" ] }, { "name": "Satoshi Yoshida", "affiliations": [ "Department of Physics, Graduate School of Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.22331/q-2026-05-13-2106", "url": "https://doi.org/10.22331/q-2026-05-13-2106", "title": "External quantum fluctuations select measurement contexts", "abstract": "Quantum paradoxes show that the outcomes of different quantum measurements cannot be described by a single measurement-independent reality. Any theoretical description of a quantum measurement implies the selection of a specific measurement context. Here, we investigate generalised quantum measurements, in order to identify the mechanism by which this specific context is selected. We show that external quantum fluctuations, represented by the initial state of the measurement apparatus, play an essential role in the selection of the context. This has the non-trivial consequence that, when considering measurements other than just idealised projection-valued measures, different outcomes of a single measurement setup can represent different measurement contexts. We further show this result underpins recent claims that contextuality can occur in scenarios without measurement incompatibility.", "authors": [ { "name": "Jonte R. Hance", "affiliations": [ "Quantum Group, School of Computing, Newcastle University, 1 Science Square, Newcastle upon Tyne, NE4 5TG, UK", "Quantum Engineering Technology Laboratories, Department of Electrical and Electronic Engineering, University of Bristol, Woodland Road, Bristol, BS8 1US, UK" ] }, { "name": "Ming Ji", "affiliations": [ "QICI Quantum Information and Computation Initiative, School of Computing and Data Science, The University of Hong Kong, Pokfulam Road, Hong Kong SAR, China" ] }, { "name": "Tomonori Matsushita", "affiliations": [ "Graduate School of Advanced Science and Engineering, Hiroshima University, Kagamiyama 1-3-1, Higashi Hiroshima 739-8530, Japan" ] }, { "name": "Holger F. Hofmann", "affiliations": [ "Graduate School of Advanced Science and Engineering, Hiroshima University, Kagamiyama 1-3-1, Higashi Hiroshima 739-8530, Japan" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.22331/q-2026-05-12-2102", "url": "https://doi.org/10.22331/q-2026-05-12-2102", "title": "Polynomial time constructive decision algorithm for multivariable quantum signal processing", "abstract": "Quantum signal processing (QSP) and quantum singular value transformation (QSVT) have provided a unified framework for understanding many quantum algorithms, including factorization, matrix inversion, and Hamiltonian simulation. As a multivariable version of QSP, multivariable quantum signal processing (M-QSP) is proposed. M-QSP interleaves signal operators corresponding to each variable with signal processing operators, which provides an efficient means to perform multivariable polynomial transformations. However, the necessary and sufficient condition for what types of polynomials can be constructed by M-QSP is unknown. In this paper, we propose a classical algorithm to determine whether a given pair of multivariable Laurent polynomials can be implemented by M-QSP, which returns True or False. As one of the most important properties of this algorithm, its returning True is the necessary and sufficient condition. The proposed classical algorithm runs in polynomial time in the number of variables and signal operators. Our algorithm also provides a constructive method to select the necessary parameters for implementing M-QSP. These findings offer valuable insights for identifying practical applications of M-QSP.", "authors": [ { "name": "Yuki Ito", "affiliations": [ "Graduate School of Engineering Science, The University of Osaka, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan" ] }, { "name": "Hitomi Mori", "affiliations": [ "Graduate School of Engineering Science, The University of Osaka, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan" ] }, { "name": "Kazuki Sakamoto", "affiliations": [ "Graduate School of Engineering Science, The University of Osaka, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan" ] }, { "name": "Keisuke Fujii", "affiliations": [ "Graduate School of Engineering Science, The University of Osaka, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan", "Center for Quantum Information and Quantum Biology, The University of Osaka, 1-2 Machikaneyama, Osaka 560-0043, Japan.", "RIKEN Center for Quantum Computing (RQC), Hirosawa 2-1, Wako, Saitama 351-0198, Japan" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.22331/q-2026-05-12-2100", "url": "https://doi.org/10.22331/q-2026-05-12-2100", "title": "Learning symmetry-protected topological order from trapped-ion experiments", "abstract": "Classical machine learning has proven remarkably useful in post-processing quantum data, yet typical learning algorithms often require prior training to be effective. In this work, we employ a tensorial kernel support vector machine (TK-SVM) to analyze experimental data produced by trapped-ion quantum computers. This unsupervised method benefits from directly interpretable training parameters, allowing it to identify the non-trivial string-order characterizing symmetry-protected topological (SPT) phases. We apply our technique to two examples: a spin-1/2 model and a spin-1 model, featuring the cluster state and the AKLT state as paradigmatic instances of SPT order, respectively. Using matrix product states, we generate a family of quantum circuits that host a trivial phase and an SPT phase, with a sharp phase transition between them. For the spin-1 case, we implement these circuits on two distinct trapped-ion machines based on qubits and qutrits. Our results demonstrate that the TK-SVM method successfully distinguishes the two phases across all noisy experimental datasets, highlighting its robustness and effectiveness in quantum data interpretation.", "authors": [ { "name": "Nicolas Sadoune", "affiliations": [ "Arnold Sommerfeld Center for Theoretical Physics, Ludwig-Maximilians-Universität München, 80333 München, Germany", "Munich Center for Quantum Science and Technology, 80799 München, Germany" ] }, { "name": "Ivan Pogorelov", "affiliations": [ "Institute for Experimental Physics, University of Innsbruck, 6020 Innsbruck, Austria" ] }, { "name": "Claire L. Edmunds", "affiliations": [ "Institute for Experimental Physics, University of Innsbruck, 6020 Innsbruck, Austria" ] }, { "name": "Giuliano Giudici", "affiliations": [ "Institute for Theoretical Physics, University of Innsbruck, 6020 Innsbruck, Austria", "Institute for Quantum Optics and Quantum Information of the Austrian Academy of Sciences, 6020 Innsbruck, Austria", "PlanQC GmbH, 85748 Garching, Germany", "Arnold Sommerfeld Center for Theoretical Physics, Ludwig-Maximilians-Universität München, 80333 München, Germany", "Munich Center for Quantum Science and Technology, 80799 München, Germany" ] }, { "name": "Giacomo Giudice", "affiliations": [ "PlanQC GmbH, 85748 Garching, Germany" ] }, { "name": "Christian D. Marciniak", "affiliations": [ "Institute for Experimental Physics, University of Innsbruck, 6020 Innsbruck, Austria" ] }, { "name": "Martin Ringbauer", "affiliations": [ "Institute for Experimental Physics, University of Innsbruck, 6020 Innsbruck, Austria" ] }, { "name": "Thomas Monz", "affiliations": [ "Institute for Experimental Physics, University of Innsbruck, 6020 Innsbruck, Austria", "Alpine Quantum Technologies GmbH, 6020 Innsbruck, Austria" ] }, { "name": "Lode Pollet", "affiliations": [ "Arnold Sommerfeld Center for Theoretical Physics, Ludwig-Maximilians-Universität München, 80333 München, Germany", "Munich Center for Quantum Science and Technology, 80799 München, Germany" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.22331/q-2026-05-12-2103", "url": "https://doi.org/10.22331/q-2026-05-12-2103", "title": "Phase-Sensitive Measurements on a Fermi - Hubbard Quantum Processor", "abstract": "Fermionic quantum processors are a promising platform for quantum simulation of correlated fermionic matter. In this work, we study a hardware-efficient protocol for measuring complex expectation values of the time-evolution operator, commonly referred to as Loschmidt echoes, with fermions in an optical superlattice. We analyze the algorithm for the Fermi - Hubbard model at half-filling as well as at finite doping. The method relies on global quench dynamics and short imaginary time evolution, the latter being realized by architecture-tailored pulse sequences starting from a product state of plaquettes. Our numerical results show that complex Loschmidt echoes can be efficiently obtained for large many-body states over a broad spectral range. This allows one to measure spectral properties of the Fermi - Hubbard model, such as the local density of states, and paves the way for the study of finite-temperature properties in current fermionic quantum simulators.", "authors": [ { "name": "Alberto R. Cavallar", "affiliations": [ "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany", "Department of Physics and Arnold Sommerfeld Center for Theoretical Physics (ASC), Ludwig-Maximilians-Universität München, Theresienstr. 37, München D-80333, Germany" ] }, { "name": "Luis Escalera-Moreno", "affiliations": [ "Hamburg University of Technology, Institute for Quantum Inspired and Quantum Optimization, Blohmstraße 15, Hamburg, Germany", "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany" ] }, { "name": "Titus Franz", "affiliations": [ "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany" ] }, { "name": "Timon Hilker", "affiliations": [ "Department of Physics and SUPA, University of Strathclyde, Glasgow, G4 0NG, United Kingdom", "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany" ] }, { "name": "J. Ignacio Cirac", "affiliations": [ "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany" ] }, { "name": "Philipp M. Preiss", "affiliations": [ "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany" ] }, { "name": "Benjamin F. Schiffer", "affiliations": [ "Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str. 1, D-85748 Garching, Germany", "Munich Center for Quantum Science and Technology (MCQST), Schellingstr. 4, D-80799 München, Germany" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.22331/q-2026-05-12-2101", "url": "https://doi.org/10.22331/q-2026-05-12-2101", "title": "Construction and Decoding of Quantum Margulis Codes", "abstract": "Quantum low-density parity-check codes are a promising approach to fault-tolerant quantum computation, offering potential advantages in rate and decoding efficiency. In this work, we introduce quantum Margulis codes, a new class of QLDPC codes derived from Margulis&apos; classical LDPC construction via the two-block group algebra framework. We show that quantum Margulis codes, unlike bivariate bicycle codes which require ordered statistics decoding for effective error correction, can be efficiently decoded using a standard min-sum decoder with linear complexity, when decoded under the code capacity noise model. This is attributed to their Tanner graph structure, which does not exhibit group symmetry, thereby mitigating the well-known problem of error degeneracy in QLDPC decoding. To further enhance performance, we propose an algorithm for constructing 2BGA codes with controlled girth, ensuring a minimum girth of 6 or 8, and use it to generate several quantum Margulis codes of length 240 and 642. We validate our approach through numerical simulations, demonstrating that quantum Margulis codes behave significantly better than BB codes in the error floor region, under min-sum decoding.", "authors": [ { "name": "Michele Pacenti", "affiliations": [ "Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA, 85721" ] }, { "name": "Dimitris Chytas", "affiliations": [ "Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA, 85721" ] }, { "name": "Bane Vasić", "affiliations": [ "Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA, 85721" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.22331/q-2026-05-08-2099", "url": "https://doi.org/10.22331/q-2026-05-08-2099", "title": "Efficient implementation of single particle Hamiltonians in exponentially reduced qubit space", "abstract": "Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid-state Hamiltonians by introducing a logarithmic-qubit encoding that maps a system with N physical sites onto only &#x2308; log 2 &#x2061; N &#x2309; qubits while maintaining a clear correspondence with the underlying physical model. Within this reduced register, we construct a compatible variational circuit and a Gray-code-inspired measurement strategy whose number of global settings grows only logarithmically with system size. To quantify the overall hardware load, we introduce a volumetric efficiency metric that combines the number of qubits, circuit depth, and the number of measurement settings into a single measure, expressing the overall computation costs. Using this metric, we show that the total space--time sampling volume required in a variational loop can be reduced dramatically from N 2 to ( log &#x2061; N ) 3 for a hardware-efficient ansatz, allowing an exponential reduction in time and size of the quantum hardware. These results demonstrate that large, structured solid-state Hamiltonians can be simulated on substantially smaller quantum registers with controlled sampling overhead and manageable circuit complexity, extending the reach of variational quantum algorithms on near-term devices.", "authors": [ { "name": "Martin Plesch", "affiliations": [ "Institute for Physics, Slovak Academy of Sciences, Bratislava, Slovakia", "Matej Bel University, Banská Bystrica, Slovakia" ] }, { "name": "Martin Friák", "affiliations": [ "Institute of Physics of Materials, v.v.i., Czech Academy of Sciences, Žižkova 22, CZ-616 00, Brno, Czech Republic", "Department of Condensed Matter Physics, Faculty of Science, Masaryk University, Kotlářská 2, CZ-611 37, Brno, Czech Republic" ] }, { "name": "Ijaz Ahamed Mohammad", "affiliations": [ "Institute for Physics, Slovak Academy of Sciences, Bratislava, Slovakia" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-08", "source": "crossref" }, { "doi": "10.22331/q-2026-05-06-2098", "url": "https://doi.org/10.22331/q-2026-05-06-2098", "title": "Cost of quantum secret key", "abstract": "In this paper, we develop the resource theory of quantum secret key. Operating under the assumption that entangled states with zero distillable key do not exist, we define the key cost of a quantum state, and device. We study its properties through the lens of a quantity that we call the key of formation. The main result of our paper is that the regularized key of formation is an upper bound on the key cost of a quantum state. The core protocol underlying this result is privacy dilution, which converts states containing ideal privacy into ones with diluted privacy. Next, we show that the key cost is bounded from below by the regularized relative entropy of entanglement, which implies the irreversibility of the privacy creation-distillation process for a specific class of states. We further focus on mixed-state analogues of pure quantum states in the domain of privacy, and we prove that a number of entanglement measures are equal to each other for these states, similar to the case of pure entangled states. The privacy cost and distillable key in the single-shot regime exhibit a yield-cost relation, and basic consequences for quantum devices are also provided. Importantly, our results presented here will remain valid even if entangled states with zero distillable key were shown to exist.", "authors": [ { "name": "Karol Horodecki", "affiliations": [ "Institute of Informatics, National Quantum Information Centre, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Wita Stwosza 57, 80-308 Gdańsk, Poland", "International Centre for Theory of Quantum Technologies, University of Gdańsk, Wita Stwosza 63, 80-308 Gdańsk, Poland", "School of Electrical and Computer Engineering, Cornell University, Ithaca, New York 14850, USA" ] }, { "name": "Leonard Sikorski", "affiliations": [ "Institute of Informatics, National Quantum Information Centre, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, Wita Stwosza 57, 80-308 Gdańsk, Poland" ] }, { "name": "Siddhartha Das", "affiliations": [ "q4i, Centre for Quantum Science and Technology (CQST), Center for Security, Theory and Algorithmic Research (CSTAR), International Institute of Information Technology Hyderabad, Gachibowli 500032, Hyderabad, Telangana, India" ] }, { "name": "Mark M. Wilde", "affiliations": [ "School of Electrical and Computer Engineering, Cornell University, Ithaca, New York 14850, USA" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": true, "published": "2026-05-06", "source": "crossref" }, { "doi": "10.22331/q-2026-05-06-2097", "url": "https://doi.org/10.22331/q-2026-05-06-2097", "title": "The Complexity of Local Stoquastic Hamiltonians on 2D Lattices", "abstract": "We show the 2-Local Stoquastic Hamiltonian problem on a 2D square qubit lattice is StoqMA-complete. We achieve this by extending the spatially sparse circuit construction of Oliveira and Terhal, as well as the perturbative gadgets of Bravyi, DiVincenzo, Oliveira, and Terhal. Our main contributions demonstrate StoqMA circuits can be made spatially sparse and that geometrical, stoquastic-preserving, perturbative gadgets can be constructed, without an increase to particle dimension.", "authors": [ { "name": "Gabriel Waite", "affiliations": [ "Centre for Quantum Computation and Communication Technology, Centre for Quantum Software and Information, School of Computer Science, Faculty of Engineering & Information Technology, University of Technology Sydney, NSW 2007, Australia" ] }, { "name": "Michael J. Bremner", "affiliations": [ "Centre for Quantum Computation and Communication Technology, Centre for Quantum Software and Information, School of Computer Science, Faculty of Engineering & Information Technology, University of Technology Sydney, NSW 2007, Australia" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-06", "source": "crossref" }, { "doi": "10.22331/q-2026-05-06-2096", "url": "https://doi.org/10.22331/q-2026-05-06-2096", "title": "Quantum Optimal Control for Coherent Spin Dynamics of Radical Pairs via Pontryagin Maximum Principle", "abstract": "This paper aims to devise the shape of the external electromagnetic field that drives the spin dynamics of radical pairs to a quantum coherent state through maximization of the triplet-born singlet yield in biochemical reactions. The model is a Schrödinger system with spin Hamiltonians given by the sum of Zeeman interaction and hyperfine coupling interaction terms. We introduce a one-parameter family of optimal control problems by coupling the Schrödinger system to a control field through filtering equations for the electromagnetic field. Fréchet differentiability and the Pontryagin Maximum Principle in Hilbert space are proved, and the bang-bang structure of the optimal control is established. A new iterative Pontryagin Maximum Principle (IPMP) method for the identification of the bang-bang optimal control is developed. Numerical simulations based on IPMP and the gradient projection method (GPM) in Hilbert spaces are pursued, and the convergence, stability, and the regularization effect are demonstrated. Comparative analysis of filtering with regular optimal electromagnetic field versus non-filtering with bang-bang optimal field ( Abdulla et al, Quantum Sci. Technol.,&#xA0; 9 , 4, 2024 ) demonstrates that the change of the maxima of the singlet yield is less than 1%. The results open a venue for a potential experimental work on magnetoreception as a manifestation of quantum biological phenomena.", "authors": [ { "name": "Ugur G. Abdulla", "affiliations": [ "Okinawa Institute of Science and Technology 1919-1 Tancha, Onna-son, Kunigami-gun, Okinawa, Japan 904-0495" ] }, { "name": "Jose H. Rodrigues", "affiliations": [ "Okinawa Institute of Science and Technology 1919-1 Tancha, Onna-son, Kunigami-gun, Okinawa, Japan 904-0495" ] }, { "name": "Jean-Jacques Slotine", "affiliations": [ "Nonlinear Systems Laboratory, Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-06", "source": "crossref" }, { "doi": "10.22331/q-2026-05-05-2093", "url": "https://doi.org/10.22331/q-2026-05-05-2093", "title": "Efficient Simulation of High-Level Quantum Gates", "abstract": "Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such as oracles and multi-controlled X ( C k X ) gates, existing simulation methods require compilation to a low-level gate-set before simulation. This, however, increases circuit size and incurs a considerable (typically exponential) overhead, even when the number of high-level gates is small. Here we present a gadget-based simulator which simulates high-level gates directly, thereby allowing to avoid or reduce the blowup of compilation. Our simulator uses a stabilizer decomposition of the magic state of non-stabilizer gates, with improvements in the rank of the magic state directly improving performance. We then proceed to establish a small stabilizer rank for a range of high-level gates that are common in various quantum algorithms. Using these bounds in our simulator, we improve both the theoretical complexity of simulating circuits containing such gates, and the practical running time compared to standard simulators found in IBM's Qiskit Aer library. We also derive exponential lower-bounds for the stabilizer rank of some gates under common complexity-theoretic hypotheses. In certain cases, our lower-bounds are asymptotically tight on the exponent.", "authors": [ { "name": "Adam Husted Kjelstrøm", "affiliations": [ "Department of Computer Science, Aarhus University" ] }, { "name": "Andreas Pavlogiannis", "affiliations": [ "Department of Computer Science, Aarhus University" ] }, { "name": "Jaco van de Pol", "affiliations": [ "Department of Computer Science, Aarhus University" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-05", "source": "crossref" }, { "doi": "10.22331/q-2026-05-05-2095", "url": "https://doi.org/10.22331/q-2026-05-05-2095", "title": "Assessing non-Gaussian quantum state conversion with the stellar rank", "abstract": "State conversion is a fundamental task in quantum information processing. Quantum resource theories allow for analyzing and bounding conversions that use restricted sets of operations. In the context of continuous-variable systems, state conversions restricted to Gaussian operations are crucial for both fundamental and practical reasons, particularly in state preparation and quantum computing with bosonic codes. However, previous analysis did not consider the relevant case of approximate state conversion. In this work, we introduce a framework for assessing approximate Gaussian state conversion by extending the stellar rank to the approximate stellar rank, which serves as an operational measure of non-Gaussianity. We derive bounds for Gaussian state conversion and distillation under approximate and probabilistic conditions, yielding new no-go results for non-Gaussian state preparation and enabling a reliable assessment of the performance of Gaussian conversion protocols. We also provide an open-source Python library to compute stellar-rank-related quantities and to assess Gaussian conversion.", "authors": [ { "name": "Oliver Hahn", "affiliations": [ "Department of Basic Science, The University of Tokyo, 3-8-1 Komaba, Meguro-ku, Tokyo, 153-8902, Japan", "Wallenberg Centre for Quantum Technology, Department of Microtechnology and Nanoscience, Chalmers University of Technology, Sweden , SE-412 96 Göteborg, Sweden" ] }, { "name": "Maxime Garnier", "affiliations": [ "DIENS, École Normale Supérieure, PSL University, CNRS, INRIA, 45 rue d’Ulm, Paris, 75005, France" ] }, { "name": "Giulia Ferrini", "affiliations": [ "Wallenberg Centre for Quantum Technology, Department of Microtechnology and Nanoscience, Chalmers University of Technology, Sweden , SE-412 96 Göteborg, Sweden" ] }, { "name": "Alessandro Ferraro", "affiliations": [ "Dipartimento di Fisica ``Aldo Pontremoli'', Università degli Studi di Milano, I-20133 Milano, Italy", "Centre for Theoretical Atomic, Molecular and Optical Physics, Queen's University Belfast, Belfast BT7 1NN, United Kingdom" ] }, { "name": "Ulysse Chabaud", "affiliations": [ "DIENS, École Normale Supérieure, PSL University, CNRS, INRIA, 45 rue d’Ulm, Paris, 75005, France" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-05", "source": "crossref" }, { "doi": "10.22331/q-2026-05-05-2091", "url": "https://doi.org/10.22331/q-2026-05-05-2091", "title": "Nonclassical nullifiers for quantum hypergraph states", "abstract": "Quantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation. Networks of such states are able to achieve universality for continuous variable measurement based quantum computation with only Gaussian measurements. For normalised states, the simplest hypergraph states are formed from k -adic interactions among a collection of k harmonic oscillator ground states. However such powerful resources have not yet been observed in experiments and their robustness and scalability have not been tested. Here we develop and analyse necessary criteria for hypergraph nonclassicality based on simultaneous nonlinear squeezing in the nullifiers of hypergraph states. We put forward an essential analysis of their robustness to realistic scenarios involving thermalisation or loss and suggest several basic proof-of-principle options for experiments to observe nonclassicality in hypergraph states.", "authors": [ { "name": "Abhijith Ravikumar", "affiliations": [ "Department of Optics, Palacký University, 17. listopadu 1192/12, 779 00 Olomouc, Czech Republic" ] }, { "name": "Darren W. Moore", "affiliations": [ "Department of Optics, Palacký University, 17. listopadu 1192/12, 779 00 Olomouc, Czech Republic" ] }, { "name": "Radim Filip", "affiliations": [ "Department of Optics, Palacký University, 17. listopadu 1192/12, 779 00 Olomouc, Czech Republic" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-05", "source": "crossref" }, { "doi": "10.22331/q-2026-05-05-2092", "url": "https://doi.org/10.22331/q-2026-05-05-2092", "title": "Hyper-optimized Quantum Lego Contraction Schedules", "abstract": "Calculating the quantum weight enumerator polynomial (WEP) is a valuable tool for characterizing quantum error-correcting (QEC) codes, but it is computationally hard for large or complex codes. The Quantum LEGO (QL) framework provides a tensor network approach for WEP calculation, in some cases offering superpolynomial speedups over brute-force methods, provided the code exhibits area law entanglement, that a good QL layout is used, and an efficient tensor network contraction schedule is found. We analyze the performance of a hyper-optimized contraction schedule framework across QL layouts for diverse stabilizer code families. We find that the intermediate tensors in the QL networks for stabilizer WEPs are often highly sparse, invalidating the dense-tensor assumption of standard cost functions. To address this, we introduce an exact, polynomial-time Sparse Stabilizer Tensor (SST) cost function based on the rank of the parity check matrices for intermediate tensors. The SST cost function correlates perfectly with the true contraction cost, providing a significant advantage over the default cost function, which exhibits large uncertainty. Optimizing contraction schedules using the SST cost function yields substantial performance gains, achieving up to orders of magnitude improvement in actual contraction cost compared to using the dense tensor cost function. Furthermore, the precise cost estimation from the SST function offers an efficient metric to decide whether the QL-based WEP calculation is computationally superior to brute force for a given QL layout. These results, enabled by PlanqTN, a new open-source QL implementation, validate hyper-optimized contraction as a crucial technique for leveraging the QL framework to explore the QEC code design space.", "authors": [ { "name": "Balint Pato", "affiliations": [ "Duke Quantum Center, Duke University, Durham, NC 27701, USA", "Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA" ] }, { "name": "June Vanlerberghe", "affiliations": [ "Duke Quantum Center, Duke University, Durham, NC 27701, USA", "Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA" ] }, { "name": "Kenneth R. Brown", "affiliations": [ "Duke Quantum Center, Duke University, Durham, NC 27701, USA", "Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA", "Department of Physics, Duke University, Durham, NC 27708, USA", "Department of Chemistry, Duke University, Durham, NC 27708, USA" ] } ], "journal": { "id": "quantum-journal", "title": "Quantum", "issn": [ "2521-327X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "qml", "general" ], "journal_areas": [ "algorithms", "foundations", "error-correction", "qml" ], "india_hint": false, "published": "2026-05-05", "source": "crossref" }, { "doi": "10.1038/s41534-026-01273-4", "url": "https://doi.org/10.1038/s41534-026-01273-4", "title": "Learning to erase quantum states: thermodynamic implications of quantum learning theory", "abstract": "", "authors": [ { "name": "Haimeng Zhao", "affiliations": [] }, { "name": "Yuzhen Zhang", "affiliations": [] }, { "name": "John Preskill", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1038/s41534-026-01213-2", "url": "https://doi.org/10.1038/s41534-026-01213-2", "title": "High-performance local decoders for defect matching in 1D", "abstract": "Abstract Local decoders, also known as cellular-automaton decoders, offer a promising path toward real-time quantum error-correction by replacing centralized classical decoding, with inherent hardware constraints, with a natively parallel and streamlined architecture from a simple local transition rule. We propose two new types of local decoders for the quantum repetition code in one dimension. The signal-rule decoders interpret odd parities between neighboring qubits as defects, attracted to each other via the exchange of binary-signals. We prove the existence of a threshold in the code-capacity model and present numerical evidence of exponential logical error suppression under a phenomenological noise model, with data and measurement errors at each error correction cycle. Compared to previously known local decoders that suffer from sub-optimal threshold and scaling, our construction significantly narrows the gap with global decoders for practical system sizes and error rates. Implementation requirements can be further reduced by eliminating the need for local classical memories, with a new rule defined on two rows of qubits. This shearing-rule works well at relevant system sizes making it an appealing short-term solution. When combined with biased-noise qubits, such as cat qubits, these decoders enable a fully local quantum memory in one dimension.", "authors": [ { "name": "Louis Paletta", "affiliations": [] }, { "name": "Anthony Leverrier", "affiliations": [] }, { "name": "Mazyar Mirrahimi", "affiliations": [] }, { "name": "Christophe Vuillot", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1038/s41534-026-01276-1", "url": "https://doi.org/10.1038/s41534-026-01276-1", "title": "Threshold of surface code under nearest-neighbor correlated errors via an exact statistical mechanical mapping", "abstract": "", "authors": [ { "name": "SiYing Wang", "affiliations": [] }, { "name": "ZhiXin Xia", "affiliations": [] }, { "name": "Yue Yan", "affiliations": [] }, { "name": "Xiang-Bin Wang", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-23", "source": "crossref" }, { "doi": "10.1038/s41534-026-01277-0", "url": "https://doi.org/10.1038/s41534-026-01277-0", "title": "Super-Heisenberg scaling using nonlinear quantum scrambling", "abstract": "", "authors": [ { "name": "Dong Xie", "affiliations": [] }, { "name": "Chunling Xu", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1038/s41534-026-01266-3", "url": "https://doi.org/10.1038/s41534-026-01266-3", "title": "Privacy in distributed quantum sensing with Gaussian quantum networks", "abstract": "", "authors": [ { "name": "Uesli Alushi", "affiliations": [] }, { "name": "Roberto Di Candia", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1038/s41534-026-01272-5", "url": "https://doi.org/10.1038/s41534-026-01272-5", "title": "Mapping the positions of Two-Level-Systems on the surface of a superconducting transmon qubit", "abstract": "Abstract The coherence of superconducting quantum computers is severely limited by material defects that create parasitic two-level-systems (TLS). Progress is complicated by lacking understanding how TLS are created and in which parts of a qubit circuit they are most detrimental. Here, we present a method to determine the individual positions of TLS at the surface of a transmon qubit. We employ a set of on-chip gate electrodes near the qubit to generate local DC electric fields that are used to tune the TLS’ resonance frequencies. The TLS position is inferred from the strengths at which TLS couple to different electrodes and comparing them to electric field simulations. We found that the majority of detectable surface-TLS was residing on the leads of the qubit’s Josephson junction, despite the dominant contribution of its coplanar capacitor to electric field energy and surface area. This indicates that the TLS density is significantly enhanced near shadow-evaporated electrodes fabricated by lift-off techniques. Our method is useful to identify critical circuit regions where TLS contribute most to decoherence, and can guide improvements in qubit design and fabrication methods.", "authors": [ { "name": "Jürgen Lisenfeld", "affiliations": [] }, { "name": "Alexander K. Händel", "affiliations": [] }, { "name": "Etienne Daum", "affiliations": [] }, { "name": "Benedikt Berlitz", "affiliations": [] }, { "name": "Alexander Bilmes", "affiliations": [] }, { "name": "Alexey V. Ustinov", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1038/s41534-026-01270-7", "url": "https://doi.org/10.1038/s41534-026-01270-7", "title": "No-go theorems on probabilistically enhancing measurement incompatibility’s advantages", "abstract": "Abstract We show that the quantum advantages arising from incompatibility of a set of measurements cannot be enhanced by subjecting them to a filter, namely, by combining them with a device that post-selects the incoming states on a fixed outcome of a stochastic transformation. This result holds for several measures of incompatibility, such as those based on robustness and convex weight. As an application, we show that, for Einstein-Podolsky-Rosen steering, our no-go results determine the maximum steerability attainable under the most general local filters, together with an explicit expression for the optimal filter. Moreover, our results generalize to nonphysical maps, i.e., positive but not completely positive linear maps.", "authors": [ { "name": "Huan-Yu Ku", "affiliations": [] }, { "name": "Chung-Yun Hsieh", "affiliations": [] }, { "name": "Costantino Budroni", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1038/s41534-026-01259-2", "url": "https://doi.org/10.1038/s41534-026-01259-2", "title": "Quantum learning with tunable loss functions", "abstract": "", "authors": [ { "name": "Yixian Qiu", "affiliations": [] }, { "name": "Lirandë Pira", "affiliations": [] }, { "name": "Patrick Rebentrost", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1038/s41534-026-01245-8", "url": "https://doi.org/10.1038/s41534-026-01245-8", "title": "Pulse shaping for ultra-fast adiabatic quantum gates", "abstract": "", "authors": [ { "name": "İlker Polat", "affiliations": [] }, { "name": "Ramon W. J. Overwater", "affiliations": [] }, { "name": "Maximilian Rimbach-Russ", "affiliations": [] }, { "name": "Fabio Sebastiano", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s41534-026-01264-5", "url": "https://doi.org/10.1038/s41534-026-01264-5", "title": "Security of quantum key distribution with source and detector imperfections through phase-error estimation", "abstract": "", "authors": [ { "name": "Guillermo Currás-Lorenzo", "affiliations": [] }, { "name": "Margarida Pereira", "affiliations": [] }, { "name": "Shlok Nahar", "affiliations": [] }, { "name": "Devashish Tupkary", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s41534-026-01256-5", "url": "https://doi.org/10.1038/s41534-026-01256-5", "title": "Near-optimal discrimination of displaced squeezed binary signals using displacement, inverse-squeezing, and photon-number-resolving detection", "abstract": "Abstract We propose an inverse-squeezing Kennedy receiver for discriminating binary phase-shift-keyed displaced squeezed vacuum states. The receiver combines a Kennedy-type nulling displacement, an orthogonally oriented inverse-squeezing operation and photon-number-resolving detection with a maximum-a- posteriori threshold rule. Its key mechanism is that the inverse-squeezing stage converts transmitter-side squeezing into enhanced photon-number contrast, or equivalently an effective coherent-state energy gain, that can be directly exploited at the measurement stage. Under ideal equal-prior conditions, the receiver surpasses the standard quantum limit for squeezed-state binary phase-shift keying at approximately N ≈ 0.3, outperforms the Helstrom bound of coherent-state binary phase-shift keying at approximately N ≈ 0.4, and reaches the 1% error level near N ≈ 0.6. We further analyze its performance under realistic imperfections, including finite detector efficiency, dark counts, channel phase diffusion, receiver thermal noise and transmission loss. The results show that adaptive thresholding preserves robust performance against detector and noise imperfections over practical parameter ranges, whereas transmission loss progressively suppresses the squeezing-enabled advantage. These findings indicate that, for the fixed source parametrization adopted in this work, the proposed receiver is most advantageous in the low-loss regime, especially at low source energies.", "authors": [ { "name": "Enhao Bai", "affiliations": [] }, { "name": "Jian Peng", "affiliations": [] }, { "name": "Tianyi Wu", "affiliations": [] }, { "name": "Kai Wen", "affiliations": [] }, { "name": "Fengkai Sun", "affiliations": [] }, { "name": "Chun Zhou", "affiliations": [] }, { "name": "Yaping Li", "affiliations": [] }, { "name": "Zhenrong Zhang", "affiliations": [] }, { "name": "Chen Dong", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1038/s41534-026-01255-6", "url": "https://doi.org/10.1038/s41534-026-01255-6", "title": "Bounding the computational power of bosonic systems", "abstract": "Abstract Bosonic quantum systems operate in an infinite-dimensional Hilbert space, unlike discrete-variable quantum systems. This distinct mathematical structure leads to fundamental differences in quantum information processing, such as exponentially greater complexity of state tomography 1 and factoring in constant space 2 . Yet, it remains unclear whether this structural difference may translate to a practical computational advantage over finite-dimensional quantum computers. Here we take a step towards answering this question by showing that universal bosonic quantum computations can be simulated in polynomial space (and exponential time) on a classical computer, improving the previous best upper bound requiring exponential memory 3 . In complexity-theoretic terms, we improve the best upper bound on CVBQP with at most exponential energy from EXPSPACE to PSPACE. This result is achieved using a simulation strategy based on finite energy cutoffs and approximate coherent state decompositions. While we propose ways to potentially refine this bound, we also present arguments supporting the plausibility of an exponential computational advantage of bosonic quantum computers over their discrete-variable counterparts. Furthermore, we emphasize the role of circuit energy as a resource and discuss why it may act as the fundamental bottleneck in realizing this advantage in practice.", "authors": [ { "name": "Varun Upreti", "affiliations": [] }, { "name": "Dorian Rudolph", "affiliations": [] }, { "name": "Ulysse Chabaud", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41534-026-01240-z", "url": "https://doi.org/10.1038/s41534-026-01240-z", "title": "Generalized Toffoli gates with customizable single-step multiple-qubit control", "abstract": "Abstract Motivated by recent advances in the single-step implementation of n -control-qubit Toffoli gates, we propose a broad class of generalized Toffoli gates with multiple control qubits that can be executed in a single step using a feasible and unified framework based on Ising-type interactions. Unlike the standard Toffoli gate condition, which flips the target qubit only when all control qubits are in the $$|1\\rangle$$ | 1 state, our generalized gates allow for diverse, customizable control conditions, including: mixed control, Hamming weight control, weighted Hamming control, multiple-designated configurations, threshold control, multiple-target control, and multiple-option control. Simulation results demonstrate that these gates offer substantial advantages in both feasibility and reliability over decompositions into standard 2-control-qubit Toffoli gates and other primitive gates, significantly reducing circuit depth, execution time, and error rates.", "authors": [ { "name": "Chung-Kai Wu", "affiliations": [] }, { "name": "Dah-Wei Chiou", "affiliations": [] }, { "name": "Jie-Hong Roland Jiang", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41534-026-01235-w", "url": "https://doi.org/10.1038/s41534-026-01235-w", "title": "Quantum computational sensing using quantum signal processing, quantum neural networks, and Hamiltonian engineering", "abstract": "Abstract Combining quantum sensing with quantum computing can lead to quantum computational sensing (QCS) protocols that are able to more efficiently extract task-specific information from physical signals than is possible otherwise. In this paper, we present, in theory and numerical simulations, the application of two quantum algorithms - quantum signal processing and quantum neural networks - to various binary and multiclass machine-learning classification tasks in sensing. Here, sensing operations are interleaved with computing operations, giving rise to nonlinear functions of the sensed signals. Our approach to optimizing QCS protocols takes into account quantum sampling noise and allows us to engineer protocols that can yield accurate results with as few as just a single measurement shot. In all cases, we have been able to show a regime of operation where a quantum computational sensor can achieve higher accuracy than a conventional quantum sensor for a given budget of sensing time, with a simulated accuracy advantage of >20 percentage points for some tasks. We also present protocols for performing nonlinear tasks using Hamiltonian-engineered bosonic systems and quantum signal processing with hybrid qubit-bosonic systems, and empirically show an advantage when the received signal has a limited mean photon number.", "authors": [ { "name": "Saeed A. Khan", "affiliations": [] }, { "name": "Sridhar Prabhu", "affiliations": [] }, { "name": "Logan G. Wright", "affiliations": [] }, { "name": "Peter L. McMahon", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s41534-026-01253-8", "url": "https://doi.org/10.1038/s41534-026-01253-8", "title": "Quantum magic dynamics in random circuits", "abstract": "", "authors": [ { "name": "Yuzhen Zhang", "affiliations": [] }, { "name": "Yingfei Gu", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s41534-026-01258-3", "url": "https://doi.org/10.1038/s41534-026-01258-3", "title": "Practical blueprint for low-depth photonic quantum computing with quantum dots", "abstract": "Abstract Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics requiring only finite-sized entangled resource states followed by linear-optics operations and photon measurements. Large-scale implementations have so far been limited due to the access only to probabilistic photon sources, vulnerability to photon loss, and the need for massive multiplexing. Deterministic photon sources offer an alternative and resource-efficient route. By synergistically integrating deterministic photon emission, adaptive repeat-until-success fusions, and an optimised architectural design, we propose a complete blueprint for a photonic quantum computer using quantum dots and linear optics. It features time-bin qubit encoding, reconfigurable entangled-photon sources, and a fusion-based architecture with low optical connectivity, significantly reducing the required optical depth per photon and resource overheads. We present in detail the hardware required for resource-state generation and fusion networking, experimental pulse sequences, and exact resource estimates for preparing a logical qubit. We estimate that one logical clock cycle of error correction can be executed within microseconds, which scales linearly with the code distance. We also simulate error thresholds for fault-tolerance considering a full catalogue of intrinsic error sources found in real-world quantum dot devices. Our work establishes a practical blueprint for a low-optical-depth, emitter-based fault-tolerant photonic quantum computer.", "authors": [ { "name": "Ming Lai Chan", "affiliations": [] }, { "name": "Aliki Anna Capatos", "affiliations": [] }, { "name": "Peter Lodahl", "affiliations": [] }, { "name": "Anders Søndberg Sørensen", "affiliations": [] }, { "name": "Stefano Paesani", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s41534-026-01260-9", "url": "https://doi.org/10.1038/s41534-026-01260-9", "title": "High-performance continuous-variable quantum secret sharing using a state-discrimination detector", "abstract": "Abstract Continuous-variable quantum secret sharing (CVQSS) is a promising approach to ensuring multi-party information security. While CVQSS offers practical ease of implementation, its present performance remains limited. In this paper, we propose a novel CVQSS protocol integrated with a state-discrimination detector (SDD), dubbed SDD-CVQSS. In particular, we first develop the detailed procedure of SDD-CVQSS, which replaces the traditional coherent detector with an SDD and eliminates the long-standing necessary step of establishing multiple point-to-point quantum key distribution links between all users and the dealer. We then elaborate on the principle of the specifically designed SDD, which can efficiently discriminate interfered states with a much lower error probability. Finally, we construct a security model for SDD-CVQSS and derive its security bound against both eavesdroppers and dishonest users. Numerical simulations show that SDD-CVQSS outperforms conventional CVQSS in terms of both maximum transmission distance and secret key rate, and its performance is even superior to the PLOB bound. Additionally, we find that the performance degradation of SDD-CVQSS in long-distance transmission scenarios can be effectively compensated for using a post-selection scheme, providing a feasible way to achieve high-performance CVQSS.", "authors": [ { "name": "Qin Liao", "affiliations": [] }, { "name": "Chong Tang", "affiliations": [] }, { "name": "Qingquan Peng", "affiliations": [] }, { "name": "Chao Ding", "affiliations": [] }, { "name": "Lingjin Zhu", "affiliations": [] }, { "name": "Yiyu Mao", "affiliations": [] }, { "name": "Yijun Wang", "affiliations": [] }, { "name": "Xiquan Fu", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s41534-026-01267-2", "url": "https://doi.org/10.1038/s41534-026-01267-2", "title": "Squeezed light in a semiconductor microcavity", "abstract": "", "authors": [ { "name": "Xuan Zuo", "affiliations": [] }, { "name": "Zi-Xu Lu", "affiliations": [] }, { "name": "Zhi-Yuan Fan", "affiliations": [] }, { "name": "Shi-Yao Zhu", "affiliations": [] }, { "name": "Jie Li", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.1038/s41534-026-01234-x", "url": "https://doi.org/10.1038/s41534-026-01234-x", "title": "Relativity and decoherence of spacetime superpositions", "abstract": "Abstract It is univocally anticipated that in a theory of quantum gravity, there exist quantum superpositions of semiclassical states of spacetime geometry. Such states could arise, for example, from a source mass in a superposition of spatial configurations. In this paper, we introduce a framework for describing such “quantum superpositions of spacetime states.” We introduce the notion of the relativity of spacetime superpositions, demonstrating that for states in which the superposed amplitudes differ by a coordinate transformation, it is always possible to re-express the scenario in terms of dynamics on a single, fixed background. Our result unveils an inherent ambiguity in labelling such superpositions as genuinely quantum-gravitational, which has been done extensively in the literature, most notably with reference to recent proposals to test gravitationally-induced entanglement. We apply our framework to the above-mentioned scenarios, looking at gravitationally-induced entanglement, the problem of decoherence of gravitational sources, and clarifying commonly overlooked assumptions. In the context of decoherence of gravitational sources, our result implies that the resulting decoherence is not fundamental, but depends on the existence of external systems that define a relative set of coordinates through which the notion of spatial superposition obtains physical meaning.", "authors": [ { "name": "Joshua Foo", "affiliations": [] }, { "name": "Cendikiawan Suryaatmadja", "affiliations": [] }, { "name": "Robert B. Mann", "affiliations": [] }, { "name": "Magdalena Zych", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.1038/s41534-026-01265-4", "url": "https://doi.org/10.1038/s41534-026-01265-4", "title": "Stabilizer entanglement enhances magic injection", "abstract": "", "authors": [ { "name": "Zong-Yue Hou", "affiliations": [] }, { "name": "ChunJun Cao", "affiliations": [] }, { "name": "Zhi-Cheng Yang", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-11", "source": "crossref" }, { "doi": "10.1038/s41534-026-01257-4", "url": "https://doi.org/10.1038/s41534-026-01257-4", "title": "Non-Markovianity and memory enhancement in quantum reservoir computing", "abstract": "", "authors": [ { "name": "Antonio Sannia", "affiliations": [] }, { "name": "Ricard Ravell Rodríguez", "affiliations": [] }, { "name": "Gian Luca Giorgi", "affiliations": [] }, { "name": "Roberta Zambrini", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-08", "source": "crossref" }, { "doi": "10.1038/s41534-026-01230-1", "url": "https://doi.org/10.1038/s41534-026-01230-1", "title": "Polynomially efficient quantum enabled variational Monte Carlo for training neural-network quantum states for physico-chemical applications", "abstract": "", "authors": [ { "name": "Manas Sajjan", "affiliations": [] }, { "name": "Vinit Singh", "affiliations": [] }, { "name": "Sabre Kais", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-08", "source": "crossref" }, { "doi": "10.1038/s41534-026-01254-7", "url": "https://doi.org/10.1038/s41534-026-01254-7", "title": "Efficient simulation of low-entanglement bosonic Gaussian states in polynomial time", "abstract": "Abstract Bosonic Gaussian states are ubiquitous in quantum optics and condensed matter physics. While they are efficiently handled within the Gaussian formalism, sampling requires calculating amplitudes in the boson occupation basis. This step, however, is hindered by a significant bottleneck due to the hafnian. We present an efficient algorithm that converts pure bosonic Gaussian states into matrix product states (MPSs), thereby establishing a versatile tool for probing bosonic Gaussian systems in settings where direct Gaussian-formalism-based calculations become inefficient. Our method combines a Gaussian singular value decomposition with a projected-creation-operator mapping that constructs local MPS tensors without computing hafnians. Benchmarking on covariance matrices from the Jiuzhang 2.0 and Jiuzhang 4.0 Gaussian boson sampling experiments demonstrates substantial speedups over previous tensor-network approaches in the low-entanglement regime relevant to lossy devices. The method provides a scalable classical simulation framework for bosonic Gaussian states with limited entanglement. In this regime, a target accuracy can be achieved with a bond dimension that remains computationally tractable, thereby extending the applicability of MPS-based methods to a broad range of bosonic systems.", "authors": [ { "name": "Tong Liu", "affiliations": [] }, { "name": "Hui-Ke Jin", "affiliations": [] }, { "name": "Tao Xiang", "affiliations": [] }, { "name": "Hong-Hao Tu", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-07", "source": "crossref" }, { "doi": "10.1038/s41534-026-01251-w", "url": "https://doi.org/10.1038/s41534-026-01251-w", "title": "Large-scale quantum reservoir computing using a Gaussian Boson Sampler", "abstract": "Abstract A Gaussian boson sampler (GBS) is a special-purpose quantum computer that can be practically realized at a large scale in optics. Here we report on experiments in which we used a frequency-multiplexed GBS with > 400 modes as a quantum reservoir. We evaluated the accuracy of our GBS-based reservoir computer on a variety of benchmark tasks. We found that when the system was given access to the correlations between measured modes of the GBS, the achieved accuracies were the same or higher than when it was only given access to the mean photon number in each mode - and in several cases the advantage in accuracy from using the correlations was greater than 20 percentage points. This provides experimental evidence in support of theoretical predictions that access to correlations enhances the power of quantum reservoir computers. We also tested our reservoir computer when operating the reservoir with various sources of classical rather than quantum light and found that using squeezed light consistently resulted in the highest accuracies. Our work experimentally establishes that a GBS can be an effective quantum reservoir and provides a practical platform for experimentally exploring the role of quantumness and correlations in quantum machine learning at very large system sizes.", "authors": [ { "name": "Valeria Cimini", "affiliations": [] }, { "name": "Mandar M. Sohoni", "affiliations": [] }, { "name": "Federico Presutti", "affiliations": [] }, { "name": "Benjamin K. Malia", "affiliations": [] }, { "name": "Shi-Yuan Ma", "affiliations": [] }, { "name": "Ryotatsu Yanagimoto", "affiliations": [] }, { "name": "Tianyu Wang", "affiliations": [] }, { "name": "Tatsuhiro Onodera", "affiliations": [] }, { "name": "Logan G. Wright", "affiliations": [] }, { "name": "Peter L. McMahon", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "qml", "general" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-06", "source": "crossref" }, { "doi": "10.1038/s41534-026-01262-7", "url": "https://doi.org/10.1038/s41534-026-01262-7", "title": "Multiuser entanglement distribution network across cryogenic nodes enabled by integrated photonic chips", "abstract": "", "authors": [ { "name": "Zhiyun Shu", "affiliations": [] }, { "name": "Yuchi Li", "affiliations": [] }, { "name": "Xiaoyu Liu", "affiliations": [] }, { "name": "You Xiao", "affiliations": [] }, { "name": "Jia Huang", "affiliations": [] }, { "name": "Hongxin Xu", "affiliations": [] }, { "name": "Zhen Wang", "affiliations": [] }, { "name": "Lixing You", "affiliations": [] }, { "name": "Hao Li", "affiliations": [] } ], "journal": { "id": "npj-qi", "title": "npj Quantum Information", "issn": [ "2056-6387" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "communication" ], "journal_areas": [ "hardware", "algorithms", "communication", "sensing" ], "india_hint": false, "published": "2026-05-06", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae740f", "url": "https://doi.org/10.1088/2058-9565/ae740f", "title": "Subwavelength Micromachined Vapor-Cell-Based Rydberg Quantum Antennas", "abstract": "Abstract Micromachined vapor cells have revolutionized chip-scale quantum sensors, including magnetometers and atomic clocks. In parallel, Rydberg-atom quantum sensing has emerged as a powerful platform for broadband, non-invasive and ultra-sensitive electrometry, enabling compact atom-based antenna elements for electromagnetic reception, often referred to as quantum antennas. Yet, to date, Rydberg sensing has largely been limited to glass blown, cm-scale vapor cells. Here, we perform Rydberg spectroscopy and electrometry using a wafer-scale-fabricated Pyrex - Si - Pyrex cell with millimeter-scale dimensions. The Rydberg spectroscopic line is characterized with respect to critical parameters such as temperature, the frequency and amplitude of the applied radiofrequency field, light intensity, and the spatial position of the interrogating beam. Our study reveals lineshapes directly influenced by a complex landscape of electrostatic fields with values up to approximately 0.6 V/cm. By controlling key parameters, we were able to reduce the effect of these internal electric fields, and demonstrate the detection of RF fields with a sensitivity as low as 10 &mu;V/cm. Our results highlight the potential of micromachined vapor cells for sub-wavelength electromagnetic field measurements, with applications in communications, near-field RF imaging, and chip-scale quantum technologies.", "authors": [ { "name": "Avital Giat", "affiliations": [ "Hebrew University of Jerusalem Faculty of Science" ] }, { "name": "Kfir Levi", "affiliations": [ "Hebrew University of Jerusalem Faculty of Science" ] }, { "name": "Ori Nefesh", "affiliations": [ "Hebrew University of Jerusalem Faculty of Science" ] }, { "name": "Liron Stern", "affiliations": [ "Hebrew University of Jerusalem Faculty of Science" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae73ae", "url": "https://doi.org/10.1088/2058-9565/ae73ae", "title": "A quantum state transfer protocol with Ising Hamiltonians", "abstract": "Abstract Quantum state transfer is a fundamental requirement for scalable quantum computation, where fast and reliable communication between distant subsystems is essential. In this work, we present a protocol for quantum state transfer in linear Ising chains. Starting from a perfect state transfer scheme via a Heisenberg Hamiltonian with inhomogeneous couplings, we adapt it for architectures implementing the transverse-field Ising model by encoding the information in domain walls. The resulting linear Ising chain makes quantum transport experiments accessible to many platforms for analog quantum simulation. We test the protocol for 1-, 2-, and 3-spin states, obtaining high transfer fidelities of up to 0.99 and study the accuracy dependence on the domain wall approximation. These results are the first step in paving the way for an experimental implementation of the protocol.", "authors": [ { "name": "Oscar Michel", "affiliations": [ "Universitat de Barcelona" ] }, { "name": "Matthias Werner", "affiliations": [ "Universitat de Barcelona" ] }, { "name": "Arnau Riera", "affiliations": [ "Qilimanjaro Quantum Tech" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae73af", "url": "https://doi.org/10.1088/2058-9565/ae73af", "title": "Quantum optical shallow networks", "abstract": "Abstract Classical shallow networks are universal approximators. Given a sufficient number of neurons, they can reproduce any continuous function to arbitrary precision, with a resource cost that scales linearly in both the input size and the number of trainable parameters. In this work, we present a quantum optical protocol that implements a shallow network with an arbitrary number of neurons. Both the input data and the parameters are encoded into single-photon states. Leveraging the Hong-Ou-Mandel effect, the network output is determined by the coincidence rates measured when the photons interfere at a beam splitter, with multiple neurons prepared as a mixture of single-photon states. Remarkably, once trained, our model requires constant optical resources regardless of the number of input features and neurons.", "authors": [ { "name": "Simone Roncallo", "affiliations": [ "University of Pavia" ] }, { "name": "Angela Rosy Morgillo", "affiliations": [ "University of Pavia" ] }, { "name": "Seth Lloyd", "affiliations": [ "MIT" ] }, { "name": "Chiara Macchiavello", "affiliations": [ "Università di Pavia" ] }, { "name": "Lorenzo Maccone", "affiliations": [ "Università di Pavia" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae73ad", "url": "https://doi.org/10.1088/2058-9565/ae73ad", "title": "Overshifted Parameter-Shift Rules: Optimizing Complex Quantum Systems with Few Measurements", "abstract": "Abstract Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for evaluating gradients of expectation values with respect to circuit parameters, but its applicability is limited to circuits whose gate generators have a particular spectral structure. In this work, we present a generalized framework that, with optimal minimum measurement overhead, extends parameter shift rules beyond this restrictive setting to encompass basically arbitrary gate generator, possibly made of complex multi-qubit interactions with unknown spectrum and, in some settings, even infinite dimensional systems such as those describing photonic devices or qubit-oscillator systems. Our generalization enables the use of more expressive quantum circuits in variational quantum optimization and enlarges its scope by harnessing all the available hardware degrees of freedom.", "authors": [ { "name": "Leonardo Banchi", "affiliations": [ "University of Florence" ] }, { "name": "Dominic Branford", "affiliations": [ "University of Florence" ] }, { "name": "Chetan Waghela", "affiliations": [ "University of Florence" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae73b0", "url": "https://doi.org/10.1088/2058-9565/ae73b0", "title": "Problem-informed graphical quantum generative learning", "abstract": "Abstract Leveraging the intrinsic probabilistic nature of quantum systems, generative quantum machine learning (QML) offers the potential to outperform classical learning models. Current generative QML algorithms mostly rely on general-purpose models that, while being very expressive, face several training challenges. One potential way to address these setbacks is by constructing problem-informed models that are capable of more efficient training on structured problems. In particular, probabilistic graphical models provide a flexible framework for representing structure in generative learning problems and can thus be exploited to incorporate inductive bias into QML algorithms. In this work, we propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables, with independence relations efficiently represented by a Markov network (MN). We further demonstrate the applicability of the MN framework in constructing generative learning benchmarks and compare our model's performance to previous designs, showing that it outperforms problem-agnostic circuits. Based on a preliminary analysis of trainability, we narrow down the class of MNs to those exhibiting favourable trainability properties. Finally, we discuss the potential of our model to offer quantum advantage in the context of generative learning, and present a practical scenario demonstrating the scalability of the approach.", "authors": [ { "name": "Bence Bakó", "affiliations": [ "HUN-REN Wigner Research Centre for Physics" ] }, { "name": "Dániel T. R. Nagy", "affiliations": [ "HUN-REN Wigner Research Centre for Physics" ] }, { "name": "Péter Hága", "affiliations": [ "Ericsson Research" ] }, { "name": "Zsófia Kallus", "affiliations": [ "Ericsson Research" ] }, { "name": "Zoltán Zimborás", "affiliations": [ "HUN-REN Wigner Research Centre for Physics" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "foundations", "algorithms", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae679c", "url": "https://doi.org/10.1088/2058-9565/ae679c", "title": "Quantum key distribution using hBN single-photon emitters at a 40 MHz clock rate", "abstract": "Abstract Room-temperature (RT) solid-state quantum emitters are essential for building practical and scalable quantum communication systems, yet their application has been critically hindered by the slow operational speeds of corresponding modulation technologies. In this work, we overcome this key performance bottleneck. We demonstrate a quantum key distribution (QKD) system using a single defect in hexagonal boron nitride (hBN) with dynamic polarization encoding at a 40 MHz clock rate, an order of magnitude faster than previous demonstrations with similar sources. Implementing the B92 protocol, our system yields a secure key rate of 7 kbps in the finite-key regime with a quantum bit error rate of 6.49%, establishing a new performance benchmark for RT single-photon QKD. Furthermore, to chart a path beyond the limits of direct transmission, we present the first quantitative performance analysis of hBN spin-defects as quantum repeater nodes. Overall, our high-speed experimental demonstration, supported by a foundational analysis of the system architecture, suggests that hBN defects represent a promising and technically feasible platform for scalable, quantum communication.", "authors": [ { "name": "Ömer S Tapşın", "affiliations": [ "QLocked Technology Development Inc.,", "İzmir Institute of Technology", "Heriot-Watt University" ] }, { "name": "Furkan Ağlarcı", "affiliations": [ "QLocked Technology Development Inc.,", "İzmir Institute of Technology" ] }, { "name": "Roberto G Pousa", "affiliations": [ "ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology", "University of Strathclyde" ] }, { "name": "Daniel K L Oi", "affiliations": [ "University of Strathclyde" ] }, { "name": "Mustafa Gündoğan", "affiliations": [ "Humboldt-Universität zu Berlin" ] }, { "name": "Serkan Ateş", "affiliations": [ "QLocked Technology Development Inc.,", "Sabanci University" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6acc", "url": "https://doi.org/10.1088/2058-9565/ae6acc", "title": "QAGO: evolving quantumness through genetic optimization of quantum circuits", "abstract": "Abstract Designing expressive yet hardware-efficient quantum circuits remains a central challenge in quantum machine learning (QML). Existing approaches to quantum circuit synthesis primarily optimize for classical performance metrics, often overlooking intrinsic quantum characteristics that govern circuit quality and generalization. This work introduces a quantumness-aware genetic optimization (QAGO) framework for circuit synthesis that integrates quantum properties such as entanglement and non-Clifford gate utilization into the evolutionary design process. We formulate circuit synthesis as both a single-objective optimization (SOO) and a multi-objective optimization (MOO) problem within a genetic framework. The SOO formulation explores quantumness-aware objectives balancing predictive performance and circuit-level quantum structure, while the MOO formulation approximates Pareto-efficient trade-offs between these goals. This dual perspective enables systematic analysis of how increasing quantum expressivity influences predictive behavior and resource cost. Experimental evaluations across three quantum kernel-based algorithms include quantum support vector machines, quantum kernel trainers, and projected quantum kernels demonstrate that circuits evolved under quantumness-aware objectives consistently outperform baseline kernel circuits such as ZZFeatureMap. Comprehensive benchmarking against classical baselines shows that QAGO achieves up to 2.5% area under the ROC curve improvement on the Higgs Boson dataset and 1.5% - 9.2% gains across six of nine targets in the LIT-PCBA drug discovery benchmark. Compared to prior work (Wu et al 2021 J. Phys. G: Nucl. Part. Phys. 48 125003, Mensa et al 2023 Mach. Learn.: Sci. Technol. 4 015023) QAGO yields up to 4% improvement on Higgs and 5% - 20% gains across eight of nine targets. These results provide quantitative evidence that optimizing for quantumness enhances both performance and quantum expressivity of QML models, establishing QAGO as a principled framework for quantumness-aware circuit evolution.", "authors": [ { "name": "Kavitha Yogaraj", "affiliations": [ "Indian Institute of Technology" ] }, { "name": "Brian Quanz", "affiliations": [ "Indian Institute of Technology" ] }, { "name": "Sahil Agrawal", "affiliations": [ "Indian Institute of Technology" ] }, { "name": "Arijit Mondal", "affiliations": [ "Indian Institute of Technology" ] }, { "name": "Samrat Mondal", "affiliations": [ "Indian Institute of Technology" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": true, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6bb2", "url": "https://doi.org/10.1088/2058-9565/ae6bb2", "title": "Scalable preparation of matrix product states with sequential and brick wall quantum circuits", "abstract": "Abstract Preparing arbitrary quantum states requires exponential resources. Matrix product states (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50 % and CNOT counts by 33 % . We evaluate the full pipeline on datasets of varying complexity across systems of 19-50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.", "authors": [ { "name": "Tomasz Szołdra", "affiliations": [ "Universität Hamburg" ] }, { "name": "Rick Mukherjee", "affiliations": [ "University of Tennessee", "UTC Quantum Center, University of Tennessee" ] }, { "name": "Peter Schmelcher", "affiliations": [ "Universität Hamburg" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae723b", "url": "https://doi.org/10.1088/2058-9565/ae723b", "title": "Efficient Verification of Stabilizer Code Subspaces with Local Measurements", "abstract": "Abstract We address the task of verifying whether a quantum computer, designed to be protected by a specific stabilizer code, correctly encodes the corresponding logical qubits. To achieve this, we develop a general framework for subspace verification and explore several practically significant stabilizer code subspaces. First, we present two efficient verification strategies for general stabilizer code subspaces, using measurements of their stabilizer generators and stabilizer groups, respectively. Then, building on the observation that certain tests can be conducted in parallel due to specific structural properties of the subspace, we propose a coloring strategy tailored to graph code subspaces and an XZ strategy for Calderbank-Shor-Steane (CSS) code subspaces. Compared to stabilizer-based strategies, these new strategies require significantly fewer measurement settings and consume fewer state copies, achieving near-global optimality. Notably, all the strategies employ a limited number of Pauli measurements, are non-adaptive, and work for mixed states, enabling efficient experimental certification of whether quantum states remain within the target code subspace in noisy quantum computers. This work presents the first systematic study of efficient verification of stabilizer code subspaces with local measurements.", "authors": [ { "name": "Congcong Zheng", "affiliations": [ "Southeast University" ] }, { "name": "Xutao Yu", "affiliations": [ "Southeast University" ] }, { "name": "Zaichen Zhang", "affiliations": [ "Southeast University" ] }, { "name": "Ping Xu", "affiliations": [ "National University of Defense Technology" ] }, { "name": "Kun Wang", "affiliations": [ "National University of Defense Technology" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "error-correction", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae7151", "url": "https://doi.org/10.1088/2058-9565/ae7151", "title": "Learning to Maximize Quantum Neural Network Expressivity via Effective Rank", "abstract": "Abstract Quantum neural networks (QNNs) are widely used as trainable models for solving variational problems, where their ability to represent complex functions directly determines performance. However, accurately quantifying this expressivity remains a major challenge, limiting the understanding of the expressive power of QNNs. Here, we introduce the effective rank $\\kappa$ as a quantitative measure of expressivity. We show that the expressivity of a QNN is determined by the interplay of three factors: the dataset, the measurement operators, and the circuit structure. Unlike conventional metrics based on parameter sampling or entanglement structure, $\\kappa$ captures the number of independent parameters that effectively contribute to the model output, providing an operational and data-dependent characterization of expressivity while avoiding costly parameter sampling. We demonstrate that $\\kappa$ can reach its theoretical maximum $4^n - 1$ for an $n$-qubit system when the circuit architecture, input distribution, and measurement protocol are jointly optimized. Leveraging this insight, we employ $\\kappa$ as a design objective within a reinforcement learning framework with a self-attention transformer agent to automatically discover highly expressive circuit architectures. Our results show that the proposed approach efficiently identifies high-performing circuit configurations, outperforming heuristic designs and random search in terms of sample efficiency. By bridging theoretical characterization with automated design, our approach provides a practical, scalable, and computationally efficient route for constructing expressive quantum circuits, advancing the development of quantum machine learning models.", "authors": [ { "name": "Juan Yao", "affiliations": [ "Shenzhen International Quantum Academy" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6a1b", "url": "https://doi.org/10.1088/2058-9565/ae6a1b", "title": "Full quantum work statistics for non-homogeneous many-body systems", "abstract": "Abstract The non-equilibrium thermodynamics of interacting quantum many-body systems is investigated within the framework of thermal time-dependent density functional theory (DFT) using a generalized linear-response formulation for the full quantum work statistics. A first-principles route is established to reconstruct the relaxation function that underlies linear-response theory, thereby moving beyond phenomenological descriptions and enabling a consistent evaluation of all moments of the dissipated-work distribution in interacting systems. The predictive power of the approach is demonstrated for the Hubbard model subject to a staggered external potential, where the evolution of the relaxation dynamics during the Mott-to-band-insulator crossover reveals how distinct many-body phases shape the out-of-equilibrium thermodynamic response. These results provide a microscopic and transferable framework for quantum thermodynamics in correlated systems, bridging thermal DFT and non-equilibrium work statistics.", "authors": [ { "name": "Antonio Palamara", "affiliations": [ "Università della Calabria", "INFN" ] }, { "name": "Francesco Plastina", "affiliations": [ "Università della Calabria", "INFN" ] }, { "name": "Antonello Sindona", "affiliations": [ "Università della Calabria", "INFN" ] }, { "name": "Irene D’Amico", "affiliations": [ "University of York", "The University of York" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6a1c", "url": "https://doi.org/10.1088/2058-9565/ae6a1c", "title": "Designing a machine learning-driven, cross-hardware emulator for noisy quantum computers with gate-based protocols", "abstract": "Abstract Quantum computer emulators model the behavior and error rates of specific quantum processors. Without accurate noise models in these emulators, it is challenging for users to optimize and debug executable quantum programs prior to running them on the quantum computer, as device-specific noise is not properly accounted for. To overcome this challenge, we design a machine learning (ML)-driven approach to construct approximate device-specific emulators that applies to different hardware platforms. We apply supervised ML on a pre-generated library containing simulated gate set tomography training data. The ML model then analyses gate set tomography data from a target quantum computer to predict its noise model, which is in turn used to construct the device-specific emulator. We demonstrate the effectiveness of our protocol’s emulator in estimating the unitary coupled cluster energy of the H 2 molecule and compare the results with those from actual quantum hardware. Remarkably, our noise model captures device noise with high accuracy, achieving a percentage relative error of just 0.128% in expectation value relative to the actual quantum hardware. Importantly, we show that even without access to pulse-level control, noise from the quantum computer can nonetheless be characterized and independently validated by our protocol.", "authors": [ { "name": "Matthew Ho", "affiliations": [ "Institute of High Performance Computing (IHPC)" ] }, { "name": "Jun Yong Khoo", "affiliations": [ "Institute of High Performance Computing (IHPC)" ] }, { "name": "Adrian M Mak", "affiliations": [ "Institute of High Performance Computing (IHPC)" ] }, { "name": "Stefano Carrazza", "affiliations": [ "Universitá degli Studi di Milano", "INFN", "CERN", "Quantum Research Center" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6fe3", "url": "https://doi.org/10.1088/2058-9565/ae6fe3", "title": "Scalably learning one-dimensional quantum many-body Hamiltonians from dynamical data", "abstract": "Abstract The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measurements on the system. In this work, we introduce a highly scalable, data-driven approach to learning families of interacting many-body Hamiltonians from dynamical data, by bringing together techniques from gradient-based optimization from machine learning with efficient quantum state representations in terms of tensor networks. Our approach is highly practical, experimentally friendly, and intrinsically scalable to allow for system sizes of above 100 spins. In particular, we demonstrate on synthetic data that the algorithm works even if one is restricted to one simple initial state, a small number of single-qubit observables, and time evolution up to relatively short times. For the concrete example of the one-dimensional Heisenberg model our algorithm exhibits an error constant in the system size and scaling as the inverse square root of the size of the data set.", "authors": [ { "name": "Wilde Frederik", "affiliations": [ "Freie Universitat Berlin" ] }, { "name": "Augustine Kshetrimayum", "affiliations": [ "PASQAL" ] }, { "name": "Ingo Roth", "affiliations": [ "Quantum Research Center" ] }, { "name": "Dominik Hangleiter", "affiliations": [ "University of California Berkeley Simons Institute for the Theory of Computing" ] }, { "name": "Ryan Sweke", "affiliations": [ "Free University of Berlin" ] }, { "name": "J. Eisert", "affiliations": [ "Freie Universitat Berlin" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6fe6", "url": "https://doi.org/10.1088/2058-9565/ae6fe6", "title": "Topology-Aware Block Coordinate Descent for Qubit Frequency Allocation of Superconducting Quantum Processors", "abstract": "Abstract Pre-execution calibration is a major bottleneck for operating superconducting quantum processors, and qubit frequency allocation is especially challenging due to crosstalk-coupled objectives. We establish that the widely-used Snake optimizer is mathematically equivalent to Block Coordinate Descent (BCD), providing a rigorous theoretical foundation for this strategy for qubit frequency allocation. Building on this formalization, we present a topology-aware block ordering obtained by casting order selection as a Sequence-Dependent Traveling Salesman Problem (SD-TSP) and solving it efficiently with a nearest-neighbor heuristic. The SD-TSP cost reflects how a given block choice expands the reduced-circuit footprint required to evaluate the block-local objective, enabling orders that minimize per-epoch evaluation time. Under standard locality-type assumptions, such as local crosstalk or bounded interaction degree, the method achieves linear complexity in qubit count per epoch while maintaining comparable optimization performance. We formalize the calibration objective, clarify when reduced experiments are equivalent or approximate to the full objective, and analyze convergence of the resulting inexact BCD with noisy measurements. Simulations based on a physics-motivated error simulator show that the proposed BCD-NNA ordering attains comparable optimization accuracy at markedly lower computational cost than graph-based heuristics (BFS, DFS) and random orders, while also achieving optimization quality comparable to a genetic algorithm (GA) baseline. This method is robust to noisy objective-function evaluations and tolerant to moderate nonlocal crosstalk mismatch. These results provide a scalable, implementation-ready workflow for frequency calibration in near-term superconducting processors and, more broadly, for locality-structured calibration tasks in future scalable architectures.", "authors": [ { "name": "Zheng Zhao", "affiliations": [ "Tsinghua University" ] }, { "name": "Weifeng Zhuang", "affiliations": [ "Beijing Academy of Quantum Information Sciences" ] }, { "name": "Yanwu Gu", "affiliations": [ "Beijing Academy of Quantum Information Sciences" ] }, { "name": "Peng Qian", "affiliations": [ "Beijing Academy of Quantum Information Sciences" ] }, { "name": "Xiao Xiao", "affiliations": [ "Beijing Academy of Quantum Information Sciences" ] }, { "name": "Liu Dong", "affiliations": [ "Tsinghua University" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6fe2", "url": "https://doi.org/10.1088/2058-9565/ae6fe2", "title": "Non-perturbative topological gadgets for many-body coupling", "abstract": "Abstract Continuous-time quantum hardware implementations generally lack the native capability to implement high-order terms that would facilitate efficient compilation of quantum algorithms. This limitation has, in part, motivated the development of perturbative gadgets---multi-qubit constructions used to effect a desired Hamiltonian using engineered low-energy subspaces of a larger system constructed using simpler, usually two-body, primitives. In this work, we demonstrate how a class of non-perturbative gadgets can produce high-order multi-body interactions by taking advantage of the odd-even properties of topological defect subspaces. &#xD;The simplest example uses domain-wall defects in an effective Ising spin chain with linear connectivity and three-body couplings, alongside three- or five-body driving terms depending on the intended use. We demonstrate a version of a gadget which can perform an encoded bit-flip operation on a minor embedding chain, an important task to mitigate the limitations of quasi-two-dimensional (also sometimes called quasi-planar) topology. Although this will be the main focus of the paper due to conceptual simplicity, there exist systems constructed with only two-body couplings where the boundaries determine whether there are an odd or even number of defects, namely ice-like systems which may yield more complex gadget-like constructions.", "authors": [ { "name": "David Headley", "affiliations": [ "Newcastle University" ] }, { "name": "Nicholas Chancellor", "affiliations": [ "Newcastle University" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae5fcc", "url": "https://doi.org/10.1088/2058-9565/ae5fcc", "title": "A cryogenic muon tagging system based on kinetic inductance detectors for superconducting quantum processors", "abstract": "Abstract Ionizing radiation has emerged as a potential limiting factor for superconducting quantum processors, inducing quasiparticle bursts and correlated errors that challenge fault-tolerant operation. Atmospheric muons are particularly problematic due to their high energy and penetration power, making passive shielding ineffective. Therefore, monitoring the real-time muon flux is crucial to guide the development of alternative error-correction or mitigation strategies. We present the design, simulation, and first operation of a cryogenic muon-tagging system based on kinetic inductance detectors (KIDs), developed as a stand-alone cryogenic particle-tagging module for superconducting quantum processors. The system consists of two KIDs arranged in a vertical stack and operated at ∼20 mK. Monte Carlo simulations based on Geant4 guided the prototype design and provided reference expectations for muon-tagging efficiency and accidental coincidences due to ambient γ -rays. We observed a muon-induced coincidence rate among the top and bottom detectors of (192 ± 9) × 10 − 3 events s −1 , in excellent agreement with the Monte Carlo prediction. The prototype achieves a muon-tagging efficiency of about 90% with negligible dead time. These results demonstrate the feasibility of operating a muon-tagging system at millikelvin temperatures and represent a key step toward the integration of cryogenic veto systems with multi-qubit chips to mitigate muon-induced errors.", "authors": [ { "name": "Ambra Mariani", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Laura Cardani", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Mustafa Bal", "affiliations": [ "Fermi National Accelerator Laboratory" ] }, { "name": "Nicola Casali", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Ivan Colantoni", "affiliations": [ "INFN - Sezione di Roma", "Consiglio Nazionale delle Ricerche" ] }, { "name": "Angelo Cruciani", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Giorgio Del Castello", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Daniele Delicato", "affiliations": [ "INFN - Sezione di Roma", "Sapienza Università di Roma", "Institut Néel" ] }, { "name": "Francesco De Dominicis", "affiliations": [ "Gran Sasso Science Institute", "INFN - Laboratori Nazionali del Gran Sasso" ] }, { "name": "Matteo del Gallo Raccagiovine", "affiliations": [ "INFN - Sezione di Roma", "Sapienza Università di Roma" ] }, { "name": "Matteo Folcarelli", "affiliations": [ "INFN - Sezione di Roma", "Sapienza Università di Roma" ] }, { "name": "Sabrina Garattoni", "affiliations": [ "Fermi National Accelerator Laboratory" ] }, { "name": "Anna Grassellino", "affiliations": [ "Fermi National Accelerator Laboratory" ] }, { "name": "Mehmood Khan Yasir Raja", "affiliations": [ "Gran Sasso Science Institute", "INFN - Laboratori Nazionali del Gran Sasso" ] }, { "name": "Valerio Pettinacci", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Alberto Ressa", "affiliations": [ "INFN - Sezione di Roma" ] }, { "name": "Tanay Roy", "affiliations": [ "Fermi National Accelerator Laboratory" ] }, { "name": "Marco Vignati", "affiliations": [ "INFN - Sezione di Roma", "Sapienza Università di Roma" ] }, { "name": "David van Zanten", "affiliations": [ "Fermi National Accelerator Laboratory" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "error-correction", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6fe4", "url": "https://doi.org/10.1088/2058-9565/ae6fe4", "title": "Fast Native Three-Qubit Gates and Fault-Tolerant Quantum Error Correction with Trapped Rydberg Ions", "abstract": "Abstract Trapped ions are one of the most promising quantum-information-processing platforms, yet conventional entangling gates mediated by collective motion remain slow and difficult to scale. Exciting trapped ions to high-lying electronic Rydberg states provides a promising route to overcome these limitations by enabling strong, long-range dipole - dipole interactions that support much faster multi-qubit operations. Here, we introduce the first scheme for implementing a native controlled-controlled-Z gate with microwave-dressed Rydberg ions by optimizing a single-pulse protocol that accounts for the finite Rydberg-state lifetime. Under realistic conditions, the resulting gate achieves fidelities above 97 % with execution times of about 2 µs at cryogenic temperatures, making it more than 8 µs faster than standard decompositions into one- and two-qubit gates. To explore the potential of trapped Rydberg ions for fault-tolerant quantum error correction, and to illustrate the utility of three-qubit Rydberg-ion gates in this context, we develop and analyze a proposal for fault-tolerant, measurement-free quantum error correction using the nine-qubit Bacon - Shor code. Our simulations confirm that quantum error correction can be performed in a fully fault-tolerant manner on a linear Rydberg-ion chain despite its limited qubit connectivity. These results establish native multi-qubit Rydberg-ion gates as a valuable resource for fast, high-fidelity quantum computing and highlight their potential for fault-tolerant quantum error correction.", "authors": [ { "name": "Katrin Bolsmann", "affiliations": [ "Forschungszentrum Jülich Peter Grünberg Institut" ] }, { "name": "Thiago L M Guedes", "affiliations": [ "Forschungszentrum Jülich Peter Grünberg Institut" ] }, { "name": "Weibin Li", "affiliations": [ "University of Nottingham" ] }, { "name": "Joseph William Peter Wilkinson", "affiliations": [ "Eberhard-Karls-Universität Tübingen Institut für Theoretische Physik" ] }, { "name": "Igor Lesanovsky", "affiliations": [ "Eberhard-Karls-Universität Tübingen Institut für Theoretische Physik" ] }, { "name": "Markus Müller", "affiliations": [ "Forschungszentrum Jülich Peter Grünberg Institut" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "hardware", "error-correction", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6fe5", "url": "https://doi.org/10.1088/2058-9565/ae6fe5", "title": "Optimal control of a dissipative micromaser quantum battery in the ultrastrong coupling regime", "abstract": "Abstract We investigate the open-system dynamics of a micromaser quantum battery in the ultrastrong-coupling (USC) regime. The battery consists of a quantized harmonic mode sequentially interacting, via the Rabi Hamiltonian, with a stream of qubits acting as chargers. USC enhances the charging speed but also induces unbounded energy growth and highly mixed cavity states. Dissipation suppresses this behavior, driving the system to a steady state with finite energy and ergotropy. Using optimal control theory, we show that the interplay between ultrastrong coupling and dissipation enhances both charging performance and long-term stability against losses.", "authors": [ { "name": "Maristella Crotti", "affiliations": [ "Università degli Studi dell'Insubria" ] }, { "name": "Luca Razzoli", "affiliations": [ "University of Pavia" ] }, { "name": "Luigi Giannelli", "affiliations": [ "University of Catania" ] }, { "name": "Giuseppe Antonio Falci", "affiliations": [ "University of Catania" ] }, { "name": "Giuliano Benenti", "affiliations": [ "Università degli Studi dell'Insubria" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae65d8", "url": "https://doi.org/10.1088/2058-9565/ae65d8", "title": "Towards solving industrial integer linear programs with decoded quantum interferometry", "abstract": "Abstract Optimization via decoded quantum interferometry (DQI) has recently gained a great deal of attention as a promising avenue for solving optimization problems using quantum computers. In this paper, we apply DQI to an industrial optimization problem in the automotive industry: the vehicle option-package pricing problem. Our main contributions are (1) formulating the industrial problem as an integer linear program (ILP), (2) converting the ILP into instances of max-XORSAT, and (3) developing a detailed quantum circuit implementation for belief propagation, a heuristic algorithm for decoding low density parity-check codes. Thus, we provide a full implementation of the DQI algorithm using Belief Propagation, which can be applied to any industrially relevant ILP by first transforming it into a max-XORSAT instance. We also evaluate the effectiveness of our implementation by benchmarking it against both Gurobi and a random sampling baseline.", "authors": [ { "name": "Francesc Sabater", "affiliations": [ "Physics Department", "BMW Group" ] }, { "name": "Ouns El Harzli", "affiliations": [ "Boston Consulting Group and BCG X AI Science Institute" ] }, { "name": "Geert-Jan Besjes", "affiliations": [ "Boston Consulting Group and BCG X AI Science Institute" ] }, { "name": "Marvin Erdmann", "affiliations": [ "BMW Group" ] }, { "name": "Johannes Klepsch", "affiliations": [ "BMW Group" ] }, { "name": "Jonas Hiltrop", "affiliations": [ "Boston Consulting Group and BCG X AI Science Institute" ] }, { "name": "Jean-François Bobier", "affiliations": [ "Boston Consulting Group and BCG X AI Science Institute" ] }, { "name": "Yudong Cao", "affiliations": [ "Boston Consulting Group and BCG X AI Science Institute" ] }, { "name": "Carlos A Riofrío", "affiliations": [ "BMW Group" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae65d7", "url": "https://doi.org/10.1088/2058-9565/ae65d7", "title": "Separate and efficient characterization of state-preparation and measurement errors using single-qubit operations", "abstract": "Abstract In many platforms, errors from state-preparation and measurement (SPAM) dominate over single-qubit gate errors. To inform further hardware improvements and the development of more effective SPAM mitigation strategies, it is necessary to separately characterize the error contributions from SP and measurement (M). Here, we show how to construct a protocol that can efficiently and separately characterize the SP and M error parameters by using only high-fidelity single-qubit gates and repeated single-qubit measurements without reset. The measurements are assumed to be non-destructive and M errors are taken to be (spatially and temporally) uncorrelated and classical. Notably, the circuit depth of the protocol is independent of system size, and the target parameters may be characterized to a precision that is only limited by the number of experimental repetitions. We employ our protocol for the parallel characterization of SPAM errors on multiple qubits in the IBM quantum platform devices, where we find SP infidelities up to 6.57% and readout assignment errors up to 19.1%. Using numerical simulations, we also demonstrate how measurement-error mitigation that does not properly account for SP errors generally leads to a biased estimate of measured observable expectation values.", "authors": [ { "name": "Muhammad Qasim Khan", "affiliations": [ "Dartmouth College" ] }, { "name": "Leigh M Norris", "affiliations": [ "Johns Hopkins Applied Physics Laboratory" ] }, { "name": "Lorenza Viola", "affiliations": [ "Dartmouth College" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6e6a", "url": "https://doi.org/10.1088/2058-9565/ae6e6a", "title": "Towards a quantum algorithm deciding the separability problem", "abstract": "Abstract Determining whether an unknown quantum state is entangled can be approached through quantum tomography and related algorithms. However, these methods are generally inefficient due to the NP-hardness of the problem. An alternative strategy is to treat it as a decision (or estimation) problem with a quantum data structure [Phys. Rev. Lett. 89, 127902 (2002)]. Over the years, significant progress has been made: the two-qubit case is now fully understood, but for higher-dimensional systems only entanglement detection via negativity has been established. In this work, we propose schemes for measuring upper bounds on bipartite biconcurrence and concurrence, expressed as functions of a fixed (but arbitrary) unitary operation acting on a Hilbert space that is quadratically larger than the original state space. Independently, we provide a scheme for measuring a lower bound for concurrence. In the case of the states proportional to the projectors the schemes are getting significantly simpler and the upper bound on the biconcurrence, as well as the lower bound on the concurrence, become exact (up to experimental and numerical errors). This framework opens the door to tackling the separability problem using methods inspired by the variational quantum eigensolver.", "authors": [ { "name": "Paweł Horodecki", "affiliations": [ "University of Gdańsk" ] }, { "name": "Michał Banacki", "affiliations": [ "University of Gdańsk" ] }, { "name": "Michał Eckstein", "affiliations": [ "Jagiellonian University" ] }, { "name": "Artur Ekert", "affiliations": [ "University of Oxford" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6a1a", "url": "https://doi.org/10.1088/2058-9565/ae6a1a", "title": "Absence of dissipation-free topological edge states in quadratic open fermions", "abstract": "Abstract We prove a no-go theorem: generic quadratic open fermionic systems governed by Lindblad master equations do not host dissipation-free topological edge states protected by the dissipation gap. By analogy with topological insulators and superconductors, we map the Lindblad generator to a first- quantized non-Hermitian matrix representation that plays the role of a band Hamiltonian. Edge modes of this matrix with vanishing real part are exactly dissipation-free. We show that this matrix is always adiabatically deformable, through a symmetry-preserving path, to a topologically trivial Hermitian matrix. Hence no symmetry-protected, dissipation-free edge modes exist in quadratic open fermions. Our results apply to generic quadratic fermionic Lindbladians and require only a gapped bulk and a bounded spectrum. They establish a clear boundary for robust topological phenomena in open fermionic systems.", "authors": [ { "name": "Liang Mao", "affiliations": [ "Tsinghua University", "California Institute of Technology" ] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae5fcd", "url": "https://doi.org/10.1088/2058-9565/ae5fcd", "title": "Quantum measurement retrodiction and entropic uncertainty relations *", "abstract": "Abstract We study quantum measurement retrodiction via the principle of minimum change. For general quantum measurements that are described by quantum-to-classical channels, we show that a broad family of standard quantum divergences selects the same retrodictive update, yielding a unique and divergence-independent quantum Bayesian inverse for any POVM and prior state. Using this update, we construct a symmetric joint distribution for pairs of POVMs and introduce the mutual retrodictability , which quantifies how well the two POVMs can retrodict each other’s outcome distributions under this update. We also derive a general upper bound on this quantity, which depends only on the prior and holds for all measurements. This framework leads to two retrodictive entropic uncertainty relations , expressed directly in terms of the prior and the POVMs, yet valid independently of any retrodictive interpretation and fully compatible with conventional operational formulations. One of these relations links entropic uncertainty, approximate recoverability, and the thermodynamics of measurement through the Groenewold - Ozawa information gain. Finally, numerical benchmarks show that the resulting bounds are consistently tighter than existing entropic uncertainty relations across broad classes of measurements and states.", "authors": [ { "name": "Jiaxi Kuang", "affiliations": [] }, { "name": "Kensei Torii", "affiliations": [] }, { "name": "Francesco Buscemi", "affiliations": [] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-11", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae6bb1", "url": "https://doi.org/10.1088/2058-9565/ae6bb1", "title": "Trading symmetry for Hilbert-space dimension in Bell-inequality violation", "abstract": "Abstract In quantum information, asymmetry, i.e., the lack of symmetry, is a resource allowing one to accomplish certain tasks that are otherwise impossible. Similarly, in a Bell test using any given Bell inequality, the maximum violation achievable using quantum strategies respecting or disregarding a certain symmetry can be different. In this work, we focus on the symmetry involved in the exchange of parties and explore when we have to trade this symmetry for a lower-dimensional quantum strategy in achieving the maximal violation of given Bell inequalities. For the family of symmetric Collins-Gisin-Linden-Massar-Popescu inequalities, we provide evidence showing that there is no such trade-off. However, for several other Bell inequalities with a small number of dichotomic measurement settings, we show that symmetric quantum strategies in the minimal Hilbert space dimension can only lead to a suboptimal Bell violation. In other words, there exist symmetric Bell inequalities that can only be maximally violated by asymmetric quantum strategies of minimal dimension. In contrast, one can also find examples of asymmetric Bell inequalities that are maximally violated by symmetric correlations. The implications of these findings on the geometry of the set of quantum correlations and the possibility of performing self-testing therefrom are briefly discussed.", "authors": [ { "name": "Hsin-Yu Hsu", "affiliations": [] }, { "name": "Gelo Noel Tabia", "affiliations": [] }, { "name": "Kai-Siang Chen", "affiliations": [] }, { "name": "Mu-En Liu", "affiliations": [] }, { "name": "Tamás Vértesi", "affiliations": [] }, { "name": "Nicolas Brunner", "affiliations": [] }, { "name": "Yeong-Cherng Liang", "affiliations": [] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-11", "source": "crossref" }, { "doi": "10.1088/2058-9565/ae5fc9", "url": "https://doi.org/10.1088/2058-9565/ae5fc9", "title": "Fully convolutional 3D neural network decoders for surface codes with syndrome circuit noise", "abstract": "Abstract Artificial neural networks (ANNs) are a promising approach to the decoding problem of quantum error correction (QEC), but have observed consistent difficulty when generalising performance to larger QEC codes. Recent scalability-focused approaches have split the decoding workload by using local ANNs to perform initial syndrome processing and leaving final processing to a global residual decoder. We investigated ANN surface code decoding under a scheme exploiting the spatiotemporal structure of syndrome data. In particular, we present a vectorised method for surface code data simulation and benchmark decoding performance when such data defines a multi-label classification problem and generative modelling problem for rotated surface codes with circuit noise after each gate and idle timestep. Performance was found to generalise to rotated surface codes of sizes up to d = 97, with depolarisation parameter thresholds of up to 0.7% achieved, competitive with minimum weight perfect matching (MWPM). Improved timings, compared with MWPM alone, were found starting at code distances of d = 33 and d = 89 under noise models above and below threshold respectively. These results suggest promising prospects for ANN-based frameworks for surface code decoding with performance sufficient to support the demands expected from fault-tolerant resource estimates.", "authors": [ { "name": "Spiro Gicev", "affiliations": [] }, { "name": "Lloyd C L Hollenberg", "affiliations": [] }, { "name": "Muhammad Usman", "affiliations": [] } ], "journal": { "id": "qst", "title": "Quantum Science and Technology", "issn": [ "2058-9565" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "hardware", "algorithms", "sensing", "communication" ], "india_hint": false, "published": "2026-05-07", "source": "crossref" }, { "doi": "10.1007/s11128-026-05198-x", "url": "https://doi.org/10.1007/s11128-026-05198-x", "title": "Characterizing noise effects on multipartite entanglement via phase-space visualization", "abstract": "", "authors": [ { "name": "B. Nithya Priya", "affiliations": [] }, { "name": "S. Saravana Veni", "affiliations": [] }, { "name": "Araceli Venegas-Gomez", "affiliations": [] }, { "name": "Ria Rushin Joseph", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1007/s11128-026-05223-z", "url": "https://doi.org/10.1007/s11128-026-05223-z", "title": "Dynamical geometric signatures of quantum channels: a geometric framework for analysing channel-induced dynamics", "abstract": "", "authors": [ { "name": "Roberto Casado-Vara", "affiliations": [] }, { "name": "Juan M. Corchado", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1007/s11128-026-05202-4", "url": "https://doi.org/10.1007/s11128-026-05202-4", "title": "Investigation of non-Markovian dynamics due to parasitic couplings in a cQED system", "abstract": "", "authors": [ { "name": "Guru Aravind", "affiliations": [] }, { "name": "Baladitya Suri", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1007/s11128-026-05221-1", "url": "https://doi.org/10.1007/s11128-026-05221-1", "title": "Magnon-squeezing-induced nonreciprocal quantum coherence in a cavity magnomechanical system", "abstract": "", "authors": [ { "name": "Abdelkader Hidki", "affiliations": [] }, { "name": "Amjad Sohail", "affiliations": [] }, { "name": "Tesfay Gebremariam Tesfahannes", "affiliations": [] }, { "name": "Mulugeta Tadesse Bedore", "affiliations": [] }, { "name": "Mostafa Nassik", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1007/s11128-026-05219-9", "url": "https://doi.org/10.1007/s11128-026-05219-9", "title": "On the distinction between distinguishability of states and witness of non-Markovianity of dynamical maps", "abstract": "", "authors": [ { "name": "Vijay Pathak", "affiliations": [] }, { "name": "R. Srikanth", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-25", "source": "crossref" }, { "doi": "10.1007/s11128-026-05213-1", "url": "https://doi.org/10.1007/s11128-026-05213-1", "title": "Sharing a classical string utilizing quantum techniques", "abstract": "", "authors": [ { "name": "E. S. Elkhouly", "affiliations": [] }, { "name": "M. Y. Abd-Rabbou", "affiliations": [] }, { "name": "S. I. Ali", "affiliations": [] }, { "name": "N. Metwally", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-25", "source": "crossref" }, { "doi": "10.1007/s11128-026-05210-4", "url": "https://doi.org/10.1007/s11128-026-05210-4", "title": "Hierarchical multi-secret quantum secret sharing via quantum Fourier transform and linear homogeneous recurrence relations", "abstract": "", "authors": [ { "name": "Chaonan Wang", "affiliations": [] }, { "name": "Peng Guo", "affiliations": [] }, { "name": "Ningning Xu", "affiliations": [] }, { "name": "Haocheng Kan", "affiliations": [] }, { "name": "Hongfeng Zhu", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-25", "source": "crossref" }, { "doi": "10.1007/s11128-026-05211-3", "url": "https://doi.org/10.1007/s11128-026-05211-3", "title": "Construction and depth optimization of quantum controlled adder", "abstract": "", "authors": [ { "name": "Chanho Jeon", "affiliations": [] }, { "name": "Donghoe Heo", "affiliations": [] }, { "name": "Hyojun Shin", "affiliations": [] }, { "name": "Seokhie Hong", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-25", "source": "crossref" }, { "doi": "10.1007/s11128-026-05215-z", "url": "https://doi.org/10.1007/s11128-026-05215-z", "title": "Performance assessment of fiber-optic railway infrastructure QKD testbed by upper bounded deviation method", "abstract": "Abstract In this paper, we present an inter-city Quantum Key Distribution network testbed spanning tens of kilometers within the Central Bohemian Region. The testbed operates under harsh conditions, leveraging a robust fiber-optic infrastructure. Specifically, the quantum key distribution devices using two different key generating protocols underwent rigorous testing during winter months. The experiment assesses the performance and stability of quantum key distribution devices in a communication channel under real-world conditions. A quantum channel utilized for this experiment was established along the railway tracks provided by the Czech Railway Administration. Our findings contribute to advancing secure quantum communication networks by addressing key rate stability challenges. An upper bound for relative secret key rate deviation is introduced to support link design. Moreover, it has been experimentally verified that the measured key rate demonstrated robust stability despite its quantum nature and strong influence from outside conditions.", "authors": [ { "name": "Jiří Weiss", "affiliations": [] }, { "name": "Michal Lucki", "affiliations": [] }, { "name": "Aurél Gábris", "affiliations": [] }, { "name": "Kateřina Helisová", "affiliations": [] }, { "name": "Leoš Boháč", "affiliations": [] }, { "name": "Jan Bouda", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1007/s11128-026-05212-2", "url": "https://doi.org/10.1007/s11128-026-05212-2", "title": "Quantum anti-eavesdropping strategies: phase modulation in secure quantum communications", "abstract": "", "authors": [ { "name": "Asgar Hosseinnezhad", "affiliations": [] }, { "name": "Hadi Sabri", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1007/s11128-026-05186-1", "url": "https://doi.org/10.1007/s11128-026-05186-1", "title": "Quantum generative adversarial networks: a comprehensive survey of theories, applications, and challenges in the NISQ era", "abstract": "", "authors": [ { "name": "Han Qi", "affiliations": [] }, { "name": "Yihan Xu", "affiliations": [] }, { "name": "Hao Wang", "affiliations": [] }, { "name": "Abdullah Gani", "affiliations": [] }, { "name": "Lip Yee Por", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1007/s11128-026-05194-1", "url": "https://doi.org/10.1007/s11128-026-05194-1", "title": "Commuting embeddings for parallel strategies in non-local games", "abstract": "Abstract Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.", "authors": [ { "name": "Sarah Chehade", "affiliations": [] }, { "name": "Andrea Delgado", "affiliations": [] }, { "name": "Elaine Wong", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1007/s11128-026-05200-6", "url": "https://doi.org/10.1007/s11128-026-05200-6", "title": "Correction: A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness", "abstract": "", "authors": [ { "name": "Vaisakh Mannalath", "affiliations": [] }, { "name": "Sandeep Mishra", "affiliations": [] }, { "name": "Anirban Pathak", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1007/s11128-026-05205-1", "url": "https://doi.org/10.1007/s11128-026-05205-1", "title": "Noise-resilient spatial search with lackadaisical quantum walks", "abstract": "Abstract Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence affects the performance of LQW-based search on a two-dimensional toroidal grid. We show through numerical simulations that while decoherence drives the loopless walk toward a uniform distribution and eliminates its search capability, the inclusion of self-loops significantly mitigates this effect. In particular, even under noise, the marked vertex remains identifiable with probability well above uniform, demonstrating that self-loops enhance the robustness of LQWs in realistic scenarios. These findings extend the known advantages of LQWs from the noiseless setting to noisy environments, consolidating self-loops as a valuable resource for designing resilient quantum search algorithms.", "authors": [ { "name": "Gabriel Mauricio Oswald Vieira", "affiliations": [] }, { "name": "Nelson Maculan", "affiliations": [] }, { "name": "Franklin de Lima Marquezino", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1007/s11128-026-05183-4", "url": "https://doi.org/10.1007/s11128-026-05183-4", "title": "Verifiable dynamic multiparty quantum secret sharing protocol based on orthogonal product states", "abstract": "", "authors": [ { "name": "Hang Guo", "affiliations": [] }, { "name": "Shuai Li", "affiliations": [] }, { "name": "Jian Li", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05161-w", "url": "https://doi.org/10.1007/s11128-026-05161-w", "title": "Agentic AI-enhanced quantum computing for cybersecurity: a new horizon in internet defense", "abstract": "Abstract The integration of quantum computing and agentic artificial intelligence presents a transformative paradigm for advancing cybersecurity frameworks. Quantum algorithms enable accelerated computation for complex tasks such as encrypted traffic analysis and zero-day detection, while agentic intelligence - driven by autonomous, goal-oriented reasoning - provides adaptive and resilient responses against evolving threats. In this work, we propose a hybrid agentic quantum-AI cybersecurity framework that unites quantum machine learning with agent-based decision-making to enhance real-time intrusion detection and automated defense. The framework was evaluated on three benchmark and modern datasets: NSL-KDD, CIC-IDS2017, and CSE-CIC-IDS2018. Results demonstrate that the proposed system achieves up to 42% improvement in detection accuracy and 55% reduction in threat response latency compared to conventional baselines including CNN, Random Forest, Transformer, and A3C models. Quantum modules were implemented and simulated using Qiskit and PennyLane, with scalability considerations discussed for near-term quantum devices. Beyond accuracy, the framework also addresses interpretability, policy-driven response thresholds. This work contributes a novel, rigorous foundation for quantum-accelerated, agentic cybersecurity, balancing proactive defense with adaptive mitigation for emerging threats.", "authors": [ { "name": "Kailash Shaw", "affiliations": [] }, { "name": "Sashikala Mishra", "affiliations": [] }, { "name": "Ivan Zelinka", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05178-1", "url": "https://doi.org/10.1007/s11128-026-05178-1", "title": "Quantum metrology of accelerated atoms in spacetime with reflective boundaries", "abstract": "", "authors": [ { "name": "K. Berrada", "affiliations": [] }, { "name": "H. Eleuch", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05189-y", "url": "https://doi.org/10.1007/s11128-026-05189-y", "title": "Quantum spatial best-arm identification on a complete bipartite graph", "abstract": "", "authors": [ { "name": "Tomoki Yamagami", "affiliations": [] }, { "name": "Etsuo Segawa", "affiliations": [] }, { "name": "Takatomo Mihana", "affiliations": [] }, { "name": "André Röhm", "affiliations": [] }, { "name": "Atsushi Uchida", "affiliations": [] }, { "name": "Ryoichi Horisaki", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05204-2", "url": "https://doi.org/10.1007/s11128-026-05204-2", "title": "Fractional graph expanders and network dynamics: spectral properties and diffusion with applications to quantum cryptography", "abstract": "", "authors": [ { "name": "Rami Ahmad El-Nabulsi", "affiliations": [] }, { "name": "Waranont Anukool", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05201-5", "url": "https://doi.org/10.1007/s11128-026-05201-5", "title": "Analysis of quantum primitives for quantum utility", "abstract": "", "authors": [ { "name": "Tae-Won Kim", "affiliations": [] }, { "name": "Byung-Soo Choi", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05203-3", "url": "https://doi.org/10.1007/s11128-026-05203-3", "title": "Coined quantum walks on complex networks for quantum computers", "abstract": "", "authors": [ { "name": "Rei Sato", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05191-4", "url": "https://doi.org/10.1007/s11128-026-05191-4", "title": "A new method of constructing AEAQEC codes via $$\\rho $$-OD MP codes", "abstract": "", "authors": [ { "name": "Jie Liu", "affiliations": [] }, { "name": "Peng Hu", "affiliations": [] }, { "name": "Xiusheng Liu", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05208-y", "url": "https://doi.org/10.1007/s11128-026-05208-y", "title": "Construction of channels which in every dimension anti-degrade the depolarizing channel", "abstract": "", "authors": [ { "name": "Shayan Roofeh", "affiliations": [] }, { "name": "Vahid Karimipour", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05195-0", "url": "https://doi.org/10.1007/s11128-026-05195-0", "title": "Native quantum games from interacting discrete-time quantum walks", "abstract": "", "authors": [ { "name": "Rashid Ahmad", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1007/s11128-026-05187-0", "url": "https://doi.org/10.1007/s11128-026-05187-0", "title": "Probing the LGI, the WLGI, the entropic LGI, the NSIT condition and the NCGD for large spin system under the coarsening measurement", "abstract": "", "authors": [ { "name": "Qian Li", "affiliations": [] }, { "name": "Yuxia Zhang", "affiliations": [] }, { "name": "Zhiyuan He", "affiliations": [] }, { "name": "Tianhui Qiu", "affiliations": [] }, { "name": "Shengguang Liu", "affiliations": [] } ], "journal": { "id": "qip", "title": "Quantum Information Processing", "issn": [ "1570-0755", "1573-1332" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "algorithms", "foundations", "qml" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1145/3802819", "url": "https://doi.org/10.1145/3802819", "title": "The Power of Shallow-depth Toffoli and Qudit Quantum Circuits", "abstract": "The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by quantum shallow circuits but require more computational resources classically. Our first contribution in this work is to prove new separations between classical and quantum constant-depth circuits. Firstly, we show a separation between constant-depth quantum circuits with quantum advice \\(\\mathsf {QNC}^0/\\mathsf {qpoly} \\) , and \\(\\mathsf {AC}^0[p] \\) , which is the class of classical constant-depth circuits with unbounded-fan in and \\(\\mathsf {MOD}_{p} \\) gates. Additionally, we show a separation between \\(\\mathsf {QAC}^0 \\) , the circuit class containing Toffoli gates with unbounded control, and \\(\\mathsf {AC}^0[p] \\) , when \\(\\mathsf {QAC}^0 \\) is augmented with additional mid-circuit measurements and classical fanout. This establishes the first such separation for a shallow-depth quantum class that does not involve quantum fanout gates, while relying solely on finite quantum gate sets. Equivalently, this yields a separation between \\(\\mathsf {AC}^0[p] \\) and \\([\\mathsf {QNC}^0, \\mathsf {AC}^0]^2 \\) , i.e., shallow quantum circuits interleaved with simple classical computation. Secondly, we consider \\(\\mathsf {QNC}^0 \\) circuits with infinite-size gate sets. We show that these circuits, along with quantum prime modular gates or classical prime modular gates in combination with classical fanout, can implement threshold gates, showing that \\(\\mathsf {QNC}^0[p]=\\mathsf {QTC}^0 \\) . Finally, we also show that in the infinite-size gate set case, these quantum circuit classes for higher-dimensional Hilbert spaces do not offer any advantage to standard qubit implementations.", "authors": [ { "name": "Alex Grilo", "affiliations": [ "LIP6, Sorbonne Universite" ] }, { "name": "Elham Kashefi", "affiliations": [ "School of Informatics, The University of Edinburgh", "LIP6, Sorbonne Universite Campus Pierre et Marie Curie" ] }, { "name": "Damian Markham", "affiliations": [ "LIP6, Sorbonne Universite" ] }, { "name": "Michael Oliveira", "affiliations": [ "LIP6, Sorbonne Universite", "QLOC, International Iberian Nanotechnology Laboratory" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1145/3815787", "url": "https://doi.org/10.1145/3815787", "title": "Genetic Synthesis of Compact Quaternary Reversible Comparators for Quantum Computing", "abstract": "Reversible logic is fundamental to quantum circuit design, as quantum operations are inherently information-preserving and reversible. While most quantum synthesis methods rely on binary logic, quaternary reversible computing can increase data density, reduce circuit width, and potentially lead to more efficient realizations. We introduce a genetic-algorithm-based approach for designing compact quaternary reversible comparator circuits, which are important components in quantum architectures. This technique utilizes a gate library based on extended Shift and Muthukrishnan - Stroud gates tailored to quaternary systems. Chromosomes encode sequences of quaternary gates, and evolutionary operators search for configurations with minimal quantum cost. Although demonstrated on comparator circuits, the approach applies to any quaternary reversible circuit defined by its truth table. The synthesis process occurs in two phases: candidate circuits first evolve toward correct behavior; then correct circuits are optimized to obtain compact implementations. We evaluate the approach on comparators performing lower-than, greater-than, and equality operations, as well as on a 1-qudit full comparator. The method achieves average quantum cost improvements of about 30% for restoring and 58% for non-restoring configurations compared to existing designs. These reductions support more efficient and more error-resilient quantum circuits, showing that this approach is a strong candidate for quaternary quantum systems.", "authors": [ { "name": "Asma Taheri Monfared", "affiliations": [ "University of Bergamo" ] }, { "name": "Andrea Bombarda", "affiliations": [ "University of Bergamo" ] }, { "name": "Angelo Gargantini", "affiliations": [ "University of Bergamo" ] }, { "name": "Valentina Ciriani", "affiliations": [ "Department of Computer Science, Università degli Studi di Milano" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.1145/3815778", "url": "https://doi.org/10.1145/3815778", "title": "Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm", "abstract": "Quantum Approximate Optimization Algorithm (QAOA) is a promising quantum heuristic with empirical evidence of speedup over classical state-of-the-art for some problems. QAOA uses a parameterized circuit with p layers, where higher p yields better solutions, but requires optimizing 2 p independent parameters, which is challenging at large p . We present an iterative interpolation method that exploits the smoothness of optimal parameter schedules by expressing them in a basis of orthogonal functions, generalizing the work of Zhou et al. By optimizing a small number of basis coefficients and iteratively increasing both circuit depth and coefficient count until convergence, our method constructs high-quality schedules for large p . We provide theoretical justification using Jackson’s theorem and Lipschitz continuity to bound the required number of basis coefficients for a given accuracy. Our approach achieves better performance with fewer optimization steps than existing methods across three benchmark problems: the Sherrington-Kirkpatrick (SK) model, portfolio optimization, and Low Autocorrelation Binary Sequences (LABS). For the largest LABS instance, we achieve near-optimal merit factors with schedules exceeding 1000 layers, an order of magnitude beyond previous methods. Additionally, we observe that a mild growth in QAOA depth suffices to solve the SK model exactly, a result of independent theoretical interest.", "authors": [ { "name": "Anuj Apte", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Shree Hari Sureshbabu", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Ruslan Shaydulin", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Sami Boulebnane", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Zichang He", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Dylan Herman", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "James Sud", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Marco Pistoia", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.1145/3815786", "url": "https://doi.org/10.1145/3815786", "title": "Utility-scale Experimental Quantum Computation with Hardware Efficient Ansätze and Calibrated Hamiltonian", "abstract": "Variational quantum algorithms often adapt the ansätze (ansatz) to the target Hamiltonian, leading to deep or hardware-incompatible circuits. In this work we demonstrate an opposite approach: choosing a hardware-efficient CNOT-ladder ansatz and calibrating the Hamiltonian to compensate for its expressibility to solve ground-state energy problem of 100+ site lattice on real quantum computer. This ansatz-calibrated Hamiltonian framework enables two key advantages: (1) it allows restructuring the algorithm into smaller sub-problems which can independently solved off-line classically, leaving quantum computer tasked with recombining partial solutions into full state-vector with fewer parameters to optimize and (2) it leverages circuit-specific error statistics to de-noise observable readouts with nominal noise-mitigation overhead. We simulate the spin-1/2 antiferromagnetic Heisenberg model over a 103-site flat Kagome lattice using IBM’s Heron r1 and r2 processors. The obtained per-site ground-state energy of − 0.4172 J , which approaches the benchmark − 0.4386 J after open boundary correction and approximate error mitigation. Our experiments reveal a peculiar distribution of bond energies when the ansatz is executed on the quantum processor, in contrast to its classical simulation, which merits further investigation.", "authors": [ { "name": "Muhammad Ahsan", "affiliations": [ "Department of Mechatronics and Control Engineering, University of Engineering and Technology", "National Center for Quantum Computing, University of Engineering and Technology" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-05-09", "source": "crossref" }, { "doi": "10.1145/3815169", "url": "https://doi.org/10.1145/3815169", "title": "QuCheck: A Property-based Testing Framework for Quantum Programs in Qiskit", "abstract": "Property-based testing has been previously proposed for quantum programs in Q# with QSharpCheck; however, this implementation was limited in functionality, lacked extensibility, and was evaluated on a narrow range of programs using a single property. To address these limitations, we propose QuCheck, an improved property-based testing framework for Qiskit. By leveraging Qiskit and the broader Python ecosystem, QuCheck facilitates property construction, introduces flexible input generators and assertions, and supports expressive preconditions. We assessed its effectiveness through mutation analysis on five quantum programs (2-10 qubits), varying the number of properties, inputs, and measurement shots to assess their impact on fault detection and demonstrate the effectiveness of property-based testing across a range of conditions. Results show a strong positive correlation between the mutation score (a measure of fault detection) and number of properties evaluated, with a moderate negative correlation between the false positive rate and number of measurement shots. The most thorough test configurations achieved a mean mutation score of 0.90 averaged across all five algorithms, with a false positive rate between 0 and 0.06. QuCheck identified 47.8% more faults than QSharpCheck, with execution time reduced by 67.4%. These findings highlight the viability of property-based testing for verifying quantum systems.", "authors": [ { "name": "Gabriel Pontolillo", "affiliations": [ "Department of Informatics, King's College London" ] }, { "name": "Mohammad Reza Mousavi", "affiliations": [ "Department of Informatics, King's College London" ] }, { "name": "Marek Grzesiuk", "affiliations": [ "Department of Informatics, King's College London" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-05-08", "source": "crossref" }, { "doi": "10.1145/3815191", "url": "https://doi.org/10.1145/3815191", "title": "Tracking Affine Subspace with Gaussian Elimination for Adaptive Quantum Circuit Simulation", "abstract": "Simulating quantum circuits on classical computers is challenging because conventional state-vector simulators are required to track 2 N amplitudes, a resource-intensive process. While sparse simulators that exploit state-support sparsity - where only a small subset of computational basis states carry nonzero amplitudes - offer highly efficient alternatives, they lose their advantage for circuits that generate dense quantum states. To address this, we propose an adaptive simulation technique that dynamically predicts state sparsity through a rapid pre-simulation assessment. Employing a novel application, Gaussian elimination on linear constraints, the proposed approach efficiently tracks an affine subspace of the state space to estimate the number of non-zero amplitudes without complex calculations. We emphasize that our technique specifically targets state-support sparsity rather than gate-level or unitary-matrix sparsity. Overall, this approach enables the system to select between full-state and sparse-state simulations, significantly improving speed and memory efficiency for sparse circuits as well as preserving dense-circuit performance.", "authors": [ { "name": "Kisung Jin", "affiliations": [ "AI Computing Research Lab, Electronics and Telecommunications Research Institute" ] }, { "name": "Jinho On", "affiliations": [ "AI Computing Research Lab, Electronics and Telecommunications Research Institute" ] }, { "name": "Gyuil Cha", "affiliations": [ "AI Computing Research Lab, Electronics and Telecommunications Research Institute" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-05-06", "source": "crossref" }, { "doi": "10.1145/3800578", "url": "https://doi.org/10.1145/3800578", "title": "Unifying Communication Paradigms in Measurement-based Delegated Quantum Computing", "abstract": "Delegated quantum computing (DQC) allows clients with low quantum capabilities to outsource computations to a server hosting a quantum computer. This process is often envisioned within the measurement-based quantum computing framework, as it naturally facilitates blindness of inputs and computation. Hence, the overall process of setting up and conducting the computation encompasses a sequence of three stages: preparing the qubits, entangling the qubits to obtain the resource state, and measuring the qubits to run the computation. There are two primary approaches to distributing these stages between the client and the server that impose different constraints on cryptographic techniques and experimental implementations. In the prepare-and-send setting, the client prepares the qubits and sends them to the server, while in the receive-and-measure setting, the client receives the qubits from the server and measures them. Although these settings have been extensively studied independently, their interrelation and whether setting-dependent theoretical constraints are inevitable remain unclear. By implementing the key components of most DQC protocols in the respective missing setting, we provide a method to build prospective protocols in both settings simultaneously and to translate existing protocols from one setting into the other.", "authors": [ { "name": "Fabian Wiesner", "affiliations": [ "Technische Universität Berlin", "Freie Universität Berlin" ] }, { "name": "Jens Eisert", "affiliations": [ "Freie Universität Berlin", "Fraunhofer Institute for Telecommunications Heinrich-Hertz-Institute HHI" ] }, { "name": "Anna Pappa", "affiliations": [ "Technische Universität Berlin" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.1145/3811537", "url": "https://doi.org/10.1145/3811537", "title": "Improved Routing of Multiparty Entanglement over Quantum Networks", "abstract": "The effective routing of entanglement over a quantum network is a fundamental problem in quantum communication. The distribution and reshaping of multipartite entanglement over a quantum network requires scalable protocols that adapt to the underlying topology. Graph states provide a convenient framework for this challenging task, as they encode global entanglement in a structured way that can be locally manipulated to produce a variety of target states, without requiring additional long-distance quantum operations. In this paper, we propose graph-state-based routing protocols for sharing GHZ states, achieving larger sizes than those achieved in the existing works for given network topologies. For this improvement, we consider tree structures connecting the users participating in the final GHZ states, as opposed to the linear configurations used in the earlier works. In particular, for grid networks, we show special constructions of such trees that achieve larger GHZ states than the prior works. Moreover, if the user nodes along which the entanglement is to be routed are pre-specified, a strategy is proposed to accomplish this routing.", "authors": [ { "name": "Nirupam Basak", "affiliations": [ "Indian Statistical Institute" ] }, { "name": "Goutam Paul", "affiliations": [ "Indian Statistical Institute" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": true, "published": "2026-04-22", "source": "crossref" }, { "doi": "10.1145/3795881", "url": "https://doi.org/10.1145/3795881", "title": "STQS: A Unified System Architecture for Spatial Temporal Quantum Sensing", "abstract": "We present STQS, a unified system architecture for spatiotemporal quantum sensing that interlaces four key quantum components: sensing , memory , communication , and computation . By employing a comprehensive gate-based framework, we systemically explore the design space of quantum sensing schemes and probe the influence of noise at each state in a sensing workflow through simulation. We introduce a novel distance-based metric that compares reference states to sensing states and assigns a confidence level. We anticipate that the distance measure will serve as an intermediate step toward more advanced quantum signal processing techniques like quantum machine learning. To our knowledge, STQS is the first system-level framework to integrate quantum sensing within a coherent, unified architectural paradigm. STQS provides seamless avenues for unique state preparation, multi-user sensing requests, and addressing practical implementations. We demonstrate the versatility of STQS through evaluations of quantum radar and qubit-based dark matter detection. To highlight the near-term feasibility of our approach, we present results obtained from IBM’s Marrakesh and IonQ’s Forte devices, validating key STQS components on present day quantum hardware. We have made the simulation code and experimental data used in this work publicly available.", "authors": [ { "name": "Anastashia Jebraeilli", "affiliations": [ "Pacific Northwest National Laboratory", "Department of Physics, University of Georgia" ] }, { "name": "Chenxu Liu", "affiliations": [ "Pacific Northwest National Laboratory" ] }, { "name": "Keyi Yin", "affiliations": [ "University of California San Diego" ] }, { "name": "Samuel Stein", "affiliations": [ "Pacific Northwest National Laboratory" ] }, { "name": "Erik Lentz", "affiliations": [ "Pacific Northwest National Laboratory" ] }, { "name": "Yufei Ding", "affiliations": [ "University of California San Diego" ] }, { "name": "Ang Li", "affiliations": [ "Pacific Northwest National Laboratory", "University of Washington" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "qml", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1145/3797968", "url": "https://doi.org/10.1145/3797968", "title": "Benchmarking fault-tolerant quantum computing hardware via QLOPS", "abstract": "It is widely recognized that quantum computing has profound impacts on multiple fields, including but not limited to cryptography, machine learning, materials science, and so on. To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels and to design efficient fault-tolerant quantum computing (FTQC) schemes. Currently, various FTQC schemes have been developed for different hardware platforms. However, a comprehensive framework for the analysis and evaluation of these schemes is still lacking. In this work, we propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes on quantum hardware platforms. This benchmarking framework will integrate essential relevant factors, e.g., the code rates of quantum error-correcting codes, the accuracy, throughput, and latency of the decoder. Through a resource analysis of factoring RSA-2048, we demonstrate that QLOPS reflects the practical requirements of quantum algorithm execution. This framework will enable the identification of bottlenecks in quantum hardware, providing potential directions for their development. Moreover, our results will help establish a comparative framework for evaluating FTQC designs. As this benchmarking approach considers practical applications, it may assist in estimating the hardware resources needed to implement quantum algorithms and offers preliminary insights into potential timelines.", "authors": [ { "name": "Linghang Kong", "affiliations": [ "Zhongguancun Laboratory" ] }, { "name": "Fang Zhang", "affiliations": [ "Zhongguancun Laboratory" ] }, { "name": "Jianxin Chen", "affiliations": [ "Department of Computer Science and Technology, Tsinghua University" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1145/3799888", "url": "https://doi.org/10.1145/3799888", "title": "Quantum Backtracking in Qrisp Applied to Sudoku Problems", "abstract": "The quantum backtracking algorithm proposed by Ashley Montanaro raised considerable interest, as it provides a quantum speed-up for a large class of classical optimization algorithms. It does not suffer from Barren-Plateaus, that affect variational quantum algorithms, and transfers well into the fault-tolerant era, as it requires only a limited number of arbitrary angle gates. Despite its potential, the algorithm has seen limited implementation efforts, presumably due to its abstract formulation. In this work, we provide a detailed instruction on implementing the quantum step operator for arbitrary backtracking instances. For a single controlled diffuser of a binary backtracking tree with depth n , our implementation requires only 6 n + 14 CX gates. We detail the process of constructing accept and reject oracles for Sudoku problems using our interface to quantum backtracking. The presented code is written using Qrisp, a high-level quantum programming language, making it executable on most current physical backends and simulators. Subsequently, we perform several simulator based experiments and demonstrate solving 4 × 4 Sudoku instances with up to 9 empty fields. This is, to the best of our knowledge, the first instance of a compilable implementation of this generality, marking a significant and exciting step forward in quantum software engineering.", "authors": [ { "name": "Raphael Seidel", "affiliations": [ "SQC, Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS" ] }, { "name": "Rene Zander", "affiliations": [ "SQC, Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS" ] }, { "name": "Matic Petric", "affiliations": [ "SQC, Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS" ] }, { "name": "Niklas Steinmann", "affiliations": [ "SQC, Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS" ] }, { "name": "David Liu", "affiliations": [ "Purdue University System" ] }, { "name": "Nikolay Tcholtchev", "affiliations": [ "SQC, Fraunhofer Institute for Open Communication Systems FOKUS", "RheinMain University of Applied Sciences" ] }, { "name": "Manfred Hauswirth", "affiliations": [ "Fraunhofer-Institut für Offene Kommunikationssysteme FOKUS", "Technische Universität Berlin (TU Berlin)" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1145/3800579", "url": "https://doi.org/10.1145/3800579", "title": "Translation-Invariant Quantum Algorithms for Ordered Search are Optimal", "abstract": "Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses \\(\\lceil \\log _{2}{n}\\rceil\\) queries for a list of length n . Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of \\(\\log _{2}{n}\\) for exact quantum algorithms is only known to lie between \\((\\ln {2})/\\pi \\approx 0.221\\) and \\(4/\\log _{2}{605} \\approx 0.433\\) . We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k -query quantum algorithm for ordered search can be implemented by a k -query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses \\(5 \\log _{7265}{n} \\approx 0.390 \\log _{2}{n}\\) quantum queries.", "authors": [ { "name": "Joseph Carolan", "affiliations": [ "University of Maryland College Park" ] }, { "name": "Andrew Childs", "affiliations": [ "University of Maryland College Park" ] }, { "name": "Matt Kovacs-Deak", "affiliations": [ "University of Maryland College Park" ] }, { "name": "Luke Schaeffer", "affiliations": [ "University of Waterloo" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1145/3807447", "url": "https://doi.org/10.1145/3807447", "title": "Extending Quantum Annealing to Continuous Domains: a Hybrid Method for Quadratic Programming", "abstract": "We propose Quantum Enhanced Simulated Annealing (QESA), a novel hybrid optimization framework that integrates quantum annealing (QA) into simulated annealing (SA) to tackle continuous optimization problems. While QA has shown promise in solving binary problems such as those expressed in Ising or QUBO form, its direct applicability to real-valued domains remains limited. QESA bridges this gap by using QA to select discrete search directions that guide SA through the continuous solution space, enabling the use of quantum resources without requiring full problem discretization. We demonstrate QESA’s effectiveness on box-constrained quadratic programming (QP) problems, a class of non-convex optimization tasks that frequently arise in practice. Experimental results show that QESA consistently outperforms classical baselines in solution quality, particularly on larger and more ill-conditioned problems, while maintaining competitive runtime. As quantum annealing hardware matures, QESA offers a scalable and flexible strategy for leveraging quantum capabilities in continuous optimization.", "authors": [ { "name": "Hristo Djidjev", "affiliations": [ "Institute of Information and Communication Technologies Bulgarian Academy of Sciences", "Los Alamos National Laboratory" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-07", "source": "crossref" }, { "doi": "10.1145/3795877", "url": "https://doi.org/10.1145/3795877", "title": "Fast Algorithms and Implementations for Computing the Minimum Distance of Quantum Codes", "abstract": "The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic distance of the associated classical code. Our new algorithms are based on the Brouwer - Zimmermann algorithm. Our experimental study shows that these new implementations are much faster than current state-of-the-art licensed implementations on single-core processors, multicore processors, and shared-memory multiprocessors. In the most computationally-demanding cases, the performance gain in the computational time can be larger than one order of magnitude. The experimental study also shows a good scalability on shared-memory parallel architectures.", "authors": [ { "name": "Fernando Hernando", "affiliations": [ "Dept. of Mathematics, Universitat Jaume I" ] }, { "name": "Gregorio Quintana-Ortí", "affiliations": [ "Depto. de Ingeniería y Ciencia de Computadores, Universitat Jaume I" ] }, { "name": "Markus Grassl", "affiliations": [ "International Centre for Theory of Quantum Technologies (ICTQT), University of Gdańsk" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-04-02", "source": "crossref" }, { "doi": "10.1145/3800943", "url": "https://doi.org/10.1145/3800943", "title": "It’s Quick to be Square: Fast Quadratisation for Quantum Toolchains", "abstract": "Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an order as determined by the structure of the objective function and the properties of target hardware. When the structure of the problem representation is not aligned with structure and boundary conditions of the executing hardware, various overheads degrading the computation may arise, possibly negating any possible quantum advantage. Therefore, automatic transformations of problem representations play an important role in quantum computing when descriptions (semi-)targeted at humans must be cast into forms that can be “executed” on quantum computers. Mathematically equivalent formulations are known to result in substantially different non-functional properties depending on hardware, algorithm and detail properties of the problem. Given the current state of noisy intermediate-scale quantum (NISQ) hardware, these effects are considerably more pronounced than in classical computing. Likewise, efficiency of the transformation itself is relevant because possible quantum advantage may easily be eradicated by the overhead of transforming between representations. In this paper, we consider a specific class of higher-level representations, that is, PUBOs, and devise novel automatic transformation mechanisms into widely used QUBOs that substantially improve efficiency and versatility over the state of the art. In addition, we conduct a comprehensive investigation of industry-relevant problem formulations and their conversion into a quantum-specific representation, identifying significant obstacles in scaling behaviour and demonstrating how these can be circumvented.", "authors": [ { "name": "Lukas Schmidbauer", "affiliations": [ "Computer Science, Technical University of Applied Sciences Regensburg" ] }, { "name": "Elisabeth Lobe", "affiliations": [ "Institute of Software Technology, Department High-Performance Computing, German Aerospace Center (DLR)" ] }, { "name": "Ina Schaefer", "affiliations": [ "Institute of Information Security and Dependability (KASTEL),, KIT" ] }, { "name": "Wolfgang Mauerer", "affiliations": [ "Technical University of Applied Sciences Regensburg", "Technology, Siemens AG" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-03-24", "source": "crossref" }, { "doi": "10.1145/3786463", "url": "https://doi.org/10.1145/3786463", "title": "Visualizing Quantum Circuits: State Vector Difference Highlighting and the Half-Matrix", "abstract": "Existing graphical user interfaces for circuit simulators often show small visual summaries of the reduced state of each qubit, showing the probability, phase, purity, and/or Bloch sphere coordinates associated with each qubit. These necessarily provide an incomplete picture of the quantum state of the qubits, and can sometimes be confusing for students or newcomers to quantum computing. We contribute two novel visual approaches to provide more complete information about small circuits. First, to complement information about each qubit, we show the complete state vector, and illustrate the way that amplitudes change from layer-to-layer under the effect of different gates, by using a small set of colors, arrows, and symbols. We call this “state vector difference highlighting”, and show how it elucidates the effect of Hadamard, X, Y, Z, S, T, Phase, and SWAP gates, where each gate may have an arbitrary combination of control and anticontrol qubits. Second, we display pairwise information about qubits (such as concurrence and correlation) in a triangular “half-matrix” visualization. Our open source software implementation, called MuqcsCraft, is available as a live online demonstration that runs in a web browser without installing any additional software, allowing a user to define a circuit through drag-and-drop actions, and then simulate and visualize it.", "authors": [ { "name": "Michael McGuffin", "affiliations": [ "Department of Software and IT Engineering, École de technologie supérieure" ] }, { "name": "Jean-Marc Robert", "affiliations": [ "Department of Software and IT Engineering, École de technologie supérieure" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-03-18", "source": "crossref" }, { "doi": "10.1145/3799898", "url": "https://doi.org/10.1145/3799898", "title": "QFOR: A Fidelity-aware Orchestrator for Quantum Computing Environments using Deep Reinforcement Learning", "abstract": "Quantum cloud computing enables remote access to quantum processors, yet the heterogeneity and noise of available quantum hardware create significant challenges for efficient resource orchestration. These issues complicate the optimisation of quantum task allocation and scheduling, as existing heuristic methods fall short in adapting to dynamic conditions or effectively balancing execution fidelity and time. Here, we propose QFOR, a Q uantum F idelity-aware O rchestration of tasks across heterogeneous quantum nodes in cloud-based environments using Deep R einforcement learning. We model the quantum task orchestration as a Markov Decision Process and employ the Proximal Policy Optimisation algorithm to learn adaptive scheduling policies, using IBM quantum processor calibration data for noise-aware performance estimation. Our configurable framework balances overall quantum task execution fidelity and time, enabling adaptation to different operational priorities. Extensive evaluation demonstrates that QFOR is adaptive and achieves significant performance with 29.5-84% improvements in relative fidelity performance over other deep reinforcement learning and heuristic baselines. Furthermore, it maintains comparable quantum execution times, contributing to cost-efficient use of quantum computation resources.", "authors": [ { "name": "Hoa Nguyen", "affiliations": [ "qCLOUDS Lab, School of Computing and Information Systems, The University of Melbourne" ] }, { "name": "Muhammad Usman", "affiliations": [ "School of Physics, The University of Melbourne", "Data61, CSIRO" ] }, { "name": "Rajkumar Buyya", "affiliations": [ "qCLOUDS Lab, School of Computing and Information Systems, The University of Melbourne" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-03-02", "source": "crossref" }, { "doi": "10.1145/3787463", "url": "https://doi.org/10.1145/3787463", "title": "Toffoli Requires Six Quantum Neighbor Gates", "abstract": "Toffoli gates are key building blocks in quantum programs, and on most current quantum computers, they must be implemented with smaller gates. Such an implementation requires five 2-qubit gates if we assume that each gate can operate on any two qubits. However, many current quantum computers have only 2-qubit gates that operate on neighboring qubits; we call them neighbor gates. How many neighbor gates are required to implement a Toffoli gate? In this article, we show that six neighbor gates are necessary and sufficient, and we generalize to a characterization of all 3-qubit diagonal gates.", "authors": [ { "name": "Keli Huang", "affiliations": [ "Computer Science, University of California, Los Angeles" ] }, { "name": "Jens Palsberg", "affiliations": [ "Computer Science, University of California, Los Angeles" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-02-11", "source": "crossref" }, { "doi": "10.1145/3787461", "url": "https://doi.org/10.1145/3787461", "title": "Quantum Algorithms for Hopcroft's problem", "abstract": "In this work, we study quantum algorithms for Hopcroft’s problem which is a fundamental problem in computational geometry. Given n points and n lines in the plane, the task is to determine whether there is a point-line incidence. The classical complexity of this problem is well-studied, with the best known algorithm running in \\(O(n^{4/3})\\) time, with matching lower bounds in some restricted settings. Our results are two different quantum algorithms with time complexity \\(\\widetilde{O}(n^{5/6})\\) . The first algorithm is based on partition trees and the quantum backtracking algorithm. The second algorithm uses a quantum walk together with a history-independent dynamic data structure for storing line arrangement which supports efficient point location queries. In the setting where the number of points and lines differ, the quantum walk-based algorithm is asymptotically faster. The quantum speedups for the aforementioned data structures may be useful for other geometric problems. Finally, we examine the connections between Hopcroft’s problem and other computational problems via fine-grained complexity. For example, we show a conditional \\(\\Omega (n^{3/4})\\) time lower bound on Hopcroft’s problem in 5 dimensions based on the quantum analogue of a classical hardness conjecture, which is stronger than the (optimal) \\(\\Theta (n^{2/3})\\) query complexity bounds.", "authors": [ { "name": "Vladimirs Andrejevs", "affiliations": [ "Faculty of Science and Technology, University of Latvia" ] }, { "name": "Aleksandrs Belovs", "affiliations": [ "Faculty of Science and Technology, University of Latvia" ] }, { "name": "Jevgēnijs Vihrovs", "affiliations": [ "Faculty of Science and Technology, University of Latvia" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-02-10", "source": "crossref" }, { "doi": "10.1145/3779066", "url": "https://doi.org/10.1145/3779066", "title": "qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays", "abstract": "As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes have been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation.", "authors": [ { "name": "Joshua Viszlai", "affiliations": [ "Computer Science, The University of Chicago" ] }, { "name": "Willers Yang", "affiliations": [ "Computer Science, The University of Chicago" ] }, { "name": "Sophia Lin", "affiliations": [ "Computer Science, The University of Chicago", "AWS Center for Quantum Computing" ] }, { "name": "Junyu Liu", "affiliations": [ "The University of Chicago", "Computer Science, University of Pittsburgh" ] }, { "name": "Natalia Nottingham", "affiliations": [ "Computer Science, The University of Chicago" ] }, { "name": "Jonathan Baker", "affiliations": [ "The University of Texas at Austin" ] }, { "name": "Frederic Chong", "affiliations": [ "Computer Science, The University of Chicago" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-01-27", "source": "crossref" }, { "doi": "10.1145/3776567", "url": "https://doi.org/10.1145/3776567", "title": "Comparative Benchmarking of Utility-Scale Quantum Emulators", "abstract": "Evaluating quantum algorithms at utility-scale - involving more than 100 qubits - is a key step toward advancing real-world applications of quantum computing. In this study, we benchmark seven state-of-the-art quantum emulators employing techniques such as tensor networks, matrix product states (MPS), decision diagrams, and factorized ket based methods, running on CPU based hardware and focusing on effectively exact simulations. Performance is assessed on 13 benchmark circuits from the MQTBench library, spanning circuit sizes from 4 to 1,024 qubits. Our results reveal that MPS-based emulators outperform other approaches overall, successfully solving 8 benchmarks up to the maximum size of 1,024 qubits and 12 benchmarks up to at least 100 qubits in less than 5 minutes. We find evidence that all circuits except a random one can be simulated in polynomial time. This work demonstrates that quantum emulators can faithfully simulate a broad range of large and complex universal quantum circuits with high fidelity, far beyond the limits of statevector simulators and today’s quantum hardware.", "authors": [ { "name": "Anna Leonteva", "affiliations": [ "QPerfect" ] }, { "name": "Guido Masella", "affiliations": [ "QPerfect" ] }, { "name": "Maxime Outteryck", "affiliations": [ "QPerfect" ] }, { "name": "Asier Peiro Orioli", "affiliations": [ "University of Strasbourg and CNRS, European Center for Quantum Sciences (CESQ-ISIS, UMR 7006)", "QPerfect" ] }, { "name": "Shannon Whitlock", "affiliations": [ "University of Strasbourg and CNRS, European Center for Quantum Sciences (CESQ-ISIS, UMR 7006)", "QPerfect" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2026-01-27", "source": "crossref" }, { "doi": "10.1145/3773903", "url": "https://doi.org/10.1145/3773903", "title": "A Cryptographic Perspective on the Verifiability of Quantum Advantage", "abstract": "In recent years, achieving verifiable quantum advantage on a NISQ device has emerged as an important open problem in quantum information. The sampling-based quantum advantages are not known to have efficient verification methods. This article investigates the verification of quantum advantage from a cryptographic perspective. We establish a strong connection between the verifiability of quantum advantage and cryptographic and complexity primitives, including efficiently samplable, statistically far but computationally indistinguishable pairs of (mixed) quantum states ( EFI ), pseudorandom states ( PRS ), and variants of minimum circuit size problems ( MCSP ). Specifically, we prove that a) a sampling-based quantum advantage is either verifiable or can be used to build EFI and even PRS and b) polynomial-time algorithms for a variant of MCSP would imply efficient verification of quantum advantages. Our work shows that the quest for verifiable quantum advantages may lead to applications of quantum cryptography, and the construction of quantum primitives can provide new insights into the verifiability of quantum advantages.", "authors": [ { "name": "Nai-Hui Chia", "affiliations": [ "Computer Science Department, Rice University" ] }, { "name": "Honghao Fu", "affiliations": [ "Concordia Institute of Information Systems Engineering, Concordia University", "CSAIL, MIT" ] }, { "name": "Fang Song", "affiliations": [ "Computer Science Department, Portland State University" ] }, { "name": "Penghui Yao", "affiliations": [ "State Key Laboratory for Novel Software Technology, New Cornerstone Science Laboratory, Nanjing University", "Hefei National Laboratory" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2025-12-20", "source": "crossref" }, { "doi": "10.1145/3773909", "url": "https://doi.org/10.1145/3773909", "title": "FIDDLE: Reinforcement Learning for Quantum Fidelity Enhancement", "abstract": "Quantum computing has the potential to revolutionize fields like quantum optimization and quantum machine learning. However, current quantum devices are hindered by noise, reducing their reliability. A key challenge in gate-based quantum computing is improving the reliability of quantum circuits, measured by process fidelity, during the transpilation process, particularly in the routing stage. In this article, we address the Fidelity Maximization in Routing Stage (FMRS) problem by introducing FIDDLE, a novel learning framework comprising two modules: a Gaussian Process-based surrogate model to estimate process fidelity with limited training samples and a reinforcement learning module to optimize routing. Our approach is the first to directly maximize process fidelity, outperforming traditional methods that rely on indirect metrics such as circuit depth or gate count. We rigorously evaluate FIDDLE by comparing it with state-of-the-art fidelity estimation techniques and routing optimization methods. The results demonstrate that our proposed surrogate model is able to provide a better estimation on the process fidelity compared to existing learning techniques, and our end-to-end framework significantly improves the process fidelity of quantum circuits across various noise models.", "authors": [ { "name": "Hoang M. Ngo", "affiliations": [ "Computer and Information Science and Engineering, University of Florida" ] }, { "name": "Tamer Kahveci", "affiliations": [ "Computer and Information Sciences and Engineering, University of Florida" ] }, { "name": "My T. Thai", "affiliations": [ "Computer and Information Sciences and Engineering, University of Florida" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2025-12-20", "source": "crossref" }, { "doi": "10.1145/3778864", "url": "https://doi.org/10.1145/3778864", "title": "Q-CHOP: Quantum constrained Hamiltonian optimization", "abstract": "Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum algorithm for constrained optimization, which we call quantum constrained Hamiltonian optimization (Q-CHOP). Our algorithm leverages the observation that for many problems, while the best solution is difficult to find, the worst feasible (constraint-satisfying) solution is known. The basic idea of Q-CHOP is to enforce a Hamiltonian constraint at all times, thereby restricting evolution to the subspace of feasible states, and slowly “rotate” an objective Hamiltonian to trace an adiabatic path from the worst feasible state to the best feasible state. Q-CHOP thereby assigns qualitatively distinct roles to the constraint and objective functions of a constrained optimization problem. We additionally propose a version of Q-CHOP that can start in any feasible state. Finally, we benchmark Q-CHOP against the commonly-used adiabatic algorithm of quantum annealing with an objective function that penalizes constraint violation, and find that Q-CHOP consistently performs significantly better on a wide range of problems, including textbook graph problems, knapsack problems, combinatorial auctions, and a real-world financial use case of bond exchange-traded fund basket optimization.", "authors": [ { "name": "Michael A. Perlin", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co", "Quantum Software, Infleqtion" ] }, { "name": "Ruslan Shaydulin", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Benjamin Hall", "affiliations": [ "Quantum Software, Infleqtion" ] }, { "name": "Pierre Minssen", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Changhao Li", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Kabir Dubey", "affiliations": [ "Quantum Software, Infleqtion", "The University of Chicago" ] }, { "name": "Rich Rines", "affiliations": [ "Quantum Software, Infleqtion" ] }, { "name": "Eric Anschuetz", "affiliations": [ "Quantum Software, Infleqtion", "Caltech" ] }, { "name": "Marco Pistoia", "affiliations": [ "Global Technology Applied Research, JPMorgan Chase & Co" ] }, { "name": "Pranav Gokhale", "affiliations": [ "Quantum Software, Infleqtion" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2025-12-02", "source": "crossref" }, { "doi": "10.1145/3762672", "url": "https://doi.org/10.1145/3762672", "title": "Simulation of Quantum Computers: Review and Acceleration Opportunities", "abstract": "Quantum computing has the potential to revolutionise multiple fields by solving complex problems that cannot be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its early stages and the available systems have still very limited resources. As such, currently, the most practical way to develop and test quantum algorithms is to use classical simulators of quantum computers. In addition, the development of new quantum computers and their components also depends on simulations. Given the characteristics of a quantum computer, their simulation is a very demanding application in terms of both computation and memory. As such, simulations do not scale well in current classical systems. Thus different optimisation and approximation techniques need to be applied at different levels. This review provides an overview of the components of a quantum computer, the levels at which these components and the whole quantum computer can be simulated, and an in-depth analysis of different state-of-the-art acceleration approaches. Besides the optimisations that can be performed at the algorithmic level, this review presents the most promising hardware-aware optimisations and future directions that can be explored for improving the performance and scalability of the simulations.", "authors": [ { "name": "Alessio Cicero", "affiliations": [ "Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg" ] }, { "name": "Mohammad Ali Maleki", "affiliations": [ "Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg" ] }, { "name": "Muhammad Waqar Azhar", "affiliations": [ "Zeropoint Technologies AB" ] }, { "name": "Anton Frisk Kockum", "affiliations": [ "Department of Microtechnology and Nanoscience, Chalmers University of Technology" ] }, { "name": "Pedro Trancoso", "affiliations": [ "Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg" ] } ], "journal": { "id": "acm-tqc", "title": "ACM Transactions on Quantum Computing", "issn": [ "2643-6817", "2643-6809" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "algorithms", "error-correction", "simulation" ], "india_hint": false, "published": "2025-11-19", "source": "crossref" }, { "doi": "10.1007/s42484-026-00383-8", "url": "https://doi.org/10.1007/s42484-026-00383-8", "title": "Quantum reinforcement learning in dynamic environments", "abstract": "", "authors": [ { "name": "Oliver Sefrin", "affiliations": [] }, { "name": "Manuel Radons", "affiliations": [] }, { "name": "Lars Simon", "affiliations": [] }, { "name": "Sabine Wölk", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1007/s42484-026-00388-3", "url": "https://doi.org/10.1007/s42484-026-00388-3", "title": "Quantum image loading and classification: experiments on utility-scale quantum computers", "abstract": "", "authors": [ { "name": "Hrant Gharibyan", "affiliations": [] }, { "name": "Hovnatan Karapetyan", "affiliations": [] }, { "name": "Tigran Sedrakyan", "affiliations": [] }, { "name": "Pero Subasic", "affiliations": [] }, { "name": "Vincent P. Su", "affiliations": [] }, { "name": "Rudy H. Tanin", "affiliations": [] }, { "name": "Hayk Tepanyan", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-30", "source": "crossref" }, { "doi": "10.1007/s42484-026-00396-3", "url": "https://doi.org/10.1007/s42484-026-00396-3", "title": "Quantum-inspired heuristics for secured healthcare predictions: a blockchain-integrated approach", "abstract": "", "authors": [ { "name": "Mohemmed Sha", "affiliations": [] }, { "name": "Mohamudha Parveen Rahamathulla", "affiliations": [] }, { "name": "Shtwai Alsubai", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-29", "source": "crossref" }, { "doi": "10.1007/s42484-026-00390-9", "url": "https://doi.org/10.1007/s42484-026-00390-9", "title": "HQNN-FSP: A hybrid classical-quantum neural network for regression-based financial stock market prediction", "abstract": "", "authors": [ { "name": "Prashant Kumar Choudhary", "affiliations": [] }, { "name": "Nouhaila Innan", "affiliations": [] }, { "name": "Muhammad Shafique", "affiliations": [] }, { "name": "Rajeev Singh", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-27", "source": "crossref" }, { "doi": "10.1007/s42484-026-00389-2", "url": "https://doi.org/10.1007/s42484-026-00389-2", "title": "Hybrid quantum-classical generative adversarial networks with transfer learning", "abstract": "", "authors": [ { "name": "Asma Al-Othni", "affiliations": [] }, { "name": "Saif Al-Kuwari", "affiliations": [] }, { "name": "Mohammad Mahdi Nasiri Fatmehsari", "affiliations": [] }, { "name": "Kamila Zaman", "affiliations": [] }, { "name": "Ebrahim Ardeshir-Larijani", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-27", "source": "crossref" }, { "doi": "10.1007/s42484-026-00397-2", "url": "https://doi.org/10.1007/s42484-026-00397-2", "title": "Resource-efficient equivariant quantum convolutional neural networks", "abstract": "Abstract Equivariant quantum neural networks (QNNs) are promising variational models that exploit symmetries to improve machine learning capabilities. Despite theoretical developments in equivariant QNNs, their implementation on near-term quantum devices remains challenging due to limited computational resources. This study proposes a resource-efficient model of equivariant quantum convolutional networks (QCNNs) called equivariant split-parallelizing QCNN (sp-QCNN). Using a group-theoretical approach, we encode general symmetries into our model beyond the translational symmetry addressed by previous sp-QCNNs. We achieve this by splitting the circuit at the pooling layer while preserving symmetry. This splitting structure effectively parallelizes QCNNs to improve measurement efficiency in estimating the expectation value of an observable and its gradient by order of the number of qubits. Our model also exhibits high trainability and generalization performance, including the absence of barren plateaus. Numerical experiments demonstrate that the equivariant sp-QCNN can be trained and generalized with fewer measurement resources than a conventional equivariant QCNN in a noisy quantum data classification task. Our results contribute to the advancement of practical quantum machine learning algorithms.", "authors": [ { "name": "Koki Chinzei", "affiliations": [] }, { "name": "Quoc Hoan Tran", "affiliations": [] }, { "name": "Yasuhiro Endo", "affiliations": [] }, { "name": "Hirotaka Oshima", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-27", "source": "crossref" }, { "doi": "10.1007/s42484-026-00387-4", "url": "https://doi.org/10.1007/s42484-026-00387-4", "title": "Optimization of flight routes: quantum approximate optimization algorithm for the tail assignment problem", "abstract": "", "authors": [ { "name": "Marta Gili", "affiliations": [] }, { "name": "Paul San Sebastian", "affiliations": [] }, { "name": "Ane Blázquez-García", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-27", "source": "crossref" }, { "doi": "10.1007/s42484-026-00395-4", "url": "https://doi.org/10.1007/s42484-026-00395-4", "title": "Attribute fusion-based evidential classifier on quantum circuits", "abstract": "", "authors": [ { "name": "Hao Luo", "affiliations": [] }, { "name": "Qianli Zhou", "affiliations": [] }, { "name": "Lipeng Pan", "affiliations": [] }, { "name": "Zhen Li", "affiliations": [] }, { "name": "Yong Deng", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-24", "source": "crossref" }, { "doi": "10.1007/s42484-026-00394-5", "url": "https://doi.org/10.1007/s42484-026-00394-5", "title": "A review of quantum machine learning methods for remote sensing tasks", "abstract": "", "authors": [ { "name": "Nour Aburaed", "affiliations": [] }, { "name": "Faisal Shah Khan", "affiliations": [] }, { "name": "Mohammed Q. Alkhatib", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.1007/s42484-026-00382-9", "url": "https://doi.org/10.1007/s42484-026-00382-9", "title": "Practical insights on the effect of different encodings, ansätze and measurements in quantum and hybrid convolutional neural networks", "abstract": "", "authors": [ { "name": "Jesús Lozano-Cruz", "affiliations": [] }, { "name": "Albert Nieto-Morales", "affiliations": [] }, { "name": "Oriol Balló-Gimbernat", "affiliations": [] }, { "name": "Adan Garriga", "affiliations": [] }, { "name": "Antón Rodríguez-Otero", "affiliations": [] }, { "name": "Alejandro Borrallo-Rentero", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-22", "source": "crossref" }, { "doi": "10.1007/s42484-026-00377-6", "url": "https://doi.org/10.1007/s42484-026-00377-6", "title": "QXRNet: a hybrid CNN - QNN model with resolution-conditioned feature extraction and variational quantum circuit", "abstract": "", "authors": [ { "name": "Neha Vinayak", "affiliations": [] }, { "name": "Shandar Ahmad", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-16", "source": "crossref" }, { "doi": "10.1007/s42484-026-00392-7", "url": "https://doi.org/10.1007/s42484-026-00392-7", "title": "Unlocking the power of quantum computing in biomedical NLP for lung cancer diagnosis", "abstract": "", "authors": [ { "name": "Cyrille YetuYetu Kesiku", "affiliations": [] }, { "name": "Begonya Garcia-Zapirain", "affiliations": [] }, { "name": "Adel S. Elmaghraby", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-15", "source": "crossref" }, { "doi": "10.1007/s42484-026-00386-5", "url": "https://doi.org/10.1007/s42484-026-00386-5", "title": "Leveraging quantum-inspired explainable AI for PD diagnosis: A QIEAI-QKNN approach", "abstract": "", "authors": [ { "name": "Sudipta Roy", "affiliations": [] }, { "name": "Subrat Kumar Nayak", "affiliations": [] }, { "name": "Debahuti Mishra", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-15", "source": "crossref" }, { "doi": "10.1007/s42484-026-00393-6", "url": "https://doi.org/10.1007/s42484-026-00393-6", "title": "A hybrid quantum-classical deep learning approach for gravitational wave detection", "abstract": "", "authors": [ { "name": "Akshit Gupta", "affiliations": [] }, { "name": "Neeru Jindal", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-15", "source": "crossref" }, { "doi": "10.1007/s42484-026-00385-6", "url": "https://doi.org/10.1007/s42484-026-00385-6", "title": "Q-VFL: quantum-enhanced vertical federated learning with contrastive encoding for privacy-preserving medical AI", "abstract": "", "authors": [ { "name": "Asitha Kottahachchi Kankanamge Don", "affiliations": [] }, { "name": "Ibrahim Khalil", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-14", "source": "crossref" }, { "doi": "10.1007/s42484-026-00381-w", "url": "https://doi.org/10.1007/s42484-026-00381-w", "title": "Quantum transformers for image classification: integrating variational quantum circuits and quantum wavelet KAN", "abstract": "", "authors": [ { "name": "Zihan Geng", "affiliations": [] }, { "name": "Xinghua Wang", "affiliations": [] }, { "name": "Xiaoran Li", "affiliations": [] }, { "name": "Feng Zhang", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-13", "source": "crossref" }, { "doi": "10.1007/s42484-026-00384-7", "url": "https://doi.org/10.1007/s42484-026-00384-7", "title": "Advantage with quantum reservoir computing in medical insurance and health data analysis", "abstract": "", "authors": [ { "name": "Muhsin Tamturk", "affiliations": [] }, { "name": "Eran Ginossar", "affiliations": [] }, { "name": "Marco Carenzo", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-08", "source": "crossref" }, { "doi": "10.1007/s42484-026-00391-8", "url": "https://doi.org/10.1007/s42484-026-00391-8", "title": "Quantum walks - based adaptive distribution generation with efficient CUDA-Q acceleration", "abstract": "", "authors": [ { "name": "Yen Jui Chang", "affiliations": [] }, { "name": "Wei-Ting Wang", "affiliations": [] }, { "name": "Chen-Yu Liu", "affiliations": [] }, { "name": "Yun-Yuan Wang", "affiliations": [] }, { "name": "Ching-Ray Chang", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-08", "source": "crossref" }, { "doi": "10.1007/s42484-026-00345-0", "url": "https://doi.org/10.1007/s42484-026-00345-0", "title": "Quantum machine learning for state tomography using classical data", "abstract": "", "authors": [ { "name": "Shabnam Jabeen", "affiliations": [] }, { "name": "Dmytro Kurdydyk", "affiliations": [] }, { "name": "Aadi Palnitkar", "affiliations": [] }, { "name": "Mihir Talati", "affiliations": [] }, { "name": "Jeffrey Yan", "affiliations": [] }, { "name": "Jinghong Yang", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-04-02", "source": "crossref" }, { "doi": "10.1007/s42484-026-00342-3", "url": "https://doi.org/10.1007/s42484-026-00342-3", "title": "Time series generation for option pricing on quantum computers using tensor network", "abstract": "", "authors": [ { "name": "Nozomu Kobayashi", "affiliations": [] }, { "name": "Yoshiyuki Suimon", "affiliations": [] }, { "name": "Koichi Miyamoto", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "qml", "categories": [ "qml", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-03-31", "source": "crossref" }, { "doi": "10.1007/s42484-026-00367-8", "url": "https://doi.org/10.1007/s42484-026-00367-8", "title": "Quantum simulation of single-server Markovian queues: a dynamic amplification approach", "abstract": "", "authors": [ { "name": "Or Peretz", "affiliations": [] }, { "name": "Michal Koren", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-03-30", "source": "crossref" }, { "doi": "10.1007/s42484-026-00375-8", "url": "https://doi.org/10.1007/s42484-026-00375-8", "title": "An advanced hybrid quantum tabu search approach to vehicle routing problems", "abstract": "", "authors": [ { "name": "James B. Holliday", "affiliations": [] }, { "name": "Eneko Osaba", "affiliations": [] }, { "name": "Khoa Luu", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-03-23", "source": "crossref" }, { "doi": "10.1007/s42484-026-00376-7", "url": "https://doi.org/10.1007/s42484-026-00376-7", "title": "A more efficient quantum circuit for estimating the variance", "abstract": "", "authors": [ { "name": "Alessandro Poggiali", "affiliations": [] }, { "name": "Jiwon Ju", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-03-18", "source": "crossref" }, { "doi": "10.1007/s42484-026-00380-x", "url": "https://doi.org/10.1007/s42484-026-00380-x", "title": "Quantum-enhanced causal discovery for a small number of samples", "abstract": "", "authors": [ { "name": "Yu Terada", "affiliations": [] }, { "name": "Ken Arai", "affiliations": [] }, { "name": "Yu Tanaka", "affiliations": [] }, { "name": "Yota Maeda", "affiliations": [] }, { "name": "Hiroshi Ueno", "affiliations": [] }, { "name": "Hiroyuki Tezuka", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-03-18", "source": "crossref" }, { "doi": "10.1007/s42484-026-00374-9", "url": "https://doi.org/10.1007/s42484-026-00374-9", "title": "QURIOSO: Quantum gate parameter predictIon through quantum-enhanced long-short term memory", "abstract": "", "authors": [ { "name": "Corrado Loglisci", "affiliations": [] }, { "name": "Vito N. Losavio", "affiliations": [] }, { "name": "Saverio Pascazio", "affiliations": [] }, { "name": "Donato Malerba", "affiliations": [] } ], "journal": { "id": "qmi", "title": "Quantum Machine Intelligence", "issn": [ "2524-4906", "2524-4914" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "qml", "algorithms" ], "india_hint": false, "published": "2026-03-18", "source": "crossref" }, { "doi": "10.3390/quantum8020049", "url": "https://doi.org/10.3390/quantum8020049", "title": "A Structural Theory of Quantum Computational Advantage from Admissible Histories", "abstract": "We propose a structural framework for interpreting quantum computational advantage in terms of admissible continuation of configurations. In this framework, a quantum computation is described not only as a sequence of gates acting on a state vector but also as the organization of admissible histories whose phase contributions combine coherently in a manner related to sum-over-histories and path-integral formulations of quantum mechanics. We identify three structural features that are relevant to quantum advantage: the multiplicity of admissible histories, the degree of phase coherence among them, and the non-factorizable structure of continuation constraints corresponding to entanglement-like global dependence. To make these features explicit, we introduce the notion of effective coherent multiplicity, which measures the coherently usable portion of an admissible-history space before probability normalization. We then formulate a structural speedup conjecture: substantial quantum advantage requires not merely a large number of possible histories but scalable coherent multiplicity supported by non-factorizable constraints whose instability remains bounded. We also introduce a coherent-fiber criterion, which identifies phase-alignable families of histories selected by compact computational relations as a structural source of coherent amplification. This formulation does not replace standard complexity-theoretic measures such as circuit size, query complexity, or BQP membership. Rather, it provides a complementary structural language for relating those measures to interference, entanglement, decoherence, and the organization of computational history space. The framework clarifies, at a structural level, why raw branching alone is insufficient for speedup, why unstructured search yields only a limited advantage, and why problems with compact global regularities, such as Simon’s problem and period finding, can support stronger coherent amplification. The paper also discusses how the proposed quantities relate to standard notions, including success amplitudes, entanglement measures, tensor-network simulability, and fault-tolerance constraints. In this way, admissible-history structure is presented as a diagnostic viewpoint for understanding both the power and limitations of quantum computation.", "authors": [ { "name": "Bin Li", "affiliations": [ "Research Department, Silicon Minds Inc., Clarksville, MD 21029, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.3390/quantum8020047", "url": "https://doi.org/10.3390/quantum8020047", "title": "A Local Phase-Field Framework for Spin Entanglement Correlations", "abstract": "We introduce a local phase-field framework for spin-entanglement correlations. In this framework, the relevant hidden variable is an internal scalar phase associated with each fermion and derived from two underlying real fields. The fields are assumed to evolve locally in ordinary spacetime. When a particle pair is produced at a common spacetime event, the pair acquires a shared phase-locking condition at creation; after separation, the two internal phases evolve independently and no nonlocal interaction is introduced. Spin measurements by Stern - Gerlach analyzers are modeled as local filtering operations. Each local response depends only on the internal phase carried by the particle and on the orientation of the local analyzer. The local response function A(α,λ) = cos(λ − 2α) is derived from the spinorial transformation law of the underlying real field pair and the projection geometry of the detector interaction; it is not a phenomenological ansatz. From these deterministic local responses we derive an analog correlator. The raw product moment of the continuous detector outputs evaluates to ⟨AB⟩ = −½ cos 2(α − β), which satisfies classical Clauser-Horne-Shimony-Holt (CHSH) bounds. After Pearson normalization - the operationally appropriate correlation measure for continuous analog detector outputs, justified by channel-contrast physics and scale invariance - the normalized correlator yields E(α,β) = −cos 2(α − β), matching the quantum singlet correlator in functional form. When this normalized correlator is inserted into the CHSH expression, it yields the numerical value 2√2. This result is a structural consequence of the reduced marginal variance of continuous response functions relative to the unit-variance dichotomic observables assumed in Bell’s derivation; it does not constitute a violation of Bell’s inequality. The model does not reproduce quantum singlet statistics at the level of binary detector outcomes, where the correlator takes a triangular rather than cosine form. The contribution is therefore ontological and conceptual rather than predictive. The framework preserves parameter independence and no-signaling throughout. It provides a concrete real-field ontology for spin correlations based on internal phase structure, and it demonstrates that the functional form of the quantum singlet correlation can be obtained from a strictly local deterministic description, provided that the detector responses are treated as continuous analog quantities and normalized accordingly. We compare the model with earlier phase-based approaches and discuss experimental configurations - including time-resolved and multi-stage Stern - Gerlach measurements - that could in principle probe the proposed internal-phase dynamics at the pre-registration level.", "authors": [ { "name": "Doron Kwiat", "affiliations": [ "Independent Researcher, Mazkeret Batya 7680400, Israel" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.3390/quantum8020048", "url": "https://doi.org/10.3390/quantum8020048", "title": "Geometry of State-Update Processes and Wave Function Collapse", "abstract": "We develop an information-geometric framework for describing quantum state-update processes associated with measurement and statistical distinguishability. The approach is based on the quantum relative entropy and the quantum Fisher information metric, which together induce a natural Riemannian geometry on the manifold of quantum states. Using the second-order expansion of relative entropy, we show how the Fisher metric governs the local structure of distinguishability between nearby states and defines a corresponding thermodynamic length. This geometric structure provides an effective description of finite quantum state transitions in terms of fluctuation geometry and information-space distance. The formalism is applied to thermal two-level systems and harmonic oscillator states, illustrating how the Fisher metric encodes susceptibilities, fluctuations, and geometric transition costs. We also discuss the relation between thermodynamic length, dissipation bounds, and optimal paths in state space. Within this framework, wave function collapse is interpreted not as a microscopic dynamical mechanism, but as an effective state-update process that admits a geometric characterization in the manifold of density operators. The resulting perspective unifies concepts from quantum information theory, thermodynamics, and differential geometry within a common operational framework based on statistical distinguishability. Possible connections with quantum speed limits, entanglement geometry, and holographic relations between relative entropy and gravitational dynamics are briefly discussed.", "authors": [ { "name": "Angelo Plastino", "affiliations": [ "Instituto de Física (IFLP-CCT-CONICET), Universidad Nacional de La Plata, La Plata 1900, Argentina" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.3390/quantum8020046", "url": "https://doi.org/10.3390/quantum8020046", "title": "A Hybrid Quantum-Classical Framework for Saliency-Aware Medical Image Encoding", "abstract": "Quantum image processing provides significant storage benefits over classical methods. However, current quantum image representation techniques exhibit limitations regarding encoding efficiency, circuit complexity, and adaptability to image content. This paper proposes Saliency-Aware Hybrid Quantum Image Representation (SAHQR), utilizing saliency detection for content-adaptive representation. It selectively focuses on salient regions, allocating quantum resources proportionally to visual importance, whereas existing techniques represent all regions uniformly.The proposed approach is evaluated against ten state-of-the-art quantum image representation techniques using ten criteria: number of qubits, circuit depth, gate complexity, encoding time, scalability, information loss, compression ratio, memory overhead, and implementation complexity Experimental results on 6097 medical images from the MINC database demonstrate that this work should be interpreted as a proof of concept for saliency-aware quantum encoding, rather than as a universally optimal representation.The evaluation is extended to 2000 Synthetic Aperture Radar (SAR) tiles and 2298 Brain Tumor MRI scans to validate cross-domain generalization. Statistical significance tests (p < 0.001) confirm SAHQR yields statistically significant improvements over existing techniques across all three domains.", "authors": [ { "name": "Vrushali Nikam", "affiliations": [ "Computer Engineering, MET’s Institute of Engineering - Bhujbal Knowledge City, Nashik 422003, India" ] }, { "name": "Trupti Atre", "affiliations": [ "Computer Engineering, Gokhale Education Society’s, R H Sapat College of Engineering Management Studies and Research, Nashik 422005, India" ] }, { "name": "Lavanya Santhosh", "affiliations": [ "CSE Programme, School of CSE, Dr. Ambedkar Institute of Technology, Bengaluru 560056, India" ] }, { "name": "Asha Konasagara Nagaraja", "affiliations": [ "CSE Programme, School of CSE, Dr. Ambedkar Institute of Technology, Bengaluru 560056, India" ] }, { "name": "Praveena Mydolalu Veerappa", "affiliations": [ "CSE Programme, School of CSE, Dr. Ambedkar Institute of Technology, Bengaluru 560056, India" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": true, "published": "2026-05-07", "source": "crossref" }, { "doi": "10.3390/quantum8020045", "url": "https://doi.org/10.3390/quantum8020045", "title": "A Two-Step Quantum Approximate Optimization Algorithm for Portfolio Optimization and Risk Assessment", "abstract": "Quantum finance represents a pivotal and cutting-edge application domain within the burgeoning field of quantum computing. In this work, we propose a two-step quantum approximate optimization algorithm (two-step QAOA) for portfolio optimization and risk assessment. The algorithm initiates by formulating the stock selection problem as a quadratic unconstrained binary optimization (QUBO) problem and employs a classical-quantum hybrid method to find the ground state of the Hamiltonian. We then introduce an energy-based characteristic indicator U∈[0,1), which quantitatively evaluates portfolio performance under customizable investment preferences, effectively capturing the trade-off between expected return and risk. The number of qubits required scales with the number of stocks N in the pool, and the number of Hamiltonian terms is O(N2). Numerical simulations show that the algorithm provides consistent and reasonable assessment results on both training and test datasets under different investment preferences (aggressive or conservative), validating the capability of the characteristic indicator to extract intrinsic information from the portfolios. Additionally, by incorporating warm-starting and digitized counterdiabatic techniques, the algorithm achieves improved scalability and faster convergence. Our work presents a flexible and practical algorithmic framework for applying quantum computing in the financial domain.", "authors": [ { "name": "Boxuan Wu", "affiliations": [ "Upper Secondary School, Wuxi Dipont School of Arts and Science, Wuxi 214000, China" ] }, { "name": "Lei Wang", "affiliations": [ "Upper Secondary School, Wuxi Dipont School of Arts and Science, Wuxi 214000, China" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-07", "source": "crossref" }, { "doi": "10.3390/quantum8020044", "url": "https://doi.org/10.3390/quantum8020044", "title": "Breakdown of Bell Factorization from Non-Injective Effective Descriptions", "abstract": "Violations of Bell inequalities are commonly interpreted as evidence for nonlocal influences or as constraints on realist descriptions. We show that the failure of Bell-type factorizability arises naturally when observable outcomes are obtained through a non-injective mapping from an underlying configuration space. In this setting, the standard factorization assumption can be viewed as an implicit requirement that observable variables admit a jointly factorizable completion at the underlying level. We demonstrate that this requirement need not hold when the mapping from underlying configurations to observables is many-to-one. The resulting breakdown of probabilistic factorization does not rely on superluminal dynamics or hidden causal influences, but follows from information loss under projection. Observable outcomes correspond to equivalence classes of underlying configurations, preventing the assignment of independent local variables. We illustrate this mechanism with an explicit toy model producing Bell - CHSH violations while preserving operational no-signalling and statistical independence of measurement settings. The model is not intended to reproduce quantum correlations quantitatively, and may exceed the Tsirelson bound; its role is to isolate the structural origin of the violation. This analysis does not contradict Bell’s theorem, but identifies a class of effective descriptions for which its factorizability assumption does not apply. The framework preserves locality at the underlying level, introduces no additional hidden-variable dynamics, and does not modify quantum mechanics. It clarifies how classical factorization is recovered in regimes where the effective mapping becomes approximately injective. In the operator language of quantum theory, the same mechanism admits a natural reformulation in terms of reduction to an effective observable subalgebra by a noncommutative conditional expectation.", "authors": [ { "name": "Jérôme Beau", "affiliations": [ "Independent Researcher, 92000 Nanterre, France" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-02", "source": "crossref" }, { "doi": "10.3390/quantum8020042", "url": "https://doi.org/10.3390/quantum8020042", "title": "Many Body in General Relativity: A Thermal Equivalence Principle", "abstract": "In this paper, we review the physics of many bodies in the context of general relativity. Starting from the stress - energy tensor for one body and moving onto those for a swarm of bodies and for a perfect fluid, we review the relativistic hydrodynamics, kinetic theory, and statistical physics of N identical bodies. We conclude our excursion with a thermal equivalence principle in physics.", "authors": [ { "name": "Riccardo Fantoni", "affiliations": [ "Dipartimento di Fisica, Università di Trieste, Strada Costiera 11, Grignano, 34151 Trieste, Italy" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-01", "source": "crossref" }, { "doi": "10.3390/quantum8020043", "url": "https://doi.org/10.3390/quantum8020043", "title": "Noise Mitigation in Quantum-Enhanced Fiber Optic Gyroscopes", "abstract": "We analyze noise in a quantum-enhanced fiber optic gyroscope (FOG), focusing on one of the leading sources of phase uncertainty - uncorrelated photon saturation. Taking a squeezed state input as a source for N00N states, we compute the uncorrelated false coincidence counts at the optimal phase bias and determine an upper limit to the squeezed amplitude ξ which allows for sub-shot noise precision. As examples, we apply parameters of present-day quantum FOG experiments and determine the maximum possible precision enhancement based on their respective ξ and optimal phase bias points. With the aim of supporting future FOG setups with higher N00N state fluxes, our result highlights the need to transition to multimode states to bypass the ξ limitation, such as photon pairs generated by the dynamical Casimir effect.", "authors": [ { "name": "Stefan Evans", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] }, { "name": "Joanna N. Ptasinski", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-01", "source": "crossref" }, { "doi": "10.3390/quantum8020040", "url": "https://doi.org/10.3390/quantum8020040", "title": "Ultrafast Helicity-Controlled Spin Dynamics in Curved Time: A Photonic Pathway to Geometry-Driven Spin Transport", "abstract": "Controlling spin dynamics conventionally requires external magnetic fields, strong electric bias, or material-specific spin - orbit interactions, while the temporal reference frame remains fixed. Here we introduce curved-time spintronics, a framework in which a synthetic lapse field, implemented through GHz surface-acoustic-wave (SAW) modulation, reshapes the effective flow of time experienced by spinor, magnonic, and photon - spin degrees of freedom. Using a curved-time Schrödinger - Pauli model, we show that it renormalizes the Larmor frequency, modifies SOC-driven splittings, and produces helicity-dependent spin precession under circularly polarized excitation. Strikingly, a spatial lapse gradient induces a Hall-like transverse drift even when in the absence of any external electric field or intrinsic Berry curvature, demonstrating that time geometry alone can generate transverse transport. Time-domain simulations confirm curvature-driven Hall response across graphene, carbon nanotubes, and generic Dirac platforms, establishing a material-agnostic, field-free mechanism for transverse spin manipulation. We further predict curvature-dependent spin diffusion, temporal magnon focusing, and helicity-selective entanglement generation, and propose pump - probe detection via ultrafast Kerr rotation synchronized to SAW-driven lapse modulation. These results position engineered time geometry as a new spintronic control axis, enabling Hall-like effects, spin transport, and chiral phase manipulation without relying on intrinsic material properties, magnetic fields, or electric gating.", "authors": [ { "name": "Mohammad Mohammadiaria", "affiliations": [ "Independent Researcher, 27100 Pavia, Italy" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-01", "source": "crossref" }, { "doi": "10.3390/quantum8020041", "url": "https://doi.org/10.3390/quantum8020041", "title": "Verifying Quantum Network Nonlocality Based on the Extended Mermin Inequality", "abstract": "This work proposes an extended Mermin inequality based on a hybrid classical model that involves only one classical source, with the remaining sources being post-quantum. In a chain-structured quantum network consisting of hybrid Einstein - Podolsky - Rosen (EPR) pairs and Greenberger - Horne - Zeilinger (GHZ) states, joint measurements are performed at the central node, while local measurements are conducted at the peripheral nodes. This setup shows that the obtained quantum correlations can violate the proposed inequality with fewer measurement settings, thereby verifying network nonlocality. Furthermore, we extend this method to chain networks of arbitrary length n and show that the proposed inequality remains effective in verifying network nonlocality.", "authors": [ { "name": "Xinyue Li", "affiliations": [ "School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China" ] }, { "name": "Yan-Han Yang", "affiliations": [ "School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China" ] }, { "name": "Ming-Xing Luo", "affiliations": [ "School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "pqc", "foundations", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-05-01", "source": "crossref" }, { "doi": "10.3390/quantum8020039", "url": "https://doi.org/10.3390/quantum8020039", "title": "Experimental Proof That Bell’s Inequality Cannot Falsify Local Realism, Together with Corresponding Cause Analysis and Conjectures", "abstract": "Conventional tests of Bell’s inequality rely on entangled photon pairs. Here, we replace entangled pairs with two independent photons of orthogonal polarization and demonstrate that Bell’s inequality is still violated. Given the inherent local realism of independent photons, this experiment proves that Bell’s inequality cannot falsify the local realism of photons. We thus conjecture that the violation of Bell’s inequality by entangled photon pairs originates from their orthogonal polarizations rather than the breakdown of local realism. To interpret this unexpected violation with independent photons, we further substitute the two photons with two monochromatic light beams and calculate the transmittance correlation through polarizers via Malus’s law and Karl Pearson’s correlation formula. We show that this correlation also defies Bell’s inequality. Retracing the derivation of Bell’s inequality reveals that its validity is restricted to binary events, which accounts for the observed violation with light beams. Finally, we propose a thought experiment involving the gradual attenuation of light intensity down to the single-photon regime and hypothesize that single-photon transmission through a polarizer does not constitute a binary event. This hypothesis provides a unified interpretation for both our experimental findings and all canonical Bell inequality tests reported to date.", "authors": [ { "name": "Ting Zhou", "affiliations": [ "Shanghai Nimovision Intelligent Technology Co., Ltd., Shanghai 201210, China" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-25", "source": "crossref" }, { "doi": "10.3390/quantum8020038", "url": "https://doi.org/10.3390/quantum8020038", "title": "From Proportional Stationarity to Curvature - Strain Balance: A Variational Bridge for Equilibrium Ratios", "abstract": "Variational models describe deformation and stability through the first and second variations in an underlying functional, but the relationship between these responses is seldom expressed as an intrinsic equilibrium quantity of the model itself. A canonical curvature - strain representation for equilibrium ratios arising in variational field settings is developed. For a twice Fréchet differentiable functional and an admissible perturbation generator, strain is defined as normalized first-order response and curvature as normalized second-order response along the generator direction. Their quotient defines a curvature - strain ratio that measures proportional balance between deformation and curvature within the model. The main result shows that this curvature - strain ratio is a canonical representative of a response ratio already implicit in the variational data. Under canonical normalization, the curvature - strain ratio coincides with the quotient of second- and first-order response, and stationarity of the curvature - strain ratio is equivalent to proportional stationarity of that response quotient along the admissible flow. A further theorem establishes transfer of local isolation: when the second-variation operator satisfies standard hypotheses such as compact resolvent and non-degeneracy of the constrained extremum, isolated equilibrium ratios persist in the curvature - strain representation for the same operator-theoretic reasons. Quadratic scalar and Maxwell-type models illustrate the construction. The paper establishes a mathematically controlled curvature - strain representation of equilibrium ratios within ordinary variational theory, with emphasis on the analysis of variational response and equilibrium balance.", "authors": [ { "name": "Robert Castro", "affiliations": [ "Viterbi School of Electrical Engineering, University of Southern California, Los Angeles, CA 90007, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-22", "source": "crossref" }, { "doi": "10.3390/quantum8020037", "url": "https://doi.org/10.3390/quantum8020037", "title": "Quantum Image Representation with Enhanced Intensity Preservation and Fidelity (IP-QIR)", "abstract": "Quantum image representation (QIR) is the basic idea behind quantum image processing. It explains how a normal image is converted into quantum states so that it can be processed using quantum computers. The commonly used models for QIR are Flexible Representation of Quantum Images (FRQIs) and Novel Enhanced Quantum Representation (NEQR). Though these approaches highlight the potential of quantum-based image encoding, the limitation of practical applicability on Noisy Intermediate-Scale Quantum (NISQ) devices exists. In this paper, we propose an intensity-preserving quantum image representation (IP-QIR) scheme that aims to maintain accurate grayscale intensity information while significantly reducing quantum resource usage. The proposed method employs a controlled rotation-based encoding strategy, where pixel intensities are embedded into the measurement probability of a single intensity qubit, and spatial information is represented using position qubits. To further enhance feasibility on near-term quantum hardware, the framework operates on small image patches instead of full-resolution images, thereby reducing circuit depth and overall complexity. The performance of the proposed IP-QIR approach is evaluated through IBM Qiskit simulations on three types of grayscale images: synthetic image patches, synthetic aperture radar (SAR) images, and medical tuberculosis (TB) chest X-ray images. Experimental results demonstrate that IP-QIR achieves better intensity preservation than FRQIs and NEQR, with fidelity values reaching up to 84.12% for both SAR and medical datasets. In addition, IP-QIR represents a 4×4 image patch using only five qubits, which significantly reduces the qubit requirement when compared to NEQR, while still preserving high reconstruction accuracy.", "authors": [ { "name": "Vrushali Nikam", "affiliations": [ "MET Institute of Engineering, Bhujbal Knowledge City, Nashik 422003, India" ] }, { "name": "Shirish Sane", "affiliations": [ "Gokhale Education Society’s R. H. Sapat College of Engineering, Management Studies and Research, Nashik 422005, India" ] }, { "name": "Manish Motghare", "affiliations": [ "Suvidha Foundation, Nagpur 441102, India" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": true, "published": "2026-04-22", "source": "crossref" }, { "doi": "10.3390/quantum8020036", "url": "https://doi.org/10.3390/quantum8020036", "title": "Bipolar Entropy vs. Entropy/Negentropy: From Quantum Emergence to Agentic AI&QI with Collectively Entangled Bipolar Strings ER ≥≥ EPR", "abstract": "While the quantum emergence of spacetime is becoming a major research topic in physics, the quantum emergence of intelligence has not been widely researched in quantum information science (QIS). Following causal-logical quantum gravity theory, bipolar entropy vs. entropy and negative entropy (or negentropy) are reviewed and distinguished for quantum emergence/submergence of quantum agent (QA) and quantum intelligence (QI) in algebraic terms. This work refers to QA as an entangled bipolar string/superstring in bipolar dynamic equilibrium (BDE) and QI being centered on logically definable causality in regularity, mind-light-matter unity, and brain-universe similarity. ER = EPR is extended to ER ≥≥ EPR for the mathematical scalability of bipolar strings and their collective entanglement. The extension leads to a number of conjectures, testable predictions, and theorems. The term “equilibraton” is proposed as a type of EPR or bipolar generic string to serve as an entropic stitch to collectively hold the universe together as a quantum entanglement in BDE with ubiquitous, regulated local emergence and submergence of QA&QI. Equilibraton leads to the concept of bipolar entropy square - a complete entropic solution to the background issue in quantum gravity. With complete background independence, energy/information conservational bipolar entropy, energy/information invariance, bipolar entropy non-additivity, and equilibrium-based plateau concavity are introduced. The nature of the one-dimensional arrow of time is conjectured. As a unification of order and disorder for equilibrium-based regulation, bipolar entropy bridges QA&QI to agentic AI, where quantum-bio-economics can be viewed as a topological intervention of a natural dynamic equilibrium in a social or natural world. Use cases are reviewed to illustrate the practical and theoretical aspects of bipolar entropy in business management, quantum-bio-economics, quantum cryptography, physics, and biology. Eddington - Einstein’s comments on entropy are revisited. It is expected that bipolar entropy will bring quantum emergence/submergence to agentic AI&QI for entangled machine thinking and imagination as a naturally scalable and testable foundation of real-world quantum gravity, quantum information science (QIS), quantum cognition and quantum biology (QCQB) to enhance Large Language AI Models (LLMs) and machine intelligence.", "authors": [ { "name": "Wen-Ran Zhang", "affiliations": [ "Independent Researcher, Statesboro, GA 30460, USA" ] }, { "name": "Hengyu Zhang", "affiliations": [ "Department of Mathematics, Ohio State University, Columbus, OH 43210, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.3390/quantum8020035", "url": "https://doi.org/10.3390/quantum8020035", "title": "Quantum Correlations in Classical Systems", "abstract": "A classical fluid splitter produces the same patterns of energy redistribution as a Stern - Gerlach quantum device, with rotationally invariant coefficients of correlation between molecular paths. Alternative settings express a cosine squared relationship, leading to Tsirelson-type Bell violations with outcome independence. This result confirms the Correspondence Principle of quantum mechanics, where individual detection events express system-level properties according to Born’s Rule. Kochen - Specker contextuality and Bell Locality are not formally contradicted, but their interpretation is in question. Current definitions of “Local Realism” are limited to intrinsic particle properties. In contrast, quantum-like correlations require the acknowledgement of ensemble effects on dynamically inseparable entities, even when those entities are observed one at a time.", "authors": [ { "name": "Ghenadie N. Mardari", "affiliations": [ "Open Worlds Research, Sparks, MD 21152, USA", "The School of Arts and Sciences (SAS), Busch Campus, Rutgers University, Piscataway, NJ 08854, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-18", "source": "crossref" }, { "doi": "10.3390/quantum8020034", "url": "https://doi.org/10.3390/quantum8020034", "title": "Quantum-Informational History Optimization Theory (QIHOT): A Single-History Selection Framework with Consistency Results", "abstract": "We present Quantum-Informational History Optimization Theory (QIHOT) as a formal proposal for selecting a single realized quantum history from a space of dynamically admissible histories subject to boundary constraints. In the present paper, we restrict attention to finite-dimensional and toy-model settings, where the framework can be stated explicitly. QIHOT separates two levels: a dynamical prior over admissible histories generated by standard quantum evolution, and an informational selection rule that reweights those histories by an entropy-based cost functional. Within this structure, we show that standard Born statistics are recovered in symmetric-cost measurement scenarios when the prior is the usual Hilbert-space quantum prior. We further formulate conditions under which operational no-signaling is preserved, provided the selection functional factorizes locally for spacelike-separated regions. A fully worked two-outcome model illustrates how the framework interpolates between coherent evolution and measurement-like branch selection. We contrast QIHOT with the Many-Worlds Interpretation, the Transactional Interpretation, the Consistent Histories formalism, the Schwinger - Keldysh formalism, and Lagrangian-based retrocausal models, highlighting structural similarities and key differences. We emphasize that the present paper develops QIHOT as a scoped formal proposal with partial consistency results rather than as a complete replacement for quantum theory. Possible extensions to consciousness and cosmology are deferred to brief outlook-level discussion.", "authors": [ { "name": "Freeman Hui", "affiliations": [ "Independent Researcher, Hong Kong, China" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-16", "source": "crossref" }, { "doi": "10.3390/quantum8020033", "url": "https://doi.org/10.3390/quantum8020033", "title": "Copy-Time Geometry from Gauge-Coded Quantum Cellular Automata: Emergent Gravity and a Golden Relation for Singlet-Scalar Dark Matter", "abstract": "We formulate the Quantum Information Copy Time (QICT) framework for conserved charges under strictly local quantum dynamics and isolate its logically strongest consequence. The theorem-level core is a receiver-optimised variational speed-limit inequality: after projection away from the conserved zero mode, the copy time is bounded from below by the inverse square root of a Liouvillian-squared receiver susceptibility times a local encoding seminorm. This statement is written in a finite-volume operator framework and does not require a diffusive ansatz. We then examine what follows only after additional infrared assumptions. Under a single diffusive slow-mode hypothesis, the variational inequality reduces to the practical scaling relation used in the benchmark computations. That reduction is treated as conditional and is stress-tested numerically rather than promoted by rhetoric. Within the anomaly-free Abelian span relevant for one Standard-Model-like generation, hypercharge selection is elevated to theorem-level status; by contrast, minimal gauge-algebra uniqueness remains explicitly conditional on additional model-selection axioms. The remainder of the manuscript is organised as an explicitly documented closure programme built on top of this core. In that closure, a gauge-coded QCA construction, a microscopic benchmark for the transport normalisation, and an electroweak matching convention are combined to produce a resonance-centred Higgs-portal singlet-scalar mass band together with direct-detection, invisible-width, and relic-consistency checks. These latter results are presented as model-dependent consequences of an explicit closure ansatz rather than as deductions from locality alone.", "authors": [ { "name": "Mohamed Sacha", "affiliations": [ "Independent Researcher, Casablanca 20000, Morocco" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-13", "source": "crossref" }, { "doi": "10.3390/quantum8020032", "url": "https://doi.org/10.3390/quantum8020032", "title": "The Informational Economy Functional: A Variational Principle for Decoherence and Classical Emergence", "abstract": "The emergence of classicality through quantum decoherence is commonly described from complementary perspectives emphasizing stability (environment-induced superselection), objectivity (Quantum Darwinism), or physical feasibility (information thermodynamics). In realistic open quantum systems, however, these aspects coexist and compete under finite physical resources. In this work we argue that classical structure selection is most naturally understood as a resource-constrained, multi-objective process. We introduce the Informational Economy Functional (IEF), an effective accounting framework that places loss of distinguishability, energetic dissipation, and the generation of redundantly accessible records on equal footing. The associated Principle of Informational Economy characterizes emergent classical structures as those achieving an optimal compromise among stability, objectivity, and energetic feasibility. Classicality is thus neither maximally stable, nor maximally redundant, nor maximally energy-efficient, but instead reflects a Pareto-optimal balance shaped by environmental constraints. The IEF yields falsifiable predictions concerning pointer-structure variability, redundancy deformation, and resource-sensitive trade-offs, and suggests concrete experimental tests in continuously monitored quantum platforms. Classical reality is thereby reinterpreted as the most economical configuration in which information can stably form, propagate, and persist.", "authors": [ { "name": "Wan Zheng", "affiliations": [ "Independent Researcher, Brisbane 4169, Australia" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-10", "source": "crossref" }, { "doi": "10.3390/quantum8020031", "url": "https://doi.org/10.3390/quantum8020031", "title": "Fixed Spectral Data and the Dynamics of Spacetime Geometry", "abstract": "We identify a fundamental tension between general relativity and spectral geometry arising from the global, nonlocal character of spectral data versus the local causal dynamics of spacetime. To resolve this, we postulate spectral invariance, δΛn=0, requiring the eigenvalues of the Laplace - Beltrami operator to remain fixed under physical evolution. This condition yields a compensatory relation between metric deformations and eigenfunction amplitudes, suggesting a kinematic coupling linking energy distribution to spacetime curvature. From the second variation of the associated energy functional, we derive a rank-4 tensor proportional to the inverse DeWitt supermetric on superspace and a contracted rank-2 tensor proportional to the spacetime metric, and we recover a invariance law of the energy functional in configuration space. Spectral invariance may suggest a framework in which geometry and energy are co-defined through fixed spectral data.", "authors": [ { "name": "Jacob Yan Gurevich", "affiliations": [ "Independent Researcher, Woodbridge, CT 06525, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-08", "source": "crossref" }, { "doi": "10.3390/quantum8020030", "url": "https://doi.org/10.3390/quantum8020030", "title": "QGeo: A Python Package for Calculating Geodesic Control Functions for Quantum Computing", "abstract": "We present a new Python package that uses the formalism of geometric quantum complexity to numerically compute metric-dependent geometric cost and control functions associated with preparing a given unitary transformation on a quantum computer. The numerical procedure we implement is presented and discussed. Analyzed quantum circuits include: the quantum Fourier transform for up to four qubits, a random circuit with depth 100, and a circuit for analyzing the evolution of a fermionic chain with several lattice sites.", "authors": [ { "name": "Sean T. Crowe", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] }, { "name": "Joshua J. Leiter", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] }, { "name": "John P. T. Stenger", "affiliations": [ "U.S. Naval Research Laboratory, Washington, DC 20375, USA" ] }, { "name": "Zachary L. Barvian", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] }, { "name": "Joseph A. Diaz", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] }, { "name": "Shoshana Kinzel", "affiliations": [ "Mathematics Department, San Diego State University, San Diego, CA 92152, USA" ] }, { "name": "Joanna N. Ptasinski", "affiliations": [ "Naval Information Warfare Center Pacific, San Diego, CA 92152, USA" ] }, { "name": "Daniel Gunlycke", "affiliations": [ "U.S. Naval Research Laboratory, Washington, DC 20375, USA" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-04-01", "source": "crossref" }, { "doi": "10.3390/quantum8020028", "url": "https://doi.org/10.3390/quantum8020028", "title": "Optimality of Quantum Adiabatic Search Algorithm and Its Circuit Model", "abstract": "In this paper, we study two aspects of quantum adiabatic evolution for a prototypical search problem: the optimality of the corresponding algorithm and its relation to the quantum circuit model. Firstly, we propose a general framework for proving the square-root speedup of the quantum adiabatic algorithm to be optimal over classical computation, which is readily applicable to the case of multiple targets. Through this framework, we also find that it is possible to further reduce the time complexity by increasing the physical energy of the system, encompassing results from previous works. Secondly, we find that, on the one hand, when the quantum adiabatic algorithm that achieves quadratic speedup is implemented on a quantum circuit, the time slice needed is always consistent with its time complexity, which also encompasses previous results; on the other hand, however, if a further algorithmic improvement is considered, the time slice always remains invariant. This phenomenon represents a significant observation with potential applications. We anticipate that the main results of this paper will interest the quantum adiabatic computation community and may help us to design efficient quantum algorithms for practical problems in the future.", "authors": [ { "name": "Jie Sun", "affiliations": [ "School of Internet, Anhui University, Hefei 230039, China", "National Engineering Research Center of Agro-Ecological Big Data Analysis and Application, Anhui University, Hefei 230601, China" ] }, { "name": "Zhimin Zhang", "affiliations": [ "Department of Electronic Information and Media, Chizhou Vocational and Technical College, Chizhou 247000, China" ] }, { "name": "Songfeng Lu", "affiliations": [ "School of Cyber Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-03-26", "source": "crossref" }, { "doi": "10.3390/quantum8020029", "url": "https://doi.org/10.3390/quantum8020029", "title": "A Derivation of the Entangled State Representation by the Slice Theorem of the Wigner Operator", "abstract": "The Wigner operator’s normal ordering form is deduced by using the method of integration within the ordered product of operators, and the operator’s Weyl ordering symbol is employed. The integration theory within the Weyl ordering product of operators is applied, and the Wigner operator’s Weyl ordering form is deduced. Then, the Wigner operator’s slice theorem is proposed, which helps project and display a new pure-state density operator. Thus, the quantization of classical tomography theory is realized. We illustrate the derivation of the bi- and tri-partite entangled state representations, respectively, which completes the argument.", "authors": [ { "name": "Ke Zhang", "affiliations": [ "School of Electronic Engineering, Huainan Normal University, Huainan 232038, China" ] }, { "name": "Hongyi Fan", "affiliations": [ "Department of Material Science and Engineering, University of Science and Technology of China, Hefei 230026, China" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-03-26", "source": "crossref" }, { "doi": "10.3390/quantum8010027", "url": "https://doi.org/10.3390/quantum8010027", "title": "Coupled-Field Dynamical Relaxation for QUBO and Ising Optimizations", "abstract": "This work presents a classical theoretical framework in which combinatorial optimization emerges from the nonlinear relaxation of coupled real-valued phase fields governed by a global Lyapunov energy functional. Each computational element (CF-bit) evolves in a bistable periodic potential while pairwise interactions encode problem-specific couplings, enabling gradient-descent minimization of QUBO and Ising objective functions. The key contribution is an explicit global energy functional from which all dynamics are derived, guaranteeing monotonic energy descent under damping. This distinguishes the approach from several existing oscillator-based Ising architectures where the governing dynamics contain non-gradient terms and an explicit global Lyapunov functional has not been derived in their standard formulations. Numerical simulations on instances up to 20 bits demonstrate deterministic phase-locking convergence, with optional transient noise improving the exploration of rugged landscapes. While limited in scale and not overcoming NP-hardness, this work provides a conceptual framework showing how discrete optimization can emerge from continuous classical dynamics with a mathematically transparent energy structure.", "authors": [ { "name": "Doron Kwiat", "affiliations": [ "Independent Researcher, Mazkeret Batya 7680400, Israel" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-03-23", "source": "crossref" }, { "doi": "10.3390/quantum8010026", "url": "https://doi.org/10.3390/quantum8010026", "title": "A Technical Review of Quantum Computing Use Cases for Finance and Economics", "abstract": "Quantum computing has been rapidly evolving as a field, with innovations driven by industry, academia, and government institutions. The technology has the potential to accelerate computation for solving complex problems across multiple industrial sectors. Finance and economics, with many problems exhibiting computationally heavy requirements, comprise a high-profile sector where quantum computing could have a significant impact. Therefore, it is important to identify and understand to what extent the technology could find utility in the sector. This technical review is written for quantum applications researchers, quantitative analysts in finance and economics, and researchers in related mathematical sciences. It is divided into two parts: (i) a survey of quantum algorithms pertinent to problems in finance and economics, and (ii) mapping of several use cases in the sector to the potential quantum algorithms presented in part (i). We discuss some challenges on the pathway to achieving quantum advantage. Ultimately, this review aims to be a catalyst for interdisciplinary research that will accelerate the advent of the practical advantages of quantum technologies to solve complex problems in this sector.", "authors": [ { "name": "Manqoba Q. Hlatshwayo", "affiliations": [ "National Quantum Computing Centre, Didcot OX11 0QX, UK" ] }, { "name": "Manav Babel", "affiliations": [ "National Quantum Computing Centre, Didcot OX11 0QX, UK" ] }, { "name": "Dalila Islas-Sanchez", "affiliations": [ "National Quantum Computing Centre, Didcot OX11 0QX, UK" ] }, { "name": "Konstantinos Georgopoulos", "affiliations": [ "National Quantum Computing Centre, Didcot OX11 0QX, UK" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-03-17", "source": "crossref" }, { "doi": "10.3390/quantum8010025", "url": "https://doi.org/10.3390/quantum8010025", "title": "Theory of Spacetime Impedance: A Reactive Framework for the Electromagnetic, Gravitational, and Quantum Structure of the Vacuum", "abstract": "This work presents the Theory of Spacetime Impedance (TSI), a phenomenological framework in which the vacuum is modeled as a distributed reactive medium with an effective RLC structure. At the classical level, the vacuum is characterized by permeability, μ0, permittivity, ε0, and impedance, Z0, so that the speed of light follows from the vacuum’s constitutive reactive properties. The TSI introduces a reactive - dissipative term, RH, as an effective mechanism associated with irreversibility, decoherence, and entropy production, providing a physical basis for the arrow of time. At the quantum level, TSI incorporates a quantum RLC triad associated with the electron, defined by quantum inductance, LK, quantum capacitance, CK, and von Klitzing resistance, RK. When normalized by the Compton wavelength, these quantities admit a direct comparison with μ0 and ε0, identifying the fine-structure constant as an impedance scaling factor between classical and quantum regimes. Within this unified reactive picture, inductive, capacitive, and resistive responses are respectively associated with gravitation, electromagnetism, and thermodynamic irreversibility, offering a complementary bridge across quantum, relativistic, and macroscopic domains.", "authors": [ { "name": "Felipe Bosa", "affiliations": [ "Independent Researcher, Macaé 27943-670, RJ, Brazil" ] } ], "journal": { "id": "quantum-reports", "title": "Quantum Reports", "issn": [ "2624-960X" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms", "general" ], "india_hint": false, "published": "2026-03-16", "source": "crossref" }, { "doi": "10.1103/75k9-hx9k", "url": "https://doi.org/10.1103/75k9-hx9k", "title": "Higgs and Nambu-Goldstone modes in a spin-1 X Y model with long-range interactions", "abstract": "", "authors": [ { "name": "Daiki Kawasaki", "affiliations": [ "Kindai University" ] }, { "name": "Ippei Danshita", "affiliations": [ "Kindai University" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/8dyw-6ktq", "url": "https://doi.org/10.1103/8dyw-6ktq", "title": "Gleason’s theorem for a qubit as part of a composite system", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/p6wv-z621", "url": "https://doi.org/10.1103/p6wv-z621", "title": "Decaying superfluid turbulence near an anomalous nonthermal fixed point", "abstract": "", "authors": [ { "name": "Niklas Rasch", "affiliations": [ "Ruprecht-Karls-Universität Heidelberg" ] }, { "name": "Thomas Gasenzer", "affiliations": [ "Ruprecht-Karls-Universität Heidelberg", "Ruprecht-Karls-Universität Heidelberg" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/qlw3-xk2f", "url": "https://doi.org/10.1103/qlw3-xk2f", "title": "Comparison of spin-qubit architectures for quantum error-correcting codes", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/7pv5-46nd", "url": "https://doi.org/10.1103/7pv5-46nd", "title": "Weakly fault-tolerant computation in a quantum error-detecting code", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/zqv6-25kh", "url": "https://doi.org/10.1103/zqv6-25kh", "title": "Non-Hermitian cavity magnomechanics with -symmetry-related asymmetric transparency", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/dhq3-wcd7", "url": "https://doi.org/10.1103/dhq3-wcd7", "title": "Application and quantum properties of superpositions of oppositely squeezed states", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/sbdv-ql64", "url": "https://doi.org/10.1103/sbdv-ql64", "title": "Entanglement recovery by reversing the effect of noise in a quantum repeater", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/kmnp-11ch", "url": "https://doi.org/10.1103/kmnp-11ch", "title": "Two-stage quantum estimation and asymptotics of quantum-enhanced transmittance sensing", "abstract": "", "authors": [ { "name": "Zihao Gong", "affiliations": [ "University of Arizona" ] }, { "name": "Boulat A. Bash", "affiliations": [ "University of Arizona" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/728x-xlc9", "url": "https://doi.org/10.1103/728x-xlc9", "title": "Optical echoes of light near an analog black hole", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/rvqx-sj4y", "url": "https://doi.org/10.1103/rvqx-sj4y", "title": "Analytical universal antiproton-atom interaction potential", "abstract": "", "authors": [ { "name": "A. Kuni", "affiliations": [ "University of Helsinki" ] }, { "name": "K. Nordlund", "affiliations": [ "University of Helsinki" ] }, { "name": "F. Granberg", "affiliations": [ "University of Helsinki" ] }, { "name": "D. Sundholm", "affiliations": [ "University of Helsinki" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/zghk-q3jm", "url": "https://doi.org/10.1103/zghk-q3jm", "title": "Isolating continuum electron dynamics in RABBITT-like mainbands", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/tnzb-1r5f", "url": "https://doi.org/10.1103/tnzb-1r5f", "title": "Engineering sub-Poissonian squeezed magnons by dissipative coupling in giant-atom-coupled waveguide magnonics", "abstract": "", "authors": [ { "name": "Yaqi Fan", "affiliations": [ "Huazhong University of Science and Technology" ] }, { "name": "Jiahua Li", "affiliations": [ "Huazhong University of Science and Technology" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/1t87-xvvp", "url": "https://doi.org/10.1103/1t87-xvvp", "title": "First-principles analytic predictions for strongly coupled Fermi liquids", "abstract": "", "authors": [ { "name": "Shashin Pavaskar", "affiliations": [ "University of Illinois at Urbana-Champaign" ] }, { "name": "Ira Z. Rothstein", "affiliations": [ "Carnegie Mellon University" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/51rv-8r7g", "url": "https://doi.org/10.1103/51rv-8r7g", "title": "Light-induced nonadiabatic photodissociation of the NaH molecule including electron-rotation coupling", "abstract": "", "authors": [ { "name": "Zoltán Király", "affiliations": [ "University of Debrecen" ] }, { "name": "Otabek Umarov", "affiliations": [ "Kimyo International University in Tashkent" ] }, { "name": "Csaba Fábri", "affiliations": [ "University of Debrecen" ] }, { "name": "Gábor J. Halász", "affiliations": [ "University of Debrecen" ] }, { "name": "Attila Tóth", "affiliations": [ "ELI ALPS" ] }, { "name": "Ágnes Vibók", "affiliations": [ "University of Debrecen", "ELI ALPS" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/r33m-v1kn", "url": "https://doi.org/10.1103/r33m-v1kn", "title": "Demonstration of an interferometric technique for measuring vacuum magnetic birefringence with an optical cavity", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/y4v3-yn6v", "url": "https://doi.org/10.1103/y4v3-yn6v", "title": "Tunable bundle emissions of n -phonon and photon-phonon pairs via the Barnett effect", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/yb4y-lwzm", "url": "https://doi.org/10.1103/yb4y-lwzm", "title": "Dissipative time crystal in a thermal Rydberg gas based on microwave dressing", "abstract": "", "authors": [ { "name": "Lianglong Wu", "affiliations": [ "Xi'an Jiaotong University" ] }, { "name": "Mengzhuo Xiao", "affiliations": [ "Xi'an Jiaotong University" ] }, { "name": "Yinuo Xu", "affiliations": [ "Xi'an Jiaotong University" ] }, { "name": "Haixia Chen", "affiliations": [ "Xi'an Jiaotong University" ] }, { "name": "Dong Wei", "affiliations": [ "Xi'an Jiaotong University" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/m5lx-xbjp", "url": "https://doi.org/10.1103/m5lx-xbjp", "title": "Magnetic ring dark solitons in a spin-orbital-angular-momentum coupled Fermi superfluid", "abstract": "", "authors": [ { "name": "Liu-Yang Cheng", "affiliations": [ "Innovation Academy for Precision Measurement Science and Technology, Chinese Academy of Sciences", "University of Chinese Academy of Sciences" ] }, { "name": "Hao-Xuan Sun", "affiliations": [ "Qingdao University" ] }, { "name": "Peng Zou", "affiliations": [ "Qingdao University" ] }, { "name": "Shi-Guo Peng", "affiliations": [ "Innovation Academy for Precision Measurement Science and Technology, Chinese Academy of Sciences", "Hainan University", "Hainan University" ] }, { "name": "Kaijun Jiang", "affiliations": [ "Innovation Academy for Precision Measurement Science and Technology, Chinese Academy of Sciences", "Wuhan Institute of Quantum Technology" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/l82n-rzw3", "url": "https://doi.org/10.1103/l82n-rzw3", "title": "Fragility of optimal measurements due to noise in probe states for quantum sensing", "abstract": "", "authors": [ { "name": "Andrew Kolmer Forbes", "affiliations": [ "University of New Mexico" ] }, { "name": "Marco A. Rodríguez-García", "affiliations": [ "University of New Mexico", "University of Calgary", "AB T2N 1N4" ] }, { "name": "Ivan H. Deutsch", "affiliations": [ "University of New Mexico" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/xj95-8f3r", "url": "https://doi.org/10.1103/xj95-8f3r", "title": "Hexapartite active nonlinear feedback control in four-wave mixing with a spatially structured pump", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/wplp-r6xb", "url": "https://doi.org/10.1103/wplp-r6xb", "title": "Entanglement dynamics of separable squeezed states in finite-memory structured reservoir", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/8wzh-jk9z", "url": "https://doi.org/10.1103/8wzh-jk9z", "title": "Hybrid quantum memory leveraging slow light and gradient echo duality", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/d345-62yg", "url": "https://doi.org/10.1103/d345-62yg", "title": "Sub-Doppler cooling of bosonic strontium in a two-color magneto-optical trap", "abstract": "", "authors": [ { "name": "Milán János Negyedi", "affiliations": [ "Eberhard Karls Universität Tübingen" ] }, { "name": "Shubha Deutschle", "affiliations": [ "Eberhard Karls Universität Tübingen" ] }, { "name": "Florian Jessen", "affiliations": [ "Eberhard Karls Universität Tübingen" ] }, { "name": "József Fortágh", "affiliations": [ "Eberhard Karls Universität Tübingen" ] }, { "name": "Lőrinc Sárkány", "affiliations": [ "Eberhard Karls Universität Tübingen" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/c4nd-xh93", "url": "https://doi.org/10.1103/c4nd-xh93", "title": "Rethinking collapse: Quasi-bistochastic coupling between qubits and classical registers", "abstract": "", "authors": [ { "name": "Dagomir Kaszlikowski", "affiliations": [ "Centre for Quantum Technologies", "National University of Singapore" ] }, { "name": "Paweł Kurzyński", "affiliations": [ "Adam Mickiewicz University" ] } ], "journal": { "id": "pra", "title": "Physical Review A", "issn": [ "1050-2947", "2469-9926" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "simulation", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/n754-npwy", "url": "https://doi.org/10.1103/n754-npwy", "title": "Compositional disorder in a multicomponent nonreciprocal mixture: Stability and patterns", "abstract": "In passive phase-separating mixtures, the average density of each component can be tuned to control the composition of the coexisting bulk phases. This concept extends to active systems. For example, in a nonreciprocal mixture of two species, changing the average density of either species alters the qualitative nature of the traveling patterns that emerge in the steady state. In this paper, we build on the existing framework of the multispecies nonreciprocal Cahn-Hilliard model to examine the influence of compositional disorder in a multicomponent active system. Specifically, we allow each scalar field in the mixture to have a distinct average density and analyze the implications of this generalized setting. Focusing on ensembles of systems in which the interspecies interaction coefficients and the average densities of each species are both sampled from probability distributions, we show that nonreciprocity stabilizes the uniformly mixed state, even in the presence of compositional disorder, when compared to the corresponding reciprocal system. Using random matrix theory, a general condition for the onset of the spinodal instability is derived and verified through simulations. Finally, the connection between the statistics of the most unstable eigenvalue and the emergent nonlinear dynamics is illustrated.", "authors": [ { "name": "Laya Parkavousi", "affiliations": [ "Max Planck Institute for Dynamics and Self-Organization" ] }, { "name": "Suropriya Saha", "affiliations": [ "Max Planck Institute for Dynamics and Self-Organization" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/2pd6-j1xf", "url": "https://doi.org/10.1103/2pd6-j1xf", "title": "Impossibility of quantum private queries", "abstract": "Symmetric private information retrieval is a cryptographic task allowing a user to query a database and obtain exactly one entry without revealing to the owner of the database which element was accessed. The task is a variant of general two-party protocols called and is closely related to oblivious transfer. Under the name , quantum protocols have been proposed to solve this problem in a cheat-sensitive way: In such protocols, it is not impossible for dishonest participants to cheat, but they risk detection [Giovannetti , ]. We give an explicit attack against any cheat-sensitive symmetric private information retrieval protocol, showing that any protocol that is secure for the user cannot have nontrivial security guarantees for the owner of the database: The user is even able to retrieve the database.", "authors": [ { "name": "Esther Hänggi", "affiliations": [ "Lucerne University of Applied Sciences and Arts" ] }, { "name": "Severin Winkler", "affiliations": [ "Ergon Informatik AG" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/g274-2kj3", "url": "https://doi.org/10.1103/g274-2kj3", "title": "Berry-Phase-Induced Canonical Structure of Quantum Fluctuations Across the Mott-Superfluid Phase Diagram", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/9mnc-ddvw", "url": "https://doi.org/10.1103/9mnc-ddvw", "title": "Three-dimensional and selective displacement sensing of a levitated nanoparticle via spatial mode decomposition", "abstract": "We propose and experimentally demonstrate a detection method that significantly improves the precision of real-time measurement of the three-dimensional (3D) displacement of a levitated dipolar scatterer. Our technique relies on spatial mode sorting of the light scattered by the levitated object, allowing us to selectively extract the position information of all translational degrees of freedom with minimal losses. To this end, we collect all the light backscattered from a levitated nanoparticle using a parabolic mirror and couple it into a spatial mode sorter. We measure displacement sensitivities ( S imp , x , S imp , y , S imp , z ) = ( 1.7 , 2.4 , 1.0 ) × 10 − 14 m / Hz below the zero-point motion ( x zpm , y zpm , z zpm ) = ( 2.2 , 2.4 , 1.6 ) × 10 − 12 m of the levitated particle considered here. In the regime where environmental decoherence is not limited by gas collision, we estimate that our method can reach measurement efficiencies of ( η tot x , η tot y , η tot z ) = ( 0.13 , 0.18 , 0.33 ) > 1 9 , which would enable the 3D motional quantum ground state of a levitated optomechanical system.", "authors": [ { "name": "Thomas J. Dinter", "affiliations": [ "Macquarie University" ] }, { "name": "Reece Roberts", "affiliations": [ "Macquarie University", "ARC Centre for Engineered Quantum Systems (EQUS)", "Macquarie University" ] }, { "name": "Thomas Volz", "affiliations": [ "Macquarie University", "ARC Centre for Engineered Quantum Systems (EQUS)", "Macquarie University" ] }, { "name": "Mikolaj K. Schmidt", "affiliations": [ "Macquarie University", "ARC Centre for Engineered Quantum Systems (EQUS)", "Macquarie University" ] }, { "name": "Cyril Laplane", "affiliations": [ "Macquarie University", "ARC Centre for Engineered Quantum Systems (EQUS)", "Macquarie University", "Sydney Quantum Academy" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/s3kr-3dlk", "url": "https://doi.org/10.1103/s3kr-3dlk", "title": "Substrate properties and actin polymerization speed dictate universal modes of cell migration: Gripping, slipping, and stick-slip", "abstract": "Understanding how cells sense mechanical cues and regulate migration is crucial in the development, fibrosis, and oncogenesis processes. However, a comprehensive physical picture of cell migration remains lacking, given the diverse environmental properties and cell physiologies. Here, we generalize the motor-clutch model to the whole-cell level and systematically investigate the effects of substrate stiffness, friction, and actin polymerization speed on cell migration. We unveil three distinct migration modes: gripping, slipping, and stick-slip. Notably, stiffness sensing occurs exclusively in the stick-slip mode, which requires a low substrate stiffness and a minimum actin polymerization speed as necessary conditions. Intriguingly, the optimal substrate stiffness that maximizes the migration speed is inversely proportional to the actin polymerization speed. Moreover, the maximal speed only depends on the nature of the clutch molecules, independent of substrate properties. We reveal the boundary criteria among the three migration modes and demonstrate that fast- and slow-migrating cells can coexist in an isogenic cell population without the need for biochemical feedback loops.", "authors": [ { "name": "Yiyang Ye", "affiliations": [ "Peking University" ] }, { "name": "Jie Lin", "affiliations": [ "Peking University", "Peking University" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/v99p-dn22", "url": "https://doi.org/10.1103/v99p-dn22", "title": "Quantum optical electron pulse shaper", "abstract": "Coherent control of ultrafast quantum phenomena benefits from pulse-shaping capabilities allowing to modulate the envelope and instantaneous phase of optical fields on femtosecond timescales. While such control is available for optical fields, an analogy of a pulse shaper for freely propagating electrons is lacking. In this study, we theoretically demonstrate a method that enables near-arbitrary light-based shaping of electron wave packets in the time domain. The method is based on the quantum phase modulation of electron waves by coherent light with time-dependent frequency leading to generation of spectrally separated electron energy sidebands with shaped time-energy profiles and envelopes. Our results show that few-femtosecond time durations can be achieved without additional spectral broadening of the electron wave packet, allowing one to reach the combination of high time, spatial, and spectral resolutions in ultrafast imaging and diffraction experiments with pulsed electron beams.", "authors": [ { "name": "Neli Laštovičková Streshkova", "affiliations": [ "Charles University" ] }, { "name": "Martin Kozák", "affiliations": [ "Charles University" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/wbbt-w9nm", "url": "https://doi.org/10.1103/wbbt-w9nm", "title": "Shaping boundaries to control and transport topological defects in colloidal nematic liquid crystals", "abstract": "Anisotropic rodlike particles form liquid crystalline phases with varying degrees of orientational and translational order. When confined geometrically, these phases can give rise to topological defects, which can be selected and controlled by tuning how the rods align near boundaries, known as anchoring. While anchoring in molecular liquid crystals can be controlled through surface functionalization, this approach is not easily applicable to microscale colloidal systems, which have so far been limited to planar anchoring. Here, using particle-based simulations, Landaude Gennes theory, and experiments on colloidal rods, we demonstrate that topographical patterning of the boundary can effectively control the anchoring type and, in turn, the defect state in two-dimensional confined nematics. Building on this, we numerically predict that dynamically shape shifting the boundaries can transform and transport topological defects.", "authors": [ { "name": "Gerardo Campos-Villalobos", "affiliations": [ "Utrecht University", "ISC", "Sapienza University of Rome" ] }, { "name": "André F. V. Matias", "affiliations": [ "Utrecht University" ] }, { "name": "Ethan I. L. Jull", "affiliations": [ "Utrecht University" ] }, { "name": "Lisa Tran", "affiliations": [ "Utrecht University" ] }, { "name": "Marjolein Dijkstra", "affiliations": [ "Utrecht University" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/hlbf-5llp", "url": "https://doi.org/10.1103/hlbf-5llp", "title": "Strongly correlated physics in organic open-shell quantum systems", "abstract": "Strongly correlated physics arises from electron-electron scattering within partially filled orbitals. Organic molecules in open-shell configurations are therefore good candidates to exhibit many-body effects. We focus on electron transport in a two-terminal single-molecule junction setup, in which the molecular bridge consists of an organic radical with a molecular orbital hosting a single unpaired electron [singly occupied molecular orbital (SOMO)]. We perform beyond state-of-the-art numerical simulations combining an description of the chemical environment with quantum field-theoretical techniques that account for many-body effects. The key observation is that the SOMO resonance is prone to splitting, and we identify a electronic scattering rate as the driving many-body mechanism, akin to that of the Mott metal-to-insulator transition. By comparing linear and cyclic radicals, we show that the spatial distribution of the SOMO and its projection on the molecular backbone have dramatic consequences for the transport properties of the junction. We argue that the phenomenon and the underlying microscopic mechanism apply to a broad family of open-shell molecular systems, and can explain puzzling experimental observations such as suppressed conductance in radical junctions.", "authors": [ { "name": "G. Gandus", "affiliations": [ "ETH Zürich" ] }, { "name": "A. Jayaraj", "affiliations": [ "Swiss Federal Laboratories for Materials Science and Technology" ] }, { "name": "D. Passerone", "affiliations": [ "Swiss Federal Laboratories for Materials Science and Technology" ] }, { "name": "R. Stadler", "affiliations": [ "Vienna University of Technology" ] }, { "name": "M. Luisier", "affiliations": [ "ETH Zürich" ] }, { "name": "A. Valli", "affiliations": [ "Budapest University of Technology and Economics", "Budapest University of Technology and Economics" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/lpqj-7hyg", "url": "https://doi.org/10.1103/lpqj-7hyg", "title": "Machine learning-guided discovery of kagome superconductors YRu 3 B 2 and LuRu 3 B 2", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/vpwx-zp92", "url": "https://doi.org/10.1103/vpwx-zp92", "title": "Erratum: Electron beams traversing spherical nanoparticles: Analytic and numerical treatment [Phys. Rev. Research 6 , 013239 (2024)]", "abstract": "", "authors": [ { "name": "P. Elli Stamatopoulou", "affiliations": [] }, { "name": "Wenhua Zhao", "affiliations": [] }, { "name": "Álvaro Rodríguez Echarri", "affiliations": [] }, { "name": "N. Asger Mortensen", "affiliations": [] }, { "name": "Kurt Busch", "affiliations": [] }, { "name": "Christos Tserkezis", "affiliations": [] }, { "name": "Christian Wolff", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/l9wk-v25v", "url": "https://doi.org/10.1103/l9wk-v25v", "title": "Symmetry and self-bound droplets in dipolar molecular gases", "abstract": "Recent experiments with degenerate molecular gases dressed by elliptically polarized microwave fields have enabled new control of dipolar interactions via engineered anisotropy. We reveal a symmetry structure of the dipolar interaction that generates degeneracies among the interaction parameters, enabling a classification of spatial symmetries and equilibrium shapes of the gases. Exploiting these symmetries, we analyze solutions including beyond-mean-field quantum fluctuations in the dilute gas regime and develop a complementary variational theory. We map out the phase diagram of self-bound droplets and characterize their widths, energies, and densities.", "authors": [ { "name": "D. Baillie", "affiliations": [ "Dodd-Walls Centre for Photonic and Quantum Technologies", "University of Otago" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/4cg9-fzpp", "url": "https://doi.org/10.1103/4cg9-fzpp", "title": "Taxonomy of prediction", "abstract": "A prediction makes a claim about a system's future given knowledge of its past. A retrodiction makes a claim about its past given knowledge of its future. The bidirectional machine is an ambidextrous hidden Markov chain that does both optimally by making explicit in its state structure all statistical correlations in a stochastic process. We introduce an informational taxonomy to profile these correlations via a suite of multivariate information measures. While prior results laid out the different kinds of information contained in isolated measurements, the associated informations were challenging to calculate explicitly. Overcoming this via bidirectional machine states, we expand that analysis to prediction and retrodiction. The result highlights fourteen interpretable and calculable measures that characterize a process's informational structure. In addition, we introduce a labeling and indexing scheme that systematizes information-theoretic analyses of complex multivariate systems. Operationalizing this, we provide algorithms to directly calculate all of these quantities in closed form for finitely modeled processes.", "authors": [ { "name": "Alexandra Jurgens", "affiliations": [ "Inria - Bordeaux Sud Ouest" ] }, { "name": "James P. Crutchfield", "affiliations": [ "University of California at Davis" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/ns4h-tg99", "url": "https://doi.org/10.1103/ns4h-tg99", "title": "Experimental observations of cluster synchronization in a biologically inspired neuronal network of chaotic electronic oscillators", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/qsl5-cyq2", "url": "https://doi.org/10.1103/qsl5-cyq2", "title": "Learning minimal representations of fermionic ground states", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/hsh2-1ldl", "url": "https://doi.org/10.1103/hsh2-1ldl", "title": "From evolutionarily stable states to ecoevolutionary metastability in evolutionary games with internal mixed equilibrium", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/prj4-9vk7", "url": "https://doi.org/10.1103/prj4-9vk7", "title": "Polarization symmetry as a signature of Bell states in Compton scattering", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/qx7q-s6f4", "url": "https://doi.org/10.1103/qx7q-s6f4", "title": "Influence of excitation energy on microscopic quantum pathways for ultrafast charge transfer in van der Waals heterostructures", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/5s3j-scll", "url": "https://doi.org/10.1103/5s3j-scll", "title": "Optimal parametric control of transport across a Josephson junction", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/qqlf-d531", "url": "https://doi.org/10.1103/qqlf-d531", "title": "General spin models from noncollinear spin density functional theory and spin-cluster expansion", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/q36y-6jqn", "url": "https://doi.org/10.1103/q36y-6jqn", "title": "Collider-quality electron bunches from an all-optical plasma photoinjector", "abstract": "We present an approach for generating collider-quality electron bunches using a plasma photoinjector. The approach leverages recently developed techniques for the spatiotemporal control of laser pulses to produce a moving ionization front in a nonlinear plasma wave. The moving ionization front generates an electron bunch with a current profile that balances the longitudinal electric field of an electron beam-driven plasma wave, creating a uniform accelerating field across the bunch. Particle-in-cell (PIC) simulations of the ionization stage show the formation of an electron bunch with 220 pC charge and low emittance ( ɛ x = 171 nm rad, ɛ y = 76 nm rad). Quasistatic PIC simulations of the acceleration stage show that the bunch is efficiently accelerated to 24 GeV over 2 m with a final energy spread of less than 1% and emittances of ɛ x = 189 nm rad and ɛ y = 80 nm rad. This high-quality electron bunch meets the requirements outlined by the Snowmass process for intermediate-energy colliders and compares favorably to the beam quality of proposed and existing accelerator facilities. The results establish the feasibility of plasma photoinjectors for future collider applications making a significant step toward the realization of high-luminosity, compact accelerators for particle physics research.", "authors": [ { "name": "Arohi Jain", "affiliations": [ "Stony Brook University" ] }, { "name": "Jiayang Yan", "affiliations": [ "Stony Brook University" ] }, { "name": "Jacob R. Pierce", "affiliations": [ "University of California, Los Angeles" ] }, { "name": "Tanner T. Simpson", "affiliations": [ "University of Rochester" ] }, { "name": "Mikhail Polyanskiy", "affiliations": [ "Accelerator Test Facility" ] }, { "name": "William Li", "affiliations": [ "Accelerator Test Facility" ] }, { "name": "Marcus Babzien", "affiliations": [ "Accelerator Test Facility" ] }, { "name": "Mark Palmer", "affiliations": [ "Accelerator Test Facility" ] }, { "name": "Michael Downer", "affiliations": [ "University of Texas at Austin" ] }, { "name": "Roman Samulyak", "affiliations": [ "Stony Brook University" ] }, { "name": "Chan Joshi", "affiliations": [ "University of California, Los Angeles" ] }, { "name": "Warren B. Mori", "affiliations": [ "University of California, Los Angeles" ] }, { "name": "John P. Palastro", "affiliations": [ "University of Rochester" ] }, { "name": "Navid Vafaei-Najafabadi", "affiliations": [ "Stony Brook University" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/wdpy-jxm9", "url": "https://doi.org/10.1103/wdpy-jxm9", "title": "Complete inelastic transparency of time-modulated resonant photonic circuits", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/t29c-cm3b", "url": "https://doi.org/10.1103/t29c-cm3b", "title": "Reversible optical nonreciprocity and its scaling optimization in cold atoms via coherently induced four-wave mixing", "abstract": "We present a further investigation on the optical nonreciprocity based on four-wave mixing (FWM) by leveraging coherently driven cold atoms, as a beneficial supplement to the usual cavity-waveguide solution in virtue of the on-demand tunability and broadband advantage. We consider two parameter regimes unexplored yet, where the probe and coupling fields are set with vanishing or large detunings while the dressing field is kept on resonance. Numerical results reveal that the forward (backward) probe exhibits a high transmittance (is strongly absorbed) in the resonant regime, but may be largely converted into an FWM field (propagate almost freely) in the far-detuned regime. The optimization of such a reversible unidirectional transmission featured by large isolation ratios and low insertion losses can be attained only when the coupling and dressing fields fulfill different scaling relations in amplitude, which has been well explained via analytical results. It is also viable to achieve reversible unidirectional transmission for a probe field of fixed large detunings by simply tuning the coupling field in a wide spectral range. Our findings provide additional insights into the FWM-based optical nonreciprocity and may enable more powerful unidirectional devices in quantum networks.", "authors": [ { "name": "Tian-Yun Chen", "affiliations": [ "Northeast Normal University" ] }, { "name": "Jin-Hui Wu", "affiliations": [ "Northeast Normal University" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/78tf-57jf", "url": "https://doi.org/10.1103/78tf-57jf", "title": "Teleportation-based squeezer for bosonic cluster states", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/ykfh-cdzk", "url": "https://doi.org/10.1103/ykfh-cdzk", "title": "Estimating orbital parameters of direct imaging exoplanet using neural networks", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/mnbm-3g56", "url": "https://doi.org/10.1103/mnbm-3g56", "title": "Online learning of eddy-viscosity and backscattering closures for geophysical turbulence using ensemble Kalman inversion", "abstract": "Physical Review Different approaches to using data-driven methods for subgrid-scale closure modeling of geophysical turbulence have emerged recently. Most of these approaches are data hungry and lack interpretability and out-of-distribution generalizability. Here, we use a hybrid approach that combines turbulence theory, physics-based modeling, and data-driven methods to overcome these challenges. Specifically, we address the parametric uncertainty of well-known physics-based large-eddy simulation (LES) closures: the Smagorinsky (Smag) and Leith eddy-viscosity models (one free parameter) and the Jansen-Held (JH) backscattering model (two free parameters). For various cases of two-dimensional turbulence, optimal parameters are first learned online from data via ensemble Kalman inversion (EKI), such that for each case, the LES energy spectrum matches that of direct numerical simulation (DNS). We quantify the uncertainties on these parameters using a modern machine-learning-accelerated Bayesian workflow, “, , ” Only a small training dataset is needed (to calculate the DNS spectra); i.e., the approach is data-efficient. We find the optimized parameter(s) and their associated uncertainty for each closure to be constant across broad flow regimes that differ in dominant length scales, eddy/jet structures, and dynamics, suggesting that these closures are generalizable. Next, we show that the online learned constants agree with the predictions of a recent semianalytical derivation, providing further interpretability. In both and tests that include examining the extreme events, LES with optimized closures, especially with JH, outperforms the baselines (LES with standard Smag, dynamic Smag, or Leith). This work shows the promise of combining advances in theory, physics-based modeling (e.g., JH), and data-driven modeling (e.g., online learning with EKI) to develop data-efficient frameworks for accurate, interpretable, and generalizable closures for geophysical turbulence, with ultimate applications in weather and climate prediction.", "authors": [ { "name": "Yifei Guan", "affiliations": [ "Union College", "University of Chicago" ] }, { "name": "Pedram Hassanzadeh", "affiliations": [ "University of Chicago" ] }, { "name": "Tapio Schneider", "affiliations": [ "California Institute of Technology" ] }, { "name": "Oliver Dunbar", "affiliations": [ "California Institute of Technology" ] }, { "name": "Daniel Zhengyu Huang", "affiliations": [ "Peking University" ] }, { "name": "Jinlong Wu", "affiliations": [ "University of Wisconsin - Madison" ] }, { "name": "Ignacio Lopez-Gomez", "affiliations": [ "Google Research" ] } ], "journal": { "id": "prresearch", "title": "Physical Review Research", "issn": [ "2643-1564" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "algorithms", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/766t-tqsy", "url": "https://doi.org/10.1103/766t-tqsy", "title": "Super-resonance: Breaking the Bandwidth Limit of Resonant Modes and Its Application to Flow Control", "abstract": "We report the discovery of super-resonance - a new regime of resonant behavior in which a mode’s out-of-phase response persists far beyond its classical bandwidth. This effect emerges from a coiled phononic structure composed of a locally resonant elastic metamaterial and architected to support multiple internal energy pathways. These pathways converge at an effectively single spatial location, enabling extended modal dominance and significantly broadening the frequency range over which a resonant phase is sustained. We demonstrate by direct numerical simulations the implications of this mechanism in the context of flow instability control, where current approaches are inherently constrained by the characteristically narrow spectral bandwidth of conventional resonances. Using a super-resonant phononic subsurface structure interfacing with a channel flow, we show passive simultaneous suppression of four unstable flow perturbations across a frequency range more than 5 times wider than that is attainable with a standard resonance in an equivalent uncoiled structure. By enabling broadband control of flow instabilities, super-resonance overcomes a long-standing limitation in laminar flow control strategies. More broadly, it introduces a powerful new tool for phase-engineered wave-matter interaction. The ability to preserve out-of-phase modal response across wide spectral ranges establishes a fundamental advance in the physics of resonance, with far-reaching implications for suppressing fully developed turbulent flows and beyond.", "authors": [ { "name": "Adam R. Harris", "affiliations": [ "University of Colorado Boulder", "University of Colorado Boulder" ] }, { "name": "Armin Kianfar", "affiliations": [ "University of Colorado Boulder" ] }, { "name": "David Roca", "affiliations": [ "Universitat Politècnica de Catalunya" ] }, { "name": "Daniel Yago", "affiliations": [ "Universitat Politècnica de Catalunya" ] }, { "name": "Christoph Brehm", "affiliations": [ "University of Maryland, College Park" ] }, { "name": "Mahmoud I. Hussein", "affiliations": [ "University of Colorado Boulder", "University of Colorado Boulder", "University of Colorado Boulder" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/79h2-36r3", "url": "https://doi.org/10.1103/79h2-36r3", "title": "High-dimensional dynamics in low-dimensional networks", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/4488-tqfp", "url": "https://doi.org/10.1103/4488-tqfp", "title": "Non-Hermitian Bethe-Salpeter equation for open systems: Emergence of exceptional points in excitonic spectra from first principles", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/xs7g-dmn8", "url": "https://doi.org/10.1103/xs7g-dmn8", "title": "Anyon Superfluidity of Excitons in Quantum Hall Bilayers", "abstract": "The charged anyons of a fractional quantum Hall fluid are necessarily dispersionless due to the continuous magnetic translation symmetry. Neutral anyons, however, can disperse, resulting in a much richer space of possible “daughter” states when doped to finite density. We discuss a natural realization of such physics in quantum Hall bilayers, where a finite density of excitons with fractional statistics is argued to give rise to “anyonic exciton superfluidity,” the charge-neutral analog of anyon superconductivity. In a balanced bilayer of two Laughlin ν = 1 / 3 states, the minimal interlayer exciton carries anyonic exchange statistics. A finite density of these excitons is argued to yield an exciton superfluid stitched to a specific bulk topological order and edge spectrum. Such a superfluidity should be most robust near the direct transition into the Halperin (112) state, and near analogous transitions in the bilayer Jain sequence at total filling ν T = 2 × [ n / ( 2 n + 1 ) ] . These topological transitions can be described by Chern-Simons QED 3 , from which we derive several novel and general properties of anyon superfluidity near such transitions, including an anomalously large superfluid stiffness of κ s ∝ | δ ν | 1 / 2 at layer imbalance fraction δ ν . A notable feature of the phase diagrams we construct is the prevalence of spatial symmetry breaking driven by an underlying composite Fermi surface. Our results can be directly tested with currently available experimental techniques. We compare our theory with existing data and make concrete predictions for future measurements, including higher-pseudospin exciton superfluids when doping higher Jain fractions.", "authors": [ { "name": "Zhaoyu Han", "affiliations": [ "Harvard University" ] }, { "name": "Taige Wang", "affiliations": [ "University of California" ] }, { "name": "Zhihuan Dong", "affiliations": [ "University of California" ] }, { "name": "Michael P. Zaletel", "affiliations": [ "University of California" ] }, { "name": "Ashvin Vishwanath", "affiliations": [ "Harvard University" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/515g-qjq8", "url": "https://doi.org/10.1103/515g-qjq8", "title": "Identifying geometric Third-order nonlinear transport in disordered materials", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1103/xl5f-zj9p", "url": "https://doi.org/10.1103/xl5f-zj9p", "title": "Three-Dimensional XY Universality and Nonlinear Magnetic Susceptibility in a Kagome Ice Compound", "abstract": "Kagome spin ice is an intriguing class of spin systems constituted by in-plane Ising spins with ferromagnetic interaction residing on the kagome lattice, theoretically predicted to host a plethora of magnetic transitions and excitations. In particular, different variants of kagome spin ice models can exhibit different sequences of symmetry breaking upon cooling from the paramagnetic to the fully ordered ground state. Recently, it has been demonstrated that the frustrated intermetallic HoAgGe stands as a faithful solid-state realization of kagome spin ice. However, whether any of the established symmetry-breaking pathways apply to this material remains unaddressed. Here, we use single-crystal neutron diffuse scattering to map the spin ordering of HoAgGe at various temperatures more accurately; surprisingly, we find that the ordering sequence appears to be different from previously known scenarios: From the paramagnetic state, the system first enters a partially ordered state with fluctuating magnetic charges, in contrast to a charge-ordered paramagnetic phase, before reaching the fully ordered state. Through Monte Carlo simulations and scaling analyses using an extended three-dimensional (3D) spin model for the distorted kagome spin ice in HoAgGe, we elucidate a single 3D XY phase transition into the ground state with broken time-reversal symmetry (TRS). However, the 3D XY transition has a long crossover tail before the fluctuating magnetic charges fully order. More interestingly, we find, both experimentally and theoretically, that the TRS-breaking phase of HoAgGe features an unusual, hysteretic response: Despite their vanishing magnetization, the two time-reversal partners are distinguished and selected by a nonlinear magnetic susceptibility tied to the kagome ice rule. Our discovery not only unveils a new symmetry-breaking hierarchy of kagome spin ice but also demonstrates the potential of TRS-breaking frustrated spin systems for information technology applications.", "authors": [ { "name": "Kan Zhao", "affiliations": [ "Beihang University", "University of Augsburg" ] }, { "name": "Hao Deng", "affiliations": [ "ShanghaiTech University", "ShanghaiTech University", "Institute of Crystallography", "RWTH Aachen University" ] }, { "name": "Hua Chen", "affiliations": [ "Colorado State University", "Colorado State University" ] }, { "name": "Nvsen Ma", "affiliations": [ "Beihang University" ] }, { "name": "Noah Oefele", "affiliations": [ "University of Augsburg" ] }, { "name": "Jiesen Guo", "affiliations": [ "Beihang University" ] }, { "name": "Xueling Cui", "affiliations": [ "Beihang University" ] }, { "name": "Chen Tang", "affiliations": [ "Beihang University" ] }, { "name": "Matthias J. Gutmann", "affiliations": [ "Rutherford Appleton Laboratory" ] }, { "name": "Thomas Mueller", "affiliations": [ "Forshungszentrum Jülich GmbH" ] }, { "name": "Yixi Su", "affiliations": [ "Forshungszentrum Jülich GmbH" ] }, { "name": "Vladimir Hutanu", "affiliations": [ "Institute of Crystallography", "RWTH Aachen University" ] }, { "name": "Changqing Jin", "affiliations": [ "Chinese Academy of Sciences", "University of Chinese Academy of Sciences" ] }, { "name": "Philipp Gegenwart", "affiliations": [ "University of Augsburg" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1103/xnqc-q6nt", "url": "https://doi.org/10.1103/xnqc-q6nt", "title": "Agentic exploration of physics models", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1103/nvbm-97vs", "url": "https://doi.org/10.1103/nvbm-97vs", "title": "Passive Quantum Error Correction of Photon Loss at Breakeven", "abstract": "Physical qubits in a quantum computer are often represented by superposition states of single particles or excitations. Decay of the excitation itself is a fundamental error channel that is difficult to overcome via external drive or control techniques. Quantum error correcting codes, which encode information in superpositions involving multiple excitations, provide a path to preserve information beyond the capacity of individual excitations, but typically require exquisite active operations on the system. Here, we demonstrate a steady-state driven-dissipative quantum system, composed of a superconducting cavity and a transmon ancilla, that preserves a logical qubit beyond the photon-lifetime limit by about 5% using a binomial encoding. This realization of continuous quantum error correction at the breakeven point highlights the quantitative competitiveness of passive correction strategies, while circumventing some demanding hardware requirements of its active counterparts.", "authors": [ { "name": "Shruti Shirol", "affiliations": [ "University of Massachusetts-Amherst" ] }, { "name": "Sean van Geldern", "affiliations": [ "University of Massachusetts-Amherst" ] }, { "name": "Hanzhe Xi", "affiliations": [ "University of Massachusetts-Amherst" ] }, { "name": "Chen Wang", "affiliations": [ "University of Massachusetts-Amherst" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "error-correction", "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1103/tmkr-9kl2", "url": "https://doi.org/10.1103/tmkr-9kl2", "title": "Limits of inference in complex systems: When stochastic models become indistinguishable", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/p3dw-tbqp", "url": "https://doi.org/10.1103/p3dw-tbqp", "title": "Robust Orbital-Selective Flat Bands in Layered Transition-Metal Oxyhalides at Room Temperature", "abstract": "Flat electronic bands, which amplify electron correlations by quenching kinetic energy, provide an ideal foundation for exotic quantum phases. However, prevailing strategies - including geometrically frustrated lattices, moiré superlattices, and heavy-fermion systems - often suffer from inherent trade-offs among robustness, tunability, and orbital control, thereby limiting their broad applicability. Here, we report the experimental discovery of intrinsic orbital-selective flat bands in the layered transition-metal oxyhalide family M O X 2 ( M = Nb , Ta; X = Cl , Br, I), directly observed by angle-resolved photoemission spectroscopy at room temperature. Importantly, this materials platform exhibits pronounced tunability: The flat-band bandwidth and correlation strength can be systematically tuned via halogen substitution, while the Fermi level is controllable through electrostatic gating and surface charge transfer. Remarkably, the flat band remains stable upon dimensional reduction, persisting from the bulk crystal down to the few-layer limit. Our theoretical analysis reveals that this flat band transcends simple lattice geometry, originating instead from an orbital-driven synergetic Su-Schrieffer-Heeger-Lieb mechanism: a cooperative interplay between quasi-one-dimensional M − d z 2 Su-Schrieffer-Heeger chains and a two-dimensional M − d x 2 − y 2 Lieb-like sublattice, reinforced by Peierls dimerization. Together, these findings establish layered transition-metal oxyhalides as a versatile materials-by-design platform for systematically engineering intrinsic flat bands via chemical, electronic, and dimensional control, which provides a robust pathway to exploring room-temperature flat-band physics.", "authors": [ { "name": "Xiangyu Luo", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Ludovica Zullo", "affiliations": [ "Universität Würzburg" ] }, { "name": "Sahaj Patel", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Dongjin Oh", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Willa Mihalyi-Koch", "affiliations": [ "Columbia University" ] }, { "name": "Emma Lian", "affiliations": [ "Columbia University" ] }, { "name": "Jiaruo Li", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Qian Song", "affiliations": [ "Massachusetts Institute of Technology" ] }, { "name": "Asish K. Kundu", "affiliations": [ "Brookhaven National Laboratory" ] }, { "name": "Anil Rajapitamahuni", "affiliations": [ "Brookhaven National Laboratory" ] }, { "name": "Elio Vescovo", "affiliations": [ "Brookhaven National Laboratory" ] }, { "name": "Natalia Olszowska", "affiliations": [ "Jagiellonian University" ] }, { "name": "Rafał Kurleto", "affiliations": [ "Jagiellonian University" ] }, { "name": "Dawid Wutke", "affiliations": [ "Jagiellonian University" ] }, { "name": "Xavier Roy", "affiliations": [ "Columbia University" ] }, { "name": "Giorgio Sangiovanni", "affiliations": [ "Universität Würzburg" ] }, { "name": "Riccardo Comin", "affiliations": [ "Massachusetts Institute of Technology" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/kwh6-hncn", "url": "https://doi.org/10.1103/kwh6-hncn", "title": "Leading and beyond leading-order spectral form factor in chaotic quantum many-body systems across all Dyson symmetry classes", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1103/882y-w4zy", "url": "https://doi.org/10.1103/882y-w4zy", "title": "High-Rate Discrete-Modulated Continuous-Variable Quantum Key Distribution with Composable Security", "abstract": "Continuous-variable quantum key distribution holds the potential to generate high secret key rates, making it a prime candidate for high-rate metropolitan quantum network applications. However, despite these promising opportunities, the realization of high-rate continuous-variable quantum key distribution systems with composable security remains an elusive goal. Here, we report a discrete-modulated continuous-variable quantum key distribution system with a composable secret key rate of 18.93 Mbps against collective attacks over a 25-km fiber channel. This record-breaking rate is achieved through the probability-shaped 16 quadrature amplitude modulation-modulated protocol, which employs semidefinite programming to ensure its composable security. Furthermore, we have employed a fully digital and precise quantum signal processing technique to reduce excess noise to extremely low levels, thereby facilitating efficient broadband system operation. While ensuring low complexity and cost, our system achieves a performance advantage of over an order of magnitude compared to previous continuous-variable quantum key distribution systems, providing a promising solution for future deployment of quantum key distribution.", "authors": [ { "name": "Mingze Wu", "affiliations": [ "Beijing University of Posts and Telecommunications" ] }, { "name": "Yan Pan", "affiliations": [ "Institute of Southwestern Communication" ] }, { "name": "Junhui Li", "affiliations": [ "Beijing University of Posts and Telecommunications" ] }, { "name": "Heng Wang", "affiliations": [ "Institute of Southwestern Communication" ] }, { "name": "Lu Fan", "affiliations": [ "Beijing University of Posts and Telecommunications" ] }, { "name": "Yun Shao", "affiliations": [ "Institute of Southwestern Communication" ] }, { "name": "Yang Li", "affiliations": [ "Institute of Southwestern Communication" ] }, { "name": "Wei Huang", "affiliations": [ "Institute of Southwestern Communication" ] }, { "name": "Song Yu", "affiliations": [ "Beijing University of Posts and Telecommunications" ] }, { "name": "Bingjie Xu", "affiliations": [ "Institute of Southwestern Communication" ] }, { "name": "Yichen Zhang", "affiliations": [ "Beijing University of Posts and Telecommunications" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1103/st3l-14d7", "url": "https://doi.org/10.1103/st3l-14d7", "title": "Nondestructive Optical Readout and Manipulation of Circular Rydberg Atoms", "abstract": "Among the thriving quantum computation and quantum simulation platforms based on arrays of Rydberg atoms, those using circular Rydberg atoms are particularly promising. These atoms uniquely combine the strong dipole-dipole interactions typical of Rydberg states with long lifetimes. However, low-angular-momentum ( ℓ ) laser-accessible Rydberg levels have been so far mostly used, because circular Rydberg atoms have no optical transitions, hindering their individual detection and manipulation. We remove this limitation with a hybrid platform, combining an array of data laser-trapped circular Rydberg atoms of rubidium with an auxiliary array of Rb ancilla atoms transiently excited to a low- ℓ Rydberg level. We perform a quantum nondemolition detection of the data qubit with the ancilla, through the blockade of the ancilla optical excitation induced by a Förster resonance. Conversely, we locally manipulate the data qubit through the excitation of the ancilla. This dual-Rydberg platform is highly promising for quantum computation and simulation. It adds to the circular-atom toolbox the midcircuit measurements, essential for error correction. More strikingly, it gives access to time correlations in long-term quantum simulations, uniquely accessible to circular Rydberg atoms.", "authors": [ { "name": "Y. Machu", "affiliations": [ "Laboratoire Kastler Brossel" ] }, { "name": "A. Durán-Hernández", "affiliations": [ "Laboratoire Kastler Brossel" ] }, { "name": "G. Creutzer", "affiliations": [ "Laboratoire Kastler Brossel" ] }, { "name": "A. A. Young", "affiliations": [ "Laboratoire Kastler Brossel" ] }, { "name": "J. M. Raimond", "affiliations": [ "Laboratoire Kastler Brossel" ] }, { "name": "M. Brune", "affiliations": [ "Laboratoire Kastler Brossel" ] }, { "name": "C. Sayrin", "affiliations": [ "Laboratoire Kastler Brossel", "Institut Universitaire de France" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1103/sx1x-pyl1", "url": "https://doi.org/10.1103/sx1x-pyl1", "title": "Generalized Bogoliubov-Born-Green-Kirkwood-Yvon hierarchy for near-integrable dynamics", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1103/4ym8-dyhn", "url": "https://doi.org/10.1103/4ym8-dyhn", "title": "Erratum: Opposite Effects of the Rotational and Translational Energy on the Rates of Ion-Molecule Reactions near 0 K: The D 2 + + NH 3 and D 2 + + ND 3 Reactions [Phys. Rev. X 14 , 011034 (2024)]", "abstract": "", "authors": [ { "name": "Raphaël Hahn", "affiliations": [] }, { "name": "David Schlander", "affiliations": [] }, { "name": "Valentina Zhelyazkova", "affiliations": [] }, { "name": "Frédéric Merkt", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1103/466c-8sl4", "url": "https://doi.org/10.1103/466c-8sl4", "title": "Three-Dimensional Electronic Structures in Superconducting Bilayer Ruddlesden-Popper Nickelate Films", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1103/6mpz-p85s", "url": "https://doi.org/10.1103/6mpz-p85s", "title": "Free probability in a minimal quantum circuit model", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1103/9ncx-4pgr", "url": "https://doi.org/10.1103/9ncx-4pgr", "title": "Stochastic Calculus for Pathwise Observables of Markov-Jump Processes: Unification of Diffusion and Jump Dynamics", "abstract": "Pathwise observables - functionals of stochastic trajectories - are at the heart of time-averaged statistical mechanics and are central to thermodynamic inequalities such as uncertainty relations, speed limits, and correlation bounds. They provide a means of thermodynamic inference in the typical situation, when not all dissipative degrees of freedom in a system are experimentally accessible. So far, theories focusing on pathwise observables have been developing in two major directions, diffusion processes and Markov-jump dynamics, in a virtually disjoint manner. Moreover, even the respective results for diffusion and jump dynamics were derived with a patchwork of different approaches that are predominantly indirect. Stochastic calculus was recently shown to provide a direct approach to pathwise observables of diffusion processes, while a corresponding framework for jump dynamics remained elusive. In our work, we develop, in an exact parallelism with continuous-space diffusion, a complete stochastic calculus for pathwise observables of Markov-jump processes. We formulate a “Langevin equation” for jump processes, define general pathwise observables, and establish their covariation structure, whereby we fully account for transients and time-inhomogeneous dynamics. We prove the known kinds of thermodynamic inequalities in their most general form and discuss saturation conditions. We determine the response of pathwise observables to general (including thermal) perturbations and introduce a corresponding response-function formalism. We carry out the continuum limit to achieve the complete unification of diffusion and jump dynamics. In addition, we connect the framework to quantum unraveling and the Belavkin equation for open quantum systems, associating quantum and classical descriptions of thermal systems. Our results open avenues in the direction of discrete-state analogs of generative diffusion models and the learning of stochastic thermodynamics from fluctuating trajectories.", "authors": [ { "name": "Lars Torbjørn Stutzer", "affiliations": [ "Max Planck Institute for Multidisciplinary Sciences" ] }, { "name": "Cai Dieball", "affiliations": [ "Max Planck Institute for Multidisciplinary Sciences" ] }, { "name": "Aljaž Godec", "affiliations": [ "University of Freiburg", "Max Planck Institute for Multidisciplinary Sciences" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1103/456g-q7bd", "url": "https://doi.org/10.1103/456g-q7bd", "title": "Interaction-driven topological transitions in monolayer TaIrTe 4", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1103/bvrb-z4hj", "url": "https://doi.org/10.1103/bvrb-z4hj", "title": "Candidate for a fractional topological insulator in twisted MoTe 2", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1103/259w-bpxx", "url": "https://doi.org/10.1103/259w-bpxx", "title": "Probing Quantum Anomalous Hall States in Twisted Bilayer WSe 2 via Attractive Polaron Spectroscopy", "abstract": "Moiré superlattices in semiconductors exhibit a rich variety of interaction-induced topological states, including quantum anomalous Hall (QAH) effects [1-8]. A recent study hinted that twisted WSe 2 homobilayer ( tWSe 2 ) could host a QAH state but lacked direct evidence of ferromagnetism, a key hallmark of this phase [9]. Here, we report the first direct evidence of QAH states in tWSe 2 with spontaneous ferromagnetism. Specifically, we employ polarization-resolved attractive polaron spectroscopy on a dual-gated, 2° tWSe 2 and observe direct signatures of spontaneous time-reversal symmetry breaking at hole filling ν = 1 . Together with a Chern number ( C ) measurement via Streda formula analysis, we identify this magnetized state as a topological state, characterized by C = 1 . Furthermore, we demonstrate that these topological and magnetic properties are tunable via a finite displacement field, between a QAH ferromagnetic state and an antiferromagnetic state. Our findings position tWSe 2 as a highly versatile, stable, and optically addressable platform for investigating topological order and strong correlations in two-dimensional landscapes.", "authors": [ { "name": "Beini Gao", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Mahdi Ghafariasl", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Mahmoud Jalali Mehrabad", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Tsung-Sheng Huang", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Lifu Zhang", "affiliations": [ "University of Maryland, College Park" ] }, { "name": "Deric Session", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Pranshoo Upadhyay", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Rundong Ma", "affiliations": [ "University of Maryland, College Park" ] }, { "name": "Ghadah Alshalan", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Daniel Suarez", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Supratik Sarkar", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] }, { "name": "Suji Park", "affiliations": [ "Center for Functional Nanomaterials, Brookhaven National Laboratory" ] }, { "name": "Houk Jang", "affiliations": [ "Center for Functional Nanomaterials, Brookhaven National Laboratory" ] }, { "name": "Kenji Watanabe", "affiliations": [ "National Institute for Materials Science" ] }, { "name": "Takashi Taniguchi", "affiliations": [ "National Institute for Materials Science" ] }, { "name": "Ming Xie", "affiliations": [ "University of Maryland, College Park", "The University of Texas at Dallas" ] }, { "name": "You Zhou", "affiliations": [ "University of Maryland, College Park" ] }, { "name": "Mohammad Hafezi", "affiliations": [ "Joint Quantum Institute (JQI)", "University of Maryland, College Park" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1103/fmrf-dys9", "url": "https://doi.org/10.1103/fmrf-dys9", "title": "Elastic and Structural Anisotropy in Silica Thin Films for Gravitational-Wave Detectors", "abstract": "The thermal noise of mirror coatings for gravitational-wave detectors critically depends on the elastic properties of the constituent materials. Data analyses and theoretical models typically assume each material is homogeneous and isotropic, but isotropy has never been explicitly verified. Using Brillouin light scattering (BLS), we demonstrate that ion-beam-sputtered SiO 2 - a material still viable for future mirror coatings - exhibits cylindrical elastic symmetry, with in-plane isotropy but a notable 6% compressive anisotropy along the film normal. This anisotropy remains unchanged after the postdeposition heat treatment currently used in ground-based detectors ( 500 ° C , 10 h) but is nearly eliminated at 900 ° C . Infrared reflectivity experiments support these findings by directly revealing heterogeneities in the distribution of bridging and nonbridging oxygen structures along the growth axis. While BLS measures the real part of the elastic constants at gigahertz frequencies, the data reveal negligible contributions from mechanical relaxations in the kilohertz to gigahertz range, making BLS a valid substitute for low-frequency properties obtained from standard anisotropy-insensitive techniques. Our results highlight that restoring isotropy through heat treatment - by softening the material, enabling more than 7% out-of-plane expansion, and smoothing out structural heterogeneities - may play a key role in reducing thermal noise. This proof-of-concept study extends beyond silica, providing critical insights for the design of future coatings.", "authors": [ { "name": "Brenda Bracco", "affiliations": [ "Università di Perugia", "Istituto Nazionale di Fisica Nucleare, Sezione di Perugia" ] }, { "name": "Michele Magnozzi", "affiliations": [ "Università di Genova", "Istituto Nazionale di Fisica Nucleare, Sezione di Genova" ] }, { "name": "Stefano Colace", "affiliations": [ "Università di Genova" ] }, { "name": "Maurizio Canepa", "affiliations": [ "Università di Genova" ] }, { "name": "Giulio Favaro", "affiliations": [ "CNR-Istituto di Fotonica e Nanotecnologie (IFN)", "Università di Padova" ] }, { "name": "Marco Bazzan", "affiliations": [ "Università di Padova" ] }, { "name": "Massimo Granata", "affiliations": [ "Laboratoire des Matériaux Avancés-IP2I", "Université Claude Bernard Lyon 1" ] }, { "name": "David Hofman", "affiliations": [ "Laboratoire des Matériaux Avancés-IP2I", "Université Claude Bernard Lyon 1" ] }, { "name": "Alessandro Di Michele", "affiliations": [ "Università di Perugia", "Istituto Nazionale di Fisica Nucleare, Sezione di Perugia" ] }, { "name": "Laura Silenzi", "affiliations": [ "Università di Camerino", "Istituto Nazionale di Fisica Nucleare, Sezione di Perugia" ] }, { "name": "Gianpietro Cagnoli", "affiliations": [ "Université Claude Bernard Lyon 1", "Institut Lumière Matière" ] }, { "name": "Giovanni Carlotti", "affiliations": [ "Università di Perugia" ] }, { "name": "Paola Sassi", "affiliations": [ "Università di Perugia", "Istituto Nazionale di Fisica Nucleare, Sezione di Perugia" ] }, { "name": "Silvia Corezzi", "affiliations": [ "Università di Perugia", "Istituto Nazionale di Fisica Nucleare, Sezione di Perugia" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1103/myqd-2677", "url": "https://doi.org/10.1103/myqd-2677", "title": "Stretching Theory of Hookean Metashells", "abstract": "Despite being governed by the familiar laws of Hookean mechanics, elastic shells patterned with an internal structure (i.e., metashells) exhibit a wealth of unusual mechanical properties with no counterparts in unstructured materials. Here I show that much of this behavior can be captured by a real-valued analog of the inhomogeneous Schrödinger equation, with the lateral pressure experienced by the internal structure in the role of the wave function. In the fine structure limit - i.e., when the length scale associated with the internal structure is much smaller than the local radius of curvature - this approach reveals the existence of localized states, in which elastic deformations are prevented to diffuse away from their origin, thereby allowing the internal structure to smoothly adapt to the intrinsic geometry of the metashell. Leveraging on an analogy with scattering states in nearly free electrons, I further show that periodic metashells, obtained from the repetition of the same structural unit periodically in space, support elastic Bloch waves, corresponding to stationary periodic configurations of the internal structure and characterized by a geometry-dependent band structure. When applied to crystalline monolayers, this approach provides a generalization of the elastic theory of interacting topological defect to compressible systems.", "authors": [ { "name": "Luca Giomi", "affiliations": [ "Instituut-Lorentz, Universiteit Leiden" ] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1103/1ncg-11hz", "url": "https://doi.org/10.1103/1ncg-11hz", "title": "Process tensor approaches to non-Markovian quantum dynamics", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1103/961c-j3p5", "url": "https://doi.org/10.1103/961c-j3p5", "title": "Deceleration of accelerator-produced and in-trap electron cooling of highly charged ions", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prx", "title": "Physical Review X", "issn": [ "2160-3308" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.1103/36c8-2jy3", "url": "https://doi.org/10.1103/36c8-2jy3", "title": "Physical Mechanism behind the Early Onset of the Ultimate State in Supergravitational Centrifugal Thermal Convection", "abstract": "We present a combined experimental and numerical investigation of the transition from the classical to the ultimate regime of thermal turbulence in a supergravitational centrifugal convection system. The transition is found to be robust, with the critical Rayleigh number decreasing systematically as the Froude number, defined as the ratio of centrifugal to Earth’s gravity, decreases, highlighting the effect of residual gravity. Once the Rayleigh number reaches the transition threshold, the Stewartson layer induced by residual Earth gravity becomes comparable in thickness to the viscous boundary layer, and their interaction results in a coupled flow that distorts the viscous boundary layer, triggering its transition from laminar to turbulent flow and leading to a sharp increase in heat transport. These findings demonstrate the key role of the Stewartson layer induced by residual gravity in facilitating the transition to the ultimate regime in supergravitational centrifugal thermal convection.", "authors": [ { "name": "Lei Ren", "affiliations": [ "Tsinghua University" ] }, { "name": "Jun Zhong", "affiliations": [ "Tsinghua University" ] }, { "name": "Rushi Lai", "affiliations": [ "Tsinghua University" ] }, { "name": "Chao Sun", "affiliations": [ "Tsinghua University", "Tsinghua University" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/7mt2-968k", "url": "https://doi.org/10.1103/7mt2-968k", "title": "Spin-Dependent Fluorescence Mediated by Antisymmetric Exchange in Triplet Exciton Pairs", "abstract": "", "authors": [ { "name": "Yan Sun", "affiliations": [ "LPS", "Université Paris-Saclay" ] }, { "name": "G. Ricci", "affiliations": [ "Donostia International Physics Center (DIPC)" ] }, { "name": "M. Monteverde", "affiliations": [ "LPS", "Université Paris-Saclay" ] }, { "name": "V. Derkach", "affiliations": [ "O. Ya. Usikov Institute for Radiophysics and Electronics of NAS of Ukraine", "LPS", "Université Paris-Saclay" ] }, { "name": "T. Chanelière", "affiliations": [ "Institut Néel" ] }, { "name": "E. Aldridge", "affiliations": [ "University of Kentucky" ] }, { "name": "D. Casanova", "affiliations": [ "Donostia International Physics Center (DIPC)" ] }, { "name": "D. Beljonne", "affiliations": [ "University of Mons" ] }, { "name": "J. E. Anthony", "affiliations": [ "University of Kentucky" ] }, { "name": "A. D. Chepelianskii", "affiliations": [ "LPS", "Université Paris-Saclay" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/b16v-hwp2", "url": "https://doi.org/10.1103/b16v-hwp2", "title": "Spontaneous quantum turbulence in a newborn Bose-Einstein condensate via the Kibble-Zurek mechanism", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/9hcw-7fl6", "url": "https://doi.org/10.1103/9hcw-7fl6", "title": "Adaptively Secure Unitary Designs with Constant Non-Clifford Cost", "abstract": "Randomness is a fundamental resource in quantum information, with crucial applications in cryptography, algorithms, and error correction. A central challenge is to construct unitary k designs that closely approximate Haar-random unitaries while minimizing the costly use of non-Clifford operations. In this Letter, we present a protocol able to generate unitary k designs on n qubits, secure against any adversarial quantum measurement, with a system-size-independent number of non-Clifford gates. Our construction applies a k design only to a subsystem of size Θ ( k ) , independent of n . This “seed” design is then “diluted” across the entire n -qubit system by sandwiching it between two random Clifford operators. The resulting ensemble forms an ϵ -approximate unitary k design on n qubits. We prove that this construction achieves full quantum security against adaptive adversaries using only O ˜ ( k 2 log ϵ − 1 ) non-Clifford gates. If one requires security only against polynomial-time adaptive adversaries, the non-Clifford cost decreases to O ˜ ( k + log 1 + c ϵ − 1 ) . This is optimal, since we show that at least Ω ( k ) non-Clifford gates are required in this setting. Compared to existing approaches, our method significantly reduces non-Clifford overhead while strengthening security guarantees to adaptive security as well as removing artificial assumptions between n and k . These results make high-order unitary designs practically attainable in near-term fault-tolerant quantum architectures.", "authors": [ { "name": "Lennart Bittel", "affiliations": [ "Freie Universität Berlin" ] }, { "name": "Lorenzo Leone", "affiliations": [ "Freie Universität Berlin", "Università degli Studi di Salerno" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/46n3-pryp", "url": "https://doi.org/10.1103/46n3-pryp", "title": "Tailoring a pure valley-Zeeman spin-orbit coupling in WSe 2 -encapsulated monolayer graphene super-moiré lattices", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/zsg7-r2cm", "url": "https://doi.org/10.1103/zsg7-r2cm", "title": "Erratum: Spectroscopy and ground-state transfer of ultracold bosonic 39 K 133 Cs molecules [Phys. Rev. Lett. 135, 203401 (2025)]", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/h9rb-5vdm", "url": "https://doi.org/10.1103/h9rb-5vdm", "title": "New approach to pulsar timing array data combination", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/xl8y-dg4k", "url": "https://doi.org/10.1103/xl8y-dg4k", "title": "Machine-learned tuning to protected states by probing noise resilience", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/g85x-rgxm", "url": "https://doi.org/10.1103/g85x-rgxm", "title": "Band-Geometry-Driven Spin Photocurrent in Centrosymmetric Altermagnets", "abstract": "", "authors": [ { "name": "Ruizhi Dong", "affiliations": [ "Beijing Institute of Technology", "Beijing Institute of Technology" ] }, { "name": "Yihua Xiao", "affiliations": [ "Beijing Institute of Technology", "Beijing Institute of Technology" ] }, { "name": "Ruixiang Fei", "affiliations": [ "Beijing Institute of Technology", "Beijing Institute of Technology" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/gdbv-wnpp", "url": "https://doi.org/10.1103/gdbv-wnpp", "title": "Evidence of ZZ γ production and observation of 4 ℓ γ in proton-proton collisions at s = 13 TeV", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/zjdz-rqqd", "url": "https://doi.org/10.1103/zjdz-rqqd", "title": "Quantum Mpemba Effect Induced by Non-Markovian Exceptional Points", "abstract": "", "authors": [ { "name": "Ze-Zhou Zhang", "affiliations": [ "Lanzhou University" ] }, { "name": "Hong-Gang Luo", "affiliations": [ "Lanzhou University" ] }, { "name": "Wei Wu", "affiliations": [ "Lanzhou University" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/g8v5-rbq7", "url": "https://doi.org/10.1103/g8v5-rbq7", "title": "Beating Hermitian Speed Limits for Entanglement Generation via Exceptional Points in a Trapped-Ion System", "abstract": "", "authors": [ { "name": "W. F. Yuan", "affiliations": [ "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences", "University of the Chinese Academy of Sciences" ] }, { "name": "B. B. Liu", "affiliations": [ "Zhengzhou University" ] }, { "name": "N. Li", "affiliations": [ "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences", "University of the Chinese Academy of Sciences" ] }, { "name": "G. Y. Ding", "affiliations": [ "Guangzhou Institute of Industrial Intelligence", "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences" ] }, { "name": "W. Q. Ding", "affiliations": [ "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences", "University of the Chinese Academy of Sciences" ] }, { "name": "H. J. Du", "affiliations": [ "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences", "University of the Chinese Academy of Sciences" ] }, { "name": "J. C. Li", "affiliations": [ "Guangzhou Institute of Industrial Intelligence", "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences" ] }, { "name": "G. Chen", "affiliations": [ "Zhengzhou University" ] }, { "name": "H. Jing", "affiliations": [ "NUDT" ] }, { "name": "F. Zhou", "affiliations": [ "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences", "Guangzhou Institute of Industry Co. Ltd" ] }, { "name": "Shi-Lei Su", "affiliations": [ "Zhengzhou University", "Henan Academy of Sciences", "Yanbian University" ] }, { "name": "M. Feng", "affiliations": [ "Innovation Academy of Precision Measurement Science and Technology, Chinese Academy of Sciences", "Guangzhou Institute of Industry Co. Ltd", "Hunan Normal University", "Zhejiang Normal University" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/mnwt-svrf", "url": "https://doi.org/10.1103/mnwt-svrf", "title": "Regge trajectories from the adjoint sector of matrix quantum mechanics", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/gbbj-hpqk", "url": "https://doi.org/10.1103/gbbj-hpqk", "title": "Single-nucleon transfer on unstable 59 Cu probes the NiCu cycle in astrophysical x-ray bursts", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/9th9-qc51", "url": "https://doi.org/10.1103/9th9-qc51", "title": "Measurement of the dispersion-galaxy cross-power spectrum with the second CHIME/FRB catalog", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/bl3z-8krg", "url": "https://doi.org/10.1103/bl3z-8krg", "title": "Generalized Scaling of Focal Temperature in Converging Shock Waves", "abstract": "A scaling framework unifying the markedly different and independently studied cylindrical and spherical shock convergence is presented. For ionizing argon, we show that the focal temperature becomes invariant to shock symmetry and initial shock conditions when scaled by the prefocus shock Mach number, after accounting for pressure effects. The resulting collapsed focal temperature - Mach number relation is governed by the thermodynamics of argon, up to an equilibrium temperature of 35 000 K. Such a scaling enables both predictive estimation of focal temperatures over a wide range of initial conditions and, conversely, determination of the parameters required to achieve a target temperature in a given medium.", "authors": [ { "name": "Sourabh Bhardwaj", "affiliations": [ "KTH Royal Institute of Technology" ] }, { "name": "Nicholas Apazidis", "affiliations": [ "KTH Royal Institute of Technology" ] }, { "name": "Michael Liverts", "affiliations": [ "KTH Royal Institute of Technology" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/75rk-xz8t", "url": "https://doi.org/10.1103/75rk-xz8t", "title": "Probing Site-Specific Magnetism in Time-Reversal-Odd Antiferromagnet via Electric Field-Induced Nonreciprocal Directional Dichroism", "abstract": "", "authors": [ { "name": "Koei Matsumoto", "affiliations": [ "University of Tokyo" ] }, { "name": "Takeshi Hayashida", "affiliations": [ "University of Tokyo", "Radboud University" ] }, { "name": "Tsuyoshi Kimura", "affiliations": [ "University of Tokyo" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/c9dr-bpn4", "url": "https://doi.org/10.1103/c9dr-bpn4", "title": "Simulating fermionic fractional Chern insulators with infinite projected entangled-pair states", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/g865-9mk1", "url": "https://doi.org/10.1103/g865-9mk1", "title": "Atomic clock frequency ratios with fractional uncertainty ≤ 3.2 × 10 − 18", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing" ], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/42m7-p7l3", "url": "https://doi.org/10.1103/42m7-p7l3", "title": "Andreev reflection to probe momentum-dependent spin polarization in altermagnet CrSb", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1103/xmmq-gnvq", "url": "https://doi.org/10.1103/xmmq-gnvq", "title": "Precision Extraction of the Deuteron Electric Polarizability via the Baldin Sum Rule with Full Low-Energy Coverage", "abstract": "", "authors": [ { "name": "Zi-Rui Hao", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Gong-Tao Fan", "affiliations": [ "Shanghai Advanced Research Institute", "Shanghai Institute of Applied Physics", "University of Chinese Academy of Science" ] }, { "name": "Qian-Kun Sun", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Hong-Wei Wang", "affiliations": [ "Shanghai Advanced Research Institute", "Shanghai Institute of Applied Physics", "University of Chinese Academy of Science" ] }, { "name": "Hang-Hua Xu", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Long-Xiang Liu", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Yue Zhang", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Jiunn-Wei Chen", "affiliations": [ "National Taiwan University", "University of Washington" ] }, { "name": "Yu-Xuan Yang", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Sheng Jin", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Kai-Jie Chen", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Zhen-Wei Wang", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Xiang-Fei Wang", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Meng-Ke Xu", "affiliations": [ "Shanghai Institute of Applied Physics" ] }, { "name": "Zhi-Cai Li", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Pu Jiao", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Meng-Die Zhou", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Shan Ye", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Yu-Long Shen", "affiliations": [ "Shanghai Advanced Research Institute" ] }, { "name": "Yin-Ji Chen", "affiliations": [ "Fudan University" ] }, { "name": "Hao Zhang", "affiliations": [ "Fudan University" ] }, { "name": "Jian-Jun He", "affiliations": [ "Fudan University" ] }, { "name": "Wen-Qing Shen", "affiliations": [ "Shanghai Advanced Research Institute", "Shanghai Institute of Applied Physics" ] }, { "name": "Yu-Gang Ma", "affiliations": [ "Fudan University", "East China Normal University" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/dbgp-pqsh", "url": "https://doi.org/10.1103/dbgp-pqsh", "title": "Phase Separation in a Chiral Active Fluid of Inertial Self-Spinning Disks", "abstract": "We show that systematic particle rotations in a fluid composed of disk-shaped spinners can spontaneously lead to phase separation. The phenomenon arises out of a homogeneous and hydrostatic stationary state, due to a pressure feedback mechanism that increases local density fluctuations. We show how this mechanism induces phase separation, coined as rotation induced phase separation (RIPS), when the active rotation is not properly counterbalanced by translational friction. A low density phase can coexist with a dense chiral liquid due to the imbalance between pressure and stress transmitted through chiral flows when a significant momentum transfer between rotational and translational motion can be sustained. As a consequence, RIPS is expected to appear as a general nonequilibrium phenomenon in chiral fluids.", "authors": [ { "name": "Pasquale Digregorio", "affiliations": [ "Università degli studi di Bari", "INFN, Sezione di Bari", "Universitat de Barcelona" ] }, { "name": "Ignacio Pagonabarraga", "affiliations": [ "Universitat de Barcelona", "Universitat de Barcelona" ] }, { "name": "Francisco Vega Reyes", "affiliations": [ "Universidad de Extremadura" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/qxzs-1t1l", "url": "https://doi.org/10.1103/qxzs-1t1l", "title": "Random Initial Data and Average Shock Time in the Fermi-Pasta-Ulam-Tsingou Chain", "abstract": "We investigate the dynamics of the Fermi-Pasta-Ulam-Tsingou chain with long-wavelength random initial data. When the energy per particle is small, thermal equilibrium is not reached on a fast timescale, and the system enters prethermalization. The formation of the prethermal state is characterized by the development of a Burgers-type shock and the onset of a turbulentlike spectrum with a time dependent exponent ζ ( t ) in the inertial range. We perform a significant step forward by demonstrating that these features are robust under generic long-wavelength random initial conditions. By employing advanced probabilistic techniques inspired by the works of Dudley and Talagrand, we derive a sharp asymptotic expression for the average shock time in the thermodynamic limit. For large p , this time scales as ( p log p ) − 1 , where p is the number of excited modes, proving that it is an intensive quantity up to a logarithmic correction in the size of the system.", "authors": [ { "name": "Matteo Gallone", "affiliations": [ "Scuola Internazionale di Studi Superiori Avanzati" ] }, { "name": "Ricardo Grande", "affiliations": [ "Scuola Internazionale di Studi Superiori Avanzati" ] }, { "name": "Antonio Ponno", "affiliations": [ "University of Padova" ] }, { "name": "Stefano Ruffo", "affiliations": [ "ISC", "Scuola Internazionale di Studi Superiori Avanzati", "INFN, Sezione di Firenze" ] }, { "name": "Erwan Druais", "affiliations": [ "École Normale Supérieure de Lyon" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/kh36-7z76", "url": "https://doi.org/10.1103/kh36-7z76", "title": "Enhancing nonreciprocity through squeezing-induced symmetry breaking", "abstract": "", "authors": [ { "name": "Anonymous", "affiliations": [] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1103/nqbf-gj8x", "url": "https://doi.org/10.1103/nqbf-gj8x", "title": "Terahertz-Assisted Multiband High-Harmonic Spectroscopy", "abstract": "", "authors": [ { "name": "Sha Li", "affiliations": [ "The Ohio State University" ] }, { "name": "Lun Yue", "affiliations": [ "Binghamton University", "The Ohio State University" ] }, { "name": "Yaguo Tang", "affiliations": [ "The Ohio State University" ] }, { "name": "Vyacheslav Leshchenko", "affiliations": [ "The Ohio State University" ] }, { "name": "Pierre Agostini", "affiliations": [ "The Ohio State University" ] }, { "name": "Alexandra S. Landsman", "affiliations": [ "The Ohio State University" ] }, { "name": "Mette B. Gaarde", "affiliations": [ "Louisiana State University" ] }, { "name": "Louis F. DiMauro", "affiliations": [ "The Ohio State University" ] } ], "journal": { "id": "prl", "title": "Physical Review Letters", "issn": [ "0031-9007", "1079-7114" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "hardware", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6e97", "url": "https://doi.org/10.1088/1367-2630/ae6e97", "title": "A mobility based approach to transport in chiral fluids", "abstract": "Abstract Chiral fluids, for which the mobility tensor has antisymmetric, off-diagonal components, exhibit transport phenomena absent in conventional systems, including interaction-enhanced diffusion and negative mobility. While these effects have been predicted theoretically and observed in simulations, their microscopic origin has remained unclear. Here, we address this question using a mobility-based nonequilibrium approach, analysing the steady-state drift of a tracer driven through an interacting chiral fluid. We show that, under strong chirality, the tracer generates a reversed density wake, in which regions of particle accumulation and depletion are inverted compared to the achiral case. This structural inversion of the wake provides a unified physical mechanism underlying both enhanced diffusion and negative mobility. Furthermore, we demonstrate that these phenomena are robust to changes in the interaction potential, highlighting their generality as a consequence of odd mobility.", "authors": [ { "name": "Filippo Faedi", "affiliations": [ "Institute of Physics" ] }, { "name": "Erik Kalz", "affiliations": [ "Institute of Physics and Astronomy" ] }, { "name": "Ralf Metzler", "affiliations": [ "Institute of Physics and Astronomy" ] }, { "name": "Abhinav Sharma", "affiliations": [ "Institute of Physics", "Institute Theory of Polymers" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6e67", "url": "https://doi.org/10.1088/1367-2630/ae6e67", "title": "Adiabatic pumping of topological corner states by coherent tunneling in a 2D SSH model", "abstract": "Abstract The active manipulation of topologically protected states represents a pivotal frontier for quantum physics, offering a unique confluence of topological robustness and precise quantum control. We propose an adiabatic pumping scheme for the long-range transfer of topological corner states in a two-dimensional Su - Schrieffer - Heeger model. The protocol utilizes a modular lattice architecture composed of four topologically distinct subblocks, enabling the modulation of a topological dark state by precise tuning of lattice couplings. The transfer is achieved through coherent tunneling by adiabatic passage among corner and interface states. We derive a multi-level model for the adiabatic pumping that provides an accurate description of the underlying mechanism. Compared to a conventional sequential Thouless pumping, our protocol demonstrates significantly enhanced performance in both fidelity and efficiency, establishing a robust framework for excitation transfer and quantum control with potential extensions to other lattice models and three-dimensional systems.", "authors": [ { "name": "Yang Peng", "affiliations": [ "Sichuan Normal University" ] }, { "name": "Rui-Shan Li", "affiliations": [ "Sichuan Normal University" ] }, { "name": "Yan-Jue Lv", "affiliations": [ "Sichuan Normal University" ] }, { "name": "Yi Zheng", "affiliations": [ "Sichuan Normal University" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae73a9", "url": "https://doi.org/10.1088/1367-2630/ae73a9", "title": "Quantum-assisted domination games on cycle graphs", "abstract": "Abstract Quantum entanglement allows for correlations between distant objects that go beyond any classical theory. These additional correlations can be exploited to gain practical advantage in certain non-local games. In recent years there has been interest in games defined on graph structures and involving mobile agents. One of these is the graph domination game, where quantum advantage has been discovered recently on some finite graphs by numerical optimization [1]. Here we study quantum advantage in the 1-step, 2-player version of this game, focusing on cycle graphs. We study it numerically, analytically and through the use of noisy, intermediate scale quantum (NISQ) processors. We find explicit strategies and show that they realise the numerical bounds that were found recently for the case of small graphs [1]. We then generalise our strategies to cycles of arbitrary size. Finally, we run our strategies for 5-, 6-, and 7-site cycles on NISQ hardware and find measurable advantage (compared to the optimal classical strategies) in all cases.", "authors": [ { "name": "C Weeks", "affiliations": [ "University of Kent" ] }, { "name": "Paul Strange", "affiliations": [ "University of Kent" ] }, { "name": "Peter Drmota", "affiliations": [ "University of Oxford" ] }, { "name": "Jorge Quintanilla", "affiliations": [ "University of Kent" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6e98", "url": "https://doi.org/10.1088/1367-2630/ae6e98", "title": "Thermodynamic significance of QUBO encoding on quantum annealers", "abstract": "Abstract Quadratic unconstrained binary optimization (QUBO) is the standard interface to quantum annealers, yet a single constrained task admits many QUBO encodings whose penalty choices reshape the energy landscape experienced by hardware. We study a Job Shop Scheduling instance using a two-parameter family of encodings controlled by penalty weights p sum (one-hot/sum constraints) and p pair (precedence constraints). Sweeping ( p sum , p pair ) , we observe sharp transitions in feasibility and solver success across classical annealing-inspired heuristics and on a D-Wave Advantage processor. Going beyond solution probability, we treat the annealer as an open thermodynamic system and perform cyclic reverse-annealing experiments initialized from thermal samples, measuring the stochastic processor energy change. From the first two moments of this energy change we infer lower bounds on entropy production, work, and exchanged heat via thermodynamic uncertainty relations, and corroborate the observed trends with adiabatic master equation simulations. We find that the same encoding transitions that govern computational hardness also reorganize dissipation: weak penalties generate low-energy infeasible manifolds, while overly strong penalties suppress the effective problem energy scale and increase irreversibility, reducing the thermodynamic efficiency. Our results establish QUBO penalties as thermodynamic control knobs and motivate thermodynamics-aware encoding strategies for noisy intermediate-scale quantum annealers.", "authors": [ { "name": "Emery Doucet", "affiliations": [ "University of Massachusetts, Boston", "University of Maryland, Baltimore County", "University of Maryland, Baltimore County" ] }, { "name": "Zakaria Mzaouali", "affiliations": [ "Forschungszentrum Jülich, Wilhelm-Johnen-Straße", "Universität Tübingen" ] }, { "name": "Reece Robertson", "affiliations": [ "University of Maryland, Baltimore County", "University of Maryland, Baltimore County", "University of Maryland, Baltimore County" ] }, { "name": "Bartłomiej Gardas", "affiliations": [ "Polish Academy of Sciences" ] }, { "name": "Sebastian Deffner", "affiliations": [ "University of Maryland, Baltimore County", "University of Maryland, Baltimore County", "National Quantum Laboratory" ] }, { "name": "Krzysztof Domino", "affiliations": [ "Polish Academy of Sciences" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6d2d", "url": "https://doi.org/10.1088/1367-2630/ae6d2d", "title": "Floquet quantum multiparameter estimation with periodic-driving-induced topological phase transition", "abstract": "Abstract Periodically driven systems provide a powerful platform for quantum multiparameter estimation. Constructing a static effective Hamiltonian in a proper rotating frame is commonly employed to assess the attainable precision. However, such an approach becomes nonfeasible for more general time-periodically driven systems. To tackle this dilemma, we develop a quantum multiparameter estimation strategy in the Floquet theory framework. The contributions of Floquet eigenmodes, quasienergies, and multi-photon processes to the quantum Fisher information matrix and measurement incompatibility are determined, respectively. Moreover, this approach is applied to a ring-shaped Rashba spin - orbit interferometer model exhibiting the topological phase transition (TPT). In the vicinity of the TPT boundary, we reveal a pronounced enhancement in the estimation precision of multiple parameters with the Heisenberg limit scaling and even higher. Meanwhile, the measurement incompatibility vanishes in an oscillatory manner, and the stroboscopic projective measurement enables the highest estimation precision achievable. This work provides a complete Floquet picture for time-dependent critical quantum multiparameter estimation.", "authors": [ { "name": "Yu Yang", "affiliations": [ "Xi’an Jiaotong University" ] }, { "name": "Yuyang Tang", "affiliations": [ "Xi’an Jiaotong University" ] }, { "name": "Pei Zhang", "affiliations": [ "Xi’an Jiaotong University" ] }, { "name": "Fuli Li", "affiliations": [ "Xi’an Jiaotong University" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "sensing", "categories": [ "sensing", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6df2", "url": "https://doi.org/10.1088/1367-2630/ae6df2", "title": "Graybox characterization and calibration with finite-shot estimation on superconducting-qubit experiments", "abstract": "Abstract Characterization and calibration of quantum devices are necessary steps to achieve fault-tolerant quantum computing. As quantum devices become more sophisticated, it is increasingly essential to rely not only on physics-based models but also on machine learning models with open-loop optimization. The Graybox approach is a recently proposed platform-agnostic method offering flexibility in modeling the implicit noise. Despite promising results in photonic qubits, its suitability for other platforms is still unknown. We investigate its performance and limitations under realistic conditions, both numerically and experimentally, for the characterization and calibration of gates on superconducting-qubit devices. We find that the Graybox approach performs well on the devices’ pulse-level controls and is able to search for pulse shapes of high-fidelity gates. However, an important limiting factor of the model’s ability to reduce the training errors is the finite number of measurement shots. We therefore derive analytical bounds to explain this limitation, and use them to indicate users whether the characterization performance is optimized. Furthermore, the model’s predictability also depends on other factors such as parameter drift that may occur between the characterization and calibration processes. Our results provide insights into quantum device characterization and gate optimization on superconducting qubits under realistic scenarios using the Graybox approach.", "authors": [ { "name": "Poramet Pathumsoot", "affiliations": [ "Keio University Shonan Fujisawa Campus" ] }, { "name": "Areeya Chantasri", "affiliations": [ "Optical and Quantum Physics Laboratory, Department of Physics, Faculty of Science" ] }, { "name": "Michal Hajdušek", "affiliations": [ "Keio University Shonan Fujisawa Campus" ] }, { "name": "Rodney Van Meter", "affiliations": [ "Keio University Shonan Fujisawa Campus" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae72bb", "url": "https://doi.org/10.1088/1367-2630/ae72bb", "title": "Electron spin drift in long-distance plasma wakefield acceleration", "abstract": "Abstract Plasma based wakefield acceleration of polarized electron beams has recently attracted considerable research interest. Previous works have found the forced spin oscillation of electrons due to two-dimensional betatron oscillation in particle trajectory and discovered longitudinal depolarization mechanism in plasma wakefield. In this work, we present a three-dimensional analytical model for the electron spin dynamics and derive the evolution of polarization during long-distance plasma wakefield acceleration. Our analysis reveals several phenomena including a transverse rotational spin drift leading to depolarization, a reversal of the drift frequency, and a consequent recovery of polarization. This work can offer guidance on future plasma-based accelerators for polarized electron beams.", "authors": [ { "name": "Yilan Guo", "affiliations": [ "Chinese Academy of Sciences Institute of High Energy Physics" ] }, { "name": "Ming Zeng", "affiliations": [ "Chinese Academy of Sciences Institute of High Energy Physics" ] }, { "name": "Dazhang Li", "affiliations": [ "Chinese Academy of Sciences Institute of High Energy Physics" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae72ba", "url": "https://doi.org/10.1088/1367-2630/ae72ba", "title": "Most incompatible measurements and sum-of-squares optimisation", "abstract": "Abstract Measurement incompatibility, or joint measurability, is a cornerstone of quantum theory and a useful resource. For finite-dimensional systems, quantifying this resource and establishing universal bounds valid for all measurements is a long-standing problem. In this work, we exhibit analytical universal parent measurements giving access to bounds that beat the state of the art. In particular, we can show that, for relevant robustnesses, sets of anticommuting observables give rise to the most incompatible dichotomic measurements. We also formalise the construction of such universal parent measurements in the framework of sum-of-squares optimisation and obtain preliminary numerical results demonstrating the power of the method by improving on our own analytical values. All results find direct application for demonstrating genuine high-dimensional steering, that is, certifying the dimensionality of a quantum system in a one-sided device-independent manner.", "authors": [ { "name": "Sébastien Designolle", "affiliations": [ "Zuse Institute Berlin" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae72bc", "url": "https://doi.org/10.1088/1367-2630/ae72bc", "title": "Analytical response functions for a compressible thin fluid layer with odd viscosity", "abstract": "Abstract Fluids composed of chiral active components can exhibit odd viscosity, a property that breaks time-reversal and parity symmetries. We investigate the hydrodynamic response to monopole and dipole singularities in a compressible thin fluid layer with odd viscosity, supported by a conventional lubrication layer. Using the two-dimensional Green's function in Fourier space, we derive exact analytical solutions for the flow and pressure fields. These solutions provide a detailed description of the hydrodynamic interactions governing the motion of colloidal particles and microswimmers in confined chiral fluids, offering insight into the role of odd viscosity in modifying particle dynamics and collective behavior. The derived results are directly applicable to modeling transport, control, and self-organization phenomena in active and chiral microfluidic systems.", "authors": [ { "name": "Abdallah Daddi-Moussa-Ider", "affiliations": [ "The Open University" ] }, { "name": "Yuto Hosaka", "affiliations": [ "Max-Planck-Institute for Dynamics and Self-Organization" ] }, { "name": "Shigeyuki Komura", "affiliations": [ "University of the Chinese Academy of Sciences Wenzhou Institute" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6c54", "url": "https://doi.org/10.1088/1367-2630/ae6c54", "title": "Benchmarking optimization algorithms for automated calibration of quantum devices", "abstract": "Abstract We present the results of a comprehensive study of optimization algorithms for the calibration of quantum devices. As part of our ongoing efforts to automate bring-up, tune-up, and system identification procedures, we investigate a broad range of optimizers within a simulated environment designed to closely mimic the challenges of real-world experimental conditions. Our benchmark includes widely used algorithms such as Nelder - Mead and the state-of-the-art covariance matrix adaptation evolution strategy (CMA-ES). We evaluate performance in both low-dimensional settings, representing simple pulse shapes used in current optimal control protocols with a limited number of parameters, and high-dimensional regimes, which reflect the demands of complex control pulses with many parameters. Based on our findings, we recommend the CMA-ES algorithm and provide empirical evidence for its superior performance across all tested scenarios.", "authors": [ { "name": "Kevin Pack", "affiliations": [ "Forschungszentrum Jülich" ] }, { "name": "Shai Machnes", "affiliations": [ "Qruise GmbH" ] }, { "name": "Frank K Wilhelm", "affiliations": [ "Forschungszentrum Jülich" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6baf", "url": "https://doi.org/10.1088/1367-2630/ae6baf", "title": "Characterizing quantum synchronization in the van der Pol oscillator via tomogram and photon correlation", "abstract": "Abstract Scalable methods for detecting and quantifying the nonclassical nature of a quantum state in noisy environments are challenging due to a complex relationship between noise and quantum coherence. In particular, identifying experimentally accessible signatures of synchronization in such regimes remains an open problem. By leveraging promising experimental implementation, we underpin what possible direct measures of nonclassicality are available. This work outlines accessing quantum synchronization (QS) in the steady state of a driven quantum van der Pol oscillator (vdPo) using two distinct figures of merit: (i) the nonclassical area δ and (ii) the second-order correlation function g ( 2 ) ( 0 ) , both of which are viable in experimental architectures. The nonclassical area quantifier based on homodyne tomography allows us to assess the nonclassical nature of the vdPo state directly from the tomogram without requiring full state reconstruction or Wigner function negativity. Within a well-defined parameter regime of drive strength and detuning, both δ and g ( 2 ) ( 0 ) exhibit pronounced signatures of synchronization that complements the phase coherence between the drive and the vdPo. We derive an analytical expression for the steady state density matrix and the corresponding tomogram of the system, valid for arbitrary strengths of the harmonic drive. Analysis of the quantum tomogram uncovers clear phase locking behavior, enabling the identification of the synchronization region (Arnold tongue) directly in terms of g ( 2 ) ( 0 ) and δ . Furthermore, the behavior of g ( 2 ) ( 0 ) provides a statistical perspective that reinforces the tomographic signatures of QS. By analyzing the interplay between the aforementioned metrics, our findings indicate a scalable and experimentally relevant framework for characterizing QS in the driven vdPo.", "authors": [ { "name": "Kingshuk Adhikary", "affiliations": [ "Indian Association for the Cultivation of Science", "The Institute of Mathematical Sciences" ] }, { "name": "K M Athira", "affiliations": [ "University of Calicut", "University of Calicut" ] }, { "name": "M Rohith", "affiliations": [ "University of Calicut", "University of Calicut" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": true, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae714e", "url": "https://doi.org/10.1088/1367-2630/ae714e", "title": "Construction of near-Γ multiple chiral exceptional points in momentum space of photonic crystal slabs", "abstract": "Abstract Exceptional points (EPs) in optical systems have attracted considerable attention because of their nontrivial topological properties and unusual physical effects. Among them, scattering EPs are particularly appealing for describing chiral response through the scattering matrix. Photonic crystal slabs offer a versatile platform for studying chiral scattering EPs in momentum space, where their topological evolution can be conveniently accessed and engineered. In this work, a convenient approach is presented for achieving chiral scattering EPs near the Γ point by exploiting the topological evolution properties in the momentum space of photonic crystal slabs. By varying the structural parameters of the photonic crystal slabs, multiple chiral EPs are identified near the Γ point, with their evolution and annihilation processes systematically analyzed. Furthermore, the pronounced transmission asymmetry observed near the EP enables polarization conversion from linear to circular, functioning as a quarter-wave plate. This approach provides a straightforward method for realizing and controlling chiral EPs in momentum space, thereby expanding the potential for practical applications in optical metadevices.", "authors": [ { "name": "Jingyu Zhang", "affiliations": [ "Harbin Engineering University" ] }, { "name": "Yang Gao", "affiliations": [ "Heilongjiang University" ] }, { "name": "Tianfu Ma", "affiliations": [ "Harbin Engineering University" ] }, { "name": "Wenjia Li", "affiliations": [ "Harbin Engineering University" ] }, { "name": "Weimin Ye", "affiliations": [ "National University of Defense Technology" ] }, { "name": "Jianlong Liu", "affiliations": [ "Harbin Engineering University" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6bb0", "url": "https://doi.org/10.1088/1367-2630/ae6bb0", "title": "From lone-pair electrons to dual phonon channels: unraveling Te-dominated transport in monolayer Sb 2 Te 3", "abstract": "Abstract Conventional Peierls theory is inadequate for describing thermal transport in strongly anharmonic compounds, such as two-dimensional layered chalcogenides containing lone-pair electrons; the underlying physics of their ultralow thermal conductivity remains to be explored. Here, using monolayer Sb 2 Te 3 as a model system, we elucidate the mechanism behind its ultralow lattice thermal conductivity by evaluating the competing contributions of particle-like propagation and wave-like tunneling. The particle-like transport channel is suppressed by the dominant quartic anharmonicity induced by the stereochemically active lone-pair electrons of the tetrahedrally coordinated Te ( 1 ) - 5 p z orbital, primarily via enhancement of four-phonon scattering. In contrast, the wave-like transport channel is enhanced by the flattening of the Te ( 2 ) -derived phonon branches, a result of the relatively weak covalent bonding in the octahedral coordination, thereby promoting phonon coherence. Consequently, the combined model of the Te ( 1 ) -dominated particle-like and Te ( 2 ) -dominated wave-like channels accurately accounts for the total thermal conductivity, achieving excellent agreement with experimental measurements in both magnitude and temperature dependence. For example, the calculated T − 0.73 scaling exponent for the temperature dependence closely matches the experimental value of T − 0.76 . Our work identifies the interplay of lone-pair electrons and covalent bonding configuration as a key governing mechanism for thermal transport in two-dimensional layered chalcogenides, providing a novel perspective on their thermal properties.", "authors": [ { "name": "Kai Wu", "affiliations": [ "School of Materials and Physics" ] }, { "name": "Ran Zhou", "affiliations": [ "Beihang University" ] }, { "name": "Hongliang Shi", "affiliations": [ "Beihang University" ] }, { "name": "Yifeng Duan", "affiliations": [ "School of Materials and Physics" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae714f", "url": "https://doi.org/10.1088/1367-2630/ae714f", "title": "Symmetry-induced logarithmic relaxation in the quantum kicked rotor", "abstract": "Abstract We study the effect of discrete symmetries on coherent multiple scattering in the quantum kicked rotor. When the initial momentum is set to zero - as in recent Bose - Einstein condensate experiments - the effective pseudo-disorder becomes even under momentum inversion. The resulting discrete mirror symmetry of the dynamics profoundly alters spectral correlations: it generates quasi-degenerate Floquet doublets localised at opposite momenta, whose exponentially small splittings produce a hierarchy of exponentially large dynamical timescales. The coherent backscattering and forward-scattering peaks then exhibit a striking non-monotonic evolution and strongly asymmetric contrasts, followed by an exceptionally slow logarithmic relaxation toward a common asymptotic value - a hallmark of glassy dynamics, here emerging in a fully coherent quantum system. That such archetypal glass-like behaviour arises from a single discrete symmetry constraint reveals an unexpected and deep connection between quantum coherence and slow relaxation phenomena.", "authors": [ { "name": "Julien Hebraud", "affiliations": [ "Universite Paul Sabatier" ] }, { "name": "Floriane Arrouas", "affiliations": [ "Université Paul Sabatier" ] }, { "name": "Bruno Peaudecerf", "affiliations": [ "Universite Paul Sabatier" ] }, { "name": "Juliette Billy", "affiliations": [ "Université Paul Sabatier" ] }, { "name": "David Guery-Odelin", "affiliations": [ "Université Paul Sabatier" ] }, { "name": "Oliver Giraud", "affiliations": [ "LPTMS" ] }, { "name": "B Georgeot", "affiliations": [ "Universite Paul Sabatier" ] }, { "name": "Gabriel Lemarié", "affiliations": [ "INPHYNI" ] }, { "name": "Christian Miniatura", "affiliations": [ "INPHYNI" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae7150", "url": "https://doi.org/10.1088/1367-2630/ae7150", "title": "Integrated error-suppressed pipeline for quantum optimization of nontrivial binary combinatorial optimization problems on gate-model hardware at the 156-qubit scale", "abstract": "Abstract We introduce a novel hybrid quantum-classical variational optimization method for unconstrained binary combinatorial optimization problems on gate-model quantum computers, integrating a custom variational ansatz, staged feedback-based dual variational parameter update strategies, efficient parametric compilation, automated error suppression during hardware execution, and scalable O(n) classical post-processing to correct for bitflip errors. Without this integrated approach, we show that standard circuit execution at scale produces output indistinguishable from random sampling, establishing the necessity of each pipeline component. We benchmark the method on IBM superconducting quantum computers for several optimization problems drawn from NP-hard problem classes, where the optimization is conducted on hardware with no use of classical simulation or prior knowledge of the solution. For Max-Cut on random regular graphs with topologies not matched to device connectivity, the method achieves approximation ratios of 100% for unweighted 3-regular graphs up to 156 nodes, weighted regular graphs up to 80 nodes, and weighted 7-regular graphs up 50 nodes. Applied to higher-order binary optimization, the method finds the ground state energy of 127-and 156-qubit spin-glass models matched to device topology with linear, quadratic, and cubic interaction terms, achieving approximation ratios of at least 99.5% across all instances tested. The method consistently outperforms a classical local solver across all problems. Where published results on identical problem instances are available, our method demonstrates competitive or superior performance. These results demonstrate that an appropriately engineered variational approach enables gate-model quantum computers to produce high-quality solutions for binary optimization problems drawn from NP-hard problem classes at the 156-qubit scale, where naïve implementations are insufficient for good performance.", "authors": [ { "name": "Natasha Sachdeva", "affiliations": [ "Q-CTRL" ] }, { "name": "Gavin S Hartnett", "affiliations": [ "Q-CTRL" ] }, { "name": "Smarak Maity", "affiliations": [ "Q-CTRL" ] }, { "name": "Samuel Marsh", "affiliations": [ "Q-CTRL" ] }, { "name": "Yulun Wang", "affiliations": [ "Q-CTRL" ] }, { "name": "Adam Winick", "affiliations": [ "Q-CTRL" ] }, { "name": "Ryan Dougherty", "affiliations": [ "Q-CTRL" ] }, { "name": "Daniel Canuto", "affiliations": [ "Q-CTRL" ] }, { "name": "You Quan Chong", "affiliations": [ "Q-CTRL" ] }, { "name": "Gary Adam Cox", "affiliations": [ "Q-CTRL" ] }, { "name": "Michael Robert Hush", "affiliations": [ "Q-CTRL" ] }, { "name": "Pranav S Mundada", "affiliations": [ "Q-CTRL" ] }, { "name": "Christopher D Bentley", "affiliations": [ "Q-CTRL" ] }, { "name": "Yuval Baum", "affiliations": [ "Q-CTRL" ] }, { "name": "Michael Biercuk", "affiliations": [ "Q-CTRL" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae70d4", "url": "https://doi.org/10.1088/1367-2630/ae70d4", "title": "Evolutionary vaccination dynamics under higher-order reinforcement pressure", "abstract": "Abstract Vaccination games in higher-order settings remain underexplored, despite their importance in shaping opinions and collective decisions. Here, we introduce a parsimonious behavioral-epidemiological model to evaluate how peer reinforcement influences vaccination uptake. The framework consists of a two-layer multiplex: an epidemic layer governed by the SIR process on a square lattice, and a behavioral layer represented by a hypergraph of triadic interactions. Individuals update their vaccination strategy via imitation, modulated by a reinforcement modulation parameter $\\alpha$ when local agreement with a like-minded peer is present. We find that higher-order structure alone induces clusters of vaccinated individuals that act as protective barriers. Small but nonzero values of $\\alpha$ ($\\alpha \\approx 0.05$) maximize vaccination coverage and suppress outbreaks, while both the limiting case $\\alpha \\approx 0$ and larger values ($\\alpha > 0.1$) reduce uptake. This non-monotonic effect suggests that excessively strong local inhibition suppresses adaptability, whereas weaker inhibition facilitates the re-emergence of non-vaccinators. Our work bridges complex contagion theory with evolutionary game dynamics, offering insights into how contact structure and peer reinforcement jointly shape vaccination behavior.", "authors": [ { "name": "Yikang Lu", "affiliations": [ "Yunnan University of Finance and Economics" ] }, { "name": "Ying Wang", "affiliations": [ "Yunnan University of Finance and Economics" ] }, { "name": "Alfonso de Miguel Arribas", "affiliations": [ "Zaragoza Logistics Center (ZLC)" ] }, { "name": "Lei Shi", "affiliations": [ "Yunnan University of Finance and Economics" ] }, { "name": "Yamir Moreno", "affiliations": [ "Universidad de Zaragoza" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6fde", "url": "https://doi.org/10.1088/1367-2630/ae6fde", "title": "Non-equilibrium symmetry of cyclic first-passage times", "abstract": "Abstract We study the sum of first passage times along an arbitrary cycle made up of N>2 states of a small physical system. We show that, if the system is at thermodynamic equilibrium, this sum follows the same probability distribution regardless of whether the cycle is explored clockwise or counterclockwise. Out of equilibrium, the distributions of clockwise and counterclockwise cyclic first passage times are related by a detailed fluctuation theorem. This result descends from a symmetry of clockwise and counterclockwise trajectories, which combines time reversal with swapping portions of the trajectories. We then relate the entropy produced along the cycle with the entropy production of the whole system using large deviation theory. Our results reveal a novel symmetry in stochastic systems, of potential broad applicability in non-equilibrium physics.", "authors": [ { "name": "Daniel Maria Busiello", "affiliations": [ "Max-Planck-Institute for the Physics of Complex Systems" ] }, { "name": "Shiling Liang", "affiliations": [ "Max-Planck-Institute for the Physics of Complex Systems" ] }, { "name": "Simone Pigolotti", "affiliations": [ "Okinawa Institute of Science and Technology Graduate University" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6fdf", "url": "https://doi.org/10.1088/1367-2630/ae6fdf", "title": "Continuous thermochemical sources of AlF molecules", "abstract": "Abstract The AlF molecule, currently subject to laser cooling and trapping efforts, has the advantage that it can be efficiently produced in a thermochemical reaction between sublimated aluminum trifluoride and aluminum metal. Here we present a series of experiments with continuous molecular beam sources of AlF, utilising this reaction. We demonstrate a compact AlF molecular beam oven whose total far-field brightness is 5 × 10 15 molecules per steradian per second at 923 K, just below the melting temperature of aluminum metal. The continuous output from the oven begins to exceed the peak brightness of a jet-cooled, ablation-based supersonic AlF source for the v = 0, J = 7 level, and we obtain an excellent signal-to-noise ratio with the oven in pulsed laser ionisation spectroscopy experiments. By delivering flux from the oven into a cryogenic Ne buffer gas cell, we lower the rotational temperature of the beam to around 30 K and reduce its most probable forward velocity from 600 m/s to 200 m/s. In addition, we demonstrate that AlF can be made in a simple dispenser package, and observe that molecules thermalise to the laboratory temperature after colliding with vacuum chamber walls of the experiment. The resulting transient AlF vapour may enable direct loading of a molecular magneto-optical trap.", "authors": [ { "name": "Pulkit Kukreja", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Priyansh Agarwal", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Maximilian Doppelbauer", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Jionghao Cai", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Xiangyue Liu", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "José Eduardo Padilla-Castillo", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Sebastian Kray", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Russell Thomas", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Henrik Haak", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Stefan Truppe", "affiliations": [ "Imperial College London" ] }, { "name": "Boris G Sartakov", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Gerard Meijer", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] }, { "name": "Sid Wright", "affiliations": [ "Fritz Haber Institut der Max-Planck-Gesellschaft" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6f45", "url": "https://doi.org/10.1088/1367-2630/ae6f45", "title": "Asymmetric photon bunching recurring interferences and distributions via quantum frequency combs", "abstract": "Abstract Quantum frequency combs (QFCs) exhibit periodic temporal recurrences arising from the Fourier transform of their mode-locked frequency spectra. While QFCs have been experimentally demonstrated, asymmetric Hong-Ou-Mandel (HOM) revival interference in QFCs has not been systematically investigated, and the efficient distribution of photon-bunching revivals has remained unreported. Here, we present the first experimental observation and distribution of asymmetric HOM recurrence interference using QFCs. First, we verified HOM revivals spanning 10 time-bins in a 10.21 GHz QFC, obtaining a 72.95 ± 0.8% visibility for its central dip. Then, we measured up to 20 time-bins from a 50 GHz QFC, with an accidental-subtracted central HOM dip visibility of 70.82 ± 0.7%. Finally, we distributed the QFC after 21-km optical fibers without dispersion compensation, observing photon bunching measurements across 12 time-bins, with a central dip visibility of 70.5 ± 0.9%. The deviation from ideal HOM interference is attributed to residual frequency distinguishability between the signal and idler photons, as confirmed in our theoretical calculations. These results establish QFCs as a viable platform for advanced quantum information processing tasks, such as high-dimensional entanglement swapping and quantum communication testbeds.", "authors": [ { "name": "Kai-Chi Chang", "affiliations": [ "University of California Los Angeles" ] }, { "name": "Xiang Cheng", "affiliations": [ "University of California Los Angeles" ] }, { "name": "Yujie Chen", "affiliations": [ "University of California Los Angeles" ] }, { "name": "Chee Wei Wong", "affiliations": [ "University of California Los Angeles" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6e96", "url": "https://doi.org/10.1088/1367-2630/ae6e96", "title": "Equivalence of genuine multipartite entanglement and nonlocality of nearly symmetric multiqubit pure states", "abstract": "Abstract Whether every pure genuinely multipartite entangled (GME) state necessarily exhibits genuine multipartite nonlocality (GMNL) remains an open question. By combining a recently proposed Bell inequality [I. Stachura et al., New J. Phys. 26, 093029 (2024)] with Hardy's paradox and the canonical decomposition of pure states, we analytically demonstrate that all highly symmetric, genuinely entangled multipartite qubit states exhibit genuine multipartite nonlocality, thereby supporting Gisin's conjecture in the multipartite setting. This result constitutes a step toward a general proof of the conjectured equivalence between GME and GMNL in quantum theory.", "authors": [ { "name": "Jakub Wojcik", "affiliations": [ "Polish Academy of Sciences" ] }, { "name": "Wojciech Bruzda", "affiliations": [ "Polish Academy of Sciences" ] }, { "name": "Ignacy Stachura", "affiliations": [ "Polish Academy of Sciences" ] }, { "name": "Remigiusz Augusiak", "affiliations": [ "Polish Academy of Sciences" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae66a9", "url": "https://doi.org/10.1088/1367-2630/ae66a9", "title": "Current density distribution for the quantum Hall effect", "abstract": "Abstract Our microscopic understanding of the integer quantum Hall effect is still incomplete. For decades, there has been a controversial discussion about ‘where the current flows’ if the Hall resistance is quantized. Here, we analyze the current density distribution in a Hall bar based on the screening properties of a two-dimensional electron system in the quantum Hall regime. Compared to previous publications, we consider the non-local nature of the quantum Hall effect and include a related persistent current that exists inside a Hall bar if the Hall resistance is quantized. We find, that the persistent current density decreases with increasing Hall voltage. Accounting for this dependence, we find, that the current flows in the opposite directions along opposite edges of the Hall bar, while the share of the current imposed through the contacts flows along the edge of the Hall bar with the higher chemical potential.", "authors": [ { "name": "Serkan Sirt", "affiliations": [ "Paul-Drude-Institut für Festkörperelektronik, Leibniz-Institut im Forschungsverbund Berlin e.V." ] }, { "name": "Stefan Ludwig", "affiliations": [ "Paul-Drude-Institut für Festkörperelektronik, Leibniz-Institut im Forschungsverbund Berlin e.V." ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6e68", "url": "https://doi.org/10.1088/1367-2630/ae6e68", "title": "Quantum Zeno effect versus adiabatic quantum computing and quantum annealing", "abstract": "Abstract For the adiabatic version of Grover's quantum search algorithm as proposed by Roland and Cerf, we study the impact of decoherence caused by a rather general coupling to some environment. For quite generic conditions, we find that the quantum Zeno effect poses &#xD;strong limitations on the performance (quantum speed-up) since the environment effectively measures the state of the system permanently and thereby inhibits or slows down quantum transitions. Generalizing our results, we find that similar restrictions should apply universally to adiabatic quantum algorithms and quantum annealing schemes which are based on analogous isolated Landau-Zener type transitions at avoided level crossings (similar to first-order phase transitions). As a possible resort, more gradual changes of the quantum state (as in second-order phase transitions) or suitable error-correcting schemes such as the spin-echo method may alleviate this problem.", "authors": [ { "name": "Naser Ahmadiniaz", "affiliations": [ "Helmholtz-Zentrum Dresden-Rossendorf" ] }, { "name": "Dennis Kraft", "affiliations": [ "Helmholtz-Zentrum Dresden-Rossendorf" ] }, { "name": "Gernot Schaller", "affiliations": [ "Helmholtz-Zentrum Dresden-Rossendorf" ] }, { "name": "Ralf Schuetzhold", "affiliations": [ "Helmholtz-Zentrum Dresden-Rossendorf" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6e99", "url": "https://doi.org/10.1088/1367-2630/ae6e99", "title": "Geometry-resolved suppression of patch-potential heating in skeleton-electrode ion traps", "abstract": "Abstract We present a quantitative, geometry-resolved framework to evaluate the effects of patch-potential noise in realistic three-dimensional Paul-trap structures. As a concrete application, we analyze a skeleton-electrode architecture and compare its performance against a conventional blade trap under identical ion-to-electrode distances and matched confinement parameters. The skeleton geometry achieves a suppression of motional heating exceeding 50%, with heating rate ratios of Γ skeleton /Γ blade = 0.455(19) for the axial mode and 0.473(26) for the radial mode. Patch-by-patch heating maps reveal that over 99% of the noise contribution originates from electrode surfaces within 500 μm of the ion. We identify that axial heating follows a non-monotonic profile, with dominant \"hotspots\" located at an intermediate distance of approximately 110 μm. This behavior is driven by the vectorial directionality of the electric-field components, which provide the strongest axial coupling at these intermediate regions. Guided by these maps, we demonstrate a proof-of-principle electrode reconfiguration where segmented gaps are aligned with identified hotspots. This strategy successfully reduces axial heating even when the total electrode surface area increases, confirming that the spatial distribution of noise coupling - rather than total conductor area - is the primary driver of motional heating. These findings establish geometry-guided design as a practical route to suppress heating in trapped-ion platform, and the proposed skeleton architecture is compatible with advanced fabrication techniques, including metal additive manufacturing.", "authors": [ { "name": "Chon-Teng Belmiro Chu", "affiliations": [ "Hon Hai Precision Industry Co Ltd" ] }, { "name": "Hao-Chung Chen", "affiliations": [ "Hon Hai Precision Industry Co Ltd" ] }, { "name": "Ting Hsu", "affiliations": [ "Hon Hai Precision Industry Co Ltd" ] }, { "name": "Hsiang-Yu Lo", "affiliations": [ "Hon Hai Precision Industry Co Ltd" ] }, { "name": "Ming-Shien Chang", "affiliations": [ "Academia Sinica" ] }, { "name": "Guin-Dar Lin", "affiliations": [ "National Taiwan University" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae652b", "url": "https://doi.org/10.1088/1367-2630/ae652b", "title": "Demonstration of a Raman velocity filter in collinear laser spectroscopy: towards applications for sub-ppm high-voltage measurements", "abstract": "Abstract Raman transitions have a wide range of applications in atomic physics and have recently been proposed as a means for improving high-precision high-voltage measurements. Here, we present a theoretical analysis and a first experimental demonstration of 5 s 2 S 1 / 2 4 d 2 D 3 / 2 , 5 / 2 Raman transitions in 88 Sr + ions in collinear laser spectroscopy (CLS). For the theoretical description the three-level system is reduced to an effective two-level system, in order to estimate the experimental parameters, while the role of the spatial laser intensity distribution in combination with the radial extension of the ion beam are elucidated by performing simulations of the full four-level system. Experimentally, we realized the first velocity-selective Raman transition in CLS. Using a 88 Sr + ion beam, we demonstrate a reduction in the energy width to less than 200 meV, which is about an order of magnitude reduction compared to the usage of an optical dipole transition as in previous works. We also investigate two-photon Rabi oscillations and show that their observed collapse is consistent with the simulations.", "authors": [ { "name": "Julien Spahn", "affiliations": [ "Technische Universität Darmstadt" ] }, { "name": "Hendrik Bodnar", "affiliations": [ "Technische Universität Darmstadt" ] }, { "name": "Kristian König", "affiliations": [ "Technische Universität Darmstadt", "GSI Helmholtzzentrum für Schwerionenforschung" ] }, { "name": "Wilfried Nörtershäuser", "affiliations": [ "Technische Universität Darmstadt", "GSI Helmholtzzentrum für Schwerionenforschung" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1088/1367-2630/ae6ded", "url": "https://doi.org/10.1088/1367-2630/ae6ded", "title": "Optimizing QUBO on a quantum computer by mimicking imaginary time evolution", "abstract": "Abstract We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to mimic short-time imaginary time evolution, using only single-and two-qubit expectation values. This significantly reduces the measurement overhead by avoiding full energy evaluation. By updating the initial state based on results from last step iteratively, the algorithm quickly converges to the low-energy solutions. With a pre-sorting step that optimizes quantum gate ordering based on QUBO coefficients, the convergence is further improved. Our classical simulations achieve approximation ratios above 99% up to 150 qubits. Furthermore, the linear scaling of entanglement entropy with system size suggests that the circuit is challenging to simulate classically using tensor networks. We also demonstrate hardware runs on IBM's device for 40, 60, and 80 qubits, and obtain solutions compatible with that from simulated annealing.", "authors": [ { "name": "Yahui Chai", "affiliations": [ "DESY Standort Zeuthen" ] }, { "name": "Alice Di Tucci", "affiliations": [ "DESY Standort Zeuthen" ] } ], "journal": { "id": "njp", "title": "New Journal of Physics", "issn": [ "1367-2630" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "general" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s41467-026-73790-x", "url": "https://doi.org/10.1038/s41467-026-73790-x", "title": "An artefact-resilient wide bandwidth bidirectional graphene neural interface", "abstract": "", "authors": [ { "name": "Michał Prokop", "affiliations": [] }, { "name": "Martín Esparza-Iaizzo", "affiliations": [] }, { "name": "Eduard Masvidal-Codina", "affiliations": [] }, { "name": "Xavi Illa", "affiliations": [] }, { "name": "Neela K. Codadu", "affiliations": [] }, { "name": "Daman Rathore", "affiliations": [] }, { "name": "Nicola Ria", "affiliations": [] }, { "name": "Kostas Kostarelos", "affiliations": [] }, { "name": "Elena del Corro", "affiliations": [] }, { "name": "Ramon Garcia-Cortadella", "affiliations": [] }, { "name": "Rob C. Wykes", "affiliations": [] }, { "name": "Anton Guimerà-Brunet", "affiliations": [] }, { "name": "Jose A. Garrido", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73623-x", "url": "https://doi.org/10.1038/s41467-026-73623-x", "title": "Reference-point dependent reinforcement learning in humans and rats", "abstract": "", "authors": [ { "name": "Lachlan A. Ferguson", "affiliations": [] }, { "name": "Magdalena Soukupova", "affiliations": [] }, { "name": "Sébastien Bouret", "affiliations": [] }, { "name": "Stefano Palminteri", "affiliations": [] }, { "name": "Shauna L. Parkes", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73792-9", "url": "https://doi.org/10.1038/s41467-026-73792-9", "title": "Mapping global resource driven nature loss in the mining sector from 2001 to 2022", "abstract": "", "authors": [ { "name": "Yu-Tong Cheng", "affiliations": [] }, { "name": "Nguyen Tien Hoang", "affiliations": [] }, { "name": "Yushin Shinoda", "affiliations": [] }, { "name": "Kamrul Islam", "affiliations": [] }, { "name": "Masaharu Motoshita", "affiliations": [] }, { "name": "Taku Kadoya", "affiliations": [] }, { "name": "Keiichiro Kanemoto", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73726-5", "url": "https://doi.org/10.1038/s41467-026-73726-5", "title": "Brain FGF2 and NCAM1 contribute to FGFR1-dependent progression of estrogen receptor-positive breast cancer brain metastases", "abstract": "Abstract Estrogen receptor-positive breast cancer represents a significant proportion of breast cancer brain metastasis but remains understudied. Here we show that FGFR1-amplification, a well-established driver of estrogen receptor-positive breast cancer endocrine resistance, promotes estrogen receptor-positive breast cancer brain metastatic colonization in young and aged female mice, through both canonical FGF2/FGFR1 signaling and non-canonical NCAM1/FGFR1 interactions. Astrocytic FGF2-mediated paracrine activation of FGFR1 promotes breast cancer brain metastasis in estrogen-treated young mice, but FGF2 levels and signaling decrease in the brain with aging and estrogen-depletion. Neuronal and astrocytic NCAM1, which remain unchanged in young and aged brains, promote adhesion to neurons, migration, and growth of estrogen receptor-positive cells, suggesting that interactions with astrocytes and neurons facilitate early estrogen receptor-positive breast cancer brain metastasis colonization through FGFR1. Importantly, FDA-approved FGFR inhibitors effectively block early colonization but not late-stage brain metastases, suggesting prevention of FGFR1+ brain metastases as a window of opportunity for FGFR1 inhibitors.", "authors": [ { "name": "Morgan S. Fox", "affiliations": [] }, { "name": "Jenny A. Jaramillo-Gómez", "affiliations": [] }, { "name": "R. Alejandro Marquez-Ortiz", "affiliations": [] }, { "name": "Karen L. F. Alvarez-Eraso", "affiliations": [] }, { "name": "Maria J. Contreras-Zárate", "affiliations": [] }, { "name": "Trinh C. Pham", "affiliations": [] }, { "name": "Elaina N. Barela", "affiliations": [] }, { "name": "Stella N. Koliavas", "affiliations": [] }, { "name": "Peter Kabos", "affiliations": [] }, { "name": "Natalie J. Serkova", "affiliations": [] }, { "name": "Carol A. Sartorius", "affiliations": [] }, { "name": "Elizabeth A. Wellberg", "affiliations": [] }, { "name": "Diana M. Cittelly", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-72135-y", "url": "https://doi.org/10.1038/s41467-026-72135-y", "title": "Superconductivity from quasiparticle pairing of intervalley coherent state in rhombohedral trilayer graphene", "abstract": "Abstract Superconductivity is observed in rhombohedral trilayer graphene in a narrow regime between the flavour-symmetric state and the symmetry breaking phase, which cannot be described by the conventional Bardeen-Cooper-Schrieffer theory. The measured coherence length, for instance, is roughly two orders of magnitude shorter than the value predicted by the Bardeen-Cooper-Schrieffer relation based on the large fermi velocity and an extremely low charge carrier density of the flavour-symmetric phase. To resolve the discrepancies, we propose that the rhombohedral trilayer graphene superconducting phase arises from the pairing of quasiparticles of the adjacent inter-valley coherent state. We illustrate the superconducting phenomenology using gapped Dirac cones with the chemical potential μ close to the valence band’s edge. Our findings indicate that the transition temperature T c obeys $${T}_{c}\\propto {\\epsilon }_{D}\\exp (-2/{\\rho }_{\\rm{qp}}U)$$ T c ∝ ϵ D exp ( − 2 / ρ qp U ) with the density of states ρ qp of intervalley coherent state quasiparticles, which is much suppressed compared to predictions from the Bardeen-Cooper-Schrieffer theory. The coherence length ξ we predict behaves according to $$\\xi \\sim v/\\sqrt{\\mu {T}_{c}}$$ ξ ~ v / μ T c with v being the velocity of Dirac cone. Applying our assumption to a microscopic model, our predictions align well with experimental data and effectively capture key measurable quantities such as the transition temperature T c and the coherence length ξ `without parameter fine-tuning.", "authors": [ { "name": "Chun Wang Chau", "affiliations": [] }, { "name": "Shuai A. Chen", "affiliations": [] }, { "name": "K. T. Law", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73429-x", "url": "https://doi.org/10.1038/s41467-026-73429-x", "title": "Retraction Note: Daylight saving time affects European mortality patterns", "abstract": "", "authors": [ { "name": "Laurent Lévy", "affiliations": [] }, { "name": "Jean-Marie Robine", "affiliations": [] }, { "name": "Grégoire Rey", "affiliations": [] }, { "name": "Raúl Fernando Méndez Turrubiates", "affiliations": [] }, { "name": "Marcos Quijal-Zamorano", "affiliations": [] }, { "name": "Hicham Achebak", "affiliations": [] }, { "name": "Joan Ballester", "affiliations": [] }, { "name": "Xavier Rodó", "affiliations": [] }, { "name": "François R. Herrmann", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73797-4", "url": "https://doi.org/10.1038/s41467-026-73797-4", "title": "A lipidomics roadmap: from basic research to societal challenges", "abstract": "", "authors": [ { "name": "Maria Fedorova", "affiliations": [] }, { "name": "Anne K. Bendt", "affiliations": [] }, { "name": "Justine Bertrand-Michel", "affiliations": [] }, { "name": "Oliver Fiehn", "affiliations": [] }, { "name": "Joanna Godzien", "affiliations": [] }, { "name": "Laura Goracci", "affiliations": [] }, { "name": "Florian Gruber", "affiliations": [] }, { "name": "Xue Li Guan", "affiliations": [] }, { "name": "Xianlin Han", "affiliations": [] }, { "name": "Michal Holčapek", "affiliations": [] }, { "name": "Julia Kuligowski", "affiliations": [] }, { "name": "Peter J. Meikle", "affiliations": [] }, { "name": "Palina Nepachalovich", "affiliations": [] }, { "name": "Valerie B. O’Donnell", "affiliations": [] }, { "name": "Matej Orešič", "affiliations": [] }, { "name": "Sider Penkov", "affiliations": [] }, { "name": "Snježana Petrović", "affiliations": [] }, { "name": "Anton Potapov", "affiliations": [] }, { "name": "Patricia Prabutzki", "affiliations": [] }, { "name": "Laura Righetti", "affiliations": [] }, { "name": "Tatjana Ruskovska", "affiliations": [] }, { "name": "Andrej Shevchenko", "affiliations": [] }, { "name": "Kai Simons", "affiliations": [] }, { "name": "Corinne M. Spickett", "affiliations": [] }, { "name": "Olga Vvedenskaya", "affiliations": [] }, { "name": "Jennifer Watts", "affiliations": [] }, { "name": "Markus R. Wenk", "affiliations": [] }, { "name": "Michael Witting", "affiliations": [] }, { "name": "Yu Xia", "affiliations": [] }, { "name": "Baoru Yang", "affiliations": [] }, { "name": "Maria Rosário Domingues", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-71434-8", "url": "https://doi.org/10.1038/s41467-026-71434-8", "title": "GWAS of extended prescription analgesic use identifies genetic loci in chronic pain", "abstract": "", "authors": [ { "name": "Charli E. Harlow", "affiliations": [] }, { "name": "Emeka Uzochukwu", "affiliations": [] }, { "name": "Hazel A. Fernando", "affiliations": [] }, { "name": "Charles E. Mordaunt", "affiliations": [] }, { "name": "Jordan M. Hughey", "affiliations": [] }, { "name": "John D. Eicher", "affiliations": [] }, { "name": "Lara Robinson", "affiliations": [] }, { "name": "Nicholas Bowker", "affiliations": [] }, { "name": "Laurence Howe", "affiliations": [] }, { "name": "Jimmy Liu", "affiliations": [] }, { "name": "Adrian Cortes", "affiliations": [] }, { "name": "Paul Wilson", "affiliations": [] }, { "name": "Usha Gungabissoon", "affiliations": [] }, { "name": "Victoria S. Benson", "affiliations": [] }, { "name": "Anthony Nash", "affiliations": [] }, { "name": "Gareth Young", "affiliations": [] }, { "name": "Laura Addis", "affiliations": [] }, { "name": "Chun-Fang Xu", "affiliations": [] }, { "name": "Caleb Webber", "affiliations": [] }, { "name": "Jonathan Davitte", "affiliations": [] }, { "name": "M. Zameel Cader", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73788-5", "url": "https://doi.org/10.1038/s41467-026-73788-5", "title": "A plant vesicle-dendritic cell chimera for enhancing cancer immunotherapy", "abstract": "Abstract The tumour microenvironment (TME) causes mitochondrial dysfunction in resident dendritic cells (DCs), resulting in inadequate antigen presentation and weak T cell priming. Herein, we identify hypoxia as a key factor for causing pathological mitochondrial fission in tumour-associated DCs, and develop a plant vesicle-DC chimera to relieve hypoxia-induced mitochondrial dysfunction for enhancing cancer immunotherapy. The biohybrid chimera is fabricated by loading algae-derived nanovesicles (ANVs) with genetically engineered CCR2 overexpressing-DCs. The CCR2-DC-ANVs target tumour by leveraging the C-C motif chemokine ligand 2 (CCL2) in tumours. Upon light exposure, the ANVs produce oxygen and NADPH to resolve hypoxic and oxidative stress, which reverse pathological mitochondrial fission in DCs. Mitochondrial network restoration alleviates endoplasmic reticulum stress, reduces lipid droplet accumulation, and initiates metabolic reprogramming to enhance antigen presentation and T cell priming of CCR2-DC-ANVs in the TME. The biohybrid chimera enhances therapeutic efficiency in humanized mouse models of breast cancer in female mice without requiring external tumour antigens. This approach highlights a cross-species chimera for next-generation DC therapy, and provides the basis for a nanobiotechnology platform to facilitate organelle medicine by combining photosynthesis with immunotherapy.", "authors": [ { "name": "Wenzhe Yi", "affiliations": [] }, { "name": "Xindi Qian", "affiliations": [] }, { "name": "Wenlu Yan", "affiliations": [] }, { "name": "Dan Yan", "affiliations": [] }, { "name": "Zhiwen Zhao", "affiliations": [] }, { "name": "Fang Sun", "affiliations": [] }, { "name": "Qi Zhao", "affiliations": [] }, { "name": "Dangge Wang", "affiliations": [] }, { "name": "Yaping Li", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73884-6", "url": "https://doi.org/10.1038/s41467-026-73884-6", "title": "Bulk spinodal-architected compositionally complex alloy with enhanced energy absorption across a wide temperature range", "abstract": "", "authors": [ { "name": "Hao Gong", "affiliations": [] }, { "name": "Yushan Geng", "affiliations": [] }, { "name": "Qing Wang", "affiliations": [] }, { "name": "Zhaoqi Chen", "affiliations": [] }, { "name": "Baisong Guo", "affiliations": [] }, { "name": "Zhixin Li", "affiliations": [] }, { "name": "Sijia Hu", "affiliations": [] }, { "name": "Anding Wang", "affiliations": [] }, { "name": "Yong Yang", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73365-w", "url": "https://doi.org/10.1038/s41467-026-73365-w", "title": "In situ ptychographic nanotomography captures activation, mobility, and deactivation of supported catalysts", "abstract": "Abstract Nanoparticles supported on the surface of porous carrier materials are the dominant form of heterogeneous catalysts today. Yet, they suffer from a common deactivation mechanism: the loss of active surface area under industrial use conditions. Deactivation often stems from the sintering of nanoparticles, a mass-transport process whose mechanism and operating length-scale are a topic of controversy. Investigating this process is challenging, requiring not only a behavioral characterization of thousands of individual particles within the spatial confines of a hierarchically structured support but also a characterization of their ensemble behavior and local support interactions. Here, we introduce in situ ptychographic X-ray computed nanotomography as a tool to facilitate this characterization, allowing a local examination of catalysts in their use-geometry under operational-relevant conditions. Applied to methane oxidation over a palladium-on-silica supported catalyst, we reveal two concurrently operating deactivation drivers, short-range ripening and long-range particle migration, each with different temperature and atmosphere dependencies. The latter enables particles to traverse hundreds of nanometers through the support. These observations expand the current understanding of sintering behavior in supported catalysts and demonstrate PXCT’s capability to resolve restructuring processes within complex porous materials.", "authors": [ { "name": "Arik Beck", "affiliations": [] }, { "name": "Mirko Holler", "affiliations": [] }, { "name": "Tomas Aidukas", "affiliations": [] }, { "name": "Andreas Menzel", "affiliations": [] }, { "name": "Manuel Guizar-Sicairos", "affiliations": [] }, { "name": "Jeroen A. van Bokhoven", "affiliations": [] }, { "name": "Johannes Ihli", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73798-3", "url": "https://doi.org/10.1038/s41467-026-73798-3", "title": "BNT162b2 LP.8.1 early vaccine effectiveness against COVID-19 emergency department, urgent care, and outpatient visits", "abstract": "", "authors": [ { "name": "Haley J. Appaneal", "affiliations": [] }, { "name": "Vrishali V. Lopes", "affiliations": [] }, { "name": "Jennifer L. Nguyen", "affiliations": [] }, { "name": "Hannah R. Volkman", "affiliations": [] }, { "name": "Evan J. Zasowski", "affiliations": [] }, { "name": "Aisling R. Caffrey", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73669-x", "url": "https://doi.org/10.1038/s41467-026-73669-x", "title": "Homeostatic dendritic neuron based on co-integrated volatile and non-volatile memristors for neuromorphic processing", "abstract": "", "authors": [ { "name": "Licheng Zhang", "affiliations": [] }, { "name": "Teng Zhang", "affiliations": [] }, { "name": "Pek Jun Tiw", "affiliations": [] }, { "name": "Xulei Wu", "affiliations": [] }, { "name": "Yuqi Su", "affiliations": [] }, { "name": "Yuchao Yang", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73732-7", "url": "https://doi.org/10.1038/s41467-026-73732-7", "title": "Miocene ocean circulation shifted expansive oxygen deficient zones to the Atlantic", "abstract": "Abstract Contemporary observations indicate that dissolved oxygen concentrations are generally declining as global temperatures rise, which has broad implications for carbon cycling and the habitable ranges of marine animals. Here, we use the foraminiferal iodine redox tracer to evaluate the distributions of oxygen deficient zones (ODZs) and adjacent low oxygen water masses in the oceans during the Miocene Climatic Optimum (‘MCO’, 14.7−17 million years ago) - the last time that atmospheric CO 2 was consistently higher than today. The Pacific lowest oxygen water masses were confined to a narrow latitudinal range of ~10°N-20°S, which is substantially contracted relative to today. In contrast, in the Atlantic, where modern ODZs are minor compared to their Pacific counterparts, our data indicate spatially expansive low oxygen distribution during the MCO. Earth System model simulations provide evidence that the Pacific-Atlantic ODZ seesaw was driven by the very different pattern of ocean circulation and nutrient transport that was induced by an open Central American Seaway. Our findings highlight the key role played by tectonics and ocean circulation, independent of warming, in setting the pattern of ODZs and hence related loci of organic burial and marine habitats.", "authors": [ { "name": "Janet E. Burke", "affiliations": [] }, { "name": "Keyi Cheng", "affiliations": [] }, { "name": "Andy Ridgwell", "affiliations": [] }, { "name": "Donald E. Penman", "affiliations": [] }, { "name": "Dalton S. Hardisty", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73532-z", "url": "https://doi.org/10.1038/s41467-026-73532-z", "title": "Population-scale chemical response revealed by a barcoded yeast collection", "abstract": "", "authors": [ { "name": "Abhishek Dutta", "affiliations": [] }, { "name": "Marion Garin", "affiliations": [] }, { "name": "Victor Loegler", "affiliations": [] }, { "name": "Gauthier Brach", "affiliations": [] }, { "name": "Anne Friedrich", "affiliations": [] }, { "name": "Mami Yoshimura", "affiliations": [] }, { "name": "Hiroyuki Hirano", "affiliations": [] }, { "name": "Hiroyuki Osada", "affiliations": [] }, { "name": "Charles Boone", "affiliations": [] }, { "name": "Yoko Yashiroda", "affiliations": [] }, { "name": "Jing Hou", "affiliations": [] }, { "name": "Joseph Schacherer", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73516-z", "url": "https://doi.org/10.1038/s41467-026-73516-z", "title": "Transcriptomic and lipidomic analysis of the cryptococcal lung granuloma reveals macrophage boundary programs and sphingolipid remodeling", "abstract": "", "authors": [ { "name": "Veronica Soares Brauer", "affiliations": [] }, { "name": "Kathryn Takemura", "affiliations": [] }, { "name": "Barbara Rosati", "affiliations": [] }, { "name": "Marinaldo Pacífico Cavalcanti-Neto", "affiliations": [] }, { "name": "Deveney Dasilva", "affiliations": [] }, { "name": "Neelu Singh", "affiliations": [] }, { "name": "Tyler Normile", "affiliations": [] }, { "name": "Gabriella Vaccaro", "affiliations": [] }, { "name": "Giuseppe Caso", "affiliations": [] }, { "name": "Harpreet Singh", "affiliations": [] }, { "name": "Bo Chen", "affiliations": [] }, { "name": "Iwao Ojima", "affiliations": [] }, { "name": "David McKinnon", "affiliations": [] }, { "name": "Maurizio Del Poeta", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73672-2", "url": "https://doi.org/10.1038/s41467-026-73672-2", "title": "Self-adaptive nanozymes with enhanced multi-enzyme activities for sequential multimodal therapy of drug-resistant bacteria-infected wounds", "abstract": "Abstract Drug-resistant bacterium-infected wounds pose a serious clinical challenge, underscoring the need for therapeutic materials that respond to dynamic healing stages. Herein, we report a sequential multimodal platform embedding a self-adaptive IrPtCu nanozyme into a madecassoside-enriched hyaluronic acid hydrogel (HIPCM) for rapid bacterial eradication and accelerated wound healing. Leveraging trimetallic synergy and pH-adaptive reactive oxygen species (ROS) regulation, IrPtCu nanozyme exhibits strong oxidase, peroxidase, glutathione oxidase, and glutathione peroxidase-like activities, enabling efficient ROS generation and potent antibacterial performance. After disinfection, it switches to ROS scavenging through superoxide dismutase and catalase-like cascades, alleviating oxidative stress and cooperating with madecassoside to promote tissue repair. In a methicillin-resistant Staphylococcus aureus ( MRSA )-infected mouse model, HIPCM demonstrates strong antibacterial efficacy, promotes M2 macrophage polarization and angiogenesis, and accelerates high-quality repair. Preclinical studies in Bama mini-pigs further confirm improved collagen deposition, hair follicle regeneration, and functional restoration. This work offers a comprehensive strategy integrating adaptive nanozymes and natural herbal medicines for treating drug-resistant wounds.", "authors": [ { "name": "Xiaoyong Zhang", "affiliations": [] }, { "name": "Hang Yu", "affiliations": [] }, { "name": "Kai Zhu", "affiliations": [] }, { "name": "Yao Xiao", "affiliations": [] }, { "name": "Yuxuan Gong", "affiliations": [] }, { "name": "Dandan Che", "affiliations": [] }, { "name": "Wanyi Chen", "affiliations": [] }, { "name": "Guoxing You", "affiliations": [] }, { "name": "Xiyun Yan", "affiliations": [] }, { "name": "Quan Wang", "affiliations": [] }, { "name": "Kelong Fan", "affiliations": [] }, { "name": "Hong Zhou", "affiliations": [] }, { "name": "Gan Chen", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73168-z", "url": "https://doi.org/10.1038/s41467-026-73168-z", "title": "Efficacy of seaweed-based carbon dioxide removal reduced by iron limitation and nutrient competition with phytoplankton", "abstract": "", "authors": [ { "name": "Manon Berger", "affiliations": [] }, { "name": "Lester Kwiatkowski", "affiliations": [] }, { "name": "Laurent Bopp", "affiliations": [] }, { "name": "David T. Ho", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73162-5", "url": "https://doi.org/10.1038/s41467-026-73162-5", "title": "Atlantic sediments reveal interacting environmental and physiological controls on coccolithophore calcite production", "abstract": "Abstract Coccolithophores contribute 20-80% of the open ocean’s total calcite production, playing a pivotal role in the marine carbon cycle. Links between environment, coccolithophore physiology and calcite production remain unclear due to challenges in extrapolating culture experiments to sedimentary nannofossil records. Here, we develop a framework to reconstruct physiology and calcite production of dominant coccolithophore species from sedimentary records. Using well-preserved Atlantic surface sediments, this study establishes factors controlling coccolithophore calcite production via measurements of species composition, primary production, growth (μ), and calcification rates. Contrasting μ-calcification relationships of major groups indicate differing carbon requirements. Optimal μ is the primary control on group-specific maximum calcite production, defining a meridional bimodal structure with a boundary at ~40°N, aligned with oceanic physicochemical gradients. Group-specific cellular carbon demand relative to supply show that this boundary separates reaction-limited cells to the north from mass-transport-limited cells to the south, and likely migrates latitudinally with changing ocean carbon.", "authors": [ { "name": "Alba González-Lanchas", "affiliations": [] }, { "name": "Karl-Heinz Baumann", "affiliations": [] }, { "name": "Heather. M. Stoll", "affiliations": [] }, { "name": "José-Abel Flores", "affiliations": [] }, { "name": "Miguel. A. Fuertes", "affiliations": [] }, { "name": "Rosalind. E. M. Rickaby", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73749-y", "url": "https://doi.org/10.1038/s41467-026-73749-y", "title": "Fusion-positive rhabdomyosarcoma oncofusions share a common interactome", "abstract": "Abstract Fusion-positive rhabdomyosarcoma (FP-RMS) arises from at least seven distinct oncofusions sharing a common PAX3/7 N-terminal DNA-binding domain fused to divergent C-terminal partners. How different oncofusions produce the same cancer was unknown. Here we show they are functionally interchangeable, associate with a shared protein network we term the common interactome, bind overlapping target genes, and drive a similar core transcriptional program. The common interactome contains the C-terminal partners of known oncofusions and a newly identified translocation, suggesting oncofusions arise by PAX3/7 DNA-binding domain fusing to interactome members. As loss of common interactome proteins impaired oncogenic activity we screened the interactome for shared vulnerabilities. This identified thymidylate synthase as preferentially required for FP-RMS growth. Accordingly, the antifolate pralatrexate suppressed growth across all seven oncofusions, in multiple human FP-RMS cell lines, and a patient-derived xenograft. These findings demonstrate that divergent FP-RMS oncofusions are functionally fungible through a shared interactome that defines common vulnerabilities.", "authors": [ { "name": "S. P. Zimmerman", "affiliations": [] }, { "name": "C. D. Delaney", "affiliations": [] }, { "name": "B. K. Lau", "affiliations": [] }, { "name": "L. B. DeGraw", "affiliations": [] }, { "name": "G. H. Rupprecht", "affiliations": [] }, { "name": "M. J. A. Groot Koerkamp", "affiliations": [] }, { "name": "T. de Souza", "affiliations": [] }, { "name": "J. Drost", "affiliations": [] }, { "name": "R. A. Schoot", "affiliations": [] }, { "name": "M. T. Meister", "affiliations": [] }, { "name": "J. F. Shern", "affiliations": [] }, { "name": "L. M. Wagner", "affiliations": [] }, { "name": "G. G. Wang", "affiliations": [] }, { "name": "K. C. Wood", "affiliations": [] }, { "name": "C. M. Linardic", "affiliations": [] }, { "name": "C. M. Counter", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73390-9", "url": "https://doi.org/10.1038/s41467-026-73390-9", "title": "Inverse-designed silicon nitride nanophotonics", "abstract": "Abstract Silicon nitride photonics has enabled integration of a variety of components for applications in linear and nonlinear optics, including telecommunications, optical clocks, astrocombs, bio-sensing, and LiDAR. With the advent of inverse design - where desired device performance is specified and closely achieved through iterative, gradient-based optimisation - and the increasing availability of silicon nitride photonics via foundries, it is now feasible to expand the photonic design library beyond the limits of traditional approaches and unlock new functionalities. In this work, we present inverse-designed photonics on a silicon nitride platform and demonstrate both the design capabilities and experimental verification by realising precisely tailored wavelength-division multiplexers, mode-division multiplexers, and high- Q resonators with controllable wavelength range and dispersion. This demonstrates inverse-designed enhanced manipulation of orthogonal bases of light. Furthermore, we use these inverse-designed structures to form optical cavities that hold promise for on-chip nonlinear and quantum optics experiments.", "authors": [ { "name": "Toby Bi", "affiliations": [] }, { "name": "Shuangyou Zhang", "affiliations": [] }, { "name": "Egemen Bostan", "affiliations": [] }, { "name": "Danxian Liu", "affiliations": [] }, { "name": "Aditya Paul", "affiliations": [] }, { "name": "Olga Ohletz", "affiliations": [] }, { "name": "Irina Harder", "affiliations": [] }, { "name": "Yaojing Zhang", "affiliations": [] }, { "name": "Alekhya Ghosh", "affiliations": [] }, { "name": "Abdullah Alabbadi", "affiliations": [] }, { "name": "Masoud Kheyri", "affiliations": [] }, { "name": "Tianyi Zeng", "affiliations": [] }, { "name": "Jesse Lu", "affiliations": [] }, { "name": "Kiyoul Yang", "affiliations": [] }, { "name": "Pascal Del’Haye", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73357-w", "url": "https://doi.org/10.1038/s41467-026-73357-w", "title": "A persistent germylyne radical enabling reversible σ-dimerization and diverse bond activation", "abstract": "", "authors": [ { "name": "Xingyu Yang", "affiliations": [] }, { "name": "Meirong Song", "affiliations": [] }, { "name": "Liancheng He", "affiliations": [] }, { "name": "Shanshan Kong", "affiliations": [] }, { "name": "Runbo Pei", "affiliations": [] }, { "name": "Quanchun Sun", "affiliations": [] }, { "name": "Wanwan Jia", "affiliations": [] }, { "name": "Shuxuan Tang", "affiliations": [] }, { "name": "Xiao-Song Xue", "affiliations": [] }, { "name": "Xinping Wang", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73701-0", "url": "https://doi.org/10.1038/s41467-026-73701-0", "title": "Photonic-integrated quantum sensor array for microscale magnetic localisation", "abstract": "Abstract Nitrogen-vacancy centres (NVs) are promising solid-state nanoscale quantum sensors for applications ranging from material science to biotechnology. Using multiple sensors simultaneously offers advantages for probing spatiotemporal correlations of fluctuating fields or the dynamics of point defects. In this work, by integrating NVs with foundry silicon-nitride photonic integrated circuits, we realise the scalable operation of eight localised NV-ensemble sensors in an array, with simultaneous, distinct readout of the individual sensors. Using the eight NV sensors and machine-learning methods for multi-point magnetic field reconstruction, we demonstrate microscale magnetic localisation of a 30 μ m-sized needle tip. Experimentally, the needle tip can be localised with an error below its dimension and tracked dynamically with high fidelity. We use simulations of microrobot-relevant magnetic profiles as an application-motivated case study to quantify the operating bounds and requirements for translation and rotation tracking. By moving multi-NV localisation from bulk-optical addressing to a fibre-addressed, guided-wave, multi-channel architecture with simultaneous distinct readout, this work provides a scalable architecture towards magnetic localisation in optically inaccessible environments.", "authors": [ { "name": "Hao-Cheng Weng", "affiliations": [] }, { "name": "John G. Rarity", "affiliations": [] }, { "name": "Krishna C. Balram", "affiliations": [] }, { "name": "Joe A. Smith", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware", "general" ], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-71878-y", "url": "https://doi.org/10.1038/s41467-026-71878-y", "title": "Non-diffusive slow heat dissipation induces high local temperature in living cells", "abstract": "Abstract Recently, intracellular thermometry has revealed temperature variations within cells. Although the biological significance of intracellular temperature change is recognized, the physical principles of intracellular temperature change remain a mystery. Here, we investigate intracellular heat transfer through intracellular temperature mapping using a fluorescent polymeric thermometer and high-speed fluorescence lifetime imaging microscopy. Through infrared laser irradiation-assisted heating, we track changes in temperature distribution to examine the mechanism of intracellular heat dissipation in comparison with heat conduction. Continuous heating induces the significantly slower relaxation of the average temperature of single cells compared with that of liposomes containing homogeneous aqueous solutions of comparable size; to the scale of seconds. We additionally elucidate that these phenomena are impacted by intracellular structures and molecules. Finally, we discover that this slow intracellular temperature relaxation originates from non-diffusive heat dissipation distinct from the conventional heat conduction model. Our results provide insights into the mechanisms of temperature variation in cells that are unresolved based on our current understanding, establishing a framework for understanding intracellular thermodynamics under non-equilibrium conditions.", "authors": [ { "name": "Masaharu Takarada", "affiliations": [] }, { "name": "Ryo Shirakashi", "affiliations": [] }, { "name": "Masahiro Takinoue", "affiliations": [] }, { "name": "Motohiko Ishida", "affiliations": [] }, { "name": "Masamune Morita", "affiliations": [] }, { "name": "Hiroyuki Noji", "affiliations": [] }, { "name": "Kazuhito V. Tabata", "affiliations": [] }, { "name": "Takashi Funatsu", "affiliations": [] }, { "name": "Kohki Okabe", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41467-026-73415-3", "url": "https://doi.org/10.1038/s41467-026-73415-3", "title": "Revealing ultrafast proton-transfer-mediated autoionization as a source of low-energy electrons in hydrogen-bonded systems", "abstract": "", "authors": [ { "name": "Wael Iskandar", "affiliations": [] }, { "name": "Yi-Siang Wang", "affiliations": [] }, { "name": "Victor A. Suarez", "affiliations": [] }, { "name": "Matthew C. Rohan", "affiliations": [] }, { "name": "Kirk A. Larsen", "affiliations": [] }, { "name": "James Zhong Manis", "affiliations": [] }, { "name": "Travis Severt", "affiliations": [] }, { "name": "Joshua B. Williams", "affiliations": [] }, { "name": "Itzik Ben-Itzhak", "affiliations": [] }, { "name": "Thomas M. Orlando", "affiliations": [] }, { "name": "Joshua S. Kretchmer", "affiliations": [] }, { "name": "Daniel S. Slaughter", "affiliations": [] }, { "name": "Thorsten Weber", "affiliations": [] } ], "journal": { "id": "nat-comms", "title": "Nature Communications", "issn": [ "2041-1723" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "general", "sensing" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41567-026-03296-2", "url": "https://doi.org/10.1038/s41567-026-03296-2", "title": "Growth and control of suspended ice bridges during sessile droplet freezing", "abstract": "", "authors": [ { "name": "Siyan Yang", "affiliations": [] }, { "name": "Fuqiang Chu", "affiliations": [] }, { "name": "Vishwanath Ganesan", "affiliations": [] }, { "name": "Parsa Faghihi", "affiliations": [] }, { "name": "Dalia Ghaddar", "affiliations": [] }, { "name": "Wenbo Zhang", "affiliations": [] }, { "name": "Jiazheng Liu", "affiliations": [] }, { "name": "Jung Bin Yang", "affiliations": [] }, { "name": "Anxu Huang", "affiliations": [] }, { "name": "Kalyan Boyina", "affiliations": [] }, { "name": "Kaushik Chettiar", "affiliations": [] }, { "name": "Sujan Dewanjee", "affiliations": [] }, { "name": "Shayan Aflatounian", "affiliations": [] }, { "name": "Rahat Khan", "affiliations": [] }, { "name": "Paul V. Braun", "affiliations": [] }, { "name": "Jie Feng", "affiliations": [] }, { "name": "Dimos Poulikakos", "affiliations": [] }, { "name": "Nenad Miljkovic", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s41567-026-03308-1", "url": "https://doi.org/10.1038/s41567-026-03308-1", "title": "Electron matter waves with internal torque", "abstract": "Abstract Investigating or controlling angular momentum in atoms or subatomic structures requires torque on femtosecond and picometre scales, far below the capabilities of laser light. Here we report electron beams with an ultrafast internal torque. We first intersect the electron beam with chiral laser light to create discrete energy sidebands by multiple helical photon absorptions, leading to a correlation between orbital angular momentum and kinetic energy. Then, we use the dispersion of these partial waves due to the electron’s rest mass to convert each electron into a wavefunction with internal torque. The local chirality within an electron matter wave changes from left-handed into achiral towards right-handed within femtosecond times. Such electron matter waves might facilitate research on angular momentum and chirality on atomic and subatomic scales.", "authors": [ { "name": "Y. Fang", "affiliations": [] }, { "name": "J. Kuttruff", "affiliations": [] }, { "name": "P. Baum", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1038/s41567-026-03322-3", "url": "https://doi.org/10.1038/s41567-026-03322-3", "title": "Robustness of Majorana modes to a disorder potential in atomic chains on a superconducting Rashba alloy", "abstract": "Abstract Majorana modes offer great potential for fault-tolerant quantum computation due to their topological protection. However, intrinsic disorder makes the unambiguous detection of Majorana modes difficult in the commonly used hybrid superconductor - semiconductor nanowire platform. By contrast, for magnet - superconductor hybrid systems, Majorana modes were theoretically predicted to be very robust against disorder, but no experimental confirmation of this has been reported so far. Here we demonstrate that these modes are indeed robust in one-dimensional spin chains constructed from individual iron atoms on a Rashba surface alloy with proximity-induced superconductivity. Although the chains exhibit perfect crystalline order, we observe nanoscale potential disorder of the BiAg 2 /Ag(111)/Nb(110) heterostructure by scanning tunnelling microscopy. However, this does not prevent the emergence of zero-energy modes at both ends of the atomic chains, in agreement with tight-binding calculations showing that these modes are only found in the topologically non-trivial regime of the phase diagram. Our results explain the earlier observation of zero-energy Majorana modes in disordered Fe chains on other superconducting substrates, and may provide an avenue for the realization of Majorana qubits.", "authors": [ { "name": "Harim Jang", "affiliations": [] }, { "name": "Daniel Crawford", "affiliations": [] }, { "name": "Khai That Ton", "affiliations": [] }, { "name": "Lucas Schneider", "affiliations": [] }, { "name": "Jens Wiebe", "affiliations": [] }, { "name": "Makoto Shimizu", "affiliations": [] }, { "name": "Harald O. Jeschke", "affiliations": [] }, { "name": "Stephan Rachel", "affiliations": [] }, { "name": "Roland Wiesendanger", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction", "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1038/s41567-026-03293-5", "url": "https://doi.org/10.1038/s41567-026-03293-5", "title": "Reconfigurable and multifunctional circuits using the Stark effect in black phosphorus", "abstract": "", "authors": [ { "name": "He Tian", "affiliations": [] }, { "name": "Zhan Hou", "affiliations": [] }, { "name": "Fan Wu", "affiliations": [] }, { "name": "Jing-Wen Jiang", "affiliations": [] }, { "name": "Dai-Xuan Wu", "affiliations": [] }, { "name": "Yang Shen", "affiliations": [] }, { "name": "Ting-Yi Xu", "affiliations": [] }, { "name": "Xiao-Yong Xue", "affiliations": [] }, { "name": "Zi-Ming Wang", "affiliations": [] }, { "name": "Hao Guo", "affiliations": [] }, { "name": "Tian-Ling Ren", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-25", "source": "crossref" }, { "doi": "10.1038/s41567-026-03286-4", "url": "https://doi.org/10.1038/s41567-026-03286-4", "title": "Oxygen-centred planar orbitals in the electronic structure and spin-density-wave reconstruction of multilayer nickelates", "abstract": "", "authors": [ { "name": "Christine C. Au-Yeung", "affiliations": [] }, { "name": "Xinglong Chen", "affiliations": [] }, { "name": "S. Smit", "affiliations": [] }, { "name": "M. Bluschke", "affiliations": [] }, { "name": "V. Zimmermann", "affiliations": [] }, { "name": "M. Michiardi", "affiliations": [] }, { "name": "P. C. Moen", "affiliations": [] }, { "name": "J. Kraan", "affiliations": [] }, { "name": "C. S. B. Pang", "affiliations": [] }, { "name": "C. T. Suen", "affiliations": [] }, { "name": "S. Zhdanovich", "affiliations": [] }, { "name": "M. Zonno", "affiliations": [] }, { "name": "S. Gorovikov", "affiliations": [] }, { "name": "Yuzi Liu", "affiliations": [] }, { "name": "P. Dosanjh", "affiliations": [] }, { "name": "G. Levy", "affiliations": [] }, { "name": "I. S. Elfimov", "affiliations": [] }, { "name": "M. Berciu", "affiliations": [] }, { "name": "G. A. Sawatzky", "affiliations": [] }, { "name": "J. F. Mitchell", "affiliations": [] }, { "name": "A. Damascelli", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1038/s41567-026-03265-9", "url": "https://doi.org/10.1038/s41567-026-03265-9", "title": "Entanglement-enabled image transmission through complex media", "abstract": "", "authors": [ { "name": "Chloé Vernière", "affiliations": [] }, { "name": "Raphaël Guitter", "affiliations": [] }, { "name": "Baptiste Courme", "affiliations": [] }, { "name": "Hugo Defienne", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1038/s41567-026-03306-3", "url": "https://doi.org/10.1038/s41567-026-03306-3", "title": "Simple input - output dependencies explain neuronal activity", "abstract": "", "authors": [ { "name": "Christopher W. Lynn", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s41567-026-03267-7", "url": "https://doi.org/10.1038/s41567-026-03267-7", "title": "More spin flow with less dissipation", "abstract": "", "authors": [ { "name": "Prasanta Kumar Muduli", "affiliations": [] }, { "name": "Pranaba Kishor Muduli", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s41567-026-03323-2", "url": "https://doi.org/10.1038/s41567-026-03323-2", "title": "From data to dialogue", "abstract": "", "authors": [], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03284-6", "url": "https://doi.org/10.1038/s41567-026-03284-6", "title": "Hidden dependencies", "abstract": "", "authors": [ { "name": "Mark Buchanan", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03297-1", "url": "https://doi.org/10.1038/s41567-026-03297-1", "title": "Controllable hydro-thermoelastic heat transport in ultrathin semiconductors at room temperature", "abstract": "", "authors": [ { "name": "S. Varghese", "affiliations": [] }, { "name": "J. Tur-Prats", "affiliations": [] }, { "name": "J. D. Mehew", "affiliations": [] }, { "name": "D. Saleta Reig", "affiliations": [] }, { "name": "R. Farris", "affiliations": [] }, { "name": "J. Camacho", "affiliations": [] }, { "name": "J. A. Haibeh", "affiliations": [] }, { "name": "A. Sokolov", "affiliations": [] }, { "name": "P. Ordejón", "affiliations": [] }, { "name": "S. Huberman", "affiliations": [] }, { "name": "A. Beardo", "affiliations": [] }, { "name": "F. X. Alvarez", "affiliations": [] }, { "name": "K. J. Tielrooij", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03283-7", "url": "https://doi.org/10.1038/s41567-026-03283-7", "title": "A yardstick for quantum gravity", "abstract": "", "authors": [ { "name": "Saurya Das", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03312-5", "url": "https://doi.org/10.1038/s41567-026-03312-5", "title": "Tissue shape design", "abstract": "", "authors": [ { "name": "Elizaveta Dubrovina", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03307-2", "url": "https://doi.org/10.1038/s41567-026-03307-2", "title": "Relative benefits of different active learning methods to conceptual physics learning", "abstract": "", "authors": [ { "name": "Meagan Sundstrom", "affiliations": [] }, { "name": "Justin Gambrell", "affiliations": [] }, { "name": "Colin Green", "affiliations": [] }, { "name": "Adrienne L. Traxler", "affiliations": [] }, { "name": "Eric Brewe", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03287-3", "url": "https://doi.org/10.1038/s41567-026-03287-3", "title": "Cavity quantum electrodynamics control of quantum Hall stripes", "abstract": "Abstract Controlling quantum phases of materials with vacuum field fluctuations in engineered cavities is a topical method for the optical manipulation of emergent phenomena. Here we demonstrate cavity-induced anisotropies in the electronic transport of a high-mobility two-dimensional electron system in a strong magnetic field. In particular, we show the suppression of longitudinal resistivity well below the resistivity at zero magnetic field. These cavity-induced effects occur at ultralow temperatures when the magnetic field lies between quantized Hall plateaus. We interpret our results as arising from the stabilization of thermally disordered quantum Hall stripes. Therefore, our work presents a demonstration of the cavity quantum electrodynamics control of a correlated electronic phase.", "authors": [ { "name": "Lorenzo Graziotto", "affiliations": [] }, { "name": "Josefine Enkner", "affiliations": [] }, { "name": "Sambuddha Chattopadhyay", "affiliations": [] }, { "name": "Jonathan B. Curtis", "affiliations": [] }, { "name": "Ethan Koskas", "affiliations": [] }, { "name": "Christian Reichl", "affiliations": [] }, { "name": "Werner Wegscheider", "affiliations": [] }, { "name": "Giacomo Scalari", "affiliations": [] }, { "name": "Eugene Demler", "affiliations": [] }, { "name": "Jérôme Faist", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03292-6", "url": "https://doi.org/10.1038/s41567-026-03292-6", "title": "Spatially anisotropic Kondo resonance coupled with the superconducting gap in a kagome metal", "abstract": "", "authors": [ { "name": "Zichen Huang", "affiliations": [] }, { "name": "Hui Chen", "affiliations": [] }, { "name": "Zhongqin Zhang", "affiliations": [] }, { "name": "Hao Zhang", "affiliations": [] }, { "name": "Zhen Zhao", "affiliations": [] }, { "name": "Ruwen Wang", "affiliations": [] }, { "name": "Haitao Yang", "affiliations": [] }, { "name": "Wei Ji", "affiliations": [] }, { "name": "Ziqiang Wang", "affiliations": [] }, { "name": "Hong-Jun Gao", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03313-4", "url": "https://doi.org/10.1038/s41567-026-03313-4", "title": "Precision meets portability", "abstract": "", "authors": [ { "name": "Sonal Mistry", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s41567-026-03295-3", "url": "https://doi.org/10.1038/s41567-026-03295-3", "title": "Taking snapshots of spin - valley modes in a moiré superlattice", "abstract": "", "authors": [], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s41567-026-03274-8", "url": "https://doi.org/10.1038/s41567-026-03274-8", "title": "Observation of angular momentum transfer among crystal lattice modes", "abstract": "Abstract Transfer of energy and linear momentum between lattice vibrations via anharmonic coupling is an important concept in solid-state physics. However, it remained difficult to directly observe how angular momentum is exchanged and conserved among lattice modes, even though these processes are thought to play an important role in achieving magnetization equilibrium and in spin relaxation effects like the Einstein - de Haas effect. Here we demonstrate and coherently control angular momentum transfer between two lattice modes using the inverse process of anharmonic decay. The observed rotational phonon - phonon Umklapp scattering enforces the conservation of quantized crystal angular momentum, as dictated by the discrete rotational symmetry of the crystal. We thereby experimentally confirm the fundamental analogy between linear and angular momentum conservation in solids. Moreover, we establish axial nonlinear phononics as a promising handle for the ultrafast control of material properties.", "authors": [ { "name": "Olga Minakova", "affiliations": [] }, { "name": "Carolina Paiva", "affiliations": [] }, { "name": "Maximilian Frenzel", "affiliations": [] }, { "name": "Michael S. Spencer", "affiliations": [] }, { "name": "Joanna M. Urban", "affiliations": [] }, { "name": "Christoph Ringkamp", "affiliations": [] }, { "name": "Martin Wolf", "affiliations": [] }, { "name": "Gregor Mussler", "affiliations": [] }, { "name": "Dominik M. Juraschek", "affiliations": [] }, { "name": "Sebastian F. Maehrlein", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1038/s41567-026-03288-2", "url": "https://doi.org/10.1038/s41567-026-03288-2", "title": "Laser mode braiding on a chip", "abstract": "", "authors": [ { "name": "Wenbo Mao", "affiliations": [] }, { "name": "Bofeng Zhu", "affiliations": [] }, { "name": "Qian Zhang", "affiliations": [] }, { "name": "Weijie Xu", "affiliations": [] }, { "name": "Di Jia", "affiliations": [] }, { "name": "Yuan Meng", "affiliations": [] }, { "name": "Chongwu Wang", "affiliations": [] }, { "name": "Fu Li", "affiliations": [] }, { "name": "Sang-Hoon Bae", "affiliations": [] }, { "name": "Qi Jie Wang", "affiliations": [] }, { "name": "Y. D. Chong", "affiliations": [] }, { "name": "Lan Yang", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1038/s41567-026-03248-w", "url": "https://doi.org/10.1038/s41567-026-03248-w", "title": "Preserved rotations in solids", "abstract": "", "authors": [ { "name": "C. S. Davies", "affiliations": [] }, { "name": "A. Kirilyuk", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1038/s41567-026-03285-5", "url": "https://doi.org/10.1038/s41567-026-03285-5", "title": "Higher-order harmonics in Josephson tunnel junctions due to series inductance", "abstract": "", "authors": [ { "name": "Junghyun Kim", "affiliations": [] }, { "name": "Max Hays", "affiliations": [] }, { "name": "Ilan T. Rosen", "affiliations": [] }, { "name": "Junyoung An", "affiliations": [] }, { "name": "Helin Zhang", "affiliations": [] }, { "name": "Aranya Goswami", "affiliations": [] }, { "name": "Kate Azar", "affiliations": [] }, { "name": "Jeffrey M. Gertler", "affiliations": [] }, { "name": "Bethany M. Niedzielski", "affiliations": [] }, { "name": "Mollie E. Schwartz", "affiliations": [] }, { "name": "Terry P. Orlando", "affiliations": [] }, { "name": "Jeffrey A. Grover", "affiliations": [] }, { "name": "Kyle Serniak", "affiliations": [] }, { "name": "William D. Oliver", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": "hardware", "categories": [ "hardware" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1038/s41567-026-03281-9", "url": "https://doi.org/10.1038/s41567-026-03281-9", "title": "Scalable generation of massive Schrödinger cat states via quantum tunnelling", "abstract": "", "authors": [ { "name": "Han Zhang", "affiliations": [] }, { "name": "Yong-Kui Wang", "affiliations": [] }, { "name": "Yi Zheng", "affiliations": [] }, { "name": "Hai-Tao Bai", "affiliations": [] }, { "name": "Bing Yang", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-11", "source": "crossref" }, { "doi": "10.1038/s41567-026-03291-7", "url": "https://doi.org/10.1038/s41567-026-03291-7", "title": "Correlated insulator in the kagome flat band of a two-dimensional electrostatic crystal", "abstract": "Abstract The electronic properties of solids are determined by their crystal structure and electron interactions, giving rise to phenomena such as superconductivity, strange metals and correlated insulators. Many of these effects remain poorly understood, motivating efforts to create artificial crystals that mimic real materials while allowing controlled tuning of key parameters. Cold atoms in optical lattices offer flexibility but cannot reproduce the long-range Coulomb interactions and hopping present in solids. Solid-state systems naturally support these features, although they suffer from tunability and flexibility issues. Here we demonstrate a highly tunable artificial crystal formed by superimposing a periodic electrostatic potential onto a two-dimensional electron gas in a shallow GaAs quantum well. This engineered lattice exhibits a band structure characteristic of the artificial triangular lattice, distinct from that of the underlying cubic crystal. Electronic transport measurements show a sign change in the Hall coefficient as the chemical potential sweeps through the artificial bands. The band structure can be continuously tuned to realize linear graphene-like and flat kagome-like bands within a single device. A strong insulating state emerges at half filling of the kagome flat band, consistent with interaction-driven behaviour. This tunability provides an opportunity to explore correlated quantum states in a controlled setting.", "authors": [ { "name": "Daisy Q. Wang", "affiliations": [] }, { "name": "Zeb Krix", "affiliations": [] }, { "name": "Olga A. Tkachenko", "affiliations": [] }, { "name": "Vitaly A. Tkachenko", "affiliations": [] }, { "name": "Chong Chen", "affiliations": [] }, { "name": "Ian Farrer", "affiliations": [] }, { "name": "David A. Ritchie", "affiliations": [] }, { "name": "Oleg P. Sushkov", "affiliations": [] }, { "name": "Alexander R. Hamilton", "affiliations": [] }, { "name": "Oleh Klochan", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-11", "source": "crossref" }, { "doi": "10.1038/s41567-026-03324-1", "url": "https://doi.org/10.1038/s41567-026-03324-1", "title": "Publisher Correction: Lifetime of the singly charged 229Th nuclear isomer", "abstract": "", "authors": [ { "name": "Y. Shigekawa", "affiliations": [] }, { "name": "A. Yamaguchi", "affiliations": [] }, { "name": "K. Tokoi", "affiliations": [] }, { "name": "N. Sato", "affiliations": [] }, { "name": "H. Kikunaga", "affiliations": [] }, { "name": "K. Shirasaki", "affiliations": [] }, { "name": "Y. Kasamatsu", "affiliations": [] }, { "name": "M. Wada", "affiliations": [] }, { "name": "H. Haba", "affiliations": [] } ], "journal": { "id": "nat-phys", "title": "Nature Physics", "issn": [ "1745-2473", "1745-2481" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-08", "source": "crossref" }, { "doi": "10.1038/s42005-026-02696-3", "url": "https://doi.org/10.1038/s42005-026-02696-3", "title": "Zero field splittings in paramagnetic dysprosium dimers", "abstract": "", "authors": [ { "name": "Hui Li", "affiliations": [] }, { "name": "Eite Tiesinga", "affiliations": [] }, { "name": "Ming Li", "affiliations": [] }, { "name": "Jacek Kłos", "affiliations": [] }, { "name": "Svetlana Kotochigova", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1038/s42005-026-02679-4", "url": "https://doi.org/10.1038/s42005-026-02679-4", "title": "Anomalous thermally enhanced upconversion blue emission of Ho3+ ions in co-doped rare-earth-based halide perovskites", "abstract": "Abstract The energy transfer upconversion from Yb 3+ to Ho 3+ is inherently inefficient due to energy level mismatch, typically yielding green and red emission. Achieving efficient blue emission from Ho 3+ remains challenging. Here we co‑dope a rare-earth-based perovskite Cs 3 GdCl 6 with Yb 3+ /Ho 3+ and O 2− to construct a crystal‑field‑tunable lattice. In situ variable‑temperature X-ray diffraction patterns and Raman spectroscopy confirm compressive lattice distortion at room temperature and expansive distortion at elevated temperature. Crystal field variations induce Stark splitting of the degenerate 4 f energy levels of Yb 3+ and Ho 3+ . The Stark effect improves energy matching among the sensitizer, activator, and 975 nm excitation, thereby enhancing both energy transfer upconversion and excited‑state absorption. The improved energy‑level alignment promotes population of the Ho 3+ 5 F 2,3 / 3 K 8 and 5 G 5 levels, leading to a 134‑fold enhancement in blue emission. The Cs 3 GdO x Cl 6-x :Yb 3+ /Ho 3+ crystals exhibit green‑to‑blue upconversion luminescence under 975 nm excitation, showing potential for high‑security anticounterfeiting. This work significantly enriches Ho 3+ upconversion kinetics.", "authors": [ { "name": "Yanqing Hu", "affiliations": [] }, { "name": "Shijie Yu", "affiliations": [] }, { "name": "Jiaqiang Zhou", "affiliations": [] }, { "name": "Rui Zhang", "affiliations": [] }, { "name": "Xi Zhang", "affiliations": [] }, { "name": "Li Cai", "affiliations": [] }, { "name": "Jiasheng Wan", "affiliations": [] }, { "name": "Yijun Xue", "affiliations": [] }, { "name": "Shuang Sun", "affiliations": [] }, { "name": "Yiling Cui", "affiliations": [] }, { "name": "Xuewen Tang", "affiliations": [] }, { "name": "Jingxin Hong", "affiliations": [] }, { "name": "Zuo-Xi Li", "affiliations": [] }, { "name": "Chunxian Guo", "affiliations": [] }, { "name": "Qiyue Shao", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1038/s42005-026-02663-y", "url": "https://doi.org/10.1038/s42005-026-02663-y", "title": "Five-stage ordering to a topological-defect-mediated ground state in a buckyball artificial spin ice", "abstract": "Abstract Artificial spin ices are arrays of coupled nanomagnets, which exhibit a variety of fascinating collective behaviour including emergent magnetic monopoles and novel phase transitions. However, they have mainly been confined to two dimensions due to the challenges inherent to their fabrication and characterisation in three dimensions. Exploiting the third dimension offers new degrees of freedom that can lead to curvature-induced topological effects. Here, using numerical simulations, we investigate the magnetic behaviour of a finite three-dimensional spin lattice: the buckyball artificial spin ice, where the spins are located on the edges of a regular buckyball. This frustrated system has a non-trivial topology that results in a rich spectrum of thermal magnetic behaviour, beginning with a crossover from a Paramagnetic sector to a Spin-Ice sector, followed by the formation of an imperfect charge crystal, before spin order is established in three separate steps. The ground state configuration is described by a pair of robust topological magnetic defects that arise because of the finite curved nature of the lattice. Our work reveals the complex thermodynamics of the buckyball artificial spin ice and paves the way to designing unusual magnetic textures in other curved three-dimensional nanomagnetic systems, exploiting the interplay between topology and the dipolar interaction.", "authors": [ { "name": "Gavin M. Macauley", "affiliations": [] }, { "name": "Luca Berchialla", "affiliations": [] }, { "name": "Peter M. Derlet", "affiliations": [] }, { "name": "Laura J. Heyderman", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1038/s42005-026-02700-w", "url": "https://doi.org/10.1038/s42005-026-02700-w", "title": "Topological polarization beam splitter with polarization-selective edge states", "abstract": "", "authors": [ { "name": "Shirin Afzal", "affiliations": [] }, { "name": "Amesh Kahloon", "affiliations": [] }, { "name": "Shabir Barzanjeh", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1038/s42005-026-02694-5", "url": "https://doi.org/10.1038/s42005-026-02694-5", "title": "Resonate-and-fire photonic-electronic spiking neurons for fast and efficient light-enabled neuromorphic processing systems", "abstract": "", "authors": [ { "name": "Andrew Adair", "affiliations": [] }, { "name": "Dafydd Owen-Newns", "affiliations": [] }, { "name": "Giovanni Donati", "affiliations": [] }, { "name": "Joshua Robertson", "affiliations": [] }, { "name": "José Figueiredo", "affiliations": [] }, { "name": "Edward Wasige", "affiliations": [] }, { "name": "Qusay Al-Taai", "affiliations": [] }, { "name": "Bruno Romeira", "affiliations": [] }, { "name": "Matěj Hejda", "affiliations": [] }, { "name": "Antonio Hurtado", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-23", "source": "crossref" }, { "doi": "10.1038/s42005-026-02672-x", "url": "https://doi.org/10.1038/s42005-026-02672-x", "title": "Graph theory-based automated quantum algorithm for efficient querying of acyclic and multiloop causal configurations", "abstract": "", "authors": [ { "name": "Salvador A. Ochoa-Oregon", "affiliations": [] }, { "name": "Juan P. Uribe-Ramírez", "affiliations": [] }, { "name": "Roger J. Hernández-Pinto", "affiliations": [] }, { "name": "Selomit Ramírez-Uribe", "affiliations": [] }, { "name": "Germán Rodrigo", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1038/s42005-026-02695-4", "url": "https://doi.org/10.1038/s42005-026-02695-4", "title": "Floquet engineering in hybrid magnetic quantum systems", "abstract": "", "authors": [ { "name": "Feng-Zhou Ji", "affiliations": [] }, { "name": "Si-Yuan Bai", "affiliations": [] }, { "name": "Wan-Li Yang", "affiliations": [] }, { "name": "Chun-Jie Yang", "affiliations": [] }, { "name": "Jun-Hong An", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1038/s42005-026-02684-7", "url": "https://doi.org/10.1038/s42005-026-02684-7", "title": "Unlocking multidimensional integration with quantum adaptive importance sampling", "abstract": "", "authors": [ { "name": "Konstantinos Pyretzidis", "affiliations": [] }, { "name": "Jorge J. Martínez de Lejarza", "affiliations": [] }, { "name": "Germán Rodrigo", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1038/s42005-026-02666-9", "url": "https://doi.org/10.1038/s42005-026-02666-9", "title": "Geometry-aware s uper-resolution fusion calibration for binocular structured light 3D reconstruction", "abstract": "", "authors": [ { "name": "Hongyan Cao", "affiliations": [] }, { "name": "Dayong Qiao", "affiliations": [] }, { "name": "Mengya Han", "affiliations": [] }, { "name": "Wangke Yu", "affiliations": [] }, { "name": "Benquan Wang", "affiliations": [] }, { "name": "Yijie Shen", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-21", "source": "crossref" }, { "doi": "10.1038/s42005-026-02690-9", "url": "https://doi.org/10.1038/s42005-026-02690-9", "title": "Structure, optimality, and symmetry in shadow unitary inversion", "abstract": "", "authors": [ { "name": "Guocheng Zhen", "affiliations": [] }, { "name": "Yu-Ao Chen", "affiliations": [] }, { "name": "Mingrui Jing", "affiliations": [] }, { "name": "Jingu Xie", "affiliations": [] }, { "name": "Xin Wang", "affiliations": [] }, { "name": "Ranyiliu Chen", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1038/s42005-026-02688-3", "url": "https://doi.org/10.1038/s42005-026-02688-3", "title": "Adapting vision-language models for neutrino event classification in high-energy physics", "abstract": "Abstract Recent advances in machine learning, particularly in multimodal models, have created new opportunities for analyzing complex data in high-energy physics, where accurate identification of particle interactions is critical for scientific discovery. However, existing approaches rely heavily on convolutional neural networks, which lack interpretability and do not fully leverage multimodal reasoning capabilities. Here we show that a fine-tuned Vision Language Model (VLM) based on LLaMA 3.2 can effectively identify neutrino interactions in pixelated detector data, outperforming both a state-of-the-art convolutional neural network and a Vision Transformer baseline in classification accuracy and robustness. In addition, the VLM provides improved explainability through reasoning-based, interpretable predictions and supports integration of auxiliary semantic information. These results demonstrate the potential of multimodal transformer architectures as general-purpose tools for physics event classification, paving the way for more transparent, flexible, and scalable analysis methods in future high-energy physics experiments.", "authors": [ { "name": "Dikshant Sagar", "affiliations": [] }, { "name": "Kaiwen Yu", "affiliations": [] }, { "name": "Alejandro Yankelevich", "affiliations": [] }, { "name": "Jianming Bian", "affiliations": [] }, { "name": "Pierre Baldi", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1038/s42005-026-02671-y", "url": "https://doi.org/10.1038/s42005-026-02671-y", "title": "Tutorial: theoretical methods for attosecond molecular ionization and dynamics", "abstract": "", "authors": [ { "name": "Fernando Martín", "affiliations": [] }, { "name": "Jakub Benda", "affiliations": [] }, { "name": "Jimena D. Gorfinkiel", "affiliations": [] }, { "name": "Zdeněk Mašín", "affiliations": [] }, { "name": "Laura Rego", "affiliations": [] }, { "name": "Armin Scrinzi", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-20", "source": "crossref" }, { "doi": "10.1038/s42005-026-02685-6", "url": "https://doi.org/10.1038/s42005-026-02685-6", "title": "Rise and fall of the pseudogap in the Emery model, insights for cuprates", "abstract": "Abstract The pseudogap in high-temperature superconducting cuprates is an exotic state of matter, displaying emerging Fermi arcs and a momentum-selective suppression of spectral weight upon cooling. We show how these phenomena are captured in the three-band Emery model by performing dynamical vertex approximation calculations for its normal state. For the hole-doped parent compound, our results demonstrate the formation of a pseudogap due to short-ranged commensurate antiferromagnetic fluctuations. At larger doping values, progressively, incommensurate correlations and a metallic regime appear. Our results are in qualitative agreement with this doping trend in the normal state of cuprates, and hence, represent a step towards the uniform description of their phase diagrams within a single theoretical framework.", "authors": [ { "name": "M. O. Malcolms", "affiliations": [] }, { "name": "Henri Menke", "affiliations": [] }, { "name": "Yi-Ting Tseng", "affiliations": [] }, { "name": "Eric Jacob", "affiliations": [] }, { "name": "Karsten Held", "affiliations": [] }, { "name": "Philipp Hansmann", "affiliations": [] }, { "name": "Thomas Schäfer", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1038/s42005-026-02687-4", "url": "https://doi.org/10.1038/s42005-026-02687-4", "title": "Multi-task learning of complex networks via nonlinear ordinary differential equations", "abstract": "", "authors": [ { "name": "Ang Dong", "affiliations": [] }, { "name": "Changjian Fa", "affiliations": [] }, { "name": "Zhifan Li", "affiliations": [] }, { "name": "Shing-Tung Yau", "affiliations": [] }, { "name": "Rongling Wu", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1038/s42005-026-02693-6", "url": "https://doi.org/10.1038/s42005-026-02693-6", "title": "Quantum anomalous Hall states enriched by asynchronous mass inversion in multilayer graphene", "abstract": "", "authors": [ { "name": "Xilin Feng", "affiliations": [] }, { "name": "Zi-Ting Sun", "affiliations": [] }, { "name": "K. T. Law", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-19", "source": "crossref" }, { "doi": "10.1038/s42005-026-02692-7", "url": "https://doi.org/10.1038/s42005-026-02692-7", "title": "Physics-guided reinforcement learning for structured illumination microscopy", "abstract": "Abstract Structured illumination microscopy improves fluorescence imaging by shifting fine specimen information into the observable passband, but reconstructions often deteriorate when illumination phases, fringe contrast or noise depart from calibrated conditions. Existing learning-based methods usually compensate for these imperfections only after acquisition. Here we show a physics-guided reinforcement-learning framework for structured illumination microscopy that couples a differentiable optical forward model, an encoder - decoder reconstructor and a Soft Actor - Critic controller during training. The controller adaptively perturbs illumination phase, modulation depth and pattern frequency within physical bounds, while the reconstructor is optimised with image-domain, measurement-domain and spectral constraints. On simulated BioSR data, the method improves structural fidelity and frequency recovery relative to wide-field references and learning-based baselines, and remains stable under noise, phase detuning, stripe interference and photobleaching. Experiments on fixed-cell and bead samples acquired with a digital micromirror device platform indicate transfer to hardware without experimental fine-tuning.", "authors": [ { "name": "Junli Wu", "affiliations": [] }, { "name": "Qiurong Yan", "affiliations": [] }, { "name": "Siying Huang", "affiliations": [] }, { "name": "Haoran Zhang", "affiliations": [] }, { "name": "Junyuan Yin", "affiliations": [] }, { "name": "Xiaolong Luo", "affiliations": [] }, { "name": "Zhiqiang Wen", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s42005-026-02686-5", "url": "https://doi.org/10.1038/s42005-026-02686-5", "title": "Frequency-encoded magnetic resonance imaging with dynamic radio frequency field gradients", "abstract": "Abstract Magnetic Resonance Imaging is the gold standard for soft tissue diagnostic imaging but relies on expensive, failure-prone, and loud magnetic field gradients for spatial encoding. Radiofrequency field gradients are a promising alternative, yet they have never achieved frequency encoding, the technique that allows an image to be acquired continuously in milliseconds and without which scan times would increase by orders of magnitude. Here we show that the Bloch-Siegert shift can apply a spatial frequency gradient simultaneously with signal recording, without displacing magnetization from the plane where it generates signal. Combined with an injection transformer based simultaneous transmit-and-receive system that prevents the strong encoding field from overwhelming the weak tissue signal, this approach produces images on a 47.5 mT low-field scanner equivalent in quality to those from conventional gradient encoding. This work enables smaller, quieter, and less expensive scanners without compromising scan time or diagnostic image quality, with particular promise for expanding access to imaging in resource-limited settings.", "authors": [ { "name": "Sai Abitha Srinivas", "affiliations": [] }, { "name": "Antonio D. Glenn", "affiliations": [] }, { "name": "Mark A. Griswold", "affiliations": [] }, { "name": "William A. Grissom", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s42005-026-02680-x", "url": "https://doi.org/10.1038/s42005-026-02680-x", "title": "Fourier Analysis Perspective on Quantum Neural Networks", "abstract": "", "authors": [ { "name": "Seungcheol Oh", "affiliations": [] }, { "name": "Emily Jimin Roh", "affiliations": [] }, { "name": "Athanasios V. Vasilakos", "affiliations": [] }, { "name": "Soohyun Park", "affiliations": [] }, { "name": "Joongheon Kim", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-18", "source": "crossref" }, { "doi": "10.1038/s42005-026-02659-8", "url": "https://doi.org/10.1038/s42005-026-02659-8", "title": "Roughening and dynamics of an electric flux string in a (2+1)D lattice gauge theory", "abstract": "", "authors": [ { "name": "Francesco Di Marcantonio", "affiliations": [] }, { "name": "Sunny Pradhan", "affiliations": [] }, { "name": "Sofia Vallecorsa", "affiliations": [] }, { "name": "Mari Carmen Bañuls", "affiliations": [] }, { "name": "Enrique Rico Ortega", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-17", "source": "crossref" }, { "doi": "10.1038/s42005-026-02691-8", "url": "https://doi.org/10.1038/s42005-026-02691-8", "title": "Characterizing Alzheimer’s disease with reservoir computing", "abstract": "", "authors": [ { "name": "Qing Li", "affiliations": [] }, { "name": "Zijian Wang", "affiliations": [] }, { "name": "Yihe Zhang", "affiliations": [] }, { "name": "Zixiang Yan", "affiliations": [] }, { "name": "Jian Gao", "affiliations": [] }, { "name": "Xingang Wang", "affiliations": [] }, { "name": "Yong Liu", "affiliations": [] }, { "name": "Jinghua Xiao", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s42005-026-02683-8", "url": "https://doi.org/10.1038/s42005-026-02683-8", "title": "A laboratory-based method for rapid characterization of fiber texture using polychromatic X-ray diffraction", "abstract": "", "authors": [ { "name": "Wenjie Yu", "affiliations": [] }, { "name": "Huidong Qian", "affiliations": [] }, { "name": "Jincheng Lu", "affiliations": [] }, { "name": "Peixuan Song", "affiliations": [] }, { "name": "Lei Hu", "affiliations": [] }, { "name": "Li Zhang", "affiliations": [] }, { "name": "Zhiqiang Chen", "affiliations": [] }, { "name": "Zheng Li", "affiliations": [] }, { "name": "Jinbo Yang", "affiliations": [] }, { "name": "Yingchang Yang", "affiliations": [] }, { "name": "Jingzhi Han", "affiliations": [] }, { "name": "Zhentian Wang", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s42005-026-02681-w", "url": "https://doi.org/10.1038/s42005-026-02681-w", "title": "Variational graphical quantum error correction codes", "abstract": "", "authors": [ { "name": "Yuguo Shao", "affiliations": [] }, { "name": "Yong-Chang Li", "affiliations": [] }, { "name": "Fuchuan Wei", "affiliations": [] }, { "name": "Hao Zhan", "affiliations": [] }, { "name": "Ben Wang", "affiliations": [] }, { "name": "Zhaohui Wei", "affiliations": [] }, { "name": "Lijian Zhang", "affiliations": [] }, { "name": "Zhengwei Liu", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s42005-026-02682-9", "url": "https://doi.org/10.1038/s42005-026-02682-9", "title": "Interaction-induced dimension reduction for bound states in microwave-shielded ultracold molecules", "abstract": "", "authors": [ { "name": "Haitian Wang", "affiliations": [] }, { "name": "Tingting Shi", "affiliations": [] }, { "name": "Xiaoling Cui", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1038/s42005-026-02637-0", "url": "https://doi.org/10.1038/s42005-026-02637-0", "title": "Addendum: A snapshot of relativistic motion: visualizing the Terrell-Penrose effect", "abstract": "", "authors": [ { "name": "Dominik Hornof", "affiliations": [] }, { "name": "Victoria Helm", "affiliations": [] }, { "name": "Enar de Dios Rodriguez", "affiliations": [] }, { "name": "Thomas Juffmann", "affiliations": [] }, { "name": "Philipp Haslinger", "affiliations": [] }, { "name": "Peter Schattschneider", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1038/s42005-026-02674-9", "url": "https://doi.org/10.1038/s42005-026-02674-9", "title": "Ultrafast many-body dynamics of dense Rydberg gases and ultracold plasma", "abstract": "Abstract Understanding Coulomb driven many-body dynamics in ultracold atomic systems far from equilibrium remains an open challenge, particularly when ultrafast excitation channels create competing pathways toward Rydberg gases or ultracold plasmas. Here, we investigate the many-body dynamics in a 87 Rb Bose-Einstein condensate after exposure to a single femtosecond laser pulse. By tuning the laser wavelength across the two-photon ionization threshold, we can control the initial state that is either dominated by free electrons and leads to an ultracold plasma or dominated by electrons in excited states which leads to a dense Rydberg gas. The large bandwidth enables overcoming the Rydberg blockade that limits the excitation density for narrow-linewidth lasers. We directly measure the kinetic energy of the released electrons and compare the final distribution of free, bound and plasma electrons to molecular dynamics simulations where the electrons are modeled as individual particles including collisional ionization and recombination processes. We find very good agreement between the simulated electron distribution and the experimental observation. We identify charge imbalance as main driver for the decay of a dense Rydberg gas into an ultracold plasma.", "authors": [ { "name": "Mario Großmann", "affiliations": [] }, { "name": "Jette Heyer", "affiliations": [] }, { "name": "Julian Fiedler", "affiliations": [] }, { "name": "Markus Drescher", "affiliations": [] }, { "name": "Klaus Sengstock", "affiliations": [] }, { "name": "Philipp Wessels-Staarmann", "affiliations": [] }, { "name": "Juliette Simonet", "affiliations": [] } ], "journal": { "id": "comm-phys", "title": "Communications Physics", "issn": [ "2399-3650" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "hardware", "foundations", "general" ], "india_hint": false, "published": "2026-05-14", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6e04", "url": "https://doi.org/10.1088/1751-8121/ae6e04", "title": "Basis sets and Coulomb resolutions in rotational coordinates", "abstract": "Abstract Using generalised Laplacian symmetry operators, we construct basis sets or Coulomb resolutions in several separable coordinate systems, including two R -separable systems. This expands the possible geometries in which basis set construction is feasible, a problem which is relevant to both galactic dynamics and computational chemistry. In particular we derive three basis sets (two in prolate spheroidal and one in cylindrical coordinates) which are expressible in closed-form using a single Jacobi polynomial. We also show how any spherical polar or prolate spheroidal basis set may be transformed into a bispherical or toroidal basis set.", "authors": [ { "name": "Edward Lilley", "affiliations": [ "University of Vienna" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-28", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae65e7", "url": "https://doi.org/10.1088/1751-8121/ae65e7", "title": "Gravity-mediated entanglement via infinite-dimensional systems", "abstract": "Abstract There has been a wave of recent interest in detecting the quantum nature of gravity with tabletop experiments that witness gravitationally mediated entanglement. Central to these proposals is the assumption that any mediator capable of generating entanglement must itself be nonclassical. However, previous arguments for this have modeled classical mediators as finite, discrete systems such as bits, which excludes physically relevant continuous and infinite-dimensional systems such as those of classical mechanics and field theory. In this work, we close this gap by modeling classical systems as commutative unital C ∗ -algebras, arguably encompassing all potentially physically relevant classical systems. We show that these systems cannot mediate entanglement between two quantum systems A and B , even if A and B are themselves infinite-dimensional or described by arbitrary unital C ∗ -algebras (as in quantum field theory), composed with an arbitrary C ∗ -tensor product. This result reinforces the conclusion that the observation of gravity-induced entanglement would require the gravitational field to possess inherently non-classical features.", "authors": [ { "name": "Stefan L Ludescher", "affiliations": [ "Austrian Academy of Sciences", "University of Vienna" ] }, { "name": "Leon D Loveridge", "affiliations": [ "University of South-Eastern Norway" ] }, { "name": "Thomas D Galley", "affiliations": [ "Austrian Academy of Sciences", "University of Vienna" ] }, { "name": "Markus P Müller", "affiliations": [ "Austrian Academy of Sciences", "University of Vienna", "Perimeter Institute for Theoretical Physics" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae73bf", "url": "https://doi.org/10.1088/1751-8121/ae73bf", "title": "Characterizing the Einstein-Podolsky-Rosen steering via a class of measurements", "abstract": "Abstract Einstein-Podolsky-Rosen (EPR) steering represents a fundamental quantum resource in measurement theory and quantum information processing. Nevertheless, the determining steerability under general quantum measurements remains a challenging problem, as existing approaches are often constrained by limitations such as high computational complexity, restricted applicability to lowdimensional systems, or reliance on specific classes of quantum states. To address this issue, drawing inspiration from [Phys. Rev. A 106, 042402 ( 2022)], we propose a unified steering framework via a class of informationally complete symmetric measurements. Notably, this framework naturally integrates established measurement paradigms, including mutually unbiased measurements (MUMs) and general symmetric informationally complete POVMs (GSIC-POVMs), while offering enhanced versatility and flexibility. Then, by leveraging the inherent mathematical symmetry of these measurements, we derive practical criteria for EPR steering through correlation matrices. Furthermore, the effectiveness of the proposed framework is rigorously validated using isotropic states, Werner states, and a 3 × 3 asymmetric state. The approach is both versatile and computationally efficient, significantly improving the capacity to detect EPR steering and demonstrating strong potential for practical implementation in experimental quantum information protocols.", "authors": [ { "name": "Ruo-xiao Chen", "affiliations": [ "Xihua University" ] }, { "name": "Liang Tang", "affiliations": [ "Xihua University" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6d55", "url": "https://doi.org/10.1088/1751-8121/ae6d55", "title": "An upper critical dimension for dynamo action: a d -dimensional closure model study", "abstract": "Abstract We construct a d -dimensional eddy damped quasi-normal Markovian (EDQNM) closure model to study dynamo action in arbitrary dimensions. In particular, we find lower d L and upper d U critical dimensions for sustained dynamo action in this incompressible problem. Our model is adaptable for future studies incorporating helicity, compressible effects and a wide range of magnetic Reynolds and Prandtl numbers.", "authors": [ { "name": "Sugan Durai Murugan", "affiliations": [ "Johns Hopkins University" ] }, { "name": "Giorgio Krstulovic", "affiliations": [ "Institut de Physique de Nice (INPHYNI)" ] }, { "name": "Dario Vincenzi", "affiliations": [ "Université Côte d’Azur" ] }, { "name": "Samriddhi Sankar Ray", "affiliations": [ "Tata Institute of Fundamental Research" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6e05", "url": "https://doi.org/10.1088/1751-8121/ae6e05", "title": "Average relative entropy of random states", "abstract": "Abstract Relative entropy serves as a cornerstone concept in quantum information theory. In this work, we study relative entropy of random states from major generic state models of Hilbert - Schmidt (HS) and Bures - Hall ensembles. In particular, we derive exact yet explicit formulas of average relative entropy of two independent states of arbitrary dimensions from the same ensemble as well as from two different ensembles. One ingredient in obtaining the results is the observed factorization of ensemble averages after evaluating the required unitary integral. The derived exact formula in the case of HS ensemble complements the work by Kudler-Flam (2021 Phys Rev Lett 126 171603), where the corresponding asymptotic formula for states of equal dimensions was obtained based on the replica method.", "authors": [ { "name": "Lu Wei", "affiliations": [ "Texas Tech University" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6e07", "url": "https://doi.org/10.1088/1751-8121/ae6e07", "title": "A molecular-kinetic hypothesis on the mechanics of compressible gas flow at low Mach numbers", "abstract": "Abstract In recent works, we proposed a theory of turbulence creation via the second coefficient of the virial expansion (i.e. the van der Waals effect). This theory relies, in part, on the empirically observed ‘equilibrated’ behavior of pressure in compressible flows at low Mach numbers. However, a fundamental explanation for such a behavior of pressure does not currently exist, because the conventional kinetic theory leads instead to the adiabatic flow in the form of the usual compressible Euler or Navier - Stokes equations. To explain this behavior of pressure from the molecular-kinetic perspective, in the current work we introduce a novel correction into the pair correlation function in the closure of the Bogoliubov - Born - Green - Kirkwood - Yvon hierarchy. This correction matches the rate of change of the average distance between particles to the macroscopic compression or expansion rate of the gas. Remarkably, the novel correction introduces strong dissipation into the pressure equation at low Mach numbers, which stabilizes the pressure solution. At small scales, the novel dissipation effect manifests as the second viscosity in the momentum equation, which selectively suppresses the velocity divergence. As a result, the second viscosity governs the linear instability which creates turbulent dynamics, thereby setting the critical value of the Reynolds number. The ratio of the second and shear viscosities, together with the critical value of the Reynolds number, are proportional to the reciprocal of the packing fraction.", "authors": [ { "name": "Rafail V Abramov", "affiliations": [ "University of Illinois at Chicago" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae73c1", "url": "https://doi.org/10.1088/1751-8121/ae73c1", "title": "Resonant scattering for tunable quantum walks on graphs with tails", "abstract": "Abstract We study the resonant scattering for discrete time quantum walks on graphs with some tails.&#xD;In our arguments, we reduce the study of resonances to the perturbation of eigenvalues of a finite rank matrix associated with the internal graph.&#xD;Then we can apply Kato's perturbation theory of matrices, and the reduction process of generalized eigenspaces allows us to derive an explicit asymptotic expansion of the scattering matrix.&#xD;As a consequence, we obtain the resonant scattering at resonant energies.", "authors": [ { "name": "Kenta Higuchi", "affiliations": [ "Gifu University" ] }, { "name": "Ryuta Ishikawa", "affiliations": [ "ABeam Systems Ltd." ] }, { "name": "Hisashi Morioka", "affiliations": [ "Ehime Daigaku" ] }, { "name": "Etsuo Segawa", "affiliations": [ "Yokohama Kokuritsu Daigaku" ] }, { "name": "Eijirou Yoshimura", "affiliations": [ "SCSK Minori Solutions Ltd." ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae73c0", "url": "https://doi.org/10.1088/1751-8121/ae73c0", "title": "Integrable Z 2 2 -graded super-Liouville equation and Induced Z 2 2 -graded super-Virasoro algebra", "abstract": "Abstract We present a framework for enlarging the construction of Z 2 2 -graded classical Toda theory from the class of Z 2 2 -graded Lie algebras to the class of Z 2 2 -graded Lie superalgebras. This scheme is applied to derive a Z 2 2 -graded extension of the super-Liouville equation based on a Z 2 2 -graded extension of osp(1|2). The mathematical tools employed in this work are a Z 2 2 -graded version of the zero-curvature formalism and of the Polyakov's soldering procedure. It is demonstrated that both methods yield the same Z 2 2 -graded super-Liouville equation. An algebraic construction of solutions to the resulting equations is also presented, together with their Bäcklund transformations. Furthermore, three distinct new Z 2 2 -graded extensions of the super-Virasoro algebra are obtained via Hamiltonian reduction of the WZNW currents defined for Z 2 2 -osp(1|2).", "authors": [ { "name": "Naruhiko Aizawa", "affiliations": [ "Osaka Metropolitan University" ] }, { "name": "Ichi Fujii", "affiliations": [ "Osaka Metropolitan University Graduate School of Science School of Science" ] }, { "name": "Ren Ito", "affiliations": [ "Osaka Metropolitan University" ] }, { "name": "Toshiya Tanaka", "affiliations": [ "Osaka Metropolitan University" ] }, { "name": "Francesco Toppan", "affiliations": [ "CBPF" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6d53", "url": "https://doi.org/10.1088/1751-8121/ae6d53", "title": "An integrable hierarchy associated with loop extension of Z 2 2 -graded osp ( 1 | 2 )", "abstract": "Abstract A hierarchy of Z 2 2 -graded integrable equations is constructed using the loop extension of the Z 2 2 -graded Lie superalgebra osp ( 1 | 2 ) . This hierarchy includes Z 2 2 -graded extensions of the Liouville, sinh - Gordon, cosh - Gordon, and, in particular, the mKdV equations. The Z 2 2 -graded KdV equation is also derived from its mKdV counterpart via the Miura transformation. We present explicit formulas for the conserved charges of the Z 2 2 -KdV and Z 2 2 -mKdV equations. A distinctive feature of these Z 2 2 -graded integrable systems is the existence of conserved charges with nontrivial grading.", "authors": [ { "name": "Naruhiko Aizawa", "affiliations": [ "Graduate School of Science, Osaka Metropolitan University, Sugimoto Campus" ] }, { "name": "Ichi Fujii", "affiliations": [ "Graduate School of Science, Osaka Metropolitan University, Sugimoto Campus" ] }, { "name": "Ren Ito", "affiliations": [ "Graduate School of Science, Osaka Metropolitan University, Sugimoto Campus" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae73c2", "url": "https://doi.org/10.1088/1751-8121/ae73c2", "title": "Semiclassical entanglement entropy for spin-field interaction", "abstract": "Abstract We study a general bipartite quantum system consisting of a spin interacting with a bosonic field, with the initial state prepared as the product of a spin coherent state and a canonical coherent state. Our goal is to develop a semiclassical framework to describe the entanglement dynamics between these two subsystems. Using appropriate approximations, we derive a semiclassical expression for the entanglement entropy that depends exclusively on the trajectories of the underlying classical description. By analytically extending the classical phase space into the complex domain, we identify additional complex trajectories that significantly improve the accuracy of the semiclassical description. The inclusion of these complex trajectories allows us to capture the entanglement dynamics with remarkable precision, even well beyond the Ehrenfest time. The approach is illustrated with a representative example, where the role of real and complex trajectories in reproducing the quantum entanglement entropy is explicitly demonstrated.", "authors": [ { "name": "Matheus V Scherer", "affiliations": [ "Universidade Federal do Paraná" ] }, { "name": "Lea F Santos", "affiliations": [ "University of Connecticut" ] }, { "name": "Alexandre Dias Ribeiro", "affiliations": [ "Universidade Federal do Parana" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "foundations", "categories": [ "foundations", "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-27", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6c72", "url": "https://doi.org/10.1088/1751-8121/ae6c72", "title": "Boundary bound states and integrable Wilson loops in ABJM", "abstract": "Abstract We derive an integrable reflection matrix for the scattering of excitations from a boundary with a degree of freedom when the reflection process preserves an S U ( 1 | 2 ) symmetry. As this residual symmetry is not sufficient to fully determine the reflection matrix, we use the boundary remnant of the Yangian symmetry invariance and obtain a family of integrable solutions. A concrete realization of this setup is found when studying insertions in the 1/2 BPS Wilson loop in ABJM theory. The boundary degree of freedom appears as a boundary bound state due to poles in the dressing phase of the reflection matrix. We also compare our results with those obtained from the boundary bound state bootstrap procedure. The ABJM Wilson loop example enables us to perform perturbative verifications of our results.", "authors": [ { "name": "Diego H Correa", "affiliations": [ "Universidad Nacional de La Plata" ] }, { "name": "Maximiliano G Ferro", "affiliations": [ "Universidad Nacional de La Plata" ] }, { "name": "Victor I Giraldo-Rivera", "affiliations": [ "Universidad Nacional de La Plata" ] }, { "name": "Nicolás A Ivanovich", "affiliations": [ "Universidad Nacional de La Plata" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae5d9f", "url": "https://doi.org/10.1088/1751-8121/ae5d9f", "title": "Brownian ‘supermodel’ for diffusion", "abstract": "Abstract Principal Gaussian models of diffusion are: Brownian motion (BM); scaled BM; fractional BM; and power BM. These models are limited in their capacity to display anomalous behaviors: sub-diffusion and super-diffusion; aging and anti-aging; and persistence and anti-persistence. This paper devises and explores a Brownian ‘supermodel’ which is termed so due to the following key facts: it spans the principal models; it displays each and every of the above anomalous behaviors; and, notably, it displays each and every combination of the above anomalous behaviors. The supermodel has three parameters: a global scaling exponent; a short-term Holder exponent; and a long-term correlation exponent. A comprehensive analysis of the supermodel is presented, as well as practical design schemes. The schemes provide explicit and straightforward answers to the following design question: how to tune the supermodel’s parameters so as to attain any desired combination of the above anomalous behaviors. In a nutshell, this paper establishes a highly versatile and useful Brownian tool for the modeling of diffusion.", "authors": [ { "name": "Iddo Eliazar", "affiliations": [ "Tel Aviv University" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6c73", "url": "https://doi.org/10.1088/1751-8121/ae6c73", "title": "On consistency around a 3 × 3 × 3 cube and Q3 analogue of lattice Boussinesq equation", "abstract": "Abstract In this paper, we present two new results concerning lattice Boussinesq (BSQ) equations. First, we show that the lattice potential BSQ (lpBSQ) equation, defined on a nine-point square lattice, admits a natural extension of three-dimensional consistency to a 3 × 3 × 3 cube - a cubic sublattice consisting of 27 vertices. This extends the standard notion of three-dimensional consistency around an elementary cube of 8 vertices to the non-quadrilateral, nine-point setting. Second, we construct a new 3D-consistent three-component system, which we refer to as the lattice BSQ-Q3 system , serving as the BSQ analogue of the Q3( δ ) equation in the Adler - Bobenko - Suris classification. The system is derived via a discrete gauge transformation between two Lax systems of lpBSQ, with the parameter δ arising from a G L 3 action. In a degeneration limit, it reduces to a P G L 3 -invariant integrable lattice equation generalising the P G L 2 -invariant Schwarzian BSQ equation.", "authors": [ { "name": "Pengyu Sun", "affiliations": [ "Shanghai University", "Newtouch Center for Mathematics of Shanghai University" ] }, { "name": "Cheng Zhang", "affiliations": [ "Shanghai University", "Newtouch Center for Mathematics of Shanghai University" ] }, { "name": "Frank Nijhoff", "affiliations": [ "University of Leeds" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6d52", "url": "https://doi.org/10.1088/1751-8121/ae6d52", "title": "Continuum limits of lazy open quantum walks", "abstract": "Abstract We derive the continuous spacetime limit of the one dimensional lazy discrete time quantum walk, obtaining explicit macroscopic evolution equations for a three state model in the presence of decoherence. While continuum limits of two state quantum walks are well established, an explicit continuous spacetime formulation for the lazy three state walk, particularly including noise, has not previously been constructed. Using an SU (3) representation of a Grover type coin together with a Lindblad formulation of decoherence acting either on the coin or the spatial subspace, we systematically expand the discrete dynamics in both space and time to obtain continuum master equations governing the coarse grained evolution. The resulting generators yield a genuine partial differential equation description of the walk, going beyond purely probabilistic or spectral correspondences. We show that the unitary limit is governed by a Dirac-type SU ( 3 ) Hamiltonian describing ballistic advection of left and right moving modes coupled by local symmetric mixing, with the rest state acting as an additional internal degree of freedom. Coin dephasing selectively damps internal coherences while preserving coherent spatial transport, whereas spatial dephasing suppresses long range spatial interference and rapidly drives the dynamics toward classical behaviour. This continuum framework clarifies how internal symmetry, rest state coupling, and distinct decoherence channels shape large scale transport in lazy open quantum walks, and provides a foundation for future extensions toward multichannel quantum transport models and quantum inspired algorithms.", "authors": [ { "name": "Lara Janiurek", "affiliations": [ "University of Strathclyde" ] }, { "name": "Viv Kendon", "affiliations": [ "University of Strathclyde" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "algorithms", "categories": [ "algorithms", "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6adc", "url": "https://doi.org/10.1088/1751-8121/ae6adc", "title": "Multiple polylogarithms and discrete integrable systems", "abstract": "Abstract In a previous paper, we introduced analogues of Schur functions S λ defined using elliptic q -multiple polylogarithms and showed that they possess properties similar to those of Schur functions, such as the Jacobi - Trudi formula. In this paper, we present generalizations and applications of the Jacobi - Trudi formula for functions S λ . First, we define S λ / μ γ , which generalizes S λ and serves as an analogue of Schur type quasisymmetric functions, and prove the Jacobi - Trudi formula satisfied by S λ / μ γ . Next, using this formula, we derive a system of bilinear difference equations satisfied by S λ γ . This system includes, as special cases, bilinear difference equations for the R I lattice and the discrete relativistic Toda lattice, for specific parameter choices.", "authors": [ { "name": "Masaki Kato", "affiliations": [ "Ritsumeikan University" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6d57", "url": "https://doi.org/10.1088/1751-8121/ae6d57", "title": "Integral formula for the propagator of the one-dimensional Hubbard model", "abstract": "Abstract We present an exact integral formula for the multi-particle propagator of the one-dimensional Fermi - Hubbard model on an infinite lattice. The proof is based on the nested Bethe ansatz without relying on the string hypothesis. Our formula enables an explicit integral representation of the time evolution of arbitrary finite-particle wave functions and thereby provides a foundation for the exact analysis of nonequilibrium dynamics in the Hubbard model. It can further be applied to related open quantum models.", "authors": [ { "name": "Taiki Ishiyama", "affiliations": [ "Institute of Science Tokyo" ] }, { "name": "Kazuya Fujimoto", "affiliations": [ "Institute of Science Tokyo" ] }, { "name": "Tomohiro Sasamoto", "affiliations": [ "Institute of Science Tokyo" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "simulation", "categories": [ "simulation", "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6d59", "url": "https://doi.org/10.1088/1751-8121/ae6d59", "title": "Stochastic resetting in the infinite range Ising model", "abstract": "Abstract We study the effect of stochastic resetting on the infinite-range Ising model evolving via the Glauber dynamics, where the system is intermittently reset to a configuration with fixed magnetisation m 0 . Reset times are drawn either from an exponential distribution with rate r or from a power-law distribution ψ ( τ ) ∼ τ − 1 − α . Our analysis centres on the probability distribution P ( m , t ) of the magnetisation, m at time t . For exponential resetting, a stationary distribution exists for all temperatures, and resetting-induced crossovers occur above, below and at the critical temperature T C : for T > T C , the peak of the distribution shifts from m = 0 to m = m 0 at a critical rate r ∗ , while for T < T C it shifts from m = m eq to m = m 0 at r = r ′ , which is different from r ∗ . At T = T C , an r -dependent crossover occurs from a unimodal distribution with a maximum between m = 0 and m 0 to a monotonic distribution peaked at m = m 0 . For power-law resetting, the magnetisation distribution is stationary only for α > 1 , while being time dependent for α < 1 . Under power-law reset, the distribution is double-peaked, with maxima at 0 and m 0 for T > T C and at m eq and m 0 for T < T C , without any qualitative change in the ordered-phase distribution as α is varied. At T = T C and α > 1 , a crossover occurs at α = 3 2 from a double-peaked distribution to a single-peaked form at m 0 . In both cases, analytical expressions for the magnetisation distribution are obtained and confirmed by numerical simulations. These results demonstrate how stochastic resetting reshapes collective dynamics and phase structure in interacting mean-field systems.", "authors": [ { "name": "Anagha V K", "affiliations": [ "Indian Institute of Space Science and Technology" ] }, { "name": "Apoorva Nagar", "affiliations": [ "Indian Institute of Space Science and Technology" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": true, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6adb", "url": "https://doi.org/10.1088/1751-8121/ae6adb", "title": "Nuclear molecule of heavy nuclei", "abstract": "Abstract A model for a nuclear molecule composed of two heavy nuclei is proposed. To this end, the Hamiltonian of the dinuclear system is derived and diagonalized within a basis of bipolar spherical harmonics. Approximate analytical expressions describing the excitations of highly deformed molecular states are obtained. A remarkable agreement between numerical and analytical results is demonstrated in the description of low-energy roto-vibrational excitations in 240 Pu. Furthermore, we provide predictions for the spectrum of hyperdeformed states in 232 Th, treating it as a nuclear molecule consisting of 132 Sn and 100 Zr fragments. Finally, the angular distribution of fission fragments for 240 Pu is analyzed and found to be in good agreement with available experimental data.", "authors": [ { "name": "T M Shneidman", "affiliations": [ "JINR" ] }, { "name": "R G Nazmitdinov", "affiliations": [ "JINR", "Dubna State University" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae72d5", "url": "https://doi.org/10.1088/1751-8121/ae72d5", "title": "Quasi-potential of stochastic dynamics via instanton-guided sparse identification", "abstract": "Abstract Quasi-potential is a crucial concept in stochastic systems as it characterizes long-term behavior and estimates transition rates between states. Quasi-potential is a part of the orthogonal decomposition of the deterministic vector field (drift) driving the dynamics. Yet, its computation is often obtained via a challenging functional minimization problem. This paper brings together two different areas, combining a machine learning-based sparse identification technique with an instanton-action minimization method to determine the quasi-potential. Concretely, the so-called sparse identification of non-linear dynamics (SINDy) was applied to the most likely trajectory (instanton) in a stochastic system to learn the drift's orthogonal decomposition. This hybrid framework that combines instanton-based minimization with the SINDy results in approximated analytical expressions for both the quasi-potential and the orthogonal component, even at points outside the instanton path. The orthogonal component, in particular, is important as it serves as a correction to the exponential decay of transition rates and exit times. This paper offers an effective and cost-efficient procedure for determining the quasi-potential in comparison with existing methods. We implemented the proposed approach in 2-and 3-D systems, covering various types of potential landscapes and attractors.", "authors": [ { "name": "Leonardo de Sousa Grigorio", "affiliations": [ "Centro Federal de Educacao Tecnologica Celso Suckow da Fonseca" ] }, { "name": "Mnerh Nasser Alqahtani", "affiliations": [ "University of Hafr Albatin" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae6d54", "url": "https://doi.org/10.1088/1751-8121/ae6d54", "title": "Bethe ansatz solution to integrable bosonic cube networks", "abstract": "Abstract We study two extended Bose - Hubbard-type Hamiltonians representing bosonic networks restricted to the graph of a cube. For both Hamiltonians, we demonstrate that Bethe ansatz methods of solution can be employed after applying a canonical transformation of operators. We provide the resulting Bethe ansatz equations, and corresponding formulae for states and energies of both Hamiltonians.", "authors": [ { "name": "Lachlan Bennett", "affiliations": [ "The University of Queensland" ] }, { "name": "Phillip S Isaac", "affiliations": [ "The University of Queensland" ] }, { "name": "Jon Links", "affiliations": [ "The University of Queensland" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae72d4", "url": "https://doi.org/10.1088/1751-8121/ae72d4", "title": "Security boundaries of two-way continuous-variable quantum key distribution under multiple source imperfections", "abstract": "Abstract Two-way continuous-variable quantum key distribution protocol, where the parties make a double use of the quantum channel, shows the general superadditivity in the security thresholds, which are proven to be higher than that of the classical one-way protocol. However, all existing security proofs for two-way protocols assume perfect source devices or a trusted source noise, which is hard to ensure in a practical system. In this paper, the effects of multiple source fluctuations on the security of the two-way protocol are proposed, where Eve may have access to the intensity fluctuation information with an arbitrary random distribution. This work is comprehensive of several practical scenarios, encompassing both ON and OFF configurations, with and without the assumption that trusted users can access the fluctuation information. The analysis shows that when the users have no fluctuation information, the intensity fluctuation effect in the ON configuration should be modeled as an additional thermal noise rather than being described by a beam splitter model as in the general one-way protocol. In addition, this untrusted noise is only related to the intensity fluctuation variance but has no relation to its distribution. Finally, the tagging idea is applied to the two-way protocol to obtain a conservative secure key.", "authors": [ { "name": "Ningyi Mao", "affiliations": [ "Central South University" ] }, { "name": "Hang Zhang", "affiliations": [ "Central South University" ] }, { "name": "Zhiyue Zuo", "affiliations": [ "Central South University" ] }, { "name": "Yiyu Mao", "affiliations": [ "Changsha University of Science and Technology" ] }, { "name": "Yijun Wang", "affiliations": [ "Central South University" ] }, { "name": "Ying Guo", "affiliations": [ "Beijing University of Posts and Telecommunications" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "communication", "categories": [ "communication", "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-26", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae7224", "url": "https://doi.org/10.1088/1751-8121/ae7224", "title": "On continuum and resonant spectra from exact WKB analysis", "abstract": "Abstract Resonance phenomena are central to many quantum systems, where resonant states are typically characterized by pole singularities of the S-matrix. In this work, we employ the complex scaling method (CSM) in conjunction with exact WKB analysis to elucidate the geometric structure of scattering problems that encompass both bound and resonant states. By analyzing the continuum spectrum via the exact WKB framework, we derive the S-matrix for the inverted Rosen-Morse potential and reveal its underlying complex-geometric features. Furthermore, we reinterpret the Aguilar-Balslev-Combes theorem, the foundation of CSM, from a geometric perspective, and discuss the physical significance of the Siegert boundary condition within a rigorously defined modified Hilbert space. Our analysis bridges scattering cross-sections and spectral theory, offering new geometric insights into quantum resonance and scattering phenomena.", "authors": [ { "name": "Okuto Morikawa", "affiliations": [ "RIKEN" ] }, { "name": "Shoya Ogawa", "affiliations": [ "Kyushu University" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae7225", "url": "https://doi.org/10.1088/1751-8121/ae7225", "title": "New quasi-exactly solvable systems from SUSYQM and Bethe ansatz", "abstract": "Abstract We give a systematic construction of new quasi-exactly solvable systems via the Bethe ansatz and supersymmetric quantum mechanics (SUSYQM). Methods based on the intertwining of supercharges have been extensively used in the literature for exactly solvable systems. We generalize the state-deleting (Krein-Adler) supersymmetric transformations to quasi-exactly solvable (QES) systems, building on the Bethe ansatz method and the associated Bethe roots. This enables us to construct superpartners for a wide class of known QES systems previously classified through a hidden sl(2) algebra. We present our constructions of factorizations and intertwining relations associated with first-order SUSYQM and the n = 1 state for 12 nonequivalent types, denoted I,. . .,XII. In order to have a unified treatment, we rely on their standard ODE form, as this is also the appropriate setting to obtain the Bethe ansatz equations that constrain the polynomial solutions. This setting also allows one to deal with systems with n states in a unified manner, using analysis based on the Bethe ansatz equations to build the supersymmetric transformations in terms of the Bethe ansatz roots. We derive the Schrödinger potentials for the n = 1 superpartners of the 12 QES cases and give closed-form solutions for the spectra and wavefunctions of the corresponding QES-SUSYQM systems. Furthermore, we present numerical results for higher excited states up to the n = 10 level. The results obtained may have wider applicability, as our framework is built on ODEs with polynomial coefficients.", "authors": [ { "name": "Siyu Li", "affiliations": [ "La Trobe University" ] }, { "name": "Ian Marquette", "affiliations": [ "La Trobe University" ] }, { "name": "Yao-Zhong Zhang", "affiliations": [ "The University of Queensland" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae7227", "url": "https://doi.org/10.1088/1751-8121/ae7227", "title": "Recurrence relations and the Christoffel-Darboux formula for a special class of elliptic orthogonal polynomials", "abstract": "Abstract In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their fundamental properties. In particular, we derive general five-term and seven-term recurrence relations, which lead to a Christoffel-Darboux formula and the construction of an associated point process on the A-cycle of the torus. Notably, the recurrence coefficients in these relations are intricately linked through the underlying elliptic curve equation. Under additional symmetry assumptions on the weight function, the structure simplifies considerably, recovering known results for orthogonal polynomials on the complex plane.", "authors": [ { "name": "Harini Desiraju", "affiliations": [ "University of Oxford" ] }, { "name": "Sampad Lahiry", "affiliations": [ "Katholieke Universiteit Leuven" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.1088/1751-8121/ae7223", "url": "https://doi.org/10.1088/1751-8121/ae7223", "title": "Perfect state transfer in inhomogeneous XX model of q -Racah type", "abstract": "Abstract New exactly solvable one-dimensional XX spin chain models that exhibit perfect state transfer are defined. These models have inhomogeneous couplings and magnetic fields determined from the three-term recurrence relations satisfied by the q-Racah and para q-Racah polynomials. Due to this connection with orthogonal polynomials, the one-excitation sector can be solved analytically. This allows us to provide the explicit set of conditions on the polynomial parameters that guarantees the occurrence of perfect state transfer across these spin chains.", "authors": [ { "name": "Nicolas Crampe", "affiliations": [ "Universite de Montreal" ] }, { "name": "Simon Lafrance", "affiliations": [ "Universite de Montreal" ] }, { "name": "Charles Robillard", "affiliations": [ "Universite de Montreal" ] }, { "name": "Luc Vinet", "affiliations": [ "Universite de Montreal" ] } ], "journal": { "id": "jpa-mt", "title": "Journal of Physics A: Mathematical and Theoretical", "issn": [ "1751-8113", "1751-8121" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "foundations", "algorithms" ], "india_hint": false, "published": "2026-05-22", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.953-975", "url": "https://doi.org/10.46586/tches.v2026.i2.953-975", "title": "Secret Key Recovery of FALCON using Simple Power Analysis in Conditional Calculator", "abstract": "Among the NIST-standardized algorithms, FALCON is a lattice-based digital signature scheme that offers strong security and compactness. However, FALCON’s reliance on floating-point arithmetic makes it vulnerable to side-channel attacks. In particular, certain operations in FALCON, such as floating-point conversion and floating-point addition within the FFT transform, may result in data-dependent power consumption patterns. These patterns can be exploited by Simple Power Analysis to extract secret key information, even from a single trace.We present a Simple Power Analysis against the FALCON digital signature scheme, focusing on the Conditional calculator involved in floating-point conversion and floating-point addition. We also analyze the effectiveness of two countermeasures for the Conditional calculator. We propose a post-processing procedure that computes all possible candidates and applies a pruning strategy to eliminate impossible ones. The secret key can be recovered within 0.12 seconds for secret keys generated from a discrete Gaussian distribution and 21.02 seconds for those generated from a uniform distribution. We further propose an advanced post-processing procedure that ranks candidate keys based on their consistency with observed side-channel information, enabling full secret key recovery even when partial information is incorrect. The proposed attack is evaluated with up to 5,000 intentionally corrupted side-channel information entries (≈ 9.3% of the leakage bits); within this range, the correct key was consistently recovered with a 100% success rate. Additionally, we successfully recovered the correct secret key across 1,000 distinct FALCON secret keys.", "authors": [ { "name": "GyuSang Kim", "affiliations": [] }, { "name": "JeongHwan Lee", "affiliations": [] }, { "name": "Myeonghoon Lee", "affiliations": [] }, { "name": "Seokhie Hong", "affiliations": [] }, { "name": "HeeSeok Kim", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.347-371", "url": "https://doi.org/10.46586/tches.v2026.i2.347-371", "title": "TWFalcon: Triple-Word Arithmetic for Falcon", "abstract": "The post-quantum signature scheme Falcon is an attractive scheme for constrained devices due to its compactness and verification performance. However, it relies on floating-point arithmetic for signature generation, which - alongside physical security concerns - introduces two additional drawbacks:Firstly, if implemented using the standard double-precision format, Falcon does not satisfy the formally proven error bounds required for a secure Gaussian sampler implementation. Although no practical attacks exploiting this limitation are currently known, it does give future attack concerns. Secondly, when looking at constrained devices, 32-bit constrained devices can lack hardware support for high-precision floating-point arithmetic and its use introduces significant performance overhead, as it must be emulated using integers.In this work we present a novel method to address these limitations: We show that Falcon can be implemented using single-precision floating-point numbers. Our proposed method uses Triple-Word Floating-Point (TW) arithmetic and achieves a precision of at least 72 bits, compared to the 53 bits of double-precision floatingpoint arithmetic. We show our implementation achieves error bounds that meet the formal security requirements for a secure Gaussian sampler implementation, while maintaining other security guarantees. This way, Falcon can run on constrained devices equipped only with a single-precision Floating-Point Unit (FPU) without the need for integer emulation.We demonstrate the feasibility of our approach on the Nucleo-L4R5ZI board, which features a Cortex-M4F processor enabled with a single-precision FPU. More precisely, we show the cost of increasing the precision of Falcon in this way only increases the computational effort by a factor of approximately 1.84 compared to the CPU cycles required for an implementation using emulated double-precision arithmetic via integers.", "authors": [ { "name": "Stef Halmans", "affiliations": [] }, { "name": "Christine Van Vredendaal", "affiliations": [] }, { "name": "Tobias Schneider", "affiliations": [] }, { "name": "Frank Custers", "affiliations": [] }, { "name": "Tim Güneysu", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.51-72", "url": "https://doi.org/10.46586/tches.v2026.i2.51-72", "title": "Masked Solving of Linear Equations System and Application to UOV Signatures", "abstract": "In response to the looming quantum threat, NIST has selected four algorithms for standardization (i.e., ML-KEM, ML-DSA, SLH-DSA, and FN-DSA), yet three of the four schemes are based on Euclidean lattices, which raises concerns about the mathematical diversity of post-quantum algorithms. NIST has therefore announced an additional call for post-quantum signatures with a preference for schemes constructed from assumptions other than lattices. Among such candidates, the Unbalanced Oil and Vinegar (UOV) signature over the multivariate quadratic (MQ) problem is attractive for its short signature and security against quantum cryptanalysis. However, the practical implementations of UOV remain vulnerable to power side-channel attacks.In this paper, we address this issue by presenting two improved techniques for masking linear equations system solving at arbitrary order, with a proof of security in the t-probing model. We show that in the masked setting, our inversion-based techniques outperform Gaussian elimination, unlike the unmasked setting where Gaussian elimination is typically more efficient. As an application, we develop a complete C implementation of the fully masked UOV signing using our improved techniques. Compared to masked Gaussian elimination, our techniques achieve at least 2.2 times speedup at high-order. Against Kundu’s latest implementation (CCS 2025), our masked UOV signing is faster by an average factor of 4.0 at higher masking orders.", "authors": [ { "name": "Jean-Sébastien Coron", "affiliations": [] }, { "name": "François Gérard", "affiliations": [] }, { "name": "Bowen Zhang", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.868-892", "url": "https://doi.org/10.46586/tches.v2026.i2.868-892", "title": "Efficient High-Order Masking of FrodoKEM’s CDT-Based Gaussian Sampler", "abstract": "FrodoKEM is a conservative lattice-based KEM based on the Learning With Errors problem. While it was not selected for NIST standardization, it remains a strong candidate for high-security applications and is recommended by several national agencies, including BSI, ANSSI, and the EUCC. Its reliance on CDTbased Gaussian sampling presents a significant challenge for side-channel secure implementations. While recent work by Gérard and Guerreau [GG25] has shown that masking FrodoKEM is feasible, the Gaussian sampler remains a major bottleneck, accounting for between 34% and 65% of the execution time. In this work, we introduce a new high-order masking gadget for CDT sampling, provably secure in the ISW probing model and significantly more efficient than previous approaches. We instantiate and evaluate our design on a real-world setup to assess its sidechannel resistance in the context of FrodoKEM, using a complete first-order masked implementation on Cortex-M3, which reflects the most relevant practical threat model. Compared with [GG25] at first order, the cost of the sampler is reduced by at least 82% and the number of random generations by at least 69%. Higher-order security is also fully supported through a generic C implementation, with some selected gadgets hand-optimized in assembly to improve efficiency.", "authors": [ { "name": "Elie Eid", "affiliations": [] }, { "name": "Aurélien Greuet", "affiliations": [] }, { "name": "Nathan Reboud", "affiliations": [] }, { "name": "Rina Zeitoun", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.495-519", "url": "https://doi.org/10.46586/tches.v2026.i2.495-519", "title": "Improving ML-KEM and ML-DSA on OpenTitan", "abstract": "This work improves upon the instruction set extension proposed in the paper “Towards ML-KEM and ML-DSA on OpenTitan”, in short OTBNTW, for OpenTitan’s big number coprocessor OTBN. OTBNTW introduces a dedicated vector instruction for prime-field Montgomery multiplication, with a high multi-cycle latency and a relatively low utilization of the underlying integer multiplication unit. The design targets post-quantum cryptographic schemes ML-KEM and ML-DSA, which rely on 12-bit and 23-bit prime field arithmetic, respectively. We improve the efficiency of the Montgomery multiplication by fully exploiting existing integer multiplication resources and move modular multiplication from hardware back to software by providing more powerful and versatile integer-multiplication vector instructions. This enables us not only to reduce the overall computational overhead through lazy reduction in software but also to improve performance in other functions beyond finite-field arithmetic. We provide two variants of our instruction set extension, each offering different trade-offs between resource usage and performance. For ML-KEM and ML-DSA, we achieve a speedup of up to 17% in cycle count, with an ASIC area increase of up to 6% and an FPGA resource usage increase of up to 4% more LUT, 20% more CARRY4, 1% more FF, and the same number of DSP compared to OTBNTW. Overall, we significantly reduce the ASIC time-area product, if the designs are clocked at their individual maximum frequency, and at least match that of OTBNTW, if the designs are clocked at the same frequency.", "authors": [ { "name": "Ruben Niederhagen", "affiliations": [] }, { "name": "Hoang Nguyen Hien Pham", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.736-763", "url": "https://doi.org/10.46586/tches.v2026.i2.736-763", "title": "On the Security of Lightweight Homomorphic Obfuscation for Protecting Against Hardware Trojans", "abstract": "Hardware Trojan (HT) attacks pose a critical threat to modern microelectronics by enabling the leakage of sensitive information, such as cryptographic keys, or by inducing functional faults. This risk is amplified in Commercial-Off-the-Shelf (COTS) processors, where users have limited control over the supply chain and cannot verify the integrity of integrated circuits. Existing countermeasures often fall short in this context, as they rely on trusted design houses or foundries and require access to design data for modification or analysis. Moreover, most golden-reference-free detection methods can only identify but not bypass HTs. To address these challenges, we present HOACS (Homomorphic Obfuscation Assisted Concealing of Secrets), a software-oriented framework that protects confidential data from HT-based leakage without any trust or modification at the hardware level. HOACS employs the Residue Number System (RNS) to homomorphically encode computations, transforming standard C-based programs into residue-obfuscated equivalents. Implemented as an LLVM compiler pass, HOACS automatically protects arbitrary programs with minimal developer effort. We evaluate HOACS across AES key expansion, RSA, and MAC (multiply - accumulate) operations on x86 (via gem5) and RISC-V platforms, including FPGA validation on the Cappuccino soft-core. Results confirm that plaintext secrets never appear in processor registers and that RNC-based encoding significantly disrupts side-channel leakage. A detailed threat and complexity analysis demonstrates that Trojan activation before encoding is mathematically improbable and that brute-force decoding of unknown moduli is computationally infeasible. Finally, performance comparisons show that HOACS achieves far lower overhead than existing fully or partially homomorphic encryption frameworks, offering a practical, lightweight obfuscation method for securing COTS processors in untrusted environments.", "authors": [ { "name": "Tanvir Hossain", "affiliations": [] }, { "name": "Matthew Showers", "affiliations": [] }, { "name": "Mahmudul Hasan", "affiliations": [] }, { "name": "Tamzidul Hoque", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.709-735", "url": "https://doi.org/10.46586/tches.v2026.i2.709-735", "title": "NTT-PEEL: Bit Shift Side-Channel in FALCON’s Number Theoretic Transform", "abstract": "This work introduces a new single-trace side-channel attack against FALCON, a lattice-based post-quantum digital signature scheme recently selected for standardization by NIST. The proposed attacks exploit a new vulnerability in the in-place modular reduction within the number theoretic transform (NTT). The vulnerable component executes both in the key generation and signature generation schemes of FALCON. Our key innovation is a custom attack method, which consists of forward and backward pass algorithms that combine partial leakages by exploiting the inherent structural dependencies. Overall, the method serves as an efficient mechanism for peeling key-dependent information from the NTT. We demonstrate the attack on an ARM Cortex-M4 microcontroller, evaluating both the reference and optimized implementations from FALCON’s NIST round 3 software package. We quantified that our attack reduces the search space to 224 with the assistance of lattice reduction algorithms. These findings expose the susceptibility of current software deployments to single-trace exploitation and emphasize the pressing need for embedded implementations hardened against such attacks.", "authors": [ { "name": "Jinyi Qiu", "affiliations": [] }, { "name": "Aydin Aysu", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.272-295", "url": "https://doi.org/10.46586/tches.v2026.i2.272-295", "title": "A Framework for designing High-Order Side-Channel Protected Hardware Implementations of ML-KEM", "abstract": "ML-KEM (formerly Kyber) has recently been adopted as FIPS 203 in the NIST Post-Quantum Cryptography standardization process. While existing hardware implementations primarily optimize for performance, they often lack protections against side-channel attacks. We introduce HOPE-MLKEM, a framework that includes the first configurable, open, and full-hardware implementation of ML-KEM with integrated high-order protection against timing and power side-channel attacks. Our modular architecture supports all security levels and operations, incorporating optimized building blocks for polynomial arithmetic, modular multiplication, and programmable control logic. At the same time, this methodology enables the seamless integration of masking countermeasures up to high orders. We evaluated HOPE-MLKEM on FPGA and ASIC platforms, achieving competitive results compared to state-ofthe- art unprotected designs while providing resistance against high-order side-channel attacks. Beyond its technical contributions, HOPE-MLKEM is released as an opensource framework to foster community-driven exploration of design choices, leakage evaluation, and hardware optimizations.", "authors": [ { "name": "Eros Camacho-Ruiz", "affiliations": [] }, { "name": "Pablo Navarro-Torrero", "affiliations": [] }, { "name": "Alejandro Cabrera Aldaya", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.468-494", "url": "https://doi.org/10.46586/tches.v2026.i2.468-494", "title": "Non-supervised SASCA on the VOLEitH Framework", "abstract": "In this paper, we present a single-trace side-channel attack on the Vector Oblivious Linear Evaluation in the Head (VOLEitH) framework. This framework is based on the Multi-Party Computation-in-the-Head (MPCitH) framework, which is used in 6 of the 14 digital signature schemes in the second round of the National Institute of Standards and Technology (NIST) call for additional digital signatures. Our attack leverages the structure of the VOLEitH framework, particularly the properties of VOLE correlations. Considering this along with the redundancy present in this framework, we build the first Soft Analytical Side-Channel Attack (SASCA) on this framework. In order to test the robustness to noise and therefore the generality of our attack, we apply it to the parameters sets of both FAEST and Syndrome Decoding in the Head (SDitH), resulting in the first side-channel attacks on the second-round versions of these two algorithms. We then demonstrate the practicality of our attack in a non-supervised scenario, showing that we can use SASCA even in such a setting. To do this, we carried out a power-based side channel attack on an STM32F303RE and used clustering, allowing us to recover the secret data for all the security levels of both FAEST and SDitH, even at high noise levels. Finally, we propose countermeasures to mitigate such an attack on the VOLEitH framework.", "authors": [ { "name": "Julie Godard", "affiliations": [] }, { "name": "Nicolas Aragon", "affiliations": [] }, { "name": "Philippe Gaborit", "affiliations": [] }, { "name": "Antoine Loiseau", "affiliations": [] }, { "name": "Julien Maillard", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.132-166", "url": "https://doi.org/10.46586/tches.v2026.i2.132-166", "title": "aLEAKator: HDL Mixed-Domain Simulation for Masked Hardware & Software Formal Verification", "abstract": "Verifying the security of masked hardware and software implementations, under advanced leakage models, remains a significant challenge, especially when accounting for glitches, transitions and CPU micro-architectural specifics. Existing verification approaches are either restricted to small hardware gadgets, small programs on CPUs such as Sboxes, limited leakage models, or require hardware-specific prior knowledge.In this work, we present aLEAKator, an open-source framework for the automated formal verification of masked cryptographic accelerators and software running on CPUs from their HDL descriptions. Our method introduces mixed-domain simulation, enabling precise modeling and verification under various (including robust and relaxed) 1-probing leakage models, and supports variable signal granularity without being restricted to 1-bit wires. aLEAKator also supports verification in the presence of lookup tables, and does not require prior knowledge of the target CPU architecture. Our approach is validated against existing tools and real-world measurements while providing innovative results such as the verification of a full, first-order masked AES on various CPUs.", "authors": [ { "name": "Noé Amiot", "affiliations": [] }, { "name": "Quentin Meunier", "affiliations": [] }, { "name": "Karine Heydemann", "affiliations": [] }, { "name": "Emmanuelle Encrenaz", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.686-708", "url": "https://doi.org/10.46586/tches.v2026.i2.686-708", "title": "When Masking Multiplication Isn’t Enough: Exploiting Floating-Point Leakage in Falcon’s Pre-Image Computation", "abstract": "In this paper, we present an improved correlation power analysis (CPA) attack on the pre-image computation of the digital signature scheme Falcon. Our attack exploits new side-channel leakage that multiplication masking schemes fail to protect. To enhance both the efficiency and accuracy of the attack, we develop new theoretical insights for recovering the secret floating-point numbers, which can also be leveraged to improve prior attacks. For mantissa recovery, we identify and correct a flaw in an earlier work and provide a more complete and practical analysis. For exponent recovery, we analyze the distribution of Falcon’s secret key after the fast Fourier transform, reduce the number of required traces, and mitigate false positives. To validate our attack, we conducted two experiments targeting existing countermeasures on floating-point multiplication. In our environment, we successfully recovered the secret key using only around one thousand power traces. Our results demonstrate that protecting floating-point multiplication alone is insufficient to defend Falcon against side-channel attacks. A comprehensive masking including at least floating-point addition is necessary.", "authors": [ { "name": "Keng-Yu Chen", "affiliations": [] }, { "name": "Ming Qing Ching", "affiliations": [] }, { "name": "Jiun-Peng Chen", "affiliations": [] }, { "name": "Bo-Yin Yang", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.73-105", "url": "https://doi.org/10.46586/tches.v2026.i2.73-105", "title": "Loricae: Upgrading and Optimizing Multi-Party Computation Protocols with Filmy Hardware Enclaves", "abstract": "Privacy-preserving computing techniques have been recently developed in two complementary directions. Cryptography-based multi-party computation (MPC) is provably secure but not performant, while hardware-based trusted execution environments (TEEs) trade security provability for high performance. Although some previous works have combined MPC and TEEs, they obscure a key question: If TEEs are fully trusted, what is the necessity of such combination which simply hurts performance? Or, if TEEs are not trusted, to what extent are they untrusted? We answer this question by formalizing a filmy enclave model to capture practical TEE features, where only the integrity of TEE content and the confidentiality of cryptographic procedures are guaranteed. With such TEEs, we can upgrade semihonest MPC protocols to defend against malicious attackers. Data confidentiality is ensured through MPC protocols, while execution integrity is guaranteed by the code integrity within TEEs and our novel security designs. These designs safeguard all external inputs, including pre-generated correlated random numbers for MPC protocols and enclave state checkpoints for fault-tolerant execution. Besides protocol upgrade, we show filmy enclave models can also optimize communication for semihonest protocols. Our design exhibits significant performance advantages over existing actively secure protocols.", "authors": [ { "name": "Xiang Li", "affiliations": [] }, { "name": "Baiting Jiang", "affiliations": [] }, { "name": "Xiaoyu Fan", "affiliations": [] }, { "name": "Weijie Liu", "affiliations": [] }, { "name": "Yifan Song", "affiliations": [] }, { "name": "Mingyu Gao", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "error-correction", "categories": [ "error-correction" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.441-467", "url": "https://doi.org/10.46586/tches.v2026.i2.441-467", "title": "AIPS: AI-Based Power Simulation for Pre-Silicon Side-Channel Security Evaluation", "abstract": "Power side-channel analysis (SCA) attacks pose a significant threat to the security of integrated circuits, making pre-silicon evaluation essential for vulnerability identification. Existing approaches face a fundamental trade-off: commercial electronic design automation (EDA) tools can generate accurate nanosecond-resolution transient power traces, but become prohibitively slow as design size and trace length increase; in contrast, recent artificial intelligence (AI) methods largely target average-power estimation and overlook fine-grained transients critical to SCA. To address this gap, we propose AIPS, an AI-based gate-level power simulation framework that uses a diffusion model to synthesize transient power traces conditioned on switching activity and technology-library features. AIPS is trained on power traces generated by Synopsys PrimeTime PX (PTPX) and evaluated on five representative targets (AES, Kyber, two masked AES variants, and a RISC-V core) using waveform-similarity metrics and first- and higher-order SCA. Results show that AIPS matches PTPX closely under waveform metrics and reproduces the same evaluation outcomes as PTPX under the tested attack settings, while delivering 4.14x - 42.44x speedup over PTPX when scaling to 1M traces. In inference-only mode, AIPS achieves up to 10kx speedup. AIPS maintains accuracy with small training sets (about 1k traces or less), and scales favorably with increasing trace length, enabling large-scale pre-silicon side-channel security evaluation.", "authors": [ { "name": "Ya Gao", "affiliations": [] }, { "name": "Haocheng Ma", "affiliations": [] }, { "name": "Tanchen Zhang", "affiliations": [] }, { "name": "Jiaji He", "affiliations": [] }, { "name": "Yiqiang Zhao", "affiliations": [] }, { "name": "Mirjana Stojilović", "affiliations": [] }, { "name": "Yier Jin", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.545-573", "url": "https://doi.org/10.46586/tches.v2026.i2.545-573", "title": "Combined Indistinguishability Analysis", "abstract": "Cryptographic hardware implementations are vulnerable to combined physical implementation attacks, integrating Side-Channel Analysis (SCA) and Fault Injection Analysis (FIA) to compromise their security. Although theoretically sound countermeasures exist, their practical application is often complicated and error-prone, making automated security verification a necessity. Various tools have been developed to address this need, using different approaches to formally verify security, but they are limited in their ability to analyze complex hardware circuits in the context of Combined Analysis (CA) and advanced probabilistic adversary models.In this work, we introduce a novel verification method that assesses the security of complex hardware circuits in the context of random probing with random faults, a scenario that more closely reflects real-world combined attack scenarios. Our approach centers around symbolic fault simulation and the derivation of a fault-enhanced leakage function using the Fourier-Hadamard Transform (FHT), enabling the computation of tight leakage probabilities for arbitrary circuits and providing a more accurate and comprehensive security analysis. By integrating our method into the INDIANA security verification framework, we extended its capabilities to analyze the leakage behavior of circuits in the presence of random faults, demonstrating the practicality of our approach.The results of our evaluation highlight the versatility and scalability of our approach, which can efficiently compute leakage probabilities under various fault scenarios for large-scale attacks, e. g., for a masked round of the PRESENT cipher. Notably, our method can complete most experiments in less than an hour, demonstrating a significant improvement over existing estimation-based tools. This achievement confirms the potential of our approach to provide a more comprehensive and practically useful security assessment of hardware circuits, and marks an important step forward for the development of secure hardware systems.", "authors": [ { "name": "Armand Schinkel", "affiliations": [] }, { "name": "Pascal Sasdrich", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.240-271", "url": "https://doi.org/10.46586/tches.v2026.i2.240-271", "title": "TSM+ and OTSM", "abstract": "Among the countermeasures against side-channel analysis attacks, masking offers formal security guarantees and composability, yet remains challenging to implement efficiently in hardware due to physical defaults like glitches and transitions. Low-latency masking techniques aim to mitigate the performance penalties but can inadvertently compromise security in certain architectural contexts. In particular, the recently proposed Time Sharing Masking (TSM) technique enables single-cycle masked implementations with composability under the SNI and PINI notions but fails to satisfy stronger composability guarantees required in iterative designs, i.e., OPINI. In this work, we show that TSM-based constructions can exhibit first-order leakage when used in single-register feedback architecture, such as round-based implementations of ciphers. To address this, we propose two new masking schemes: TSM+, a more efficient variant of TSM satisfying only PINI (but not SNI), and OTSM, a construction satisfying OPINI, enabling secure round-based designs. Our improved round-based masked implementations of PRINCE and AES ensure security in latency-critical applications under both glitch- and transition-extended probing model while demanding for slightly more area consumption.", "authors": [ { "name": "Hemin Rahimi", "affiliations": [] }, { "name": "Amir Moradi", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.659-685", "url": "https://doi.org/10.46586/tches.v2026.i2.659-685", "title": "DS-NSCA: Differentiable Search for Non-Profiling Side-channel Analysis", "abstract": "Deep-learning-based side-channel analysis can effectively break countermeasures such as masking, posing a significant threat to the security of cryptographic devices. In profiling attack scenarios, additional cloned devices are typically required to obtain prior knowledge, which implies the portability problem between profiling and target devices. In contrast, non-profiling attacks ignore the portability by exhaustively testing all possible keys. However, the label information related to the key is unknown, making it difficult to apply deep learning techniques. Since the introduction of Differential Deep Learning Analysis by Timon et al. at CHES 2019, existing approaches can be categorized into unsupervised learning and supervised learning with guessed-key or plaintext labels. Methods based on guessed-key labels have received considerable attention but suffer from significant noise due to incorrect key labels, which limits the model’s ability to distinguish the correct key.To address these issues, this paper proposes a differentiable search for non-profiling side-channel analysis, which is called DS-NSCA. Our method transforms discrete key guesses into continuous probability distributions. By designing a loss function weighted by key probabilities, the approach ensures that the optimal solution corresponds to maximizing the probability of the correct key. This method eliminates the need for an additional key recovery stage by searching for the correct key during training. To further improve search accuracy, we introduce an optimization mechanism based on validation loss gradient-free feedback that dynamically adjusts the key probability distribution after each round, guiding the model’s learning direction. Experimental results on the ASCAD, AES_HD, and CHES_CTF datasets demonstrate that DSNSCA with MLP outperforms existing methods and exhibits robustness against noisebased countermeasures. Furthermore, we demonstrate that integrating convolutional neural network with DS-NSCA can mitigate random delay countermeasures on the AES_RD and ASCAD_RD datasets.", "authors": [ { "name": "Di Li", "affiliations": [] }, { "name": "Zheng Gong", "affiliations": [] }, { "name": "Yufeng Tang", "affiliations": [] }, { "name": "Chun Li", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.28-50", "url": "https://doi.org/10.46586/tches.v2026.i2.28-50", "title": "Racing against the clock: side-channel leakage from crossing asynchronous clock domains", "abstract": "Current physical side-channel attacks are based on direct power or electromagnetic measurements, or indirect quantities such as precise measurements of clock jitter. On the other hand, timing side-channel attacks exfiltrate secrets by observing secret-dependent variations in runtime caused by branches or micro-architectural effects, e.g. due to caching. However, little attention has been paid to the fact that power leakage might also manifest architecturally, for example through variations in cycle counts of clock domain crossings, due to the supply-voltage-dependence of the Voltage-Controlled Oscillators within the on-chip Phase-Locked Loop blocks. In this paper, we show that memory and peripherals that operate in a different clock domain to a target processor can be used to indirectly measure power consumption. This allows power side-channel attacks to be performed from software, without privileged access to direct power measurements and using only a cycle counter.We first demonstrate that in a (noisy) x86 environment, it is possible to differentiate between instructions (and instruction operands) based on the variation of cycle counts relative to wall-clock time. For an embedded environment (using an NXP i.MX RT1160-family System-on-Chip (SoC)), we similarly show surprisingly large variations in cycle count correlated with the Hamming weight of data. Based on these observations, we hypothesise a leakage mechanism and present evidence from simulation and a Field Programmable Gate Array-based experiment. We then construct a timing-independent covert channel based on this direct proxy for power consumption on the SoC. Going further, we show that it is possible to recover the private exponent from an RSA modular exponentiation as well as an AES key across a Real-time Operating System thread boundary.", "authors": [ { "name": "Martin Thompson", "affiliations": [] }, { "name": "David Oswald", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.630-658", "url": "https://doi.org/10.46586/tches.v2026.i2.630-658", "title": "Lightening CROSS: Memory Optimized Implementations of CROSS", "abstract": "Digital signature schemes derived from non-interactive zero-knowledge (NIZK) proofs are rapidly gaining prominence within post-quantum cryptography. CROSS is a promising new code-based post-quantum digital signature scheme based on the NIZK framework. It is currently in the second round of the NIST’s additional call for standardization for post-quantum digital signatures. However, CROSS’s reference implementation has a substantially large memory footprint. This makes its deployment on resource-constrained platforms prohibitively difficult.In particular, we identified the most memory-intensive areas such as Merkle and GGM tree structures, and zero-knowledge proof commitment generation. We propose several novel algorithms and implementation strategies to reduce the memory requirement of these components. Apart from these, we also propose several memory optimization techniques, such as just-in-time hashing and execution flow analysis. As a result, our implementation reduces the memory footprint of Key Generation, Signature Generation, and Verification of the CROSS reference code by as much as 95%, 92%, and 85%, respectively. This results in a suite of implementations in which all variants are under 128kB (for all security levels of KeyGen/Sign/Verify) and six variants under 32kB. Our memory optimization techniques are not specific to CROSS, but can be applied to other NIZK-based signature schemes.Regarding efficiency, matrix multiplications are crucial to the performance of CROSS. We show how the Digital Signal Processing (DSP) instructions on ARM Cortex-M4, specifically packing and multiplying, can be utilized to efficiently implement matrix operations over finite fields. The DSP optimizations combined with the memory reductions improve the efficiency of CROSS by up to 32% and 33% in Signature Generation and Verification respectively.", "authors": [ { "name": "Harry Hart", "affiliations": [] }, { "name": "Puja Mondal", "affiliations": [] }, { "name": "Suparna Kundu", "affiliations": [] }, { "name": "Supriya Adhikary", "affiliations": [] }, { "name": "Angshuman Karmakar", "affiliations": [] }, { "name": "Chaoyun Li", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.764-807", "url": "https://doi.org/10.46586/tches.v2026.i2.764-807", "title": "Uncertainty Estimation in Neural Network-enabled Side-channel Analysis and Links to Explainability", "abstract": "Side-channel analysis (SCA) has emerged as a critical field in securing hardware implementations against potential vulnerabilities. With the advent of artificial intelligence (AI), neural network-based approaches have proven to be among the most useful techniques for profiled SCA. Despite the success of NN-assisted SCA, a critical challenge remains, namely understanding how confident NNs are in their predictions. NNs often exhibit uncertainty in their predictions, leading to incorrect key guesses with high probabilities, corresponding to a higher rank associated with the correct key. This uncertainty stems from multiple factors, including measurement errors, randomness in physical quantities, and variability in NN training. Understanding whether this uncertainty arises from inherent data characteristics or can be mitigated through better training is crucial. Additionally, if data uncertainty dominates, identifying specific trace features responsible for misclassification becomes essential.We propose a novel approach to estimating uncertainty in NN-based SCA by leveraging Rényi entropy, which offers a generalized framework for capturing various forms of uncertainty. This metric allows us to quantify uncertainty in NN predictions and explain its impact on key recovery. We decompose uncertainty into epistemic (modelrelated) and aleatoric (data-related) components. Given the challenge of estimating probability distributions in high-dimensional spaces, we use matrix-based Rényi α-entropy and α-divergence to better approximate leakage distributions, addressing the limitations of KL divergence in SCA. We also explore the sources of uncertainty, e.g., desynchronization, randomized keys, as well as hyperparameters related to NN training. To identify which time instances (features in traces) contribute most to uncertainty, we also integrate Shapley value-based explanations with our framework, overcoming the limitations of conventional sensitivity analysis. Lastly, we show that predictive uncertainty strongly correlates with standard SCA metrics like rank, offering a complementary measure for evaluating attack complexity. Our theoretical findings are backed by extensive experiments on available datasets and NN models.", "authors": [ { "name": "Seyedmohammad Nouraniboosjin", "affiliations": [] }, { "name": "Fatemeh Ganji", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.834-867", "url": "https://doi.org/10.46586/tches.v2026.i2.834-867", "title": "Compact and Low Latency First-Order AES Implementations with Low Randomness", "abstract": "Recent years have witnessed significant progress in first-order hardware masking of AES. However, most of the work focus on the optimizations over solely one of the metrics: chip area, latency or randomness. The optimizations for one metric often leads to increasing overheads of the other metrics. Consequently, few work focus on optimizations over all three metrics of first-order AES at the same time. To bridge this gap, we introduce two compact round-based first-order AES-128 encryption implementations with the latency of 31 cycles and 40 cycles, respectively. They are provably secure in the glitch-extended probing model with relatively low consumption of randomness. To achieve this, we first introduce a method to design first-order lowlatency d+1 TI (Threshold Implementations) for multi-output Boolean functions with a latency of only one clock cycle. Moreover, the random bits used in the low-latency TI cancels out in the expressions of output shares, which enables the applications of a COTG-based concept to significantly reduce the randomness consumption. Finally, we apply our method to design first-order implementations for AES-128 with two shares, which allows the designs to be compact. As a result, our implementations achieve a excellent trade-off over latency, area, and randomness. Compared to the 10-cycle and 20-cycle AES-128 implementations provided respectively in TCHES 2020 and TCHES 2025, the area and randomness demands of our implementations are significantly less. We also use formal verification tools, PROLEAD, and TLVA to validate the security of our designs for S-Box and round-based AES-128 implementations, respectively.", "authors": [ { "name": "Feng Zhou", "affiliations": [] }, { "name": "Hua Chen", "affiliations": [] }, { "name": "Limin Fan", "affiliations": [] }, { "name": "Junhuai Yang", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.893-927", "url": "https://doi.org/10.46586/tches.v2026.i2.893-927", "title": "Uniform Sharing in Multiple Stages: NullFresh for Arbitrary Functions", "abstract": "In the field of hardware masking, threshold implementations are a wellknown technique that provides glitch-resistant power analysis security. While they guarantee probing security, finding a uniform sharing without additional randomness is difficult, making it challenging to apply to certain functions and, consequently, making it impossible to develop a tool that can straightforwardly generate the masked circuit. Additionally, this approach forces designers to use at least three shares in the underlying masking, which can make the design more costly. Other schemes, like DOM, which can work with two shares, often require fresh randomness. To address these issues, Shahmirzadi and Moradi introduced the NullFresh masking technique at CHES 2021. This method allows for uniform sharing with no additional randomness, using the minimal number of shares. However, similar to original threshold implementations, it is not always straightforward to find a NullFresh masking for arbitrary functions. In this work, we introduce an automated technique to provide masking for arbitrary functions, ensuring first-order security. This technique is applicable to functions where the number of output bits does not exceed the number of input bits. While this technique introduces additional register stages (resulting in higher latency and area) compared to existing methods, it addresses the automation challenges of threshold implementations, which have remained an open problem since their inception. We present the masking technique, along with proofs of glitch-extended probing security, and demonstrate its application to several ciphers, including Prince, Midori, Skinny, Keccak, and AES. The masked designs were verified using SILVER and PROLEAD, and tested on an FPGA through TVLA.", "authors": [ { "name": "Artemii Ovchinnikov", "affiliations": [] }, { "name": "Aein Rezaei Shahmirzadi", "affiliations": [] }, { "name": "Siemen Dhooghe", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.1-27", "url": "https://doi.org/10.46586/tches.v2026.i2.1-27", "title": "t-Probing (In-)Security", "abstract": "The ongoing transition to post-quantum cryptography has led to a surge of research in side-channel countermeasures tailored to these schemes. A prominent method to prove security in the context of side-channel analysis is the utilization of the well-established t-probing model. However, recent studies by Hermelink et al. at CCS 2024 demonstrate a simple and practical attack on a provably secure implementation of the Fujisaki-Okamoto transform.In this paper, we present an unsupervised single-trace side-channel attack on a tenthorder masked implementation of fixed-weight polynomial sampling. Notably, this masking scheme has also been proven to be secure in the t-probing model. Both attacks reveal a mismatch between the correct, well-understood theory of the t-probing model and its practical application - the security proofs are valid, yet the attacks still succeed at high noise levels. Therefore, we take a closer look at the underlying causes and the assumptions made for transferring t-probing security to practice. In particular, we investigate the amount of noise required for this transfer. We find that, depending on the design decisions, the additional noise required can be substantial and difficult to achieve.Consequently, we examine the factors that impact the required amount of additional noise and which need to be considered for practically secure implementations. In particular, non-uniformly distributed shares - a setting that is increasingly encountered in post-quantum cryptographic algorithms - can lead to an increased noise requirement, and thus could reduce the security level of the masked implementation. Our analysis allows us to provide practical guidelines for masking scheme designers, thereby facilitating the development of theoretically and practically secure designs.", "authors": [ { "name": "Dina Hesse", "affiliations": [] }, { "name": "Jakob Feldtkeller", "affiliations": [] }, { "name": "Tim Güneysu", "affiliations": [] }, { "name": "Julius Hermelink", "affiliations": [] }, { "name": "Georg Land", "affiliations": [] }, { "name": "Markus Krausz", "affiliations": [] }, { "name": "Jan Richter-Brockmann", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc", "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.325-346", "url": "https://doi.org/10.46586/tches.v2026.i2.325-346", "title": "AVX2 Implementation of QR-UOV for Modern x86 Processors", "abstract": "QR-UOV is a multivariate signature scheme selected as one of the candidates in the second round of the NIST PQC Additional Digital Signatures process. This paper presents software acceleration methods for QR-UOV optimized for modern x86 architectures. QR-UOV operates over small odd prime-power extension fields such as GF(313) and GF(1273) unlike other multivariate signature candidates. This property allows direct utilization of hardware multipliers for field arithmetic, offering a distinctive advantage for high-performance implementations. Yet, how to implement QR-UOV efficiently on modern CPUs based on the property remains unclear so far. Our implementation benefits from two proposed ideas: (1) reducing the computational overhead of the QR-UOV algorithm through algorithm-level optimization, and (2) leveraging advanced SIMD instruction set extensions (e.g., AVX2, AVX-512) to accelerate main operations such as matrix multiplication. Our implementation achieves substantial speedups over the Round 2 reference: for the parameter set (q, ℓ) = (127, 3) at NIST security level I, it delivers a 5.1x improvement in key generation, 3.6x in signature generation, and 5.7x in signature verification. These results demonstrate that QR-UOV achieves performance comparable or higher than that of UOV implementations, particularly at higher security levels.", "authors": [ { "name": "Hiroshi Amagasa", "affiliations": [] }, { "name": "Rei Ueno", "affiliations": [] }, { "name": "Naofumi Homma", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.192-217", "url": "https://doi.org/10.46586/tches.v2026.i2.192-217", "title": "Correction Fault Attack on CROSS under Unknown Bit Flips", "abstract": "Recognising the need for PQC signature schemes with different sizes and performance trade-offs than the ML-DSA and SLH-DSA standards, in 2023, NIST launched a competition for additional signature algorithms. Among the current candidates in this competition is CROSS, a code-based scheme derived from the syndrome-decoding problem and suitable for memory-constrained devices. This paper presents a fault attack on CROSS that recovers the secret key by flipping one or more bits in the scheme’s public parity-check matrix. Unlike previous PQC fault attacks that typically rely on precisely controlled fault injections, which is often an unrealistic assumption, our approach exploits bit flips with unknown position and value, resembling the Rowhammer fault model. The attack builds upon the correctionbased methodology introduced for Dilithium (Euro S&P’22; CHES’24) and exploits structural properties of CROSS to substantially relax attacker requirements. We demonstrate the attack on an ARM Cortex-M4 processor using voltage fault injection. We further show that prior work on partial key exposure attacks (CRYPTO’22) can be extended to CROSS under non-trivial erasure rates, reducing the attack complexity. The attack remains effective in the presence of memory-integrity protection mechanisms such as error-correcting codes. Finally, we propose countermeasures for hardening CROSS implementations against physical attacks.", "authors": [ { "name": "Sönke Jendral", "affiliations": [] }, { "name": "Elena Dubrova", "affiliations": [] }, { "name": "Qian Guo", "affiliations": [] }, { "name": "Thomas Johansson", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.46586/tches.v2026.i2.167-191", "url": "https://doi.org/10.46586/tches.v2026.i2.167-191", "title": "High-Performance SIMD Software for Spielman Codes in Zero-Knowledge Proofs", "abstract": "We present the first high-performance SIMD software implementation of Spielman codes for their use in polynomial commitment schemes and zero-knowledge proofs. Spielman codes, as used in the Brakedown framework, are attractive alternatives to Reed-Solomon codes and benefit from linear-time complexity and field agnosticism. However, the practical deployment of Spielman codes has been hindered by a lack of research on efficient implementations. The involved costly finite-field arithmetic and random memory accesses operate on large volumes of data, typically exceeding gigabytes; these pose significant challenges for performance gains. To address these challenges, we propose several computational and memory-related optimizations that together reach an order-of-magnitude performance improvement in software. On the computation side, we propose SIMD optimizations using the AVX-512-IFMA instruction set and introduce a lazy reduction method to minimize the modular arithmetic cost. On the memory side, we implement a cache-friendly memory layout and a slicing technique, which exploit the CPU memory hierarchy. Finally, we present our multithreading approach to improve throughput without saturating memory bandwidth. Compared to prior Spielman software, our optimizations achieve speedups of up to 21.9x and 20.6x for single- and multi-threaded execution, respectively. In addition, instantiating our software with 64 threads on a high-end CPU even outperforms a recent FPGA accelerator by up to 4.3x for small and mid-sized polynomials. Our improvements make Spielman codes competitive with well-optimized Reed-Solomon codes on software platforms.", "authors": [ { "name": "Florian Krieger", "affiliations": [] }, { "name": "Christian Dobrouschek", "affiliations": [] }, { "name": "Florian Hirner", "affiliations": [] }, { "name": "Sujoy Sinha Roy", "affiliations": [] } ], "journal": { "id": "iacr-tches", "title": "IACR Transactions on Cryptographic Hardware and Embedded Systems", "issn": [ "2569-2925" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-04-23", "source": "crossref" }, { "doi": "10.1007/s10623-026-01858-2", "url": "https://doi.org/10.1007/s10623-026-01858-2", "title": "Macwilliams identities for additive codes with poset-block metric over Galois rings", "abstract": "", "authors": [ { "name": "Ying Wang", "affiliations": [] }, { "name": "Xiwang Cao", "affiliations": [] }, { "name": "Gaojun Luo", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1007/s10623-026-01856-4", "url": "https://doi.org/10.1007/s10623-026-01856-4", "title": "Demimatroids on posets and some convolution formulas", "abstract": "Abstract Demimatroids are a common generalization of matroids, simplicial complexes, and linear codes. Some aspects of linear codes, say Wei numbers, may be generalized to demimatroids. On partially ordered sets we have two demimatroid structures naturally defined, one via chains and another via antichains. In this context, we show how the upper Wei numbers can be described using the Dilworth and Mirsky dualities. Additionally, following a clever proof by Joseph P. S. Kung about the convolution formula for the characteristic polynomial of a matroid, we simplify proofs of other similar convolution formulas.", "authors": [ { "name": "J. C. Alberto", "affiliations": [] }, { "name": "J. Martínez-Bernal", "affiliations": [] }, { "name": "M. A. Valencia-Bucio", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1007/s10623-026-01806-0", "url": "https://doi.org/10.1007/s10623-026-01806-0", "title": "Non-complete set coverings for higher order threshold implementations", "abstract": "Abstract Side-channel attacks (SCAs) represent an important threat for the implementation of cryptographic algorithms. These attacks exploit the information leakage found in the physical magnitudes of hardware devices (e.g. current draw, electromagnetic emanation). Threshold Implementations (TIs) aim to mitigate SCAs by implementing a modified version of the algorithm that operates over randomized shares of its input and intermediate values. This strategy relies on the possibility of splitting the algorithm to be protected into sub-functions that satisfy certain properties about their dependence structure on the randomized shares. Non-complete set coverings (NCSCs) are combinatorial objects that can provide this dependence structure and guide the design of TIs. Given the desired order of protection d and the algebraic degree t of the functions to be implemented, for an NCSC to be useful, its cardinality r should be small and similar to the number of input shares s . This work contributes to the study of NCSCs for efficient TIs by finding smaller coverings and proving novel theoretical bounds on their cardinality. We present a new NCSC for the case $$t=3,d=2$$ t = 3 , d = 2 that is optimal and NCSCs for the cases $$t=3,d=3$$ t = 3 , d = 3 and $$t=4,d=2$$ t = 4 , d = 2 whose sizes are close to the lower bounds. We also present new combinatorial properties of these coverings and an algorithm for the search of small NCSCs.", "authors": [ { "name": "Oriol Farràs", "affiliations": [] }, { "name": "Óscar Fidalgo", "affiliations": [] }, { "name": "Carlos Andres Lara-Nino", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1007/s10623-026-01854-6", "url": "https://doi.org/10.1007/s10623-026-01854-6", "title": "Constructions of t-designs from the gold function", "abstract": "", "authors": [ { "name": "Guangkui Xu", "affiliations": [] }, { "name": "Xiwang Cao", "affiliations": [] }, { "name": "Gaojun Luo", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1007/s10623-026-01837-7", "url": "https://doi.org/10.1007/s10623-026-01837-7", "title": "Ramanujan graphs from simplicial complexes with few blockers", "abstract": "", "authors": [ { "name": "Jihye Jeong", "affiliations": [] }, { "name": "Jong Yoon Hyun", "affiliations": [] }, { "name": "Yoonjin Lee", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1007/s10623-026-01857-3", "url": "https://doi.org/10.1007/s10623-026-01857-3", "title": "The geometry of codes for random access in DNA storage", "abstract": "", "authors": [ { "name": "Anina Gruica", "affiliations": [] }, { "name": "Maria Montanucci", "affiliations": [] }, { "name": "Ferdinando Zullo", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-16", "source": "crossref" }, { "doi": "10.1007/s10623-026-01814-0", "url": "https://doi.org/10.1007/s10623-026-01814-0", "title": "Full-phase distributed quantum differential cryptanalysis and its variants on block ciphers", "abstract": "", "authors": [ { "name": "Tao Shang", "affiliations": [] }, { "name": "Kun Zhang", "affiliations": [] }, { "name": "Yuanjing Zhang", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1007/s10623-026-01838-6", "url": "https://doi.org/10.1007/s10623-026-01838-6", "title": "Constructions of quintuple constant-composition codes with weight four and distance three", "abstract": "", "authors": [ { "name": "Lijun Ji", "affiliations": [] }, { "name": "Ming Shi", "affiliations": [] }, { "name": "Zihong Tian", "affiliations": [] }, { "name": "Chaohuan Yang", "affiliations": [] }, { "name": "Jun Zhang", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1007/s10623-026-01832-y", "url": "https://doi.org/10.1007/s10623-026-01832-y", "title": "Digraph-defined external difference families and new circular external difference families", "abstract": "Abstract External difference families (EDFs) are combinatorial objects which were introduced in the early 2000s, motivated by information security applications such as the construction of AMD codes. Various generalizations have since been defined and investigated, in particular strong external difference families (SEDFs) and circular external difference families (CEDFs). In this paper, we present a framework based on graphs and digraphs which offers a new unified way to view these structures, and leads to natural new research questions. We present constructions and structural results about these digraph-defined EDFs, and we obtain new explicit constructions for infinite families of CEDFs, in particular $$(ml^2+1,m,l,1)$$ ( m l 2 + 1 , m , l , 1 ) -CEDFs. Our techniques include cyclotomy in finite fields and direct constructions in cyclic groups and direct products of cyclic groups. We construct the first infinite family of such CEDFs in non-cyclic abelian groups; these have odd values of m and l . We also present the first CEDF in a non-abelian group.", "authors": [ { "name": "Sophie Huczynska", "affiliations": [] }, { "name": "Christopher Jefferson", "affiliations": [] }, { "name": "Struan McCartney", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1007/s10623-026-01842-w", "url": "https://doi.org/10.1007/s10623-026-01842-w", "title": "The automorphism groups of the five symmetric (15, 8, 4)-designs", "abstract": "", "authors": [ { "name": "Mark Pankov", "affiliations": [] }, { "name": "Krzysztof Petelczyc", "affiliations": [] }, { "name": "Mariusz Żynel", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1007/s10623-026-01843-9", "url": "https://doi.org/10.1007/s10623-026-01843-9", "title": "New constructions of complete permutations in multiplication", "abstract": "", "authors": [ { "name": "Zhengbang Zha", "affiliations": [] }, { "name": "Jian Li", "affiliations": [] }, { "name": "Yan-Ping Wang", "affiliations": [] }, { "name": "Yanbin Zheng", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-15", "source": "crossref" }, { "doi": "10.1007/s10623-026-01827-9", "url": "https://doi.org/10.1007/s10623-026-01827-9", "title": "Improved differential and linear cryptanalysis on round-reduced SIMON", "abstract": "", "authors": [ { "name": "Chao Niu", "affiliations": [] }, { "name": "Muzhou Li", "affiliations": [] }, { "name": "Jifu Zhang", "affiliations": [] }, { "name": "Meiqin Wang", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-13", "source": "crossref" }, { "doi": "10.1007/s10623-026-01825-x", "url": "https://doi.org/10.1007/s10623-026-01825-x", "title": "$$\\lambda $$-fold near-factorizations of groups", "abstract": "", "authors": [ { "name": "Donald L. Kreher", "affiliations": [] }, { "name": "Shuxing Li", "affiliations": [] }, { "name": "Douglas R. Stinson", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1007/s10623-026-01860-8", "url": "https://doi.org/10.1007/s10623-026-01860-8", "title": "Cyclic completely regular codes $$C_{1,5}$$", "abstract": "Abstract We construct a family of cyclic completely regular codes (CRCs) of length $$n=2^m-1$$ n = 2 m - 1 and compute their intersection arrays. These codes, denoted $$C_{1,5}$$ C 1 , 5 , are generated by the product $$m_1(x)m_5(x)$$ m 1 ( x ) m 5 ( x ) , where $$m_i(x)$$ m i ( x ) is the minimal polynomial of $$\\alpha ^i$$ α i , and $$\\alpha $$ α is a primitive element of the finite field $$\\mathbb {F}_{2^m}$$ F 2 m . We consider two main cases: odd m and $$m \\equiv 2 \\pmod {4}$$ m ≡ 2 ( mod 4 ) . For odd m , these codes are known to be completely regular with covering radius $$\\rho =3$$ ρ = 3 and minimum distance $$d=5$$ d = 5 . We prove that, for any m , the codes $$C_{1,3}$$ C 1 , 3 and $$C_{1,5}$$ C 1 , 5 are non-equivalent despite sharing the same parameters and intersection array. For $$m \\equiv 2 \\pmod {4}$$ m ≡ 2 ( mod 4 ) , we demonstrate that $$C_{1,5}$$ C 1 , 5 forms a new family of completely regular codes with covering radius $$\\rho =3$$ ρ = 3 , minimum distance $$d=3$$ d = 3 , and intersection array $$\\operatorname {IA}=[n, n-3, \\frac{3n+7}{4}; 1, 4, \\frac{n-3}{4}]$$ IA = [ n , n - 3 , 3 n + 7 4 ; 1 , 4 , n - 3 4 ] . Moreover, the corresponding extended cyclic codes $$C_{1,5}^*$$ C 1 , 5 ∗ are completely regular $$[n+1, n-2m, 4; 4]$$ [ n + 1 , n - 2 m , 4 ; 4 ] -codes with intersection array $$\\operatorname {IA}=[n+1, n, n-3, \\frac{3n+7}{4}; 1, 4, \\frac{n-3}{4}, n+1]$$ IA = [ n + 1 , n , n - 3 , 3 n + 7 4 ; 1 , 4 , n - 3 4 , n + 1 ] . We also describe the parameters and some properties of the coset graphs associated to these completely regular codes which form distance-regular graphs.", "authors": [ { "name": "Josep Rifà", "affiliations": [] }, { "name": "Victor Zinoviev", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-09", "source": "crossref" }, { "doi": "10.1007/s10623-026-01861-7", "url": "https://doi.org/10.1007/s10623-026-01861-7", "title": "Multipath PA-PUFs generate all Boolean functions", "abstract": "", "authors": [ { "name": "R. Radheshwar", "affiliations": [] }, { "name": "Dibyendu Roy", "affiliations": [] }, { "name": "Pantelimon Stănică", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-08", "source": "crossref" }, { "doi": "10.1007/s10623-026-01844-8", "url": "https://doi.org/10.1007/s10623-026-01844-8", "title": "On binary codes that are maximal totally isotropic subspaces with respect to an alternating form", "abstract": "", "authors": [ { "name": "Patrick King", "affiliations": [] }, { "name": "Mikhail Kochetov", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-07", "source": "crossref" }, { "doi": "10.1007/s10623-026-01847-5", "url": "https://doi.org/10.1007/s10623-026-01847-5", "title": "On block-transitive 3-designs with a chain of imprimitive partitions", "abstract": "", "authors": [ { "name": "Yihui Li", "affiliations": [] }, { "name": "Shenglin Zhou", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-05-03", "source": "crossref" }, { "doi": "10.1007/s10623-026-01850-w", "url": "https://doi.org/10.1007/s10623-026-01850-w", "title": "Cliques in Paley graphs of square order and in Peisert graphs", "abstract": "", "authors": [ { "name": "Andries E. Brouwer", "affiliations": [] }, { "name": "Sergey Goryainov", "affiliations": [] }, { "name": "Leonid Shalaginov", "affiliations": [] }, { "name": "Chi Hoi Yip", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-26", "source": "crossref" }, { "doi": "10.1007/s10623-026-01828-8", "url": "https://doi.org/10.1007/s10623-026-01828-8", "title": "On anti-collusion codes for averaging attack in multimedia fingerprinting", "abstract": "", "authors": [ { "name": "Jing Jiang", "affiliations": [] }, { "name": "Cailin Wen", "affiliations": [] }, { "name": "Minquan Cheng", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-25", "source": "crossref" }, { "doi": "10.1007/s10623-026-01829-7", "url": "https://doi.org/10.1007/s10623-026-01829-7", "title": "LRCS: Duality, LP bounds, and field size", "abstract": "Abstract We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code’s locality. Using a duality result analogous to a MacWilliams identity, we then derive an LP-type bound that improves on the best known bounds in several instances. Using a dual distance bound and the theory of generalized weights, we obtain non-existence results for optimal LRCs over small fields. In particular, we show that an optimal LRC must have both minimum distance and block length relatively small compared to the field size.", "authors": [ { "name": "Anina Gruica", "affiliations": [] }, { "name": "Benjamin Jany", "affiliations": [] }, { "name": "Alberto Ravagnani", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-25", "source": "crossref" }, { "doi": "10.1007/s10623-026-01805-1", "url": "https://doi.org/10.1007/s10623-026-01805-1", "title": "New constructions of optimal symbol-pair constacyclic codes of length $$4p^s$$", "abstract": "", "authors": [ { "name": "Amal H. Alofi", "affiliations": [] }, { "name": "Hai Q. Dinh", "affiliations": [] }, { "name": "Bac T. Nguyen", "affiliations": [] }, { "name": "Nghia T. H. Tran", "affiliations": [] }, { "name": "Hieu V. Ha", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1007/s10623-026-01839-5", "url": "https://doi.org/10.1007/s10623-026-01839-5", "title": "Codes with symmetric distances", "abstract": "", "authors": [ { "name": "Gábor Hegedüs", "affiliations": [] }, { "name": "Sho Suda", "affiliations": [] }, { "name": "Ziqing Xiang", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1007/s10623-026-01840-y", "url": "https://doi.org/10.1007/s10623-026-01840-y", "title": "Self-dual matrix codes over Galois rings", "abstract": "", "authors": [ { "name": "Hijiri Kawazoe", "affiliations": [] }, { "name": "Makoto Tagami", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1007/s10623-026-01834-w", "url": "https://doi.org/10.1007/s10623-026-01834-w", "title": "Codes over an infinite family of local rings of order $$2^{5^k}$$ with two Gray maps", "abstract": "", "authors": [ { "name": "Steven T. Dougherty", "affiliations": [] }, { "name": "Joe Gildea", "affiliations": [] }, { "name": "Adrian Korban", "affiliations": [] }, { "name": "Adam M. Roberts", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1007/s10623-026-01802-4", "url": "https://doi.org/10.1007/s10623-026-01802-4", "title": "Weights of a class of projective geometry codes", "abstract": "", "authors": [ { "name": "Meng Sun", "affiliations": [] }, { "name": "Liwei Zeng", "affiliations": [] }, { "name": "Changli Ma", "affiliations": [] } ], "journal": { "id": "designs-codes", "title": "Designs, Codes and Cryptography", "issn": [ "0925-1022", "1573-7586" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc", "algorithms" ], "india_hint": false, "published": "2026-04-20", "source": "crossref" }, { "doi": "10.1007/s00145-026-09580-x", "url": "https://doi.org/10.1007/s00145-026-09580-x", "title": "Fast Homomorphic Linear Algebra with BLAS", "abstract": "", "authors": [ { "name": "Youngjin Bae", "affiliations": [] }, { "name": "Jung Hee Cheon", "affiliations": [] }, { "name": "Guillaume Hanrot", "affiliations": [] }, { "name": "Jai Hyun Park", "affiliations": [] }, { "name": "Damien Stehlé", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-05-12", "source": "crossref" }, { "doi": "10.1007/s00145-026-09573-w", "url": "https://doi.org/10.1007/s00145-026-09573-w", "title": "Instance-Hiding Interactive Proofs", "abstract": "Abstract In an Instance-Hiding Interactive Proof (IHIP) (Beaver et al., in: Menezes and Vanstone (eds) Advances in cryptology - CRYPTO 1990, proceedings, lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), Springer, pp 326-338, 1990), an efficient verifier with a private input x interacts with an unbounded prover to determine whether x is contained in a language $$\\mathcal {L}$$ L . In addition to completeness and soundness, the instance-hiding property requires that the prover should not learn anything about x in the course of the interaction. Such proof systems capture natural privacy properties and may be seen as a generalization of the influential concept of randomized encodings (Ishai and Kushilevitz, in: Proceedings 41st annual symposium on foundations of computer science, pp 294-304, 2000; Applebaum et al., in: 45th annual IEEE symposium on foundations of computer science, pp 166-175, 2004; Agrawal et al., in: Halldórsson, Iwama, Kobayashi, Speckmann (eds) Automata, languages, and programming, Springer, Berlin, Heidelberg, pp 1-13, 2015) and as a counterpart to zero-knowledge proofs (Goldwasser et al., in: Symposium on the theory of computing, 1985). We investigate the properties and power of such instance-hiding proofs and show the following: Any language with an IHIP is contained in $${\\mathsf {NP/poly}}\\cap {\\mathsf {coNP/poly}}$$ NP / poly ∩ coNP / poly . If an average-case hard language has a constant-round IHIP, then infinitely often non-uniform one-way functions exist. There is an oracle with respect to which there is a language that has an IHIP but not an SZK proof. IHIP’s are closed under composition with any efficiently computable function. We further study a stronger version of IHIP (that we call Simulatable IHIP) where the view of the honest prover can be efficiently simulated. For these, we obtain stronger versions of some of the above: Any language with a Simulatable IHIP is contained in $${\\textsf{AM}}\\cap {\\textsf{coAM}}$$ AM ∩ coAM . If a worst-case hard language has a Simulatable IHIP, then explicit uniform one-way functions exist.", "authors": [ { "name": "Changrui Mu", "affiliations": [] }, { "name": "Prashant Nalini Vasudevan", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-26", "source": "crossref" }, { "doi": "10.1007/s00145-026-09579-4", "url": "https://doi.org/10.1007/s00145-026-09579-4", "title": "Generic Constructions of Compact and Tightly Selective-Opening Secure Public-Key Encryption Schemes", "abstract": "", "authors": [ { "name": "Jiaxin Pan", "affiliations": [] }, { "name": "Benedikt Wagner", "affiliations": [] }, { "name": "Runzhi Zeng", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-25", "source": "crossref" }, { "doi": "10.1007/s00145-026-09578-5", "url": "https://doi.org/10.1007/s00145-026-09578-5", "title": "The Combinatorial Structure and Value Distributions of Plateaued Functions", "abstract": "Abstract We study combinatorial properties of plateaued functions $$F :\\mathbb {F}_p^n \\rightarrow \\mathbb {F}_p^m$$ F : F p n F p m . All quadratic functions, bent functions and most known APN functions are plateaued, so many cryptographic primitives rely on plateaued functions as building blocks. The main focus of our study is the interplay of the Walsh transform and linearity of a plateaued function, its differential properties, and their value distributions, i.e., the sizes of image and preimage sets. In particular, we study the special case of “almost balanced” plateaued functions, which only have two nonzero preimage set sizes, generalising, for instance, all monomial functions. We achieve several direct connections and (non)existence conditions for these functions, showing in particular that plateaued d -to-1 functions (and thus plateaued monomials) only exist for a very select choice of d , and we derive for all these functions their linearity as well as bounds on their differential uniformity. We also specifically study the Walsh transform of plateaued APN functions and their relation to their value distribution.", "authors": [ { "name": "Lukas Kölsch", "affiliations": [] }, { "name": "Alexandr Polujan", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-18", "source": "crossref" }, { "doi": "10.1007/s00145-026-09574-9", "url": "https://doi.org/10.1007/s00145-026-09574-9", "title": "Correction to: Actively Secure Setup for SPDZ", "abstract": "", "authors": [ { "name": "Dragos Rotaru", "affiliations": [] }, { "name": "Nigel P. Smart", "affiliations": [] }, { "name": "Titouan Tanguy", "affiliations": [] }, { "name": "Frederik Vercauteren", "affiliations": [] }, { "name": "Tim Wood", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-18", "source": "crossref" }, { "doi": "10.1007/s00145-025-09569-y", "url": "https://doi.org/10.1007/s00145-025-09569-y", "title": "The Fiat - Shamir Transformation of $$(\\varGamma _1,\\dots ,\\varGamma _\\mu )$$-Special-Sound Interactive Proofs", "abstract": "Abstract The Fiat - Shamir transformation is a general principle to turn any public-coin interactive proof into non-interactive one (with security then typically analyzed in the random oracle model). While initially used for 3-round protocols, many recent constructions use it for multi-round protocols. However, in general the soundness error of the Fiat - Shamir transformed protocol degrades exponentially in the number of rounds. On the positive side, it was shown that for the special class of $$(k_1,\\dots ,k_\\mu )$$ ( k 1 , ⋯ , k μ ) -special-sound $$\\varSigma $$ Σ -protocols, which is a natural multi-round generalization of the well-known class of special-sound protocols, the loss is actually only linear in the number of random oracle queries, and independent of the number of rounds, which is optimal. A natural next question is whether this positive result extends to the Fiat - Shamir transformation of so-called $$(\\varGamma _1,\\dots ,\\varGamma _\\mu )$$ ( Γ 1 , ⋯ , Γ μ ) -special-sound protocols. This notion was recently defined and analyzed in the interactive case; it captures a larger class of protocols, namely where the special-soundness property is characterized by a general access structure, rather than a threshold. We show in this work that this is indeed the case. Concretely, we show that the Fiat - Shamir transformation of any $$(\\varGamma _1, \\ldots , \\varGamma _\\mu )$$ ( Γ 1 , … , Γ μ ) -special-sound interactive proof is knowledge sound under the same condition on $$\\varGamma _1,\\dots ,\\varGamma _\\mu $$ Γ 1 , ⋯ , Γ μ for which the original interactive proof is knowledge sound. Furthermore, also here the loss is linear in the number of random oracle queries and independent of the number of rounds. In light of the above, one might suspect that our argument follows as a straightforward combination of the above mentioned prior works. However, this is not the case. The approach used for $$(k_1,\\dots ,k_\\mu )$$ ( k 1 , ⋯ , k μ ) -special-sound protocols, which is based on an extractor that samples without replacement, does not (seem to) generalize; on the other hand, the other approach, which uses an extractor based on sampling with replacement, comes with an additional loss that would blow up in the recursive multi-round analysis. Thus, new techniques are necessary to handle the above complications.", "authors": [ { "name": "Thomas Attema", "affiliations": [] }, { "name": "Serge Fehr", "affiliations": [] }, { "name": "Michael Klooß", "affiliations": [] }, { "name": "Nicolas Resch", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-06", "source": "crossref" }, { "doi": "10.1007/s00145-026-09577-6", "url": "https://doi.org/10.1007/s00145-026-09577-6", "title": "New Results on Elliptic Curve Hidden Number Problem for ECDH Key Exchange", "abstract": "", "authors": [ { "name": "Jun Xu", "affiliations": [] }, { "name": "Santanu Sarkar", "affiliations": [] }, { "name": "Huaxiong Wang", "affiliations": [] }, { "name": "Lei Hu", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-06", "source": "crossref" }, { "doi": "10.1007/s00145-026-09571-y", "url": "https://doi.org/10.1007/s00145-026-09571-y", "title": "New Attacks on Feistel Structures with Improved Memory Complexities", "abstract": "Abstract Feistel structures are an extensively researched type of cryptographic schemes. In this paper, we describe improved attacks on Feistel structures with more than 4 rounds. We achieve this by a new attack that combines the main benefits of meet-in-the-middle attacks (which can reduce the time complexity by comparing only half blocks in the middle) and dissection attacks (which can reduce the memory complexity but have to guess full blocks in the middle in order to perform independent attacks above and below it). For example, for a 7-round Feistel structure on n -bit inputs with seven independent round keys of n /2 bits each, a MITM attack can use ( $$2^{1.5n}$$ 2 1.5 n , $$2^{1.5n}$$ 2 1.5 n ) time and memory, while dissection requires ( $$2^{2n}$$ 2 2 n , $$2^{n}$$ 2 n ) time and memory. Our new attack requires only ( $$2^{1.5n}$$ 2 1.5 n , $$2^{n}$$ 2 n ) time and memory, using a few known plaintext/ciphertext pairs. When we are allowed to use more known plaintexts, we develop new techniques which rely on the existence of multi-collisions and differential properties deep in the structure in order to further reduce the memory complexity. Our new attacks are not just theoretical generic constructions - in fact, we can use them to reduce the memory complexity of the best known attacks on several concrete cryptosystems such as round-reduced CAST-128 (where we reduce the complexity from $$2^{111} $$ 2 111 to $$2^{64}$$ 2 64 ) and full DEAL-256 (where we reduce the complexity from $$2^{200}$$ 2 200 to $$2^{144}$$ 2 144 ), without affecting their time and data complexities. An extension of our techniques applies even to some non-Feistel structures - for example, in the case of FOX, we reduce the memory complexity of all the best known attacks by a factor of $$2^{16}$$ 2 16 .", "authors": [ { "name": "Itai Dinur", "affiliations": [] }, { "name": "Orr Dunkelman", "affiliations": [] }, { "name": "Nathan Keller", "affiliations": [] }, { "name": "David Ross", "affiliations": [] }, { "name": "Adi Shamir", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-03-03", "source": "crossref" }, { "doi": "10.1007/s00145-026-09576-7", "url": "https://doi.org/10.1007/s00145-026-09576-7", "title": "Your Reputation’s Safe with Me: Framing-Free Distributed Zero-Knowledge Proofs", "abstract": "Abstract Distributed zero-knowledge (dZK) proofs, recently introduced by Boneh et al. (CRYPTO‘19), allow a prover $$\\mathcal{P}$$ P to prove NP statements on an input x , which is distributed between k verifiers $$\\mathcal{V}_1,\\ldots ,\\mathcal{V}_k$$ V 1 , … , V k , where each $$\\mathcal{V}_i$$ V i holds only a piece of x . As in standard ZK proofs, dZK proofs guarantee Completeness when all parties are honest; Soundness against a malicious prover colluding with t verifiers; and Zero Knowledge against a subset of t malicious verifiers, in the sense that they learn nothing about the NP witness and the input pieces of the honest verifiers. Unfortunately, dZK proofs provide no correctness guarantee for an honest prover against a subset of maliciously corrupted verifiers. In particular, such verifiers might be able to “frame” the prover, causing honest verifiers to reject a true claim. This is a significant limitation, since such scenarios arise naturally in dZK applications, e.g., for proving honest behavior, and such attacks are indeed possible in existing dZKs (Boneh et al., CRYPTO‘19). We put forth and study the notion of strong completeness for dZKs, guaranteeing that true claims are accepted even when t verifiers are maliciously corrupted. We then design strongly-complete dZK proofs in the honest-majority setting using the “MPC-in-the-head” paradigm of Ishai et al. (STOC‘07), providing a novel analysis that exploits the unique properties of the distributed setting. To demonstrate the usefulness of strong completeness, we present several applications in which it is instrumental in obtaining security. First, we construct a certifiable version of Verifiable Secret Sharing (VSS), which is a VSS in which the dealer additionally proves that the shared secret satisfies a given NP relation. Our construction withstands a constant fraction of corruptions, whereas a previous construction of Ishai et al. (TCC‘14) required $$k={\\textsf{poly}}\\left( t\\right) $$ k = poly t . We also design a reusable version of certifiable VSS that we introduce, in which the dealer can prove an unlimited number of predicates on the same shared secret. Finally, we extend a compiler of Boneh et al. (CRYPTO‘19), who used dZKs to transform a class of “natural” semi-honest protocols in the honest-majority setting into maliciously secure ones with abort. Our compiler uses strongly-complete dZKs to obtain identifiable abort.", "authors": [ { "name": "Carmit Hazay", "affiliations": [] }, { "name": "Muthuramakrishnan Venkitasubramaniam", "affiliations": [] }, { "name": "Mor Weiss", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-02-28", "source": "crossref" }, { "doi": "10.1007/s00145-026-09575-8", "url": "https://doi.org/10.1007/s00145-026-09575-8", "title": "Exponential Sums in Linear Cryptanalysis", "abstract": "", "authors": [ { "name": "Tim Beyne", "affiliations": [] }, { "name": "Clémence Bouvier", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-02-20", "source": "crossref" }, { "doi": "10.1007/s00145-025-09567-0", "url": "https://doi.org/10.1007/s00145-025-09567-0", "title": "Study of Arithmetization Methods for STARKs", "abstract": "Abstract This technical paper explores two solutions for arithmetization of computational integrity statements in STARKs, namely the algebraic intermediate representation, AIR, and its preprocessed variant, PAIR. The work then focuses on their soundness implications for Reed - Solomon proximity testing. It proceeds by presenting a comparative study of these methods, providing their theoretical foundations and deriving the degree bounds for low-degree proximity testing. The study shows that using PAIR increases the degree bound for Reed - Solomon proximity testing, which affects its soundness and complexity. However, the possibility of reducing the degree bound with multiple selector columns is also explored, namely by following an approach based on the decomposition of the selector values. Focusing on performance optimization, the work proceeds by qualitatively comparing computational demands of the components of both arithmetization methods, particularly their impact on the low-degree extensions. The paper concludes that, while PAIR might simplify constraint enforcement, it can be easily translated to AIR, and system testing with benchmarks is necessary to determine the application-specific superiority of either method. This work should provide insight into the strengths and limitations of each method, helping researchers and practitioners in the field of STARKs make informed design choices.", "authors": [ { "name": "Tiago Martins", "affiliations": [] }, { "name": "João Farinha", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-02-10", "source": "crossref" }, { "doi": "10.1007/s00145-026-09572-x", "url": "https://doi.org/10.1007/s00145-026-09572-x", "title": "Space-Efficient and Noise-Robust Quantum Factoring", "abstract": "", "authors": [ { "name": "Seyoon Ragavan", "affiliations": [] }, { "name": "Vinod Vaikuntanathan", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": "general", "categories": [ "general" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-02-04", "source": "crossref" }, { "doi": "10.1007/s00145-026-09570-z", "url": "https://doi.org/10.1007/s00145-026-09570-z", "title": "Link Between the Differential Cryptanalysis and Linear Approximations over Finite Abelian Groups And Its Applications", "abstract": "Abstract In recent years, progress in practical applications of multi-party computation (MPC), fully homomorphic encryption (FHE), and zero-knowledge proofs (ZKP) motivates people to explore symmetric-key cryptographic algorithms, as well as corresponding cryptanalysis techniques (such as differential cryptanalysis, linear cryptanalysis), over finite Abelian groups or prime fields $${\\mathbb {F}}_p$$ F p for large p . In this paper, we establish the links between linear cryptanalysis and differential cryptanalysis over general finite Abelian groups. As the first application, we revisit linear cryptanalysis and give general results of linear approximations over arbitrary finite Abelian groups. More precisely, we consider the linearity , which is the maximal non-trivial linear approximation, to characterize the resistance of a function against linear cryptanalysis. This thereby generalizes the work of Pott in 2004 and completes the generalization of Sidelnikov - Chabaud - Vaudenay’s bound from $${\\mathbb {F}}_2^n$$ F 2 n to finite Abelian groups. As the second application, we give an exact expression for the correlation of differential-linear approximations over arbitrary finite Abelian groups ( $${\\mathbb {F}}_p^n$$ F p n ) under the sole assumption that the two parts of the cipher are independent of each other. In particular, we completely generalize the differential-linear cryptanalysis from $${\\mathbb {F}}_2^n$$ F 2 n to arbitrary finite Abelian groups ( $${\\mathbb {F}}_p^n$$ F p n ).", "authors": [ { "name": "Zhongfeng Niu", "affiliations": [] }, { "name": "Siwei Sun", "affiliations": [] }, { "name": "Hailun Yan", "affiliations": [] }, { "name": "Qi Wang", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-01-29", "source": "crossref" }, { "doi": "10.1007/s00145-025-09565-2", "url": "https://doi.org/10.1007/s00145-025-09565-2", "title": "Universally Composable Almost-Everywhere Secure Computation", "abstract": "", "authors": [ { "name": "Nishanth Chandran", "affiliations": [] }, { "name": "Pouyan Forghani", "affiliations": [] }, { "name": "Juan Garay", "affiliations": [] }, { "name": "Rafail Ostrovsky", "affiliations": [] }, { "name": "Rutvik Patel", "affiliations": [] }, { "name": "Vassilis Zikas", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-01-15", "source": "crossref" }, { "doi": "10.1007/s00145-025-09568-z", "url": "https://doi.org/10.1007/s00145-025-09568-z", "title": "Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy", "abstract": "", "authors": [ { "name": "Hanwen Feng", "affiliations": [] }, { "name": "Qiang Tang", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2026-01-08", "source": "crossref" }, { "doi": "10.1007/s00145-025-09566-1", "url": "https://doi.org/10.1007/s00145-025-09566-1", "title": "Four Attacks and a Proof for Telegram", "abstract": "Abstract We study the use of symmetric cryptography in the MTProto 2.0 protocol, Telegram’s equivalent of the TLS protocol. We give positive and negative results. On the one hand, we formally and in detail specify a slight variant of Telegram’s “record protocol” and prove that it achieves security in a suitable bidirectional secure channel model, albeit under unstudied assumptions; this model itself advances the state of the art for secure channels. On the other hand, we first motivate our slight deviation from MTProto as deployed by giving two attacks on the original protocol specification: one of practical, one of theoretical interest. Then, we give two attacks on the implementation, which are outside of our formal model: one targeting the client, one targeting the server. The client-side attack enables plaintext recovery by exploiting timing side channels, of varying strength, in three official Telegram clients. On its own this attack is thwarted by the secrecy of header fields that are established by Telegram’s key exchange protocol. We thus chain this attack with an attack against the implementation of the key exchange protocol on Telegram’s servers. This final attack breaks the authentication properties of Telegram’s key exchange, allowing a MitM attack. More mundanely, it also reduces the cost of the client-side plaintext-recovery attack. In totality, our results provide the first comprehensive study of MTProto’s use of symmetric cryptography, as well as highlight weaknesses in its key exchange.", "authors": [ { "name": "Martin R. Albrecht", "affiliations": [] }, { "name": "Lenka Mareková", "affiliations": [] }, { "name": "Kenneth G. Paterson", "affiliations": [] }, { "name": "Igors Stepanovs", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-12-17", "source": "crossref" }, { "doi": "10.1007/s00145-025-09558-1", "url": "https://doi.org/10.1007/s00145-025-09558-1", "title": "Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions", "abstract": "Abstract Sponge hashing is a novel alternative to the popular Merkle-Damgård hashing design. The sponge construction has become increasingly popular in various applications, perhaps most notably, it underlies the SHA-3 hashing standard. Sponge hashing is parametrized by two numbers, r and c (bitrate and capacity, respectively), and by a fixed-size permutation on $$r+c$$ r + c bits. In this work, we study the collision resistance of sponge hashing instantiated with a random permutation by adversaries with arbitrary S -bit auxiliary advice input about the random permutation that make T online queries. Recent work by Coretti et al. (CRYPTO ’18) showed that such adversaries can find collisions (with respect to a random c -bit initialization vector) with advantage $$\\Theta (ST^2/2^c + T^2/ 2^{r})$$ Θ ( S T 2 / 2 c + T 2 / 2 r ) . Although the above attack formally breaks collision resistance in some range of parameters, its practical relevance is limited since the resulting collision is very long (on the order of T blocks). Focusing on the task of finding short collisions, we study the complexity of finding a B -block collision for a given parameter $$B\\ge 1$$ B ≥ 1 . We give several new attacks and limitations. Most notably, we give a new attack that results in a single-block collision and has advantage $$\\begin{aligned} \\Omega \\left( \\left( \\frac{S^{2}T}{2^{2c}}\\right) ^{2/3} + \\frac{T^2}{2^r}\\right) . \\end{aligned}$$ Ω S 2 T 2 2 c 2 / 3 + T 2 2 r . In certain range of parameters (e.g., $$ST^2>2^c$$ S T 2 > 2 c ), our attack outperforms the previously-known best attack. To the best of our knowledge, this is the first natural application for which sponge hashing is provably less secure than the corresponding instance of Merkle-Damgård hashing. Our attack relies on a novel connection between single-block collision finding in sponge hashing and the well-studied function inversion problem. We also give a general attack that works for any $$B\\ge 2$$ B ≥ 2 and has advantage $$\\Omega ({STB}/{2^{c}} + {T^2}/{2^{\\min \\{r,c\\}}})$$ Ω ( STB / 2 c + T 2 / 2 min { r , c } ) , adapting an idea of Akshima et al. (CRYPTO ’20). We complement the above attacks with bounds on the best possible attacks. Specifically, we prove that there is a qualitative jump in the advantage of best possible attacks for finding unbounded-length collisions and those for finding very short collisions. Most notably, we prove (via a highly non-trivial compression argument) that the above attack is optimal for $$B=2$$ B = 2 in some range of parameters.", "authors": [ { "name": "Cody Freitag", "affiliations": [] }, { "name": "Ashrujit Ghoshal", "affiliations": [] }, { "name": "Ilan Komargodski", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-12-05", "source": "crossref" }, { "doi": "10.1007/s00145-025-09560-7", "url": "https://doi.org/10.1007/s00145-025-09560-7", "title": "Accurate Score Prediction for Dual-Sieve Attacks", "abstract": "Abstract Guo and Johansson (ASIACRYPT 2021), and MATZOV (tech. report 2022) have independently claimed improved attacks against various NIST lattice candidates by using a Fast Fourier Transform (FFT) on top of the so-called Dual-Sieve attack. However, we will show that a heuristic used in above works not only theoretically contradicts with both formal theorems and well-tested heuristics in certain regimes, but also provides incorrect predictions experimentally. We conclude that this heuristic significantly overestimates the success probability of the Dual-Sieve attack. Alternatively, we propose a seemingly weaker heuristic for the output of a lattice sieve. When determining part of the secret in the Dual-Sieve attack, we derive predictions for the score distribution associated to candidates using this heuristic: for correct candidates with noise drawn from any radial distribution, we derive score predictions using a central limit heuristic; for incorrect candidates, we derive score predictions by approximating the Voronoi cell by a ball. In the process, we show that the use of the FFT is not specific to Learning with Errors (LWE) but is more generally useful against the Bounded Distance Decoding problem (BDD). Ultimately, we compare the predicted score distributions with extensive experiments, and observe these predictions to be qualitatively and quantitatively quite accurate. This makes it possible to accurately estimate the number of false positives and false negatives, opening the door for a sound analysis of the Dual-Sieve attack. In particular, one may consider exploring the opportunities to mitigate a large number of false positives. 1", "authors": [ { "name": "Léo Ducas", "affiliations": [] }, { "name": "Ludo N. Pulles", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-20", "source": "crossref" }, { "doi": "10.1007/s00145-025-09564-3", "url": "https://doi.org/10.1007/s00145-025-09564-3", "title": "Differential-Linear Cryptanalysis from an Algebraic Perspective", "abstract": "", "authors": [ { "name": "Meicheng Liu", "affiliations": [] }, { "name": "Chengan Hou", "affiliations": [] }, { "name": "Xiaojuan Lu", "affiliations": [] }, { "name": "Shichang Wang", "affiliations": [] }, { "name": "Dongdai Lin", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-18", "source": "crossref" }, { "doi": "10.1007/s00145-025-09563-4", "url": "https://doi.org/10.1007/s00145-025-09563-4", "title": "Faster Homomorphic Operations and Beyond: Expediting Homomorphic Computation via Boolean Circuit Optimization", "abstract": "Abstract Fully homomorphic encryption (FHE) enables secure data processing without compromising data access. However, its computational cost and slower execution compared to plaintext operations present significant challenges. The increasing interest in FHE-based secure computation underscores the need to accelerate homomorphic computations. Existing research predominantly focuses on reducing the multiplicative depth (MD) of FHE circuits, as a lower MD enhances the execution efficiency of each homomorphic operation. However, this often comes at the expense of increased multiplicative complexity (MC), leading to more homomorphic multiplications - a computationally intensive task. Currently, there is a lack of approaches that effectively balance the trade-off between MD reduction and MC increase, potentially resulting in sub-optimal outcomes. This paper addresses this critical gap with three main contributions: (a) an exact synthesis paradigm for generating optimal FHE circuit implementations, (b) a heuristic circuit optimization algorithm, named MC-aware MD minimization, that leverages the exact synthesis paradigm to optimize FHE circuits efficiently, and (c) an FHE circuit optimization flow that integrates MC-aware MD minimization with existing MD reduction techniques. Experimental results demonstrate a 21.32% average reduction in homomorphic computation time and highlight significantly improved efficiency in circuit optimization.", "authors": [ { "name": "Mingfei Yu", "affiliations": [] }, { "name": "Giovanni De Micheli", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-12", "source": "crossref" }, { "doi": "10.1007/s00145-025-09562-5", "url": "https://doi.org/10.1007/s00145-025-09562-5", "title": "Permutations Satisfying $$(P_1)$$ and $$(P_2)$$ Properties and $$\\ell $$-Optimal Bent Functions", "abstract": "", "authors": [ { "name": "Sadmir Kudin", "affiliations": [] }, { "name": "Enes Pasalic", "affiliations": [] }, { "name": "Alexandr Polujan", "affiliations": [] }, { "name": "Fengrong Zhang", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-11", "source": "crossref" }, { "doi": "10.1007/s00145-025-09561-6", "url": "https://doi.org/10.1007/s00145-025-09561-6", "title": "Fair Coin Flipping: Tighter Analysis and the Many-Party Case", "abstract": "Abstract In a multi-party fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some adversarial parties try to bias the output. In this work, we focus on the case of an arbitrary number of corrupted parties. Cleve [20] [STOC 1986] has shown that in any such m -round coin-flipping protocol, the corrupted parties can bias the honest parties’ common output bit by $$\\Theta (1/m)$$ Θ ( 1 / m ) . For more than two decades, however, the best-known coin-flipping protocol was the one of Awerbuch, Blum, Chor, Goldwasser, and Micali [10] [Manuscript 1985], who presented a t -party, m -round protocol with bias $$\\Theta (t/\\sqrt{m})$$ Θ ( t / m ) . This was changed by the breakthrough result of Moran, Naor, and Segev [51] [Journal of Cryptology 2016], who constructed an m -round, two -party coin-flipping protocol with optimal bias $$\\Theta (1/m)$$ Θ ( 1 / m ) . More recently, Haitner and Tsfadia [37] [SIAM Journal on Computing 2017] constructed an m -round, three -party coin-flipping protocol with bias $$O(\\log ^3m / m)$$ O ( log 3 m / m ) . Still for the case of more than three parties, the best-known protocol remained the $$\\Theta (t/\\sqrt{m})$$ Θ ( t / m ) -bias protocol of [10]. We make a step toward eliminating the above gap, presenting a t -party, m -round coin-flipping protocol, with bias $$O\\left( \\frac{t^4 \\cdot 2^t \\cdot \\sqrt{\\log m}}{m^{1/2+1/(2^{t-1}-2)}}\\right) $$ O t 4 · 2 t · log m m 1 / 2 + 1 / ( 2 t - 1 - 2 ) for any $$t\\le \\tfrac{1}{2} \\cdot \\operatorname {loglog}m$$ t ≤ 1 2 · loglog m . This improves upon the $$\\Theta (t/\\sqrt{m})$$ Θ ( t / m ) -bias protocol of [10], and in particular, for $$t\\in O(1)$$ t ∈ O ( 1 ) it is an $$1/m^{\\frac{1}{2} + \\Theta (1)}$$ 1 / m 1 2 + Θ ( 1 ) -bias protocol. For the three-party case, it is an $$O(\\sqrt{\\log m}/m)$$ O ( log m / m ) -bias protocol, improving over the $$O(\\log ^3m / m)$$ O ( log 3 m / m ) -bias protocol of [37]. Our protocol generalizes that of [37], by presenting an appropriate “recovery protocol” for the remaining parties to interact in, in the case that some parties abort or are caught cheating ([37] only presented a two-party recovery protocol, which limits their final protocol to handle three parties). We prove the fairness of the new protocol by presenting a new paradigm for analyzing fairness of coin-flipping protocols; the claimed fairness is proved by mapping the set of adversarial strategies that try to bias the honest parties’ outcome in the protocol to the set of the feasible solutions of a linear program. The gain each strategy achieves is the value of the corresponding solution. We then bound the optimal value of the linear program by constructing a feasible solution to its dual.", "authors": [ { "name": "Niv Buchbinder", "affiliations": [] }, { "name": "Iftach Haitner", "affiliations": [] }, { "name": "Nissan Levi", "affiliations": [] }, { "name": "Eliad Tsfadia", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-06", "source": "crossref" }, { "doi": "10.1007/s00145-025-09551-8", "url": "https://doi.org/10.1007/s00145-025-09551-8", "title": "Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash", "abstract": "", "authors": [ { "name": "Susumu Kiyoshima", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": "pqc", "categories": [ "pqc" ], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-05", "source": "crossref" }, { "doi": "10.1007/s00145-025-09552-7", "url": "https://doi.org/10.1007/s00145-025-09552-7", "title": "Efficient Algorithms for the Detection of (N, N)-Splittings and Endomorphisms", "abstract": "", "authors": [ { "name": "Maria Corte-Real Santos", "affiliations": [] }, { "name": "Craig Costello", "affiliations": [] }, { "name": "Sam Frengley", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-11-04", "source": "crossref" }, { "doi": "10.1007/s00145-025-09559-0", "url": "https://doi.org/10.1007/s00145-025-09559-0", "title": "Finding the Inverse of some Shift Invariant Transformations", "abstract": "", "authors": [ { "name": "Fukang Liu", "affiliations": [] }, { "name": "Vaibhav Dixit", "affiliations": [] }, { "name": "Santanu Sarkar", "affiliations": [] }, { "name": "Willi Meier", "affiliations": [] }, { "name": "Takanori Isobe", "affiliations": [] } ], "journal": { "id": "j-cryptology", "title": "Journal of Cryptology", "issn": [ "0933-2790", "1432-1378" ] }, "type": "journal-article", "subjects": [], "primary_topic": null, "categories": [], "journal_areas": [ "pqc" ], "india_hint": false, "published": "2025-10-16", "source": "crossref" } ] }