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

Recent Advances for quantum Neural Networks in Generative Learning

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Tian, Jinkai Sun, Xiaoyu Du, Yuxuan Zhao, Shanshan Liu, Qing Zhang, Kaining Yi, Wei Huang, Wanrong Wang, Chaoyue Wu, Xingyao Hsieh, Min-Hsiu Liu, Tongliang Yang, Wenjing Tao, Dacheng Artificial Intelligence Research Center Defense Innovation Institute Beijing100071 China Tianjin Artificial Intelligence Innovation Center Tianjin300457 China The Blackett Laboratory Imperial College London LondonSW7 2AZ United Kingdom JD Explore Academy Beijing101111 China School of Physical and Mathematical Sciences Nanyang Technological University Singapore637371 Singapore Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China The University of Sydney DarlingtonNSW2008 Australia Research Institute Taipei Taiwan

quantum computers are next-generation devices that hold promise to perform calculations beyond the reach of classical computers. A leading method towards achieving this goal is through quantum machine learning, especially quantum generative learning. Due to the intrinsic probabilistic nature of quantum mechanics, it is reasonable to postulate that quantum generative learning models (QGLMs) may surpass their classical counterparts. As such, QGLMs are receiving growing attention from the quantum physics and computer science communities, where various QGLMs that can be efficiently implemented on near-term quantum machines with potential computational advantages are proposed. In this paper, we review the current progress of QGLMs from the perspective of machine learning. Particularly, we interpret these QGLMs, covering quantum circuit Born machines, quantum generative adversarial networks, quantum Boltzmann machines, and quantum autoencoders, as the quantum extension of classical generative learning models. In this context, we explore their intrinsic relation and their fundamental differences. We further summarize the potential applications of QGLMs in both conventional machine learning tasks and quantum physics. Last, we discuss the challenges and further research directions for QGLMs. © 2022, CC BY.

关键词： quantum theory

A High-Performance Storage System Based with Dual RAID Engine 1

学校读者我要写书评

暂无评论

4th International Conference on Smart computing and Communications, SmartCom 2019

作者： Liu, Jingyu Zhang, Jinrong Li, Juan Liu, Lu School of Artificial Intelligence Hebei University of Technology Tianjin China School of Computer Science and Technology Beijing Institute of Technology Beijing China Peng Cheng Laboratory Center for Quantum Computing Shenzhen518055 China

ISBN: (数字)9783030341398

ISBN: (纸本)9783030341381

With the advent of the 5G, more and more applications use cloud storage to store data. Data becomes the cornerstone of the development of smart society. At the same time, these data have the characteristics of uneven generation rate, large write demand and low read requirement. The dynamic change of load during data storage has new requirements for storage architecture. This paper proposes a storage system that allocates strips in real time based on current load changes. Based on the traditional RAID layout, a dual-engine based high-performance storage system (DSH) is proposed. This system uses software and hardware co-processing architecture to implement strip allocation and address calculation. The strip allocation functions using software and the verification algorithm is implemented by hardware transfer to the FPGA through PCIE. Through experimental analysis shows that the DSH algorithm has a great advantage in saving CPU computing resources and saving disk energy consumption in the dynamic load storage environment. © 2019, Springer Nature Switzerland AG.

关键词： HPSS

Testing a quantum error-correcting code on various platforms

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Guo, Qihao Zhao, Yuan-Yuan Grassl, Markus Nie, Xinfang Xiang, Guo-Yong Xin, Tao Yin, Zhang-Qi Zeng, Bei Institute for Quantum Computing Baidu Research Beijing100193 China Department of Applied Physics Xian Jiaotong University Xian Shaanxi710049 China Center for Quantum Computing Peng Cheng Laboratory Shenzhen518055 China CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei230026 China Max Planck Institute for the Science of Light Erlangen91058 Germany International Centre for Theory of Quantum Technologies Gdansk80-308 Poland Shenzhen Institute for Quantum Science and Engineering Southern University of Science and Technology Shenzhen518055 China Center for Quantum Technology Research School of Physics Beijing Institute of Technology Beijing100081 China Department of Physics Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong Department of Mathematics & Statistics University of Guelph GuelphONN1G 2W1 Canada Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada

quantum error correction plays an important role in fault-tolerant quantum information processing. It is usually difficult to experimentally realize quantum error correction, as it requires multiple qubits and quantum gates with high fidelity. Here we propose a simple quantum error-correcting code for the detected amplitude damping channel. The code requires only two qubits. We implement the encoding, the channel, and the recovery on an optical platform, the IBM Q System, and a nuclear magnetic resonance system. For all of these systems, the error correction advantage appears when the damping rate exceeds some threshold. We compare the features of these quantum information processing systems used and demonstrate the advantage of quantum error correction on current quantum computing platforms. Copyright © 2020, The Authors. All rights reserved.

关键词： Error correction

The rank of contextuality

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Horodecki, Karol Zhou, Jingfang Stankiewicz, Maciej Salazar, Roberto Horodecki, Pawel Raussendorf, Robert Horodecki, Ryszard Ramanathan, Ravishankar Tyhurst, Emily Institute of Informatics National Quantum Information Centre Faculty of Mathematics Physics and Informatics University of Gdańsk Wita Stwosza 57 Gdańsk80-308 Poland International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 Gdańsk80-308 Poland Department of Applied Physics Graduate School of Engineering University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-8656 Japan Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University Kraków30-348 Poland Faculty of Applied Physics and Mathematics National Quantum Information Centre Gdańsk University of Technology Gabriela Narutowicza 11/12 Gdańsk80-233 Poland Department of Physics and Astronomy University of British Columbia VancouverBCV6T 1Z1 Canada Department of Computer Science The University of Hong Kong Pokfulam Road Hong Kong Department of Physics University of Toronto TorontoON Canada

quantum contextuality is one of the most recognized resources in quantum communication and computing scenarios. We provide a new quantifier of this resource, the rank of contextuality (RC). We define RC as the minimum number of non-contextual behaviors that are needed to simulate a contextual behavior. We show that the logarithm of RC is a natural contextuality measure satisfying several properties considered in the spirit of the resource-theoretic approach. The properties include faithfulness, monotonicity, and additivity under tensor product. We also give examples of how to construct contextual behaviors with an arbitrary value of RC exhibiting a natural connection between this quantifier and the arboricity of an underlying hypergraph. We also discuss exemplary areas of research in which the new measure appears as a natural quantifier. Copyright © 2022, The Authors. All rights reserved.

关键词： quantum communication

Efficient Verification of Continuous-Variable quantum States and Devices without Assuming Identical and Independent Operations

学校读者我要写书评

暂无评论

Physical Review Letters 2021年第24期126卷 240503-240503页

作者： Ya-Dong Wu Ge Bai Giulio Chiribella Nana Liu QICI Quantum Information and Computation Initiative Department of Computer Science The University of Hong Kong Pokfulam Road Hong Kong The University of Hong Kong Shenzhen Institute of Research and Innovation 5/F Key Laboratory Platform Building No. 6 Yuexing 2nd Road Nanshan Shenzhen 518057 China Department of Computer Science Parks Road Oxford OX1 3QD United Kingdom Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada Institute of Natural Sciences Shanghai Jiao Tong University Shanghai 200240 China Ministry of Education Key Laboratory in Scientific and Engineering Computing Shanghai Jiao Tong University Shanghai 200240 China University of Michigan-Shanghai Jiao Tong University Joint Institute Shanghai 200240 China

Continuous-variable quantum information, encoded into infinite-dimensional quantum systems, is a promising platform for the realization of many quantum information protocols, including quantum computation, quantum metrology, quantum cryptography, and quantum communication. To successfully demonstrate these protocols, an essential step is the certification of multimode continuous-variable quantum states and quantum devices. This problem is well studied under the assumption that multiple uses of the same device result in identical and independently distributed (i.i.d.) operations. However, in realistic scenarios, identical and independent state preparation and calls to the quantum devices cannot be generally guaranteed. Important instances include adversarial scenarios and instances of time-dependent and correlated noise. In this Letter, we propose the first set of reliable protocols for verifying multimode continuous-variable entangled states and devices in these non-i.i.d scenarios. Although not fully universal, these protocols are applicable to Gaussian quantum states, non-Gaussian hypergraph states, as well as amplification, attenuation, and purification of noisy coherent states.

