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

Insecurity of Detector-Device-Independent quantum Key Distribution

Physical Review Letters 2016年第25期117卷 250505-250505页

作者： Shihan Sajeed Anqi Huang Shihai Sun Feihu Xu Vadim Makarov Marcos Curty Institute for Quantum Computing University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Electrical and Computer Engineering University of Waterloo Waterloo Ontario N2L 3G1 Canada College of Science National University of Defense Technology Changsha 410073 China Research Laboratory of Electronics Massachusetts Institute of Technology 77 Massachusetts Avenue Cambridge Massachusetts 02139 USA Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Escuela de Ingeniería de Telecomunicación Department of Signal Theory and Communications University of Vigo Vigo E-36310 Spain

Detector-device-independent quantum key distribution (DDI-QKD) held the promise of being robust to detector side channels, a major security loophole in quantum key distribution (QKD) implementations. In contrast to what has been claimed, however, we demonstrate that the security of DDI-QKD is not based on postselected entanglement, and we introduce various eavesdropping strategies that show that DDI-QKD is in fact insecure against detector side-channel attacks as well as against other attacks that exploit devices’ imperfections of the receiver. Our attacks are valid even when the QKD apparatuses are built by the legitimate users of the system themselves, and thus, free of malicious modifications, which is a key assumption in DDI-QKD.

关键词： quantum communication quantum cryptography quantum information processing quantum optics

来源：评论

学校读者我要写书评

暂无评论

Readiness of quantum Optimization Machines for Industrial Applications

arXiv

引用

arXiv 2017年

作者： Perdomo-Ortiz, Alejandro Feldman, Alexander Ozaeta, Asier Isakov, Sergei V. Zhu, Zheng O’Gorman, Bryan Katzgraber, Helmut G. Diedrich, Alexander Neven, Hartmut de Kleer, Johan Lackey, Brad Biswas, Rupak Quantum Artificial Intelligence Lab. NASA Ames Research Center Moffett FieldCA94035 United States Mountain ViewCA94043 United States Zapata Computing Inc. 439 University Avenue Office 535 TorontoONM5G 1Y8 Department of Computer Science University College London LondonWC1E 6BT United Kingdom Palo Alto Research Center 3333 Coyote Hill Road Palo AltoCA94304 United States QC Ware Corp. 125 University Ave. Suite 260 Palo AltoCA94301 United States Google Inc. Zurich8002 Switzerland Department of Physics and Astronomy Texas A&M University College StationTX77843-4242 United States Berkeley Center for Quantum Information and Computation BerkeleyCA94720 United States Department of Chemistry University of California BerkeleyCA94720 United States VancouverBCV6B 4W4 Canada Santa Fe Institute 1399 Hyde Park Road Santa FeNM87501 United States Fraunhofer IOSB-INA Lemgo Germany Google Inc. VeniceCA90291 United States Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Departments of Computer Science and Mathematics University of Maryland College ParkMD20742 United States Mathematics Research Group National Security Agency Ft. George G. MeadeMD20755 United States Exploration Technology Directorate NASA Ames Research Center Moffett FieldCA94035 United States

There have been multiple attempts to demonstrate that quantum annealing and, in particular, quantum annealing on quantum annealing machines, has the potential to outperform current classical optimization algorithms implemented on CMOS technologies. The benchmarking of these devices has been controversial. Initially, random spin-glass problems were used, however, these were quickly shown to be not well suited to detect any quantum speedup. Subsequently, benchmarking shifted to carefully crafted synthetic problems designed to highlight the quantum nature of the hardware while (often) ensuring that classical optimization techniques do not perform well on them. Even worse, to date a true sign of improved scaling with the number of problem variables remains elusive when compared to classical optimization techniques. Here, we analyze the readiness of quantum annealing machines for real-world application problems. These are typically not random and have an underlying structure that is hard to capture in synthetic benchmarks, thus posing unexpected challenges for optimization techniques, both classical and quantum alike. We present a comprehensive computational scaling analysis of fault diagnosis in digital circuits, considering architectures beyond D-wave quantum annealers. We find that the instances generated from real data in multiplier circuits are harder than other representative random spin-glass benchmarks with a comparable number of variables. Although our results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for testing near-term quantum annealers and other quantum algorithmic strategies for optimization problems. Copyright © 2017, The Authors. All rights reserved.

