SEARCH · Search arXiv

Results for “cs.ET”

Search indexed arXiv papers on artificial intelligence, large language models, computer vision and robotics. Read source abstracts and follow links to arXiv.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

5,200 recordsLinked to original sources

arXiv2026

A brief history of quantum vs classical computational advantage

In this review article we summarize all experiments claiming quantum computational advantage to date. Our review highlights challenges, loopholes, and refutations appearing in subsequent work to provide a complete picture of the current statuses of these experiments. In addition, we also discuss theoretical computational advantage in example problems such as approximate optimization and recommendation systems. Finally, we review recent experiments in quantum error correction -- the biggest frontier to reach experimental quantum advantage in Shor's algorithm.

quant-ph↗

arXiv2026

Redundancy rules for MaxSAT

The concept of redundancy in SAT leads to more expressive and powerful proof search techniques, e.g., able to express various inprocessing techniques, and originates interesting hierarchies of proof systems [Heule et$.$al'20, Buss-Thapen'19]. Redundancy has also been integrated in MaxSAT [Ihalainen et$.$al'22, Berg et$.$al'23, Bonacina et$.$al'24]. In this paper, we define a structured hierarchy of redundancy proof systems for MaxSAT, with the goal of studying its proof complexity. We obtain MaxSAT variants of proof systems such as SPR, PR, SR, and others, previously defined for SAT. All our rules are polynomially checkable, unlike [Ihalainen et$.$al'22]. Moreover, they are simpler and weaker than [Berg et$.$al'23], and possibly amenable to lower bounds. This work also complements the approach of [Bonacina et$.$al'24]. Their proof systems use different rule sets for soft and hard clauses, while here we propose a system using only hard clauses and blocking variables. This is easier to integrate with current solvers and proof checkers. We discuss the strength of the systems introduced, we show some limitations of them, and we give a short cost-SR proof that any assignment for the weak pigeonhole principle $PHP^{m}_{n}$ falsifies at least $m-n$ clauses. We conclude by discussing the integration of our rules with the MaxSAT resolution proof system, which is a commonly studied proof system for MaxSAT.

cs.LO↗

arXiv2026

Mutually unbiased bases as extremal probes of isotropic random Hamiltonians

Mutually unbiased bases (MUBs) are central finite structures in quantum information. We ask whether complete MUB systems have an extremal probing property beyond their projective $2$-design identities. For an isotropic Gaussian traceless Hamiltonian, we prove that, among labeled unions of $d+1$ orthonormal bases, a complete MUB union has the stochastically largest sampled maximum. Each basis induces the same regular-simplex Gaussian block; mutual unbiasedness eliminates cross-block covariance, joint Gaussianity yields independence, and a centered-convex Gaussian correlation inequality makes this independent coupling extremal. We also derive a radial-mixture extension and prove exact MUB-family collapse for fully matched diagonal-cost constructions.

quant-ph↗

arXiv2026

A Novel Space-Time Coding Architecture for Rydberg Atomic Quantum Receiver-Based Systems

Rydberg atomic quantum receivers (RAQRs) offer high sensitivity and wide tunability, but their magnitude-based readout yields a nonlinear model incompatible with conventional complex-valued multi-input multi-output (MIMO) processing. We propose a low-complexity space-time coding framework for point-to-point RAQR-assisted MIMO links. Data symbols are encoded using real orthogonal designs, while strong-reference heterodyne reception yields an equivalent real-valued linear model. The preserved orthogonality enables matched filter symbol-wise detection without matrix inversion or vector search. An analytical bit error probability expression is derived, proving the proposed scheme achieves the full transmit-receive diversity. Simulations validate the analysis and demonstrate improved performance over spatial multiplexing benchmarks.

cs.ET↗

arXiv2026

Rock, Paper, Scissors, ... Dynamite - A Model of Disruption from New Technologies

We seek to understand the effect of adding disruptive highly-capable new technologies to competitions by assessing the addition of Dynamite to Rock-Paper-Scissors. We find that providing a versatile Dynamite move to only one player provides limited value (win probability increases from 50% to 55.5%) and is played rarely. That value decreases further if the game is expanded beyond just the original three moves. We also observe several mechanisms by which prior moves can become strategically unplayable, or obsolete. We hope that this model illustrates some non-intuitive aspects of developing new versatile technologies. We also hope that it illustrates some pitfalls for developers and integrators to avoid in order to create value rather than merely capability.

physics.soc-ph↗

arXiv2026

Quantum Computing: Lecture Notes

