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

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

作者： Xin Wang Mark M. Wilde Institute for Quantum Computing Baidu Research Beijing 100193 China Joint Center for Quantum Information and Computer Science University of Maryland College Park 20742 MD United States Hearne Institute for Theoretical Physics Department of Physics and Astronomy Center for Computation and Technology Louisiana State University Baton Rouge 70803 LA United States

The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More recently, the κ entanglement of a bipartite state was shown to be an entanglement measure that is both easily computable and has a precise information-theoretic meaning, being equal to the exact entanglement cost of a bipartite quantum state when the free operations are those that completely preserve the positivity of the partial transpose [Xin Wang and Mark M. Wilde, Phys. Rev. Lett. 125, 040502 (2020)]. In this paper, we provide a nontrivial link between these two entanglement measures by showing that they are the extremes of an ordered family of α-logarithmic negativity entanglement measures, each of which is identified by a parameter α∈1,∞. In this family, the original logarithmic negativity is recovered as the smallest with α=1, and the κ entanglement is recovered as the largest with α=∞. We prove that the α-logarithmic negativity satisfies the following properties: entanglement monotone, normalization, faithfulness, and subadditivity. We also prove that it is neither convex nor monogamous. Finally, we define the α-logarithmic negativity of a quantum channel as a generalization of the notion for quantum states, and we show how to generalize many of the concepts to arbitrary resource theories.

关键词： Entanglement measures quantum channels quantum correlations in quantum information quantum entanglement Resource theories

来源：评论

学校读者我要写书评

暂无评论

Topical Issue Scientific Machine Learning (1/2)

引用

GAMM Mitteilungen 2021年第1期44卷 e202100010-e202100010页

作者： Benner, Peter Klawonn, Axel Stoll, Martin Computational Methods in Systems and Control Theory Max Planck institute for Dynamics of Complex Technical Systems Magdeburg Germany Fakultät für Mathematik Otto-von-Guericke Universität Magdeburg Germany Department of Mathematics and Computer Science University of Cologne Germany Center for Data and Simulation Science University of Cologne Germany Chair of Scientific Computing Department of Mathematics TU Chemnitz Germany

来源：评论

学校读者我要写书评

暂无评论

Modeling Neural Networks Training Process with Markov Decision Process

Modeling Neural Networks Training Process with Markov Decisi...

引用

Artificial Intelligence and computer Engineering (ICAICE), International Conference on

作者： Yantao Bai Wanwei Liu Xinjun Mao Zhen Liang Key Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China College of Computer Science National University of Defense Technology Changsha China State Key Laboratory of High Performance Computing Institute for Quantum Information &#x0026 National University of Defense Technology Changsha China

ISBN: (纸本)9781665421874

With the development of computer technology, statistics-based machine learning method has made great break-throughs, and also improved the development of artificial intelligence. Nevertheless, as a very influential model, neural networks are still treated as “black boxes”. The results of neural networks are extremely sensitive to the training samples, which lead to great challenges to the controllability of the algorithm. With the wide application of machine learning, demand for interpretability and controllability of neural networks algorithms is increasing. As a result, various scholars have tried to explain and verify neural networks algorithms based on formal methods in recent years. In this paper, a method (called MNNTP) is presented to model the training process of neural networks by using a Markov decision process (MDP). Through MNNTP, the neural networks are abstracted into the form of MDP, which makes notable contributions for verifying some mathematical properties of the neural networks.

关键词： Training Machine learning algorithms Computational modeling Neural networks Machine learning Markov processes Controllability

来源：评论

学校读者我要写书评

暂无评论

Recent progress of integrated circuits and optoelectronic chips

引用

science China(Information sciences) 2021年第10期64卷 103-135页

