Tootfinder

Blue Jays troll Browns, Guardians after error https://www.espn.com/mlb/story/_/id/45591838/toronto-blue-jays-cleveland-browns-guardians-troll-error

Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit
Alena S. Kazmina, Artyom M. Polyanskiy, Elena Yu. Egorova, Nikolay N. Abramov, Daria A. Kalacheva, Viktor B. Lubsanov, Aleksey N. Bolgar, Ilya A. Simakov
https://arxiv.org/abs/2506.20529

Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit
Quantum error correction (QEC) is essential for achieving fault-tolerant quantum computing. While superconducting qubits are among the most promising candidates for scalable QEC, their limited nearest-neighbor connectivity presents significant challenges for implementing a wide range of error correction codes. In this work, we experimentally demonstrate a quantum error detection scheme that employs a dynamically reassigned ancillary qubit on a chain of three linearly connected transmon qubits. …

I check my home lab #GrayLog every morning. I guess I won't be fixing this less than helpful #Docker error :)
"docker: Error: Unknown error"

Artificial Symmetry Breaking by Self-Interaction Error
Lin Hou, Cody Woods, Yanyong Wang, Jorge Vega Bazantes, Ruiqi Zhang, Shimin Zhang, Erik Alfredo Perez Caro, Yuan Ping, Timo Lebeda, Jianwei Sun
https://arxiv.org/abs/2506.20662

Artificial Symmetry Breaking by Self-Interaction Error
Symmetry is a cornerstone of quantum mechanics and materials theory, underpinning the classification of electronic states and the emergence of complex phenomena such as magnetism and superconductivity. While symmetry breaking in density functional theory can reveal strong electron correlation, it may also arise spuriously from self-interaction error (SIE), an intrinsic flaw in many approximate exchange-correlation functionals. In this work, we present clear evidence that SIE alone can induce ar…

Microsoft plans to replace the Blue Screen of Death in Windows 11 with a simplified black screen "providing better information" in an update "later this summer" (Tom Warren/The Verge)
https://www.theverge.com/news/692648/micro

Windows is getting rid of the Blue Screen of Death after 40 years
Microsoft is changing its Blue Screen of Death to a black one. After decades, a simplified black error message will replace the traditional BSOD.

A Computationally Aware Multi Objective Framework for Camera LiDAR Calibration
Venkat Karramreddy, Rangarajan Ramanujam
https://arxiv.org/abs/2506.20636 ht…

A Computationally Aware Multi Objective Framework for Camera LiDAR Calibration
Accurate extrinsic calibration between LiDAR and camera sensors is important for reliable perception in autonomous systems. In this paper, we present a novel multi-objective optimization framework that jointly minimizes the geometric alignment error and computational cost associated with camera-LiDAR calibration. We optimize two objectives: (1) error between projected LiDAR points and ground-truth image edges, and (2) a composite metric for computational cost reflecting runtime and resource usa…

Complex Model Transformations by Reinforcement Learning with Uncertain Human Guidance
Kyanna Dagenais, Istvan David
https://arxiv.org/abs/2506.20883 https:…

Complex Model Transformations by Reinforcement Learning with Uncertain Human Guidance
Model-driven engineering problems often require complex model transformations (MTs), i.e., MTs that are chained in extensive sequences. Pertinent examples of such problems include model synchronization, automated model repair, and design space exploration. Manually developing complex MTs is an error-prone and often infeasible process. Reinforcement learning (RL) is an apt way to alleviate these issues. In RL, an autonomous agent explores the state space through trial and error to identify benef…

CLEAR: Error Analysis via LLM-as-a-Judge Made Easy
Asaf Yehudai, Lilach Eden, Yotam Perlitz, Roy Bar-Haim, Michal Shmueli-Scheuer
https://arxiv.org/abs/2507.18392 https://

CLEAR: Error Analysis via LLM-as-a-Judge Made Easy
The evaluation of Large Language Models (LLMs) increasingly relies on other LLMs acting as judges. However, current evaluation paradigms typically yield a single score or ranking, answering which model is better but not why. While essential for benchmarking, these top-level scores obscure the specific, actionable reasons behind a model's performance. To bridge this gap, we introduce CLEAR, an interactive, open-source package for LLM-based error analysis. CLEAR first generates per-instance textu…

I’ve been discussing some agent swarm based development work on LinkedIn. So far it’s going well, I’m figuring out how to get the results I want from the tools. As I say there, it feels more like managing a team of experienced product managers and developers (which I’ve done a few times in my career) than doing developer work faster.

Update on my Swift/iOS app development work using Claude-flow. | Adrian Cockcroft
Update on my Swift/iOS app development work using Claude-flow. I took some time away from it but last week I continued cleaning up the code. The app was working for me but Claude had built over 200 tests, unit tests and UI automation tests and I spent a day focused on getting them all to work, which found a few issues in the app code. Claude isn’t as good at writing Swift as Python (which tends to work first time) but when the compile failures and test error logs are passed back to it, it d…

Spouse is a psychotherapist. I am a heavily-interdisciplinary computer programmer. We both work with complex systems.
We are diagnosing why the heat pump mini-split isn't working as expected
Their first hypothesis, of course, is "communication breakdown with partner unit"
Mine is "configuration error root-caused to bad UX design"
... We were both right

Does anyone know this error? I don't even know were to start, there is no env anywhere - imho :D
$ git commit ...
env: php: No such file or directory
#captainhook
cc @… @…

Russian developer Yegor from yegor256.com uses a simple example of two similar approaches to modeling an action, and their implications from an object-oriented design and programming patterns perspective. One of the two approaches provides superior extensibility, data encapsulation, and more flexible error handling.
"remove(42) vs. find(42).remove()"

Laittelin yhtä LTE-WiFi purkkia kuntoon ja järkytykseni huomasin kyberrikollisten yrittävän murtautua paikallisesta sarjaportista!
Joka paikkaan nekin ehtivät. Mokomat! Missään ei ole turvassa.

@… at https://cryptpad.fr/login/ I get the error described at

On Error Rate Approximations for FSO Systems with Weak Turbulence and Pointing Errors
Carmen \'Alvarez Roa, Yunus Can G\"ultekin, Kaiquan Wu, Cornelis Willem Korevaar, Alex Alvarado
https://arxiv.org/abs/2506.19627

