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

quantum continual learning of quantum data realizing knowledge backward transfer

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Situ, Haozhen Lu, Tianxiang Pan, Minghua Li, Lvzhou College of Mathematics and Informatics South China Agricultural University Guangzhou510642 China Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin541004 China Department of Physics Tsinghua University Beijing100084 China

For the goal of strong artificial intelligence that can mimic human-level intelligence, AI systems would have the ability to adapt to ever-changing scenarios and learn new knowledge continuously without forgetting previously acquired knowledge. When a machine learning model is consecutively trained on multiple tasks that come in sequence, its performance on previously learned tasks may drop dramatically during the learning process of the newly seen task. To avoid this phenomenon termed catastrophic forgetting, continual learning, also known as lifelong learning, has been proposed and become one of the most up-to-date research areas of machine learning. As quantum machine learning blossoms in recent years, it is interesting to develop quantum continual learning. This paper focuses on the case of quantum models for quantum data where the computation model and the data to be processed are both quantum. The gradient episodic memory method is incorporated to design a quantum continual learning scheme that overcomes catastrophic forgetting and realizes knowledge backward transfer. Specifically, a sequence of quantum state classification tasks is continually learned by a variational quantum classifier whose parameters are optimized by a classical gradient-based optimizer. The gradient of the current task is projected to the closest gradient, avoiding the increase of the loss at previous tasks, but allowing the decrease. Numerical simulation results show that our scheme not only overcomes catastrophic forgetting, but also realize knowledge backward transfer, which means the classifier's performance on previous tasks is enhanced rather than compromised while learning a new task. Copyright © 2022, The Authors. All rights reserved.

关键词： Machine learning

Implementing termination analysis on quantum programming

学校读者我要写书评

暂无评论

science China(Information sciences) 2019年第12期62卷 215-222页

作者： Shusen LIU Kan HE Runyao DUAN School of Data and Computer Science Sun Yat-sen University Institute for Quantum Computing Baidu Beijing Institute for Advanced Study Tsinghua University College of Mathematics & College of Information and Computer Science Taiyuan University of Technology

Termination analysis is an essential part in programming. Especially quantum programming concerning measurement, entanglement and even superposition are the foundations of bizarre behaviours in quantum programs. In this paper, we analyse and extend the theoretical theorems on termination analysis proposed by Ying et al. into computational theorems and algorithms. The new algorithm without the Jordan decomposition process has a significant acceleration with polynomial complexity both on terminating and almost-surely terminating programs. Moreover, the least upper bound of termination programs steps is studied and utilized to output the substituted matrix representation of quantum programs. We also implement four groups of experiments to illustrate the advantages of the new algorithm in case of processing a simplified quantum walk example comparing with the original counterpart.

关键词： termination analysis quantum while-language quantum programming quantum experiment terminating steps

Characterizing entanglement using quantum discord over state extensions

学校读者我要写书评

暂无评论

Physical Review A 2022年第1期105卷 012426-012426页

作者： Chunhe Xiong Sunho Kim Daowen Qiu Asutosh Kumar Junde Wu Institute of Quantum Computing and Computer Theory School of Computer Science and Engineering Sun Yat-sen University Guangzhou 510006 China Interdisciplinary Center for Quantum Information Department of Physics Zhejiang University Hangzhou 310027 China School of Computer and Computing Science Zhejiang University City College Hangzhou 310015 China School of Mathematical Sciences Harbin Engineering University Harbin 150001 China Instituto de Telecomunicaçőes Departamento de Matemática Instituto Superior Técnico Avenida Rovisco Pais 1 1049-001 Lisbon Portugal P. G. Department of Physics Gaya College Magadh University Rampur Gaya 823001 India Harish-Chandra Research Institute HBNI Chhatnag Road Jhunsi Allahabad 211019 India Vaidic and Modern Physics Research Centre Bhagal Bhim Bhinmal Jalore 343029 India School of Mathematical Sciences Zhejiang University Hangzhou 310027 China