关键词： quantum theory

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROscience 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

OpenFermion: The electronic structure package for quantum computers

arXiv

引用

arXiv 2017年

作者： McClean, Jarrod R. Sung, Kevin J. Kivlichan, Ian D. Cao, Yudong Dai, Chengyu Schuyler Fried, E. Gidney, Craig Gimby, Brendan Gokhale, Pranav Häner, Thomas Hardikar, Tarini Havlíček, Vojtěch Higgott, Oscar Huang, Cupjin Izaac, Josh Jiang, Zhang Liu, Xinle McArdle, Sam Neeley, Matthew O'Brien, Thomas O'Gorman, Bryan Ozfidan, Isil Radin, Maxwell D. Romero, Jhonathan Rubin, Nicholas Sawaya, Nicolas P.D. Setia, Kanav Sim, Sukin Steiger, Damian S. Steudtner, Mark Sun, Qiming Sun, Wei Wang, Daochen Zhang, Fang Babbush, Ryan Google Inc. VeniceCA90291 United States Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109 United States Department of Physics Harvard University CambridgeMA02138 United States Department of Chemistry and Chemical Biology Harvard University CambridgeMA02138 United States Zapata Computing Inc. Cambridge02138 United States Department of Physics University of Michigan Ann ArborMI48109 United States Rigetti Computing BerkeleyCA94710 United States Google Inc. Santa BarbaraCA93117 Department of Computer Science University of Chicago ChicagoIL60637 United States Theoretische Physik ETH Zurich Zurich8093 Switzerland Department of Physics Dartmouth College HanoverNH03755 United States Department of Computer Science Oxford University OxfordOX1 3QD United Kingdom Department of Physics and Astronomy University College London Gower Street LondonWC1E 6BT United Kingdom Xanadu 372 Richmond St W TorontoM5V 1X6 Canada QuAIL NASA Ames Research Center Moffett FieldCA94035 Google Inc. Mountain ViewCA94043 United States Department of Materials University of Oxford Parks Road OxfordOX1 3PH United Kingdom Instituut-Lorentz Universiteit Leiden Leiden2300 RA Netherlands BQIC University of California BerkeleyCA94720 United States D-Wave Systems Inc. BurnabyBC Canada Materials Department University of California Santa Barbara Santa BarbaraCA93106 United States QuTech Delft University of Technology Lorentzweg 1 Delft2628 CJ Netherlands Division of Chemistry and Chemical Engineering California Institute of Technology PasadenaCA91125 United States Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States

quantum simulation of chemistry and materials is predicted to be an important application for both near-term and fault-tolerant quantum devices. However, at present, developing and studying algorithms for these problems can be difficult due to the prohibitive amount of domain knowledge required in both the area of chemistry and quantum algorithms. To help bridge this gap and open the field to more researchers, we have developed the OpenFermion software package (***). OpenFermion is an open-source software library written largely in Python under an Apache 2.0 license, aimed at enabling the simulation of fermionic and bosonic models and quantum chemistry problems on quantum hardware. Beginning with an interface to common electronic structure packages, it simplifies the translation between a molecular specification and a quantum circuit for solving or studying the electronic structure problem on a quantum computer, minimizing the amount of domain expertise required to enter the field. The package is designed to be extensible and robust, maintaining high software standards in documentation and testing. This release paper outlines the key motivations behind design choices in OpenFermion and discusses some basic OpenFermion functionality which we believe will aid the community in the development of better quantum algorithms and tools for this exciting area of research. Copyright © 2017, The Authors. All rights reserved.

关键词： Electronic structure

来源：评论

学校读者我要写书评

暂无评论

Erratum: Bright nanoscale source of deterministic entangled photon pairs violating Bell's inequality

引用

Scientific reports 2017年第1期7卷 7751页

