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

Randomized Compiling for Scalable quantum computing on a Noisy Superconducting quantum Processor

Physical Review X 2021年第4期11卷 041039-041039页

作者： Akel Hashim Ravi K. Naik Alexis Morvan Jean-Loup Ville Bradley Mitchell John Mark Kreikebaum Marc Davis Ethan Smith Costin Iancu Kevin P. O’Brien Ian Hincks Joel J. Wallman Joseph Emerson Irfan Siddiqi Quantum Nanoelectronics Laboratory Department of Physics University of California at Berkeley Berkeley California 94720 USA Graduate Group in Applied Science and Technology University of California at Berkeley Berkeley California 94720 USA Computational Research Division Lawrence Berkeley National Lab Berkeley California 94720 USA Materials Sciences Division Lawrence Berkeley National Lab Berkeley California 94720 USA Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts 02142 USA Quantum Benchmark Inc. Kitchener Ontario N2H 5G5 Canada Keysight Technologies Canada Kanata Ontario K2K 2W5 Canada Institute for Quantum Computing and Department of Applied Mathematics University of Waterloo Waterloo Ontario N2L 3G1 Canada

The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error that has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing.

关键词： quantum algorithms quantum benchmarking quantum control quantum information with solid state qubits

来源：评论

学校读者我要写书评

暂无评论

No-signaling-proof randomness extraction from public weak sources

arXiv

引用

arXiv 2021年

作者： Ramanathan, Ravishankar Banacki, Michal Horodecki, Pawel Department of Computer Science The University of Hong Kong Pokfulam Road Hong Kong International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 Gdańsk80-308 Poland Institute of Theoretical Physics and Astrophysics National Quantum Information Centre Faculty of Mathematics Physics and Informatics University of Gdańsk Wita Stwosza 57 Gdańsk80-308 Poland Faculty of Applied Physics and Mathematics National Quantum Information Centre Gdańsk University of Technology Gabriela Narutowicza 11/12 Gdańsk80-233 Poland

The extraction of randomness from weakly random seeds is a topic of central importance in cryptography. Weak sources of randomness can be considered to be either private or public, where public sources such as the NIST randomness beacon broadcast the random bits once they are generated. The problem of device-independent randomness extraction from weak public sources against no-signalling adversaries has remained open. In this paper, we show protocols for deviceindependent and one-sided device-independent amplification of randomness from weak public sources that use a finite number of devices and are secure against no-signaling adversaries. Specifically, under the assumption that the device behavior is as prescribed by quantum mechanics the protocols allow for amplification of public ∈-SV sources for arbitrary initial ∈ ∈ [0, 0.5). On the other hand, when only the assumption of no-signaling between the components of the device is made, the protocols allow for amplification of a limited set of public weak sources. Copyright © 2021, The Authors. All rights reserved.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

A privacy-preserving access control protocol for 6G supported intelligent UAV networks

引用

Vehicular Communications 2025年 54卷

作者： Mahmood, Khalid Shamshad, Salman Anisi, Mohammad Hossein Brighente, Alessandro Saleem, Muhammad Asad Das, Ashok Kumar School of Engineering and Computing University of Lancashire Preston PR1 2HE United Kingdom of Intelligent Data Science National Yunlin University of Science and Technology Douliu 64002 Taiwan Department of Software Engineering The University of Lahore Lahore 54590 Pakistan School of Computer Science and Electronic Engineering University of Essex Colchester CO4 3SQ United Kingdom Department of Mathematics and HIT research center Univ. of Padova Italy School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad 500032 India Department of Computer Science and Engineering College of Informatics Korea University Seoul 02841 South Korea