On Error Rate Approximations for FSO Systems with Weak Turbulence and Pointing Errors
Atmospheric attenuation, atmospheric turbulence, geometric spread, and pointing errors, degrade the performance of free-space optical transmission. In the weak turbulence regime, the probability density function describing the distribution of the channel fading coefficient that models these four effects is known in the literature. This function is an integral equation, which makes it difficult to find simple analytical expressions of important performance metrics such as the bit error rate (BER…

E.A.R.T.H.: Structuring Creative Evolution through Model Error in Generative AI
Yusen Peng, Shuhua Mao
https://arxiv.org/abs/2507.18004 https://arxiv.org/p…

E.A.R.T.H.: Structuring Creative Evolution through Model Error in Generative AI
How can AI move beyond imitation toward genuine creativity? This paper proposes the E.A.R.T.H. framework, a five-stage generative pipeline that transforms model-generated errors into creative assets through Error generation, Amplification, Refine selection, Transform, and Harness feedback. Drawing on cognitive science and generative modeling, we posit that "creative potential hides in failure" and operationalize this via structured prompts, semantic scoring, and human-in-the-loop evaluation. Im…

A residual a posteriori error estimate for the Stabilization-free Virtual Element Method
Stefano Berrone, Andrea Borio, Davide Fassino, Francesca Marcon
https://arxiv.org/abs/2506.17947

A residual a posteriori error estimate for the Stabilization-free Virtual Element Method
In this work, we present the a posteriori error analysis of Stabilization-Free Virtual Element Methods for the 2D Poisson equation. The abscence of a stabilizing bilinear form in the scheme allows to prove the equivalence between a suitably defined error measure and standard residual error estimators, which is not obtained in general for stabilized virtual elements. Several numerical experiments are carried out, confirming the expected behaviour of the estimator in the presence of different mes…

Lower Bounds on Relative Error Quantum Compression and Classical Shadows
Kaushik Sankar
https://arxiv.org/abs/2506.21345 https://arxi…

Lower Bounds on Relative Error Quantum Compression and Classical Shadows
We study the question of how much classical communication is needed when Alice is given a classical description of a quantum state $|ψ\rangle$ for Bob to recover any expectation value $\langle ψ| M |ψ\rangle$ given an observable $M$ with $M$ Hermitian and $||M||_{\text{op}} \leq 1$. This task, whose study was initiated by Raz (ACM 1999) and more recently investigated by Gosset and Smolin (TQC 2019), can be thought of as a fully classical version of the pure…

Grindr Won’t Let Users Say 'No Zionists' https://www.404media.co/grindr-no-zionists-error-message/

Wild refitting for black box prediction
Martin J. Wainwright
https://arxiv.org/abs/2506.21460 https://arxiv.org/pdf/2506.21460…

Wild refitting for black box prediction
We describe and analyze a computionally efficient refitting procedure for computing high-probability upper bounds on the instance-wise mean-squared prediction error of penalized nonparametric estimates based on least-squares minimization. Requiring only a single dataset and black box access to the prediction method, it consists of three steps: computing suitable residuals, symmetrizing and scaling them with a pre-factor $ρ$, and using them to define and solve a modified prediction problem rece…

Performance improvement of spatial semantic segmentation with enriched audio features and agent-based error correction for DCASE 2025 Challenge Task 4
Jongyeon Park, Joonhee Lee, Do-Hyeon Lim, Hong Kook Kim, Hyeongcheol Geum, Jeong Eun Lim
https://arxiv.org/abs/2506.21174

Performance improvement of spatial semantic segmentation with enriched audio features and agent-based error correction for DCASE 2025 Challenge Task 4
This technical report presents submission systems for Task 4 of the DCASE 2025 Challenge. This model incorporates additional audio features (spectral roll-off and chroma features) into the embedding feature extracted from the mel-spectral feature to im-prove the classification capabilities of an audio-tagging model in the spatial semantic segmentation of sound scenes (S5) system. This approach is motivated by the fact that mixed audio often contains subtle cues that are difficult to capture wit…

Evaluating Disassembly Errors With Only Binaries
Lambang Akbar Wijayadi, Yuancheng Jiang, Roland H. C. Yap, Zhenkai Liang, Zhuohao Liu
https://arxiv.org/abs/2506.20109

Evaluating Disassembly Errors With Only Binaries
Disassemblers are crucial in the analysis and modification of binaries. Existing works showing disassembler errors largely rely on practical implementation without specific guarantees and assume source code and compiler toolchains to evaluate ground truth. However, the assumption of source code is contrary to typical binary scenarios where only the binary is available. In this work, we investigate an approach with minimal assumptions and a sound approach to disassembly error evaluation that doe…

The hyperbolic lattice counting problem in large dimensions
Christos Katsivelos
https://arxiv.org/abs/2506.17753 https://arxiv.org/pd…

The hyperbolic lattice counting problem in large dimensions
For $n\geq 3$ and $Γ$ a cocompact lattice acting on the hyperbolic space $\mathbb{H}^n$, we investigate the average behaviour of the error term in the circle problem. First, we explore the local average of the error term over compact sets of $Γ\backslash\mathbb{H}^n$. Our upper bound depends on the quantum variance and the spectral exponential sums appearing in the study of the Prime geodesic theorem. We also prove $Ω$-results for the mean value and the second moment of the error term.

A Multi-Pass Large Language Model Framework for Precise and Efficient Radiology Report Error Detection
Songsoo Kim, Seungtae Lee, See Young Lee, Joonho Kim, Keechan Kan, Dukyong Yoon
https://arxiv.org/abs/2506.20112

A Multi-Pass Large Language Model Framework for Precise and Efficient Radiology Report Error Detection
Background: The positive predictive value (PPV) of large language model (LLM)-based proofreading for radiology reports is limited due to the low error prevalence. Purpose: To assess whether a three-pass LLM framework enhances PPV and reduces operational costs compared with baseline approaches. Materials and Methods: A retrospective analysis was performed on 1,000 consecutive radiology reports (250 each: radiography, ultrasonography, CT, MRI) from the MIMIC-III database. Two external datasets (C…

@… Thank you for fixing these!
When I try to upgrade, I get a strange error:
```
$ nix run'git https://git.lix.systems/lix-project/li

Once again, #Linux betrayed me: #GnomeDiskUtility only gave me error messages when trying to create a #partition table,

Reducing Self-Interaction Error in Transition-Metal Oxides with Different Exact-Exchange Fractions for Energy and Density
Harshan Reddy Gopidi, Ruiqi Zhang, Yanyong Wang, Abhirup Patra, Jianwei Sun, Adrienn Ruzsinszky, John P. Perdew, Pieremanuele Canepa
https://arxiv.org/abs/2506.20635 …

Reducing Self-Interaction Error in Transition-Metal Oxides with Different Exact-Exchange Fractions for Energy and Density
DFT is vital for materials discovery, and at the base of extensive molecular and materials databases, chemical reaction predictions, and machine learning potentials. The widespread use of DFT in chemistry and materials science aims for "chemical accuracy," but this is limited by the unknown exchange and correlation (XC) functional. A meta-GGA, the restored regularized strongly constrained and appropriately normed, r r2SCAN XC functional, fulfils 17 exact constraints of the XC energy. r2SCAN sti…

Ring said on social media that strange login patterns were caused by a programming error, not hackers.
https://www.snopes.com/news/2025/07/21/ring-hacked-may-28-2025/

What to know about supposed Ring doorbell security breach in May 2025
Ring said on social media that strange login patterns were caused by a programming error, not hackers.

Orthogonality conditions for convex regression
Sheng Dai, Timo Kuosmanen, Xun Zhou
https://arxiv.org/abs/2506.21110 https://arxiv.org…

Orthogonality conditions for convex regression
Econometric identification generally relies on orthogonality conditions, which usually state that the random error term is uncorrelated with the explanatory variables. In convex regression, the orthogonality conditions for identification are unknown. Applying Lagrangian duality theory, we establish the sample orthogonality conditions for convex regression, including additive and multiplicative formulations of the regression model, with and without monotonicity and homogeneity constraints. We th…

On the Role of Age and Semantics of Information in Remote Estimation of Markov Sources
Jiping Luo, Nikolaos Pappas
https://arxiv.org/abs/2507.18514 https://

On the Role of Age and Semantics of Information in Remote Estimation of Markov Sources
This paper investigates the semantics-aware remote estimation of a finite-state Markov chain. We employ the maximum a posteriori (MAP) estimator and aim to devise a transmission policy to optimize estimation performance subject to a transmission frequency constraint. We leverage two metrics, namely the Age of Consecutive Error (AoCE) and the Age of Information (AoI), to quantify, respectively, the significance of estimation error at the transmitter and the predictability of outdated information…

A Framework for Building Data Structures from Communication Protocols
Alexandr Andoni, Shunhua Jiang, Omri Weinstein
https://arxiv.org/abs/2506.20761 https…

A Framework for Building Data Structures from Communication Protocols
We present a general framework for designing efficient data structures for high-dimensional pattern-matching problems ($\exists \;? i\in[n], f(x_i,y)=1$) through communication models in which $f(x,y)$ admits sublinear communication protocols with exponentially-small error. Specifically, we reduce the data structure problem to the Unambiguous Arthur-Merlin (UAM) communication complexity of $f(x,y)$ under product distributions. We apply our framework to the Partial Match problem (a.k.a, matchin…

Identifiability and Maximum Likelihood Estimation for System Identification of Networks of Dynamical Systems
Anders Hansson, Jo\~ao Victor Galv\~ao da Mata, Martin S. Andersen
https://arxiv.org/abs/2506.20628

Identifiability and Maximum Likelihood Estimation for System Identification of Networks of Dynamical Systems
In this paper we investigate identifiability and maximum likelihood estimation for direct system identification of networks of dynamical systems. We provide necessary and sufficient conditions for network identifiability in terms of Gröbner bases. We show that the maximum likelihood approach is both consistent and efficient, which is in contrast to existing prediction error approaches. Moreover, our approach has wider applicability, i.e., it is applicable whenever network identifiability holds…

SafeClick: Error-Tolerant Interactive Segmentation of Any Medical Volumes via Hierarchical Expert Consensus
Yifan Gao, Jiaxi Sheng, Wenbin Wu, Haoyue Li, Yaoxian Dong, Chaoyang Ge, Feng Yuan, Xin Gao
https://arxiv.org/abs/2506.18404

SafeClick: Error-Tolerant Interactive Segmentation of Any Medical Volumes via Hierarchical Expert Consensus
Foundation models for volumetric medical image segmentation have emerged as powerful tools in clinical workflows, enabling radiologists to delineate regions of interest through intuitive clicks. While these models demonstrate promising capabilities in segmenting previously unseen anatomical structures, their performance is strongly influenced by prompt quality. In clinical settings, radiologists often provide suboptimal prompts, which affects segmentation reliability and accuracy. To address th…

An Optimization-Based Framework for Solving Forward-Backward Stochastic Differential Equations: Convergence Analysis and Error Bounds
Yutian Wang, Yuan-Hua Ni, Xun Li
https://arxiv.org/abs/2507.15234

An Optimization-Based Framework for Solving Forward-Backward Stochastic Differential Equations: Convergence Analysis and Error Bounds
In this paper, we develop an optimization-based framework for solving coupled forward-backward stochastic differential equations. We introduce an integral-form objective function and prove its equivalence to the error between consecutive Picard iterates. Our convergence analysis establishes that minimizing this objective generates sequences that converge to the true solution. We provide explicit upper and lower bounds that relate the objective value to the error between trial and exact solution…

{purrr} has some lesser known functions that make handling of failing function calls easier: safely, quietly, possibly: #rstats…

Wrap a function to capture errors — safely
Creates a modified version of .f that always succeeds. It returns a list with components result and error. If the function succeeds, result contains the returned value and error is NULL. If an error occurred, error is an error object and result is either NULL or otherwise.

Error-resilient Reversal of Quantum Chaotic Dynamics Enabled by Scramblons
Yu-Chen Li, Tian-Gang Zhou, Shengyu Zhang, Ze Wu, Liqiang Zhao, Haochuan Yin, Xiaoxue An, Hui Zhai, Pengfei Zhang, Xinhua Peng
https://arxiv.org/abs/2506.19915

Error-resilient Reversal of Quantum Chaotic Dynamics Enabled by Scramblons
The emergence of the arrow of time in quantum many-body systems stems from the inherent tendency of Hamiltonian evolution to scramble quantum information and increase entanglement. While, in principle, one might counteract this temporal directionality by engineering a perfectly inverted Hamiltonian to reverse entanglement growth, such a scenario is fundamentally unstable because even minor imperfections in the backward evolution can be exponentially amplified, a hallmark of quantum many-body ch…

Low-Complexity Ordered Reliability Direct Error Pattern Testing (ORDEPT) Decoding with Likelihood Thresholding
Reza Hadavian, Dmitri Truhachev
https://arxiv.org/abs/2506.20079

Low-Complexity Ordered Reliability Direct Error Pattern Testing (ORDEPT) Decoding with Likelihood Thresholding
We propose a reduced complexity approach to pattern-based soft decoding of block codes. We start from the ORDEPT decoding algorithm which tests a list of partial error patterns organized in the order of their likelihood and attempts to complete the patterns creating candidate codewords. We then propose an early termination criterion. Once a candidate codeword is found, its log-likelihood difference to the received sequence is compared to a preset threshold and the decoding decision is instantly…

All tools create a path of least resistance. When it comes to AI chatbots, that path is to trust the AI's outputs.
Unfortunately, all LLMs hallucinate. And as users get used to relying on the machine, their ability and willingness to spot these errors deteriorates.
Blaming the user for this is irresponsible. The problem is caused by the way these tools are designed - so it's up to us, as designers, to fix it.

Judge orders Kilmar Abrego Garcia's release from jail before trial, but ICE plans to detain him (Associated Press)
https://apnews.com/article/abrego-garcia-deportation-error-c0a515baffdf54baba412edf4cdbd310
http://www.memeorandum.com/250622/p77#a250622p77

ProCaliper: functional and structural analysis, visualization, and annotation of proteins
Jordan C. Rozum, Hunter Ufford, Alexandria K. Im, Tong Zhang, David D. Pollock, Doo Nam Kim, Song Feng
https://arxiv.org/abs/2506.19961

ProCaliper: functional and structural analysis, visualization, and annotation of proteins
Understanding protein function at the molecular level requires connecting residue-level annotations with physical and structural properties. This can be cumbersome and error-prone when functional annotation, computation of physico-chemical properties, and structure visualization are separated. To address this, we introduce ProCaliper, an open-source Python library for computing and visualizing physico-chemical properties of proteins. It can retrieve annotation and structure data from UniProt an…

A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing
Joshua Agterberg, Ren\'e Vidal
https://arxiv.org/abs/2506.20659 https://

A High-Dimensional Statistical Theory for Convex and Nonconvex Matrix Sensing
The problem of matrix sensing, or trace regression, is a problem wherein one wishes to estimate a low-rank matrix from linear measurements perturbed with noise. A number of existing works have studied both convex and nonconvex approaches to this problem, establishing minimax error rates when the number of measurements is sufficiently large relative to the rank and dimension of the low-rank matrix, though a precise comparison of these procedures still remains unexplored. In this work we provide …

An experiment in price perception error
Shawn Berry
https://arxiv.org/abs/2506.19953 https://arxiv.org/pdf/2506.19953

An experiment in price perception error
The process of consumer decision-making is multidimensional, and price perception is a very important but still not well-understood dimension for both marketers and consumers. Although heuristics or mental shortcuts are seen as biased and can cause decision errors, consumers tend to use price knowledge heuristics for purchase decisions, sometimes relying on old information. This study examined the effects of individual attitudinal and demographic factors on the ability of 351 respondents to cor…

Error recovery protocols within metastable Decoherence-Free Subspaces
Thomas Botzung, Eliana Fiorelli
https://arxiv.org/abs/2506.19631 https://

Error recovery protocols within metastable Decoherence-Free Subspaces
Open quantum systems governed by quantum master equations can exhibit quantum metastability, where decoherence-free subspaces (DFS) remain approximately invariant for long transient times before relaxing to a unique steady state. In this work, we explore the use of such metastable DFS as code spaces for passive quantum error correction. We focus on two representative models: a two-qubit system under collective dissipation, and a nonlinear driven-dissipative Kerr resonator. After characterizing …

Happy SysAdmin Day everyone! Here is a head scratcher. Website kept serving the default new site page. Even when I made a new index.html file. So I made a test.html and got Forbidden. Error log says "client denied by server configuration: /var/www/newwebsite/test.html" Not directory permissions and not selinux. So I made /var/www/newweb2 and moved the files over. Voila, working. Both test.htnl and new index.html. I'm leaving it alone because it's working and it's Friday…

Anysphere launches Bugbot, an AI-powered tool that integrates with GitHub to detect coding errors introduced by humans or AI agents, for $40 per month per user (Lauren Goode/Wired)
https://www.wired.com/story/cursor-releases-new-ai-tool-for-debugging-code/

Cursor’s New Bugbot Is Designed to Save Vibe Coders From Themselves
One of the most popular platforms for AI-assisted programming says the next era of vibe coding is all about supercharging error detection.

This https://arxiv.org/abs/2504.21003 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Efficient application of the Voigt functions in the Fourier transform
In this work, we develop a method of rational approximation of the Fourier transform (FT) based on the real and imaginary parts of the complex error function \[ w(z) = e^{-z^2}(1 - {\rm{erf}}(-iz)) = K(x,y) + iL(x,y), \quad z = x + iy, \] where $K(x,y)$ and $L(x,y)$ are known as the Voigt and imaginary Voigt functions, respectively. In contrast to our previous rational approximation of the FT, the expansion coefficients in this method are not dependent on values of a sampled function. As the va…

Optimized auxiliary functions for robust mitigation of finite-size errors in periodic hybrid density functional theory
Stephen Jon Quiton, Juan D. F. Pottecher, Xin Xing, Martin Head-Gordon, Lin Lin
https://arxiv.org/abs/2506.19157

Optimized auxiliary functions for robust mitigation of finite-size errors in periodic hybrid density functional theory
When calculating properties of periodic systems at the thermodynamic limit (TDL), the dominant source of finite size error (FSE) arises from the long-range Coulomb interaction, and can manifest as a slowly converging quadrature error when approximating an integral in the reciprocal space by a finite sum. The singularity subtraction (SS) method offers a systematic approach for reducing this quadrature error and thus the FSE. In this work, we first investigate the performance of the SS method in …

Distributed P2P quantile tracking with relative value error
Marco Pulimeno, Italo Epicoco, Massimo Cafaro
https://arxiv.org/abs/2507.17458 https://arxiv.or…

Distributed P2P quantile tracking with relative value error
In this paper we present \textsc{DUDDSketch}, a distributed version of the \textsc{UDDSketch} algorithm for accurate tracking of quantiles. The algorithm is a fully decentralized, gossip-based distributed protocol working in the context of unstructured P2P networks. We discuss the algorithm's design and formally prove its correctness. We also show, through extensive experimental results, that the algorithm converges to the results provided by the sequential algorithm, which is a fundamental and…

HAHAHAHAHA!
Marvellous! 😂
https://noc.social/@todayilearned/114908945676154083

Today I learned (@todayilearned@noc.social)
Attached: 1 image TIL in 1816, the United States built a fort to protect itself from invasion by Canada. There was only one small problem: due to a surveying error, it was built in Canada. It was later known as "Fort Blunder" https://en.wikipedia.org/wiki/Fort_Montgomery_%28Lake_Champlain%29 #til #todayilearned https://www.reddit.com/r/todayilearned/comments/1m87dq9/til_in_1816_the_united_states_built_a_fort_to/

A priori error analysis of consistent PINNs for parabolic PDEs
Shiv Mishra, Arbaz Khan
https://arxiv.org/abs/2506.17614 https://arxiv…

A priori error analysis of consistent PINNs for parabolic PDEs
We present a new a priori analysis of a class of collocation methods for parabolic PDEs that rely only on pointwise data of force term, boundary data, and initial data. Under Besov regularity assumptions, we characterize the optimal recovery rate of the solution u based on sample complexity. We establish error bounds by constructing a new consistent loss function that effectively controls the approximation error. This loss incorporates contributions from the interior, boundary, and initial data…

Well then, I guess I’ll have to replace that disk…
Except it’s a virtual disk, and should NOT be doing that. None of the other umpty-zillion VMs in that zone are showing trouble. Only this one. And the 3 other instances I launched before based on the the same original image, provided as a pre-built one for #OpenNebula from the

🇺🇦 Auf radioeins läuft...
Moderat:
🎵 A New Error (Edit)
#NowPlaying #Moderat
https://gamegate.bandcamp.com/track/moderat-a-new-error
https://open.spotify.com/track/1fmoCZ6mtMiqA5GHWPcZz9

Has anyone else come across the #BT outage? We need to ring the hospital to cancel an appt but the lines are down and now this.

Active Learning for Manifold Gaussian Process Regression
Yuanxing Cheng, Lulu Kang, Yiwei Wang, Chun Liu
https://arxiv.org/abs/2506.20928 https://

Active Learning for Manifold Gaussian Process Regression
This paper introduces an active learning framework for manifold Gaussian Process (GP) regression, combining manifold learning with strategic data selection to improve accuracy in high-dimensional spaces. Our method jointly optimizes a neural network for dimensionality reduction and a Gaussian process regressor in the latent space, supervised by an active learning criterion that minimizes global prediction error. Experiments on synthetic data demonstrate superior performance over randomly sequen…

Examination of Eye-Tracking, Head-Gaze, and Controller-Based Ray-casting in TMT-VR: Performance and Usability Across Adulthood
Panagiotis Kourtesis, Evgenia Giatzoglou, Panagiotis Vorias, Katerina Alkisti Gounari, Eleni Orfanidou, Chrysanthi Nega
https://arxiv.org/abs/2506.19519

Examination of Eye-Tracking, Head-Gaze, and Controller-Based Ray-casting in TMT-VR: Performance and Usability Across Adulthood
Virtual reality (VR) can enrich neuropsychological testing, yet the ergonomic trade-offs of its input modes remain under-examined. Seventy-seven healthy volunteers-young (19-29 y) and middle-aged (27-56 y)-completed a VR Trail-Making Test with three pointing methods: eye-tracking, head-gaze, and a six-degree-of-freedom hand controller. Completion time, spatial accuracy, and error counts for the simple (Trail A) and alternating (Trail B) sequences were analysed in 3 x 2 x 2 mixed-model ANOVAs; p…

On the error term of the fourth moment of the Riemann zeta-function
Neea Paloj\"arvi, Tim Trudgian
https://arxiv.org/abs/2506.16766 https://

On the error term of the fourth moment of the Riemann zeta-function
We examine the size of $E_{2}(T)$, the error term in the asymptotic formula for $\int_{0}^{T} |ζ(1/2 + it)|^{4}\, dt$ where $ζ(s)$ is the Riemann zeta-function. We make improvements in the powers of $\log T$ in the known bounds for $E_{2}(T)$ and $\int_{0}^{T} E_{2}(t)^{2}\, dt$. As a consequence, we obtain small logarithmic improvements for $k$th moments where $8\leq k\leq 12$. In particular, we make a modest improvement on the 12th power moment for $ζ(s)$.

Tracing Errors, Constructing Fixes: Repository-Level Memory Error Repair via Typestate-Guided Context Retrieval
Xiao Cheng, Zhihao Guo, Huan Huo, Yulei Sui
https://arxiv.org/abs/2506.18394

Tracing Errors, Constructing Fixes: Repository-Level Memory Error Repair via Typestate-Guided Context Retrieval
Memory-related errors in C programming continue to pose significant challenges in software development, primarily due to the complexities of manual memory management inherent in the language. These errors frequently serve as vectors for severe vulnerabilities, while their repair requires extensive knowledge of program logic and C's memory model. Automated Program Repair (APR) has emerged as a critical research area to address these challenges. Traditional APR approaches rely on expert-designed …

Improvement on LiDAR-Camera Calibration Using Square Targets
Zhongyuan Li, Honggang Gou, Ping Li, Jiaotong Guo, Mao Ye
https://arxiv.org/abs/2506.18294 htt…

Improvement on LiDAR-Camera Calibration Using Square Targets
Precise sensor calibration is critical for autonomous vehicles as a prerequisite for perception algorithms to function properly. Rotation error of one degree can translate to position error of meters in target object detection at large distance, leading to improper reaction of the system or even safety related issues. Many methods for multi-sensor calibration have been proposed. However, there are very few work that comprehensively consider the challenges of the calibration procedure when appli…

Tighter Error Bounds for the qDRIFT Algorithm
I. J. David, I. Sinayskiy, F. Petruccione
https://arxiv.org/abs/2506.17199 https://arxi…

Tighter Error Bounds for the qDRIFT Algorithm
Randomized algorithms such as qDRIFT provide an efficient framework for quantum simulation by sampling terms from a decomposition of the system's generator. However, existing error bounds for qDRIFT scale quadratically with the norm of the generator, limiting their efficiency for large-scale closed or open quantum system simulation. In this work, we refine the qDRIFT error bound by incorporating Jensen's inequality and a careful treatment of the integral form of the error. This yields an improv…

I grumble a lot about Terraform, but I am very impressed by their error messages.
Something I noticed today: when you get an error in evaluation, it also prints any local variables in the expression that led to the error, so you can more easily figure out what went wrong.

Error analysis of BDF schemes for the evolutionary incompressible Navier--Stokes equations
Bosco Garc\'ia-Archilla, V. John, Julia Novo
https://arxiv.org/abs/2506.16917

Error analysis of BDF schemes for the evolutionary incompressible Navier--Stokes equations
Error bounds for fully discrete schemes for the evolutionary incompressible Navier--Stokes equations are derived in this paper. For the time integration we apply BDF-$q$ methods, $q\le 5$, for which error bounds for $q\ge 3$ cannot be found in the literature. Inf-sup stable mixed finite elements are used as spatial approximation. First, we analyze the standard Galerkin method and second a grad-div stabilized method. The grad-div stabilization allows to prove error bounds with constants independ…

Oblivious Deletion Codes
Roni Con, Ray Li
https://arxiv.org/abs/2506.18878 https://arxiv.org/pdf/2506.18878

Oblivious Deletion Codes
We construct deletion error-correcting codes in the oblivious model, where errors are adversarial but oblivious to the encoder's randomness. Oblivious errors bridge the gap between the adversarial and random error models, and are motivated by applications like DNA storage, where the noise is caused by hard-to-model physical phenomena, but not by an adversary. (1) (Explicit oblivious) We construct $t$ oblivious deletion codes, with redundancy $\sim 2t\log n$, matching the existential bound for…

Optimal two-phase sampling designs for generalized raking estimators with multiple parameters of interest
Jasper B. Yang, Bryan E. Shepherd, Thomas Lumley, Pamela A. Shaw
https://arxiv.org/abs/2507.16945

Optimal two-phase sampling designs for generalized raking estimators with multiple parameters of interest
Large observational datasets compiled from electronic health records are a valuable resource for medical research but are often affected by measurement error and misclassification. Valid statistical inference requires proper adjustment for these errors. Two-phase sampling with generalized raking (GR) estimation is an efficient solution to this problem that is robust to complex error structures. In this approach, error-prone variables are observed in a large phase 1 cohort, and a subset is selec…

Hausdorff dimension of the graph of the error-sum function of continued fractions
Min Woong Ahn
https://arxiv.org/abs/2507.16536 https://

Hausdorff dimension of the graph of the error-sum function of continued fractions
We study the unweighted error-sum function $\mathcal{E}(x) \coloneqq \sum_{n \geq 0} ( x- p_n(x)/q_n(x) )$, where $p_n(x)/q_n(x)$ is the $n$th convergent of the continued fraction expansion of $x \in \mathbb{R}$. We prove that the Hausdorff dimension of the graph of $\mathcal{E}$ is exactly $1$. Our proof is number-theoretic in nature and involves Möbius inversion, summation over coprime convergent denominators, and precise upper bounds derived via continued fraction recurrence relations. As a…

Compact Analytical Model for Real-Time Evaluation of OAM-Based Inter-Satellite Links
Mohammad Taghi Dabiri, Mazen Hasna
https://arxiv.org/abs/2506.20823 ht…

Compact Analytical Model for Real-Time Evaluation of OAM-Based Inter-Satellite Links
This paper presents an efficient analytical framework for evaluating the performance of inter-satellite communication systems utilizing orbital angular momentum (OAM) beams under pointing errors. An accurate analytical model is first developed to characterize intermodal crosstalk caused by beam misalignment in OAM-based inter-satellite links. Building upon this model, we derive efficient expressions to analyze and optimize system performance in terms of bit error rate (BER). Unlike traditional …

Google will officially deprecate links generated with its goo.gl URL shortener on August 25, 2025; the company stopped generating goo.gl URLs in March 2019 (Emma Roth/The Verge)
https://www.theverge.com/news/713125/google-url-shortener-links-shutdown-deadlin…

Google’s shortened goo.gl links will stop working next month
Google will deprecate all links created with its URL shortener on August 25th, 2025. All links made with the tool will return a 404 error message after that date.

Architectural mechanisms of a universal fault-tolerant quantum computer
Dolev Bluvstein, Alexandra A. Geim, Sophie H. Li, Simon J. Evered, J. Pablo Bonilla Ataides, Gefen Baranes, Andi Gu, Tom Manovitz, Muqing Xu, Marcin Kalinowski, Shayan Majidy, Christian Kokail, Nishad Maskara, Elias C. Trapp, Luke M. Stewart, Simon Hollerith, Hengyun Zhou, Michael J. Gullans, Susanne F. Yelin, Markus Greiner, Vladan Vuletic, Madelyn Cain, Mikhail D. Lukin

Architectural mechanisms of a universal fault-tolerant quantum computer
Quantum error correction (QEC) is believed to be essential for the realization of large-scale quantum computers. However, due to the complexity of operating on the encoded `logical' qubits, understanding the physical principles for building fault-tolerant quantum devices and combining them into efficient architectures is an outstanding scientific challenge. Here we utilize reconfigurable arrays of up to 448 neutral atoms to implement all key elements of a universal, fault-tolerant quantum proce…

GOP wants to cut waste. Critics say SNAP exemption could do opposite. (Mariana Alfaro/Washington Post)
https://www.washingtonpost.com/politics/2025/07/20/snap-tax-law-error-rate/
http://www.memeorandum.com/250720/p7#a250720p7

Generalized Code Distance through Rotated Logical States in Quantum Error Correction
Valentine Nyirahafashimana, Nurisya Mohd Shah, Umair Abdul Halim, Mohamed Othman
https://arxiv.org/abs/2506.17062

Generalized Code Distance through Rotated Logical States in Quantum Error Correction
We construct rotated logical states by applying rotation operators to stabilizer states, extending the logical basis and modifying stabilizer generators. Rotation operators affect the effective code distance $d_R$, which decays exponentially with rotation angles $(θ, ϕ)$, influencing error correction performance. We quantify the scaling behavior of logical error rates under circuit-level noise, comparing standard depolarizing (SD) and superconducting-inspired (SI) noise models with small and …

Large Language Model-Driven Code Compliance Checking in Building Information Modeling
Soumya Madireddy, Lu Gao, Zia Din, Kinam Kim, Ahmed Senouci, Zhe Han, Yunpeng Zhang
https://arxiv.org/abs/2506.20551

Large Language Model-Driven Code Compliance Checking in Building Information Modeling
This research addresses the time-consuming and error-prone nature of manual code compliance checking in Building Information Modeling (BIM) by introducing a Large Language Model (LLM)-driven approach to semi-automate this critical process. The developed system integrates LLMs such as GPT, Claude, Gemini, and Llama, with Revit software to interpret building codes, generate Python scripts, and perform semi-automated compliance checks within the BIM environment. Case studies on a single-family res…

Wide-In, Narrow-Out: Revokable Decoding for Efficient and Effective DLLMs
Feng Hong, Geng Yu, Yushi Ye, Haicheng Huang, Huangjie Zheng, Ya Zhang, Yanfeng Wang, Jiangchao Yao
https://arxiv.org/abs/2507.18578

Wide-In, Narrow-Out: Revokable Decoding for Efficient and Effective DLLMs
Diffusion Large Language Models (DLLMs) have emerged as a compelling alternative to Autoregressive models, designed for fast parallel generation. However, existing DLLMs are plagued by a severe quality-speed trade-off, where faster parallel decoding leads to significant performance degradation. We attribute this to the irreversibility of standard decoding in DLLMs, which is easily polarized into the wrong decoding direction along with early error context accumulation. To resolve this, we introd…

Error Detection Based on Generalized Successive Cancellation List Decoding for Polar Codes
Alexander Sauter, Mustafa Cemil Co\c{s}kun, Gianluigi Liva
https://arxiv.org/abs/2507.16699

Error Detection Based on Generalized Successive Cancellation List Decoding for Polar Codes
Successive cancellation list (SCL) decoding has been widely adopted for polar codes, which allows near maximum likelihood performance with sufficiently large list size. In this work, we show that, if the list size is $2^γ$, where $γ$ is the fundamental quantity called mixing factor, then a modification to SCL decoding can implement Forney's generalized decoding rule. Hence, it provides an efficient means to discard unreliable decisions. The performance achieved by short polar codes under the …

A discontinuous in time Streamline Diffusion Virtual Element Method for Darcy-transport problem
R A Caraballo Diaz, F Dassi
https://arxiv.org/abs/2506.21326

A discontinuous in time Streamline Diffusion Virtual Element Method for Darcy-transport problem
We present a first numerical study of transport phenomena involving chemically reactive species, modeled by advection-diffusion-reaction systems with flow fields governed by Darcy's law. Among the various discretisation approaches, we consider the Streamline Diffusion method. Both the velocity field and the species concentrations are computed using the Virtual Element Method using a Discontinuous Galerkin scheme for time. An abstract error estimate has been derived using a special technique tha…

MoRPI-PINN: A Physics-Informed Framework for Mobile Robot Pure Inertial Navigation
Arup Kumar Sahoo, Itzik Klein
https://arxiv.org/abs/2507.18206 https://a…

MoRPI-PINN: A Physics-Informed Framework for Mobile Robot Pure Inertial Navigation
A fundamental requirement for full autonomy in mobile robots is accurate navigation even in situations where satellite navigation or cameras are unavailable. In such practical situations, relying only on inertial sensors will result in navigation solution drift due to the sensors' inherent noise and error terms. One of the emerging solutions to mitigate drift is to maneuver the robot in a snake-like slithering motion to increase the inertial signal-to-noise ratio, allowing the regression of the…

Beamforming design for minimizing the signal power estimation error
Esa Ollila, Xavier Mestre, Elias Raninen
https://arxiv.org/abs/2506.16767 https://

Beamforming design for minimizing the signal power estimation error
We study the properties of beamformers in their ability to either maintain or estimate the true signal power of the signal of interest (SOI). Our focus is particularly on the Capon beamformer and the minimum mean squared error (MMSE) beamformer. The Capon beamformer, also known as the minimum power distortionless response (MPDR) or the minimum variance distortionless response (MVDR) beamformer, is a widely used method in array signal processing. A curious feature of both the Capon and the MMSE …

Cyclicity of interaction frame transformations
Michael C D Tayler, Mohamed Sabba
https://arxiv.org/abs/2506.20594 https://arxiv.org/p…

Cyclicity of interaction frame transformations
We identify a cyclic property of rotation sequences involving piecewise displacements $β$ about arbitrary axes in three dimensions. Specifically, when transformation to the toggling frame is applied successively $m$ times, for $β=2π/m$ the original sequence returns. This main result unites several families of rotation sequences used for error-tuned control across quantum technologies, from NMR and MRI to atomic clocks and atom-scale computing. For the widest class of cycle, $m=2$, we highlig…

Correlations of error terms for weighted prime counting functions
Shubhrajit Bhattacharya, Greg Martin, Reginald M. Simpson
https://arxiv.org/abs/2507.13504

Correlations of error terms for weighted prime counting functions
Standard prime-number counting functions, such as $ψ(x)$, $θ(x)$, and $π(x)$, have error terms with limiting logarithmic distributions once suitably normalized. The same is true of weighted versions of those sums, like $π_r(x) = \sum_{p\le x} \frac1p$ and $π_\ell(x) = \sum_{p\le x} \log(1-\frac1p)^{-1}$, that were studied by Mertens. These limiting distributions are all identical, but passing to the limit loses information about how these error terms are correlated with one another. In t…

$\textit{A Priori}$ Error Analysis for the $p$-Stokes Equations with Slip Boundary Conditions: A Discrete Leray Projection Framework
Alex Kaltenbach, J\"orn Wichmann
https://arxiv.org/abs/2507.15016

$\textit{A Priori}$ Error Analysis for the $p$-Stokes Equations with Slip Boundary Conditions: A Discrete Leray Projection Framework
We present an $\textit{a priori}$ error analysis for the kinematic pressure in a fully-discrete finite-differences/-elements discretization of the unsteady $p$-Stokes equations, modelling non-Newtonian fluids. This system is subject to both impermeability and perfect Navier slip boundary conditions, which are incorporated either weakly via Lagrange multipliers or strongly in the discrete velocity space. A central aspect of the $\textit{a priori}$ error analysis is the discrete Leray projection,…

New Bounds and Constructions for Variable Packet-Error Coding
Xiangliang Kong, Xin Wang, Ron M. Roth, Itzhak Tamo
https://arxiv.org/abs/2506.15233 https://…

New Bounds and Constructions for Variable Packet-Error Coding
In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination through multiple disjoint paths. The objective is to design codes with dynamic error-correcting capabilities that adapt to varying numbers of errors. Specifically, we first provide several bounds on the rate--distortion trade-off for general variable packet-error coding schemes. Then, we present two explicit constructions …

Continuous operation of a coherent 3,000-qubit system
Neng-Chun Chiu, Elias C. Trapp, Jinen Guo, Mohamed H. Abobeih, Luke M. Stewart, Simon Hollerith, Pavel Stroganov, Marcin Kalinowski, Alexandra A. Geim, Simon J. Evered, Sophie H. Li, Lisa M. Peters, Dolev Bluvstein, Tout T. Wang, Markus Greiner, Vladan Vuleti\'c, Mikhail D. Lukin
https://

Continuous operation of a coherent 3,000-qubit system
Neutral atoms are a promising platform for quantum science, enabling advances in areas ranging from quantum simulations and computation to metrology, atomic clocks and quantum networking. While atom losses typically limit these systems to a pulsed mode, continuous operation could significantly enhance cycle rates, remove bottlenecks in metrology, and enable deep-circuit quantum evolution through quantum error correction. Here we demonstrate an experimental architecture for high-rate, continuous…

Geometrical portrait of Multipath error propagation in GNSS Direct Position Estimation
Jihong Huang, Rong Yang, Wei Gao, Xingqun Zhan, Zheng Yao
https://arxiv.org/abs/2507.18096

Geometrical portrait of Multipath error propagation in GNSS Direct Position Estimation
Direct Position Estimation (DPE) is a method that directly estimate position, velocity, and time (PVT) information from cross ambiguity function (CAF) of the GNSS signals, significantly enhancing receiver robustness in urban environments. However, there is still a lack of theoretical characterization on multipath errors in the context of DPE theory. Geometric observations highlight the unique characteristics of DPE errors stemming from multipath and thermal noise as estimation bias and variance…

Quantum nonlocality without entanglement and state discrimination measures
Shayeef Murshid, Tathagata Gupta, Vincent Russo, Somshubhro Bandyopadhyay
https://arxiv.org/abs/2506.20560

Quantum nonlocality without entanglement and state discrimination measures
An ensemble of product states is said to exhibit "quantum nonlocality without entanglement" if the states cannot be optimally discriminated by local operations and classical communication (LOCC). We show that this property can depend on the measure of state discrimination. We present a family of ensembles, each consisting of six linearly independent, equally probable product states for which LOCC fails to achieve optimal minimum-error discrimination but succeeds in achieving optimal unambiguous…

Error estimates and adaptivity for a least-squares method applied to the Monge-Amp\`ere equation
Alexandre Caboussat, Anna Peruso, Marco Picasso
https://arxiv.org/abs/2507.17569

Error estimates and adaptivity for a least-squares method applied to the Monge-Ampère equation
We introduce novel a posteriori error indicators for a nonlinear least-squares solver for smooth solutions of the Monge--Ampère equation on convex polygonal domains in $\mathbb{R}^2$. At each iteration, our iterative scheme decouples the problem into (i) a pointwise nonlinear minimization problem and (ii) a linear biharmonic variational problem. For the latter, we derive an equivalence to a biharmonic problem with Navier boundary conditions and solve it via mixed piecewise-linear finite elemen…

On the connection between zero-free regions and the error term in the Prime Number Theorem
Frederik Broucke
https://arxiv.org/abs/2507.13780 https://

On the connection between zero-free regions and the error term in the Prime Number Theorem
We provide for a wide class of zero-free regions an upper bound for the error term in the Prime Number Theorem, refining works of Pintz (1980), Johnston (2024), and Révész (2024). Our method does not only apply to the Riemann zeta function, but to general Beurling zeta functions. Next we construct Beurling zeta functions having infinitely many zeros on a prescribed contour, and none to the right, for a wide class of such contours. We also deduce an oscillation result for the corresponding err…

Error Correcting Codes for Segmented Burst-Deletion Channels
Yajuan Liu, Tolga M. Duman
https://arxiv.org/abs/2507.14070 https://arxi…

Error Correcting Codes for Segmented Burst-Deletion Channels
We study segmented burst-deletion channels motivated by the observation that synchronization errors commonly occur in a bursty manner in real-world settings. In this channel model, transmitted sequences are implicitly divided into non-overlapping segments, each of which may experience at most one burst of deletions. In this paper, we develop error correction codes for segmented burst-deletion channels over arbitrary alphabets under the assumption that each segment may contain only one burst of …

Comparison of spin-qubit architectures for quantum error-correcting codes
Mauricio Guti\'errez, Juan S. Rojas-Arias, David Obando, Chien-Yuan Chang
https://arxiv.org/abs/2506.17190

Comparison of spin-qubit architectures for quantum error-correcting codes
We investigate the performance of two quantum error-correcting codes, the surface code and the Bacon-Shor code, for implementation with spin qubits in silicon. In each case, we construct a logical qubit using a planar array of quantum dots, exploring two encoding schemes: one based solely on single-electron Zeeman qubits (Loss-DiVincenzo qubits), and a hybrid approach combining Zeeman and singlet-triplet qubits. For both codes, we evaluate key performance metrics, including logical state prepar…

Construction of Self-Orthogonal Quasi-Cyclic Codes and Their Application to Quantum Error-Correcting Codes
Mengying Gao, Yuhua Sun, Tongjiang Yan, Chun'e Zhao
https://arxiv.org/abs/2507.17319

Construction of Self-Orthogonal Quasi-Cyclic Codes and Their Application to Quantum Error-Correcting Codes
In this paper, necessary and sufficient conditions for the self-orthogonality of t-generator quasi-cyclic (QC) codes are presented under the Euclidean, Hermitian, and symplectic inner products, respectively. Particularly, by studying the structure of the dual codes of a class of 2-generator QC codes, we derive necessary and sufficient conditions for the QC codes to be dual-containing under the above three inner products. This class of 2-generator QC codes generalizes many known codes in the lit…

Nonstabilizerness and Error Resilience in Noisy Quantum Circuits
Fabian Ballar Trigueros, Jos\'e Antonio Mar\'in Guzm\'an
https://arxiv.org/abs/2506.18976

Nonstabilizerness and Error Resilience in Noisy Quantum Circuits
We investigate how noise impacts nonstabilizerness - a key resource for quantum advantage - in many-body qubit systems. While noise typically degrades quantum resources, we show that amplitude damping, a nonunital channel, can generate or enhance magic, whereas depolarizing noise provably cannot. In an encoding-decoding protocol, we find that, unlike in the coherent case, a sharp decoding fidelity transition does not match a transition in nonstabilizerness. Our results point toward the possibil…

Extending Data to Improve Stability and Error Estimates Using Asymmetric Kansa-like Methods to Solve PDEs
Thomas Hangelbroek, Francis J. Narcowich, Joseph D. Ward
https://arxiv.org/abs/2507.15137

Extending Data to Improve Stability and Error Estimates Using Asymmetric Kansa-like Methods to Solve PDEs
In this paper, a theoretical framework is presented for the use of a Kansa-like method to numerically solve elliptic partial differential equations on spheres and other manifolds. The theory addresses both the stability of the method and provides error estimates for two different approximation methods. A Kansa-like matrix is obtained by replacing the test point set $X$, used in the traditional Kansa method, by a larger set $Y$, which is a norming set for the underlying trial space…

Error-detected coherence metrology of a dual-rail encoded fixed-frequency multimode superconducting qubit
James Wills, Mohammad Tasnimul Haque, Brian Vlastakis
https://arxiv.org/abs/2506.15420

Error-detected coherence metrology of a dual-rail encoded fixed-frequency multimode superconducting qubit
Amplitude damping is a dominant source of error in high performance quantum processors. A promising approach in quantum error correction is erasure error conversion, where errors are converted into detectable leakage states. Dual-rail encoding has been shown as a candidate for the conversion of amplitude-damping errors; with unique sensitivities to noise and decoherence sources. Here we present a dual-rail encoding within a single fixed-frequency superconducting multimode transmon qubit. The th…

On the convergence analysis of MsFEM with oversampling: Interpolation error
Guanglian Li
https://arxiv.org/abs/2507.14548 https://arx…

On the convergence analysis of MsFEM with oversampling: Interpolation error
In this paper, we investigate the approximation properties of two types of multiscale finite element methods with oversampling as proposed in [Hou \& Wu, {\textit{J. Comput. Phys.}}, 1997] and [Efendiev, Hou \& Wu, \textit{SIAM J. Numer. Anal.}, 2000] without scale separation. We develop a general interpolation error analysis for elliptic problems with highly oscillatory rough coefficients, under the assumption of the existence of a macroscopic problem with suitable $L^2$-accuracy. The distinct…

A priori error analysis of the proximal Galerkin method
Brendan Keith, Rami Masri, Marius Zeinhofer
https://arxiv.org/abs/2507.13516 https://

A priori error analysis of the proximal Galerkin method
The proximal Galerkin (PG) method is a finite element method for solving variational problems with inequality constraints. It has several advantages, including constraint-preserving approximations and mesh independence. This paper presents the first abstract a priori error analysis of PG methods, providing a general framework to establish convergence and error estimates. As applications of the framework, we demonstrate optimal convergence rates for both the obstacle and Signorini problems using…

Ultrastable, low-error dynamic polarization encoding of deterministically generated single photons
Joscha Hanel, Zenghui Jiang, Jipeng Wang, Frederik Benthin, Tom Fandrich, Eddy Patrick Rugeramigabo, Raphael Joos, Michael Jetter, Simone Luca Portalupi, Jingzhong Yang, Michael Zopf, Peter Michler, Fei Ding
https://arxiv.org/abs/2…

Ultrastable, low-error dynamic polarization encoding of deterministically generated single photons
The ability to inscribe information on single photons at high speeds is a crucial requirement for quantum applications such as quantum communication and measurement-based photonic quantum computation. Nowadays, most experimental implementations employ phase modulators in single-pass, Mach-Zehnder interferometer or Michelson interferometer configurations to encode information on photonic qubits. However, these approaches are intrinsically sensitive to environmental influences, limiting the achie…

Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding
Daiki Komoto, Kenta Kasai
https://arxiv.org/abs/2507.11534 https://

Sharp Error-Rate Transitions in Quantum QC-LDPC Codes under Joint BP Decoding
In this study, we report that quantum quasi-cyclic low-density parity-check codes decoded via joint belief propagation (BP) exhibit steep error-rate curves, despite the presence of error floors. To the best of our knowledge, this is the first observation of such threshold-like behavior for quantum codes with non-vanishing coding rate, excluding those decoded with non-binary BP decoders. Moreover, we find that dominant error events contributing to the error floor typically involve only a small n…

Error exponents for tripartite-to-bipartite entanglement transformations
P\'eter Vrana
https://arxiv.org/abs/2507.13778 https://a…

Error exponents for tripartite-to-bipartite entanglement transformations
We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the minimum of the von Neumann entropies of the two corresponding marginals, and under asymptotic stochastic local operations and classical communication the maximal rate is given by a minimization over a one-parameter family of entanglement measures. In this paper, …

No-go theorems for logical gates on product quantum codes
Xiaozhen Fu, Han Zheng, Zimu Li, Zi-Wen Liu
https://arxiv.org/abs/2507.16797 https://

No-go theorems for logical gates on product quantum codes
Quantum error-correcting codes are essential to the implementation of fault-tolerant quantum computation. Homological products of classical codes offer a versatile framework for constructing quantum error-correcting codes with desirable properties, especially quantum low-density parity check (qLDPC) codes. Based on extensions of the Bravyi--König theorem that encompass codes without geometric locality, we establish a series of general no-go theorems for fault-tolerant logical gates supported b…

Scalable dissipative quantum error correction for discrete-variable codes
Ivan Rojkov, Elias Zapusek, Florentin Reiter
https://arxiv.org/abs/2507.12534 htt…

Scalable dissipative quantum error correction for discrete-variable codes
Dissipative quantum error correction (QEC) autonomously protects quantum information using engineered dissipation and offers a promising alternative to error correction via measurement and feedback. However, scalability remains a challenge, as correcting high-weight errors typically requires increasing dissipation rates and exponentially many correction operators. Here, we present a scalable dissipative QEC protocol for discrete-variable codes, correcting multi-qubit errors via a trickle-down m…

Enhancing Decoding Performance using Efficient Error Learning
Pavithran Iyer, Aditya Jain, Stephen D. Bartlett, Joseph Emerson
https://arxiv.org/abs/2507.08536

Enhancing Decoding Performance using Efficient Error Learning
Lowering the resource overhead needed to achieve fault-tolerant quantum computation is crucial to building scalable quantum computers. We show that adapting conventional maximum likelihood (ML) decoders to a small subset of efficiently learnable physical error characteristics can significantly improve the logical performance of a quantum error-correcting code. Specifically, we leverage error information obtained from efficient characterization methods based on Cycle Error Reconstruction (CER), …

Design Automation in Quantum Error Correction
Archisman Ghosh, Avimita Chatterjee, Swaroop Ghosh
https://arxiv.org/abs/2507.12253 https://

Design Automation in Quantum Error Correction
Quantum error correction (QEC) underpins practical fault-tolerant quantum computing (FTQC) by addressing the fragility of quantum states and mitigating decoherence-induced errors. As quantum devices scale, integrating robust QEC protocols is imperative to suppress logical error rates below threshold and ensure reliable operation, though current frameworks suffer from substantial qubit overheads and hardware inefficiencies. Design automation in the QEC flow is thus critical, enabling automated s…

Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound
Kenta Kasai
https://arxiv.org/abs/2506.15636 https://arx…

Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound
Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decodin…