作者： Klaus D Jöns Lucas Schweickert Marijn A M Versteegh Dan Dalacu Philip J Poole Angelo Gulinatti Andrea Giudice Val Zwiller Michael E Reimer Applied Physics Department Royal Institute of Technology Albanova University Centre Roslagstullsbacken 21 106 91 Stockholm Sweden. klausj@kth.se. Kavli Institute of Nanoscience Delft University of Technology Lorentzweg 1 2628CJ Delft The Netherlands. klausj@kth.se. Applied Physics Department Royal Institute of Technology Albanova University Centre Roslagstullsbacken 21 106 91 Stockholm Sweden. Kavli Institute of Nanoscience Delft University of Technology Lorentzweg 1 2628CJ Delft The Netherlands. Quantum optics Quantum Nanophysics and Quantum Information Faculty of Physics University of Vienna Boltzmanngasse 5 1090 Vienna Austria. Institute for Quantum Optics and Quantum Information Austrian Academy of Science Boltzmanngasse 3 1090 Vienna Austria. National Research Council of Canada Ottawa K1A 0R6 Canada. Politecnico di Milano Dipartimento di Elettronica Informazione e Bioingegneria piazza Leonardo da Vinci 32 20133 Milano Italy. Micro Photon Devices via Stradivari 4 39100 Bolzano Italy. Institute for Quantum Computing and Department of Electrical & Computer Engineering University of Waterloo Waterloo N2L 3G1 Canada.

A correction to this article has been published and is linked from the HTML version of this paper. The error has been fixed in the paper.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Creation of backdoors in quantum communications via laser damage

引用

Physical Review A 2016年第3期94卷 030302(R)-030302(R)页

作者： Vadim Makarov Jean-Philippe Bourgoin Poompong Chaiwongkhot Mathieu Gagné Thomas Jennewein Sarah Kaiser Raman Kashyap Matthieu Legré Carter Minshull Shihan Sajeed Institute for Quantum Computing University of Waterloo Waterloo ON Canada N2L 3G1 Department of Physics and Astronomy University of Waterloo Waterloo ON Canada N2L 3G1 Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada N2L 3G1 Department of Engineering Physics and Department of Electrical Engineering École Polytechnique de Montréal Montréal QC Canada H3C 3A7 Quantum Information Science Program Canadian Institute for Advanced Research Toronto ON Canada M5G 1Z8 ID Quantique SA Chemin de la Marbrerie 3 1227 Carouge Geneva Switzerland

Practical quantum communication (QC) protocols are assumed to be secure provided implemented devices are properly characterized and all known side channels are closed. We show that this is not always true. We demonstrate a laser-damage attack capable of modifying device behavior on demand. We test it on two practical QC systems for key distribution and coin tossing, and show that newly created deviations lead to side channels. This reveals that laser damage is a potential security risk to existing QC systems, and necessitates their testing to guarantee security.

关键词： Lasers quantum cryptography quantum optics

来源：评论

学校读者我要写书评

暂无评论

Chiral quantum walks

引用

Physical Review A 2016年第4期93卷 042302-042302页

作者： Dawei Lu Jacob D. Biamonte Jun Li Hang Li Tomi H. Johnson Ville Bergholm Mauro Faccin Zoltán Zimborás Raymond Laflamme Jonathan Baugh Seth Lloyd Institute for Quantum Computing and Department of Physics and Astronomy University of Waterloo Waterloo N2L 3G1 Ontario Canada ISI Foundation Via Alassio 11/c 10126 Torino Italy Centre for Quantum Technologies National University of Singapore 3 Science Drive 2 117543 Singapore Keble College University of Oxford Parks Road Oxford OX1 3PG United Kingdom Clarendon Laboratory University of Oxford Parks Road Oxford OX1 3PU United Kingdom Dahlem Center for Complex Quantum Systems Freie Universität Berlin 14195 Berlin Germany Department of Computer Science University College London Gower Street London WC1E 6BT United Kingdom Department of Theoretical Physics University of the Basque Country UPV/EHU 48080 Bilbao Spain Perimeter Institute for Theoretical Physics Waterloo Ontario Canada Department of Chemistry University of Waterloo Waterloo N2L 3G1 Ontario Canada Massachusetts Institute of Technology Department of Mechanical Engineering Cambridge Massachusetts 02139 USA

