咨询与建议

限定检索结果

文献类型

  • 194 篇 期刊文献
  • 39 篇 会议

馆藏范围

  • 233 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 192 篇 理学
    • 160 篇 物理学
    • 81 篇 数学
    • 20 篇 统计学(可授理学、...
    • 13 篇 化学
    • 9 篇 天文学
    • 6 篇 系统科学
    • 4 篇 地球物理学
    • 1 篇 生物学
  • 146 篇 工学
    • 81 篇 计算机科学与技术...
    • 53 篇 光学工程
    • 41 篇 软件工程
    • 36 篇 信息与通信工程
    • 32 篇 电子科学与技术(可...
    • 20 篇 电气工程
    • 14 篇 材料科学与工程(可...
    • 9 篇 动力工程及工程热...
    • 8 篇 化学工程与技术
    • 4 篇 力学(可授工学、理...
    • 3 篇 建筑学
    • 3 篇 土木工程
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 控制科学与工程
  • 12 篇 管理学
    • 7 篇 管理科学与工程(可...
    • 5 篇 图书情报与档案管...
    • 4 篇 工商管理
  • 6 篇 法学
    • 6 篇 社会学
  • 3 篇 经济学
    • 3 篇 应用经济学
  • 1 篇 文学
    • 1 篇 新闻传播学

主题

  • 14 篇 qubits
  • 13 篇 quantum theory
  • 12 篇 quantum computer...
  • 8 篇 quantum communic...
  • 7 篇 quantum simulati...
  • 7 篇 quantum computin...
  • 7 篇 quantum algorith...
  • 7 篇 quantum entangle...
  • 7 篇 timing circuits
  • 7 篇 quantum mechanic...
  • 7 篇 quantum computat...
  • 6 篇 quantum informat...
  • 6 篇 computational co...
  • 6 篇 quantum optics
  • 5 篇 approximation al...
  • 5 篇 quantum error co...
  • 5 篇 hamiltonians
  • 5 篇 information theo...
  • 4 篇 computer science
  • 4 篇 quantum channels

机构

  • 33 篇 department of co...
  • 30 篇 institute for qu...
  • 19 篇 perimeter instit...
  • 12 篇 perimeter instit...
  • 12 篇 institute for qu...
  • 11 篇 institute for qu...
  • 11 篇 perimeter instit...
  • 9 篇 department of co...
  • 9 篇 department of co...
  • 8 篇 perimeter instit...
  • 8 篇 centre for quant...
  • 8 篇 department of co...
  • 8 篇 institute for qu...
  • 8 篇 softwareq inc. k...
  • 7 篇 perimeter instit...
  • 7 篇 perimeter instit...
  • 7 篇 department of co...
  • 7 篇 institute for qu...
  • 6 篇 institute for qu...
  • 6 篇 ibm quantum ibm ...

作者

  • 24 篇 gosset david
  • 22 篇 mosca michele
  • 14 篇 leung debbie
  • 13 篇 gheorghiu vlad
  • 13 篇 nayak ashwin
  • 12 篇 anshu anurag
  • 11 篇 bravyi sergey
  • 11 篇 mukhopadhyay pri...
  • 9 篇 debbie leung
  • 8 篇 kuroiwa kohdai
  • 7 篇 andrew m. childs
  • 7 篇 david gosset
  • 7 篇 simone severini
  • 7 篇 touchette dave
  • 6 篇 bei zeng
  • 6 篇 childs andrew m.
  • 5 篇 leditzky felix
  • 5 篇 dellantonio luca
  • 5 篇 pashayan hakop
  • 5 篇 niu jia-shu

语言

  • 223 篇 英文
  • 10 篇 其他
检索条件"机构=Department of Combinatorics and Optimization and Institute for Quantum Computing"
233 条 记 录,以下是131-140 订阅
排序:
quantum Log-Approximate-Rank Conjecture is also False
arXiv
收藏 引用
arXiv 2018年
作者: Anshu, Anurag Boddu, Naresh Goud Touchette, Dave Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Perimeter Institute for Theoretical Physics Center for Quantum Technologies National University of Singapore Institute for Quantum Computing Department of Combinatorics and Optimization University of Waterloo Perimeter Institute for Theoretical Physics
In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication complexity of a total function f, hence re... 详细信息
来源: 评论
Towards simulating 2D effects in lattice gauge theories on a quantum computer
arXiv
收藏 引用
arXiv 2020年
作者: Paulson, Danny Dellantonio, Luca Haase, Jan F. Celi, Alessio Kan, Angus Jena, Andrew Kokail, Christian van Bijnen, Rick Jansen, Karl Zoller, Peter Muschik, Christine A. Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Physics & Astronomy University of Waterloo WaterlooONN2L 3G1 Canada Departament de Física Universitat Autònoma de Barcelona BellaterraE-08193 Spain Center of Quantum Physics University of Innsbruck InnsbruckA-6020 Austria Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences InnsbruckA-6020 Austria Department of Combinatorics & Optimization University of Waterloo WaterlooONN2L 3G1 Canada NIC DESY Zeuthen Platanenallee 6 Zeuthen15738 Germany Perimeter Institute for Theoretical Physics WaterlooONN2L 2Y5 Canada
quantum computing is in its greatest upswing, with so-called Noisy-Intermediate-Scale-quantum devices heralding the computational power to be expected in the near future. While the field is progressing towards quantum... 详细信息
来源: 评论
Practical quantum appointment scheduling
arXiv
收藏 引用
arXiv 2018年
作者: Touchette, Dave Lovitz, Benjamin Lütkenhaus, Norbert Institute for Quantum Computing Department of Combinatorics and Optimization University of Waterloo Perimeter Institute for Theoretical Physics Institute for Quantum Computing Department of Physics and Astronomy University of Waterloo
We propose a protocol based on coherent states and linear optics operations for solving the appointmentscheduling problem. Our main protocol leaks strictly less information about each party's input than the optima... 详细信息
来源: 评论
quantum advantage with noisy shallow circuits in 3D
arXiv
收藏 引用
arXiv 2019年
作者: Bravyi, Sergey Gosset, David Konig, Robert Tomamichel, Marco IBM T. J. Watson Research Center Yorktown Heights United States Department of Combinatorics and Optimization Institute for Quantum Computing University of Waterloo Waterloo Canada Institute for Advanced Study and Zentrum Mathematik Technical University of Munich Munich Germany Centre for Quantum Software and Information and School of Software University of Technology Sydney Sydney Australia
Prior work has shown that there exists a relation problem which can be solved with certainty by a constant-depth quantum circuit composed of geometrically local gates in two dimensions, but cannot be solved with high ... 详细信息
来源: 评论
Eventually entanglement breaking maps
arXiv
收藏 引用
arXiv 2018年
作者: Rahaman, Mizanur Jaques, Sam Paulsen, Vern I. Department of Pure Mathematics University of Waterloo Institute for Quantum Computing University of Waterloo Department of Combinatorics and Optimization University of Waterloo
We analyze linear maps on matrix algebras that become entanglement breaking after composing a finite or infinite number of times with themselves. This means that the Choi matrix of the iterated linear map becomes sepa... 详细信息
来源: 评论
Factoring semi-primes with (quantum) SAT-solvers
arXiv
收藏 引用
arXiv 2019年
作者: Mosca, Michele Verschoor, Sebastian R. Institute for Quantum Computing University of Waterloo Canada Department of Combinatorics & Optimization University of Waterloo Canada David R. Cheriton School of Computer Science University of Waterloo Canada Perimeter Institute for Theoretical Physics Waterloo Canada Canadian Institute for Advanced Research Toronto Canada evolutionQ Inc. Waterloo Canada
The assumed computationally difficulty of factoring large integers forms the basis of security for RSA public-key cryptography, which specifically relies on products of two large primes or semi-primes. The best-known ... 详细信息
来源: 评论
Neural ensemble decoding for topological quantum error-correcting codes
收藏 引用
Physical Review A 2020年 第3期101卷 032338-032338页
作者: Milap Sheth Sara Zafar Jafarzadeh Vlad Gheorghiu Institute for Quantum Computing University of Waterloo Waterloo Ontario Canada N2L 3G1 Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada N2L 3G1 David R. Cheriton School of Computer Science University of Waterloo Waterloo Ontario Canada N2L 3G1 Department of Computer Science and Operations Research Université de Montreal Montreal Quebec Canada H3T 1J4 softwareQ Inc. Kitchener Ontario Canada N2M 0A9
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various... 详细信息
来源: 评论
On speeding up factoring with quantum SAT solvers
arXiv
收藏 引用
arXiv 2019年
作者: Mosca, Michele Basso, João Marcos Vensi Verschoor, Sebastian R. Institute for Quantum Computing University of Waterloo Canada Department of Physics and Astronomy Tufts University United States Department of Combinatorics & Optimization University of Waterloo Canada Perimeter Institute for Theoretical Physics Waterloo Canada evolutionQ Inc. Waterloo Canada David R. Cheriton School of Computer Science University of Waterloo Canada
There have been several efforts to apply quantum SAT solving methods to factor large integers. While these methods may provide insight into quantum SAT solving, to date they have not led to a convincing path to intege... 详细信息
来源: 评论
Neural ensemble decoding for topological quantum error-correcting codes
arXiv
收藏 引用
arXiv 2019年
作者: Sheth, Milap Jafarzadeh, Sara Zafar Gheorghiu, Vlad Institute for Quantum Computing University of Waterloo WaterlooON Canada Department of Combinatorics and Optimization University of Waterloo WaterlooON Canada David R. Cheriton School of Computer Science University of Waterloo WaterlooON Canada Department of Computer Science and Operations Research Université de Montreal MontrealQC Canada softwareQ Inc. KitchenerON Canada
Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various... 详细信息
来源: 评论
A compressed classical description of quantum states
arXiv
收藏 引用
arXiv 2018年
作者: Gosset, David Smolin, John Ibm T.J. Watson Research Center United States Department of Combinatorics and Optimization Institute for Quantum Computing University of Waterloo Canada
We show how to approximately represent a quantum state using the square root of the usual amount of classical memory. The classical representation of an n-qubit state ψ consists of its inner products with O(√2n) sta... 详细信息
来源: 评论