检索结果-内蒙古大学图书馆

Holonomic swap and controlled-swap gates of neutral atoms via selective Rydberg pumping

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, C.F. Chen, X.Y. Mu, W.L. Wang, G.C. You, J.B. Shao, X.Q. Center for Quantum Sciences School of Physics Northeast Normal University Changchun130024 China Key Laboratory for UV Light-Emitting Materials and Technology of Ministry of Education Northeast Normal University Changchun130024 China Department of Physics Beijing Normal University Beijing100875 China 1 Fusionopolis Way Connexis 138632 Singapore

Holonomic quantum computing offers a promising paradigm for quantum computation due to its error resistance and the ability to perform universal quantum computations. Here, we propose a scheme for the rapid implementation of a holonomic swap gate in neutral atomic systems, based on the selective Rydberg pumping mechanism. By employing time-dependent soft control, we effectively mitigate the impact of off-resonant terms even at higher driving intensities compared to time-independent driving. This approach accelerates the synthesis of logic gates and passively reduces the decoherence effects. Furthermore, by introducing an additional atom and applying the appropriate driving field, our scheme can be directly extended to implement a three-qubit controlled-swap gate. This advancement makes it a valuable tool for quantum state preparation, quantum switches, and a variational quantum algorithm in neutral atom systems. © 2024, CC BY.

关键词： computation theory

A Verifiable Computing Scheme for Encrypted Control Systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Stabile, Francesca Lucia, Walter Youssef, Amr Franzè, Giuseppe DIMEG Università della Calabria Via Pietro Bucci Cubo 42-C CS Rende87036 Italy Concordia University Montreal Canada

The proliferation of cloud computing technologies has paved the way for deploying networked encrypted control systems, offering high performance, remote accessibility and privacy. However, in scenarios where the control algorithms run on third-party cloud service providers, the control’s logic might be changed by a malicious agent on the cloud. Consequently, it is imperative to verify the correctness of the control signals received from the cloud. Traditional verification methods, like zero-knowledge proof techniques, are computationally demanding in both proof generation and verification, may require several rounds of interactions between the prover and verifier and, consequently, are inapplicable in real-time control system applications. In this paper, we present a novel computationally inexpensive verifiable computing solution inspired by the probabilistic cut-and-choose approach. The proposed scheme allows the plant’s actuator to validate the computations accomplished by the encrypted cloud-based networked controller without compromising the control scheme’s performance. We showcase the effectiveness and real-time applicability of the proposed verifiable computation scheme using a remotely controlled Khepera-IV differential-drive robot. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Spectral gaps of two- and three-dimensional many-body quantum systems in the thermodynamic limit

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Lukin, Illya V. Sotnikov, Andrii G. Leamer, Jacob M. Magann, Alicia B. Bondar, Denys I. Karazin Kharkiv National University Svobody Square 4 Kharkiv61022 Ukraine Akhiezer Institute for Theoretical Physics NSC KIPT Akademichna 1 Kharkiv61108 Ukraine Department of Physics and Engineering Physics Tulane University 6823 St. Charles Ave. New OrleansLA70118 United States Center for Computing Research Sandia National Laboratories AlbuquerqueNM87185 United States Department of Physics and Engineering Physics Tulane University 6823 St. Charles Avenue New OrleansLA70118 United States

