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

TechRxiv 2023年

作者： Mirza, Muhammad Ayzed Yu, Junsheng Raza, Salman Ahmed, Manzoor Asif, Muhammad Irshad, Azeem Kumar, Neeraj BUPT-QMUL EM Theory and Application International Research Lab Beijing University of Posts and Telecommunications Beijing100876 China School of Physics and Electronic Information Anhui Normal University Wuhu241003 China School of Intelligence and Digital Engineering Luoyang Vocational College of Science and Technology Luoyang471000 China Department of Computer Science National Textile University Faisalabad Pakistan School of Computer and Information Science Institute for AI Industrial Technology Research Hubei Engineering University Xiaogan432000 China Faculty of Computer Science Asghar Mall College Govt. of the Punjab Rawalpindi Pakistan Department of Computer Science and Engineering Thapar Institute of Engineering and Technology Punjab Patiala India Department of Computer Engineering Graphics Era University Uttarakhand Dehradun India School of Computer Science University of Petroleum and Energy Studies Uttarakhand Dehradun India Department of Computer Science and Engineering Chandigarh University Gharuan Mohali India Department of Electrical and Computer Engineering Lebanese American University Beirut Lebanon Faculty of Computing and IT King Abdulaziz University Jeddah Saudi Arabia

Ensuring dependable quality of service (QoS) and quality of experience (QoE) for computation-intensive and delay-sensitive applications in vehicles can be a challenging task that impacts performance. While multi-access edge computing (MEC) based vehicular edge computing network (VECN) and vehicular cloudlets (VC) enable task offloading, but their prompt and optimal accessibility is another challenge. The conventional wireless technologies may not suffice to meet the stringent ultra-low latency and cost constraints of such applications. Nonetheless, the combination of different wireless technologies can enhance network performance and satisfy these requirements. Focusing on the computational efficacy of VECN, this paper proposes a mobility, contact, and computational load-aware (MCLA) task offloading scheme for heterogeneous VECN. The MCLA scheme dynamically considers the mobility, contact, and computational load of vehicles for making task offloading decisions. To optimize the performance, the MCLA scheme integrates the Mode-1 and Mode-2 of the 5G-NR-V2X standard, along with mmWave communications. The MCLA scheme provides an opportunistic switching mechanism between these modes and heterogeneous radio access technologies (RATs) to reduce communication delays and costs. Moreover, the MCLA scheme leverages public vehicles (i.e., public buses), in proximity by using their computational power to manage computational latency and cost. Furthermore, it also considers the shareable computations from passengers’ mobile equipment within the public vehicle to improve the computation capacity of the public vehicles. Extensive evaluations and numerical results show that the proposed MCLA scheme significantly improves the task turnover ratio by 4%–15% with 4.7%–29.8% lower transmission and computation costs. © 2023, CC BY.

关键词： Delay-sensitive applications

来源：评论

学校读者我要写书评

暂无评论

Characterization of broadband Purcell filters with compact footprint for fast multiplexed superconducting qubit readout

arXiv

引用

arXiv 2023年

作者： Park, Seong Hyeon Choi, Gahyun Kim, Gyunghun Jo, Jaehyeong Lee, Bumsung Kim, Geonyoung Park, Kibog Lee, Yong-Ho Hahn, Seungyong Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Center for Superconducting Quantum Computing Systems Korea Research Institute of Standards and Science Daejeon34113 Korea Republic of Ulsan44919 Korea Republic of Samsung Electronics Gyeonggi-do Hwaseong-si18448 Korea Republic of Ulsan44919 Korea Republic of

Engineering the admittance of external environments connected to superconducting qubits is essential, as increasing the measurement speed introduces spontaneous emission loss to superconducting qubits, known as Purcell loss. Here, we report a broadband Purcell filter within a small footprint, which effectively suppresses Purcell loss without losing the fast measurement speed. We characterize the filter’s frequency response at 4.3 K and also estimate Purcell loss suppression by finite-element-method simulations of superconducting planar circuit layouts with the proposed filter design. The filter is fabricated with 200 nm-thick niobium films and shows the measured bandwidth over 790 MHz within 0.29 mm2 of compact size owing to densely packed spiral resonators. The estimated lifetime enhancement indicates the effective protection of the qubit from Purcell loss. The presented filter design is expected to be easily integrated on existing superconducting quantum circuits for fast and multiplexed readout without occupying large footprint. © 2023, CC BY-NC-ND.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Query complexity of unitary operation discrimination

