Pub Date : 2026-02-03DOI: 10.1038/s41534-026-01189-z
Tobias Haug, Poetri Sonya Tarabunga
Nonstabilizerness, or ‘magic’, is a crucial resource for quantum computation, but quantifying the magic of mixed states has been a notoriously difficult task. We introduce efficient magic witnesses based on stabilizer Rényi entropy that both robustly indicate magic and quantitatively estimate magic monotones. Building on these witnesses, we design testing algorithms that distinguish high- and low-magic states under entropy constraints and apply them to certify the number of noisy T-gates for a broad class of noise models. Using the IonQ quantum computer, we experimentally verify magic in noisy random circuits and find that magic remains robust, persisting even under depolarizing noise with probability exponentially close to one. Our witnesses are efficiently computable for matrix product states, showing that subsystems of many-body states can host extensive magic even when the system is entangled. Finally, we show that mimicking high-magic states with minimal magic requires an extensive amount of entropy, implying that entropy is a necessary cryptographic resource for hiding magic from eavesdroppers. Our results provide practical tools for characterizing the complexity of noisy quantum systems.
{"title":"Efficient witnessing and testing of magic in mixed quantum states","authors":"Tobias Haug, Poetri Sonya Tarabunga","doi":"10.1038/s41534-026-01189-z","DOIUrl":"https://doi.org/10.1038/s41534-026-01189-z","url":null,"abstract":"Nonstabilizerness, or ‘magic’, is a crucial resource for quantum computation, but quantifying the magic of mixed states has been a notoriously difficult task. We introduce efficient magic witnesses based on stabilizer Rényi entropy that both robustly indicate magic and quantitatively estimate magic monotones. Building on these witnesses, we design testing algorithms that distinguish high- and low-magic states under entropy constraints and apply them to certify the number of noisy T-gates for a broad class of noise models. Using the IonQ quantum computer, we experimentally verify magic in noisy random circuits and find that magic remains robust, persisting even under depolarizing noise with probability exponentially close to one. Our witnesses are efficiently computable for matrix product states, showing that subsystems of many-body states can host extensive magic even when the system is entangled. Finally, we show that mimicking high-magic states with minimal magic requires an extensive amount of entropy, implying that entropy is a necessary cryptographic resource for hiding magic from eavesdroppers. Our results provide practical tools for characterizing the complexity of noisy quantum systems.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"117 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146102083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-23DOI: 10.1038/s41534-026-01184-4
Gereon Koßmann, René Schwonnek
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing provable upper and lower bounds is the central result of this work. Our primordial motivation stems from the essential task of estimating secret key rates for QKD from the measurement statistics of a real device. Further applications include the computation of channel capacities, the estimation of entanglement measures and many more. We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, Quantum 7, 1102 (2023)] and provide reliable bounds as a sequence of semidefinite programs (SDPs). Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions. Additionally, we can provide gap estimates to the optimum at each iteration stage.
{"title":"Optimising the relative entropy under semidefinite constraints","authors":"Gereon Koßmann, René Schwonnek","doi":"10.1038/s41534-026-01184-4","DOIUrl":"https://doi.org/10.1038/s41534-026-01184-4","url":null,"abstract":"Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing provable upper and lower bounds is the central result of this work. Our primordial motivation stems from the essential task of estimating secret key rates for QKD from the measurement statistics of a real device. Further applications include the computation of channel capacities, the estimation of entanglement measures and many more. We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, <jats:italic>Quantum</jats:italic> 7, 1102 (2023)] and provide reliable bounds as a sequence of semidefinite programs (SDPs). Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions. Additionally, we can provide gap estimates to the optimum at each iteration stage.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"61 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146042929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-23DOI: 10.1038/s41534-026-01183-5
Stéphane Vinet, Marco Clementi, Marcello Bacchi, Yujie Zhang, Massimo Giacomin, Luke Neal, Paolo Villoresi, Matteo Galli, Daniele Bajoni, Thomas Jennewein
Frequency-bin entangled photons can be efficiently produced on-chip which offers a scalable, robust and low-footprint platform for quantum communication, particularly well-suited for resource-constrained settings such as mobile or satellite-based systems. However, analyzing such entangled states typically requires active and lossy components, limiting scalability and multi-mode compatibility. We demonstrate a novel technique for processing frequency-encoded photons using linear interferometry and time-resolved detection. Our approach is fully passive and compatible with spatially multi-mode light, making it suitable for free-space and satellite-to-ground applications. As a proof-of-concept, we utilize frequency-bin entangled photons generated from a high-brightness multi-resonator source integrated on-chip to show the ability to perform arbitrary projective measurements over both single- and multi-mode channels. We report the first measurement of the joint temporal intensity between frequency-bin entangled photons, which allows us to certify entanglement by violating the Clauser-Horne-Shimony-Holt (CHSH) inequality, with a measured value of ∣ S ∣ = 2.32 ± 0.05 over multi-mode fiber. By combining time-resolved detection with energy-correlation measurements, we perform full quantum state tomography, yielding a state fidelity of up to 91%. We further assess our ability to produce non-classical states via a violation of time-energy entropic uncertainty relations and investigate the feasibility of a quantum key distribution protocol. Our work establishes a resource-efficient and scalable approach toward the deployment of robust frequency-bin entanglement over free-space and satellite-based links.
{"title":"Time-resolved certification of frequency-bin entanglement over multi-mode channels","authors":"Stéphane Vinet, Marco Clementi, Marcello Bacchi, Yujie Zhang, Massimo Giacomin, Luke Neal, Paolo Villoresi, Matteo Galli, Daniele Bajoni, Thomas Jennewein","doi":"10.1038/s41534-026-01183-5","DOIUrl":"https://doi.org/10.1038/s41534-026-01183-5","url":null,"abstract":"Frequency-bin entangled photons can be efficiently produced on-chip which offers a scalable, robust and low-footprint platform for quantum communication, particularly well-suited for resource-constrained settings such as mobile or satellite-based systems. However, analyzing such entangled states typically requires active and lossy components, limiting scalability and multi-mode compatibility. We demonstrate a novel technique for processing frequency-encoded photons using linear interferometry and time-resolved detection. Our approach is fully passive and compatible with spatially multi-mode light, making it suitable for free-space and satellite-to-ground applications. As a proof-of-concept, we utilize frequency-bin entangled photons generated from a high-brightness multi-resonator source integrated on-chip to show the ability to perform arbitrary projective measurements over both single- and multi-mode channels. We report the first measurement of the joint temporal intensity between frequency-bin entangled photons, which allows us to certify entanglement by violating the Clauser-Horne-Shimony-Holt (CHSH) inequality, with a measured value of ∣ <jats:italic>S</jats:italic> ∣ = 2.32 ± 0.05 over multi-mode fiber. By combining time-resolved detection with energy-correlation measurements, we perform full quantum state tomography, yielding a state fidelity of up to 91%. We further assess our ability to produce non-classical states via a violation of time-energy entropic uncertainty relations and investigate the feasibility of a quantum key distribution protocol. Our work establishes a resource-efficient and scalable approach toward the deployment of robust frequency-bin entanglement over free-space and satellite-based links.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"54 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146033150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-23DOI: 10.1038/s41534-025-01171-1
Nam Nguyen, Thomas W. Watts, Benjamin Link, Kristen S. Williams, Yuval R. Sanders, Samuel J. Elman, Maria Kieferova, Michael J. Bremner, Kaitlyn J. Morrell, Justin Elenewski, Eric B. Isaacs, Samuel D. Johnson, Luke Mathieson, Kevin M. Obenland, Matthew Otten, Rashmi Sundareswara, Adam Holmes
{"title":"Quantum computing for corrosion simulation: workflow and resource analysis","authors":"Nam Nguyen, Thomas W. Watts, Benjamin Link, Kristen S. Williams, Yuval R. Sanders, Samuel J. Elman, Maria Kieferova, Michael J. Bremner, Kaitlyn J. Morrell, Justin Elenewski, Eric B. Isaacs, Samuel D. Johnson, Luke Mathieson, Kevin M. Obenland, Matthew Otten, Rashmi Sundareswara, Adam Holmes","doi":"10.1038/s41534-025-01171-1","DOIUrl":"https://doi.org/10.1038/s41534-025-01171-1","url":null,"abstract":"","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"179 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146033152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-21DOI: 10.1038/s41534-025-01175-x
Lorenzo Coccia, Matteo Padovan, Andrea Pompermaier, Mattia Sabatini, Marco Avesani, Davide G. Marangon, Paolo Villoresi, Giuseppe Vallone
Device-independent (DI) quantum protocols use Bell inequality violations to ensure security or certify quantum properties without assumptions on the devices’ internal workings. In this work, we study the role of rank-one qubit positive operator-valued measures (POVMs) in DI scenarios. This class includes all qubit extremal POVMs, i.e., those measurements that cannot be realized as mixtures of others, as well as part of non-extremal POVMs, recently shown to be useful in sequential quantum protocols. We demonstrate that any rank-one POVM can generate correlations in bipartite scenarios that saturate a Tsirelson inequality when two parties share an arbitrary entangled two-qubit state and perform specific self-tested measurements. For extremal POVMs, such saturation enables explicit computation of guessing probability and worst-case conditional von Neumann entropy. From the Tsirelson inequality, we establish a randomness certification method that facilitates numerical simulations and we validate it through a proof-of-concept experiment with three-outcome POVMs and tilted entangled states.
{"title":"Quantum bounds and device-independent security with rank-one qubit measurements","authors":"Lorenzo Coccia, Matteo Padovan, Andrea Pompermaier, Mattia Sabatini, Marco Avesani, Davide G. Marangon, Paolo Villoresi, Giuseppe Vallone","doi":"10.1038/s41534-025-01175-x","DOIUrl":"https://doi.org/10.1038/s41534-025-01175-x","url":null,"abstract":"Device-independent (DI) quantum protocols use Bell inequality violations to ensure security or certify quantum properties without assumptions on the devices’ internal workings. In this work, we study the role of rank-one qubit positive operator-valued measures (POVMs) in DI scenarios. This class includes all qubit extremal POVMs, i.e., those measurements that cannot be realized as mixtures of others, as well as part of non-extremal POVMs, recently shown to be useful in sequential quantum protocols. We demonstrate that any rank-one POVM can generate correlations in bipartite scenarios that saturate a Tsirelson inequality when two parties share an arbitrary entangled two-qubit state and perform specific self-tested measurements. For extremal POVMs, such saturation enables explicit computation of guessing probability and worst-case conditional von Neumann entropy. From the Tsirelson inequality, we establish a randomness certification method that facilitates numerical simulations and we validate it through a proof-of-concept experiment with three-outcome POVMs and tilted entangled states.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"64 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Silicon quantum dots are one of the most promising candidates for practical quantum computers because of their scalability and compatibility with the well-established complementary metal-oxide-semiconductor technology. However, the coherence time is limited in industry-standard natural silicon because of the 29Si isotopes, which have non-zero nuclear spin. Here, we protect an isotopically natural silicon metal-oxide-semiconductor (Si-MOS) quantum dot spin qubit from environmental noise via electron spin resonance with a phase-modulated microwave (MW) drive. This concatenated continuous drive (CCD) method extends the decay time of Rabi oscillations from 1.2 μs to over 200 μs. Furthermore, we define a protected qubit basis and propose robust gate operations. We find the coherence time measured by Ramsey sequence is improved from 143 ns to 40.7 μs compared to that of the bare spin qubit. The single qubit gate fidelity measured with randomized benchmarking is improved from 95% to 99%, underscoring the effectiveness of the CCD method. The method shows promise for improving control fidelity of noisy qubits, overcoming the qubit variability for global control, and maintaining qubit coherence while idling.
{"title":"Robust spin-qubit control in a natural Si-MOS quantum dot using phase modulation","authors":"Takuma Kuno, Takeru Utsugi, Andrew J. Ramsay, Normann Mertig, Noriyuki Lee, Itaru Yanagi, Toshiyuki Mine, Nobuhiro Kusuno, Raisei Mizokuchi, Takashi Nakajima, Shinichi Saito, Digh Hisamoto, Ryuta Tsuchiya, Jun Yoneda, Tetsuo Kodera, Hiroyuki Mizuno","doi":"10.1038/s41534-026-01185-3","DOIUrl":"https://doi.org/10.1038/s41534-026-01185-3","url":null,"abstract":"Silicon quantum dots are one of the most promising candidates for practical quantum computers because of their scalability and compatibility with the well-established complementary metal-oxide-semiconductor technology. However, the coherence time is limited in industry-standard natural silicon because of the 29Si isotopes, which have non-zero nuclear spin. Here, we protect an isotopically natural silicon metal-oxide-semiconductor (Si-MOS) quantum dot spin qubit from environmental noise via electron spin resonance with a phase-modulated microwave (MW) drive. This concatenated continuous drive (CCD) method extends the decay time of Rabi oscillations from 1.2 μs to over 200 μs. Furthermore, we define a protected qubit basis and propose robust gate operations. We find the coherence time measured by Ramsey sequence is improved from 143 ns to 40.7 μs compared to that of the bare spin qubit. The single qubit gate fidelity measured with randomized benchmarking is improved from 95% to 99%, underscoring the effectiveness of the CCD method. The method shows promise for improving control fidelity of noisy qubits, overcoming the qubit variability for global control, and maintaining qubit coherence while idling.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"39 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-21DOI: 10.1038/s41534-026-01182-6
Chengkai Zhu, Shuyu He, Yu-Ao Chen, Lei Zhang, Xin Wang
Identifying unknown Hamiltonians from their quantum dynamics is a pivotal challenge in quantum technologies. In this paper, we introduce Hamiltonian recognition, a framework that bridges quantum hypothesis testing and quantum metrology, aiming to identify the Hamiltonian governing quantum dynamics from a known set of Hamiltonians. To identify H for an unknown qubit quantum evolution (exp (-iHtheta )) with unknown θ, from two or three orthogonal Hamiltonians, we develop a quantum algorithm for coherent function simulation, built on two quantum signal processing (QSP) structures. It can simultaneously realize a target polynomial based on measurement results regardless of the chosen signal unitary for the QSP. Utilizing semidefinite optimization and group representation theory, we prove that our methods achieve the optimal average success probability, taken over possible Hamiltonians H and parameters θ, decays as O(1/k) with k queries of the unknown unitary transformation. Furthermore, we demonstrate the validity of our protocol on a superconducting quantum processor. We also investigate a physically motivated recognition task for Heisenberg Hamiltonians, providing numerical evidence for effective multi-qubit quantum system recognition. This work presents an efficient method to recognize Hamiltonians from limited queries of the dynamics, opening new avenues in composite channel discrimination and quantum metrology.
{"title":"Optimal Hamiltonian recognition of unknown quantum dynamics","authors":"Chengkai Zhu, Shuyu He, Yu-Ao Chen, Lei Zhang, Xin Wang","doi":"10.1038/s41534-026-01182-6","DOIUrl":"https://doi.org/10.1038/s41534-026-01182-6","url":null,"abstract":"Identifying unknown Hamiltonians from their quantum dynamics is a pivotal challenge in quantum technologies. In this paper, we introduce Hamiltonian recognition, a framework that bridges quantum hypothesis testing and quantum metrology, aiming to identify the Hamiltonian governing quantum dynamics from a known set of Hamiltonians. To identify H for an unknown qubit quantum evolution (exp (-iHtheta )) with unknown θ, from two or three orthogonal Hamiltonians, we develop a quantum algorithm for coherent function simulation, built on two quantum signal processing (QSP) structures. It can simultaneously realize a target polynomial based on measurement results regardless of the chosen signal unitary for the QSP. Utilizing semidefinite optimization and group representation theory, we prove that our methods achieve the optimal average success probability, taken over possible Hamiltonians H and parameters θ, decays as O(1/k) with k queries of the unknown unitary transformation. Furthermore, we demonstrate the validity of our protocol on a superconducting quantum processor. We also investigate a physically motivated recognition task for Heisenberg Hamiltonians, providing numerical evidence for effective multi-qubit quantum system recognition. This work presents an efficient method to recognize Hamiltonians from limited queries of the dynamics, opening new avenues in composite channel discrimination and quantum metrology.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"39 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-19DOI: 10.1038/s41534-025-01129-3
Neil Dowling, Maxwell T. West, Angus Southwell, Azar C. Nakhl, Martin Sevior, Muhammad Usman, Kavan Modi
Despite their ever more widespread deployment throughout society, machine learning algorithms remain critically vulnerable to being spoofed by subtle adversarial tampering with their input data. The prospect of near-term quantum computers being capable of running quantum machine learning (QML) algorithms has therefore generated intense interest in their adversarial vulnerability. Here we show that quantum properties of QML algorithms can confer fundamental protections against such attacks, in certain scenarios guaranteeing robustness against classically-armed adversaries. We leverage tools from many-body physics to identify the quantum sources of this protection. Our results offer a theoretical underpinning of recent evidence which suggest quantum advantages in the search for adversarial robustness. In particular, we prove that quantum classifiers are: (i) protected against weak perturbations of data drawn from the trained distribution, (ii) protected against local attacks if they are insufficiently scrambling, and (iii) show evidence that they are protected against universal adversarial attacks if they are sufficiently chaotic. Our analytic results are supported by numerical evidence demonstrating the applicability of our theorems and the resulting robustness of a quantum classifier in practice. This line of inquiry constitutes a concrete pathway to advantage in QML, orthogonal to the usually sought improvements in model speed or accuracy.
{"title":"Adversarial robustness guarantees for quantum classifiers","authors":"Neil Dowling, Maxwell T. West, Angus Southwell, Azar C. Nakhl, Martin Sevior, Muhammad Usman, Kavan Modi","doi":"10.1038/s41534-025-01129-3","DOIUrl":"https://doi.org/10.1038/s41534-025-01129-3","url":null,"abstract":"Despite their ever more widespread deployment throughout society, machine learning algorithms remain critically vulnerable to being spoofed by subtle adversarial tampering with their input data. The prospect of near-term quantum computers being capable of running quantum machine learning (QML) algorithms has therefore generated intense interest in their adversarial vulnerability. Here we show that quantum properties of QML algorithms can confer fundamental protections against such attacks, in certain scenarios guaranteeing robustness against classically-armed adversaries. We leverage tools from many-body physics to identify the quantum sources of this protection. Our results offer a theoretical underpinning of recent evidence which suggest quantum advantages in the search for adversarial robustness. In particular, we prove that quantum classifiers are: (i) protected against weak perturbations of data drawn from the trained distribution, (ii) protected against local attacks if they are insufficiently scrambling, and (iii) show evidence that they are protected against universal adversarial attacks if they are sufficiently chaotic. Our analytic results are supported by numerical evidence demonstrating the applicability of our theorems and the resulting robustness of a quantum classifier in practice. This line of inquiry constitutes a concrete pathway to advantage in QML, orthogonal to the usually sought improvements in model speed or accuracy.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"32 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146006029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-17DOI: 10.1038/s41534-025-01178-8
Alessandro Summer, Alexander Nico-Katz, Shane Dooley, John Goold
In this work, we investigate discrete-time transport in a generic U(1)-symmetric disordered model tuned across an array of different dynamical regimes. We develop an aggregate quantity, a circular statistical moment, which is a simple function of the magnetization profile and which elegantly captures transport properties of the system. From this quantity, we extract transport exponents, revealing behaviors across the phase diagram consistent with localized, diffusive, and—most interestingly for a disordered system—superdiffusive regimes. Investigation of this superdiffusive regime reveals the existence of a prethermal “swappy” regime unique to discrete-time systems in which excitations propagate coherently; even in the presence of strong disorder.
{"title":"Anomalous transport in U(1)-symmetric quantum circuits","authors":"Alessandro Summer, Alexander Nico-Katz, Shane Dooley, John Goold","doi":"10.1038/s41534-025-01178-8","DOIUrl":"https://doi.org/10.1038/s41534-025-01178-8","url":null,"abstract":"In this work, we investigate discrete-time transport in a generic U(1)-symmetric disordered model tuned across an array of different dynamical regimes. We develop an aggregate quantity, a circular statistical moment, which is a simple function of the magnetization profile and which elegantly captures transport properties of the system. From this quantity, we extract transport exponents, revealing behaviors across the phase diagram consistent with localized, diffusive, and—most interestingly for a disordered system—superdiffusive regimes. Investigation of this superdiffusive regime reveals the existence of a prethermal “swappy” regime unique to discrete-time systems in which excitations propagate coherently; even in the presence of strong disorder.","PeriodicalId":19212,"journal":{"name":"npj Quantum Information","volume":"56 1","pages":""},"PeriodicalIF":7.6,"publicationDate":"2026-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145993497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：