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

Qudit Dynamical Decoupling on a Superconducting Quantum Processor

Physical Review Letters 2025年第5期134卷 050601-050601页

作者： Vinay Tripathi Noah Goss Arian Vezvaee Long B. Nguyen Irfan Siddiqi Daniel A. Lidar Department of Physics and Astronomy University of Southern California Los Angeles California 90089 USA Center for Quantum Information Science and Technology University of Southern California Los Angeles California 90089 USA Quantum Nanoelectronics Laboratory Department of Physics University of California at Berkeley Berkeley California 94720 USA Applied Math and Computational Research Division Lawrence Berkeley National Lab Berkeley California 94720 USA Department of Electrical and Computer Engineering University of Southern California Los Angeles California 90089 USA Department of Chemistry University of Southern California Los Angeles California 90089 USA

Multilevel qudit systems are increasingly being explored as alternatives to traditional qubit systems due to their denser information storage and processing potential. However, qudits are more susceptible to decoherence than qubits due to increased loss channels, noise sensitivity, and crosstalk. To address these challenges, we develop protocols for dynamical decoupling (DD) of qudit systems based on the Heisenberg-Weyl group. We implement and experimentally verify these DD protocols on a superconducting transmon processor that supports qudit operation based on qutrits (d=3) and ququarts (d=4). Specifically, we demonstrate single-qudit DD sequences to decouple qutrits and ququarts from system-bath-induced decoherence. We also introduce two-qudit DD sequences designed to suppress the detrimental cross-Kerr couplings between coupled qudits. This allows us to demonstrate a significant improvement in the fidelity of time-evolved qutrit Bell states. Our results highlight the utility of leveraging DD to enable scalable qudit-based quantum computing.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Methods for Weather Forecast 21st

Data-Driven Methods for Weather Forecast

引用

21st International Conference on Computational science, ICCS 2021

作者： Nino-Ruiz, Elias David Acevedo García, Felipe J. Applied Math and Computer Science Lab Computer Science Department Universidad del Norte Colombia Barranquilla Colombia

ISBN: (纸本)9783030779696

In this paper, we propose efficient and practical data-driven methods for weather forecasts. We exploit the information brought by historical weather datasets to build machine-learning-based models. These models are employed to produce numerical forecasts, which can be improved by injecting additional data via data assimilation. Our approaches’ general idea is as follows: given a set of time snapshots of some dynamical system, we group the data by time across multiple days. These groups are employed to build first-order Markovian models that reproduce dynamics from time to time. Our numerical models’ precision can be improved via sequential data assimilation. Experimental tests are performed by using the National-Centers-for-Environmental-Prediction Department-of-Energy Reanalysis II dataset. The results reveal that numerical forecasts can be obtained within reasonable error magnitudes in the L2 norm sense, and even more, observations can improve forecasts by order of magnitudes, in some cases. © 2021, Springer Nature Switzerland AG.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Efficient oblivious transfer protocols

Efficient oblivious transfer protocols

引用

2001 Operating Section Proceedings, American Gas Association

作者： Naor, Moni Pinkas, Benny Dept. of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel STAR Lab. Intertrust Technologies

来源：评论

学校读者我要写书评

暂无评论

HiPoNet: A Topology-Preserving Multi-View Neural Network For High Dimensional Point Cloud and Single-Cell Data

arXiv

引用

arXiv 2025年

作者： Viswanath, Siddharth Madhu, Hiren Bhaskar, Dhananjay Kovalic, Jake Johnson, Dave Ying, Rex Tape, Christopher Adelstein, Ian Perlmutter, Michael Krishnaswamy, Smita Department of Computer Science Yale University New Haven United States Department of Genetics Yale University New Haven United States Department of Applied Physics Yale University New Haven United States Program in Computing Boise State University Idaho United States Cell Communication Lab Department of Oncology University College London Cancer Institute London United Kingdom Department of Mathematics Yale University New Haven United States Department of Mathematics Boise State University Idaho United States Computational Biology and Bioinformatics Program Yale University New Haven United States Wu-Tsai Institute Yale University New Haven United States Program for Applied Math Yale University New Haven United States