arXiv

引用

arXiv 2020年

作者： Huang, Xiaowei Li, Lvzhou Institute of Quantum Computing and Computer Theory School of Computer and Engineering Sun Yat-sen University Guangzhou510006 China

Discrimination of unitary operations is fundamental in quantum computation and information. A lot of quantum algorithms including the well-known Deutsch-Jozsa algorithm, Simon's algorithm, and Grover's algorithm can essentially be regarded as discriminating among individual, or sets of unitary operations (oracle operators). The problem of discriminating between two unitary operations U and V can be described as: Given X ∈ {U, V }, determine which one X is. If X is given with multiple copies, then one can design an adaptive procedure that takes multiple queries to X to output the identification result of X. In this paper, we consider the problem: How many queries are required for achieving a desired failure probability ∊ of discrimination between U and V. We prove in a uniform framework: (i) if U and V are discriminated with bound error ∊, then the number of queries T must satisfy (Equation presented), and (ii) if they are discriminated with one-sided error ∊, then there is (Equation presented), where dke denotes the minimum integer not less than k and Θ(W) denotes the length of the smallest arc containing all the eigenvalues of W on the unit circle. © 2020, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Tunable fragile topology in Floquet systems

引用

Physical Review B 2021年第12期103卷 L121115-L121115页

作者： Rui-Xing Zhang Zhi-Cheng Yang Condensed Matter Theory Center Department of Physics University of Maryland College Park Maryland 20742-4111 USA Joint Quantum Institute University of Maryland College Park Maryland 20742 USA Joint Center for Quantum Information and Computer Science University of Maryland College Park Maryland 20742 USA

We extend the notion of fragile topology to periodically driven systems. We demonstrate driving-induced fragile topology in two different models, namely, the Floquet honeycomb model and the Floquet π-flux square-lattice model. In both cases, we discover a rich phase diagram that includes Floquet fragile topological phases protected by crystalline rotation or mirror symmetries, Floquet Chern insulators, and trivial atomic phases, with distinct boundary features. Remarkably, the transitions between different phases can be feasibly achieved by simply tuning the driving amplitudes, which is a unique feature of driving-enabled topological phenomena. Moreover, corner-localized fractional charges are identified as a “smoking-gun” signal of fragile topology in our systems. Our work paves the way for studying and realizing fragile topology in Floquet systems.

关键词： Topological insulators Topological phases of matter Floquet systems

来源：评论

学校读者我要写书评

暂无评论

Modern computing: Vision and Challenges

arXiv

引用

arXiv 2024年

作者： Gill, Sukhpal Singh Wu, Huaming Patros, Panos Ottaviani, Carlo Arora, Priyansh Pujol, Victor Casamayor Haunschild, David Parlikad, Ajith Kumar Cetinkaya, Oktay Lutfiyya, Hanan Stankovski, Vlado Li, Ruidong Ding, Yuemin Qadir, Junaid Abraham, Ajith Ghosh, Soumya K. Song, Houbing Herbert Sakellariou, Rizos Rana, Omer Rodrigues, Joel J.P.C. Kanhere, Salil S. Dustdar, Schahram Uhlig, Steve Ramamohanarao, Kotagiri Buyya, Rajkumar School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom Center for Applied Mathematics Tianjin University Tianjin China Raygun Performance Monitoring Wellington New Zealand Department of Computer Science York Centre for Quantum Technologies University of York York United Kingdom Microsoft Schiphol Netherlands Distributed Systems Group Vienna University of Technology Vienna Austria Detecon International GmbH Munich Germany Institute for Manufacturing Department of Engineering University of Cambridge Cambridge United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Department of Computer Science University of Western Ontario London Canada Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Institute of Science and Engineering Kanazawa University Japan Tecnun School of Engineering University of Navarra Spain Department of Computer Science and Engineering College of Engineering Qatar University Doha Qatar Bennett University Greater Noida India Machine Intelligence Research Labs AuburnWA United States Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Baltimore United States Department of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia COPELABS Lusófona University Lisbon Portugal Sydney Australia The University of Melbourne Victoria Australia Laboratory School of Computing and Information Systems The University of Melbourne Australia

