Zobrazeno 1 - 10
of 1 411
pro vyhledávání: '"F.2.1"'
Simulating quantum systems using classical computing equipment has been a significant research focus. This work demonstrates that circuits as large and complex as the random circuit sampling (RCS) circuits published as a part of Google's pioneering w
Externí odkaz:
http://arxiv.org/abs/2411.12131
Autor:
Castro, Fernando Peralta
Cryptography, derived from Greek meaning hidden writing, uses mathematical techniques to secure information by converting it into an unreadable format. While cryptography as a science began around 100 years ago, its roots trace back to ancient civili
Externí odkaz:
http://arxiv.org/abs/2411.14451
Static Application Security Testing(SAST) tools are crucial for early bug detection and code quality but often generate false positives that slow development. Automating false positive mitigation is thus essential for advancing SAST tools. Past effor
Externí odkaz:
http://arxiv.org/abs/2411.03079
Autor:
Guseynov, Nikita, Liu, Nana
The ability to effectively upload data onto quantum states is an important task with broad applications in quantum computing. Numerous quantum algorithms heavily rely on the ability to efficiently upload information onto quantum states, without which
Externí odkaz:
http://arxiv.org/abs/2411.01131
We study algorithms for approximating the spectral density of a symmetric matrix $A$ that is accessed through matrix-vector product queries. By combining a previously studied Chebyshev polynomial moment matching method with a deflation step that appr
Externí odkaz:
http://arxiv.org/abs/2410.21690
Autor:
Sobczyk, Aleksandros
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. We first provide an analysis for the divide-and-conquer tridiagonal eigensolver of Gu and Eisenstat [GE95] in the Real RAM model, when accelerated with the Fast Mul
Externí odkaz:
http://arxiv.org/abs/2410.21550
Autor:
Paszyński, Maciej
We show that assuming the availability of the processor with variable precision arithmetic, we can compute matrix-by-matrix multiplications in $O(N^2log_2N)$ computational complexity. We replace the standard matrix-by-matrix multiplications algorithm
Externí odkaz:
http://arxiv.org/abs/2410.21050
Given a fixed arity $k \geq 2$, Min-$k$-CSP on complete instances involves a set of $n$ variables $V$ and one nontrivial constraint for every $k$-subset of variables (so there are $\binom{n}{k}$ constraints). The goal is to find an assignment that mi
Externí odkaz:
http://arxiv.org/abs/2410.19066
As AI systems increasingly integrate into critical societal sectors, the demand for robust privacy-preserving methods has escalated. This paper introduces Data Obfuscation through Latent Space Projection (LSP), a novel technique aimed at enhancing AI
Externí odkaz:
http://arxiv.org/abs/2410.17459
We explore a robust version of the barycenter problem among $n$ centered Gaussian probability measures, termed Semi-Unbalanced Optimal Transport (SUOT)-based Barycenter, wherein the barycenter remains fixed while the others are relaxed using Kullback
Externí odkaz:
http://arxiv.org/abs/2410.08117