关键词： quantum benchmarking quantum cryptography quantum information processing with continuous variables

One-shot quantum state redistribution and quantum Markov chains

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Anshu, Anurag Hadiashar, Shima Bab Jain, Rahul Nayak, Ashwin Touchette, Dave School of Engineering and Applied Sciences Harvard University CambridgeMA United States Department of Combinatorics and Optimization Institute for Quantum Computing University of Waterloo 200 University Ave. W. WaterlooONN2L 3G1 Canada Department of Computer Science Center for Quantum Technologies National University of Singapore 21 Lower Kent Ridge Rd Singapore119077 Singapore Department of Computer Science Institut Quantique Université de Sherbrooke 2500 Boulevard de l’Université SherbrookeQCJ1K 2R1 Canada

We revisit the task of quantum state redistribution in the one-shot setting, and design a protocol for this task with communication cost in terms of a measure of distance from quantum Markov chains. More precisely, the distance is defined in terms of quantum max-relative entropy and quantum hypothesis testing entropy. Our result is the first to operationally connect quantum state redistribution and quantum Markov chains, and can be interpreted as an operational interpretation for a possible one-shot analogue of quantum conditional mutual information. The communication cost of our protocol is lower than all previously known ones and asymptotically achieves the well-known rate of quantum conditional mutual information. Thus, our work takes a step towards an optimal characterization of the resources required for one-shot quantum state redistribution, an important open problem in quantum Shannon theory. © 2021, CC BY.

关键词： Entropy

On the range of validity of perturbative models for galaxy clustering and its uncertainty

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Gambardella, Giosuè Biagetti, Matteo Moretti, Chiara Sefusatti, Emiliano Institute for Fundamental Physics of the Universe Via Beirut 2 Trieste34151 Italy Campus UAB Carrer de Can Magrans s/n Barcelona08193 Spain Area Science Park Località Padriciano 99 Trieste34149 Italy Scuola Internazionale di Studi Superiori Avanzati via Bonomea 265 Trieste34136 Italy Istituto Nazionale di Astrofisica Osservatorio Astronomico di Trieste via Tiepolo 11 Trieste34143 Italy Istituto Nazionale di Fisica Nucleare Sezione di Trieste via Valerio 2 Trieste34127 Italy Centro Nazionale "High Performance Computer Big Data and Quantum Computing" Italy

We explore the reach of an analytical model at one-loop in Perturbation theory (PT) to accurately describe measurements of the galaxy power spectrum from numerical simulations in redshift space. We consider the validity range in terms of three different diagnostics: 1) the goodness of fit;2) a figure-of-bias quantifying the error in recovering the fiducial value of a cosmological parameter;3) an internal consistency check of the theoretical model quantifying the running of the model parameters with the scale cut. We consider different sets of measurements corresponding to an increasing cumulative simulation volume in redshift space. For each volume we define a median value and the associated scatter for the largest wavenumber where the model is valid (the k-reach of the model). We find, as a rather general result, that the median value of the reach decreases with the simulation volume, as expected since the smaller statistical errors provide a more stringent test for the model. This is true for all the three definitions considered, with the one given in terms of the figure-of-bias providing the most stringent scale cut. More interestingly, we also find that the error associated with the k-reach value is quite large, with a significant probability of being as low as 0.1 ℎMpc−1 (or, more generally, up to 40% smaller than the median) for all the simulation volumes considered. We explore as well the additional information on the growth rate parameter encoded in the power spectrum hexadecapole, compared to the analysis of monopole and quadrupole, as a function of simulation volume. While our analysis is, in many ways, rather simplified, we find that the gain in the determination of the growth rate is quite small in absolute value and well within the statistical error on the corresponding figure of merit. Copyright © 2023, The Authors. All rights reserved.