作者： Yue HAO Shuiying XIANG Genquan HAN Jincheng ZHANG Xiaohua MA Zhangming ZHU Xingxing GUO Yahui ZHANG Yanan HAN Ziwei SONG Yan LIU Ling YANG Hong ZHOU Jiangyi SHI Wei ZHANG Min XU Weisheng ZHAO Biao PAN Yangqi HUANG Qi LIU Yimao CAI Jian ZHU Xin OU Tiangui YOU Huaqiang WU Bin GAO Zhiyong ZHANG Guoping GUO Yonghua CHEN Yong LIU Xiangfei CHEN Chunlai XUE Xingjun WANG Lixia ZHAO Xihua ZOU Lianshan YAN Ming LI School of Microelectronics Xidian University State Key Laboratory of Integrated Service Networks Xidian University National Integrated Circuit Innovation Center School of Microelectronics Fudan University School of Integrated Circuit Science and Engineering Beihang University China Center for Information Industry Development Frontier Institute of Chip and System Fudan University Institute of Microelectronics Peking University Nanjing Electronic Devices Institute State Key Laboratory of Functional Material for Informatics Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Institute of Microelectronics Tsinghua University Center for Carbon-based Electronics Department of Electronics Peking University CAS Key Laboratory of Quantum Information University of Science and Technology of China CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics University of Science and Technology of China Origin Quantum Computing Company Limited Key Laboratory of Flexible Electronics & Institute of Advanced Materials Nanjing Tech University State Key Laboratory of Electronic Thin Films and Integrated Devices School of Optoelectronic Science and EngineeringUniversity of Electronic Science and Technology of China National Laboratory of Solid State Microstructures & College of Engineering and Applied Sciences Nanjing University State Key Laboratory on Integrated Optoelectronics Institute of Semiconductors Chinese Academy of Sciences Center of Materials Science and Optoelectronics Engineering University of Chinese Academy of Sciences State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University School of Electrical and Electronic Engineering Tiangong University Center for Information Photonics and Communications School of Information Science and TechnologySouthwest Jiaotong University School of Electronic Electrical and Communication Engineering

Integrated circuits(ICs) and optoelectronic chips are the foundation stones of the modern information society. The IC industry has been driven by the so-called "Moore's law" in the past 60 years, and now has entered the post Moore's law era. In this paper, we review the recent progress of ICs and optoelectronic chips. The research status, technical challenges and development trend of devices, chips and integrated technologies of typical IC and optoelectronic chips are focused on. The main contents include the development law of IC and optoelectronic chip technology, the IC design and processing technology, emerging memory and chip architecture, brain-like chip structure and its mechanism, heterogeneous integration, quantum chip technology, silicon photonics chip technology, integrated microwave photonic chip, and optoelectronic hybrid integrated chip.

关键词： integrated circuit semiconductor science and technology optoelectronic device and chip photonic integrated circuit wide bandgap semiconductors silicon photonics hybrid integration quantum chip integrated microwave photonic photonic neural computing

来源：评论

学校读者我要写书评

暂无评论

Circuit lower bounds for low-energy states of quantum code Hamiltonians

arXiv

引用

arXiv 2020年

作者： Anshu, Anurag Nirkhe, Chinmay Simons Institute for the Theory of Computing BerkeleyCA94720 United States Challenge Institute for Quantum Computation University of California Berkeley94720 United States Electrical Engineering and Computer Sciences University of California Berkeley94720 United States

The No Low-energy Trivial States (NLTS) conjecture of Freedman and Hastings [FH14]-which posits the existence of a local Hamiltonian with a super-constant quantum circuit lower bound on the complexity of all low-energy states-identifies a fundamental obstacle to the resolution of the quantum PCP conjecture. In this work,we provide newtechniques, based on entropic and local indistinguishability arguments, that prove circuit lower bounds for all the low-energy states of local Hamiltonians arising from quantum error-correcting codes. For local Hamiltonians arising from nearly linear-rate or nearly linear-distance LDPC stabilizer codes, we prove super-constant circuit lower bounds for the complexity of all states of energy o(n). Such codes are known to exist and are not necessarily locally-testable, a property previously suspected to be essential for the NLTS conjecture. Curiously, such codes can also be constructed on a two-dimensional lattice, showing that low-depth states cannot accurately approximate the ground-energy even in physically relevant systems. Copyright © 2020, The Authors. All rights reserved.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Dephasing superchannels