Over the past six decades, the computing systems field has experienced significant transformations, profoundly impacting society with transformational developments, such as the Internet and the commodification of computing. Underpinned by technological advancements, computer systems, far from being static, have been continuously evolving and adapting to cover multifaceted societal niches. This has led to new paradigms such as cloud, fog, edge computing, and the Internet of Things (IoT), which offer fresh economic and creative opportunities. Nevertheless, this rapid change poses complex research challenges, especially in maximizing potential and enhancing functionality. As such, to maintain an economical level of performance that meets ever-tighter requirements, one must understand the drivers of new model emergence and expansion, and how contemporary challenges differ from past ones. To that end, this article investigates and assesses the factors influencing the evolution of computing systems, covering established systems and architectures as well as newer developments, such as serverless computing, quantum computing, and on-device AI on edge devices. Trends emerge when one traces technological trajectory, which includes the rapid obsolescence of frameworks due to business and technical constraints, a move towards specialized systems and models, and varying approaches to centralized and decentralized control. This comprehensive review of modern computing systems looks ahead to the future of research in the field, highlighting key challenges and emerging trends, and underscoring their importance in cost-effectively driving technological progress. © 2024, CC BY.

关键词： Obsolescence

来源：评论

学校读者我要写书评

暂无评论

Fast Estimation of Outcome Probabilities for quantum Circuits

引用

PRX quantum 2022年第2期3卷 020361-020361页

作者： Hakop Pashayan Oliver Reardon-Smith Kamil Korzekwa Stephen D. Bartlett Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Ontario N2L 3G1 Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University Kraków 30-348 Poland Centre for Engineered Quantum Systems School of Physics The University of Sydney Sydney New South Wales 2006 Australia

We present two classical algorithms for the simulation of universal quantum circuits on n qubits constructed from c instances of Clifford gates and t arbitrary-angle Z-rotation gates such as T gates. Our algorithms complement each other by performing best in different parameter regimes. The Estimate algorithm produces an additive precision estimate of the Born-rule probability of a chosen measurement outcome with the only source of run-time inefficiency being a linear dependence on the stabilizer extent (with scaling approximately equal to 1.17t for T gates). Our algorithm is state of the art for this task: as an example, in approximately 13 h (on a standard desktop computer), we estimate the Born-rule probability to within an additive error of 0.03, for a 50-qubit, 60 non-Clifford gate quantum circuit with more than 2000 Clifford gates. Our second algorithm, Compute, calculates the probability of a chosen measurement outcome to machine precision with run time O(2t−rt), where r is an efficiently computable, circuit-specific quantity. With high probability, r is very close to min{t,n−w} for random circuits with many Clifford gates, where w is the number of measured qubits. Compute can be effective in surprisingly challenging parameter regimes, e.g., we can randomly sample Clifford+T circuits with n=55, w=5, c=105, and t=80T gates, and then compute the Born-rule probability with a run time consistently less than 10 min using a single core of a standard desktop computer. We provide a C+Python implementation of our algorithms and benchmark them using random circuits, the hidden-shift algorithm, and the quantum approximate optimization algorithm.

关键词： quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Open-system Spin Transport and Operator Weight Dissipation in Spin Chains

arXiv

引用

arXiv 2022年

作者： Yoo, Yongchan White, Christopher David Swingle, Brian Department of Physics Condensed Matter Theory Center Joint Quantum Institute University of Maryland College ParkMD20742 United States Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Condensed Matter Theory Center University of Maryland College ParkMD20742 United States Department of Physics Brandeis University WalthamMA02453 United States

We use non-equilibrium steady states to study the effect of dissipation-assisted operator evolution (DAOE) on the scaling behavior of transport in one-dimensional spin chains. We consider three models in the XXZ family: the XXZ model with staggered anisotropy, which is chaotic;XXZ model with no external field and tunable interaction, which is Bethe ansatz integrable and (in the zero interaction limit) free fermion integrable;and the disordered XY model, which is free-fermion integrable and Anderson localized. We find evidence that DAOE's effect on transport is controlled by its effect on the system's conserved quantities. To the extent that DAOE preserves those symmetries, it preserves the scaling of the system's transport properties;to the extent it breaks those conserved quantities, it pushes the system towards diffusive scaling of transport. © 2022, CC BY.

关键词： Spin dynamics

来源：评论

学校读者我要写书评

暂无评论

quantum advantage for differential equation analysis

引用

Physical Review A 2022年第2期105卷 022415-022415页