In this paper, we propose HiPoNet, an end-to-end differentiable neural network for regression, classification, and representation learning on high-dimensional point clouds. Single-cell data can have high dimensionality exceeding the capabilities of existing methods for point clouds which are tailored for 3D data. Moreover, modern single-cell and spatial experiments now yield entire cohorts of datasets (i.e. one on every patient), necessitating models that can process large, high-dimensional point clouds at scale. Most current approaches build a single nearest-neighbor graph, discarding important geometric information. In contrast, HiPoNet forms higher-order simplicial complexes through learnable feature reweighting, generating multiple data views that disentangle distinct biological processes. It then employs simplicial wavelet transforms to extract multiscale features—capturing both local and global topology. We empirically show that these components preserve topological information in the learned representations, and that HiPoNet significantly outperforms state-of-the-art point-cloud and graph-based models on single cell. We also show an application of HiPoNet on spatial transcriptomics datasets using spatial co-ordinates as one of the views. Overall, HiPoNet offers a robust and scalable solution for high-dimensional data analysis. © 2025, CC BY.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Fairness in scheduling 6

Fairness in scheduling

引用

6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995

作者： Ajtai, Miklos Aspnes, James Naor, Moni Rabani, Yuval Schulman, Leonard J. Waarts, Orli IBM Research Division Almaden Research Center United States Dept. of Computer Science Yale University United States Dept. of Applied Math and Computer Science Weizmann Institute Israel ICSI Berkeley Lab. for Computer Science MIT United States Department of Computer Science University of Toronto TorontoONM5S 1A4 Canada Computer Science Division U.C. Berkeley United States

ISBN: (纸本)0898713498

On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper we explore the issue in settings where there are long living processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system. For any such instance we develop a notion of desired load of a process, which is a function of the tasks it participates in. The unfairness of a system is the maximum, taken over all processes, of the difference between the desired load and the actual load. An example of such a setting is the carpooi problem suggested by Fagin and Williams [17]. In this problem, a set of n people form a carpooi. On each day a subset of the people arrive and one of them is designated as the driver. A scheduling rule is required so that the driver will be determined in a 'fair' way. We investigate this problem under various assumptions on the input distribution. We also show that the carpooi problems can capture several other problems of fairness in scheduling.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

InGAN: Capturing and remapping the "DNA" of a natural image

arXiv

引用

arXiv 2018年

作者： Shocher, Assaf Bagon, Shai Isola, Phillip Irani, Michal Dept. of Computer Science and Applied Math Weizmann Institute of Science Computer Science and Artificial Intelligence Lab Massachusetts Institute of Technology

Generative Adversarial Networks (GANs) typically learn a distribution of images in a large image dataset, and are then able to generate new images from this distribution. However, each natural image has its own internal statistics, captured by its unique distribution of patches. In this paper we propose an "Internal GAN" (InGAN) – an image-specific GAN – which trains on a single input image and learns its internal distribution of patches. It is then able to synthesize a plethora of new natural images of significantly different sizes, shapes and aspect-ratios all with the same internal patch-distribution (same "DNA") as the input image. In particular, despite large changes in global size/shape of the image, all elements inside the image maintain their local size/shape. InGAN is fully unsupervised, requiring no additional data other than the input image itself. Once trained on the input image, it can remap the input to any size or shape in a single feedforward pass, while preserving the same internal patch distribution. InGAN provides a unified framework for a variety of tasks, bridging the gap between textures and natural images.1 Copyright © 2018, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Chaotic Associative Recalls for Fixed Point Attractor Patterns

Chaotic Associative Recalls for Fixed Point Attractor Patter...

引用

International Joint Conference on Neural Networks 2003

作者： Zhao, Liang Cáceres, Juan C.G. Szu, Harold Inst. of Math. and Computer Science University of São Paulo Sao Paulo Brazil Digital Media RF Lab. Sch. of Eng. and Applied Science George Washington University Washington DC United States

