Crosslisted article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- Analytic local resolution of Medvedev's Morse index conjecture for the critical hyperbolic cateno...
Alexander Pigazzini
https://arxiv.org/abs/2605.13562 https://mastoxiv.page/@arXiv_mathDG_bot/116571915012742224
- Determinantal point processes associated with the Bochner-Schr\"odinger operator
Yuri A. Kordyukov
https://arxiv.org/abs/2605.13575 https://mastoxiv.page/@arXiv_mathDG_bot/116571924843260732
- Spectral instability and non-uniqueness of mild solutions for the Keller-Segel system
Eliseo Luongo, Umberto Pappalettera
https://arxiv.org/abs/2605.13592 https://mastoxiv.page/@arXiv_mathAP_bot/116571934281016744
- Quantum Fractional Revival and Entanglement Entropy in Unitary Cayley Graphs
Duaa Abdullah
https://arxiv.org/abs/2605.13645 https://mastoxiv.page/@arXiv_mathCO_bot/116571957678938731
toXiv_bot_toot
#ScottishLabour are committing in their manifesto to:
> Recommit the NHS to delivering single sex wards on the basis of biological sex (page 16) and
> Delivering single-sex spaces on the basis of biological sex, in NHS wards, schools, sport and everyday life (page 52)
This means, essentially, excluding
Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal
https://arxiv.org/abs/2601.10047 https://mastoxiv.page/@arXiv_csIT_bot/115903956641689136
- Breaking Symmetry in D2D Coded Caching: Optimal Communication with Low Subpacketization
Xiang Zhang, Giuseppe Caire, Mingyue Ji
https://arxiv.org/abs/2602.12220 https://mastoxiv.page/@arXiv_csIT_bot/116062725600909840
- A New Approach to Code Smoothing Bounds
Tsuyoshi Miezaki, Yusaku Nishimura, Katsuyuki Takashima
https://arxiv.org/abs/2603.18077 https://mastoxiv.page/@arXiv_csIT_bot/116260380391748925
- Fluid Antenna Systems Enabling 6G HRLLC With Port Switching Delay
Xusheng Zhu, Kai-Kit Wong, Hao Xu, Chenguang Rao, Hyundong Shin
https://arxiv.org/abs/2605.06275 https://mastoxiv.page/@arXiv_csIT_bot/116537839161835575
- Accurate Estimation of Mutual Information in High Dimensional Data
Eslam Abdelaleem, K. Michael Martini, Ilya Nemenman
https://arxiv.org/abs/2506.00330 https://mastoxiv.page/@arXiv_physicsdataan_bot/114618315134354611
- SDQM: Synthetic Data Quality Metric for Object Detection Dataset Evaluation
Ayush Zenith, Arnold Zumbrun, Neel Raut, Jing Lin
https://arxiv.org/abs/2510.06596 https://mastoxiv.page/@arXiv_csCV_bot/115343628773188610
- SEDULity: A Proof-of-Learning Framework for Distributed and Secure Blockchains with Efficient Use...
Weihang Cao, Mustafa Doger, Sennur Ulukus
https://arxiv.org/abs/2512.13666 https://mastoxiv.page/@arXiv_csCR_bot/115729118798706696
- A theory of learning data statistics in diffusion models, from easy to hard
Lorenzo Bardone, Claudia Merger, Sebastian Goldt
https://arxiv.org/abs/2603.12901 https://mastoxiv.page/@arXiv_statML_bot/116237842977106276
- On the independence number of de Bruijn graphs
Pietro Majer, Matteo Novaga
https://arxiv.org/abs/2604.14671 https://mastoxiv.page/@arXiv_mathCO_bot/116419097221023806
- Information bottleneck for learning the phase space of dynamics from high-dimensional experimenta...
K. Michael Martini, Eslam Abdelaleem, Paarth Gulati, Ilya Nemenman
https://arxiv.org/abs/2604.24662 https://mastoxiv.page/@arXiv_physicsdataan_bot/116481236697063671
- Improved Amenability Bounds for Local Coordination Games
Ron Peretz, Dean Kraizberg
https://arxiv.org/abs/2606.01963 https://mastoxiv.page/@arXiv_csGT_bot/116679490095124433
toXiv_bot_toot
Crosslisted article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[1/2]:
- Collective Emission in LH2 Assembly Beyond the Point-Dipole Approximation
Javed Akhtar, Himangshu Prabal Goswami
https://arxiv.org/abs/2606.11227 https://mastoxiv.page/@arXiv_physicsbioph_bot/116730397622511231
- Physically Constrained Ensemble Gaussian Process Modelling for Expensive Quantum Systems with Het...
Arpan Biswas, Surtirtha Paul, Joseph Agada, Matthias Thamm, Adrian Del Maestro
https://arxiv.org/abs/2606.11240 https://mastoxiv.page/@arXiv_physicscompph_bot/116730343129842119
- Exact Dynamics of Topological Order Across a CDW--SPT Transition
Pradip Kattel, Yicheng Tang, Natan Andrei
https://arxiv.org/abs/2606.11303 https://mastoxiv.page/@arXiv_condmatstrel_bot/116730377342191756
- Implementing Hamiltonian Renormalization Group Flow on Quantum Computers with VAPOR
Federica Fragomeno, Jorden Roberts, Saeed Rastgoo, Klaus Liegener
https://arxiv.org/abs/2606.11306 https://mastoxiv.page/@arXiv_heplat_bot/116730339197109709
- Dissociative recombination and ion-pair formation in $\mathrm{HeH^ }$ isotopologues: A time-depen...
Sifiso Musa Nkambule, Malibongwe Tsabedze, Oscar N. Mabuza, Mbuso K. Matfunjwa
https://arxiv.org/abs/2606.11352 https://mastoxiv.page/@arXiv_physicsatmclus_bot/116730375179222347
- Compressed minimum-purity time evolution for late-time quantum dynamics
Moksh Bhateja, Jonas B. Rigo, Markus Schmitt
https://arxiv.org/abs/2606.11392 https://mastoxiv.page/@arXiv_condmatstatmech_bot/116730375009370911
- Invariants of Sequential Circuits and Generalized Non-Abelian Statistics
Shintaro Sato, Yoshimasa Hidaka, Ryohei Kobayashi
https://arxiv.org/abs/2606.11527 https://mastoxiv.page/@arXiv_condmatstrel_bot/116730377733126638
- Polarization-Resolved Photon Statistics of Cavity Quantum Materials
Benjamin Kass, Spenser Talkington, Martin Claassen
https://arxiv.org/abs/2606.11550 https://mastoxiv.page/@arXiv_condmatmeshall_bot/116730389727354747
- Consistent Evaluation of Operators Involving the Position Operator in the Bloch Representation: A...
Daehyeon An, Junmo Jeon, Se Kwon Kim
https://arxiv.org/abs/2606.11679 https://mastoxiv.page/@arXiv_condmatmeshall_bot/116730409193332256
- Mathematical Basis for Analyzing Superconducting Phase Transitions Using Catastrophe Theory
Jiu Hui Wu, Hua Tian, Kejiang Zhou
https://arxiv.org/abs/2606.11810 https://mastoxiv.page/@arXiv_condmatsuprcon_bot/116730381273852070
toXiv_bot_toot
Crosslisted article(s) found for eess.AS. https://arxiv.org/list/eess.AS/new
[1/1]:
- Mixture-of-Experts Framework for Field-of-View Enhanced Signal-Dependent Binauralization of Movin...
Mittal, Deppisch, Forrer, Le Sueur, Ben-Hur, Alon, Wong
https://arxiv.org/abs/2509.13548 https://mastoxiv.page/@arXiv_csSD_bot/115224207763275868
- Adaptive Diagonal Loading using Krylov Subspaces for Robust Beamforming
Manan Mittal, Ryan M. Corey, John R. Buck, Andrew C. Singer
https://arxiv.org/abs/2605.11286 https://mastoxiv.page/@arXiv_eessSP_bot/116566153677823049
- STRUM: A Spectral Transcription and Rhythm Understanding Model for End-to-End Generation of Playa...
Joshua Opria
https://arxiv.org/abs/2605.12135 https://mastoxiv.page/@arXiv_csSD_bot/116566166455341917
toXiv_bot_toot
Just realised Facebook locks you up and demands of you to sign up or log in to view my Facebook author's page, which is supposed to be public, after you scroll down a bit down the timeline. F!ck that, I am removing the links to it from my website.
Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Optimal Control Design of Robust Raman Pulses for High-Fidelity Cold-Atom Interferometry
Ziwen Song
edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 6388 nodes and 40267 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
Coarsening and Bifurcations in Wide-Range Two-Dimensional Totalistic Cellular Automata
Franco Bagnoli, Luca Mencarelli
https://arxiv.org/abs/2604.10082 https://arxiv.org/pdf/2604.10082 https://arxiv.org/html/2604.10082
arXiv:2604.10082v1 Announce Type: new
Abstract: We investigate Boolean, totalistic cellular automata with a majority or frustrated majority vote rule, and an interaction range of variable span. These two models show a behavior which differs from the mean-field one. The majority vote model is characterized by the presence of absorbing states, and there is a related bifurcation according to the initial density, in agreement with the mean-field approximation. For initial density equal to $0.5$, however, the dynamics is dominated by a coarsening process, which stops when clusters with a definite curvature radius are established. For the frustrated majority vote model, the mean-field approximation gives chaotic oscillations or a limit cycle. Instead, we observe active patterns, with stable density. Above a certain critical value for the interacting radius there is a bifurcation of the asymptotic density as a function of the initial one.
toXiv_bot_toot
Crosslisted article(s) found for nlin.CD. https://arxiv.org/list/nlin.CD/new
[1/1]:
- Investigation of Chaotic Behavior in Clapp Oscillator
Ivana Vasiljevi\'c, Nikola Petrovi\'c, Aleksandra Leki\'c
Crosslisted article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Energy-Efficient On-Device RAG on a Mobile NPU: System Design and Benchmark on Snapdragon X Elite
Zhiyuan Cheng, Longying Lai
https://arxiv.org/abs/2606.11257 https://mastoxiv.page/@arXiv_csCL_bot/116730488820684308
- TileFuse: A Fused Mixed-Precision Kernel Library for Efficient Quantized LLM Inference on AMD NPUs
Wesley Pang, Gregory Hyegang Jun, Feiyang Liu, Deming Chen
https://arxiv.org/abs/2606.11357 https://mastoxiv.page/@arXiv_csDC_bot/116730303808083247
- XPR: An Extensible Cross-Platform Point-Based Differentiable Renderer
Rhyner, Durvasula, Kovalev, Jia, Zhao, Mrutunjayya, Ahuja, Panneer, Giannoula, Vijaykumar
https://arxiv.org/abs/2606.11529 https://mastoxiv.page/@arXiv_csGR_bot/116730305576192171
- Beyond Per-Token Pricing: A Concurrency-Aware Methodology for LLM Infrastructure Cost Estimation
Chitral Patil
https://arxiv.org/abs/2606.11690 https://mastoxiv.page/@arXiv_csDC_bot/116730304985870885
- From Fork-Join to Asynchronous Tasks: Parallelizing Tiled Cholesky Decomposition with OpenMP and HPX
Alexander Strack, Alexander Van Craen, Dirk Pfl\"uger
https://arxiv.org/abs/2606.11937 https://mastoxiv.page/@arXiv_csDC_bot/116730405487451638
toXiv_bot_toot
«Kernel-Bug — FreeBSD-Exploit "Bumsrakete" verleiht Root-Zugriff:
Ein Exploit namens Bumsrakete gefährdet alle FreeBSD-Versionen der letzten fünf Jahre. Die Entdecker nehmen es mit reichlich Humor»
Weshalb wahrscheinlich einige Server kurz offline waren/sind. Sicherheitsrelevante Updates müssen auf der Stelle eingespielt werden, denn die par Minuten das die User einschränkt ist harmlos dem Bug gegenüber.
😈
Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/2]:
- Homomorphic Quantum Error Correction
Kornikar Sen, Miguel A. Martin-Delgado
https://arxiv.org/abs/2605.25692 https://mastoxiv.page/@arXiv_quantph_bot/116640053090772171
- Belief-Space Control for Personalized Cancer Treatment via Active Inference
Deniz Sargun, H. Bugra Tulay, C. Emre Koksal
https://arxiv.org/abs/2606.10376 https://mastoxiv.page/@arXiv_csAI_bot/116724820434554519
- A Geometric Profile of Semantic Information in Text: Frame-Conditional Uniqueness and a Trade-Off...
Dmitriy Kompaneets
https://arxiv.org/abs/2606.11222 https://mastoxiv.page/@arXiv_csCL_bot/116730477023664354
- An Entropy-based Framework for Hybrid Coalitions in Game Theory. Part I: Human Arbitration
Salome A. Sepulveda-Fontaine, Jose M. Amigo
https://arxiv.org/abs/2606.11288 https://mastoxiv.page/@arXiv_csGT_bot/116730374222115774
- Additive Noise, Shift Recovery, and Signed Signals in the Cumulative Distribution Transform
Harbir Antil, Ratna Khatri, Aryan Saxena
https://arxiv.org/abs/2606.11432 https://mastoxiv.page/@arXiv_eessSP_bot/116730375993496615
- A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions
Yuzhou Gu, Xin Li, Yinzhan Xu
https://arxiv.org/abs/2606.11448 https://mastoxiv.page/@arXiv_csDS_bot/116730380321553481
- Optimizing Encoder Circuits of Entanglement-Assisted Quantum LDPC Codes via Beam Search
Aditya Sodhani, Pavan Kumar, Shayan Srinivasa Garani, Keshab K. Parhi
https://arxiv.org/abs/2606.11468 https://mastoxiv.page/@arXiv_quantph_bot/116730421187038523
- FlexiBrain: Resolution-Agnostic Voxel-Level Encoding for Native fMRI
Mo Wang, Wenhao Ye, Junfeng Xia, Minghao Xu, Hongkai Wen, Quanying Liu
https://arxiv.org/abs/2606.11500 https://mastoxiv.page/@arXiv_eessIV_bot/116730364588705644
- Measuring language complexity from hierarchical reuse of recurring patterns
Junyi Zhou, Rui Liu, Pengyu Liu, Yu Liu
https://arxiv.org/abs/2606.11531 https://mastoxiv.page/@arXiv_csCL_bot/116730518902862163
- Superspace Concentration and Adversarial Robustness in Quantum Algorithms
Eric Yocam, Christian Yocam, Varghese Vaidyan, Yong Wang, Mahesh Kalappattil, Anthony Rizi
https://arxiv.org/abs/2606.11580 https://mastoxiv.page/@arXiv_quantph_bot/116730474074812546
toXiv_bot_toot
I can't find a place for "you might like" on Bandcamp. I'm specifically referring to "you might like based on your purchases / collection and listening history".
I know they suggest similar artists on the album page), but I'm looking for reccs like Netflix does. You watched this, so you should watch this.
Am I just missing it, or something similar?
Kinda weird to have all this data and not make use of it to sell me on more artists.
…
Crosslisted article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[2/2]:
- Non-Hermitian Delocalization Realizes Random Dirac Criticality in One Dimension
Bo Li, Shen Zhang, Ren Zhang
https://arxiv.org/abs/2606.12089 https://mastoxiv.page/@arXiv_condmatdisnn_bot/116730365150426280
- Fabricating fiber cavity mirror substrates compatible with high coupling efficiency
Michael Caouette-Mansour, Thomas J. Clark, Valeria Mosso Tsedilkina, Jack C. Sankey
https://arxiv.org/abs/2606.12168 https://mastoxiv.page/@arXiv_physicsoptics_bot/116730475059016236
- Experimental straintronics in nanotube quantum dots
L. Huang, I. G. Rebollo, A. R. Champagne
https://arxiv.org/abs/2606.12180 https://mastoxiv.page/@arXiv_condmatmeshall_bot/116730486068512684
- A post-selected quantum model of cosmic acceleration
Dimitris Lionas, Charis Anastopoulos, Konstantinos Gourgouliatos
https://arxiv.org/abs/2606.12297 https://mastoxiv.page/@arXiv_grqc_bot/116730477222156474
- Entanglement generation between field modes mediated by a fluctuating conducting wall
Luca Giovanni Cammarata, Tommaso Fazio, Roberto Passante, Lucia Rizzuto
https://arxiv.org/abs/2606.12338 https://mastoxiv.page/@arXiv_hepth_bot/116730465816996578
- Gate-tunable spin-valley transport via carrier velocity in monolayer WSe$_2$
Otman Bouladiane, Hocine Bahlouli, Clarence Cortes, David Laroze, Ahmed Jellal
https://arxiv.org/abs/2606.12353 https://mastoxiv.page/@arXiv_condmatmeshall_bot/116730497275361456
- Collective neutrino oscillations: Many-body non-forward effects and non-classicality
Julien Froustey, Ermal Rrapaj, Yuhao Liu, Gushu Li, Costin Iancu, Vincenzo Cirigliano
https://arxiv.org/abs/2606.12404 https://mastoxiv.page/@arXiv_hepph_bot/116730481154065938
- A Pfaffian quantum Hall state of ultracold bosons
Kwan, Segura, Li, Blatz, Zhi, Bakkali-Hassani, Bohrdt, Greiter, Grusdt, Greiner
https://arxiv.org/abs/2606.12409 https://mastoxiv.page/@arXiv_condmatquantgas_bot/116730427900388710
toXiv_bot_toot
Exact Semiclassical Phase Shifts for Relativistic Atom Interferometers in Flat Spacetime
Hunter Swan, Jason M. Hogan
https://arxiv.org/abs/2607.10042 https://
General control of linear cellular automata
Franco Bagnoli, Sara Dridi, Bassem Sellami, Amira Mouakher, Samira El Yacoubi
https://arxiv.org/abs/2604.10076 https://arxiv.org/pdf/2604.10076 https://arxiv.org/html/2604.10076
arXiv:2604.10076v1 Announce Type: new
Abstract: In mathematics and engineering, control theory is concerned with the analysis of dynamical systems through the application of suitable control inputs. One of the prominent problems in control theory is controllability which concerns the ability to determine whether there exists a control input that can steer a dynamical system from an initial state to a desired final state within a finite time horizon. There is a general theory for controlling linear or linearizable system, but it cannot be applied to discrete systems like cellular automata, which is the problem of that we address in this paper. We develop a general theory for linear (and affine) cellular automata, and apply it to examples of one-dimensional and two-dimensional Boolean cases. We introduce the concept of controllability matrix and show that controllability holds if and only if the controllability matrix is invertible.
toXiv_bot_toot
Patient geheilt! (Grüße! 👋) Was tun, wenns mit meinem handgemalten #wandklexschmuck mal ein Hoppala gibt? Passiert, auch wenn all meinen Stücken eine Anleitung zur artgerechten Haltung beiliegt. Im Fall findest du umfassende Info immer auch im Shop auf https://www.wandklex.art/page/artgerechte-haltung-deines-wandklex-10146.
Found an old recipe book from Marfa, TX among my aunt's old things.
Some things are best left undisturbed.
I'm not an Apple ecosystem programmer, but every once in a while, I'll check out a project. It only dawned on me now that idiomatic naming in the Apple ecosystem uses abbreviations in front of type names as "name spaces”.
I just thought everyone was stark-raving mad. 😅
Here are some of my guesses.
Art from 'Aliens: Reapers' from 1991. This was a short 8 page no dialog comic story by John Arcudi and illustrated by Simon Bisley about 'Reapers' - an alien race that infiltrate Xenomorph hives to eat their eggs. My kinda alien race. 🍳
#Alien #SimonBisley
Have you heard of MRU.nvim before today? I didn't and that's another plugin I was missing to build my perfect Neovim.
#blog
Crosslisted article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- nomp: A Framework for Building Domain Specific Compilers
Thilina Ratnayaka, et al.
https://arxiv.org/abs/2606.12650 https://mastoxiv.page/@arXiv_csPL_bot/116736082356764597
- GF-DiT: Scheduling Parallelism for Diffusion Transformer Serving
Qiang, Hu, Sun, Yang, Zhao, Chen, Feng, Leng, Guo
https://arxiv.org/abs/2606.13501 https://mastoxiv.page/@arXiv_csDC_bot/116736130103581225
toXiv_bot_toot
Weird, I just got the r/freebsd page from three months ago (3rd February) at <https://old.reddit.com/r/freebsd/new/>.
It's not an entirely cached copy. The single maroon rectangle contains text that was updated two days ago (Sunday 10th May):
"temporarily blocked 2025-08-07―2…
Crosslisted article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- How Does Attention Help? Insights from Random Matrices on Signal Recovery from Sequence Models
Mohamed El Amine Seddik
https://arxiv.org/abs/2605.06826 https://mastoxiv.page/@arXiv_statML_bot/116554831982450917
- The classical Weyl law for Schr\"odinger operators on complete Riemannian manifolds
Maxim Braverman, Xianzhe Dai, Junrong Yan
https://arxiv.org/abs/2605.07200 https://mastoxiv.page/@arXiv_mathDG_bot/116554786957133913
- Volume-Independent Spectral Stability of Energy-Truncated Effective Hamiltonians in Quantum Spin ...
Ayumi Ukai
https://arxiv.org/abs/2605.07410 https://mastoxiv.page/@arXiv_mathph_bot/116554844761759525
- Strichartz and Spectral Projection Estimates on Asymptotically Conic Manifolds
Zhexing Zhang
https://arxiv.org/abs/2605.07629 https://mastoxiv.page/@arXiv_mathDG_bot/116554795216195755
toXiv_bot_toot
Very excited about the new stateful components model in Kitten¹ that I’m looking forward to releasing this week (finally) and the amount of visibility you can now get into the flow of your Kitten apps in the Kitten Interactive Shell (REPL)².
Since the new model is a breaking change (Kitten is prerelease) I’m in the middle of updating our own apps/sites and I still need to document everything. So it will take me a few days to do all that but then I’m very much looking forward to focussi…
Crosslisted article(s) found for math.AT. https://arxiv.org/list/math.AT/new
[1/1]:
- RTD-Lite: Scalable Topological Analysis for Comparing Weighted Graphs in Learning Tasks
Eduard Tulchinskii, Daria Voronkova, Ilya Trofimov, Evgeny Burnaev, Serguei Barannikov
https://arxiv.org/abs/2503.11910 https://mastoxiv.page/@arXiv_csLG_bot/114182227105908009
- Hallucination Detection in LLMs with Topological Divergence on Attention Graphs
Alexandra Bazarova, et al.
https://arxiv.org/abs/2504.10063 https://mastoxiv.page/@arXiv_csCL_bot/114340822288698487
- Arithmetic Wu Formulas and the Generalized Hecke Theorem
Shachar Carmeli, Mark Shusterman, Sa'ar Zehavi
https://arxiv.org/abs/2606.06008 https://mastoxiv.page/@arXiv_mathNT_bot/116696438874436734
- $p$-adic Bi-Filtrations for Topological Machine Learning on Genomic Sequences
Tirtharaj Dash, Gunja Sachdeva
https://arxiv.org/abs/2606.06117 https://mastoxiv.page/@arXiv_qbioQM_bot/116696454797742926
- RedZeD: Computing persistent homology by Reduction to Zero Differentials
Chris Kapulkin, Nathan Kershaw
https://arxiv.org/abs/2606.06310 https://mastoxiv.page/@arXiv_csCG_bot/116696326602622617
toXiv_bot_toot
Control of Cellular Automata by Moving Agents with Reinforcement Learning
Franco Bagnoli, Bassem Sellami, Amira Mouakher, Samira El Yacoubi
https://arxiv.org/abs/2604.10066 https://arxiv.org/pdf/2604.10066 https://arxiv.org/html/2604.10066
arXiv:2604.10066v1 Announce Type: new
Abstract: In this exploratory paper we introduce the problem of cognitive agents that learn how to modify their environment according to local sensing to reach a global goal. We concentrate on discrete dynamics (cellular automata) on a two-dimensional system. We show that agents may learn how to approximate their goal when the environment is passive, while this task becomes impossible if the environment follows an active dynamics.
toXiv_bot_toot
Crosslisted article(s) found for math.KT. https://arxiv.org/list/math.KT/new
[1/1]:
- Almost quaternionic structures on compact rank one symmetric spaces
Oliver Goertsches, Panagiotis Konstantis, Eugenia Loiudice, Grigory Solomadin
https://arxiv.org/abs/2606.12659 https://mastoxiv.page/@arXiv_mathAT_bot/116736088028259326
toXiv_bot_toot
Heute vor 7 Jahren: Am 8. Juli 2019 informierte der #Iran die #IAEA, dass er in der Nuklearanlage in #Natanz Uran auf etwa 4,5 Prozent Uran-235 angereichert hat.
I guess the EU will have to pass a law forcing Nintendo to sell its consoles in Europe next https://www.digitec.ch/en/page/bye-switch-nintendo-announces-end-of-console-in-europe-43197
Crosslisted article(s) found for eess.AS. https://arxiv.org/list/eess.AS/new
[1/1]:
- Mixture-of-Experts Framework for Field-of-View Enhanced Signal-Dependent Binauralization of Movin...
Mittal, Deppisch, Forrer, Le Sueur, Ben-Hur, Alon, Wong
Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Collective amplification and anisotropic narrowing of alignment signals in cesium vapor under str...
Mikhail V. Petrenko, Anton K. Vershovskii
Replaced article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Prism: Cost-Efficient Multi-LLM Serving via GPU Memory Ballooning
Shan Yu, et al.
https://arxiv.org/abs/2505.04021 https://mastoxiv.page/@arXiv_csDC_bot/114470987370092358
- Standardized Methods and Recommendations for Green Federated Learning
Austin Tapp, Holger R. Roth, Ziyue Xu, Abhijeet Parida, Hareem Nisar, Marius George Linguraru
https://arxiv.org/abs/2602.00343 https://mastoxiv.page/@arXiv_csDC_bot/116005928828294010
toXiv_bot_toot
Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[2/2]:
- What Limits Does Quantization Place on Dense Top-$k$ Retrieval? A Theoretical Study
Koki Okajima, Tsukasa Yoshida
https://arxiv.org/abs/2606.11780 https://mastoxiv.page/@arXiv_csIR_bot/116730357313656261
- Quadratic APN Functions in Dimension 8 via Gr\"obner Basis Search in a Self-Equivalence Subspace
Oleksandr Kuznetsov
https://arxiv.org/abs/2606.11967 https://mastoxiv.page/@arXiv_csCR_bot/116730499833561826
- Game-Theoretic Latent Space Alignment for Multi-user Semantic MIMO Communications
Giuseppe Di Poce, Mattia Merluzzi, Emilio Calvanese Strinati, Paolo Di Lorenzo
https://arxiv.org/abs/2606.12005 https://mastoxiv.page/@arXiv_csGT_bot/116730408631687040
- An iterative Ising decoder for quantum error correction codes
Liu, Zeng, Li, Liu, Huang, Liu, Wang, Wu, Lao
https://arxiv.org/abs/2606.12301 https://mastoxiv.page/@arXiv_quantph_bot/116730537187964618
toXiv_bot_toot
Wavelength-driven photoelectron momentum tilt in XUV Ionization
Neha Kukreti, Amol R. Holkundkar
https://arxiv.org/abs/2605.13400 https://arxiv.org/pdf/260…
Too Good to Be True: A Study on Modern Automatic Speech Recognition for the Evaluation of Speech Enhancement
Danilo de Oliveira, Tal Peer, Timo Gerkmann
https://arxiv.org/abs/2605.12107 https://arxiv.org/pdf/2605.12107 https://arxiv.org/html/2605.12107
arXiv:2605.12107v1 Announce Type: new
Abstract: Speech enhancement (SE) systems are typically evaluated using a variety of instrumental metrics. The use of automatic speech recognition (ASR) systems to evaluate SE performance is common in literature, usually in terms of word error rate (WER). However, WER scores depend heavily on the choice of ASR system and text normalization pipeline. In this paper, we investigate how modern ASR models correlate with human recognition of enhanced speech. A listening experiment reveals that modern ASR models with large-scale noisy training and embedded language models correlate more with human WER than simpler ones, with a transducer model providing the most reliable transcriptions. Nevertheless, we also show that these models' robustness to noise and use of context can be uninformative to an acoustics-focused evaluation of enhancement performance.
toXiv_bot_toot
$\Lambda$-enhanced gray-molasses loading and EIT cooling of neutral atoms in nanophotonic traps
Lucas Pache, Antoine Glicenstein, Philipp Schneeweiss, J\"urgen Volz, Arno Rauschenbeutel, Riccardo Pennetta
https://arxiv.org/abs/2605.13387
Replaced article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Redundant Array Computation Elimination
Zixuan Wang, Liang Yuan, Xianmeng Jiang, Kun Li, Junmin Xiao, Yunquan Zhang
https://arxiv.org/abs/2506.21960 https://mastoxiv.page/@arXiv_csPF_bot/114771182875836481
- \texttt{Range-Arithmetic}: Verifiable Deep Learning Inference on an Untrusted Party
Ali Rahimi, Babak H. Khalaj, Mohammad Ali Maddah-Ali
https://arxiv.org/abs/2505.17623 https://mastoxiv.page/@arXiv_csCR_bot/114572910759753105
- Compiler-First State Space Duality and Portable $O(1)$ Autoregressive Caching for Inference
Cosmo Santoni, Anmol Thapar
https://arxiv.org/abs/2603.09555 https://mastoxiv.page/@arXiv_csLG_bot/116210185886117277
- The World's Fastest Matching Engine Algorithm
Jake Yoon
https://arxiv.org/abs/2606.01183 https://mastoxiv.page/@arXiv_csDC_bot/116679523715331912
toXiv_bot_toot
edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 19818 nodes and 100424 edges.
Tags: Informational, Web graph, Multigraph, Timestamps
Replaced article(s) found for math.KT. https://arxiv.org/list/math.KT/new
[1/1]:
- Groupoid homology and K-theory for algebraic actions from number theory
Chris Bruce, Yosuke Kubota, Takuya Takeishi
https://arxiv.org/abs/2407.01952
toXiv_bot_toot
Crosslisted article(s) found for nlin.CD. https://arxiv.org/list/nlin.CD/new
[1/1]:
- Breakdown of Adiabatic Scaling and Noise-Induced Functional Synchronization in Deeply Quiescent E...
Yefan Wu
Too Good to Be True: A Study on Modern Automatic Speech Recognition for the Evaluation of Speech Enhancement
Danilo de Oliveira, Tal Peer, Timo Gerkmann
https://arxiv.org/abs/2605.12107
Quantum repeater segment with free-space coupled co-trapped ions using telecom photon interference
Max Bergerhoff, Pascal Baumgart, Christian Haen, Jonas Meiers, Tobias Bauer, Jonas Haferkamp, Christoph Becher, J\"urgen Eschner
https://arxiv.org/abs/2606.12313 https://arxiv.org/pdf/2606.12313 https://arxiv.org/html/2606.12313
arXiv:2606.12313v1 Announce Type: new
Abstract: A quantum repeater segment is a basic building block of a quantum repeater, generating buffered entanglement of quantum memories to connect quantum repeater cells. It also enables the connection between quantum computers. In the implementation we present here, photons emitted from two co-trapped free-space coupled $^{40}$Ca$^ $ ions are converted to the telecom-C band and interfered after transmission over 440$\,$m of optical fiber (220$\,$m per arm), where a photonic Bell measurement is performed to create entanglement between the memories. With this scheme we generate an entangled $\left|\Psi^ \right\rangle$ Bell state with $\ge 68(8)\,$% fidelity, highlighting trapped $^{40}$Ca$^ $ ions as a promising quantum repeater hardware platform.
toXiv_bot_toot
Replaced article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- Nodal Domains on Surfaces under Perturbation: Upper Semicontinuity, Courant-Sharpness, and Bounda...
Saikat Maji, Mayukh Mukherjee, Soumyajit Saha
https://arxiv.org/abs/2507.04928 https://mastoxiv.page/@arXiv_mathSP_bot/114817071253126842
toXiv_bot_toot
Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- SynIB: Informational Bottleneck for Maximizing Synergy in Multimodal Learning
Kontras, Gagaleska, Strypsteen, Chatzichristos, Blaschko, De Vos, Liang
https://arxiv.org/abs/2606.09853 https://mastoxiv.page/@arXiv_csLG_bot/116724702693114718
- Weighing Timed Regular Languages: The Final Step (long version)
Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Incl\'an
https://arxiv.org/abs/2606.11003 https://mastoxiv.page/@arXiv_csFL_bot/116724656264107397
- Fixed-Threshold One-Bit Toeplitz Covariance Estimation under Sparse-Ruler Sampling
Zhiyong Cheng, Shengyao Chen
https://arxiv.org/abs/2606.11110 https://mastoxiv.page/@arXiv_mathST_bot/116724782880940809
- Algorithmic and Minimax Complexities in Kernel Bandits
Yunbei Xu
https://arxiv.org/abs/2606.11171 https://mastoxiv.page/@arXiv_csLG_bot/116724929556609281
toXiv_bot_toot
[2026-06-12 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot
wiki_science: Wikipedia Map of Science (2020)
A network of scientific fields, extracted from the English Wikipedia in early 2020. Nodes are wikipedia pages representing natural, formal, social and applied sciences, and two nodes are linked if the cosine similarity of the page content is above a threshold. See <http://www.s…
Replaced article(s) found for math.KT. https://arxiv.org/list/math.KT/new
[1/1]:
- Syntomic cohomology of truncated Brown--Peterson spectra
Gabriel Angelini-Knoll
https://arxiv.org/abs/2602.14380 https://mastoxiv.page/@arXiv_mathKT_bot/116085085411947614
toXiv_bot_toot
Replaced article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Complex surface patterning in homo- and heteroepitaxial contexts: (simultaneous) step bunching an...
Vassil Ivanov, Vesselin Tonchev, Marta A. Chabowska, Hristina Popova, Magdalena A. Za{\l}uska-Kotur
…
Crosslisted article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- FP8 is All You Need (Part 1): Debunking Hardware FP64 as the HPC Holy Grail
Satoshi Matsuoka
https://arxiv.org/abs/2606.06510 https://mastoxiv.page/@arXiv_csAR_bot/116713312554823102
- P-Cast Precision in FP8 Attention: Sink-Induced Collapse and the Optimality of S=2^8
Reed Lau
https://arxiv.org/abs/2606.06521 https://mastoxiv.page/@arXiv_csAR_bot/116713315110983325
- Quantized AI Inference on Constrained Embedded Platforms for Small-Satellite Settings
Carlos Rafael Tordoya Taquichiri, Hans Dermot Doran, Pablo Ghiglino
https://arxiv.org/abs/2606.06528 https://mastoxiv.page/@arXiv_csAR_bot/116713322189822290
- AEGIS: A Backup Reflex for Physical AI
Josef Chen
https://arxiv.org/abs/2606.06660 https://mastoxiv.page/@arXiv_csAI_bot/116713377832304925
toXiv_bot_toot
Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Accidental Symmetry in the Tavis-Cummings Model via the Schwinger Boson Representation
Plato Deliyannis, Iman Marvian
Scaling-optimal purification of noisy qubit unitary channels
Ryotaro Niwa, Satoshi Yoshida, Koki Ono, Takeru Utsumi, Zhaoyi Li, Yuxiang Yang, Ryuji Takagi, Mio Murao
https://arxiv.org/abs/2606.12394 https://arxiv.org/pdf/2606.12394 https://arxiv.org/html/2606.12394
arXiv:2606.12394v1 Announce Type: new
Abstract: We consider the problem of purifying noisy qubit unitary channels. Given the ability to apply an unknown qubit unitary channel followed by depolarizing noise, we aim to construct a superchannel that purifies the noisy unitary back to the original unknown unitary. We first provide numerical evidence that sequential strategies can strictly outperform parallel strategies when the number of channel uses is finite, highlighting the fundamental distinction from state purification. We then provide a concrete $\mathrm{U}(2)$-covariant parallel protocol based on a novel entanglement-assisted quantum error-correcting code that suppresses the first-order noise strength as $O(1/n)$ with $n$ channel uses and show this scaling is asymptotically optimal in the low-noise regime, even when sequential strategies are allowed.
toXiv_bot_toot
Kinetic-Optimal Scheduling with Moment Correction for Metric-Induced Discrete Flow Matching in Zero-Shot Text-to-Speech
Dong Yang, Yiyi Cai, Haoyu Zhang, Yuki Saito, Hiroshi Saruwatari
https://arxiv.org/abs/2605.09386 https://arxiv.org/pdf/2605.09386 https://arxiv.org/html/2605.09386
arXiv:2605.09386v1 Announce Type: new
Abstract: Metric-induced discrete flow matching (MI-DFM) exploits token-latent geometry for discrete generation, but its practical use is limited by two issues: heuristic schedulers requiring hyperparameter search, and finite-step path-tracking error from its first-order continuous-time Markov chain (CTMC) solver. We address both issues. First, we derive a kinetic-optimal scheduler for prescribed scalar-parameterized probability paths, and instantiate it for MI-DFM as a training-free numerical schedule that traverses the path at constant Fisher-Rao speed. Second, we introduce a finite-step moment correction that adjusts the jump probability while preserving the CTMC jump destination distribution. We validate the resulting method, GibbsTTS, on codec-based zero-shot text-to-speech (TTS). Under controlled comparisons with a unified architecture and large-scale dataset, GibbsTTS achieves the best objective naturalness and is preferred in subjective evaluations over masked discrete generative baselines. Additionally, in comparison with the evaluated state-of-the-art TTS systems, GibbsTTS shows strong speaker similarity, achieving the highest similarity on three of four test sets and ranking second on the fourth. Project page: https://ydqmkkx.github.io/GibbsTTSProject
toXiv_bot_toot
Crosslisted article(s) found for nlin.CG. https://arxiv.org/list/nlin.CG/new
[1/1]:
- Universal Information-Theoretic Structure of the Quasi-Stationary Domany--Kinzel Automaton
Hyun-Yong Lee, Kenji Harada, Naoki Kawashima
Crosslisted article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Flash-GMM: A Memory-Efficient Kernel for Scalable Soft Clustering
Gal Bloch, Ariel Gera, Matan Orbach, Ohad Eytan, Assaf Toledo
https://arxiv.org/abs/2606.10896 https://mastoxiv.page/@arXiv_csLG_bot/116724924444449706
- Towards Autonomous Accelerator Design: FPGA Accelerator Generation with SECDA
Vinamra Sharma, Xingjian Fu, Jude Haris, Jos\'e Cano
https://arxiv.org/abs/2606.11117 https://mastoxiv.page/@arXiv_csAR_bot/116724770690893031
toXiv_bot_toot
Reconfigurable Antennas for Next-generation Mobile Communication Networks: A Comprehensive Survey and Tutorial
Yizhe Zhao, Long Zhang, Halvin Yang, Kun Yang, Rui Zhang, Lingyang Song, Yuanwei Liu
https://arxiv.org/abs/2606.12139 https://arxiv.org/pdf/2606.12139 https://arxiv.org/html/2606.12139
arXiv:2606.12139v1 Announce Type: new
Abstract: The transition to next-generation mobile communication networks, particularly 6G, demands advanced technologies to meet the requirements for ultra-reliable, low-latency communication, massive connectivity, and intelligent applications. Reconfigurable antennas (RAs) play a crucial role in achieving these objectives by enabling dynamic adjustments to the radio frequency (RF) characteristics of antennas, such as gain, radiation pattern, impedance, and polarization. Unlike traditional fixed-position antennas, RAs can alter both their radiation patterns and positions, offering flexibility in response to varying communication environments. This paper presents a comprehensive survey and tutorial on RAs, with a focus on fluid antennas (FAs), movable antennas (MAs), pinching antennas (PAs), and reconfigurable holographic antennas (RHAs), examining their potential in next-generation mobile networks. We explore the channel modelling and estimation, performance analysis, resource allocation strategies, and their synergy with other emerging wireless technologies for each type of RA. Finally, we provide a comparative analysis of different RAs and discuss the open challenges and future research directions, offering insights and guidance for future investigations in the exciting research area.
toXiv_bot_toot
The Simplified Stabilizer ZX-Calculus is Minimal
Harry K. Stoltz
https://arxiv.org/abs/2606.12383 https://arxiv.org/pdf/2606.12383 https://arxiv.org/html/2606.12383
arXiv:2606.12383v1 Announce Type: new
Abstract: The stabilizer fragment of the ZX calculus is amongst the most important fragments of the theory. The closely related Clifford T fragment is approximately universal (arXiv:1705.11151). Additionally, the stabilizer calculus can be described by a small collection of rewrites, most of which have been shown to be necessary (arXiv:1709.08903). However, two rules, describing the red/green compact-structure coincidence and the important bialgebra law, had not been shown to be necessary. We present a countermodel-style argument showing that both of these rules are individually necessary relative to the connectivity meta-rule of Backens--Perdrix--Wang (arXiv:1709.08903), and hence establish that the rule set presented in arXiv:1709.08903 has no redundant rewrite rule.
toXiv_bot_toot
Electron loss and target excitation in keV-energy proton collisions with B and C$^{ }$
N. W. Antonio, I. B. Abdurakhmanov, A. E. Gayosso, A. S. Kadyrov
https://arxiv.org/abs/2605.10669
Reducing Linguistic Hallucination in LM-Based Speech Enhancement via Noise-Invariant Acoustic-Semantic Distillation
Zheng Wang, Xiaobin Rong, Hang Su, Tianyi Tan, Junnan Wu, Lichun Fan, Zhenbo Luo, Jian Luan, Jing Lu
https://arxiv.org/abs/2605.08608 https://arxiv.org/pdf/2605.08608 https://arxiv.org/html/2605.08608
arXiv:2605.08608v1 Announce Type: new
Abstract: Language model (LM)-based speech enhancement (SE) can generate natural-sounding speech, but under severe noise it often suffers from unreliable conditioning, leading to perceptually plausible yet linguistically incorrect outputs. To address this issue, we propose L3-SE, a noise-invariant acoustic-semantic distillation framework for reducing linguistic hallucination in LM-based SE. The proposed method learns a noise-invariant conditioning encoder from noisy speech by jointly distilling two complementary clean-speech targets: an acoustic target for reconstruction fidelity and a semantic target for linguistic consistency. The resulting noise-invariant acoustic-semantic representations are used to condition a decoder-only autoregressive language model, which predicts clean acoustic tokens that are decoded into enhanced speech. To support high-quality generation, we further employ a high-fidelity codec built on learnable weighted WavLM layer representations as the discrete acoustic interface. By improving the reliability of conditioning under adverse conditions, the proposed framework substantially reduces hallucination and improves content faithfulness. Experiments show that the proposed method consistently outperforms prior LM-based speech enhancement baselines on linguistic consistency metrics, with especially clear gains under low-SNR and reverberant conditions, while maintaining competitive perceptual quality. Audio samples are available at https://max1wz.github.io/L3-SE-Demo-Page/. The complete source code will be released after the manuscript is accepted.
toXiv_bot_toot
Graphical Analysis of Lifted Product Code Constructions
Ragnar Freij-Hollanti, Kirsten D. Morris, Patricija \v{S}apokait\.e
https://arxiv.org/abs/2606.11987 https://arxiv.org/pdf/2606.11987 https://arxiv.org/html/2606.11987
arXiv:2606.11987v1 Announce Type: new
Abstract: Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.
toXiv_bot_toot
Fermions are fundamentally more nonlocal than Bosons
Fatemeh Moradi Kalarde, Sadra Boreiri, Xiangling Xu, Lucas Tendick, Salman Beigi, Paolo Perinotti, Tommaso Guaita, Marc-Olivier Renou
https://arxiv.org/abs/2606.12363 https://arxiv.org/pdf/2606.12363 https://arxiv.org/html/2606.12363
arXiv:2606.12363v1 Announce Type: new
Abstract: Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. Here we prove the analogous result within quantum theory itself: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. Our result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers - febits.
toXiv_bot_toot
STCC: A Unified Source-Channel Semantic Token Coding Framework for Semantic Communications
Zhicheng Bao, Chen Dong, Sen Wang, Long Liu, Nan Ma, Hao Chen, Xiaodong Xu, Yinqiu Liu, Ping Zhang
https://arxiv.org/abs/2606.11819 https://arxiv.org/pdf/2606.11819 https://arxiv.org/html/2606.11819
arXiv:2606.11819v1 Announce Type: new
Abstract: Deep Joint Source-Channel Coding (JSCC) has emerged as a promising paradigm for overcoming the ``cliff effect" in wireless communications. However, existing Deep JSCC frameworks operate directly on raw analog data such as image pixels rather than the discrete semantic tokens that foundation models require. Moreover, traditional systems employ fixed, hand-designed constellations that treat all tokens equally, leading to catastrophic random errors under channel noise. In this paper, the Semantic Token Codebook Communication (STCC) is proposed as a unified source-channel semantic token coding framework designed to transmit the discrete semantic tokens of foundation models over noisy channels. The core of STCC is the Semantic Token Codec (STC). It accepts discrete tokens as input, which maintains compatibility with foundation models while employing a residual multiple layer perceptron, i.e., MLP-based encoder that learns geometrically structured constellations optimized with a triple-loss objective. This learned mapping forces the channel topology to align with the semantic embedding space, ensuring that channel noise results in topological errors rather than random corruption. This phenomenon is theoretically and empirically characterized, identifying ``Semantic Drift" in symbolic modalities and ``Structural Distortion" in perceptual modalities, where errors shift predictions to semantically or structurally similar tokens. Extensive experiments demonstrate that STCC significantly outperforms traditional systems in low-SNR regimes, effectively converting channel noise into semantic variations without requiring receiver-side modification.
toXiv_bot_toot
Partitioned Iterative Quantum Scheduling of Satellites for Urgent Disaster Response: Case study of Wildfire
Lucas T. Braydwood, Taejin Park, Hirofumi Hashimoto, Zoe Gonzalez Izquierdo, Andrew Michaelis, Eleanor Rieffel, Shon Grabbe
https://arxiv.org/abs/2606.12310 https://arxiv.org/pdf/2606.12310 https://arxiv.org/html/2606.12310
arXiv:2606.12310v1 Announce Type: new
Abstract: The standard in Earth-observation tasks today is having near real-time access to surface images in response to changing conditions. For instance, as urban environments interface more with wildlands and wildfires become less predictable, their tracking with satellite resources becomes essential. This requires the coordination of increasingly large constellations of satellites, giving rise to challenging computational problems. With wildfire detection and tracking as a backdrop, we investigate the power of special purpose and novel computing paradigms to tackle the ensuing satellite scheduling problems, making a compelling case for quantum algorithms. We bring quantum scheduling algorithms closer to implementation by examining both the emerging iterative quantum algorithm framework, which comes with analytic guarantees compared to some classical algorithms, and distributed quantum computing methods whose relevance is on the rise as utility-scale problems begin to get solved with quantum computers. Drawing strength from several computing fronts, we develop a distributed/parallelization scheme in conjunction with the quantum algorithm design and apply these techniques to real-world datasets for wildfire detection. While our quantum subprocesses are currently too small to see significant quantum advantage, our results validate the utility of these techniques, and continue forging the path toward distributed quantum computing.
toXiv_bot_toot
SF-Flow: Sound field magnitude estimation via flow matching guided by sparse measurements
Ege Erdem, Shoichi Koyama, Tomohiko Nakamura, Orchisama Das, Zoran Cvetkovi\'c
https://arxiv.org/abs/2605.10398 https://arxiv.org/pdf/2605.10398 https://arxiv.org/html/2605.10398
arXiv:2605.10398v1 Announce Type: new
Abstract: Reconstructing a 3D sound field from sparse microphone measurements is a fundamental yet ill-posed problem, which we address through Acoustic Transfer Function (ATF) magnitude estimation. ATF magnitude encapsulates key perceptual and acoustic properties of a physical space with applications in room characterization and correction. Although recent generative paradigms such as Flow Matching (FM) have achieved state-of-the-art performance in speech and music generation, their potential in spatial audio remains underexplored. We propose a novel framework for 3D ATF magnitude reconstruction as a guided generation task, with a 3D U-Net conditioned by a permutation-invariant set encoder. This architecture enables reconstruction from an arbitrary number of sparse inputs while leveraging the stable and efficient training properties of FM. Experimental results demonstrate that SF-Flow achieves accurate reconstruction up to \SI{1}{kHz}, trains substantially faster than the autoencoder baseline, and improves significantly with dataset size.
toXiv_bot_toot
Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
Fernando Granha Jeronimo, Lenny Liu, Pranav Rajpal
Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Reference Quadrupole Moments of Transition Elements from Lamb Shifts in Muonic Atoms
S. Rathi, K. von Schoeler, P. Indelicato, B. Ohayon
Super-Link Fragility in Asymmetric W-Class States under Quantum Noise
Sougata Bhattacharyya, Fatih Ozaydin, Sovik Roy
https://arxiv.org/abs/2606.12307 https://arxiv.org/pdf/2606.12307 https://arxiv.org/html/2606.12307
arXiv:2606.12307v1 Announce Type: new
Abstract: The asymmetric three-qubit W-class state $|\overline{W_3^L}\rangle$ defines an isosceles entanglement-network geometry, (a) two vertex-base (VB) links form stronger bipartite connections, (b) while the base-base (BB) link is weaker. This suggests that concentrating entanglement into a super-link may be advantageous for quantum-network tasks. Here, we show that this intuition is incomplete. We analytically compare the bipartite concurrence dynamics of the symmetric |W> state and the asymmetric $|\overline{W_3^L}\rangle$ state, which differ both in entanglement-network geometry and excitation sector under standard noise models. In the absence of noise, the concurrence hierarchy is C_{VB} > C_W > C_{BB}$. Under phase damping, this hierarchy is preserved for all noise strengths and no entanglement sudden death occurs. Under amplitude damping, however, the hierarchy is reordered. The symmetric |W> state becomes the most robust, while the base-base concurrence of $|\overline{W_3^L}\rangle$ vanishes at the finite threshold of parameter $\gamma$. We term this reordering as the \textit{Super-Link Fragility Effect}. The same structural asymmetry that produces a stronger vertex-base link also makes it more vulnerable to energy dissipation when coupled with multi-excitation amplitudes. Under depolarization, the asymmetry advantage is erased, with $C_W$ and $C_{VB}$ sharing the same sudden-death threshold for some value of the parameter p, while $C_{BB}$ disappears earlier at some other value of the parameter p. The generalized amplitude damping channel continuously connects the damping-dominated regime to the pure-excitation limit, where the initial hierarchy is restored. These results show that entanglement robustness in $W$-class resources is controlled not by initial concurrence alone, but by the joint structure of entanglement-network geometry, excitation sector, and noise symmetry.
toXiv_bot_toot
PoDAR: Power-Disentangled Audio Representation for Generative Modeling
Alejandro Luebs, Mithilesh Vaidya, Ishaan Kumar, Sumukh Badam, Stephen W. Bailey, Matthew Bendel, Jose Sotelo, Xingzhe He
https://arxiv.org/abs/2605.10084 https://arxiv.org/pdf/2605.10084 https://arxiv.org/html/2605.10084
arXiv:2605.10084v1 Announce Type: new
Abstract: The performance of audio latent diffusion models is primarily governed by generator expressivity and the modelability of the underlying latent space. While recent research has focused primarily on the former, as well as improving the reconstruction fidelity of audio codecs, we demonstrate that latent modelability can be significantly improved through explicit factor disentanglement. We present PoDAR (Power-Disentangled Audio Representation), a framework that utilizes a randomized power augmentation and latent consistency objective to decouple signal power from invariant semantic content. This factorization makes the latent space easier to model, which both accelerates the convergence of downstream generative models and improves final overall performance. When applied to a Stable Audio 1.0 VAE with an F5-TTS generator, PoDAR achieves about a $2\times$ acceleration in convergence to match baseline performance, while increasing final speaker similarity by 0.055 and UTMOS by 0.22 on the LibriSpeech-PC dataset. Furthermore, isolating power into dedicated channels enables the application of CFG exclusively to power-invariant content, effectively extending the stable guidance regime to higher scales.
toXiv_bot_toot
Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[2/2]:
- What Limits Does Quantization Place on Dense Top-$k$ Retrieval? A Theoretical Study
Koki Okajima, Tsukasa Yoshida
Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Tensor-Network-Based Distributed Quantum Dynamics on Independent Quantum Computers
Dwivedi, Revelle, Lobser, McFarland, Tortorici, Yale, Clark, Richerme, Iyengar
An iterative Ising decoder for quantum error correction codes
Yuanqi Liu, Weilei Zeng, Peixiang Li, Yantong Liu, Guangyao Huang, Yingwen Liu, Dongyang Wang, Junjie Wu, Lingling Lao
https://arxiv.org/abs/2606.12301 https://arxiv.org/pdf/2606.12301 https://arxiv.org/html/2606.12301
arXiv:2606.12301v1 Announce Type: new
Abstract: The Ising framework maps the decoding problem in quantum error correction onto ground-state optimization of a classical Hamiltonian, in which $X$-$Z$ error correlations enter as cross terms. Under phenomenological depolarizing noise, the exact joint formulation contains up to 8-body interactions for the toric code and 10-body for the $6.6.6$ color code. These high-order terms degrade solver convergence, inflate runtime, and raise the auxiliary spin overhead when embedding into native 2-body Ising hardware. In this work, we propose the iterative low-order decoding (ILOD) algorithm, which alternates between $X$- and $Z$-type sub-Hamiltonians, approximating cross-type correlations through Bayesian priors that reweight each type's couplings using the other type's inferred error configuration. This halves the maximum body count of interaction terms in the Hamiltonian, accelerating the solver, restoring convergence at larger code distances, and reducing the total spin count for 2-body embedding by a factor of $2.5$. For the toric code, ILOD attains a threshold of $4.73%$ versus $4.83%$ for the joint formulation, with the empirical runtime ratio scaling as $(0.81)^d$. For the $6.6.6$ color code, their thresholds agree within statistical uncertainty for small code distances, and ILOD remains convergent for larger distances where the joint formulation fails to converge despite a larger annealing budget.
toXiv_bot_toot
Single-Microphone Audio Point Source Discriminative Localization From Reverberation Late Tail Estimation
Matthew Maciejewski
https://arxiv.org/abs/2605.09627 https://arxiv.org/pdf/2605.09627 https://arxiv.org/html/2605.09627
arXiv:2605.09627v1 Announce Type: new
Abstract: Location information can be a valuable signal for audio segmentation tasks, especially as a complement to methods focusing on the content or qualities of the sources. Though audio source localization is typically performed using the observations of the signal captured by multiple microphones in space, information about a source's location is captured by a single microphone through its arrival time and spectral amplitude--given the source's emitted signal is known. Since reverberation originates from the audio sources in a room, it accordingly contains some information about the emitted audio signals. The late-tail part of reverberation is relatively invariant to the local source and microphone geometry, depending primarily on only the room itself, and thus can provide the necessary reference information about audio signals that depends minimally on their location. In this work, we leverage the robust late-tail estimation of Weighted Prediction Error (WPE) dereverberation within a probabilistic framework to estimate the likelihood of two audio signals collected in the same room as having originated from the same location. We demonstrate the effectiveness of our approach on the speaker diarization task in both simulated and real environments.
toXiv_bot_toot
Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/2]:
- Homomorphic Quantum Error Correction
Kornikar Sen, Miguel A. Martin-Delgado
http…
Multipartite reference-frame-independent quantum cryptographic communication
Donghwa Lee, Kyujin Shin, Hyang-Tag Lim, Yosep Kim, Yong-Su Kim
https://arxiv.org/abs/2606.12284 https://arxiv.org/pdf/2606.12284 https://arxiv.org/html/2606.12284
arXiv:2606.12284v1 Announce Type: new
Abstract: Reference frame mismatch among communication parties introduces errors in quantum cryptographic protocols. As the number of participants increases, aligning reference frames becomes increasingly difficult, complicating multipartite quantum cryptographic implementations. Here, we theoretically and experimentally investigate multipartite reference-frame-independent (RFI) quantum cryptographic communication using Greenberger-Horne-Zeilinger (GHZ) states. We generalize the bipartite RFI security parameter $C$ to an $N$-party parameter $C_N$ and derive the asymptotic secret key rate expressed solely in terms of experimentally accessible quantities. We analyze the key rate under global and local depolarizing noise models and find that increasing the number of parties $N$ enhances robustness against global depolarizing noise while increasing vulnerability to local channel noise. We also present a proof-of-principle experimental demonstration of four-party RFI quantum cryptographic communication using four-photon GHZ states, confirming the reference-frame invariance of both the $C_4$ parameter and the secret key rate under various reference frame rotations.
toXiv_bot_toot
RADAR Challenge 2026: Robust Audio Deepfake Recognition under Media Transformations
Hieu-Thi Luong, Xuechen Liu, Ivan Kukanov, Zheng Xin Chai, Kong Aik Lee
https://arxiv.org/abs/2605.09568 https://arxiv.org/pdf/2605.09568 https://arxiv.org/html/2605.09568
arXiv:2605.09568v1 Announce Type: new
Abstract: RADAR Challenge 2026 is an APSIPA Grand Challenge on Robust Audio Deepfake Recognition under Media Transformations, designed to simulate realistic media conditions in real-world audio distribution pipelines, including compression, resampling, noise, and reverberation. It consists of two phases: an English development phase with labeled data for analysis and paper writing, and a multilingual evaluation phase containing more than 100,000 utterances in English, Singapore English, Mandarin Chinese, Taiwanese Mandarin, Japanese, and Vietnamese. Systems are evaluated using equal error rate (EER) for binary real/fake classification. This paper describes the challenge task, the construction of the data set, the evaluation protocol, and the overall results. During the challenge, 33 teams submitted to the development phase and 22 teams submitted to the final evaluation phase. The reported results highlight the remaining challenges of robust audio deepfake detection under multilingual and media-transformed conditions.
toXiv_bot_toot
Reconfigurable Antennas for Next-generation Mobile Communication Networks: A Comprehensive Survey and Tutorial
Yizhe Zhao, Long Zhang, Halvin Yang, Kun Yang, Rui Zhang, Lingyang Song, Yuanwei Liu
https://arxiv.org/abs/2606.12139
Time-Frequency Grid States for Reconstruction and Correction of Channel-Induced Distortion in Entangled Photons
Siang-Yun Liu, Bo-Ren Huang, Zhi-Xuan Zen, Yen-Hung Chen, Pin-Ju Tsai
https://arxiv.org/abs/2606.12216 https://arxiv.org/pdf/2606.12216 https://arxiv.org/html/2606.12216
arXiv:2606.12216v1 Announce Type: new
Abstract: Characterization of time-frequency (TF) quantum states requires reliable reconstruction of their TF distributions. However, imperfect transmission or measurement channels can distort reconstructed joint spectral intensities (JSIs), especially when the underlying perturbation mechanism is unknown. Here, we experimentally demonstrate a reconstruction and correction framework that uses a TF grid state as an intrinsic frequency-domain reference. By analyzing the displacement of the grid points, a Gaussian process regression model is employed to reconstruct a correction mapping for the nonlinear coordinate deformation without assuming a prior physical model of the distortion. The learned mapping reduces the residual coordinate deviation of the TF grid state by approximately a factor of 11 and, when applied to an independent frequency-entangled test state, improves the Gaussian-shape fidelity from 76.2\% to 90.0\%. These results establish TF grid states as practical metrological resources for diagnosing and correcting distortions in TF quantum systems, providing a pathway toward distortion-resilient quantum communication and high-dimensional quantum information processing.
toXiv_bot_toot
Evaluating the Expressive Appropriateness of Speech in Rich Contexts
Tianrui Wang, Ziyang Ma, Yizhou Peng, Haoyu Wang, Zhikang Niu, Zikang Huang, Yihao Wu, Yi-Wen Chao, Yu Jiang, Yuheng Lu, Guanrou Yang, Xuanchen Li, Hexin Liu, Chunyu Qiang, Cheng Gong, Yifan Yang, Tianchi Liu, Junyu Wang, Nana Hou, Meng Ge, Fuming You, Wei Yang, Zhongqian Sun, Haifeng Hu, Xiaobao Wang, Eng Siong Chng, Xie Chen, Longbiao Wang, Jianwu Dang
https://arxiv.org/abs/2605.09413 https://arxiv.org/pdf/2605.09413 https://arxiv.org/html/2605.09413
arXiv:2605.09413v1 Announce Type: new
Abstract: Evaluating expressive speech remains challenging, as existing methods mainly assess emotional intensity and overlook whether a speech sample is expressively appropriate for its contextual setting. This limitation hinders reliable evaluation of speech systems used in narrative-driven and interactive applications, such as audiobooks and conversational agents. We introduce CEAEval, a Context-rich framework for Evaluating Expressive Appropriateness in speech, which assesses whether a speech sample expressively aligns with the underlying communicative intent implied by its discourse-level narrative context. To support this task, we construct CEAEval-D, the first context-rich speech dataset with real human performances in Mandarin conversational speech, providing narrative descriptions together with fifteen dimensions of human annotations covering expressive attributes and expressive appropriateness. We further develop CEAEval-M, a model that integrates knowledge distillation, planner-based multi-model collaboration, adaptive audio attention bias, and reinforcement learning to perform context-rich expressive appropriateness evaluation. Experiments on a human-annotated test set demonstrate that CEAEval-M substantially outperforms existing speech evaluation and analysis systems.
toXiv_bot_toot
Graphical Analysis of Lifted Product Code Constructions
Ragnar Freij-Hollanti, Kirsten D. Morris, Patricija \v{S}apokait\.e
https://arxiv.org/abs/2606.11987 https://
Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning
Jeongho Bang, Kyoungho Cho, Jeongwoo Jae
https://arxiv.org/abs/2606.12211 https://arxiv.org/pdf/2606.12211 https://arxiv.org/html/2606.12211
arXiv:2606.12211v1 Announce Type: new
Abstract: A central principle in quantum machine learning is that an ansatz should be expressive enough to represent the quantum data of interest. Yet, the expressibility is statistically meaningful only insofar as it can be learned from finitely many copies of an unknown quantum state. In this work, we develop an information-theoretic Occam theory for quantum data generated by finite-size quantum circuits. For the class $S_{n,G}$ of $n$-qubit pure states preparable with at most $G$ two-qubit gates, a metric-entropy argument gives the realizable sample law $\widetilde{\Theta}(G/\epsilon^2)$ in the circuit-limited regime. For an arbitrary source $\hat{\rho}$, we introduce the best $G$-gate approximation error $d_G(\hat{\rho})$ and the approximate circuit complexity $C_\eta(\hat{\rho})$. We prove an agnostic quantum Occam theorem: with $M$ copies, one can learn up to the best $G$-gate approximation error plus a statistical penalty $\widetilde{O}(\sqrt{G/M})$. We then remove the need to know $G$ in advance through an adaptive model-selection theorem whose oracle inequality selects the circuit complexity justified by the data. Matching lower bounds yield a sample-supported expressibility law: at trace-distance accuracy $\epsilon$, $M$ samples can support only $G_{\rm supported} \simeq M\epsilon^2$ gates, up to logarithmic factors and tomography saturation at $2^n$. Thus, the circuit complexity becomes an adaptive statistical resource rather than a static promise. Our framework turns bounded circuit complexity into a model-selection principle for quantum machine learning.
toXiv_bot_toot
Latent Secret Spin: Keyed Orthogonal Rotations for Blind Speech Watermarking in Anisotropic Latent Spaces
Emma Coletta, Massimiliano Todisco, Michele Panariello, Antonio Faonio, Nicholas Evans
https://arxiv.org/abs/2605.08431 https://arxiv.org/pdf/2605.08431 https://arxiv.org/html/2605.08431
arXiv:2605.08431v1 Announce Type: new
Abstract: We introduce Latent Secret Spin (LSS), a blind speech watermarking method based on geometric operations in codec latent space. Based upon orthogonal rotations to principal components, LSS induces imperceptible but detectable covariance signatures according to a pseudo-random watermarking schedule. The scheme generalises across datasets, preserves perceptual quality and, unlike some learned, neural watermarking schemes, it does not require neural network training, is resistant to common signal manipulations and is flexible to payload size. Analyses show that structured latent-space watermarking is a promising and interpretable alternative to existing approaches.
toXiv_bot_toot
STCC: A Unified Source-Channel Semantic Token Coding Framework for Semantic Communications
Zhicheng Bao, Chen Dong, Sen Wang, Long Liu, Nan Ma, Hao Chen, Xiaodong Xu, Yinqiu Liu, Ping Zhang
https://arxiv.org/abs/2606.11819
On-Chip Quantum Randomness Amplification
Lang Li, Yutian Wu, Giulio Chiribella, Ravishankar Ramanathan
https://arxiv.org/abs/2606.12173 https://arxiv.org/pdf/2606.12173 https://arxiv.org/html/2606.12173
arXiv:2606.12173v1 Announce Type: new
Abstract: Randomness amplification, the task of extracting uniform private bits from biased seeds that may be partly known by a malicious third party, is of central importance in cryptography. The highest security in this task is provided by a class of quantum protocols known as device-independent, which however are challenging to integrate into scalable devices. Semi-device-independent (SDI) protocols are a promising alternative that guarantees security under few natural assumptions, such as bounds on the amount of energy used by the devices. Here, we provide the first demonstration of SDI randomness amplification on an integrated silicon photonic chip, achieving a throughput rate of 20 Mbps suitable for practical applications. This rate is achieved through a novel technique for SDI entropy certification, which delivers strictly tighter von Neumann entropy bounds compared to existing methods and remains valid even if the preparation and measurement devices share quantum correlations. Overall, the methods developed in this work enable the integration of SDI technology into portable telecom devices, opening up a new generation of quantum cryptographic hardware.
toXiv_bot_toot
DiffVQE: Hybrid Diffusion Voice Quality Enhancement Under Acoustic Echo and Noise
Haljan Lugo Girao, Ernst Seidel, Pejman Mowlaee, Ziyue Zhao, Tim Fingscheidt
https://arxiv.org/abs/2605.08189 https://arxiv.org/pdf/2605.08189 https://arxiv.org/html/2605.08189
arXiv:2605.08189v1 Announce Type: new
Abstract: Acoustic echo and background noise pose challenges on speech enhancement in hands-free systems and speakerphones. Discriminatively trained end-to-end methods represent a powerful solution for joint acoustic echo control (AEC) and denoising. However, with the advent of generative methods, diffusion-based approaches have seen remarkable performance in speech enhancement tasks. In this work, to the best of our knowledge, we provide the first (still non-causal) diffusion-based AEC model (DiffVQE) that is reproducible in terms of topology, training data, and training framework. So far, without employing diffusion, Microsoft's discriminative DeepVQE model has been shown to excel any of the ICASSP 2023 AEC Challenge entries achieving remarkable performance. Using data from the Interspeech 2025 URGENT Challenge for a diverse, high-quality training dataset, our DiffVQE excels DeepVQE both in echo and noise control performance, as well as in computational complexity and model size.
toXiv_bot_toot
Quantum ergodicity and semiclassical measures: mathematical results
St\'ephane Nonnenmacher
https://arxiv.org/abs/2606.12098 https://arxiv.org/pdf/2606.12098 https://arxiv.org/html/2606.12098
arXiv:2606.12098v1 Announce Type: new
Abstract: In this chapter we review some results describing the high-frequency eigenmodes of the Laplacian on compact manifolds, or Euclidean domains, for which the geodesic flow is chaotic. We focus on the macroscopic distribution of these eigenmodes, which is described by the concept of semiclassical measure. The main result on the question is the Quantum Ergodicity theorem, originally due to Schnirelman. We provide the detailed proof of this theorem, including the adjustments necessary to treat the case of manifolds with boundary. We also discuss the Quantum Unique Ergodicity conjecture, and some progress towards this conjecture for strongly chaotic (Anosov) systems. In particular, we describe the constraints on admissible semiclassical measures, in terms of their Kolmogorov-Sinai entropy, as well as more recent delocalization results.
toXiv_bot_toot
Rethinking Entropy Minimization in Test-Time Adaptation for Autoregressive Models
Wei-Ping Huang, Chee-En Yu, Guan-Ting Lin, Hung-yi Lee
https://arxiv.org/abs/2605.08186 https://arxiv.org/pdf/2605.08186 https://arxiv.org/html/2605.08186
arXiv:2605.08186v1 Announce Type: new
Abstract: Test-Time Adaptation (TTA) via entropy minimization (EM) has proven effective for classification tasks, yet its application to generative autoregressive models remains theoretically fragmented. Existing approaches typically rely on distinct heuristics, such as teacher forcing with pseudo labels or policy-gradient-based reinforcement learning, without a unified mathematical foundation. In this work, we resolve this discrepancy by deriving a rigorous formulation of EM tailored to autoregressive models. We show that the exact objective naturally decomposes into a token-level policy gradient loss and a token-level entropy loss, and we reinterpret prior methods as partial realizations of this unified formulation. Using Whisper ASR as a testbed, we demonstrate that our approach consistently improves performance across more than 20 diverse domains, including acoustic noise, accents, and multilingual settings.
toXiv_bot_toot
Necessary and Sufficient Conditions for Universal Gates with Pauli Strings and Beyond
Isaac D. Smith, Hans J. Briegel, Hendrik Poulsen Nautrup
https://arxiv.org/abs/2606.12096 https://arxiv.org/pdf/2606.12096 https://arxiv.org/html/2606.12096
arXiv:2606.12096v1 Announce Type: new
Abstract: Any quantum computation consists of a sequence of unitary evolutions described by a finite set of Hamiltonians. For the case where this set consists of only products of Pauli operators, known as Pauli strings, we provide a necessary and sufficient condition for it to generate $\mathfrak{su}(2^n)$, i.e., to be universal for quantum computation on $n$ qubits. When combining Pauli strings with a general Hamiltonian, we show a sufficient (and in certain circumstances even necessary) condition for universality based on the Pauli-basis expansion of the Hamiltonian. As an application of these results, we prove two corollaries: (i) a necessary and sufficient condition for the universality of a general Hamiltonian given arbitrary single-qubit control on all qubits, and (ii) the universality of an XYZ Heisenberg Hamiltonian with local control of just two adjacent qubits.
toXiv_bot_toot
@arXiv_mathSP_bot@mastoxiv.page
