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

arXiv 2023年

作者： Augustino, Brandon Leng, Jiaqi Nannicini, Giacomo Terlaky, Tamás Wu, Xiaodi Sloan School of Management Massachusetts Institute of Technology United States Simons Institute for the Theory of Computing Department of Mathematics University of California Berkeley United States Department of Industrial and Systems Engineering University of Southern California United States Department of Industrial and Systems Engineering Lehigh University United States Quantum Computing and Optimization Lab Lehigh University United States Department of Mathematics University of Maryland College Park United States Department of Computer Science University of Maryland College Park United States Joint Center for Quantum Information and Computer Science University of Maryland United States

We propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a single simulation working directly with the nonlinear complementarity equations. This approach yields an algorithm for solving linear optimization problems involving m constraints and n variables to Ε-optimality using O (√m + n · RΕ1) queries to an oracle that evaluates a potential function, where R1 is an 1-norm upper bound on the size of the optimal solution. In the standard gate model (i.e., without access to quantum RAM) our algorithm can obtain highly-precise solutions to LO problems using at most O (√m + n · nnz(A)RΕ1) elementary gates, where nnz(A) is the total number of non-zero elements found in the constraint matrix. © 2023, CC BY.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

quantum Gravity in the Lab. I. Teleportation by Size and Traversable Wormholes

引用

PRX quantum 2023年第1期4卷 010320-010320页

作者： Adam R. Brown Hrant Gharibyan Stefan Leichenauer Henry W. Lin Sepehr Nezami Grant Salton Leonard Susskind Brian Swingle Michael Walter Google Mountain View California 94043 USA Department of Physics Stanford University Stanford California 94305 USA Institute for Quantum Information and Matter Caltech Pasadena California 91125 USA Physics Department Princeton University Princeton New Jersey 08540 USA Amazon Quantum Solutions Lab Seattle Washington 98170 USA Amazon Web Services (AWS) Center for Quantum Computing Pasadena California 91125 USA Condensed Matter Theory Center Joint Center for Quantum Information and Computer Science Maryland Center for Fundamental Physics and Department of Physics University of Maryland College Park Maryland 20742 USA Faculty of Computer Science Ruhr University Bochum D-44801 Bochum Germany Korteweg–de Vries Institute for Mathematics Institute for Theoretical Physics Institute for Logic Language and Computation & QuSoft University of Amsterdam 1090 GE Amsterdam Kingdom of the Netherlands