Due to their autonomous operation, high mobility, and real-time communication capabilities, 6G-supported Unmanned Aerial Vehicles (6G-UAVs) (i.e., drones) are increasingly being utilized to enhance data collection and management in Intelligent Transportation Systems (ITSs). Despite their manifold benefits, 6G-supported UAV-based ITS (6G-U-ITS) faces unique security challenges beyond conventional cyber and physical threats. These include real-time authentication, impersonation attacks, physical tampering or cloning and protection against identity spoofing in highly dynamic environments. For instance, an attacker may steal a drone and use its identity to send authenticated malicious messages to the ITS, causing road accidents. Therefore, a secure authentication scheme must ensure resilience against UAV identity theft and unauthorized access while maintaining low-latency and computational efficiency to support the stringent real-time security requirements of 6G-U-ITS. Existing authentication schemes are not specifically designed to address these challenges, making it imperative to develop a lightweight and robust authentication mechanism tailored for 6G-U-ITS. Moreover, most of the existing protocols are vulnerable to physical tampering and impersonation attacks and also require high computation overhead. In this paper, to mitigate these limitations and satisfy the aforementioned requirements, we propose a secure access control protocol for 6G-U-ITS. To the best of our knowledge, this is the first security solution in the literature that can achieve security against UAVs physical attacks. Furthermore, we justify the robustness of the designed protocol against potential attacks through detailed formal and informal security assessment. Via testbed experiments, we show that our protocol achieves 20.66% and 22.82% higher efficiency on communication and computation overhead, respectively, compared to other contemporary competing protocols. © 2025 Elsevier Inc.

关键词： Authentication protocol Intelligent transport systems Key agreement Security protocol UAV

来源：评论

学校读者我要写书评

暂无评论

One-shot dynamical resource theory

arXiv

引用

arXiv 2020年

作者： Yuan, Xiao Zeng, Pei Gao, Minbo Zhao, Qi Center on Frontiers of Computing Studies Department of Computer Science Peking University Beijing100871 China Stanford Institute for Theoretical Physics Stanford University StanfordCA94305 United States Center for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University Beijing100084 China Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States

A fundamental problem in resource theory is to study the manipulation of the resource. Focusing on a general dynamical resource theory of quantum channels, here we consider tasks of one-shot resource distillation and dilution with a single copy of the resource. For any target of unitary channel or pure state preparation channel, we establish a universal strategy to determine upper and lower bounds on rates that convert between any given resource and the target. We show that the rates are related to resource measures based on the channel robustness and the channel hypothesis testing entropy, with regularization factors of the target resource measures. The strategy becomes optimal with converged bounds when the channel robustness is finite and measures of the target resource collapse to the same value. The single-shot result also applies to asymptotic parallel manipulation of channels to obtain asymptotic resource conversion rates. We give several examples of dynamical resources, including the purity, classical capacity, quantum capacity, non-uniformity, coherence, and entanglement of quantum channels. Our results are applicable to general dynamical resource theories with potential applications in quantum communication, fault-tolerant quantum computing, and quantum thermodynamics. © 2020, CC BY.

关键词： quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Variational quantum circuits for quantum state tomography

引用

Physical Review A 2020年第5期101卷 052316-052316页

作者： Yong Liu Dongyang Wang Shichuan Xue Anqi Huang Xiang Fu Xiaogang Qiang Ping Xu He-Liang Huang Mingtang Deng Chu Guo Xuejun Yang Junjie Wu Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha 410073 China National Innovation Institute of Defense Technology AMS 100071 Beijing China Henan Key Laboratory of Quantum Information and Cryptography IEU Zhengzhou 450001 China Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics University of Science and Technology of China Hefei Anhui 230026 China CAS Centre for Excellence and Synergetic Innovation Centre in Quantum Information and Quantum Physics University of Science and Technology of China Hefei Anhui 230026 China Quantum Intelligence Lab Supremacy Future Technologies Guangzhou 511340 China

quantum state tomography is a key process in most quantum experiments. In this work, we employ quantum machine learning for state tomography. Given an unknown quantum state, it can be learned by maximizing the fidelity between the output of a variational quantum circuit and this state. The number of parameters of the variational quantum circuit grows linearly with the number of qubits and the circuit depth, so that only polynomial measurements are required, even for highly entangled states. After that, a subsequent classical circuit simulator is used to transform the information of the target quantum state from the variational quantum circuit into a familiar format. We demonstrate our method by performing numerical simulations for the tomography of the ground state of a one-dimensional quantum spin chain, using a variational quantum circuit simulator. Our method is suitable for near-term quantum computing platforms, and could be used for relatively large-scale quantum state tomography for experimentally relevant quantum states.