引用

Physical Review A 2021年第5期104卷 052611-052611页

作者： Zbigniew Puchała Kamil Korzekwa Roberto Salazar Paweł Horodecki Karol Życzkowski Institute of Theoretical and Applied Informatics Polish Academy of Sciences 44-100 Gliwice Poland Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University 30-348 Kraków Poland International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 80-308 Gdańsk Poland Center for Theoretical Physics Polish Academy of Sciences 02-668 Warszawa Poland

We characterize a class of environmental noises that decrease the coherent properties of quantum channels by introducing and analyzing the properties of dephasing superchannels. These are defined as superchannels that affect only nonclassical properties of a quantum channel E, i.e., they leave invariant the transition probabilities induced by E in the distinguished basis. We prove that such superchannels ΞC form a particular subclass of Schur-product supermaps that act on the Jamiołkowski state J(E) of a channel E via a Schur product, J′=J∘C. We also find physical realizations of general ΞC through pre- and postprocessing employing dephasing channels with memory, and we show that memory plays a nontrivial role for quantum systems of dimension d>2. Moreover, we prove that the coherence-generating power of a general quantum channel is a monotone under dephasing superchannels. Finally, we analyze the effect that dephasing noise can have on a quantum channel E by investigating the number of distinguishable channels that E can be mapped to by a family of dephasing superchannels. More precisely, we upper-bound this number in terms of hypothesis-testing channel divergence between E and its fully dephased version, and we also relate it to the robustness of coherence of E.

关键词： quantum channels

来源：评论

学校读者我要写书评

暂无评论

quantum Simulation for High-Energy Physics

引用

PRX quantum 2023年第2期4卷 027001-027001页

作者： Christian W. Bauer Zohreh Davoudi A. Baha Balantekin Tanmoy Bhattacharya Marcela Carena Wibe A. de Jong Patrick Draper Aida El-Khadra Nate Gemelke Masanori Hanada Dmitri Kharzeev Henry Lamm Ying-Ying Li Junyu Liu Mikhail Lukin Yannick Meurice Christopher Monroe Benjamin Nachman Guido Pagano John Preskill Enrico Rinaldi Alessandro Roggero David I. Santiago Martin J. Savage Irfan Siddiqi George Siopsis David Van Zanten Nathan Wiebe Yukari Yamauchi Kübra Yeter-Aydeniz Silvia Zorzetti Physics Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Department of Physics Maryland Center for Fundamental Physics and the NSF Institute for Robust Quantum Simulation University of Maryland College Park Maryland 20742 USA Department of Physics University of Wisconsin Madison Wisconsin 53706 USA T-2 Los Alamos National Laboratory Los Alamos New Mexico 87545 USA Fermi National Accelerator Laboratory Batavia Illinois 60510 USA Enrico Fermi Institute University of Chicago Chicago Illinois 60637 USA Kavli Institute for Cosmological Physics University of Chicago Chicago Illinois 60637 USA Department of Physics University of Chicago Chicago Illinois 60637 USA Department of Physics and Illinois Center for the Advanced Study of the Universe and Illinois Quantum Information Science and Technology Center University of Illinois Urbana Illinois 61801 USA QuEra Computing Inc Boston Massachusetts 02135 USA Department of Mathematics University of Surrey Guildford Surrey GU2 7XH United Kingdom Center for Nuclear Theory Department of Physics and Astronomy Stony Brook University New York 11794-3800 USA Department of Physics Brookhaven National Laboratory Upton New York 11973 USA Peng Huanwu Center for Fundamental Theory Hefei Anhui 230026 China Interdisciplinary Center for Theoretical Study University of Science and Technology of China Hefei Anhui 230026 China Pritzker School of Molecular Engineering Chicago Quantum Exchange and Kadanoff Center for Theoretical Physics University of Chicago Illinois 60637 USA qBraid Co. Harper Court 5235 Chicago Illinois 60615 USA Department of Physics Harvard University Cambridge Massachusetts 02138 USA Department of Physics and Astronomy University of Iowa Iowa City Iowa 52242 USA Duke Quantum Center Duke University Durham North Carolina 27701 USA Department of Electrical and Computer Engineering Duke University Durham North Carolina 27708 USA Department of Physics Duke University

