咨询与建议

限定检索结果

文献类型

  • 8 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 5 篇 理学
    • 3 篇 数学
    • 3 篇 物理学
    • 1 篇 系统科学
  • 5 篇 工学
    • 4 篇 计算机科学与技术...
    • 2 篇 电子科学与技术(可...
    • 1 篇 光学工程
    • 1 篇 软件工程

主题

  • 1 篇 qubits
  • 1 篇 dynamical system...
  • 1 篇 digital arithmet...
  • 1 篇 electronic mail
  • 1 篇 number theory
  • 1 篇 ferromagnetic ma...
  • 1 篇 magnetic materia...
  • 1 篇 quantum theory
  • 1 篇 hamiltonian syst...
  • 1 篇 linear systems
  • 1 篇 geometry
  • 1 篇 heuristic algori...

机构

  • 5 篇 institute for qu...
  • 4 篇 perimeter instit...
  • 3 篇 dept. of combina...
  • 2 篇 dept. of combina...
  • 2 篇 softwareq inc. k...
  • 2 篇 david r. cherito...
  • 1 篇 department of co...
  • 1 篇 institute for qu...
  • 1 篇 controlled dynam...
  • 1 篇 jara institute f...
  • 1 篇 center for theor...
  • 1 篇 department of ma...
  • 1 篇 institute of com...
  • 1 篇 dept. of combina...
  • 1 篇 dept. of discret...
  • 1 篇 institute for qu...
  • 1 篇 institute for qu...
  • 1 篇 dept. of compute...
  • 1 篇 institute for qu...
  • 1 篇 centre for engin...

作者

  • 3 篇 mosca michele
  • 3 篇 gheorghiu vlad
  • 3 篇 mukhopadhyay pri...
  • 2 篇 kalra amolak rat...
  • 2 篇 valluri dinesh
  • 2 篇 yard jon
  • 1 篇 mcconnell gary
  • 1 篇 appleby marcus
  • 1 篇 hallgren sean
  • 1 篇 kirkup michael
  • 1 篇 menezes alfred
  • 1 篇 ding jintai
  • 1 篇 david gosset
  • 1 篇 winnick sam
  • 1 篇 brown michael
  • 1 篇 saikia manimugdh...
  • 1 篇 anna vershynina
  • 1 篇 barbara m. terha...
  • 1 篇 gilyén andrás
  • 1 篇 hernandez julio ...

语言

  • 9 篇 英文
检索条件"机构=Institute for Quantum Computing and Dept. of Combinatorics and Optimization"
9 条 记 录,以下是1-10 订阅
排序:
PGP in constrained wireless devices  9
PGP in constrained wireless devices
收藏 引用
9th USENIX Security Symposium
作者: Brown, Michael Cheung, Donny Hankerson, Darrel Hernandez, Julio Lopez Kirkup, Michael Menezes, Alfred Dept. of Combinatorics and Optimization University of Waterloo Canada Dept. of Discrete and Statistical Sciences Auburn University United States Institute of Computing State University of Campinas Brazil Dept. of Computer Science University of Valle Colombia
The market for Personal Digital Assistants (PDAs) is growing at a rapid pace. An increasing number of products, such as the PalmPilot, are adding wireless communications capabilities. PDA users are now able to send an... 详细信息
来源: 评论
Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in p Norm
arXiv
收藏 引用
arXiv 2019年
作者: Mukhopadhyay, Priyanka Institute for Quantum Computing University of Waterloo WaterlooON Canada Dept. of Combinatorics and Optimization University of Waterloo WaterlooON Canada
In this work, we give provable sieving algorithms for the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP) on lattices in lp norm (1 ≤ p ≤ ∞). The running time we obtain is better than existing pr... 详细信息
来源: 评论
Universal Adiabatic quantum Computation via the Space-Time Circuit-to-Hamiltonian Construction
收藏 引用
Physical Review Letters 2015年 第14期114卷 140501-140501页
作者: David Gosset Barbara M. Terhal Anna Vershynina Institute for Quantum Computing and Dept. of Combinatorics and Optimization University of Waterloo Ontario N2L 3G1 Canada JARA Institute for Quantum Information RWTH Aachen University 52056 Aachen North Rhine-Westphalia Germany
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabat... 详细信息
来源: 评论
A (quasi-)polynomial time heuristic algorithm for synthesizing T-dept. optimal circuits
arXiv
收藏 引用
arXiv 2021年
作者: Gheorghiu, Vlad Mosca, Michele Mukhopadhyay, Priyanka Institute for Quantum Computing University of Waterloo WaterlooON Canada softwareQ Inc. KitchenerON Canada Dept. of Combinatorics and Optimization University of Waterloo WaterlooON Canada Perimeter Institute for Theoretical Physics WaterlooON Canada
We investigate the problem of synthesizing T-dept. optimal quantum circuits over the Clifford+T gate set. First we construct a special subset of T-dept. 1 unitaries, such that it is possible to express the T-dept.-opt... 详细信息
来源: 评论
T-count and T-dept. of any multi-qubit unitary
arXiv
收藏 引用
arXiv 2021年
作者: Gheorghiu, Vlad Mosca, Michele Mukhopadhyay, Priyanka Institute for Quantum Computing University of Waterloo WaterlooON Canada softwareQ Inc. KitchenerON Canada Dept. of Combinatorics and Optimization University of Waterloo WaterlooON Canada Perimeter Institute for Theoretical Physics WaterlooON Canada
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to obtain the desired computational advantage. For most fault-tolerant quantum error-correcting codes the cost of implemen... 详细信息
来源: 评论
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems
arXiv
收藏 引用
arXiv 2021年
作者: Ding, Jintai Gheorghiu, Vlad Gilyén, András Hallgren, Sean Li, Jianqiang University of Cincinnati OH United States Institute for Quantum Computing Dept. of Combinatorics & Optimization University of Waterloo ON Canada Institute for Quantum Information and Matter Caltech PasadenaCA United States Department of Computer Science and Engineering Pennsylvania State University PA United States
Recently Chen and Gao [CG21] proposed a new quantum algorithm for Boolean polynomial system solving, motivated by the cryptanalysis of some post-quantum cryptosystems. The key idea of their approach is to apply a Quan... 详细信息
来源: 评论
Synthesis and Arithmetic of Single Qutrit Circuits
arXiv
收藏 引用
arXiv 2023年
作者: Kalra, Amolak Ratan Mosca, Michele Valluri, Dinesh Institute for Quantum Computing University of Waterloo WaterlooON Canada David R. Cheriton School of Computer Science University of Waterloo WaterlooON Canada Perimeter Institute for Theoretical Physics WaterlooON Canada Dept. of Combinatorics & Optimization University of Waterloo WaterlooON Canada
In this paper we study single qutrit circuits consisting of words over the Clifford+D cyclotomic gate set, where D = diag(±ξa, ±ξb, ±ξc), ξ is a primitive 9-th root of unity and a, b, c are integers... 详细信息
来源: 评论
SICS and algebraic number theory
arXiv
收藏 引用
arXiv 2017年
作者: Appleby, Marcus Flammia, Steven McConnell, Gary Yard, Jon Centre for Engineered Quantum Systems School of Physics University of Sydney Sydney Australia Center for Theoretical Physics Massachusetts Institute of Technology Cambridge United States Controlled Dynamics Theory Group Imperial College London United Kingdom Institute for Quantum Computing Dept. of Combinatorics and Optimization University of Waterloo Perimeter Institute for Theoretical Physics Waterloo Canada
We give an overview of some remarkable connections between symmetric informationally complete measurements (SIC-POVMs, or SICs) and algebraic number theory, in particular, a connection with Hilbert's 12th problem.... 详细信息
来源: 评论
Multi-qutrit exact synthesis
arXiv
收藏 引用
arXiv 2024年
作者: Kalra, Amolak Ratan Saikia, Manimugdha Valluri, Dinesh Winnick, Sam Yard, Jon Institute for Quantum Computing University of Waterloo WaterlooON Canada David R. Cheriton School of Computer Science University of Waterloo WaterlooON Canada Dept. of Combinatorics & Optimization University of Waterloo WaterlooON Canada Perimeter Institute for Theoretical Physics WaterlooON Canada Department of Mathematics University of Western Ontario LondonON Canada
We present an exact synthesis algorithm for qutrit unitaries in U3n([1/3, e2πi/3]) over the Clifford+T gate set with at most one ancilla. This extends the already known result of qutrit metaplectic gates being a subs...
来源: 评论