关键词： Machine learning quantum algorithms quantum tomography

来源：评论

学校读者我要写书评

暂无评论

quantum candies and quantum cryptography

arXiv

引用

arXiv 2020年

作者： Lin, Junan Mor, Tal Institute for Quantum Computing Department of Physics and Astronomy University of Waterloo WaterlooONN2L 3G1 Canada Computer Science Department Technion – Israel Institute of Technology Technion city Haifa3200003 Israel

The field of quantum information is becoming more known to the general public. However, effectively demonstrating the concepts underneath quantum science and technology to the general public can be a challenging job. We investigate, extend, and much expand here "quantum candies" (invented by Jacobs), a pedagogical model for intuitively describing some basic concepts in quantum information, including quantum bits, complementarity, the no-cloning principle, and entanglement. Following Jacob’s quantum candies description of the well known quantum key distribution protocol BB84, we explicitly demonstrate various additional quantum cryptography protocols using quantum candies in an approachable manner. The model we investigate can be a valuable tool for science and engineering educators who would like to help the general public to gain more insights about quantum science and technology: most parts of this paper, including many protocols for quantum cryptography, are expected to be easily understandable by a layperson without any previous knowledge of mathematics, physics, or cryptography. © 2020, CC-BY.

关键词： quantum optics

来源：评论

学校读者我要写书评

暂无评论

Nonreciprocal enhancement of optomechanical second-order sidebands in a spinning resonator

引用

Physical Review A 2020年第3期102卷 033526-033526页

作者： Wen-An Li Guang-Yao Huang Ji-Pei Chen Yuan Chen School of Physics and Materials Science Guangzhou University Guangzhou 510006 China Research Center for Advanced Information Materials Guangzhou University Guangzhou 510006 China Institute for Quantum Information and State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha 410073 China

We theoretically study optomechanically induced second-order sideband generation in a spinning resonator. Due to the splitting of resonance frequencies of the countercirculating modes via the Sagnac effect, we find that second-order sidebands can be enhanced in one direction but suppressed in the other. Furthermore, the enhancement or suppression of second-order sidebands is closely related to the rotation speed of a resonator, incident direction of input fields, and frequency of driving fields. Finally, we study the influence of power of control fields on second-order sidebands, and find that the operating bandwidth for observing an obvious nonreciprocal enhancement of second-order sidebands can be significantly widened as the power of control fields increases. Our paper offers a promising route towards achieving tunable optical nonlinearity and convenient nonreciprocal optomechanical control in integrated photonic chips.

关键词： Optomechanics Second order nonlinear optical processes

来源：评论

学校读者我要写书评

暂无评论

Query complexity of generalized Simon’s problem

arXiv

引用

arXiv 2019年

作者： Ye, Zekun Huang, Yunqi Li, Lvzhou Wang, Yuyi Institute of Quantum Computing and Computer Science Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou510006 China Guangzhou510006 China Disco Group ETH Zurich Switzerland CRRC Zhuzhou Institute

Simon’s problem plays an important role in the history of quantum algorithms, as it inspired Shor to discover the celebrated quantum algorithm solving integer factorization in polynomial time. Besides, the quantum algorithm for Simon’s problem has been recently applied to break symmetric cryptosystems. Generalized Simon’s problem, denoted by GSP(p, n, k), is a natural extension of Simon’s problem: Given a function f: Zpn → X where X is a finite set and the promise that for any x, y ∈ Zpn, f (x) = f (y) iff x − y ∈ S for a subgroup S ≤ Zpn of rank k n−k}) values and any classical nonadaptive deterministic algorithm for GSP(p, n, k) has to query at least Ω (max{k, √k · pn−k}) values. Hence, we clearly show the classical computing model is less powerful than the quantum counterpart, in terms of query complexity for the generalized Simon’s problem. Moreover, we obtain an upper bound O (max{k, √k · pn−k}) on the classical deterministic query complexity of GSP(p, n, k), by devising a subtle classical algorithm based on group theory and the divide-and-conquer approach. Therefore, we have an almost full characterization of the classical deterministic query complexity of the generalized Simon’s problem. © 2019, CC BY.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Cerebrovascular Segmentation in MRA via Reverse Edge Attention Network 23rd