This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 4 chapters about complexity, 4 chapters about distributed ("Alice and Bob") settings, a chapter about quantum machine learning, one about stabilizer states and Clifford circuits, and a final chapter about quantum error correction. Appendices A and B give a brief introduction to the required linear algebra and some other mathematical and computer science background. All chapters come with exercises, with some hints provided in Appendix C.

quant-ph↗

arXiv2026

Rights by Architecture: A Human-Compatible Sociotechnical Layer for Digital Protection Across Regulatory Regimes

Digital rights increasingly exist in law but remain difficult to exercise through the information systems that mediate them. Using disciplined conceptual synthesis and problematization, this critical-conceptual IS paper explains the gap through the interaction of legal heterogeneity, conflicting organizational and commercial incentives, fragmented architectures, and asymmetrical control over rights-relevant acts. It then theorizes a human-compatible rights layer: a governed sociotechnical capability for standardized, machine-readable, bidirectional, and jurisdictionally plural communication of requests, consent, refusal, withdrawal, objection, records, and support. Comparing California-style opt-out signals, the EU's mixed lawful-basis regime, and P3P, DNT, GPC, and ADPC, the paper derives seven normative requirements, develops rights by architecture as a bounded emancipatory policy argument, and treats a proposed GDPR provision on automated and machine-readable privacy management as a policy case for moving from banner-based compliance toward rights-supporting digital infrastructure.

cs.CY↗

arXiv2026

Simulation-Based Evaluation of Energy-Constrained Quantum-Classical Competition

This paper develops a simulation-based framework for evaluating the energy implications of quantum and classical computing firms competing in a market with limited energy resources. We model providers as differentiated Cournot competitors whose feasible service capacity is induced by technology-specific energy scaling laws: polylogarithmic for quantum algorithms that achieve an equivalent computational target and polynomial for classical emulation. For symmetric groups of quantum and classical firms, the equilibrium reduces to a tractable two-equation system that supports large scenario sweeps over market size, technology mix, and hardware coefficients. We characterize the capacity-constrained Nash equilibrium, prove the existence of a demand scale beyond which quantum service becomes more energy efficient, and report numerical experiments calibrated to trapped-ion and Rydberg platforms. The results identify when quantum energy advantage is only asymptotic and when it becomes operationally relevant.

quant-ph↗

arXiv2026

Great Expectations: Benchmarking the Real-World Performance of RVV 1.0 in HPC

Following the ratification of the RISC-V Vector Extension (RVV 1.0), new commercially available silicon has been adopting the extension. This paper revisits the question of RISC-V viability for High-Performance-Computing (HPC) by benchmarking the latest RVV 1.0-capable hardware (SiFive X280 (Tenstorrent Blackhole), SpacemiT X60 (K1) and X100/A100 (K3), and T-Head C920v2 (Sophon SG2044)). We assess these platforms using standard HPC benchmarks (BLAS, FFTW, HPL, HPCG) and synthetic workloads (STREAM, FMA throughput) and compare them to a state-of-the-art HPC ARM64 chip (NVIDIA Grace). Our findings show that while RVV 1.0 delivers significant performance improvements over scalar execution, hardware-specific implementation challenges remain. We detail these performance characteristics and discuss the remaining hurdles for RISC-V, including RVV, to become a mainstay in the HPC landscape.

cs.DC↗

arXiv2026

Emergent Behavior and Uncertainty in IoT-Enhanced Business Processes: Challenges and Future Directions

IoT-enhanced business processes are characterized by high complexity due to heterogeneous actors, varying levels of autonomy among participating systems, continuously evolving execution contexts spanning the digital and physical worlds, and continuous event streams. In such settings, process behavior partially emerges only at runtime through complex interactions involving humans, IoT devices, physical objects, software systems, agents, and services. This complexity introduces partial observability, uncertainty, and runtime dynamics that are difficult to anticipate and that challenge traditional business process management (BPM) assumptions and systems. We discuss these challenges from three perspectives, addressing 1) uncertainty representation, 2) operationalization of IoT-enhanced processes, and 3) runtime management of emergent behavior. Based on a motivating scenario and an analysis of the state of the art, we identify open research gaps and outline short-, medium-, and long-term recommendations to shape a research agenda on emergent behavior in IoT-enhanced business processes.

cs.ET↗

arXiv2026

Quantum Workload Privacy Beyond Data Confidentiality