关键词： Power spectrum

quantum Algorithms for Escaping from Saddle Points

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhang, Chenyi Leng, Jiaqi Li, Tongyang Institute for Interdisciplinary Information Sciences Tsinghua University Beijing China Department of Mathematics Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD United States Center on Frontiers of Computing Studies Peking University Beijing China Center for Theoretical Physics Massachusetts Institute of Technology CambridgeMA United States Department of Computer Science Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD United States

We initiate the study of quantum algorithms for escaping from saddle points with provable guarantee. Given a function f : Rn → R, our quantum algorithm outputs an Ε-approximate second-order stationary point using Õ(log2(n)/Ε1.75)1 queries to the quantum evaluation oracle (i.e., the zeroth-order oracle). Compared to the classical state-of-the-art algorithm by Jin et al. with Õ(log6(n)/Ε1.75) queries to the gradient oracle (i.e., the first-order oracle), our quantum algorithm is polynomially better in terms of log n and matches its complexity in terms of 1/Ε. Technically, our main contribution is the idea of replacing the classical perturbations in gradient descent methods by simulating quantum wave equations, which constitutes the improvement in the quantum query complexity with log n factors for escaping from saddle points. We also show how to use a quantum gradient computation algorithm due to Jordan to replace the classical gradient queries by quantum evaluation queries with the same complexity. Finally, we also perform numerical experiments that support our theoretical findings. © 2020, CC BY.

关键词： quantum theory

Differentiable quantum computational chemistry with PennyLane

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Arrazola, Juan Miguel Jahangiri, Soran Delgado, Alain Ceroni, Jack Izaac, Josh Száva, Antal Azad, Utkarsh Lang, Robert A. Niu, Zeyue Di Matteo, Olivia Moyard, Romain Soni, Jay Schuld, Maria Vargas-Hernández, Rodrigo A. Tamayo-Mendoza, Teresa Lin, Cedric Yen-Yu Aspuru-Guzik, Alán Killoran, Nathan Xanadu 777 Bay Street Toronto Canada Chemical Physics Theory Group Department of Chemistry University of Toronto Canada AWS Quantum Technologies SeattleWA98170 United States Vector Institute for Artificial Intelligence Toronto Canada Department of Chemistry and Chemical Biology Harvard University United States Department of Computer Science University of Toronto Canada Lebovic Toronto Canada

This work describes the theoretical foundation for all quantum chemistry functionality in PennyLane, a quantum computing software library specializing in quantum differentiable programming. We provide an overview of fundamental concepts in quantum chemistry, including the basic principles of the Hartree-Fock method. A flagship feature in PennyLane is the differentiable Hartree-Fock solver, allowing users to compute exact gradients of molecular Hamiltonians with respect to nuclear coordinates and basis set parameters. PennyLane provides specialized operations for quantum chemistry, including excitation gates as Givens rotations and templates for quantum chemistry circuits. Moreover, built-in simulators exploit sparse matrix techniques for representing molecular Hamiltonians that lead to fast simulation for quantum chemistry applications. In combination with PennyLane's existing methods for constructing, optimizing, and executing circuits, these methods allow users to implement a wide range of quantum algorithms for quantum chemistry. We discuss how PennyLane can be used to implement variational algorithms for calculating ground-state energies, excited-state energies, and energy derivatives, all of which can be differentiated with respect to both circuit and Hamiltonian parameters. We provide an example workflow describing how to jointly optimize circuit parameters, nuclear coordinates, and basis set parameters for quantum chemistry algorithms. We discuss a functionality for reducing the number of qubits by using symmetries and explain how PennyLane can be used to estimate quantum resources needed to implement several quantum algorithms. By combining insights from quantum computing, computational chemistry, and machine learning, PennyLane is the first library for differentiable quantum computational chemistry. Copyright © 2021, The Authors. All rights reserved.

关键词： quantum chemistry