作者： Bobak Toussi Kiani Giacomo De Palma Dirk Englund William Kaminsky Milad Marvian Seth Lloyd Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Research Laboratory of Electronics Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Giacomo De Palma Scuola Normale Superiore 56126 Pisa Italy QuEra Computing Boston Massachusetts 02143 USA Department of Mechanical Engineering Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Department of Electrical and Computer Engineering Center for Quantum Information and Control University of New Mexico Albuquerque New Mexico 87131 USA

quantum algorithms for differential equation solving, data processing, and machine learning potentially offer an exponential speedup over all known classical algorithms. However, there also exist obstacles to obtaining this potential speedup in useful problem instances. The essential obstacle for quantum differential equation solving is that outputting useful information may require difficult postprocessing, and the essential obstacle for quantum data processing and machine learning is that inputting the data is a difficult task just by itself. In this study, we demonstrate that, when combined, these difficulties solve one another. We show how the output of quantum differential equation solving can serve as the input for quantum data processing and machine learning, allowing dynamical analysis in terms of principal components, power spectra, and wavelet decompositions. To illustrate this, we consider continuous-time Markov processes on epidemiological and social networks. These quantum algorithms provide an exponential advantage over existing classical Monte Carlo methods.

关键词： Machine learning quantum algorithms quantum computation Markovian processes Numerical techniques

来源：评论

学校读者我要写书评

暂无评论

Clifford-deformed Surface Codes

arXiv

引用

arXiv 2022年

作者： Dua, Arpit Kubica, Aleksander Jiang, Liang Flammia, Steven T. Gullans, Michael J. Department of Physics Institute for Quantum Information and Matter California Institute of Technology PasadenaCA91125 United States AWS Center for Quantum Computing PasadenaCA91125 United States California Institute of Technology PasadenaCA91125 United States Pritzker School of Molecular Engineering The University of Chicago IL60637 United States Joint Center for Quantum Information and Computer Science NIST University of Maryland College ParkMD20742 United States

Various realizations of Kitaev’s surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by applying single-qubit Clifford operators. We first analyze CDSCs on the 3 × 3 square lattice and find that, depending on the noise bias, their logical error rates can differ by orders of magnitude. To explain the observed behavior, we introduce the effective distance d′, which reduces to the standard distance for unbiased noise. To study CDSC performance in the thermodynamic limit, we focus on random CDSCs. Using the statistical mechanical mapping for quantum codes, we uncover a phase diagram that describes random CDSC families with 50% threshold at infinite bias. In the high-threshold region, we further demonstrate that typical code realizations outperform the thresholds and subthreshold logical error rates, at finite bias, of the best-known translationally invariant codes. We demonstrate the practical relevance of these random CDSC families by constructing a translation-invariant CDSC belonging to a high-performance random CDSC family. We also show that our translation-invariant CDSC outperforms well-known translation-invariant CDSCs such as the XZZX and XY codes. Copyright © 2022, The Authors. All rights reserved.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Perceptual Quality Assessment of Virtual Reality Videos in the Wild

arXiv

引用

arXiv 2022年

作者： Wen, Wen Li, Mu Yao, Yiru Sui, Xiangjie Zhang, Yabin Lan, Long Fang, Yuming Ma, Kede Department of Computer Science City University of Hong Kong Kowloon Hong Kong School of Computer Science and Technology Harbin Institute of Technology Guangdong Shenzhen518055 China School of Information Management Jiangxi University of Finance and Economics Jiangxi Nanchang330032 China Multimedia Lab Bytedance Inc China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

Investigating how people perceive virtual reality (VR) videos in the wild (i.e., those captured by everyday users) is a crucial and challenging task in VR-related applications due to complex *** video databases only consider synthetic distortions, assume fixed viewing conditions, and are limited in size. To overcome these shortcomings, we construct the VR Video Quality in the Wild (VRVQW) database, containing 502 user-generated videos with diverse content and distortion characteristics. Based on VRVQW, we conduct a formal psychophysical experiment to record the scanpaths and perceived quality scores from 139 participants under two different viewing conditions. We provide a thorough statistical analysis of the recordeddata, observing significantimpact of viewing conditions on both human scanpaths and perceived quality. Moreover, we develop an objective quality assessment model for VR videos based on pseudocylindrical representation and convolution. Results on the proposed VRVQW show that our method is superior to existing video quality assessment *** have made the database and code available at https://***/ limuhit/VR-Video-Quality-in-the-Wild. Index Terms-Virtual reality, panoramic videos, video quality assessment, psychophysics. Copyright © 2022, The Authors. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：