Given its importance to many other areas of physics, from condensed-matter physics to thermodynamics, time-reversal symmetry has had relatively little influence on quantum information science. Here we develop a network-based picture of time-reversal theory, classifying Hamiltonians and quantum circuits as time symmetric or not in terms of the elements and geometries of their underlying networks. Many of the typical circuits of quantum information science are found to exhibit time asymmetry. Moreover, we show that time asymmetry in circuits can be controlled using local gates only and can simulate time asymmetry in Hamiltonian evolution. We experimentally implement a fundamental example in which controlled time-reversal asymmetry in a palindromic quantum circuit leads to near-perfect transport. Our results pave the way for using time-symmetry breaking to control coherent transport and imply that time asymmetry represents an omnipresent yet poorly understood effect in quantum information science.

关键词： quantum walks Symmetries

来源：评论

学校读者我要写书评

暂无评论

Separating decision tree complexity from subcube partition complexity

Separating decision tree complexity from subcube partition c...

引用

18th International Workshop on ApproximationAlgorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015

作者： Kothari, Robin Racicot-Desloges, David Santha, Miklos Center for Theoretical Physics Massachusetts Institute of Technology CambridgeMA United States David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo WaterlooON Canada Département de Mathématiques Faculté des Sciences Université de Sherbrooke SherbrookeQC Canada Centre for Quantum Technologies National University of Singapore Singapore Singapore LIAFA CNRS Université Paris Diderot Paris France

ISBN: (纸本)9783939897897

The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose deterministic subcube partition complexity is asymptotically smaller than its randomized decision tree complexity, resolving an open problem of Friedgut, Kahn, and Wigderson ([7]). Our lower bound is based on the information-theoretic techniques first introduced to lower bound the randomized decision tree complexity of the recursive majority function. We also show that the public-coin partition bound, the best known lower bound method for randomized decision tree complexity subsuming other general techniques such as block sensitivity, approximate degree, randomized certificate complexity, and the classical adversary bound, also lower bounds randomized subcube partition complexity. This shows that all these lower bound techniques cannot prove optimal lower bounds for randomized decision tree complexity, which answers an open question of Jain and Klauck ([9]) and Jain, Lee, and Vishnoi ([10]). © Robin Kothari, David Racicot-Desloges, and Miklos Santha.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Operational meaning of quantum measures of recovery

引用

Physical Review A 2016年第2期94卷 022310-022310页

作者： Tom Cooney Christoph Hirche Ciara Morgan Jonathan P. Olson Kaushik P. Seshadreesan John Watrous Mark M. Wilde Department of Mathematics State University of New York at Geneseo Geneseo New York 14454 USA Física Teòrica: Informació i Fenòmens Quàntics Departament de Física Universitat Autònoma de Barcelona 08193 Bellaterra Spain School of Mathematics and Statistics University College Dublin Belfield Dublin 4 Ireland Department of Physics and Astronomy Hearne Institute for Theoretical Physics Louisiana State University Baton Rouge Louisiana 70803 USA Max Planck Institute for the Science of Light Guenther-Scharowsky-Straße 91058 Erlangen Germany Institute for Quantum Computing and School of Computer Science University of Waterloo West Waterloo Ontario Canada N2L 3G1 Canadian Institute for Advanced Research Toronto Ontario Canada M5G 1Z8 Center for Computation and Technology Louisiana State University Baton Rouge Louisiana 70803 USA