Remote quantum computing exposes a confidentiality gap. Standard privacy mechanisms protect quantum states and outputs, but not the scientific structure of a workload. This work reveals that hardware-aware compilation leaves observable signatures, such as routing overhead, circuit depth, and gate composition, that correlate with hidden modelling choices like partial differential equation boundary conditions, discretisation scale, and molecular geometry. The leakage arises from the mismatch between logical topology and fixed hardware connectivity, forcing problem-dependent SWAP insertion. We formalise this threat as Scientific-Intent Indistinguishability and prove that passive security is asymptotically unachievable under routing-optimal compilation. Experiments on a 156-qubit IBM Heron processor achieve near-perfect classification of boundary regimes and molecular geometries, with leakage generalising across solver families via routing-scaling exponents. Conventional gate-padding fails as a defence, causing fidelity drops without reducing adversarial advantage. Our results show that protecting quantum data alone is insufficient; execution-level confidentiality must become a first-class design requirement.

cs.ET↗

arXiv2026

Performance evaluation of variational quantum eigensolver and quantum dynamics algorithms on the advection-diffusion equation

Near-term quantum algorithms are a promising route to solving partial differential equations, but gauging their true potential requires separating algorithmic performance from sampling and hardware noise. We benchmark a ground-state variational quantum eigensolver (VQE), cast as a variational quantum linear solver, against the Trotterization, variational quantum imaginary time evolution, and adaptive variational quantum dynamics simulation methods applied to the one-dimensional advection-diffusion equation in the recent quantum-dynamics study by Alipanah et al. [Phys. Rev. Res. 7, 043318 (2025)] at matched grid and problem size. On a noiseless state-vector simulator the $N=4$ VQE drives the final-time infidelity to a numerical floor ($\sim\!10^{-14}$) once the depth reaches $L\approx5$, an \emph{algorithmic ceiling} set by exact expectation values. Evaluating the same solver with a finite number $S$ of measurement shots, still without hardware noise, makes the infidelity sampling limited, following $1-f\approx c/S$ (a best-case readout-sampling estimate, with the solution's signs assumed known), providing a regime-matched comparison with the shot-based emulator of Alipanah \emph{et al.}\ and explaining the gap to their noisy hardware runs ($>10^{-1}$). The benchmark thus decomposes the near-term error budget into algorithmic, sampling, and hardware contributions, with a matched-depth resource comparison. The formulation applies without modification across $N=4,5,6$ qubits and to a two-dimensional (eight-qubit, $16\times16$) problem evolved to $t=1$, where the state-vector VQE holds a $\sim\!10^{-7}$ algorithmic-ceiling infidelity against the sampling-limited $\sim\!10^{-5}$ of the corresponding shot-based simulation, a difference of measurement regime rather than algorithmic superiority.

quant-ph↗

arXiv2026

Emerging Media Use and Acceptance of Digital Immortality: A Cluster Analysis among Chinese Young Generations

Digital immortality is increasingly discussed as a technological possibility, yet empirical evidence about potential users' evaluations remains limited. We surveyed 462 Chinese young adults, combining cluster analysis of four emerging-media use frequencies with valence coding of open-ended responses to physical death, physical immortality, digital immortality, and digital death. Three profiles emerged: broad emerging-media, gaming-focused, and low-use users. Broad emerging-media users reported the highest adjusted acceptance and scored higher on several personality and worldview measures, while fear of death did not differ across profiles. Physical immortality elicited the most negative responses; digital immortality produced more mixed, less negative appraisals. More favorable digital-immortality appraisals predicted higher acceptance after adjustment for media-use profile and demographics, although scenario valence did not differ across profiles. The findings distinguish general receptivity associated with emerging-media repertoires from emotional responses to specific imagined futures, showing that evaluations depend on the form of continuity envisioned.

cs.CY↗

arXiv2026

Meeting the Coming Wave: The Emerging Politics of AI and Work across 33 Parliaments

A new politics of artificial intelligence and work is taking shape across party systems, but comparative politics has yet to map it. Using 1,514,950 parliamentary speeches from 33 parliaments (2023-2026), we show this politics follows a different logic than political economy expects. Research anticipates that technological disruption generates demands for compensation; instead, compensation accounts for just 2.3% of response-frame mentions, while enablement and investment dominate (55.2%), regulation and restriction follow (21.8%), and training (20.6%) appears at similar rates across families. Parties disagree instead over what AI means for work and how far this technology should be restrained. The mainstream and radical right support unrestricted enablement; the left is critical but divided on remedy. Social democrats stay adoption-oriented; greens split evenly. The radical left is the clearest force for restriction. The AI conflict thus concerns not compensation after disruption, but whether politics should enable technological change or govern its trajectory.

cs.CY↗

arXiv2026

Quantum-Based Solutions for Security Enhancement in Open Radio Access Networks

Open Radio Access Networks (O-RAN) introduce unprecedented flexibility, interoperability, and intelligence into next-generation wireless systems, but their disaggregated and software-defined architecture also expands the attack surface and creates new security vulnerabilities. Conventional cryptographic mechanisms, while effective against classical threats, may become insufficient in the presence of quantum-enabled adversaries. This article presents a comprehensive perspective on quantum security for O-RAN, examining how quantum-resilient mechanisms can enhance confidentiality, authentication, and trust across the RAN ecosystem. It discusses post-quantum cryptography (PQC), quantum cryptography, quantum authentication, and quantum-enhanced threat detection within a zero-trust architecture based on continuous verification, least privilege, and micro-segmentation. Their integration with the Near-Real-Time (Near-RT) RAN Intelligent Controller, O-Cloud, and open interfaces is analyzed, together with practical deployment considerations, technology maturity, and adoption timelines. Finally, open research directions are outlined toward secure, resilient, and future-proof O-RAN architectures for 6G networks.

cs.CR↗

arXiv2025

Agentic Workflow for Education: Concepts and Applications

With the rapid advancement of Large Language Models (LLMs) and Artificial Intelligence (AI) agents, agentic workflows are showing transformative potential in education. This study introduces the Agentic Workflow for Education (AWE), a four-component model comprising self-reflection, tool invocation, task planning, and multi-agent collaboration. We distinguish AWE from traditional LLM-based linear interactions and propose a theoretical framework grounded in the von Neumann Multi-Agent System (MAS) architecture. Through a paradigm shift from static prompt-response systems to dynamic, nonlinear workflows, AWE enables scalable, personalized, and collaborative task execution. We further identify four core application domains: integrated learning environments, personalized AI-assisted learning, simulation-based experimentation, and data-driven decision-making. A case study on automated math test generation shows that AWE-generated items are statistically comparable to real exam questions, validating the model's effectiveness. AWE offers a promising path toward reducing teacher workload, enhancing instructional quality, and enabling broader educational innovation.

cs.CY↗

arXiv2026

Transmissive RIS-Assisted Vehicular Direct-to-Satellite Communications: Opportunities, Limitations, and Comparison with Phased Arrays

This article studies transmissive reconfigurable intelligent surface (RIS)-assisted architectures. It compares them with electronically steered phased arrays for the deployment of vehicular direct-to-satellite (D2S) communications in future satellite networks. Rather than treating RIS as a direct replacement for phased arrays, we clarify the operating regimes in which RIS can serve as a low-power wavefront-shaping aperture and those in which phased arrays remain preferable because of their high gain and mature beam-tracking capability. Moreover, phased arrays can support multi-beam operation, which is particularly beneficial for dual connectivity and seamless handover. We distinguish analog, digital, and hybrid phased arrays, discuss the relationship between transmissive RIS and reconfigurable transmitarrays, and highlight practical profile, tracking, and link-budget constraints for mobile terminals. The comparison shows that passive RIS offers attractive power efficiency and aperture scalability, active RIS can partially improve the link budget, and phased arrays remain preferable for high-throughput.

cs.IT↗

arXiv2026

Efficient Memristive Spiking Neural Networks Architecture with Supervised In-Situ STDP Method

Memristor-based Spiking Neural Networks (SNNs) with temporal spike encoding enable ultra-low-energy computation, making them ideal for battery-powered intelligent devices. This paper presents a circuit-level memristive spiking neural network (SNN) architecture trained using a proposed novel supervised in-situ learning algorithm inspired by spike-timing-dependent plasticity (STDP). The proposed architecture efficiently implements lateral inhibition and the refractory period, eliminating the need for external microcontrollers or ancillary control hardware. All synapses of the winning neurons are updated in parallel, enhancing training efficiency. The modular design ensures scalability with respect to input data dimensions and output class count. The SNN is evaluated in LTspice for pattern recognition (using 5x3 binary images) and classification tasks using the Iris and Breast Cancer Wisconsin (BCW) datasets. During testing, the system achieved perfect pattern recognition and high classification accuracies of 99.11\% (Iris) and 97.9\% (BCW). Additionally, it has demonstrated robustness, maintaining an average recognition rate of 93.4\% under 20\% input noise. The impact of stuck-at-conductance faults and memristor device variations was also analyzed.

cs.ET↗