It is for the first time that quantum simulation for high-energy physics (HEP) is studied in the U.S. decadal particle-physics community planning, and in fact until recently, this was not considered a mainstream topic in the community. This fact speaks of a remarkable rate of growth of this subfield over the past few years, stimulated by the impressive advancements in quantum information sciences (QIS) and associated technologies over the past decade, and the significant investment in this area by the government and private sectors in the U.S. and other countries. High-energy physicists have quickly identified problems of importance to our understanding of nature at the most fundamental level, from tiniest distances to cosmological extents, that are intractable with classical computers but may benefit from quantum advantage. They have initiated, and continue to carry out, a vigorous program in theory, algorithm, and hardware co-design for simulations of relevance to the HEP mission. This Roadmap is an attempt to bring this exciting and yet challenging area of research to the spotlight, and to elaborate on what the promises, requirements, challenges, and potential solutions are over the next decade and beyond.

关键词： quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Two instances of random access code in the quantum regime

arXiv

引用

arXiv 2022年

作者： Sakharwade, Nitica Studziński, Michal Eckstein, Michal Horodecki, Pawel International Centre for Theory of Quantum Technologies University of Gdańsk Jana Bażyńskiego 1A Gdańsk80-309 Poland Perimeter Institute for Theoretical Physics Waterloo Canada Department of Physics and Astronomy University of Waterloo Waterloo Canada Institute of Theoretical Physics and Astrophysics National Quantum Information Centre in Gdańsk Faculty of Mathematics Physics and Informatics University of Gdańsk Wita Stwosza 57 Gdańsk80-952 Poland Institute of Theoretical Physics Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University ul. Lojasiewicza 11 Kraków30-348 Poland Faculty of Applied Physics and Mathematics National Quantum Information Centre Gdansk University of Technology Gabriela Narutowicza 11/12 Gdańsk80-233 Poland

We consider two classes of quantum generalisations of Random Access Code (RAC) and study the bounds for probabilities of success for such tasksa. It provides a useful framework for the study of certain information processing tasks with constrained resources. The first class is based on a random access code with quantum inputs and output known as the No-Signalling quantum RAC (NS-QRAC) box [A. Grudka et al., Phys. Rev. A 92, 052312 (2015)], where unbounded entanglement and constrained classical communication are allowed. We show that it can be seen as quantum teleportation with constrained classical communication and provide a lower quantum bound for the success probability. We consider two modifications to the NS-QRAC scenario: The first, where unbounded entanglement and constrained quantum communication is allowed and the second, where bounded entanglement and unconstrained classical communication is allowed. We find a monogamy relation for the transmission fidelities, which - in contrast to the usual communication schemes - involves multiple senders and a single receiver. We provide an upper bounds for the latter and a lower one for the former. The second class is based on a RAC with a quantum channel and shared entanglement [A. Tavakoli et al., PRX quantum 2, 040357 (2021)]. We study the set of tasks where two inputs made of two digits of d-base are encoded over a qudit and a maximally entangled state. We show that such tasks can be seen as quantum dense-coding with constrained quantum communication and explicit protocols, which give lower quantum bounds for the tasks' efficiency, in dimensions d = 2, 3, 4. The employed encoding utilises Gray codes. Copyright © 2022, The Authors. All rights reserved.

关键词： quantum communication

来源：评论

学校读者我要写书评

暂无评论

Dynamical-invariant-based holonomic quantum gates: theory and experiment

arXiv

引用