Cerebrovascular Segmentation in MRA via Reverse Edge Attenti...

引用

23rd International Conference on Medical Image computing and computer-Assisted Intervention, MICCAI 2020

作者： Zhang, Hao Xia, Likun Song, Ran Yang, Jianlong Hao, Huaying Liu, Jiang Zhao, Yitian College of Information Engineering Capital Normal University Beijing China Cixi Institute of Biomedical Engineering Ningbo Institute of Industrial Technology Chinese Academy of Sciences Ningbo China School of Control Science and Engineering Shandong University Jinan China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China International Science and Technology Cooperation Base of Electronic System Reliability and Mathematical Interdisciplinary Capital Normal University Beijing China Laboratory of Neural Computing and Intelligent Perception Capital Normal University Beijing China Beijing Advanced Innovation Center for Imaging Theory and Technology Capital Normal University Beijing China

ISBN: (纸本)9783030597245

Automated extraction of cerebrovascular is of great importance in understanding the mechanism, diagnosis, and treatment of many cerebrovascular pathologies. However, segmentation of cerebrovascular networks from magnetic resonance angiography (MRA) imagery continues to be challenging because of relatively poor contrast and inhomogeneous backgrounds, and the anatomical variations, complex geometry and topology of the networks themselves. In this paper, we present a novel cerebrovascular segmentation framework that consists of image enhancement and segmentation phases. We aim to remove redundant features, while retaining edge information in shallow features when combining these with deep features. We first employ a Retinex model, which is able to model noise explicitly to aid removal of imaging noise, as well as reducing redundancy within an image and emphasizing the vessel regions, thereby simplifying the subsequent segmentation problem. Subsequently, a reverse edge attention module is employed to discover edge information by paying particular attention to the regions that are not salient in high-level semantic features. The experimental results show that the proposed framework enables the reverse edge attention network to deliver a reliable cerebrovascular segmentation. © 2020, Springer Nature Switzerland AG.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Central charges of aperiodic holographic tensor-network models

引用

Physical Review A 2020年第4期102卷 042407-042407页

作者： Alexander Jahn Zoltán Zimborás Jens Eisert Dahlem Center for Complex Quantum Systems Freie Universität Berlin 14195 Berlin Germany Institute for Particle and Nuclear Physics Wigner Research Centre for Physics 1121 Budapest Hungary BME-MTA Lendület Quantum Information Theory Research Group 1111 Budapest Hungary Institute for Mathematics Budapest University of Technology and Economics 1111 Budapest Hungary Department of Mathematics and Computer Science Freie Universität Berlin 14195 Berlin Germany

Central to the AdS/CFT correspondence is a precise relationship between the curvature of an anti–de Sitter (AdS) space-time and the central charge of the dual conformal field theory (CFT) on its boundary. Our work shows that such a relationship can also be established for tensor network models of AdS/CFT based on regular bulk geometries, leading to an analytical form of the maximal central charges exhibited by the boundary states. We identify a class of tensors based on Majorana dimer states that saturate these bounds in the large curvature limit, while also realizing perfect and block-perfect holographic quantum error correcting codes. Furthermore, the renormalization group description of the resulting model is shown to be analogous to the strong disorder renormalization group, thus giving an example of an exact quantum error correcting code that gives rise to a well-understood critical system. These systems exhibit a large range of fractional central charges, tunable by the choice of bulk tiling. Our approach thus provides a precise physical interpretation of tensor network models on regular hyperbolic geometries and establishes quantitative connections to a wide range of existing models.

关键词： Gauge-gravity dualities quantum error correction Disordered systems Tensor network methods Tensor network renormalization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：