咨询与建议

限定检索结果

文献类型

  • 194 篇 期刊文献
  • 39 篇 会议
  • 1 册 图书

馆藏范围

  • 234 篇 电子文献
  • 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 篇 michele mosca
  • 5 篇 leditzky felix
  • 5 篇 dellantonio luca
  • 5 篇 pashayan hakop

语言

  • 224 篇 英文
  • 10 篇 其他
检索条件"机构=Institute for Quantum Computing and Department of Combinatorics and Optimization"
234 条 记 录,以下是221-230 订阅
排序:
Extrema of discrete Wigner functions and applications
收藏 引用
Physical Review A 2008年 第2期78卷 022310-022310页
作者: Andrea Casaccino Ernesto F. Galvão Simone Severini Information Engineering Department University of Siena Via Roma 56 53100 Siena Italy Instituto de Física Universidade Federal Fluminense Av. Gal. Milton Tavares de Souza s/n Gragoatá Niterói RJ 24210-340 Brazil Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo 200 University Avenue West Waterloo Canada N2L 3G1
We study the class of discrete Wigner functions proposed by Gibbons et al. [Phys. Rev. A 70, 062101 (2004)] to describe quantum states using a discrete phase space based on finite fields. We find the extrema of such ... 详细信息
来源: 评论
Grid polygons from permutations and their enumeration by the kernel method
Grid polygons from permutations and their enumeration by the...
收藏 引用
19th International Conference on Formal Power Series and Algebraic combinatorics, FPSAC'07
作者: Mansour, Toufik Severini, Simone Department of Mathematics University of Haifa Haifa 31905 Israel Institute for Quantum Computing Department of Combinatorics and Optimization University of Waterloo Waterloo N2L 3G1 Canada
A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By t... 详细信息
来源: 评论
quantum t-designs: t-wise Independence in the quantum World
Quantum t-designs: t-wise Independence in the Quantum World
收藏 引用
Annual IEEE Conference on Computational Complexity
作者: Andris Ambainis Joseph Emerson Department of Combinatorics and Optimization and the Institute for Quantum Computing University of Waterloo Canada Department of Applied Mathematics and the Institute for Quantum Computing University of Waterloo Canada
A t-design for quantum states is a finite set of quantum states with the property of simulating the Haar-measure on quantum states w.r.t. any test that uses at most t copies of a state. We give efficient constructions... 详细信息
来源: 评论
Any AND-OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computer
Any AND-OR formula of size N can be evaluated in time N1/2+o...
收藏 引用
48th Annual Symposium on Foundations of Computer Science, FOCS 2007
作者: Ambainis, Andris Childs, Andrew M. Reichardt, Ben W. Špalek, Robert Zhang, Shengyu Department of Computer Science University of Latvia Department of Combinatorics and Optimization Institute for Quantum Computing University of Waterloo Institute for Quantum Information California Institute of Technology NSF Grant PHY-0456720 and ARO Grant W911NF-05-1-0294 United States University of California Berkeley United States
For any AND-OR formula of size N, there exists a bounded-error N 1/2+o(1)-time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximate... 详细信息
来源: 评论
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a quantum Computer
Any AND-OR Formula of Size N can be Evaluated in time N^{1/2...
收藏 引用
Annual IEEE Symposium on Foundations of Computer Science
作者: Andris Ambainis Andrew M. Childs Ben W. Reichardt Robert Spalek Shengyu Zhang Department of Computer Science University of Latvia Department of Combinatorics & Optimization Institute for Quantum Computing University of Waterloo Institute for Quantum Information California Institute of Technology University of California Berkeley
For any AND-OR formula of size N, there exists a bounded-error N 1/2+o(1) -time quantum algorithm, based on a discrete-time quantum walk, that evaluates this formula on a black-box input. Balanced, or "approximat... 详细信息
来源: 评论
quantum Algorithms for Hidden Nonlinear Structures
Quantum Algorithms for Hidden Nonlinear Structures
收藏 引用
Annual IEEE Symposium on Foundations of Computer Science
作者: Andrew M. Childs Leonard J. Schulman Umesh V. Vazirani Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo Waterloo ONT Canada Department of Computer Science California Institute of Technology Pasadena CA USA Computer Science Division University of California Berkeley CA USA
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonAbelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algo... 详细信息
来源: 评论
Self-assembly of viral capsids via a Hamiltonian paths approach: The case of bacteriophage MS2
Self-assembly of viral capsids via a Hamiltonian paths appro...
收藏 引用
4th Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO 2007
作者: Keef, T. Grayson, N. Severini, S. Twarock, R. Department of Mathematics University of York York YO10 5DD United Kingdom Department of Biology University of York York YO10 5DD United Kingdom Institute for Quantum Computing Department of Combinatorics and Optimisation University of Waterloo Waterloo ON Canada
来源: 评论
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... 详细信息
来源: 评论
Unified point addition formulæ and side-channel attacks
收藏 引用
8th International Workshop on Cryptographic Hardware and Embedded Systems, CHES 2006
作者: Stebila, Douglas Theriault, Nicolas Institute for Quantum Computing University of Waterloo Waterloo Ont. Canada Department of Combinatorics and Optimization University of Waterloo Waterloo Ont. Canada
The successful application to elliptic curve cryptography of side-channel attacks, in which information about the secret key can be recovered from the observation of side channels like power consumption, timing, or el... 详细信息
来源: 评论
Approximate Randomization of quantum States With Fewer Bits of Key
收藏 引用
AIP Conference Proceedings 2006年 第1期864卷 18-36页
作者: Paul A. Dickinson Ashwin Nayak *Department of Combinatorics and Optimization University of Waterloo 200 University Ave. W. Waterloo Ontario N2L 3G1 Canada **Institute for Quantum Computing University of Waterloo 200 University Ave. W. Waterloo Ontario N2L 3G1 Canada †Perimeter Institute for Theoretical Physics Waterloo Ontario Canada
Randomization of quantum states is the quantum analogue of the classical one‐time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/ε2) Pauli operators to map any ...
来源: 评论