We present an expression for the spectral gap, opening up new possibilities for performing and accelerating spectral calculations of quantum many-body systems. We develop and demonstrate one such possibility in the context of tensor network simulations. Our approach requires only minor modifications of the widely used simple update method and is computationally lightweight relative to other approaches. We validate it by computing spectral gaps of the 2D and 3D transverse-field Ising models and find strong agreement with previously reported perturbation theory results. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Mechano-Driven Logic-in-Memory with Neuromorphic Triboelectric Charge-Trapping Transistor

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Wei, Yichen Yu, Jinran Li, Yonghai Wang, Yifei Huo, Ziwei Cheng, Liuqi Yue, Dewu Zhang, Keteng Gong, Jie Wang, Jie Wang, Zhong Lin Sun, Qijun Education Department of Guangxi Zhuang Autonomous Region School of Physical Science & Technology Guangxi University Nanning530004 China Beijing Institute of Nanoenergy and Nanosystems Chinese Academy of Sciences Beijing101400 China School of Nanoscience and Technology University of Chinese Academy of Sciences Beijing100049 China Information Technology Research Institute Shenzhen Institute of Information Technology Shenzhen518172 China Georgia Institute of Technology AtlantaGA30332-0245 United States Shandong Zhongke Naneng Energy Technology Co. Ltd. Dongying257061 China

One of the trends in the era of post-Moore's Law is to develop sophisticated electronic devices that integrate the function of sensation/data-storage/computation for diverse applications. Two-dimensional semiconductor transistor based on charge storage mechanism is a promising alternative for future information devices. Here, we propose a neuromorphic triboelectric charge-trapping MoTe2 transistor with stacked high-k dielectric structure, aiming at mechano-driven logic-in-memory for neuromorphic computation. Gating by triboelectric potential, the neuromorphic device exhibits excellent electrical performance, including a high switching ratio (>105), low off-state current (~0.6 pA), and robust cyclic stability. By controlling the trapped charges in the stack gate structure via tribopotential modulation, the conductivity state of the MoTe2 channel can be readily set, realizing an excellent mechano-driven nonvolatile memory with a retention time up to 104 seconds, stable switching behavior over 100 cycles, and 8 levels of multilevel data storage capability. A mechano-driven programmable inverter can also be realized by serially connecting a load resistor. Besides, the triboelectric charge-trapping transistor is ready to emulate typical synaptic characteristics in low energy levels (~147 fJ). Based on the finely tunable conductivity through tribopotential, a mechano-assisted artificial neural network is demonstrated to recognize handwritten digits with an accuracy of approximately 88.59%. These results highlight the great significance of the triboelectric charge-trapping transistor in mechanical-assisted real-time interaction, low-energy data storage, and neuromorphic computation. © 2024, The Authors. All rights reserved.

关键词： computation theory

OpenIVM: a SQL-to-SQL Compiler for Incremental computations

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Battiston, Ilaria Kathuria, Kriti Boncz, Peter Centrum Wiskunde & Informatica Amsterdam Netherlands University of Waterloo Waterloo Canada

This demonstration presents a new Open Source SQL-to-SQL compiler for Incremental View Maintenance (IVM). While previous systems, such as DBToaster, implemented computational functionality for IVM in a separate system, the core principle of OpenIVM is to make use of existing SQL query processing engines and perform all IVM computations via SQL. This approach enables the integration of IVM in these systems without code duplication. Also, it eases its use in cross-system IVM, i. e. to orchestrate an HTAP system in which one (OLTP) DBMS provides insertions/updates/deletes (deltas), which are propagated using SQL into another (OLAP) DBMS, hosting materialized views. Our system compiles view definitions into SQL to eventually propagate deltas into the table that materializes the view, following the principles of DBSP. Under the hood, OpenIVM uses the DuckDB library to compile (parse, transform, optimize) the materialized view maintenance logic. We demonstrate OpenIVM in action (i) as the core of a DuckDB extension module that adds IVM functionality to it and (ii) powering cross-system IVM for HTAP, with PostgreSQL handling updates on base tables and DuckDB hosting materialized views on these. © 2024, CC BY.

关键词： computation theory

Better Membership Inference Privacy Measurement through Discrepancy

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Ruihan Huang, Pengrun Chaudhuri, Kamalika University of California San Diego United States