With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in the recent traversable-wormhole constructions of Gao et al. [J. High Energy Phys., 2017, 151 (2017)] and Maldacena et al. [Fortschr. Phys., 65, 1700034 (2017)]: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of teleportation by size to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semiclassical holographic wormhole corresponds to a rather special property of the operator-size distribution that we call size winding. For more general systems (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversable-wormhole phenomenon. In addition, a form of signaling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole but, rather, to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations that are feasible with current technology in two experimental platforms: Rydberg-atom arrays and trapped ions.

关键词： quantum algorithms quantum entanglement quantum gravity quantum teleportation

来源：评论

学校读者我要写书评

暂无评论

Efficient quantum Circuits for Machine Learning Activation Functions including Constant T-depth ReLU

arXiv

引用

arXiv 2024年

作者： Zi, Wei Wang, Siyi Kim, Hyunji Sun, Xiaoming Chattopadhyay, Anupam Rebentrost, Patrick State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Engineering Nanyang Technological University Singapore Hansung University Seoul Korea Republic of Centre for Quantum Technologies National University of Singapore Singapore School of Computing National University of Singapore Singapore

In recent years, quantum Machine Learning (QML) has increasingly captured the interest of researchers. Among the components in this domain, activation functions hold a fundamental and indispensable role. Our research focuses on the development of activation functions quantum circuits for integration into fault-tolerant quantum computing architectures, with an emphasis on minimizing T-depth. Specifically, we present novel implementations of ReLU and leaky ReLU activation functions, achieving constant T-depths of 4 and 8, respectively. Leveraging quantum lookup tables, we extend our exploration to other activation functions such as the sigmoid. This approach enables us to customize precision and T-depth by adjusting the number of qubits, making our results more adaptable to various application scenarios. This study represents a significant advancement towards enhancing the practicality and application of quantum machine learning. Copyright © 2024, The Authors. All rights reserved.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

Reconstructed (charm) baryon methods at finite temperature on anisotropic lattices 40

Reconstructed (charm) baryon methods at finite temperature o...

引用

40th International Symposium on Lattice Field theory, LATTICE 2023

作者： Bignell, Ryan Aarts, Gert Allton, Chris Anwar, M. Naeem Burns, Timothy J. Jäger, Benjamin Skullerud, Jon-Ivar Department of Physics Swansea University SwanseaSA2 8PP United Kingdom & Fondazione Bruno Kessler Strada delle Tabarelle 286 TN Villazzano38123 Italy Quantum Field Theory Center & Danish IAS Department of Mathematics and Computer Science University of Southern Denmark Odense M5230 Denmark Department of Theoretical Physics and Hamilton Institute National University of Ireland Maynooth County Kildare Ireland School of Mathematics Trinity College Dublin Ireland

Reconstructed-correlator methods have been used to investigate thermal effects in mesonic correlation functions in a fit-independent manner. This technique has recently been extended to the baryonic sector. In this work different ways of implementing this approach for baryon correlators are examined. Using both real and synthetic data it is found that for heavy baryons, such as the Ξcc(ccu) baryon, different choices are equivalent and that for the lighter nucleon the effect of different implementations is minimal. Further comparison to the so-called "double ratio" using the FASTSUM Generation 2L thermal ensembles shows that reconstructed-correlator ratios and double ratios contain nearly identical quantitative information. © Copyright owned by the author(s) under the terms of the Creative Commons.

关键词： Crystal lattices

来源：评论

学校读者我要写书评

暂无评论

quantum Speedup and Limitations on Matroid Property Problems

arXiv

引用

arXiv 2021年

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

This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits (bases, flats, hyperplanes) of a matroid, and for the decision problem of deciding whether a matroid is uniform or Eulerian, by giving a uniform lower bound Ω(q( ⌊n/n2⌋ )) on the query complexity for all these problems. On the other hand, for the uniform matroid decision problem, an asymptotically optimal quantum algorithm is proposed which achieves the lower bound, and for the girth problem, an almost optimal quantum algorithm is given with query complexity O(log n q( ⌊n/n2⌋ )). In addition, for the paving matroid decision problem, a lower bound Ω(q( ⌊n/n2⌋ )/n) on the query complexity is obtained, and an O(q( ⌊n/n2⌋ )) quantum algorithm is presented. © 2021, CC BY.

关键词： quantum computers

来源：评论

学校读者我要写书评

暂无评论

Heralded nonlocal quantum gates for distributed quantum computation in a decoherence-free subspace

引用

Physical Review A 2024年第5期110卷 052612-052612页

作者： Wanhua Su Wei Qin Adam Miranowicz Tao Li Franco Nori MIIT Key Laboratory of Semiconductor Microstructure and Quantum Sensing School of Physics Nanjing University of Science and Technology Nanjing 210094 China Center for Joint Quantum Studies and Department of Physics School of Science Tianjin University Tianjin 300350 China Theoretical Quantum Physics Laboratory Cluster for Pioneering Research RIKEN Wakoshi Saitama 351-0198 Japan Institute of Spintronics and Quantum Information Faculty of Physics and Astronomy Adam Mickiewicz University PL-61-614 Poznań Poland Engineering Research Center of Semiconductor Device Optoelectronic Hybrid Integration in Jiangsu Province Nanjing 210094 China Quantum Information Physics Theory Research Team Quantum Computing Center RIKEN Wako-shi Saitama 351-0198 Japan Physics Department The University of Michigan Ann Arbor Michigan 48109-1040 USA

We propose a heralded protocol for implementing nontrivial quantum gates on two stationary qubits coupled to spatially separated cavities. By dynamically controlling the evolution of the composite system, nonlocal two-qubit quantum (e.g., cphase and cnot) gates can be achieved without real excitations of either cavity modes or atoms. The success of our protocol is conditioned on projecting an auxiliary atom onto a postselected state, which simultaneously removes various detrimental effects of dissipation on the gate fidelity. In principle, the success probability of the gate can approach unity as the single-atom cooperativity becomes sufficiently large. Furthermore, we show its application for implementing single- and two-qubit gates within a decoherence-free subspace that is immune to a collective dephasing noise. This faithful, heralded, and nonlocal protocol could, therefore, be useful for distributed quantum computation and scalable quantum networks.

关键词： quantum computation quantum gates quantum networks quantum repeaters

来源：评论

学校读者我要写书评

暂无评论

Teleportation of quantum coherence

引用

Physical Review A 2023年第4期108卷 042620-042620页

作者： Sohail Arun K. Pati Vijeth Aradhya Indranil Chakrabarty Subhasree Patro Quantum Information and Computation Group Harish-Chandra Research Institute A CI of Homi Bhabha National Institute Chhatnag Road Jhunsi Prayagraj 211019 India Centre for Quantum Science and Technology International Institute of Information Technology Hyderabad Gachibowli Hyderabad-500032 Telangana India Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad Gachibowli Hyderabad-500032 Telangana India Department of Computer Science National University of Singapore 117417 Singapore Computer science and physics department Utrecht University 3584 CS Utrecht The Netherlands Algorithms and complexity group QuSoft Centrum Wiskunde and Informatica 1098XG Amsterdam The Netherlands

We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a smaller number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a nonmaximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's laboratory in terms of the composition of the completely positive maps corresponding to the shared resource state and a joint positive operator-valued measure (POVM) performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is perfectly possible with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with Werner states and show that even when Werner states become separable, the amount of teleported coherence is nonzero, implying the possibility of teleportation of coherence without entanglement.

关键词： quantum coherence & coherence measures quantum communication quantum correlations in quantum information quantum information theory quantum protocols

来源：评论

学校读者我要写书评

暂无评论

BioNet+: A Comprehensive Interaction Model of Finding Therapeutics for Diseases with Graph Deep Learning

BioNet+: A Comprehensive Interaction Model of Finding Therap...

引用

IEEE International Conference on High Performance computing and Communications (HPCC)

作者： Jinglun Ma Yanlong Qiu Canqun Yang Chengkun Wu Institute for Quantum Information & State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China College of Computer Science and Techology National University of Defense Technology Changsha China

The prediction of interactions between biomedical entities is crucial for the discovery of therapeutics for diseases. The fundamental step is to build an interaction model with a comprehensive coverage on literature and curated databases. The massive amount of heterogeneous data in interaction networks of biomedical entities poses significant challenges to relevant prediction tasks. Previous research has mainly focused on constructing networks with limited types of entity relations. In this paper, we construct a large-scale heterogeneous graph model, BioNet+, using a data-driven approach to extract latent information and predict various relations among biomedical entities. BioNet+ provides a crucial update to our previous BioNet model, with the addition of disease entities. The model employs a graph convolution encoder to learn embedding information from the intricate interactions among chemicals (C), genes (G), diseases (D), and biological pathways (P). Furthermore, a decoder that applies two tensor decomposition methods is deployed to predict multiple types of relations, including CG, CD, and GD interactions. The model constructs a graph network consisting of 81,987 entity nodes and 206,195,703 interaction edges. To handle this massive model, BioNet+ reduces the computational complexity via data categorization and proposes a parallel model training algorithm for cross-node GPUs. Evaluation experiments demonstrate that BioNet+ achieves superior predictive performance, as demonstrated by its highest area under the receiver operating characteristic curve (AUROC) of 0.964.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Embedding All Feasible Solutions of Traveling Salesman Problem by Divide-and-Conquer quantum Search

Embedding All Feasible Solutions of Traveling Salesman Probl...

引用

quantum computing and Engineering (QCE), IEEE International Conference on

作者： Rei Sato Kazuhiro Saito Tetsuro Nikuni Shohei Watabe Quantum Computing Project KDDI Reserch Inc. Fujimino Saitama Japan Department of Physics Faculty of Science Division I Tokyo University of Science Tokyo Japan Faculty of Engineering Computer Science and Engineering Shibaura Institute of Technology Tokyo Japan

quantum search algorithms, such as the Grover algorithm, are investigated as one of the ways to solve a traveling salesman problem (TSP). In TSP, the quantum search starts from an equal superposition of all feasible solutions. The embedding cost of all feasible solutions is up to exponential, i.e., $\mathcal{O}(n!)$ with $n$ cities, and makes it difficult to solve large-scale TSP. Hence, preparing the initial state of TSP at a lower embedding cost is an important issue. Here, we propose a quantum search algorithm based on the divide-and-conquer approach, which divides each constraint term of the TSP into subproblems and applies the quantum search to each subproblem. We investigate the embedding quality of all feasible solutions by comparing our proposed method with the Grover algorithm regarding optimal iterations and success probability. The results show that our quantum divide-and-conquer approach can significantly reduce the embedding cost while the success probability decreases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aspects of the phenomenology of interference that are genuinely nonclassical

引用

Physical Review A 2023年第2期108卷 022207-022207页

作者： Lorenzo Catani Matthew Leifer Giovanni Scala David Schmid Robert W. Spekkens Electrical Engineering and Computer Science Department Technische Universität Berlin 10587 Berlin Germany Institute for Quantum Studies and Schmid College of Science and Technology Chapman University One University Drive Orange California 92866 USA International Centre for Theory of Quantum Technologies University of Gdansk 80-308 Gdansk Poland Perimeter Institute for Theoretical Physics 31 Caroline Street North Waterloo Ontario Canada N2L 2Y5

Interference phenomena are often claimed to resist classical explanation. However, such claims are undermined by the fact that the specific aspects of the phenomenology upon which they are based can in fact be reproduced in a noncontextual ontological model [Catani et al., arXiv:2111.13727]. This raises the question of what other aspects of the phenomenology of interference do in fact resist classical explanation. We answer this question by demonstrating that the most basic quantum wave-particle duality relation, which expresses the precise tradeoff between path distinguishability and fringe visibility, cannot be reproduced in any noncontextual model. We do this by showing that it is a specific type of uncertainty relation and then leveraging a recent result establishing that noncontextuality restricts the functional form of this uncertainty relation [Catani et al., Phys. Rev. Lett. 129, 240401 (2022)]. Finally, we discuss what sorts of interferometric experiment can demonstrate contextuality via the wave-particle duality relation.

关键词： quantum foundations quantum information processing quantum interference effects

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：