We propose a framework to characterize entanglement with quantum discord, both asymmetric and symmetric, over state extensions. In particular, we show that the minimal Bures distance of discord over state extensions is equivalent to the Bures distance of entanglement. This equivalence places quantum discord in a more primitive position than entanglement conceptually in the sense that entanglement can be interpreted as an irreducible part of discord over all state extensions. Based on this equivalence, we also offer an operational meaning of the Bures distance of entanglement by connecting it to quantum state discrimination. Moreover, for the relative entropy part, we prove that the entanglement measure introduced by Devi and Rajagopal [A. R. U. Devi and A. K. Rajagopal, Phys. Rev. Lett. 100, 140502 (2008)] is actually equivalent to the relative entropy of entanglement. We also provide several quantifications of entanglement based on discord measures.

关键词： quantum correlations in quantum information quantum discord quantum entanglement

Performance limits due to thermal transport in graphene single-photon bolometers

学校读者我要写书评

暂无评论

Physical Review Applied 2024年第1期21卷 014006-014006页

作者： Caleb Fried B. Jordan Russell Ethan G. Arnault Bevin Huang Gil-Ho Lee Dirk Englund Erik A. Henriksen Kin Chung Fong Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge Massachusetts 02139 Department of Earth and Planetary Sciences Harvard University Cambridge Massachusetts 02138 USA Department of Physics Harvard University Cambridge Massachusetts 02138 USA Raytheon BBN Quantum Engineering and Computing Group Cambridge Massachusetts 02138 USA Department of Physics Washington University in St. Louis St. Louis Missouri USA Intelligence Community Postdoctoral Research Fellowship Program Massachusetts Institute of Technology Cambridge Massachusetts 02139 Department of Physics Pohang University of Science and Technology Pohang 790-784 Republic of Korea

In high-sensitivity bolometers and calorimeters, the photon absorption often occurs at a finite distance from the temperature sensor to accommodate antennas or avoid the degradation of superconducting circuitry exposed to radiation. As a result, thermal propagation from the input to the temperature readout can critically affect detector performance. In this paper we model the performance of a graphene bolometer, accounting for electronic thermal diffusion and dissipation via electron-phonon coupling at low temperatures in three regimes: clean, supercollision, and resonant scattering. Our results affirm the feasibility of a superconducting readout without Cooper-pair breaking by mid- and near-infrared photons, and provide a recipe for designing graphene absorbers for calorimetric single-photon detectors. We investigate the trade-off between the input-readout distance and detector efficiency, and predict an intrinsic timing jitter of approximately 2.7 ps. Based on our result, we propose a spatial-mode-resolving photon detector to increase the communication bandwidth.

关键词： Heat transfer Metrology Optical quantum information processing Graphene Josephson junctions Bolometers Calorimetry Single-photon detectors

Space-efficient Quantization Method for Reversible Markov Chains

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Chiang, Chen-Fu Chowdhury, Anirban Wocjan, Pawel Department of Computer and Information Science State University of New York Polytechnic Institute United States Institute for Quantum Computing University of Waterloo Canada Department of Combinatorics and Optimization University of Waterloo Canada Ibm Quantum Ibm T.J. Watson Research Center Yorktown HeightsNY10598 United States

In a seminal paper, Szegedy showed how to construct a quantum walk W(P) for any reversible Markov chain P such that its eigenvector with eigenphase 0 is a quantum sample of the limiting distribution of the random walk and its eigenphase gap is quadratically larger than the spectral gap of P. The standard construction of Szegedy's quantum walk requires an ancilla register of Hilbert-space dimension equal to the size of the state space of the Markov chain. We show that it is possible to avoid this doubling of state space for certain Markov chains that employ a symmetric proposal probability and a subsequent accept/reject probability to sample from the Gibbs distribution. For such Markov chains, we give a quantization method which requires an ancilla register of dimension equal to only the number of different energy values, which is often significantly smaller than the size of the state space. To accomplish this, we develop a technique for block encoding Hadamard products of matrices which may be of wider interest. Copyright © 2022, The Authors. All rights reserved.

关键词： quantum theory

Contextuality and Chaos

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Srivastava, Sanchit Ghose, Shohini Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Physics and Astronomy University of Waterloo WaterlooONN2L 3G1 Canada Department of Physics and Computer Science Wilfrid Laurier University WaterlooONN2L 3C5 Canada

