Polynomial time quantum computation with advice

被引：23
|
作者：
Nishimura, H [1 ]
Yamakami, T [1 ]
机构：
[1] Univ Ottawa, Sch Informat Technol & Engn, Peterborough, ON K1N 6N5, Canada
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 90卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
computational complexity; quantum circuit; advice function;
D O I：
10.1016/j.ipl.2004.02.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-effor probability. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：195 / 204
页数：10
相关论文
共 50 条
  • [1] Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
    Yamakami, Tomoyuki
    INFORMATION AND COMPUTATION, 2022, 286
  • [2] Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
    Yamakami, Tomoyuki
    Information and Computation, 2022, 286
  • [3] Advice Coins for Classical and Quantum Computation
    Aaronson, Scott
    Drucker, Andrew
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 61 - 72
  • [4] Hypercube quantum search: exact computation of the probability of success in polynomial time
    Pillin, Hugo
    Burel, Gilles
    Baird, Paul
    Baghious, El-Houssain
    Gautier, Roland
    QUANTUM INFORMATION PROCESSING, 2023, 22 (03)
  • [5] Hypercube quantum search: exact computation of the probability of success in polynomial time
    Hugo Pillin
    Gilles Burel
    Paul Baird
    El-Houssain Baghious
    Roland Gautier
    Quantum Information Processing, 22
  • [6] An arithmetic for polynomial-time computation
    Schwichtenberg, Helmut
    THEORETICAL COMPUTER SCIENCE, 2006, 357 (1-3) : 202 - 214
  • [7] Polynomial Time Computation in the Context of Recursive Analysis
    Gomaa, Walid
    FOUNDATIONAL AND PRACTICAL ASPECTS OF RESOURCE ANALYSIS, 2010, 6324 : 146 - 162
  • [8] On polynomial time computation over unordered structures
    Blass, A
    Gurevich, Y
    Shelah, S
    JOURNAL OF SYMBOLIC LOGIC, 2002, 67 (03) : 1093 - 1125
  • [9] Computation with Advice
    Brattka, Vasco
    Pauly, Arno
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (24): : 41 - 55
  • [10] Quantum Computation and Arrows of Time
    Argaman, Nathan
    ENTROPY, 2021, 23 (01) : 1 - 8
12345