Human perception is a complex nonlinear dynamics. On the one hand it is periodic dynamics and on the other hand it is chaotic. Thus, we wish to propose a hybrid - the spatial chaotic dynamics for the associative recall to retrieve patterns, similar to Walter Freeman's discovery, and the fixed point dynamics for memory storage, similar to Hopfield and Grossberg's discoveries. In this model, each neuron in the network could be a chaotic map, whose phase space is divided into two states: one is periodic dynamic state with period-V, which is used to represent a V-value retrieved pattern;another is chaotic dynamic state. Firstly, patterns are stored in the memory by fixed point learning algorithm. In the retrieving process, all neurons are initially set in the chaotic region. Due to the ergodicity property of chaos, each neuron will approximate the periodic points covered by the chaotic attractor at same instants. When this occurs, the control is activated to drive the dynamic of each neuron to their corresponding stable periodic point. computer simulations confirm the theoretical prediction.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Modeling stable matching problems with answer set programming

Modeling stable matching problems with answer set programmin...

引用

7th International Web Rule Symposium on Theory, Practice, and Applications of Rules on the Web, RuleML 2013

作者： De Clercq, Sofie Schockaert, Steven De Cock, Martine Nowé, Ann Dept. of Applied Math. CS and Stats Ghent University Ghent Belgium School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Computational Modeling Lab Vrije Universiteit Brussel Brussels Belgium

ISBN: (纸本)9783642396168

The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley [7]. Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when individuals may designate unacceptable partners and ties between preferences are allowed. Subsequently, we show how our ASP based encoding naturally allows us to select specific stable matchings which are optimal according to a given criterion. Each time, we can rely on generic and efficient off-the-shelf answer set solvers to find (optimal) stable matchings. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Computational model and the human perception of emotional body language (EBL)

Computational model and the human perception of emotional bo...

引用

23rd Convention of the Society for the Study of Artificial Intelligence and Simulation of Behaviour, AISB 2009

作者： Fridin, Marina Barliya, Avi Schechtman, Edna De Gelder, Beatrice Flash, Tamar Dept. of Computer Science and Applied Math. Weizmann Institute of Science Rehovot Israel Lab. of Cognitive and Affective Neuroscience Tilburg Univ. Netherlands Dept. of Industrial Engineering and Management Ben Gurion Univ. Beer Sheva Israel

ISBN: (纸本)1902956850

Emotions are undeniably a central component of human existence. In recent years, the importance of developing systems which incorporate emotions into human-computer interaction (HCI) has been widely acknowledged. However, research on emotion recognition has been dominated by studies of facial expression of emotion. In comparison, the study of EBL has received relatively little attention. Here we study the phenomena of EBL, specifically of static body postures expressing emotions, from two different perspectives. First, we have built a computational model for the recognition of four basic emotions which achieves a relatively high recognition rate (70 %). Secondly, to study perception of EBL, we examined what body parts attract the observer's attention during the perception of EBL. This is done by tracking eye movements of human subjects during the observation of static postures expressing emotions. Although invaluable information can be inferred from motion, this study will show that information about static body posture is rich enough for both automatic recognition and human perception. The present study contributes in an applicative way both to the development of automatic recognition systems of EBL and provides insight into the nature of human recognition of EBL.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

Efficient oblivious transfer protocols 01

Efficient oblivious transfer protocols

引用

Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

作者： Moni Naor Benny Pinkas Dept. of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel STAR Lab Intertrust Technologies

ISBN: (纸本)9780898714906

1 IntroductionOblivious Transfer (OT) protocols allow one party, the sender, to transmit part of its inputs to another party, the chooser, in a manner that protects both of them: the sender is assured that the chooser does not receive more information than it is entitled, while the chooser is assured that the sender does not learn which part of the inputs it received. OT is used as a key component in many applications of cryptography. Its computational requirements are quite demanding and they are likely to be the bottleneck in many applications that invoke it.1.1 *** paper presents several significant improvements to oblivious transfer (OT) protocols of strings, and in particular: (i) Improving the efficiency of applications which many invocations of oblivious transfer. (ii) Providing the first two-round OT protocol whose security analysis does not invoke the random oracle model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：