Membership Inference Attacks have emerged as a dominant method for empirically measuring privacy leakage from machine learning models. Here, privacy is measured by the advantage or gap between a score or a function computed on the training and the test data. A major barrier to the practical deployment of these attacks is that they do not scale to large well-generalized models – either the advantage is relatively low, or the attack involves training multiple shadow models which is high compute-intensive. In this work, inspired by discrepancy theory, we propose a new empirical privacy metric that is an upper bound on the advantage of a specific family of membership inference attacks. We introduce an easy-to-compute approximation CPM to the upper bound. We empirically validate CPM is higher than the advantage of most popular existing attacks and because of its light computation, it can be applied to large ImageNet classification models in-the-wild. More interestingly, we find the gaps between the new metric and the advantage of existing attacks are larger on advanced models trained with sophisticated training recipes. Motivated by this empirical result, we propose new membership inference attacks tailored to those advanced models. © 2024, CC BY.

关键词： computation theory

ERRATUM TO "computation OF MAXIMAL PROJECTION CONSTANTS"

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Basso, Giuliano Max Planck Institute for Mathematics Vivatsgasse 7 Bonn53111 Germany

This is an erratum to the article: "computation of maximal projection constants" (J. Funct. Anal., 277). The statement of Lemma 3.1(2) of that paper is incorrect. As a consequence of this the proof of Theorem 1.4 is incomplete. In this erratum we prove a corrected version of Lemma 3.1 and explain why, with this weaker result, our original strategy for proving Theorem 1.4 no longer works. The other results of the article, in particular the alternative proof of Grünbaum’s conjecture, do not depend on Lemma 3.1 and are thus not affected by this error. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Teaching Software Metrology: The Science of Measurement for Software Engineering

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ralph, Paul Kuutila, Miikka Arif, Hera Ayoola, Bimpe Dalhousie University HalifaxNS Canada

While the methodological rigor of computing research has improved considerably in the past two decades, quantitative software engineering research is hampered by immature measures and inattention to theory. Measurement-the principled assignment of numbers to phenomena-is intrinsically difficult because observation is predicated upon not only theoretical concepts but also the values and perspective of the research. Despite several previous attempts to raise awareness of more sophisticated approaches to measurement and the importance of quantitatively assessing reliability and validity, measurement issues continue to be widely ignored. The reasons are unknown, but differences in typical engineering and computer science graduate training programs (compared to psychology and management, for example) are involved. This chapter therefore reviews key concepts in the science of measurement and applies them to software engineering research. A series of exercises for applying important measurement concepts to the reader's research are included, and a sample dataset for the reader to try some of the statistical procedures mentioned is provided. Copyright © 2024, The Authors. All rights reserved.

关键词： computation theory

Verifying Classification with Limited Disclosure

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Bhandari, Siddharth Shan, Liren

We consider the multi-party classification problem introduced by Dong, Hartline, and Vijayaraghavan (2022) motivated by electronic discovery. In this problem, our goal is to design a protocol that guarantees the requesting party receives nearly all responsive documents while minimizing the disclosure of nonresponsive documents. We develop verification protocols that certify the correctness of a classifier by disclosing a few nonresponsive documents. We introduce a combinatorial notion called the Leave-One-Out dimension of a family of classifiers and show that the number of nonresponsive documents disclosed by our protocol is at most this dimension in the realizable setting, where a perfect classifier exists in this family. For linear classifiers with a margin, we characterize the trade-off between the margin and the number of nonresponsive documents that must be disclosed for verification. Specifically, we establish a trichotomy in this requirement: for d dimensional instances, when the margin exceeds 1/3, verification can be achieved by revealing only O(1) nonresponsive documents;when the margin is exactly 1/3, in the worst case, at least Ω(d) nonresponsive documents must be disclosed;when the margin is smaller than 1/3, verification requires Ω(ed) nonresponsive documents. We believe this result is of independent interest with applications to coding theory and combinatorial geometry. We further extend our protocols to the nonrealizable setting defining an analogous combinatorial quantity robust Leave-One-Out dimension, and to scenarios where the protocol is tolerant to misclassification errors by Alice. © 2025, CC BY-NC-ND.

关键词： computation theory