Several information measures have recently been defined that capture the notion of recoverability. In particular, the fidelity of recovery quantifies how well one can recover a system A of a tripartite quantum state, defined on systems ABC, by acting on system C alone. The relative entropy of recovery is an associated measure in which the fidelity is replaced by relative entropy. In this paper we provide concrete operational interpretations of the aforementioned recovery measures in terms of a computational decision problem and a hypothesis testing scenario. Specifically, we show that the fidelity of recovery is equal to the maximum probability with which a computationally unbounded quantum prover can convince a computationally bounded quantum verifier that a given quantum state is recoverable. The quantum interactive proof system giving this operational meaning requires four messages exchanged between the prover and verifier, but by forcing the prover to perform actions in superposition, we construct a different proof system that requires only two messages. The result is that the associated decision problem is in QIP(2) and another argument establishes it as hard for QSZK (both classes contain problems believed to be difficult to solve for a quantum computer). We finally prove that the regularized relative entropy of recovery is equal to the optimal type II error exponent when trying to distinguish many copies of a tripartite state from a recovered version of this state, such that the type I error is constrained to be no larger than a constant.

关键词： quantum computation quantum entanglement quantum information processing

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for heavy resonances decaying into a W or Z boson and a Higgs boson in final states with leptons and b-jets in 36 fb−1 of TeV pp collisions with the ATLAS detector

引用

Journal of High Energy Physics 2018年第11期2018卷 1-18页

作者： Aaboud, M. Aad, G. Abbott, B. Abdinov, O. Abeloos, B. Abidi, S. H. AbouZeid, O. S. Abraham, N. L. Abramowicz, H. Abreu, H. Abreu, R. Abulaiti, Y. Acharya, B. S. Adachi, S. Adamczyk, L. Adelman, J. Adersberger, M. Adye, T. Affolder, A. A. Afik, Y. Agatonovic-Jovin, T. Agheorghiesei, C. Aguilar-Saavedra, J. A. Ahlen, S. P. Ahmadov, F. Aielli, G. Akatsuka, S. Akerstedt, H. Åkesson, T. P. A. Akilli, E. Akimov, A. V. Alberghi, G. L. Albert, J. Albicocco, P. Alconada Verzini, M. J. Alderweireldt, S. C. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexander, G. Alexopoulos, T. Alhroob, M. Ali, B. Aliev, M. Alimonti, G. Alison, J. Alkire, S. P. Allbrooke, B. M. M. Allen, B. W. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A. A. Alstaty, M. I. Alvarez Gonzalez, B. Álvarez Piqueras, D. Alviggi, M. G. Amadio, B. T. Amaral Coutinho, Y. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amoroso, S. Amundsen, G. Anastopoulos, C. Ancu, L. S. Andari, N. Andeen, T. Anders, C. F. Anders, J. K. Anderson, K. J. Andreazza, A. Andrei, V. Angelidakis, S. Angelozzi, I. Angerami, A. Anisenkov, A. V. Anjos, N. Annovi, A. Antel, C. Antonelli, M. Antonov, A. Antrim, D. J. Anulli, F. Aoki, M. Aperio Bella, L. Arabidze, G. Arai, Y. Araque, J. P. Araujo Ferraz, V. Arce, A. T. H. Ardell, R. E. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arik, M. Armbruster, A. J. Armitage, L. J. Arnaez, O. Arnold, H. Arratia, M. Arslan, O. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Ashkenazi, A. Asquith, L. Assamagan, K. Astalos, R. Atkinson, M. Atlay, N. B. Augsten, K. Avolio, G. Axen, B. Ayoub, M. K. Azuelos, G. Baas, A. E. Baca, M. J. Bachacou, H. Bachas, K. Backes, M. Bagnaia, P. Bahmani, M. Bahrasemani, H. Baines, J. T. Bajic, M. Baker, O. K. Bakker, P. J. Baldin, E. M. Balek, P. Balli, F. Balunas, W. K. Banas, E. Bandyopadhyay, A. Banerjee, Sw. Bannoura, A. A. E. Barak, L. Barberio, E. L. Barberis, D. Barbero, M. Barillari, T. Barisits, M-S Barkeloo, J. T. Barklow, T. Barlow, N. Barnes, S. L. Barnett, B. M. Barnett, R. M. Barnovs Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States of America Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz United States of America Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene United States of America Department of Physics Stockholm University Stockholm Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas – LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston United States of America Joi

One correction is noted for the paper. The exclusion limits for the gluon-gluon fusion production of an A boson reported in the conclusions did not correspond to the exclusion plots shown in figure 6a.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：