arXiv 2020年

作者： Li, Yingcheng Xin, Tao Qiu, Chudan Li, Keren Liu, Gangqin Li, Jun Wan, Yidun Lu, Dawei State Key Laboratory of Surface Physics Department of Physics Center for Field Theory and Particle Physics Institute for Nanoelectronic devices and Quantum computing Fudan University Shanghai200433 China Shenzhen Institute for Quantum Science and Engineering Department of Physics Southern University of Science and Technology Shenzhen518055 China Guangdong Provincial Key Laboratory of Quantum Science and Engineering ShenzhenGuangdong518055 China Center for Quantum Computing Peng Cheng Laboratory Shenzhen518055 China Institute of Physics Chinese Academy of Sciences Beijing100190 China

Among existing approaches to holonomic quantum computing, the adiabatic holonomic quantum gates (HQGs) suffer errors due to decoherence, while the non-adiabatic HQGs either require additional Hilbert spaces or are difficult to scale. Here, we report a systematic, scalable approach based on dynamical invariants to realize HQGs without using additional Hilbert spaces. While presenting the theoretical framework of our approach, we design and experimentally evaluate single-qubit and two-qubits HQGs for the nuclear magnetic resonance system. The single-qubit gates acquire average fidelity 0.9972 by randomized benchmarking, and the controlled-NOT gate acquires fidelity 0.9782 by quantum process tomography. Our approach is also platform-independent, and thus may open a way to large-scale holonomic quantum computation. Copyright © 2020, The Authors. All rights reserved.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Optimal parameter configurations for sequential optimization of the variational quantum eigensolver

引用

Physical Review Research 2023年第4期5卷 043136-043136页

作者： Katsuhiro Endo Yuki Sato Rudy Raymond Kaito Wada Naoki Yamamoto Hiroshi C. Watanabe Research Center for Computational Design of Advanced Functional Materials National Institute of Advanced Industrial Science and Technology (AIST) 1-1-1 Umezono Tsukuba Ibaraki 305-8568 Japan Quantum Computing Center Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama 223-8522 Japan Toyota Central R & D Labs. Inc. Koraku Mori Building 10F 1-4-14 Koraku Bunkyo-ku Tokyo 112-0004 Japan IBM Quantum IBM Japan 19-21 Nihonbashi Hakozaki-cho Chuo-ku Tokyo 103-8510 Japan Department of Computer Science The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama 223-8522 Japan Department of Chemistry Graduate School of Science Kyushu University 744 Motooka Nishi-ku Fukuoka 819-0395 Japan

The variational quantum eigensolver (VQE) is a hybrid algorithm to find the minimum eigenvalue/vector of the given Hamiltonian by optimizing a parameterized quantum circuit (PQC) using a classical computer. Sequential optimization methods, which are often used in quantum circuit tensor networks, are popular for optimizing the parameterized gates of PQCs. In this paper, we focus on the case where the components to be optimized are single-qubit gates, in which the analytic optimization of a single-qubit gate is sequentially performed. The analytical solution is given by diagonalization of a matrix whose elements are computed from the expectation values of observables specified by a set of predetermined parameters, which we refer to as the parameter configurations. In this paper, we first show that the optimization accuracy significantly depends on the choice of parameter configurations owing to the statistical errors in the expectation values. We then identify a metric that quantifies the optimization accuracy of a parameter configuration for all possible statistical errors, named configuration overhead/cost or C-cost. We theoretically provide the lower bound of C-cost and show that, for the minimum size of parameter configurations, the lower bound is achieved if and only if the parameter configuration satisfies the so-called equiangular line condition. Finally, we provide numerical experiments demonstrating that the optimal parameter configuration exhibits the best result in several VQE problems. We hope that this general statistical methodology will enhance the efficacy of sequential optimization of PQCs for solving practical problems with near-term quantum devices.

关键词： quantum algorithms & computation quantum circuits quantum computation quantum information processing quantum measurements quantum parameter estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：