咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是51-60 订阅
排序:
Sample-optimal classical shadows for pure states
arXiv
收藏 引用
arXiv 2022年
作者: Grier, Daniel Pashayan, Hakop Schaeffer, Luke Department of Mathematics Department of Computer Science and Engineering UC San Diego United States Institute for Quantum Computing University of Waterloo Canada Department of Combinatorics and Optimization University of Waterloo Canada Perimeter Institute for Theoretical Physics Waterloo Canada Dahlem Center for Complex Quantum Systems Freie Universität Berlin Germany Joint Center for Quantum Information and Computer Science University of Maryland College Park United States
We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state ρ in order to learn a classical description...
来源: 评论
How to Simulate quantum Measurement without computing Marginals
收藏 引用
Physical Review Letters 2022年 第22期128卷 220503-220503页
作者: Sergey Bravyi David Gosset Yinchen Liu IBM Quantum IBM T.J. Watson Research Center Yorktown Heights New York 10598 USA Department of Combinatorics and Optimization University of Waterloo Waterloo ON N2L 3G1 Canada Institute for Quantum Computing University of Waterloo Waterloo ON N2L 3G1 Canada Perimeter Institute for Theoretical Physics Waterloo ON N2L 2Y5 Canada
We describe and analyze algorithms for classically simulating measurement of an n-qubit quantum state in the standard basis, that is, sampling a bit string from the probability distribution determined by the Born rule... 详细信息
来源: 评论
Rate Reduction of Blind quantum Data Compression with Local Approximations Based on Unstable Structure of quantum States
arXiv
收藏 引用
arXiv 2022年
作者: Kuroiwa, Kohdai Leung, Debbie Institute for Quantum Computing University of Waterloo ONN2L 3G1 Canada Department of Physics and Astronomy University of Waterloo Canada Department of Combinatorics and Optimization University of Waterloo Canada Perimeter Institute for Theoretical Physics ONN2L 2Y5 Canada
In this paper, we propose a new protocol for a data compression task, blind quantum data compression, with finite local approximations. The rate of blind data compression is susceptible to approximations even when the... 详细信息
来源: 评论
Deterministic Algorithms for the Hidden Subgroup Problem
arXiv
收藏 引用
arXiv 2021年
作者: Nayak, Ashwin Department of Combinatorics and Optimization Institute for Quantum Computing University of Waterloo 200 University Ave.W. WaterlooONN2L 3G1 Canada
We present deterministic algorithms for theHidden Subgroup Problem. The first algorithm, for abelian groups, achieves the same asymptotic worst-case query complexity as the optimal randomized algorithm, namely O(√n )... 详细信息
来源: 评论
Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
arXiv
收藏 引用
arXiv 2023年
作者: Kuroiwa, Kohdai Nakagawa, Yuya O. Institute for Quantum Computing University of Waterloo ONN2L 3G1 Canada Department of Combinatorics and Optimization University of Waterloo Canada Perimeter Institute for Theoretical Physics ONN2L 2Y5 Canada QunaSys Inc. Aqua Hakusan Building 9F 1-13-7 Hakusan Bunkyo Tokyo113-0001 Japan
Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way, and thus to enjoy advantages of quantum computers even with presence of noise. In FTQC, a quantum circui... 详细信息
来源: 评论
How to simulate quantum measurement without computing marginals
arXiv
收藏 引用
arXiv 2021年
作者: Bravyi, Sergey Gosset, David Liu, Yinchen IBM Quantum IBM T.J. Watson Research Center United States Department of Combinatorics and Optimization University of Waterloo Canada Institute for Quantum Computing University of Waterloo Canada Perimeter Institute for Theoretical Physics Waterloo Canada
We describe and analyze algorithms for classically simulating measurement of an n-qubit quantum state ψ in the standard basis, that is, sampling a bit string x from the probability distribution |〈x|ψ〉|2. Our algorit... 详细信息
来源: 评论
An area law for 2D frustration-free spin systems
arXiv
收藏 引用
arXiv 2021年
作者: Anshu, Anurag Arad, Itai Gosset, David School of Engineering and Applied Sciences Harvard University Cambridge United States Physics Department Technion Israel Institute for Quantum Computing University of Waterloo Canada Department of Combinatorics and Optimization University of Waterloo Canada
We prove that the entanglement entropy of the ground state of a locally gapped frustration-free 2D lattice spin system satisfies an area law with respect to a vertical bipartition of the lattice into left and right re... 详细信息
来源: 评论
Improved approximation algorithms for bounded-degree local Hamiltonians
arXiv
收藏 引用
arXiv 2021年
作者: Anshu, Anurag Gosset, David Morenz Korol, Karen J. Soleimanifar, Mehdi Department of EECS Challenge Institute for Quantum Computation University of California Berkeley United States Simons Institute for the Theory of Computing BerkeleyCA United States Department of Combinatorics Optimization and Institute for Quantum Computing University of Waterloo Canada Department of Chemistry University of Toronto Canada Center for Theoretical Physics Massachusetts Institute of Technology United States
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a... 详细信息
来源: 评论
Fast Estimation of Outcome Probabilities for quantum Circuits
收藏 引用
PRX quantum 2022年 第2期3卷 020361-020361页
作者: Hakop Pashayan Oliver Reardon-Smith Kamil Korzekwa Stephen D. Bartlett Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Ontario N2L 3G1 Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University Kraków 30-348 Poland Centre for Engineered Quantum Systems School of Physics The University of Sydney Sydney New South Wales 2006 Australia
We present two classical algorithms for the simulation of universal quantum circuits on n qubits constructed from c instances of Clifford gates and t arbitrary-angle Z-rotation gates such as T gates. Our algorithms co... 详细信息
来源: 评论
Fault-tolerant quantum error correction using error weight parities
收藏 引用
Physical Review A 2021年 第4期104卷 042410-042410页
作者: Theerapat Tansuwannont Debbie Leung Institute for Quantum Computing and Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario N2L 3G1 Canada Perimeter Institute for Theoretical Physics Waterloo Ontario N2L 2Y5 Canada
In quantum error correction using imperfect primitives, errors of high weight arising from a few faults are major concerns since they might not be correctable by the quantum error correcting code. Fortunately, some er... 详细信息
来源: 评论