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 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
Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[5/5]:
- Energy-Modulated Time-Asymmetric Spontaneous Collapse: Forward-Backward Dynamics from Stochastic ...
Ikechukwu C. Okoro, Mike O. Osiele, Godfrey E. Akpojotor
https://arxiv.org/abs/2606.06452 https://mastoxiv.page/@arXiv_quantph_bot/116696558215965415
- Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant
Bartlomiej Czech, Yichen Feng, Xianlai Wu, Minjun Xie
https://arxiv.org/abs/2606.06582 https://mastoxiv.page/@arXiv_quantph_bot/116713369377389218
- JGRA: Jacobian Geometry Robustness Assessment in NISQ Noise-Aware Quantum Neural Networks
Gianluca Scanu, Luca Barletta, Stefano Rini
https://arxiv.org/abs/2606.09964 https://mastoxiv.page/@arXiv_quantph_bot/116724737493129996
- Towards the implementation of a quantum classifier
Lorenzo Confalonieri
https://arxiv.org/abs/2606.10150 https://mastoxiv.page/@arXiv_quantph_bot/116724826333574245
- Classical representation of the dynamics of quantum spin chains
Tony Jin
https://arxiv.org/abs/2502.10502 https://mastoxiv.page/@arXiv_condmatstatmech_bot/114023643712493871
- A Physics-Inspired Optimizer: Velocity Regularized Adam
Pranav Vaidhyanathan, Lucas Schorling, Natalia Ares, Maike Osborne
https://arxiv.org/abs/2505.13196 https://mastoxiv.page/@arXiv_csLG_bot/114539123804911573
- TensorKit.jl: A Julia package for large-scale tensor computations, with a hint of category theory
Lukas Devos, Jutho Haegeman
https://arxiv.org/abs/2508.10076 https://mastoxiv.page/@arXiv_csMS_bot/115031801387098178
- Magneto-Optical Trapping of a Metal Hydride Molecule
Jinyu Dai, Benjamin Riley, Qi Sun, Debayan Mitra, Tanya Zelevinsky
https://arxiv.org/abs/2512.22350 https://mastoxiv.page/@arXiv_physicsatomph_bot/115807661192131547
- Integrable Massless and Massive Fermions
Zhao Zhang
https://arxiv.org/abs/2603.11172 https://mastoxiv.page/@arXiv_nlinSI_bot/116220764978246106
- Holographic Complexity, Extremality, and Cosmic Censorship
Fuat Berkin Altunkaynak
https://arxiv.org/abs/2604.20170 https://mastoxiv.page/@arXiv_hepth_bot/116453018510714885
- Strong-field control of the $Z$-boson resonance in $e^ e^-$ collisions
Fengye Chen, Qingzheng Lv, Libin Fu
https://arxiv.org/abs/2606.09394 https://mastoxiv.page/@arXiv_hepph_bot/116719301448440291
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
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
This account turns out to possibly not be a bot but I don't know that this is the vibes we want either.
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
Crosslisted article(s) found for eess.AS. https://arxiv.org/list/eess.AS/new
[1/1]:
- ShipEcho -- An Interactive Tool for Global Mapping of Underwater Radiated Noise from Vessels
Mark Shipton, Valentino Denona, {\DJ}ula Na{\dj}, Roee Diamant
https://arxiv.org/abs/2605.08194 https://mastoxiv.page/@arXiv_csSD_bot/116560461888286028
- Bangla-WhisperDiar: Fine-Tuning Whisper and PyAnnote for Bangla Long-Form Speech Recognition and ...
Bhuiyan, Adib, Bhuiyan, Chakraborty, Saswato, Dhrubo, Khan
https://arxiv.org/abs/2605.08214 https://mastoxiv.page/@arXiv_csSD_bot/116560470901569776
- Dolphin-CN-Dialect: Where Chinese Dialects Matter
Meng, Zhong, Lin, Wang, Du, Shao, Huang, Li, Zhang
https://arxiv.org/abs/2605.08961
- How Should LLMs Listen While Speaking? A Study of User-Stream Routing in Full-Duplex Spoken Dialogue
Hui Lu, Xueyuan Chen, Huimeng Wang, Shuhai Peng, Shiyin Kang, Xixin Wu, Zhiyong Wu
https://arxiv.org/abs/2605.10199
- Polyphonia: Zero-Shot Timbre Transfer in Polyphonic Music with Acoustic-Informed Attention Calibr...
Haowen Li, Tianxiang Li, Yi Yang, Boyu Cao, Qi Liu
https://arxiv.org/abs/2605.10203 https://mastoxiv.page/@arXiv_csSD_bot/116560575501371296
- Probing Cross-modal Information Hubs in Audio-Visual LLMs
Jihoo Jung, Chaeyoung Jung, Ji-Hoon Kim, Joon Son Chung
https://arxiv.org/abs/2605.10815 https://mastoxiv.page/@arXiv_csAI_bot/116560938059845601
toXiv_bot_toot
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
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
Wir haben seit über einer Woche kein Internet und in Schrödingers Ticketsystem gleichzeitig kein Ticket und ein Ticket offen. Darf ich schon was anzünden? 🔥
EpsteinWiki is a collaborative research archive dedicated to documenting the evidence surrounding the Jeffrey Epsteintrafficking network.
Critical records remain scattered across court filings, depositions,
FOIA releases, investigative reporting, and government archives.
Our goal is to bring this material together in one organized, searchable knowledge base.
Every page is built on verifiable sources such as court records,
law-enforcement documents, and establishe…
[2026-05-12 Tue (UTC), 1 new article found for nlin.CD Chaotic Dynamics]
toXiv_bot_toot
[2026-06-12 Fri (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot
Periodic reminder for people interested in #HomeLab
There is a @… bot that replaces the old gup.pe homelab bot.
Mention it in your homelab posts and it will boost them. Follow it to see all the homelab posts it boosts that may not normally get federated to your instance.
For those who don’t know, these bots exist because when you look for a a hashtag, your server only checks the posts that have been federated to it.
In order for a message to be federated to your server, the author (or one of the people boosting it) have to be followed by someone on your server. If no one touching the message is being followed, it’ll never get federated to your server and you won’t see it.
Hashtags are great for finding messages, but only messages that were federated to your server. They don’t help message propagation.
Mar-a-Lardo
bot by @…
No laws were broken in the making of this bot: cancel the hit squad.
#satire #potus45
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
Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[2/5]:
- Circulators Based on Coupled Quantum Anomalous Hall Insulators and Resonators
Martinez, Du, Materise, Kelley, Wu, Qiu, Wang, Carosi, Low, Qu
https://arxiv.org/abs/2505.07770 https://mastoxiv.page/@arXiv_quantph_bot/114499402132949744
- Exploring Variational Entanglement Hamiltonians
Yanick S. Kind, Benedikt Fauseweh
https://arxiv.org/abs/2505.10530 https://mastoxiv.page/@arXiv_quantph_bot/114516362785924251
- Measurement incompatibility and quantum steering via linear programming
Lucas E. A. Porto, S\'ebastien Designolle, Sebastian Pokutta, Marco T\'ulio Quintino
https://arxiv.org/abs/2506.03045 https://mastoxiv.page/@arXiv_quantph_bot/114624014870760930
- Permutation-Invariant N-body gates via Tavis-Cummings Hamiltonian
Plato Deliyannis, Iman Marvian
https://arxiv.org/abs/2506.03453 https://mastoxiv.page/@arXiv_quantph_bot/114629606806000870
- Entanglement preservation and Clauser-Horne nonlocality in electromagnetically induced transparen...
Po-Han Tseng, Yong-Fan Chen
https://arxiv.org/abs/2507.15453 https://mastoxiv.page/@arXiv_quantph_bot/114896757767794704
- Probing Quantum States over Spacetime Through Interferometry
Seok Hyung Lie, Hyukjoon Kwon
https://arxiv.org/abs/2507.19258 https://mastoxiv.page/@arXiv_quantph_bot/114930259148851240
- Power-law-graded Ising Interactions Stabilize Time Crystals Realizing Quantum Energy Storage and ...
Ayan Sahoo, Debraj Rakshit
https://arxiv.org/abs/2508.14847 https://mastoxiv.page/@arXiv_quantph_bot/115066206295602327
- Global vs. Local Discrimination of Locally Implementable Multipartite Unitaries
Satyaki Manna, Sneha Suresh, Anandamay Das Bhowmik, Debashis Saha
https://arxiv.org/abs/2509.10430 https://mastoxiv.page/@arXiv_quantph_bot/115207718939593834
- Dynamically Optimal Unraveling Schemes for Simulating Lindblad Equations
Yu Cao, Mingfeng He, Xiantao Li
https://arxiv.org/abs/2509.19887 https://mastoxiv.page/@arXiv_quantph_bot/115264400431468710
- Unifying Quantum Smoothing Theories with Extended Retrodiction
Mingxuan Liu, Ge Bai, Valerio Scarani
https://arxiv.org/abs/2510.08447 https://mastoxiv.page/@arXiv_quantph_bot/115349575384493718
- Emergent Bell Phase in an Electro-Nanomechanical Quantum Simulator
David Ullrich, Marta Cagetti, Stefan Forstner, Adrian Bachtold, Anna Sanpera
https://arxiv.org/abs/2511.02613 https://mastoxiv.page/@arXiv_quantph_bot/115496584430689976
toXiv_bot_toot
Crosslisted article(s) found for math.SP. https://arxiv.org/list/math.SP/new
[1/1]:
- A mathematical study of periodic band inversion
Tyler Guo, Maciej Zworski
https://arxiv.org/abs/2605.08481 https://mastoxiv.page/@arXiv_mathph_bot/116560523398665170
- Weyl asymptotic formulas in the nilpotent Lie group setting
Shiqi Liu, Edward McDonald, Fedor Sukochev, Dmitriy Zanin
https://arxiv.org/abs/2605.09306 https://mastoxiv.page/@arXiv_mathFA_bot/116560546402586857
toXiv_bot_toot
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
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 quant-ph. https://arxiv.org/list/quant-ph/new
[1/5]:
- Tight Bounds for Quantum Phase Estimation and Related Problems
Nikhil S. Mande, Ronald de Wolf
https://arxiv.org/abs/2305.04908 https://mastoxiv.page/@arXiv_quantph_bot/110337460439591382
- Quantum thermodynamics of the Caldeira-Leggett model with non-equilibrium Gaussian reservoirs
Vasco Cavina, Massimiliano Esposito
https://arxiv.org/abs/2405.00215 https://mastoxiv.page/@arXiv_quantph_bot/112370293649586776
- A quantum implementation of high-order power method for estimating geometric entanglement of pure...
Andrii Semenov, Niall Murphy, Simone Patscheider, Alessandra Bernardi, Elena Blokhina
https://arxiv.org/abs/2405.19134 https://mastoxiv.page/@arXiv_quantph_bot/112528797708787049
- Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
Yu Cao, Shi Jin, Nana Liu
https://arxiv.org/abs/2411.03180 https://mastoxiv.page/@arXiv_quantph_bot/113435338816776896
- Mixed-State Topological Order under Coherent Noise
Seunghun Lee, Eun-Gook Moon
https://arxiv.org/abs/2411.03441 https://mastoxiv.page/@arXiv_quantph_bot/113440883864687961
- Quest for quantum advantage: Monte Carlo wave-function simulations of the Coherent Ising Machine
Manushan Thenabadu, Run Yan Teh, Jia Wang, Simon Kiesewetter, Margaret D Reid, Peter D Drummond
https://arxiv.org/abs/2501.02681 https://mastoxiv.page/@arXiv_quantph_bot/113786139350946567
- Honest-binding quantum bit commitment from separable operations
Ziad Chaoui, Anna Pappa, Matteo Rosati
https://arxiv.org/abs/2501.07351 https://mastoxiv.page/@arXiv_quantph_bot/113825499573295523
- Expressivity of Quantum Reservoir Computers
Sch\"utte, G\"otting, M\"untinga, List, Brunner, Gies
https://arxiv.org/abs/2501.15528 https://mastoxiv.page/@arXiv_quantph_bot/113904787967762788
- Additivity and chain rules for quantum entropies via multi-index Schatten norms
Omar Fawzi, Jan Kochanowski, Cambyse Rouz\'e, Thomas Van Himbeeck
https://arxiv.org/abs/2502.01611 https://mastoxiv.page/@arXiv_quantph_bot/113944408733032864
- On the Addressability Problem on CSS Codes
J\'er\^ome Guyot, Samuel Jaques
https://arxiv.org/abs/2502.13889 https://mastoxiv.page/@arXiv_quantph_bot/114035128180919513
- Robust Mixed-State Cluster States and Spurious Topological Entanglement Negativity
Seunghun Lee, Eun-Gook Moon
https://arxiv.org/abs/2504.16165 https://mastoxiv.page/@arXiv_quantph_bot/114391788348136547
toXiv_bot_toot
[2026-05-11 Mon (UTC), no new articles found for nlin.CD Chaotic Dynamics]
toXiv_bot_toot
[2026-06-11 Thu (UTC), no new articles found for nlin.CG Cellular Automata and Lattice Gases]
toXiv_bot_toot
Scooby Coup
bot by @…
No laws were broken in the making of this bot: no investigating me please.
#satire #potus45
Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[3/5]:
- Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
Chinonso Onah, Kristel Michielsen
https://arxiv.org/abs/2511.17259 https://mastoxiv.page/@arXiv_quantph_bot/115604063563298977
- Sharing quantum indistinguishability with multiple parties
Lemieux Wang, Hanwool Lee, Joonwoo Bae, Kieran Flatt
https://arxiv.org/abs/2512.15199 https://mastoxiv.page/@arXiv_quantph_bot/115740075668663194
- Quantum thermodynamics, quantum correlations and quantum coherence in accelerating Unruh-DeWitt d...
Bachain, Amazioug, Laamara, Nisar, Zakarya, Ismail, Abdel-Aty
https://arxiv.org/abs/2512.18123 https://mastoxiv.page/@arXiv_quantph_bot/115768302468735679
- Wigner Cat Phases: A finely tunable system for exploring the transition to quantum chaos
M. S\"uzen
https://arxiv.org/abs/2512.22169 https://mastoxiv.page/@arXiv_quantph_bot/115807528778934437
- A saturation-absorption rubidium magnetometer with multilevel optical Bloch-equation modeling for...
Dangi, Gupta, Kasti, Vishwanath, Zepp, Smith, Geiger, Choy
https://arxiv.org/abs/2601.09115 https://mastoxiv.page/@arXiv_quantph_bot/115898368405478505
- Quantum Entanglement, Stratified Spaces, and Topological Matter: Towards Entanglement-Sensitive L...
Kazuki Ikeda, Steven Rayan
https://arxiv.org/abs/2601.13467 https://mastoxiv.page/@arXiv_quantph_bot/115933232875600453
- Residual-Squeezing Mechanism of Mismatch in Inverse-Squeezing Kennedy Receivers
Bai, Sun, Wu, Ran, Zhou, Zhang, Peng, Dong, Tong, Zhang, Li
https://arxiv.org/abs/2601.19093 https://mastoxiv.page/@arXiv_quantph_bot/115972142241455241
- Recirculating Quantum Photonic Networks for Fast Deterministic Quantum Information Processing
Emil Grovn, Matias Bundgaard-Nielsen, Jesper M{\o}rk, Dirk Englund, Mikkel Heuck
https://arxiv.org/abs/2602.11033 https://mastoxiv.page/@arXiv_quantph_bot/116057137426725312
- Coupled integrated photonic quantum memristors using a single photon source made of a colour center
Baldazzi, Ancel, Guaraldo, Fattori, Chen, Akar, Deturche, Azzini, Couteau, Pavesi
https://arxiv.org/abs/2602.14736 https://mastoxiv.page/@arXiv_quantph_bot/116085940182705111
- Generating function and Bloch representation for quantum Fisher tensor
Felipe P. Abreu, Wei Chen
https://arxiv.org/abs/2603.04615 https://mastoxiv.page/@arXiv_quantph_bot/116181633051356644
toXiv_bot_toot
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
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 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
Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[4/5]:
- An Introduction to the Foundations and Interpretations of Quantum Mechanics
Theodore McKeever, Ahsan Nazir
https://arxiv.org/abs/2603.09818 https://mastoxiv.page/@arXiv_quantph_bot/116210187189033607
- High-efficiency telecom conversion of heralded atomic biphoton wavepackets
Ling-Chun Chen, Chang-Wei Lin, Jiun-Shiuan Shiu, Wei-Lin Chen, Yi-Che Wang, Yong-Fan Chen
https://arxiv.org/abs/2603.09824 https://mastoxiv.page/@arXiv_quantph_bot/116210188500547382
- Nonlocal continuous-variable gates by amplified optical connections
Michele N. Notarnicola, Radim Filip
https://arxiv.org/abs/2603.12866 https://mastoxiv.page/@arXiv_quantph_bot/116237860870070366
- Numerically Optimizing Shortcuts to Adiabaticity: A Hybrid Control Strategy
Bo Xing, Jes\'us G. Parejo, Sof\'ia Mart\'inez-Garaot, Paola Cappellaro, Mikel Palmero
https://arxiv.org/abs/2604.01301 https://mastoxiv.page/@arXiv_quantph_bot/116339756687591049
- Split-Evolution Quantum Phase Estimation for Particle-Conserving Hamiltonians
Megan Cerys Rowe, Carlo A. Gaggioli, Ludmila Szulakowska, David Mu\~noz Ramo, David Zsolt Manrique
https://arxiv.org/abs/2604.14921 https://mastoxiv.page/@arXiv_quantph_bot/116419212238371343
- Machine-learned, finite temperature Fermi-operator expansions suitable for GPUs and AI-hardware
Stanislaw Kowalski, Christian F. A. Negre, Anders M. N. Niklasson, Kipton Barros, Joshua Finkelstein
https://arxiv.org/abs/2605.08523 https://mastoxiv.page/@arXiv_quantph_bot/116560663812508780
- Testing Catability and Coherent Superposition of $2\mathcal{D}$ Graphene Quantum system
Abdelmalek Bouzenada
https://arxiv.org/abs/2605.10967 https://mastoxiv.page/@arXiv_quantph_bot/116566205581938646
- Lowest order Carleman linearization for low Reynolds long-term behaviour of fluid flow simulations
Luca Cappelli, Sauro Succi
https://arxiv.org/abs/2605.23380 https://mastoxiv.page/@arXiv_quantph_bot/116634231354223845
- Quantum optimal control of the Dicke manifold in dipolar Rydberg atom arrays
Ivy Pannier-G\"unther, Vikas Buchemmavari, Pablo M. Poggi, Ivan H. Deutsch
https://arxiv.org/abs/2606.02283 https://mastoxiv.page/@arXiv_quantph_bot/116679731734041208
toXiv_bot_toot
Payless Putin
bot by @…
No laws were broken in the making of this bot: put the zip ties down.
#satire #potus45
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-05-12 Tue (UTC), 1 new article found for math.SP Spectral Theory]
toXiv_bot_toot
[2026-06-12 Fri (UTC), no new articles found for math.KT K-Theory and Homology]
toXiv_bot_toot
Pillar Pooper
bot by @…
No laws were broken in the making of this bot: I hope you'll lol, not take legal action.
#satire #potus45
Crosslisted article(s) found for cs.PF. https://arxiv.org/list/cs.PF/new
[1/1]:
- Attention at the Theoretical Minimum: A Mathematics of Arrays Framework for Memory-Optimal Transf...
Lenore Mullin, Gaetan Hains
https://arxiv.org/abs/2606.07713 https://mastoxiv.page/@arXiv_csLG_bot/116719339788828558
- An Empirical Comparison of General Context-Free Parsers
Huan Vo, Danushka Liyanage, Hong Jin Kang, Sasha Rubin, Rahul Gopinath
https://arxiv.org/abs/2606.08465 https://mastoxiv.page/@arXiv_csFL_bot/116718996893368453
- Fairness-Aware and Latency-Controllable Scheduling for Chunked-Prefill LLM Serving
Haoxin Liu, Jiayi Wang, Yueshen Xu, Rui Li
https://arxiv.org/abs/2606.09061 https://mastoxiv.page/@arXiv_csDC_bot/116719152021398104
- Correlation Is Not Enough: Embedding Human Metadata for Individual Causal Discovery
Suraj Biswas, Saurabh Gupta, Pritam Mukherjee
https://arxiv.org/abs/2606.09672 https://mastoxiv.page/@arXiv_csAI_bot/116719417844314505
- AutoMegaKernel: A Statically-Checked Agent Harness for Self-Retargeting Megakernel Synthesis
Jaber Jaber, Osama Jaber
https://arxiv.org/abs/2606.09682 https://mastoxiv.page/@arXiv_csLG_bot/116719454809500736
- An 84-Format Numeric Catalog with Bit-Exact Conformance Vectors: A Vendor-Neutral Reference for F...
Dmitrii Vasilev
https://arxiv.org/abs/2606.09686 https://mastoxiv.page/@arXiv_csAR_bot/116718979590686345
toXiv_bot_toot
[2026-06-11 Thu (UTC), 14 new articles found for cs.IT Information Theory]
toXiv_bot_toot
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
Berry's phase under topology change
Pavel Kurasov, Vladislav Shubin, Axel Tibbling
https://arxiv.org/abs/2605.10798 https://arxiv.org/pdf/2605.10798 https://arxiv.org/html/2605.10798
arXiv:2605.10798v1 Announce Type: new
Abstract: Laplacians on metric graphs are used to construct continuous families of Hamiltonians with different topological structure. One such family is used to demonstrate that Hamiltonians with real-valued eigenfunctions may possess non-trivial geometric Berry's phase. Connections between non-trivial Berry's phase and topology change are discussed.
toXiv_bot_toot
Nectarine Nero
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45
[2026-06-12 Fri (UTC), 1 new article found for cs.PF Performance]
toXiv_bot_toot
[2026-06-11 Thu (UTC), 14 new articles found for cs.IT Information Theory]
toXiv_bot_toot
Quantum Ergodicity on large hyperbolic surfaces for local and pseudolocal operators
Nalini Anantharaman, Soumyajit Saha
https://arxiv.org/abs/2605.07696 https://arxiv.org/pdf/2605.07696 https://arxiv.org/html/2605.07696
arXiv:2605.07696v1 Announce Type: new
Abstract: We prove a quantum ergodicity theorem for sequences of closed hyperbolic surfaces converging to the Poincar\'e disc in the Benjamini-Schramm sense. Assuming a uniform lower bound on the injectivity radius and a spectral gap, we establish vanishing of quantum variance on fixed spectral windows for a class of observables that contains differential operators and finite-propagation smooth operators. This generalises a result of Le Masson and Sahlsten from scalar observables to both local and 'pseudolocal' operator settings.
toXiv_bot_toot
Ancient Orange
bot by @…
No laws were broken in the making of this bot: let's leave the extrajudicial killing out of it.
#satire #potus45
[2026-06-11 Thu (UTC), 1 new article found for cs.PF Performance]
toXiv_bot_toot
Maximum Coverage Chase Decoder for Optical Interconnects
Alessandro Cardinale, Wenqing Song, Bin Chen, Alex Alvarado, Andreas Burg, Yifei Shen
https://arxiv.org/abs/2606.11401 https://arxiv.org/pdf/2606.11401 https://arxiv.org/html/2606.11401
arXiv:2606.11401v1 Announce Type: new
Abstract: We propose a low-complexity Chase decoder for optical interconnects that formulates test pattern selection as a generalized maximum coverage problem. For concatenated RS-BCH and oFEC codes, our decoder achieves the standard Chase decoding performance with 25% and 61.3% fewer test patterns, respectively.
toXiv_bot_toot
Nelson Tandela
bot by @…
No laws were broken in the making of this bot: tell the black helicopters to return to base.
#satire #potus45
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
Beyond Virtual Delay: Improving Packet Delay Bound in Network Calculus
Yuming Jiang
https://arxiv.org/abs/2606.13631 https://arxiv.org/pdf/2606.13631 https://arxiv.org/html/2606.13631
arXiv:2606.13631v1 Announce Type: new
Abstract: In network calculus, a fundamental result is the classical delay bound given by the horizontal deviation between the arrival and service curves. While widely used, the classical bound is derived from the notion of virtual delay. In this work, we first show that the maximum packet delay is always upper-bounded by the maximum virtual delay, revealing inherent conservatism when applying the virtual-delay-based bound to packet delay. Motivated by this insight, we revisit packet delay analysis and derive a new packet delay bound that requires no assumptions beyond the arrival and service curves. Specializing the new bound to a system with leaky-bucket arrival curve and rate-latency service curve shows strict improvement over the classical bound, which is further demonstrated through a case study in time-sensitive networking (TSN).
toXiv_bot_toot
Bargain Benito
bot by @…
No laws were broken in the making of this bot: tell the black helicopters to return to base.
#satire #potus45
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
Lifted Gabidulin Construction for LDPC Representations of Finite Geometry Codes
Yifei Shen, Andreas Burg
https://arxiv.org/abs/2606.11454 https://arxiv.org/pdf/2606.11454 https://arxiv.org/html/2606.11454
arXiv:2606.11454v1 Announce Type: new
Abstract: Finite geometry (FG) codes combine the algebraic properties of classical block codes with the iterative belief propagation (BP) decoding ability of low-density parity-check~(LDPC) codes. However, exploiting both advantages in practice is hindered by the fact that the standard incidence matrix between $(\mu 1)$-flats and points is dense and contains many short cycles for any flat dimension $\mu\geq 1$. In this work, we propose to sparsify the decoding matrix based on pencil selection, formulated as a constant-dimension subspace packing problem and solved explicitly using lifted Gabidulin codes. For both affine and projective geometries, sparse parity-check matrices are constructed and verified for FG codes of lengths up to $1024$. Simulations on four FG codes show no visible error floor and around $0.5$~dB gain over corresponding 5G LDPC codes at a block error rate of $10^{-7}$.
toXiv_bot_toot
The Brain That Goes Quiet: Serving a Large Model's Knowledge at 131 Tokens per Second on an 8 GB Laptop by Removing the Large Model from the Runtime Path
Myeong Jun Jo
https://arxiv.org/abs/2606.12154 https://arxiv.org/pdf/2606.12154 https://arxiv.org/html/2606.12154
arXiv:2606.12154v1 Announce Type: new
Abstract: In earlier work I showed that a 35B-class Mixture-of-Experts model can be loaded and executed on a consumer laptop with 8 GB of GPU memory. That result solved a placement problem and immediately exposed a different one: even correctly placed, the large model needed roughly four seconds to answer, because it was still being invoked at every query. This paper documents what happened when I stopped invoking it. During an offline phase, the large model reads source documents and writes verified answer entries into a structured knowledge store; at runtime, only a lightweight router, a deterministic renderer, and a 1B-class model are active. On the same 8 GB laptop, end-to-end response time fell from approximately 4,465 ms to 518 ms, effective end-to-end throughput rose from 15.7 to 131 tokens per second, and the small model's streaming decode rate held at 226-237 tokens per second with a time-to-first-token of 29-62 ms. The bottleneck is structural: three different large models (Qwen, Gemma, and GLM class) all showed the same multi-second runtime cost, and all three produced usable knowledge stores offline. On a 563-entry store built from seventeen real documents, keyword routing collapsed to 1.5% top-1 accuracy while BM25-based routing reached 92.8% (99.4% top-3), and a confidence gate raised effective top-1 to 98.0% by escalating 12.3% of queries. Exact-match fidelity of the small model ranged from 9/9 to 0/9 across envelope formats carrying identical content. A 16-case verification gate blocked all ten corrupted entries while admitting all six supported ones.
toXiv_bot_toot
The Lyin' King
bot by @…
No laws were broken in the making of this bot: please don't come after me.
#satire #potus45
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
Non-special Divisors, LCPs of Codes, and LCD Codes on Kummer Extensions
Huachao Zhang, Chang-An Zhao
https://arxiv.org/abs/2606.11764 https://arxiv.org/pdf/2606.11764 https://arxiv.org/html/2606.11764
arXiv:2606.11764v1 Announce Type: new
Abstract: Recently, constructions of linear complementary pairs (LCPs) of codes and linear complementary dual (LCD) codes on function fields have attracted considerable attention due to the wide range of applications of these codes. Such constructions rely on non-special divisors of degrees $g$ and $g-1$. In this work, we investigate Kummer extensions defined by $y^m = f(x)$ with $f(x)\in\mathbb{F}_q(x)$ and establish an arithmetic characterization of non-special divisors whose support can contain non-totally ramified places. Based on this characterization, we explicitly construct non-special divisors of degree $g-1$ on the GK curve. Moreover, utilizing pure gaps, we explicitly provide several families of effective non-special divisors of degree $g$ on Kummer extensions with the same multiplicities. We then develop a general framework for constructing LCPs of algebraic geometry (AG) codes on Kummer extensions. By virtue of canonical divisors, we show that the security parameters of LCPs of AG codes can be determined within this framework, which also enables the construction of LCD AG codes. Finally, we illustrate our results with representative examples, including LCPs of codes on the GK curve and LCD codes on quotients of the Hermitian curve.
toXiv_bot_toot
Cheeto in Chief
bot by @…
No laws were broken in the making of this bot: cancel the hit squad.
#satire #potus45
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
MJSAC: McCormick Relaxation-based Waveform Design for Joint Sensing and Communication
Bodhibrata Mukhopadhyay, Sajid Ahmed, Mohamed-Slim Alouini
https://arxiv.org/abs/2606.11351 https://arxiv.org/pdf/2606.11351 https://arxiv.org/html/2606.11351
arXiv:2606.11351v1 Announce Type: new
Abstract: In the upcoming 5G Advanced and 6G technologies, joint sensing and communication (JSAC) will play a pivotal role in enabling the simultaneous utilization of hardware and spectrum resources for communication and sensing tasks. While current algorithms primarily focus on designing beampattern invariant covariance matrices for transmitting various symbols for communication, they often overlook the distances among these symbols. While these covariance matrices effectively facilitate ranging operations, they have adverse effects on communication performance. Designing beampattern invariance covariance matrices with maximal distances among themselves poses a challenging non-convex problem. In this paper, we introduce a novel waveform design method based on McCormick relaxation called McCormick-based JSAC (MJSAC). MJSAC sequentially solves an optimization problem to generate a set of covariance matrices by maximizing the distances (Frobenius norm) among themselves while ensuring a consistent beam pattern. Also, MJSAC eliminates the requirement for channel information to generate the covariance matrices. Through simulations, we demonstrate that MJSAC outperforms conventional algorithms, even those utilizing channel information at the transmitter.
toXiv_bot_toot
Felonious Chunk
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45
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
Maximizing Connectivity of Uplink RIS-Assisted UAV Networks
Mohammed Saif, Shahrokh Valaee
https://arxiv.org/abs/2606.11523 https://arxiv.org/pdf/2606.11523 https://arxiv.org/html/2606.11523
arXiv:2606.11523v1 Announce Type: new
Abstract: In this paper, we present a new approach for unmanned aerial vehicle (UAV) positioning and reconfigurable intelligent surface (RIS) partitioning to enhance connectivity of uplink RIS-assisted UAV networks. To achieve this, our approach optimizes RIS-aided link selection, RIS partitioning, and UAV positions to maximize network connectivity characterized by its Fiedler value. Meanwhile, it maintains a specific signal-to-interference plus noise ratio (SINR) constraint for user equipment (UE), which is influenced by RIS partitioning and UAV reliability. The network connectivity optimization problem is formulated using the Fiedler value subject to RIS elements allocation and SINR constraints. This problem is a computationally expensive combinatorial optimization, necessitating an efficient iterative approach. In particular, we propose a perturbation method for RIS-aided link selection, and derive a closed-form solution for RIS partitioning, with each partition tailored to optimize SINR for individual UAV. For the given RIS-aided links and RIS partitioning, we then show that the problem of UAV positioning can be formulated as a low complexity semi-definite programming (SDP) optimization problem, which can be solved using off-the-shelf CVX solvers. Our simulations show the potential gain of UAV positioning and RIS partitioning compared to the benchmark schemes from the literature.
toXiv_bot_toot
Al Caporn
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45
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
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
Donnie Two Poops
bot by @…
No laws were broken in the making of this bot: please don't come after me.
#satire #potus45
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
Vision-Language-Action Models Meet World Models: Embodied Agentic AI for Low-Altitude Wireless Networks
Feibo Jiang, Li Dong, Lei Mao, Kezhi Wang, Cunhua Pan, Dong In Kim, Naofal Al-Dhahir
https://arxiv.org/abs/2606.11618 https://arxiv.org/pdf/2606.11618 https://arxiv.org/html/2606.11618
arXiv:2606.11618v1 Announce Type: new
Abstract: Low-Altitude Wireless Networks (LAWNs), composed of Unmanned Aerial Vehicles (UAVs) and other aerial platforms, provide integrated perception, communication, and computation services in low-altitude airspace. However, deploying large generative models in this domain faces three major challenges: 1) Limited embodied action mapping; 2) Inadequate physical environment modeling; 3) Insufficient closed-loop optimization. To address these challenges, this study proposes an Embodied Agentic UAV framework. Centered on a Vision-Language-Action (VLA) model as the execution core, the framework establishes an end-to-end embodied decision-making pipeline from multimodal environmental perception to continuous control generation. In addition, a World Model (WM) is introduced to capture the coupling between UAV actions and environmental state evolution, thereby supporting environment prediction, policy verification, and dynamic optimization. Furthermore, memory and reflection mechanisms are incorporated to form an adaptive closed-loop optimization paradigm of decision, execution, evaluation, and update, thereby enhancing the system's autonomous decision-making capability and continual evolution ability in complex dynamic environments. Experimental results validate its effectiveness in enabling robust, predictive, and sustainable autonomous control in LAWNs.
toXiv_bot_toot
Pathetic Pol Pot
bot by @…
No laws were broken in the making of this bot: let's not have humor lead to homicide.
#satire #potus45
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
Joint Movable Antenna Positioning and RIS Partitioning for Sum-Rate Maximization
Mohammed Saif
https://arxiv.org/abs/2606.11519 https://arxiv.org/pdf/2606.11519 https://arxiv.org/html/2606.11519
arXiv:2606.11519v1 Announce Type: new
Abstract: This paper investigates the utility of the movable antenna (MA) and reconfigurable intelligent surface (RIS) framework for downlink wireless communications. In the considered scenario, a base station (BS) is equipped with two sub-arrays of MAs transmits signals to the users via the RIS. By jointly exploiting the antenna-positioning flexibility of MAs and the RIS element selection capability, the proposed joint MA-RIS framework introduces additional design degrees of freedom to enhance desired signals and mitigate inter-user interference, thereby maximizing the network sum-rate. To this end, we formulate a joint optimization problem involving MA positioning, sub-array beamforming, and RIS element selection, subject to the minimum antenna separation and transmit power constraints. The resulting problem is highly non-convex and challenging to solve directly. To address this issue, an alternating optimization framework is developed that decomposes the problem into three tractable subproblems. Specifically, zero-forcing beamforming is employed for transmit beamformer design, a low-complexity one-dimensional search is derived for RIS element selection, and the MA positioning problem is solved using block coordinate descent (BCD) and convex optimization techniques implemented via CVX. Simulation results demonstrate that the proposed joint MA-RIS framework significantly improves the achievable sum-rate compared with conventional fixed MAs and benchmark schemes with random configurations.
toXiv_bot_toot
Don the Con
bot by @…
No laws were broken in the making of this bot: don't have me abducted.
#satire #potus45
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
Color-Rule-Function Encoding for Combinatorial Memory
Alexander Khitun
https://arxiv.org/abs/2606.11365 https://arxiv.org/pdf/2606.11365 https://arxiv.org/html/2606.11365
arXiv:2606.11365v1 Announce Type: new
Abstract: Combinatorial memory is a class of memory in which information is encoded in the set of paths through a structured mesh. In this work, we introduce a systematic encoding framework, referred to as the Color-Rule-Function (CRF) approach, for representing information in combinatorial memory. The method consists of four key steps: selecting a sequence of paths in the mesh, assigning values (e.g., colors) to each cell, defining a set of rules based on the values encountered along each path, and constructing a Boolean function that determines the state of each path. . The coding procedure is illustrated by several examples. The design space scales of the CRF scale fundamentally faster compared to conventional memory. This apparent advantage arises from the use of rule-based and functional representations but is accompanied by increased hardware complexity. A possible hardware realization of the CRF framework is discussed. Importantly, the hardware overhead can be substantially reduced through the use of customized modules. The examples of the customized design are described in the text. The combination of CRF coding with customized module design may lead to a practical advantage in data storage density. According to the estimates, the data storage density may exceed Exabit per centimeter squared. A key problem that requires further investigation is related to the minimum Hamming distance between an arbitrary target bit sequence and the closest sequence realizable within the CRF framework under fixed hardware constraints.
toXiv_bot_toot
The Kompromat Kid
bot by @…
No laws were broken in the making of this bot: let's leave the extrajudicial killing out of it.
#satire #potus45
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
Designed-Source Reductions and a Dual-Purpose Feasibility Band for Semantic Rate-Distortion
Joss Armstrong
https://arxiv.org/abs/2606.11280 https://arxiv.org/pdf/2606.11280 https://arxiv.org/html/2606.11280
arXiv:2606.11280v1 Announce Type: new
Abstract: The joint rate-distortion framework of Stavrou and Kountouris (IEEE Transactions on Communications 2023) characterises dual-fidelity tradeoffs for semantic communication on stochastic semantic sources. Many task-oriented communication systems instead use designed sources, where the semantic object is a deterministic oracle allocation $\phi^(t)$ rather than a stochastic quantity given by nature. We isolate the subclass of designed sources under smooth concave utility with assumptions A1, A2 and Euclidean allocation codomain, and restrict the encoder class to deterministic common-category mappings. Within this subclass the SK exponential-tilting decoder and generalised Blahut--Arimoto iteration specialise to conditional-mean decoding and Lloyd--Max stationarity on $\phi^(t)$. When the second fidelity is a monotone single-letter distortion, the joint problem stays inside the SK admissible class; the common-category SK rate is lower-bounded by the max of the corresponding Shannon rate-distortion functions, with equality only when the common-category reconstruction is compatible and RDF-optimal. When the second fidelity is aggregate verification, the joint problem leaves the SK single-letter class and admits a constrained-design feasibility band $R_{\min}(\varepsilon^) \leq R \leq R_{\max}(\beta^)$ of width $\log_2(K_{\max}/K_{\min})$ bits in partition cardinality. The reduction and the band are scope statements on the SK apparatus, not modifications to it. A smart-grid economic-dispatch example with a non-technical-loss-detection contrast illustrates the band.
toXiv_bot_toot
Our Fondling Father
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45
An Information-Theoretic Analysis of Threshold Group Testing
Remco van der Hofstad, Noela M\"uller, Connor Riddlesden
https://arxiv.org/abs/2606.11353 https://arxiv.org/pdf/2606.11353 https://arxiv.org/html/2606.11353
arXiv:2606.11353v1 Announce Type: new
Abstract: We study the Threshold Group Testing (TGT) problem in the noiseless and non-adaptive setting, where the objective is to exactly recover a sparse binary vector from pooled tests, using as few tests as possible. In TGT, each test applied to a subset of items returns a positive outcome if the number of 1's (defective items) in that subset meets or exceeds a specified threshold, and has a negative outcome otherwise. We investigate how the complexity of TGT compares to that of Classical Group Testing (CGT), corresponding to the special case of the threshold equal to one, and analyse the impact of increasing the threshold on the required number of tests.
Our main contribution is the derivation of a sharp information-theoretic phase transition at $c_{\mathrm{inf}}^{\mathrm{TGT}}k\log(n/k)$ (non-adaptive) tests for TGT within the constant-column test design. The threshold constant $c_{\mathrm{inf}}^{\mathrm{TGT}}$ is expressed as a function of the prevalence of defectives and the threshold value. Our upper bound is derived under an analytic assumption, and we verify that this assumption is satisfied for a threshold value of 2.
The value of $c_{\mathrm{inf}}^{\mathrm{TGT}}$ reveals that TGT on the constant-column design has the same information-theoretic behaviour as CGT in the low-prevalence regime. Yet, strikingly, at higher prevalences, the threshold leads to a significant reduction in the number of tests.
On the other hand, we provide evidence that when the asymptotic proportion of defective items is positive, TGT actually becomes strictly harder than CGT (excluding trivial reductions).
toXiv_bot_toot
Alexander Scamilton
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45
Segment-Wise Soft Robotics Inspired Flexible Antenna Arrays: Design and Optimization
Shuaishuai Han, Konstantinos Ntougias, Elio Faddoul, Ioannis Krikidis
https://arxiv.org/abs/2606.11771 https://arxiv.org/pdf/2606.11771 https://arxiv.org/html/2606.11771
arXiv:2606.11771v1 Announce Type: new
Abstract: In this paper, we propose a segment-wise soft robotic antenna (SRA) system, where each soft robotic arm referred to as a tentacle, comprises multiple independently controllable segments with bending, elongation-retraction, and sweeping motions. By adjusting segment motion parameters, the positions of surface-mounted antennas are reconfigured, distinguishing it from conventional reconfigurable antenna (RA) systems. Based on this model, we propose two antenna deployment schemes: the segmented end-antenna configuration (SEAC), where fixed antennas are mounted at the segment ends and reconfigured via segment motions; and the hybrid end-and-intermediate antenna configuration (HEIAC), where RAs are further integrated as intra-segment antennas. In HEIAC, soft-robot segment deformation provides large-scale spatial reconfiguration, while RAs enable fine-grained adjustment. For SEAC, we formulate a sum-rate maximization problem accounting for inter-segment connectivity and the nonlinear mapping from segment deformation parameters to antenna coordinates, and develop a penalty dual decomposition-projected gradient ascent (PDD-PGA) algorithm. For HEIAC, we jointly optimize segment deformation, intra-segment antenna positions, and antenna activation using a block coordinate descent (BCD)-PDD-PGA algorithm with greedy backward antenna selection. Simulation results demonstrate that the proposed schemes substantially outperform fixed-position antenna arrays and conventional RA baselines. In particular, SEAC and HEIAC achieve 37.9% and 32.1% sum-rate gains over conventional 3D reconfigurable arrays, respectively, while SEAC provides up to a 49.3% gain in compact array deployments.
toXiv_bot_toot
Count Flatula
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45
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
Trumpster Fire
bot by @…
No laws were broken in the making of this bot: cancel the hit squad.
#satire #potus45
Dollar Tree Dictator
bot by @…
No laws were broken in the making of this bot: no waterboarding please and thank you.
#satire #potus45
Narcoleptic Napoleon
bot by @…
No laws were broken in the making of this bot: no investigating me please.
#satire #potus45
Pumpkin McPornhumper
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45
Cheaty McCheats-a-lot
bot by @…
No laws were broken in the making of this bot: don't make me go to gulag.
#satire #potus45
Impeached Beached Fail
bot by @…
No laws were broken in the making of this bot: tell the black helicopters to return to base.
#satire #potus45 …
Pissant Pol Pot
bot by @…
No laws were broken in the making of this bot: let's leave the extrajudicial killing out of it.
#satire #potus45 …
Der Dumpenführer
bot by @…
No laws were broken in the making of this bot: please don't come after me.
#satire #potus45
Circus Peanut President
bot by @…
No laws were broken in the making of this bot: please don't ruin my life.
#satire #potus45
Donny Little Hands
bot by @…
No laws were broken in the making of this bot: I wanted to make you smile, not pursue charges.
#satire #potus45
Pumpkin Spiced Putin
bot by @…
No laws were broken in the making of this bot: no waterboarding please and thank you.
#satire #potus45
Mango Unchained
bot by @…
No laws were broken in the making of this bot: let's not have humor lead to homicide.
#satire #potus45
Velveeto Corleone
bot by @…
No laws were broken in the making of this bot: please don't torture me.
#satire #potus45
King of the Shill
bot by @…
No laws were broken in the making of this bot: let's not get carceral over comedy.
#satire #potus45
@arXiv_csIT_bot@mastoxiv.page
