咨询与建议

限定检索结果

文献类型

  • 178 篇 期刊文献
  • 35 篇 会议
  • 1 册 图书

馆藏范围

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

日期分布

学科分类号

  • 178 篇 理学
    • 155 篇 物理学
    • 70 篇 数学
    • 20 篇 统计学(可授理学、...
    • 12 篇 化学
    • 8 篇 天文学
    • 6 篇 系统科学
    • 1 篇 生物学
  • 136 篇 工学
    • 75 篇 计算机科学与技术...
    • 52 篇 光学工程
    • 36 篇 软件工程
    • 34 篇 信息与通信工程
    • 29 篇 电子科学与技术(可...
    • 17 篇 电气工程
    • 12 篇 材料科学与工程(可...
    • 9 篇 动力工程及工程热...
    • 7 篇 化学工程与技术
    • 3 篇 力学(可授工学、理...
    • 2 篇 建筑学
    • 2 篇 土木工程
    • 1 篇 机械工程
    • 1 篇 仪器科学与技术
    • 1 篇 控制科学与工程
  • 11 篇 管理学
    • 6 篇 管理科学与工程(可...
    • 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 篇 quantum computat...
  • 6 篇 quantum informat...
  • 6 篇 computational co...
  • 6 篇 timing circuits
  • 6 篇 quantum mechanic...
  • 6 篇 quantum optics
  • 5 篇 quantum error co...
  • 5 篇 hamiltonians
  • 5 篇 information theo...
  • 4 篇 computer science
  • 4 篇 quantum channels
  • 4 篇 algorithms

机构

  • 30 篇 institute for qu...
  • 28 篇 department of co...
  • 17 篇 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 篇 institute for qu...
  • 8 篇 softwareq inc. k...
  • 7 篇 perimeter instit...
  • 7 篇 perimeter instit...
  • 7 篇 department of co...
  • 7 篇 department of co...
  • 7 篇 institute for qu...
  • 6 篇 institute for qu...
  • 6 篇 ibm quantum ibm ...

作者

  • 23 篇 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 篇 simone severini
  • 7 篇 touchette dave
  • 6 篇 bei zeng
  • 6 篇 david gosset
  • 6 篇 childs andrew m.
  • 5 篇 michele mosca
  • 5 篇 leditzky felix
  • 5 篇 dellantonio luca
  • 5 篇 pashayan hakop

语言

  • 209 篇 英文
  • 5 篇 其他
检索条件"机构=Institute for Quantum Computing and Combinatorics & Optimization"
214 条 记 录,以下是1-10 订阅
排序:
Classical and quantum algorithms for characters of the symmetric group
arXiv
收藏 引用
arXiv 2025年
作者: Bravyi, Sergey Gosset, David Havlicek, Vojtech Schatzki, Louis IBM Quantum IBM T.J. Watson Research Center Yorktown HeightsNY10598 United States Department of Combinatorics and Optimization Institute for Quantum Computing University of Waterloo Canada Perimeter Institute for Theoretical Physics Canada University of Illinois Urbana Champaign UrbanaIL61801 United States
Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group Sn is a challenging problem known to be #P-hard in the worst case. Her... 详细信息
来源: 评论
Generating graph states with a single quantum emitter and the minimum number of fusions
收藏 引用
Physical Review A 2025年 第5期111卷 052604-052604页
作者: Matthias C. Löbl Love A. Pettersson Andrew Jena Luca Dellantonio Stefano Paesani Anders S. Sørensen Department of Combinatorics and Optimization University of Waterloo and Institute for Quantum Computing University of Waterloo Ontario Canada Department of Physics and Astronomy University of Exeter Stocker Road Exeter EX4 4QL United Kingdom NNF Quantum Computing Programme Niels Bohr Institute University of Copenhagen Blegdamsvej 17 DK-2100 Copenhagen Ø Denmark
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using a single ... 详细信息
来源: 评论
Fault-tolerant Preparation of Distant Logical Bell Pair - with application in the magic square game
arXiv
收藏 引用
arXiv 2025年
作者: Liu, Andy Zeyi Leung, Debbie Institute for Quantum Computing University of Waterloo ONN2L 3G1 Canada Department of Combinatorics and Optimization University of Waterloo Canada Perimeter Institute of Theoretical Physics ONN2L 2Y5 Canada Yale Quantum Institute Yale University New HavenCT06511 United States Department of Applied Physics Yale University New HavenCT06511 United States
Measures of quantum nonlocal properties are traditionally defined assuming perfect and unlimited local computational ability of each remote party. In real experiments, each computational primitive will be imperfect. F... 详细信息
来源: 评论
quantum Advantage from Measurement-Induced Entanglement in Random Shallow Circuits
收藏 引用
PRX quantum 2025年 第1期6卷 010356-010356页
作者: Adam Bene Watts David Gosset Yinchen Liu Mehdi Soleimanifar Department of Pure Mathematics University of Waterloo Waterloo Ontario Canada N2L 3G1 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 Perimeter Institute for Theoretical Physics Waterloo Ontario Canada N2L 2Y5 California Institute of Technology Pasadena California 91125 USA
We study random constant-depth quantum circuits in a two-dimensional (2D) architecture. While these circuits only produce entanglement between nearby qubits on the lattice, long-range entanglement can be generated by ... 详细信息
来源: 评论
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
A new quantum lower bound method, with applications to direc...
收藏 引用
38th Annual ACM Symposium on Theory of computing, STOC'06
作者: Ambainis, Andris Špalek, Robert De Wolf, Ronald University of Waterloo CWI Amsterdam Institute for Quantum Computing Department of Combinatorics and Optimization University of Waterloo
We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and op... 详细信息
来源: 评论
Theory of quantum Computation, Communication, and Cryptography  1
收藏 引用
丛书名: Lecture Notes in Computer Science
1000年
作者: Andrew Childs Michele Mosca
This book constitutes the thoroughly refereed post-workshop proceedings of the 4th Workshop on Theory of quantum Computation, Communication, and Cryptography, TQC 2009, held in Waterloo, Canada, in May 2009. The 10 re... 详细信息
来源: 评论
Making existential-unforgeable signatures strongly unforgeable in the quantum random-oracle model  10
Making existential-unforgeable signatures strongly unforgeab...
收藏 引用
10th Conference on the Theory of quantum Computation, Communication and Cryptography, TQC 2015
作者: Eaton, Edward Song, Fang Department of Combinatorics and Optimization University of Waterloo Waterloo Canada Institute for Quantum Computing University of Waterloo Waterloo Canada
Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible... 详细信息
来源: 评论
On the Limitations of Graph Invariants Inspired by quantum Walks
收藏 引用
Electronic Notes in Discrete Mathematics 2011年 38卷 795-801页
作者: Smith, Jamie Institute for Quantum Computing Department of Combinatorics and Optimization University of Waterloo Waterloo N2L 3G1 Canada
We consider two graph invariants inspired by quantum walks-one in continuous time [John King Gamble, Mark Friesen, Dong Zhou, Robert Joynt, and S. N. Coppersmith. Two-particle quantum walks applied to the graph isomor... 详细信息
来源: 评论
An efficient post-quantum one-time signature scheme  22nd
收藏 引用
22nd International Conference on Selected Areas in Cryptography, SAC 2015
作者: Kalach, Kassem Safavi-Naini, Reihaneh Department of Combinatorics and Optimization and Institute for Quantum Computing University of Waterloo WaterlooON Canada Department of Computer Science University of Calgary Calgary Canada
One-time signature (OTS) schemes are important cryptographic primitives that can be constructed using one-way functions, and provide post-quantum security. They have found diverse applications including forward securi... 详细信息
来源: 评论
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields  27
Efficient quantum algorithms for computing class groups and ...
收藏 引用
27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016
作者: Biasse, Jean-François Song, Fang Department of Mathematics and Statistics University of South Florida United States Department of Combinatorics Optimization and Institute for Quantum Computing University of Waterloo Canada
This paper gives polynomial time quantum algorithms for computing the ideal class group (CGP) under the Generalized Riemann Hypothesis and solving the principal ideal problem (PIP) in number fields of arbitrary degree... 详细信息
来源: 评论