Classical chaos is marked by an extreme sensitivity to initial conditions, where infinitesimally close trajectories separate exponentially over time. In quantum mechanics, however, unitary evolution and the uncertainty principle preclude such behavior, necessitating alternative approaches to identifying chaos in quantum systems. One must therefore seek quantum features that can indicate the emergence of chaos in the classical limit. Here, we show that contextuality, a quantum property that defies classical explanations, can serve as a signature of chaos. For a spin system undergoing chaotic dynamics, we demonstrate that violations of Bell-type inequality can effectively differentiate regular and chaotic regions of the phase space, suggesting that the nonclassicality of the system underpins signatures of chaos. © 2025, CC BY.

关键词： quantum chaos

A Robust and Learning Approach for Multi-Phase Aerial Search with UAVs

学校读者我要写书评

暂无评论

A Robust and Learning Approach for Multi-Phase Aerial Search...

作者： Zhongxuan Cai Minglong Li Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense Technology

Unmanned aerial vehicles(UAVs) have been attracting more and more attention in the research and industry field. Aerial search is a common mission and is intrinsically fit for UAVs, e.g. disaster rescue, remote sensing and environmental monitoring. With the improvement of UAV hardware and software, UAVs tend to achieve better autonomy and accomplish more complex tasks. However,current UAV aerial search is usually hardcoded, which limits their adaptability, autonomy and robustness in realistic scenarios. In this paper, we propose to address this problem by leveraging reinforcement learning(RL) and a recent control architecture, behavior trees(BTs). We develop robust and adaptive UAV systems that can automatically conduct multi-phase complex aerial search, including search, communication and refueling. Experimental results in a3 D robot simulator verify the effectiveness and robustness of the proposed approach, which achieves better performance than the baseline.

关键词： Unmanned aerial vehicles reinforcement learning behavior trees aerial search

A Cost-Efficient Platform Design for Distributed UAV Swarm Research

学校读者我要写书评

暂无评论

A Cost-Efficient Platform Design for Distributed UAV Swarm R...

作者： Zhongxuan Cai Xuefeng Chang Minglong Li Institute for Quantum Information &State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense Technology

Unmanned Aerial Vehicles(UAVs) have been attracting more and more attention in research and education. Specifically, Swarm intelligence is a promising future technology of UAVs and the frontier of multi-agent system research. It has the characteristics of low individual cost, strong system flexibility and robustness, and has great potential in many tasks. However, due to the constraints of research conditions and cost, most of the current researches on large-scale swarm UAVs are carried out in the simulation environment. Building a low-cost open-source software and hardware platform for swarm UAVs is an important basis for promoting researches on swarm UAVs and multi-agent systems. In this paper,we propose a design of a UAV platform with common cost-efficient hardware and a rich open-source software ecosystem, and provide a software solution for swarm robots based on the open-source robot operating system ROS. These software packages support the rapid programming development of swarm behaviors and different communication topology. Experiments have been conducted for typical UAV tasks like flocking and formation, indicating the effectiveness of the proposed platform.

关键词： Unmanned aerial vehicles UAV platform for research UAV hardware and software

Thermodynamics of quantum switch information capacity activation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liu, Xiangjing Ebler, Daniel Dahlsten, Oscar Shenzhen Institute for Quantum Science and Engineering Department of Physics Southern University of Science and Technology Shenzhen518055 China Theory Lab Central Research Institute Huawei Technology Co. Ltd. 2012 Labs Hong Kong Science Park Hong Kong Department of Computer Science The University of Hong Kong Pokfulam Road Hong Kong

We address a new setting where the second law is under question: thermalizations in a quantum superposition of causal orders, enacted by the so-called quantum switch. This superposition has been shown to be associated with an increase in the communication capacity of the channels, yielding an apparent violation of the data-processing inequality and a possibility to separate hot from cold. We analyze the thermodynamics of this information capacity increasing process. We show how the information capacity increase is compatible with thermodynamics. We show that there may indeed be an information capacity increase for consecutive thermalizations obeying the first and second laws of thermodynamics if these are placed in an indefinite order and moreover that only a significantly bounded increase is possible. The increase comes at the cost of consuming a thermodynamic resource, the free energy of coherence associated with the switch. © 2022, CC BY.

关键词： Free energy